Well-structured languages

This paper introduces the notion of well-structured language. A well-structured language can be defined by a labelled well-structured transition system, equipped with an upward-closed set of accepting states. That peculiar class of transition systems has been extensively studied in the field of computer-aided verification, where it has direct an important applications. Petri nets, and their monotonic extensions (like Petri nets with non-blocking arcs or Petri nets with transfer arcs), for instance, are special subclasses of well-structured transition systems. We show that the class of well-structured languages enjoy several important closure properties. We propose several pumping lemmata that are applicable respectively to the whole class of well-structured languages and to the classes of languages recognized by Petri nets or Petri nets with non-blocking arcs. These pumping lemmata allow us to characterize the limits in the expressiveness of these classes of language. Furthermore, we exploit the pumping lemmata to strictly separate the expressive power of Petri nets, Petri nets with non-blocking arcs and Petri nets with transfer arcs.     

System integration of high voltage electrostatic MEMS actuators

A system integration for High Voltage (HV) electrostatic MicroElectroMechanical Systems (MEMS) actuators is introduced on a micro-Printed Circuit Board. The system includes a programmable microcontroller, a programmable DC/DC converter, a multi output HV interface and electrostatic MEMS actuators. The system produces high output voltages (10–300 V) and can control a large variety of MEMS capacitive loads (1 to 50 pF) by combining diverse semiconductor technologies. This system proves that technologies, such as low voltage CMOS of different processes, high voltage DMOS and MEMS, can interact, communicate and even be integrated as a System In Package (SIP), providing significant size and cost reductions. The system was programmed to control electrostatic MEMS actuator. The DC/DC converter was made from components of different technologies and two addressable high voltage CMOS interfaces were fabricated with DALSA's 0.8 μm High Voltage process. A prototype of the global system has been built and tested.     

Packing spherical discrete elements for large scale simulations

We introduce a new geometric method to generate sphere packings with restricted overlap values. Sample generation is an important, but time-consuming, step that precedes a calculation performed with the discrete element method (DEM). At present, there does not exist any software dedicated to DEM which would be similar to the mesh software that exists for finite element methods (FEM). A practical objective of the method is to build very large sphere packings (several hundreds of thousands) in a few minutes instead of several days as the current dynamic methods do. The developed algorithm uses a new geometric procedure to position very efficiently the polydisperse spheres in a tetrahedral mesh. The algorithm, implemented into YADE-OPEN DEM (open-source software), consists in filling tetrahedral meshes with spheres. In addition to the features of the tetrahedral mesh, the input parameters are the minimum and maximum radii (or their size ratio), and the magnitude of authorized overlaps. The filling procedure is stopped when a target solid fraction or number of spheres is reached. Based on this method, an efficient tool can be designed for DEMs used by researchers and engineers. The generated packings can be isotropic and the number of contacts per sphere is very high due to its geometric procedure. In this paper, different properties of the generated packings are characterized and examples from real industrial problems are presented to show how this method can be used. The current C++ version of this packing algorithm is part of YADE-OPEN DEM [20] available on the web (https://yade-dem.org).     

A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine

This paper introduces a tabu search heuristic for a production scheduling problem with sequence-dependent and time-dependent setup times on a single machine. The problem consists in scheduling a set of dependent jobs, where the transition between two jobs comprises an unrestricted setup that can be performed at any time, and a restricted setup that must be performed outside of a given time interval which repeats daily in the same position. The setup time between two jobs is thus a function of the completion time of the first job. The tabu search heuristic relies on shift and swap moves, and a surrogate objective function is used to speed-up the neighborhood evaluation. Computational experiments show that the proposed heuristic consistently finds better solutions in less computation time than a recent branch-and-cut algorithm. Furthermore, on instances where the branch-and-cut algorithm cannot find the optimal solution, the heuristic always identifies a better solution.     

An improved observation model for super-resolution under affine motion.

Super-resolution (SR) techniques make use of subpixel shifts between frames in an image sequence to yield higher resolution images. We propose an original observation model devoted to the case of nonisometric inter-frame motion as required, for instance, in the context of airborne imaging sensors. First, we describe how the main observation models used in the SR literature deal with motion, and we explain why they are not suited for nonisometric motion. Then, we propose an extension of the observation model by Elad and Feuer adapted to affine motion. This model is based on a decomposition of affine transforms into successive shear transforms, each one efficiently implemented by row-by-row or column-by-column one-dimensional affine transforms. We demonstrate on synthetic and real sequences that our observation model incorporated in a SR reconstruction technique leads to better results in the case of variable scale motions and it provides equivalent results in the case of isometric motions.     

Synthesis of poly(methyl methacrylate)-g-poly(dimethyl siloxane) graft copolymers via a miniemulsion process

Summary In this article, we describe the synthesis of a PMMA-g-PDMS graft copolymer via a miniemulsion process. A highly hydrophobic PDMS macromonomer was copolymerized in the presence of MMA. Latex particles were obtained with a high yield and a complete incorporation of the macromonomer by using AIBN as initiator, SDS as a surfactant and a PMMA-b-PEO block copolymer as a cosurfactant, with a given amount of methanol in order to reduce the interfacial tension. The characterization of the resulting latex by ¹H NMR and QELS evidenced the interest of such a process in order to copolymerize monomers with very different solubilities and to obtain directly a graft copolymer in aqueous dispersion. Received: 12 March 2001/ Revised version: 15 September 2001/ Accepted: 15 September 2001     

A reference-calibration method for tenderness perception using psychophysical models

A main advantage of the reference-calibration method is the use of the standard references with the scale values to establish the relationship between sensory and instrumental data which is then used to predict sensory attributes of unknown samples. This study was conducted to predict tenderness perception using instrumental methods through a reference-calibrated model. Chicken breast fillets deboned at 9 different times were cooked and instrumentally tested by a compression test. The fillets were also evaluated by 7 trained panelists. Three different psychophysical models were employed to correlate reference scores with the peak forces and to predict tenderness. The results showed that the Stevens and Beidler models fitted well the peak forces to the reference scores. After calibration, the models were used to predict tenderness scores for all the fillets. This study implied that references could be used to calibrate not only panelists but also instruments for predicting tenderness perception.     

Three-dimensional analysis of a compression test on stone wool

A full three-dimensional (3D) study of a compression test on a sample made of stone wool is presented. The analysis combines different tools, namely X-ray microtomography of an in situ experiment, image acquisition and treatment, and volume correlation. This set of tools allows for the measurement of 3D displacement fields and enables Poisson’s ratio of this type of material to be evaluated. The strain fields are used to analyze localization phenomena. The uncertainty of the analysis is evaluated by actually moving the sample in its undeformed and deformed states, qualifying both image acquisition and correlation steps.     

A stochastic method for Bayesian estimation of hidden Markov random field models with application to a color model.

We propose a new stochastic algorithm for computing useful Bayesian estimators of hidden Markov random field (HMRF) models that we call exploration/selection/estimation (ESE) procedure. The algorithm is based on an optimization algorithm of O. Fran?ois, called the exploration/selection (E/S) algorithm. The novelty consists of using the a posteriori distribution of the HMRF, as exploration distribution in the E/S algorithm. The ESE procedure computes the estimation of the likelihood parameters and the optimal number of region classes, according to global constraints, as well as the segmentation of the image. In our formulation, the total number of region classes is fixed, but classes are allowed or disallowed dynamically. This framework replaces the mechanism of the split-and-merge of regions that can be used in the context of image segmentation. The procedure is applied to the estimation of a HMRF color model for images, whose likelihood is based on multivariate distributions, with each component following a Beta distribution. Meanwhile, a method for computing the maximum likelihood estimators of Beta distributions is presented. Experimental results performed on 100 natural images are reported. We also include a proof of convergence of the E/S algorithm in the case of nonsymmetric exploration graphs.