Pulsatile Flow in Microfluidic Systems

This review describes the current knowledge and applications of pulsatile flow in microfluidic systems. Elements of fluid dynamics at low Reynolds number are first described in the context of pulsatile flow. Then the practical applications in microfluidic processes are presented: the methods to generate a pulsatile flow, the generation of emulsion droplets through harmonic flow rate perturbation, the applications in mixing and particle separation, and the benefits of pulsatile flow for clog mitigation. The second part of the review is devoted to pulsatile flow in biological applications. Pulsatile flows can be used for mimicking physiological systems, to alter or enhance cell cultures, and for bioassay automation. Pulsatile flows offer unique advantages over a steady flow, especially in microfluidic systems, but also require some new physical insights and more rigorous investigation to fully benefit future applications.     

A kernel machine for hidden object-ranking problems (HORPs)

Hidden Object-Ranking Problems (HORPs) are object-ranking problems stated as classification or instance-ranking problems. There exists so far no dedicated algorithm for solving them properly and HORPs are usually solved as if they were classification (multi-class or ordinal) or instance-ranking problems. In the former case, item-related ordinal information is negated and only class-related information is retained; in the latter case, item-related ordinal information is considered, but in a way that emphasizes class-related information, so that the items are not only sorted but also clustered. We propose a kernel machine that allows retaining item-related ordinal information while avoiding emphasizing class-related information. We show how this kernel machine can be implemented with standard optimization libraries provided slight modifications on the original kernel. The proposed approach is tested on Tahitian pearls quality assessment and compared with four other classical methods. It yields better results (93.6% ±?3.9% of correct predictions without feature selection, 94.3% ±?3.4% with feature selection) than the best of the other tested methods (91.3% ±?3.4% and 92.6% ±?4.3% without and with feature selection for the instance-ranking approach), this improvement being significant (p-value <?0.05). Moreover, this method exhibits no significant difference in the results with and without feature selection (p-value =?0.33), which may be a hint that its learning bias fits the problem well and can thus alleviate the data preprocessing workload.

     

Experimental and theoretical study of the adsorption of pure molecules and binary systems containing methane, carbon monoxide, carbon dioxide and nitrogen. Application to the syngas generation

This study takes place in the context of the use of a Synthesis Gas in Gas To Liquid process, liquid hydrocarbon production by conversion based on Fischer–Tropsch synthesis. Our aim is the process improvement by a selective recycling of the tail gas. So, we measure pure component isotherms for four gases (CO₂, CH₄, CO, N₂) of the tail gas until 2000 kPa and binary mixture (CO₂–CH₄; CO₂–N₂; CH₄–N₂) equilibria at 303.15 K and 400 and 950 kPa onto a ZSM-5 zeolite. We also predict the binary mixture equilibria by the Ideal Adsorbed Solution Theory (IAST) and the Vacancy Solution Model (VSM, Flory–Huggins and Wilson forms) and we obtain very good results. So not only binary mixture equilibria but also ternary and quaternary mixture adsorption can be predicted. With these data (experimental and simulated), we can conclude that the CO₂ is the most adsorbed component while N₂ is the least one. These two components can be separated from CH₄ and CO which are sent in the Synthesis Gas production step.     

连铸板坯鼓肚变形与宏观偏析的有限元分析

鼓肚变形及因变形引起的中心线偏析是影响板坯质量的重要因素.法国冶金部和一些企业组织了优化钢铁生产的项目,采用数值方法研究和优化连铸工艺.介绍了巴黎高等矿业学校在连铸过程数值仿真方面的研究成果.     

Biotin synthesis in higher plants: purification and characterization of bioB gene product equivalent from Arabidopsis thaliana overexpressed in Escherichia coli and its subcellular localization in pea leaf cells

Biotin synthase catalyses the final step in the biotin biosynthetic pathway and is encoded by the bioB gene in Escherichia coli. To investigate the conversion of dethiobiotin to biotin in the plant kingdom, the cDNA encoding the bioB gene product equivalent from Arabidopsis thaliana was used to construct an E. coli overexpression strain. The purified A. thaliana bioB gene product is a homodimer (100 kDa) with a reddish color and has an absorbance spectrum characteristic of protein with [2Fe-2S] clusters. Its intracellular compartmentation in pea leaves discloses a unique polypeptide of 39 kDa within the matrix of mitochondria.     

Occurrence and numerical prediction of surface defects during flanging of metallic sheets

Surface defects can develop on automotive exterior panels after drawing and flanging steps, during springback and may alter significantly the vehicle quality. These defects are characterized by a small depth below 0.5 mm and are then difficult to detect numerically. This study focuses on the surface defects for two parts: an industrial upper corner of a front door and a L-shaped part designed on purpose to reproduce at a small scale surface defects that occur after flanging. Dimensions of these defects are measured from profiles obtained either with a non-contacting method or a tridimensional measuring machine. Numerical simulations of the processes are performed with the commercial codes PamStamp2G or Abaqus and deformed meshes are analyzed in the same way as the experimental data. There is a good correlation between experiments and simulations concerning the spatial position of the defect and their dimensions. Moreover, a buckling analysis during springback is performed for the L-shaped part, showing that the position of the defect corresponds to one of the buckling mode.     

Risk Assessment for One-Counter Threads

Threads as contained in a thread algebra are used for the modeling of sequential program behavior. A thread that may use a counter to control its execution is called a ‘one-counter thread’. In this paper the decidability of risk assessment (a certain form of action forecasting) for one-counter threads is proved. This relates to Cohen’s impossibility result on virus detection (Comput. Secur. 6(1), 22–35, 1984). Our decidability result follows from a general property of the traces of one-counter threads: if a state is reachable from some initial state, then it is also reachable along a path in which all counter values stay below a fixed bound that depends only on the initial and final counter value. A further consequence is that the reachability of a state is decidable. These properties are based on a result for ω-one counter machines by Rosier and Yen (SIAM J. Comput. 16(5), 779–807, 1987).     

A generalization of ACP using Belnap’s logic

ACP is combined with Belnap’s four-valued logic via conditional composition (if–then–else). We show that the operators of ACP can be seen as instances of more general, conditional operators. For example, both the choice operator + and δ (deadlock) can be seen as instances of conditional composition, and the axiom x + δ = x follows from this perspective. Parallel composition is generalized to the binary conditional merge _ψ where covers the choice between interleaving and synchronization, and ψ determines the order of execution. The instance _BB is ACP’s parallel composition, where B (both) is the truth value that models both true and false in Belnap’s logic. Other instances of this conditional merge are sequential composition, pure interleaving and synchronous merge. We investigate the expression of scheduling strategies in the conditions of the conditional merge.     

Potentialités des séquences d’étalement chaotiques pour l’amélioration duTEEB d’un systèmeDS-CDMA asynchrone

The use of chaotic sequences as spectral spreading sequences in a Direct Sequence-Code Division Multiple Access is proposed in this paper. The simulation of the system is performed with the system simulator Omnisys. The chaotic spreading sequences are generated from a non-linear recursive equation. The Bit Error Rate of this system is compared with theBER of the same system using binary Gold sequences. The results show that chaotic sequences can improve performances in terms of allowable number of users.