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.     

High-speed tandem of MQW modulators for coded pulse generation with 14-dB fiber-to-fiber gain

We report on a tandem of electroabsorption modulators integrated with an amplifier by the identical active layer (IAL) approach. A 14 dB fiber-to-fiber is obtained by the use of constant As-P ratio MQW active layer and operation at 10 Gb/s is demonstrated. A record modulator saturation power of 35 mW is also reported.     

Comparison of 2D simultaneous multi-slice and 3D GRASE readout schemes for pseudo-continuous arterial spin labeling of cerebral perfusion at 3 T

Objective

In this perfusion magnetic resonance imaging study, the performances of different pseudo-continuous arterial spin labeling (PCASL) sequences were compared: two-dimensional (2D) single-shot readout with simultaneous multislice (SMS), 2D single-shot echo-planar imaging (EPI) and multishot three-dimensional (3D) gradient and spin echo (GRASE) sequences combined with a background-suppression (BS) module.

Materials and methods

Whole-brain PCASL images were acquired from seven healthy volunteers. The performance of each protocol was evaluated by extracting regional cerebral blood flow (rCBF) measures using an inline morphometric segmentation prototype. Image data postprocessing and subsequent statistical analyses enabled comparisons at the regional and sub-regional levels.

Results

The main findings were as follows: (i) Mean global CBF obtained across methods was were highly correlated, and these correlations were significantly higher among the same readout sequences. (ii) Temporal signal-to-noise ratio and gray-matter-to-white-matter CBF ratio were found to be equivalent for all 2D variants but lower than those of 3D-GRASE.

Discussion

Our study demonstrates that the accelerated SMS readout can provide increased acquisition efficiency and/or a higher temporal resolution than conventional 2D and 3D readout sequences. Among all of the methods, 3D-GRASE showed the lowest variability in CBF measurements and thus highest robustness against noise.

     

Magnebike: A magnetic wheeled robot with high mobility for inspecting complex‐shaped structures

This paper describes the Magnebike robot, a compact robot with two magnetic wheels in a motorbike arrangement, which is intended for inspecting the inner casing of ferromagnetic pipes with complex‐shaped structures. The locomotion concept is based on an adapted magnetic wheel unit integrating two lateral lever arms. These arms allow for slight lifting off the wheel in order to locally decrease the magnetic attraction force when passing concave edges, as well as laterally stabilizing the wheel unit. The robot has the main advantage of being compact (180 × 130 × 220 mm) and mechanically simple: it features only five active degrees of freedom (two driven wheels each equipped with an active lifter stabilizer and one steering unit). The paper presents in detail design and implementation issues that are specific to magnetic wheeled robots. Low‐level control functionalities are addressed because they are necessary to control the active system. The paper also focuses on characterizing and analyzing the implemented robot. The high mobility is shown through experimental results: the robot not only can climb vertical walls and follow circumferential paths inside pipe structures but it is also able to pass complex combinations of 90‐deg convex and concave ferromagnetic obstacles with almost any inclination regarding gravity. It requires only limited space to maneuver because turning on the spot around the rear wheel is possible. This high mobility enables the robot to access any location in the specified environment. Finally the paper analyzes the maximum payload for different types of environment complexities because this is a key feature for climbing robots and provides a security factor about the risk of falling and slipping. © 2009 Wiley Periodicals, Inc.     

Multilevel assessment method for reliable design of composite structures

This work aims at demonstrating the interest of a new methodology for the design and optimization of composite materials and structures. Coupling reliability methods and homogenization techniques allow the consideration of probabilistic design variables at different scales. The main advantage of such an original micromechanics-based approach is to extend the scope of solutions for engineering composite materials to reach or to respect a given reliability level. This approach is illustrated on a civil engineering case including reinforced fiber composites. Modifications of microstructural components properties, manufacturing process, and geometry are investigated to provide new alternatives for design and guidelines for quality control.     

Three‐dimensional localization for the MagneBike inspection robot

The MagneBike inspection robot is a climbing robot equipped with magnetic wheels. The robot is designed to drive on three‐dimensional (3D) complexly shaped pipe structures; therefore it is necessary to provide 3D visualization tools for the user, who remotely controls the robot out of sight. The localization system is required to provide a 3D map of the unknown environment and the 3D location of the robot in the environment's map. The localization strategy proposed in this paper consists of combining 3D odometry with 3D scan registration. The odometry model is based on wheel encoders and a three‐axis accelerometer. Odometry enables the tracking of the robot trajectory between consecutive 3D scans and is used as a prior for the scan matching algorithm. The 3D scan registration facilitates the construction of a 3D map of the environment and refines the robot position computed with odometry. This paper describes in detail the implementation of the localization concept. It presents the lightweight, small‐sized 3D range finder that has been developed for the MagneBike. It also proposes an innovative 3D odometry model that estimates the local surface curvature to compensate for the absence of angular velocity inputs. The different tools are characterized in detail based on laboratory and field experiments. They show that the localization concepts reliably track the robot moving in the specific application environment. We also describe various techniques to optimize the 3D scanning process, which is time consuming, and to compensate for the identified limitations. These techniques are useful inputs for the future automatization of the robot's control and optimization of its localization process. © 2010 Wiley Periodicals, Inc.     

Heuristics for the multi-period orienteering problem with multiple time windows

We present the multi-period orienteering problem with multiple time windows (MuPOPTW), a new routing problem combining objective and constraints of the orienteering problem (OP) and team orienteering problem (TOP), constraints from standard vehicle routing problems, and original constraints from a real-world application. The problem itself comes from a real industrial case. Specific route duration constraints result in a route feasibility subproblem. We propose an exact algorithm for this subproblem, and we embed it in a variable neighborhood search method to solve the whole routing problem. We then provide experimental results for this method. We compare them to a commercial solver. We also adapt our method to standard benchmark OP and TOP instances, and provide comparative tables with state-of-the-art algorithms.     

Computing efficiently the lattice width in any dimension

We provide an algorithm for the exact computation of the lattice width of a set of points K in Z² in linear-time with respect to the size of K. This method consists in computing a particular surrounding polygon. From this polygon, we deduce a set of candidate vectors allowing the computation of the lattice width. Moreover, we describe how this new algorithm can be extended to an arbitrary dimension thanks to a greedy and practical approach to compute a surrounding polytope. Indeed, this last computation is very efficient in practice as it processes only a few linear time iterations whatever the size of the set of points. Hence, it avoids complex geometric processings.     

A prismoid framework for languages with resources

Inspired by the Multiplicative Exponential fragment of Linear Logic, we define a framework called the prismoid of resources where each vertex is a language which refines the λ-calculus by using a different choice to make explicit or implicit (meta-level) the definition of the contraction, weakening, and substitution operations. For all the calculi in the prismoid we show simulation of β-reduction, confluence, preservation of β-strong normalisation and strong normalisation for typed terms. Full composition also holds for all the calculi of the prismoid handling explicit substitutions. The whole development of the prismoid is done by making the set of resources a parameter of the formalism, so that all the properties for each vertex are obtained as a particular case of the general abstract proofs.     

Generation of Efficient Nested Loops from Polyhedra

Automatic parallelization in the polyhedral model is based on affine transformations from an original computation domain (iteration space) to a target space-time domain, often with a different transformation for each variable. Code generation is an often ignored step in this process that has a significant impact on the quality of the final code. It involves making a trade-off between code size and control code simplification/optimization. Previous methods of doing code generation are based on loop splitting, however they have nonoptimal behavior when working on parameterized programs. We present a general parameterized method for code generation based on dual representation of polyhedra. Our algorithm uses a simple recursion on the dimensions of the domains, and enables fine control over the tradeoff between code size and control overhead.