Gas–liquid partition coefficients and Henry's law constants of methyl mercaptan in aqueous solutions of Fe(II)–CDTA chelate complex

Utilization of ferric chelate complex of trans-1,2-cyclohexanediaminetetraacetic acid (CDTA) for the oxidative scrubbing of H₂S and CH₃SH in Kraft mill streams can be beneficial from the standpoints of iron protection against precipitation and oxygen-mediated regenerative oxidation of the ferrous chelate CDTA. The physical solubility of methyl mercaptan in CDTA–Fe(III) complex cannot be measured directly because of oxidation of the sulfur-bearing gaseous species with the ferric chelate. Therefore, this investigation was carried out to determine the gas–liquid partition coefficients and Henry's law constants of methyl mercaptan in aqueous iron-free CDTA solutions and non-reacting ferrous chelate solutions (CDTA–Fe(II) complex), using the static headspace method with an estimated accuracy of about 2%. Experiments with aqueous solutions of chelate concentrations varying between 38 and 300 mol m⁻³ were carried out at temperatures between 298 and 333 K and atmospheric pressure. It was shown that the methyl mercaptan solubility decreases with increasing temperature for all systems but was not much influenced, in the studied conditions, by the chelate concentration especially at larger temperatures.     

Aqueous solubilities and octanol-water partition coefficients of binary liquid mixtures of organic compounds at 25°C

From thermodynamics and certain assumptions it is shown that, under the usual experimental conditions, the octanol-water partition coefficient (K_o/w) of a given organic liquid should be the same whether the substance is partitioned neat or as part of a mixture. Measurements of several mixtures of n-propylbenzene (log K_o/w=3.71±0.04)+ethylbenzene (log K_o/w=3.16±0.01) clearly confirm this. It is also shown that the aqueous solubility (S_w) of a neat organic liquid can be related to its aqueous solubility (S _w ), when it is present at volume fraction in an organic liquid mixture, by S _w =S_w, where is its activity coefficient in the organic mixture. The measured S _w values for n-propylbenzene + ethylbenzene (1), n-hexane + nitrobenzene (>1) and di-isopropyl ether + chloroform (<1) are found to be in good agreement with the predicted values (average differences of, respectively, <2%, 8% and 6%). In general, the bounds on S _w are expected to be 0w w.     

有限型的首次返回例外集的测度和维数北大核心CSCD

设M=(m_(ij))是一个b×b阶矩阵且m_(ij)∈{0,1},∑_(M)是矩阵M=(m_(ij))诱导产生的有限型,σ是其上左推移算子.本文主要研究的是有限型动力系统(∑_(M),σ)上的首次返回速度问题.令τ_(k)(x)是点x∈∑_(M)首次返回到包含x的k阶柱集时间,且E_(α,β)={x∈∑_(M):lim inf_(k→∞)(logτ_(k)(x))/k=α,lim sup_(k→∞)(logτ_(k)(x))/k=β}.我们证明了:当M是不可约矩阵时,对任意0≤α≤β≤+∞,集合E_(α,β)的Markov测度要么等于0要么等于1并且具有满的Hausdorff维数.     

Covering projective planar graphs with three forests

It is known that all planar graphs and all projective planar graphs have an edge partition into three forests. Gonçalves proved that every planar graph has an edge partition into three forests, one having maximum degree at most four [5]. In this paper, we prove that every projective planar graph has an edge partition into three forests, one having maximum degree at most four.     

Set controllability of Markov jump switching Boolean control networks and its applications

In this article, a novel method is proposed for investigating the set controllability of Markov jump switching Boolean control networks (MJSBCNs). Specifically, the switching signal is described as a discrete-time homogeneous Markov chain. By resorting to the expectation and switching indicator function, an expectation system is constructed. Based on the expectation system, a novel verifiable condition is established for solving the set reachability of MJSBCNs. With the newly obtained results on set reachability, a necessary and sufficient condition is further derived for the set controllability of MJSBCNs. The obtained results are applied to Boolean control networks with Markov jump time delays. Examples are demonstrated to justify the theoretical results.     

The nearest neighbor random walk on subspaces of a vector space and rate of convergence

LetX be the collection ofk-dimensional subspaces of ann-dimensional vector spaceV _n overGF(q). A metric may be defined onX by letting

Determination of the partition coefficients of the nonionic detergent C12E7 between lipid-detergent mixed membranes and water by means of Laurdan fluorescence spectroscopy

The membrane-water partition coefficient of the detergent C₁₂E₇ between water and C₁₂E₇/POPC mixed membranes has been determined by means of steady-state fluorescence spectroscopy. The emission spectra of the fluorescent probe Laurdan were used as an indicator of membrane composition at different membrane concentrations in the sample. The partition coefficient expressed as the ratio of the mole fractions of the detergent in the membrane and water phases is about 6^*10⁵ at low molar ratios of C₁₂E₇/POPC (R _c ) and decreases rapidly with increasingR _c . The limiting detergent content of the lamellar phase (R _c ^* >0.8) is indicated by a minimum ofP(R _c ).     

Optimality of a Threshold Policy in theM/M/ queue with repeated vacations

Consider anM/M/1 queueing system with server vacations where the server is turned off as soon as the queue gets empty. We assume that the vacation durations form a sequence of i.i.d. random variables with exponential distribution. At the end of a vacation period, the server may either be turned on if the queue is non empty or take another vacation. The following costs are incurred: a holding cost ofh per unit of time and per customer in the system and a fixed cost of each time the server is turned on. We show that there exists a threshold policy that minimizes the long-run average cost criterion. The approach we use was first proposed in Blanc et al. (1990) and enables us to determine explicitly the optimal threshold and the optimal long-run average cost in terms of the model parameters.     

On two--block--factor sequences and one--dependence

The distributions of two--block--factors arising from i.i.d. sequences are observed to coincide with the distributions of the superdiagonals of jointly exchangeable and dissociated arrays . An inequality for superdiagonal probabilities of the arrays is presented. It provides, together with the observation, a simple proof of the fact that a special one--dependent Markov sequence of Aaronson, Gilat and Keane (1992) is not a two--block factor.

     

The matched queueing network PH/M/c→oPH/PH/1

We consider a matched queueing network PH/M/coPH/PH/1, where the output of the first subsystem PH/M/c is regarded as one of the inputs of the second subsystem and matched with another input of PH-renewal process, and they are served by a single server with PH-service-distribution. The stationary state probabilities, the distribution of the virtual waiting times in the two subsystems, and the distribution of the total virtual waiting time are derived.The work was supported by the Max-Planck-Gesellschaft, Germany, and the Chinese Academy ofSciences.