Left invertibility,flatness and identifiability of switched linear dynamical systems: a framework for cryptographic applications

The purpose of this article is to illustrate the potential interest of the control theory framework for cryptographic applications. It is shown that under the properties of left invertibility and flatness, dynamical systems are structurally equivalent to some specific cryptographic primitives called self-synchronising stream ciphers. After having motivated the interest of considering hybrid systems for such ciphers, the development is particularised for the special class of switched linear systems. We also show that identifiability is a necessary condition for security, and we describe an identification procedure as a possible attack and assess its complexity.     

Poisson Skeleton Revisited: a New Mathematical Perspective

This paper is concerned with the computation of the skeleton of a shape Ω included in ?². We show some connections between the Euclidean distance function d to ?Ω and the solution u of the Poisson problem Δu(x)=?1 if x is in Ω and u(x)=0 if x is on ?Ω. This enables us to propose a new and fast algorithm to compute an approximation of the skeleton of ?Ω. We illustrate the approach with some numerical experiments.     

CRIM’s content-based audio copy detection system for TRECVID 2009

We report results on audio copy detection for TRECVID 2009 copy detection task. This task involves searching for transformed audio queries in over 385?h of test audio. The queries were transformed in seven different ways, three of them involved mixing unrelated speech to the original query, making it a much more difficult task. We give results with two different audio fingerprints and show that mapping each test frame to the nearest query frame (nearest-neighbor fingerprint) results in robust audio copy detection. The most difficult task in TRECVID 2009 was to detect audio copies using predetermined thresholds computed from 2008 data. We show that the nearest-neighbor fingerprints were robust to even this task and gave actual minimal normalized detection cost rate (NDCR) of around 0.06 for all the transformations. These results are close to those obtained by using the optimal threshold for each transform. This result shows the robustness of the nearest-neighbor fingerprints. These nearest-neighbor fingerprints can be efficiently computed on a graphics processing unit, leading to a very fast search.     

Pairwise testing for software product lines: comparison of two approaches

Software Product Lines (SPL) are difficult to validate due to combinatorics induced by variability, which in turn leads to combinatorial explosion of the number of derivable products. Exhaustive testing in such a large products space is hardly feasible. Hence, one possible option is to test SPLs by generating test configurations that cover all possible t feature interactions (t-wise). It dramatically reduces the number of test products while ensuring reasonable SPL coverage. In this paper, we report our experience on applying t-wise techniques for SPL with two independent toolsets developed by the authors. One focuses on generality and splits the generation problem according to strategies. The other emphasizes providing efficient generation. To evaluate the respective merits of the approaches, measures such as the number of generated test configurations and the similarity between them are provided. By applying these measures, we were able to derive useful insights for pairwise and t-wise testing of product lines.     

On-column solvent exchange for purified preparative fractions

On-column solvent exchange, using many of the principles of solid-phase extraction, has been implemented to significantly reduce evaporation cycle time following reverse-phase preparative HPLC. Additional benefits, such as a reduced potential for salt formation, thermal decomposition, and residual solvent, are also described. Fractions obtained from preparative separations, typically in a large volume of acetonitrile:water, are injected into the preparative HPLC and then eluted in acetonitrile, creating a new fraction in a volatile organic solvent. Minimal modification to the instrument was required, and unattended operation is possible. Acetonitrile evaporation is achieved within 3 h, compared with 17 h for aqueous-based fractions; lower temperatures can be used during the evaporation step; mobile-phase additives, likely to form salts with the target compound if concentrated in the fraction, are removed before evaporation; sample recovery and purity are unaffected.     

Uniqueness of the Perfect Fusion Grid on ℤ d

Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In a graph, merging two regions, separated by a set of vertices, is not straightforward. The perfect fusion graphs defined in J. Cousty et al. (J. Math. Imaging Vis. 30:(1):87–104, 2008) verify all the basic properties required by region merging algorithms as used in image segmentation. Unfortunately, the graphs which are the most frequently used in image analysis (namely, those induced by the direct and the indirect adjacency relations) are not perfect fusion graphs. The perfect fusion grid, introduced in the above mentioned reference, is an adjacency relation on ℤ ^d which can be used in image analysis, which indeed induces perfect fusion graphs and which is “between” the graphs induced by the direct and the indirect adjacencies. One of the main results of this paper is that the perfect fusion grid is the only such graph whatever the dimension d.

Estimation of catchment-scale water-balance with a soil-vegetation-atmosphere transfer model

Catchments with a small elevation range and relatively long dry periods in high radiation conditions may be described as an array of vertical one-dimensional pathways for water and energy. Such a representation enhances the ability of SVAT modeling to simulate mass exchanges across the catchment. This note reports on a comparison of a Soil-Vegetation-Atmosphere Transfer (SVAT) model (Braud et al., 1995), a deterministic hydrological model (Dawes and Hatton, 1993) and a stochastic hydrological model (Sivapalan and Woods, 1995; Kalma et al., 1995). The original version of the SVAT model only considers vertical transport and this one-dimensional representation must be aggregated to describe the entire catchment. Therefore, two new versions have been developed: a deterministic SVAT model which sub-divides the catchment into 40 sub-regions linked by surface flow, and a stochastic model which provides a distribution of the output fluxes as related to the spatial distribution of initial water content and/or soil properties. All simulations have been made for a 60-day period.     

Correlation between machining direction,cutter geometry and step-over distance in 3-axis milling: Application to milling by zones

Computer-Aided Manufacturing (CAM) occupies an increasingly important role in engineering with all it has to offer in terms of new possibilities and improving designer/manufacturer productivity. The present study addresses machining of free-form surfaces on a 3-axis NC machine tool. There have recently been a large number of studies devoted to planning tool paths on free-form surfaces with various strategies being adopted. These strategies are intended to increase efficiency by reducing the overall length of machining. Often, the choice of the cutter is arbitrary and the work focuses on planning. In order to boost productivity, the present work offers assistance in choosing the cutting tool, the machining direction and cutting by surface zones, adopting a milling strategy by parallel planes. To do so, a comparison is made between milling using a spherical end milling cutter and a torus end milling cutter with the same outer radius. This comparison relates to the radius of curvature of the trace left by the cutter at the point of contact between the tool and the workpiece in relation to the direction of feed motion.     

JaTS: a fully portable seismic tomography software based on Fresnel wavepaths and a probabilistic reconstruction approach

JaTS, a Java 2D seismic tomography software, is presented. It implements original algorithms achieving optimal accuracy with reasonable computing costs. A second-order Fast Marching Method (FMM) is used for solving the eikonal equation, therefore enabling a fast and robust computation of seismic traveltimes between sources and receivers. The wavepaths are materialized by Fresnel volumes rather than by conventional rays. This approach accounts for complex velocity models and has the advantage of considering the effects of the wave frequency in the velocity model resolution. The model is computed by a Simultaneous Iterative Reconstruction Technique (SIRT) which has been reformulated to integrate Fresnel wavepaths by using a probabilistic approach. In addition, various utilities are implemented, such as a tapering filter, used to decrease artifact effects occurring in the vicinity of the sources and receivers. The software also offers the possibility of reconstructing the velocity field on a grid larger than the one used for the wave propagation computation. This contributes to stabilize the estimated values. All of the seismic processing tools have been integrated with a user-friendly graphical interface. JaTS represents a tightly integrated tool suite that supports the entire process of importing the SG2 field records, first-break picking, forward modeling and velocity-field computing across multiple platforms.     

Powerful Parallel and Symmetric 3D Thinning Schemes Based on Critical Kernels

The main contribution of the present article consists of new 3D parallel and symmetric thinning schemes which have the following qualities:

They are effective and sound, in the sense that they are guaranteed to preserve topology. This guarantee is obtained thanks to a theorem on critical kernels;

They are powerful, in the sense that they remove more points, in one iteration, than any other symmetric parallel thinning scheme;

They are versatile, as conditions for the preservation of geometrical features (e.g., curve extremities or surface borders) are independent of those accounting for topology preservation;

They are efficient: we provide in this article a small set of masks, acting in the grid ?³, that is sufficient, in addition to the classical simple point test, to straightforwardly implement them.