Viewfinder Alignment

The viewfinder of a digital camera has traditionally been used for one purpose: to display to the user a preview of what is seen through the camera's lens. High quality cameras are now available on devices such as mobile phones and PDAs, which provide a platform where the camera is a programmable device, enabling applications such as online computational photography, computer vision‐based interactive gaming, and augmented reality. For such online applications, the camera viewfinder provides the user's main interaction with the environment. In this paper, we describe an algorithm for aligning successive viewfinder frames. First, an estimate of inter‐frame translation is computed by aligning integral projections of edges in two images. The estimate is then refined to compute a full 2D similarity transformation by aligning point features. Our algorithm is robust to noise, never requires storing more than one viewfinder frame in memory, and runs at 30 frames per second on standard smartphone hardware. We use viewfinder alignment for panorama capture, low‐light photography, and a camera‐based game controller.     

Verification of evolving software via component substitutability analysis

This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniques for checking correctness of software upgrades: (1) a technique based on simultaneous use of over-and under-approximations obtained via existential and universal abstractions; (2) a dynamic assume-guarantee reasoning algorithm—previously generated component assumptions are reused and altered on-the-fly to prove or disprove the global safety properties on the updated system. When upgrades are found to be non-substitutable, our solution generates constructive feedback to developers showing how to improve the components. The substitutability approach has been implemented and validated in the ComFoRT reasoning framework, and we report encouraging results on an industrial benchmark. This is an extended version of a paper, Dynamic Component Substitutability Analysis, published in the Proceedings of the Formal Methods 2005 Conference, Lecture Notes in Computer Science, vol. 3582, by the same authors. This research was sponsored by the National Science Foundation under grant nos. CNS-0411152, CCF-0429120, CCR-0121547, and CCR-0098072, the Semiconductor Research Corporation under grant no. TJ-1366, the US Army Research Office under grant no. DAAD19-01-1-0485, the Office of Naval Research under grant no. N00014-01-1-0796, the ICAST project and the Predictable Assembly from Certifiable Components (PACC) initiative at the Software Engineering Institute, Carnegie Mellon University. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of any sponsoring institution, the US government or any other entity.     

A Deep Learning Approach to Detection and Mitigation of Distributed Denial of Service Attacks in High Availability Intelligent Transport Systems

Mobile Networks and Applications - In the era of Internet of Things (IoT) powered by 5G technologies, Automobile Industry is headed towards a revolution. In Intelligent Transport Systems (ITS),...     

Building a speech recognition system with privacy identification information based on Google Voice for social robots

The Journal of Supercomputing - Currently, many smart speakers, even social robots, appear on the market to help people's lives become more convenient. Usually, people use smart speakers to...     

Biocompatible antimicrobial cotton fibres for healthcare industries: a biogenic approach for synthesis of bio‐organic‐coated silver nanoparticles

Cotton fibres coated with biogenically fabricated silver nanoparticles (SNPs) are most sought material because of their enhanced activity and biocompatibility. After successful synthesis of SNPs on cotton fibres using leaf extract of Vitex negundo Linn, the fibres were studied using diffuse reflectance spectroscopy, scanning electron microscopy, nanoparticle tracking analysis, energy dispersive X‐ray, and inductively coupled plasma atomic emission spectrometry. The characterisation revealed uniformly distributed spherical agglomerates of SNPs having individual particle size around 50 nm with the deposition load of 423 μg of silver per gram of cotton. Antimicrobial assay of cotton–SNPs fibres showed effective performance against pathogenic bacteria and fungi. The method is biogenic, environmentally benign, rapid, and cost‐effective, producing highly biocompatible antimicrobial coating required for the healthcare industry.Inspec keywords: cotton, health care, nanoparticles, coatings, silver, fibres, nanofabrication, scanning electron microscopy, X‐ray chemical analysis, atomic emission spectroscopy, plasma applications, microorganisms, biotechnologyOther keywords: biocompatible antimicrobial cotton fibre coating, healthcare industry, bioorganic‐coated silver nanoparticle synthesis, biogenically fabricated silver nanoparticle, SNP, leaf extraction, Vitex negundo Linn, diffuse reflectance spectroscopy, scanning electron microscopy, nanoparticle tracking analysis, energy dispersive X‐ray spectrometry, inductively coupled plasma atomic emission spectrometry, uniformly distributed spherical agglomerate, antimicrobial assay, pathogenic bacteria, fungi, Ag     

A hybrid approach based on SERVQUAL and fuzzy TOPSIS for evaluating transportation service quality

Managing service quality is vital to retain customer satisfaction and augment revenues for any business organization. Often it is difficult to assess service quality due to lack of quantifiable measures and limited data. In this paper, we present a hybrid approach based on SERVQUAL and fuzzy TOPSIS for evaluating service quality of urban transportation systems. The proposed approach consists of three steps. The first step involves development of a SERVQUAL based questionnaire to collect data for measuring transportation service quality. The participants provide linguistic assessments to rate the service quality criteria and the alternatives. In step 2, the linguistic ratings are combined through fuzzy TOPSIS to generate an overall performance score for each alternative. The alternative with the highest score is finally chosen. In step 3, sensitivity analysis is conducted to evaluate the influence of criteria weights on the decision making process.The strength of the proposed approach is its practical applicability and ability to provide solution under partial or lack of quantitative information. An application of the proposed approach for evaluation of service quality of metro in Montreal is provided.     

A model checking-based approach for security policy verification of mobile systems

This article describes an approach for the automated verification of mobile systems. Mobile systems are characterized by the explicit notion of location (e.g., sites where they run) and the ability to execute at different locations, yielding a number of security issues. To this aim, we formalize mobile systems as Labeled Kripke Structures, encapsulating the notion of location net that describes the hierarchical nesting of the threads constituting the system. Then, we formalize a generic security-policy specification language that includes rules for expressing and manipulating the code location. In contrast to many other approaches, our technique supports both access control and information flow specification. We developed a prototype framework for model checking of mobile systems. It works directly on the program code (in contrast to most traditional process-algebraic approaches that can model only limited details of mobile systems) and uses abstraction-refinement techniques, based also on location abstractions, to manage the program state space. We experimented with a number of mobile code benchmarks by verifying various security policies. The experimental results demonstrate the validity of the proposed mobile system modeling and policy specification formalisms and highlight the advantages of the model checking-based approach, which combines the validation of security properties with other checks, such as the validation of buffer overflows.     

The Dynamics of Syntactic Knowledge

The syntactic approach to epistemic logic avoids the logicalomniscience problem by taking knowledge as primary rather thanas defined in terms of possible worlds. In this study, we combinethe syntactic approach with modal logic, using transition systemsto model reasoning. We use two syntactic epistemic modalities:‘knowing at least’ a set of formulae and ‘knowingat most’ a set of formulae. We are particularly interestedin models restricting the set of formulae known by an agentat a point in time to be finite. The resulting systems are investigatedfrom the point of view of axiomatization and complexity. Weshow how these logics can be used to formalise non-omniscientagents who know some inference rules, and study their relationshipto other systems of syntactic epistemic logics, such as Ågotnesand Walicki (2004, Proc. 2nd EUMAS, pp. 1–10), Alechinaet al. (2004, Proc. 3rd AAMAS, pp. 601–613), Duc (1997,J. Logic Comput., 7, 633–648).     

Stochastic communication for application-specific Networks-on-Chip

In this paper, we have developed analytical stochastic communication technique for inter and intra-Networks-on-Chip (NoC) communication. It not only separates the computation and communication in Networks-in-Package (NiP) but also predicts the communication performance. Moreover, it will help in tracking of the lost data packets and their exact location during the communication. Further, the proposed technique helps in building the Closed Donor Controlled Based Compartmental Model, which helps in building Stochastic Model of NoC and NiP. This model helps in computing the transition probabilities, latency, and data flow from one IP to other IP in a NoC and among NoCs in NiP. From the simulation results, it is observed that the transient and steady state response of transition probabilities give state of data flow latencies among the different IPs in NoC and among the compartments of NoCs in NiP. Furthermore, the proposed technique produces low latency as compared to the latencies being produced by the existing topologies.