Unraveling the mechanism of catalytic reactions through combined kinetic and thermodynamic analyses: Application to the condensation of ethanol

The combination of kinetic and thermodynamic analyses can provide an in-depth knowledge of the crucial steps of catalyzed reactions. Earlier examples are recalled to stress how a reaction mechanism can be supported or rejected based on trivial reactant and product concentration analyses. The method is then applied to the important reaction of alcohol condensation, the so-called Guerbet reaction, which enables converting ethanol, a renewable feedstock, into higher alcohols. Important conclusions regarding the design of ethanol condensation processes can be drawn, as the main reaction mechanism occurring at high temperatures (ca. 350–420 °C) appears to be different from that proposed at low temperatures (< 250 °C). In the former case, the pathway involving acetaldehyde is negligible, and therefore a multi-step process based on ethanol dehydrogenation followed by acetaldehyde self-aldolization would be irrelevant.     

Implementing a Two-Photon Three-Degrees-of-Freedom Hyper-Parallel Controlled Phase Flip Gate Through Cavity-Assisted Interactions

Hyper-parallel quantum information processing is a promising and beneficial research field. Herein, a method to implement a hyper-parallel controlled-phase-flip (hyper-CPF) gate for frequency-, spatial-, and time-bin-encoded qubits by coupling flying photons to trapped nitrogen vacancy (NV) defect centers is presented. The scheme, which differs from their conventional parallel counterparts, is specifically advantageous in decreasing against the dissipate noise, increasing the quantum channel capacity, and reducing the quantum resource overhead. The gate qubits with frequency, spatial, and time-bin degrees of freedom (DOF) are immune to quantum decoherence in optical fibers, whereas the polarization photons are easily disturbed by the ambient noise.     

Numerical integration of ordinary differential equations on manifolds

Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions” defined by nonvanishing Lie brackets.     

Aggregate error locator and error value computation in AG codes

The aggregate error locator is defined and a computation method is given. The aggregate error locator is then used in a type of Forney algorithm to compute the error values in the received words of a Ca,b algebraic geometry code.     

A thermodynamic approach with internal variables using Lagrange formalism. Part I: General framework

We present some reflections on the application of the Lagrangian formalism for continuous media locally uniform subjected to internal irreversible evolutions. The Lagrangian density, defined as the time derivative of a non-equilibrium thermodynamic potential, [Thermodynamics of Relaxation Processes using Internal variables within a Lagrange-formalism. P. Germain’s Anniversary Volume 2000. Contiuum Thermomechanics: the Art and Science of Modeling Matter’s Behaviour, 2000], contains all the symmetry properties of the system. The generalised Lagrange co-ordinates correspond to the state and internal variables of the time derivative of the generalised Gibbs potential. The latter being used within the framework of the De Donder’s method, must also account for the memory effect of the physical medium.This first part is devoted to the thermodynamic framework called the distribution of non-linear relaxations approach (DNLR) developed by C. Cunat on the basis of the generalised Gibbs’ relation.     

Thermodynamic study of sodium-iron oxides: Part II. Ternary phase diagram of the Na-Fe-O system

Studies on ternary phase diagrams of the Na-Fe-O system have been carried out from the thermodynamic point of view. Thermodynamic data of main ternary Na-Fe oxides Na₄FeO₃(s), Na₃FeO₃(s), Na₅FeO₄(s) and Na₈Fe₂O₇(s) have been assessed. A user database has been created by reviewing literature data together with recent DSC and vapor pressure measurements by the present authors. New ternary phase diagrams of the Na-Fe-O system have been constructed from room temperature to 1000 K. Stable conditions of the ternary oxides at 800 K were presented in predominance diagram as functions of oxygen pressure and sodium pressure.     

量子计算与超冷离子

通过介绍量子计算的基本概念和特点，并对比目前人们使用的计算机的计算方式，对于如何利用囚禁在离子阱中的超冷离子进行量子计算作了简要的叙述．     

On Binary Computation Structures

Based on a modification of Moss' and Parikh's topological modal language [8], we study a generalization of a weakly expressive fragment of a certain propositional modal logic of time. We define a bimodal logic comprising operators for knowledge and nexttime. These operators are interpreted in binary computation structures. We present an axiomatization of the set T of theorems valid for this class of semantical domains and prove – as the main result of this paper – its completeness. Moreover, the question of decidability of T is treated.     

Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered.