排序方式: 共有3条查询结果,搜索用时 0 毫秒
1
1.
2.
Aline Gardez Ghassen Saidani Ludovic Biennier Robert Georges Edouard Hugo Vijayanand Chandrasekaran Vivien Roussel Bertrand Rowe K. P. J. Reddy E. Arunan 《国际化学动力学杂志》2012,44(11):753-766
More than 70 molecules of varied nature have been identified in the envelopes of carbon‐rich stars through their spectral fingerprints in the microwave or far infrared regions. Many of them are carbon chain molecules and radicals, and a significant number are unique to the circumstellar medium. The determination of relevant laboratory kinetics data is critical to keep up with the development of the high spectral and spatial resolution observations and of the refinement of chemical models. Neutral–neutral reactions of the CN radical with unsaturated hydrocarbons could be a dominant route in the formation of cyanopolyynes, even at low temperatures and deserve a detailed laboratory investigation. The approach we have developed aims to bridge the temperature gap between resistively heated flow tubes and shock tubes. The present kinetic measurements are obtained using a new reactor combining a high‐enthalpy source with a flow tube and a pulsed laser photolysis–laser‐induced fluorescence system to probe the undergoing chemical reactions. The high‐enthalpy flow tube has been used to measure the rate constant of the reaction of the CN radical with propane (C3H8), propene (C3H6), allene (C3H4), 1,3‐butadiene (1,3‐C4H6), and 1‐butyne (C4H6) over a temperature range extending from 300 to 1200 K. All studied reactions of CN with unsaturated hydrocarbons are rapid, with rate coefficients greater than 10?10 cm3 · molecule?1 · s?1 and exhibit slight negative temperature dependence above room temperature. © 2012 Wiley Periodicals, Inc. Int J Chem Kinet 44: 753–766, 2012 相似文献
3.
Alain Billionnet Fethi Jarray Ghassen Tlig Ezzedine Zagrouba 《Journal of Mathematical Modelling and Algorithms》2013,12(4):329-343
We consider the problem of reconstructing two-dimensional convex binary matrices from their row and column sums with adjacent ones. Instead of requiring the ones to occur consecutively in each row and column, we maximize the number of adjacent ones. We reformulate the problem by using integer programming and we develop approximate solutions based on linearization and convexification techniques. 相似文献
1