Geopolymer assembly by emulsion templating: Emulsion stability and hardening mechanisms

This work investigates emulsion templating to synthesize hexadecane oil/geopolymer composites. In a system with hexadecane as the internal (dispersed) phase and an alkali activated continuous phase without added surfactant, adding aluminosilicate clay particles does not increase resistance against creaming or coalescence, while adding a surfactant (L35 or CTAB) stabilizes the solid-liquid interface. Infrared studies and rheological studies of the associated geopolymerization determined that the presence of the organic phase or surfactant has no significant effect on the geopolymerization kinetics, as determined by the change in time of the Si-O-T IR stretching frequency and the rheological moduli involved during the process. The stabilization of the organic template is reminiscent of Pickering emulsion even though we employ a much greater amount of inorganic material for geopolymer formation. Although the addition of surfactant has a significant effect on the behavior of the paste, the percolation of the network remains unmodified, highlighting the fact that the phenomenon is not dependent on viscosity. Finally, rheological measurements were used to obtain the mass fractal dimension of the as-made gel network, which is able to differentiate the interfacial effect between surfactant molecules with a slightly denser interphase when a cationic surfactant is used.     

Microscale and mesoscale discrete models for dynamic fracture of structures built of brittle material

In this work we present the discrete models for dynamic fracture of structures built of brittle materials. The models construction is based on Voronoi cell representation of the heterogeneous structure, with the beam lattice network used to model the cohesive and compressive forces between the neighboring cells. Each lattice component is a geometrically exact shear deformable beam which can describe large rigid body motion and the most salient fracture mechanisms. The latter can be represented through the corresponding form of the beam constitutive equations, which are derived either at microscale with random distribution of material properties or at a mesoscale with average deterministic values. The proposed models are also placed within the framework of dynamics, where special attention is paid to constructing the lattice network mass matrix as well as the corresponding time-stepping schemes. Numerical simulations of compression and bending tests is given to illustrate the models performance.     

FDTD simulation of 30 /spl mu/m diameter polymer micro-ring

Numerical results on polymer surrounded by an air micro-ring coupled to waveguides are presented. The FDTD method predicts a filter width of 1.4 nm and an extraction efficiency of almost 80% for a gap of 0.15 /spl mu/m.     

Linearly bounded infinite graphs

Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs. These automata naturally accept the same languages as the linearly bounded machines defining them. We present some of their structural properties as well as alternative characterizations in terms of rewriting systems and context-sensitive transductions. Finally, we compare these graphs to rational graphs, which are another class of automata accepting the context-sensitive languages, and prove that in the bounded-degree case, rational graphs are a strict sub-class of linearly bounded graphs.A preliminary version of this article appeared in MFCS 2005.     

Multi-heuristic scheduling: three approaches to tune compromises

Most of the available industrial schedulers are based on a simulation approach using dispatching rules. These rules are often dedicated to the satisfaction of a single performance criterion, and are used whatever the characteristics of the workshop or of the set of jobs. An approach which allows one to bring in compromises between rules is set out in this paper. These compromises can be parametered in accordance with the objectives of the workshop and the characteristics of the jobs in order to introduce some reactivity in the decision system. Three ways to set up the parameters are compared: experimental design, fuzzy expert system and neural network. The method allowing one to define compromises can be implemented on each scheduler that uses a simulation approach. Tests have been made with an industrial scheduler called SIPAPLUS, the results of which are developed in this paper.     

A multiparameter wearable physiologic monitoring system for space and terrestrial applications.

A novel, unobtrusive and wearable, multiparameter ambulatory physiologic monitoring system for space and terrestrial applications, termed LifeGuard, is presented. The core element is a wearable monitor, the crew physiologic observation device (CPOD), that provides the capability to continuously record two standard electrocardiogram leads, respiration rate via impedance plethysmography, heart rate, hemoglobin oxygen saturation, ambient or body temperature, three axes of acceleration, and blood pressure. These parameters can be digitally recorded with high fidelity over a 9-h period with precise time stamps and user-defined event markers. Data can be continuously streamed to a base station using a built-in Bluetooth RF link or stored in 32 MB of on-board flash memory and downloaded to a personal computer using a serial port. The device is powered by two AAA batteries. The design, laboratory, and field testing of the wearable monitors are described.     

Learning hierarchical probabilistic logic programs

Machine Learning - Probabilistic logic programming (PLP) combines logic programs and probabilities. Due to its expressiveness and simplicity, it has been considered as a powerful tool for learning...     

A CP framework for testing CP

The success of several constraint-based modeling languages such as OPL, ZINC or COMET, appeals for better software engineering practices, particularly in the testing phase. This paper introduces a testing framework enabling automated test case generation for constraint programming. We propose a general framework of constraint program development which supposes that a first declarative and simple constraint model is available from the problem specifications analysis. Then, this model is refined using classical techniques such as constraint reformulation, surrogate, redundant, implied, global constraint and symmetry-breaking to form an improved constraint model that must be thoroughly tested before being used to address real-sized problems. We think that most of the faults are introduced in this refinement step and propose a process which takes the first declarative model as an oracle for detecting non-conformities and derive practical test purposes from this process. We implemented this approach in a new tool called CPTEST that was used to automatically detect non-conformities on classical benchmark programs, such as the Golomb rulers, n-queens, social golfer and the car-sequencing problems.