A Secure Correspondent Router Protocol for NEMO Route Optimization

The Network Mobility (NEMO) protocol is needed to support the world-wide mobility of aircraft mobile networks across different access networks in the future IPv6 based aeronautical telecommunications network (ATN). NEMO suffers from the constraint that all traffic has to be routed via the home agent though. The already existing correspondent router (CR) protocol solves this triangular routing problem and permits to route packets on a direct path between the mobile network and the ground based correspondent nodes. We identify security deficiencies of this protocol that make it unsuitable for use within the ATN. We therefore propose a new route optimization procedure based on the CR protocol that provides a higher level of security. We evaluate our new protocol in three ways. We first conduct a simulation based handover performance study using an implementation of a realistic aeronautical access technology. We then investigate the mobility signaling overhead. Finally, we specify a threat model applicable for the aeronautical environment and use it to perform a security analysis of both the old and our new protocol. It is shown that our protocol is not only more secure but also provides better handover latency, smaller overhead in the aeronautical scenario and a higher level of resilience when compared to the original CR protocol.     

Motion Planning with Pulley, Rope, and Baskets

We study a motion planning problem where items have to be transported from the top room of a tower to the bottom of the tower, while simultaneously other items have to be transported in the opposite direction. Item sets are moved in two baskets hanging on a rope and pulley. To guarantee stability of the system, the weight difference between the contents of the two baskets must always stay below a given threshold. We prove that it is $\varPi_{2}^{p}$ -complete to decide whether some given initial situation of the underlying discrete system can lead to a given goal situation. Furthermore we identify several polynomially solvable special cases of this reachability problem, and we also settle the computational complexity of a number of related questions.     

Non-encapsulated thermo-liquid crystals for digital particle tracking thermography/velocimetry in microfluidics

The ever accelerating state of technology has powered an increasing interest in heat transfer solutions and process engineering innovations in the microfluidics domain. In order to carry out such developments, reliable heat transfer diagnostic techniques are necessary. Thermo-liquid crystal (TLC) thermography, in combination with particle image velocimetry, has been a widely accepted and commonly used technique for the simultaneous measurement and characterization of temperature and velocity fields in macroscopic fluid flows for several decades. However, low seeding density, volume illumination, and low TLC particle image quality at high magnifications present unsurpassed challenges to its application to three-dimensional flows with microscopic dimensions. In this work, a measurement technique to evaluate the color response of individual non-encapsulated TLC particles is presented. A Shirasu porous glass membrane emulsification approach was used to produce the non-encapsulated TLC particles with a narrow size distribution and a multi-variable calibration procedure, making use of all three RGB and HSI color components, as well as the proper orthogonally decomposed RGB components, was used to achieve unprecedented low uncertainty levels in the temperature estimation of individual particles, opening the door to simultaneous temperature and velocity tracking using 3D velocimetry techniques.     

Towards enhancing the security and accuracy of iris recognition systems

The intricate structure of the iris constitutes a powerful biometric characteristic utilized by iris recognition algorithms to extract discriminative biometric templates. Iris recognition is field-proven but consequential issues, e.g. privacy protection or recognition in unconstrained environments, still to be solved, raise the need for further investigations. In this paper different improvements focused on template protection and biometric comparators are presented. Experimental evaluations are performed on a public dataset confirming the soundness of proposed enhancements.     

Towards long term monitoring of electrodermal activity in daily life

Manic depression, also known as bipolar disorder, is a common and severe form of mental disorder. The European research project MONARCA aims at developing and validating mobile technologies for multi-parametric, long term monitoring of physiological and behavioral information relevant to bipolar disorder. One aspect of MONARCA is to investigate the long term monitoring of Electrodermal activity (EDA) to support the diagnosis and treatment of bipolar disorder patients. EDA is known as an indicator of the emotional state and the stress level of a person. To realize a long-term monitoring of the EDA, the integration of the sensor system in the shoe or sock is a promising approach. This paper presents a first step towards such a sensor system. In a feasibility study including 8 subjects, we investigate the correlation between EDA measurements at the fingers, which is the most established sensing site, with measurements of the EDA at the feet. The results indicate that 88% of the evoked skin conductance responses (SCRs) occur at both sensing sites. When using an action movie as psychophysiologically activating stimulus, we have found weaker reactivity in the foot than in the hand EDA. The results also suggest that the influence of moderate physical activity on EDA measurements is low and has a similar effect for both recording sites. This suggests that the foot recording location is suitable for recordings in daily life even in the presence of moderate movement.     

Geometry based pre-processor for parallel fluid dynamic simulations using a hierarchical basis

The pre-processing stage of finite element analysis of the Navier–Stokes equations is becoming increasingly important as the desire for more general boundary conditions, as well as applications to parallel computers increases. The set up of general boundary conditions and communication structures for parallel computations should be accomplished during the pre-processing phase of the analysis, if possible, to ensure efficient computations for large scale problems in computational fluid dynamics. This paper introduces a general methodology for geometry based boundary condition application and pre-computing of parallel communication tasks. A. K. Karanam was supported by NSF Grant No. 9985340. C. H. Whiting was supported by a grant from NASA LaRC.     

An ant colony optimization algorithm for DNA sequencing by hybridization

The reconstruction of DNA sequences from DNA fragments is one of the most challenging problems in computational biology. In recent years the specific problem of DNA sequencing by hybridization has attracted quite a lot of interest in the optimization community. Several metaheuristics such as tabu search and evolutionary algorithms have been applied to this problem. However, the performance of existing metaheuristics is often inferior to the performance of recently proposed constructive heuristics. On the basis of these new heuristics we develop an ant colony optimization algorithm for DNA sequencing by hybridization. An important feature of this algorithm is the implementation in a so-called multi-level framework. The computational results show that our algorithm is currently a state-of-the-art method for the tackled problem.     

Rapid convergence to feature layer correspondences

We describe a neural network able to rapidly establish correspondence between neural feature layers. Each of the network's two layers consists of interconnected cortical columns, and each column consists of inhibitorily coupled subpopulations of excitatory neurons. The dynamics of the system builds on a dynamic model of a single column, which is consistent with recent experimental findings. The network realizes dynamic links between its layers with the help of specialized columns that evaluate similarities between the activity distributions of local feature cell populations, are subject to a topology constraint, and can gate the transfer of feature information between the neural layers. The system can robustly be applied to natural images, and correspondences are found in time intervals estimated to be smaller than 100 ms in physiological terms.     

Partial Partitions,Partial Connections and Connective Segmentation

In connective segmentation (Serra in J. Math. Imaging Vis. 24(1):83–130, [2006]), each image determines subsets of the space on which it is “homogeneous”, in such a way that this family of subsets always constitutes a connection (connectivity class); then the segmentation of the image is the partition of space into its connected components according to that connection. Several concrete examples of connective segmentations or of connections on sets, indicate that the space covering requirement of the partition should be relaxed. Furthermore, morphological operations on partitions require the consideration of wider framework. We study thus partial partitions (families of mutually disjoint non-void subsets of the space) and partial connections (where connected components of a set are mutually disjoint but do not necessarily cover the set). We describe some methods for generating partial connections. We investigate the links between the two lattices of partial connections and of partial partitions. We generalize Serra’s characterization of connective segmentation and discuss its relevance. Finally we give some ideas on how the theory of partial connections could lead to improved segmentation algorithms.