Hop chains: Secure routing and the establishment of distinct identities

We present a secure routing protocol that is immune to Sybil attacks and that can tolerate collusion of Byzantine routers. It can tolerate either initial collusion of Byzantine routers or runtime collusion of non-adjacent Byzantine routers, both in the absence of runtime collusion between adjacent routers. For these settings, the calculated distance from a destination to a node is not smaller than the actual shortest distance from the destination to the node. The protocol can also simultaneously tolerate initial collusion of Byzantine routers and runtime collusion of adjacent Byzantine routers but in the absence of runtime collusion between non-adjacent routers. For this setting, it guarantees a bound on the difference between the calculated distance and the actual shortest distance. The bound depends on the number of Byzantine routers on a path. The protocol makes very weak timing assumptions and requires synchronization only between neighbors or second neighbors. We propose to use this protocol for secure localization of routers using hop-count distances, which can be then used as a proof of identity of nodes.     

Output feedback regulation of upper triangular nonlinear systems with uncertain time‐varying delays in states and input

In this paper, an output feedback controller is studied to regulate a class of upper triangular nonlinear systems with uncertain time‐varying delays. The key features of our considered system are that there are uncertain time‐varying delays in both states and input and the high‐order nonlinearity is in a more relaxed form over the previous results. Theoretical analysis and numerical example are presented to show the benefits of our controller. Copyright © 2017 John Wiley & Sons, Ltd.     

Enhanced image similarity analysis system in digital pathology

Multimedia Tools and Applications - In digital pathology, image similarity algorithms are used to find cancer in tissue cells from medical images. However, it is very difficult to apply image...     

Schemes generating entangled states and entanglement swapping between photons and three-level atoms inside optical cavities for quantum communication

We propose quantum information processing schemes based on cavity quantum electrodynamics (QED) for quantum communication. First, to generate entangled states (Bell and Greenberger–Horne–Zeilinger [GHZ] states) between flying photons and three-level atoms inside optical cavities, we utilize a controlled phase flip (CPF) gate that can be implemented via cavity QED). Subsequently, we present an entanglement swapping scheme that can be realized using single-qubit measurements and CPF gates via optical cavities. These schemes can be directly applied to construct an entanglement channel for a communication system between two users. Consequently, it is possible for the trust center, having quantum nodes, to accomplish the linked channel (entanglement channel) between the two separate long-distance users via the distribution of Bell states and entanglement swapping. Furthermore, in our schemes, the main physical component is the CPF gate between the photons and the three-level atoms in cavity QED, which is feasible in practice. Thus, our schemes can be experimentally realized with current technology.     

Constraint-based test generation for automotive operating systems

This work suggests a method for systematically constructing a software-level environment model for safety checking automotive operating systems by introducing a constraint specification language, OSEK_CSL. OSEK_CSL is designed to specify the usage constraints of automotive operating systems using a pre-defined set of constraint types identified from the international standard OSEK/VDX. Each constraint specified in OSEK_CSL is interpreted as either a regular language or a context-free language that can be checked by a finite automaton or a pushdown automaton. The set of usage constraints is used to systematically classify the universal usage model of OSEK-/VDX-based operating systems and to generate test sequences with varying degrees of constraint satisfaction using LTL model checking. With pre-defined constraint patterns and the full support of automation, test engineers can choose the degree of constraint satisfaction and generate test cases using combinatorial intersections of selected constraints that cover all corner cases classified by constraints. A series of experiments on an open-source automotive operating system show that our approach finds safety issues more effectively than conventional specification-based testing, scenario-based testing, and conformance testing.     

Supply chain coordination with risk sensitive retailer under target sales rebate

Target sales rebate (TSR) contracts have been shown to be useful in coordinating supply chains with risk-neutral agents. However, there have been few studies on the cases with risk sensitive agents. As a result, based on the classic Markowitz portfolio theory in finance, we carry out in this paper a mean–variance (MV) analysis of supply chains under TSR contracts. We study a supply chain with a single supplier and a single risk averse retailer. We propose TSR contracts for achieving coordination. We demonstrate how TSR contracts can coordinate the supply chain which takes into consideration the degree of risk aversion of the retailer. We find that the supplier can coordinate the channel with flexible TSR contracts. In addition, we extend the supply chain model to include sales effort decision of the retailer. Conditions for TSR contracts to coordinate the supply chain with sales effort of retailer are also derived.     

Face recognition based on 2D images under illumination and pose variations

We propose a novel 2D image-based approach that can simultaneously handle illumination and pose variations to enhance face recognition rate. It is much simpler, requires much less computational effort than the methods based on 3D models, and provides a comparable or better recognition rate.