Removal of Carbamazepine in Aqueous Solution by CoS2/Fe2+/PMS Process

Carbamazepine (CBZ), as a typical pharmaceutical and personal care product (PPCP), cannot be efficiently removed by the conventional drinking water and wastewater treatment process. In this work, the CoS₂/Fe²⁺/PMS process was applied for efficient elimination of CBZ. The CBZ removal efficiency of CoS₂/Fe²⁺/PMS was 2.5 times and 23 times higher than that of CoS₂/PMS and Fe²⁺/PMS, respectively. The intensity of DMPO-HO• and DMPO-SO4•− followed the order of Fe²⁺/PMS < CoS₂/PMS < CoS₂/Fe²⁺/PMS, also suggesting the CoS₂/Fe²⁺/PMS process has the highest oxidation activity. The effects of reaction conditions (e.g., CoS₂ dosage, Fe²⁺ concentration, PMS concentration, initial CBZ concentration, pH, temperature) and water quality parameters (e.g., SO42−, NO3−, H2PO4−, Cl−, NH4+, humic acid) on the degradation of CBZ were also studied. Response surface methodology analysis was carried out to obtain the best conditions for the removal of CBZ, which are: Fe²⁺ = 70 µmol/L, PMS = 240 µmol/L, CoS₂ = 0.59 g/L. The sustainability test demonstrated that the repeated use of CoS₂ for 8 successive cycles resulted in little function decrease (<10%). These findings suggest that CoS₂/Fe²⁺/PMS may be a promising method for advanced treatment of tailwater from sewage treatment plant.     

继电器动态过程中动态参数的测试方法

本文介绍了一种测试继电器在动态过程中动态参数测试的方法。采用此方法能直接测量和观察继电器动态过程中的线圈电压、电流 ,同时可测出继电器的动作时间 ,还可了解其接点在接触过程是否有振动现象存在。所以 ,此方法是一种多用途的继电器动态参数测量方法     

Stationary states of crystal growth in three dimensions

A new Markov process describing crystal growth in three dimensions is introduced. States of the process are configurations of the crystal surface, which has a terrace-edge-kink structure. The states are continuous along edges but discrete across edges, in accordance with the very different rates for the two types of captures of particles. Stationary distributions, describing steady crystal growth, are found in general. To our knowledge, these are the first examples of stationary distributions for layered crystal growth in three dimensions. The steady growth rate and other quantities are obtained explicitly for two interacting edges. For many interacting edges, growth behavior is determined (a) in various asymptotic regimes including thermodynamic limits, (b) via simulations, and (c) using series (cluster) expansions in the slope of the surface, the first three coefficients being computed. The theoretical growth rates show a marked dependence on surface dimensions. This may contribute to the size dependence and dispersion in the observed growth rate of small crystals.     

辐射在CH泡沫中传输的数值模拟

利用一维多群辐射输运程序对辐射在CH泡沫中的传输过程进行了数值模拟,给出一些细致的物理图像和定量结果。在一定的入射辐射流条件下,密度变化对辐射传输特征、辐射加热介质的热力学平衡弛豫过程有重要影响。随着密度下降,辐射由亚声速传输转变为超声速传输,辐射在传输过程中的能谱形状也不同。     

Analysis of Natural Convection During Solidification of a Pure Metal

A numerical study of solidification of gallium in a closed cavity is presented and the influence of natural convection on phase change is investigated.

The mathematical formulation is based on the enthalpy-porosity method, while the equations are discretized on a fixed grid by means of a finite volume technique. Advancing in time is obtained using the SIMPLE algorithm, while the solution of the elliptic equation for pressure correction is obtained by means of a preconditioned BI-CGStab method.

As a test case a square cavity with Ra ranging from 4.68 × 10³ to 9.36 × 10⁵ is adopted. Results will be presented in terms of streamlines, isotherms, solid-liquid interface position and Nu and compared, when possible with available data.     

Exact results for the asymmetric simple exclusion process with a blockage

We present new results for the current as a function of transmission rate in the one-dimensional totally asymmetric simple exclusion process (TASEP) with a blockage that lowers the jump rate at one site from one tor<1. Exact finitevolume results serve to bound the allowed values for the current in the infinite system. This proves the existence of a nonequilibrium phase transition, corresponding to an immiscibility gap in the allowed values of the asymptotic densities which the infinite system can have in a stationary state. A series expansion inr, derived from the finite systems, is proven to be asymptotic for all sufficiently large systems. Padé approximants based on this series, which make specific assumptions about the nature of the singularity atr=1, match numerical data for the infinite system to 1 part in 10⁴.     

Regenerative queueing processes and their qualitative and quantitative analysis

Recently developed methods of qualitative analysis for regenerative processes arising in queueing are presented. These methods are essentially qualitative and use notions such as coupling, probability metrics, etc. They are developed for studying various properties of regenerative models, including convergence rate to a stationary regime, continuity of their characteristics with respect to some parameters and first-occurrence time of an event such as queue overflowing. In spite of their qualitative nature they lead to good quantitative estimates of underlying properties with computer methods available to calculate them.     

Optimization technique based on learning automata

Optimization techniques are finding increasingly numerous applications in process design, in parallel to the increase of computer sophistication. The process synthesis problem can be stated as a largescale constrained optimization problem involving numerous local optima and presenting a nonlinear and nonconvex character. To solve this kind of problem, the classical optimization methods can lead to analytical and numerical difficulties. This paper describes the feasibility of an optimization technique based on learning systems which can take into consideration all the prior information concerning the process to be optimized and improve their behavior with time. This information generally occurs in a very complex analytical, empirical, or know-how form. Computer simulations related to chemical engineering problems (benzene chlorination, distillation sequence) and numerical examples are presented. The results illustrate both the performance and the implementation simplicity of this method.Nomenclature c _i penalty probability - cp precision parameter on constraints - D variation domain of the variablex - f(·) objective function - g(·) constraints - i,j indexes - k iteration number - N number of actions - P probability distribution vector - p _i ith component of the vectorP as iterationk - r number of reactors in the flowsheet - u(k) discrete value or action chosen by the algorithm at iterationk - u _i discrete value of the optimization variable in [u _min,u _max] - u _min lowest value of the optimization variable - u _max largest value of the optimization variable - Z random number - x variable for the criterion function - xp precision parameter on criterion function - W(k) performance index unit output at iterationk - ₀, ₁ reinforcement scheme parameters - _p sum of the probability distribution vector components     

Deterministic equivalent for a continuous-time linear-convex stochastic control problem

We consider a finite-horizon control model with additive input. There are two convex functions which describe the running cost and the terminal cost within the system. The cost of input is proportional to the input and can take both positive and negative values. It is shown that there exists a deterministic control problem whose optimal cost is the same as the one in the stochastic control problem. The optimal policy for the stochastic problem consists of keeping the process as close to the optimal deterministic trajectory as possible.This research is supported by NSERC Grant A4619, MRCO, NSF Grant DMS-86-01510, and AFOSR Grant 87-0278.     

On the height of random m-ary search trees

A random m-ary seach tree is constructed from a random permutation of 1,…, n. A law of large numbers is obtained for the height H_n of these trees by applying the theory of branching random walks. in particular, it is shown that H_n/log n→γ in probability as n→∞ where γ = γ(m) is a constant depending upon m only. Interestingly, as m→∞, γ(m) is asymptotic to 1/log m, the coefficient of log n in the asymptotic expression for the height of the complete m-ary search tree. This proves that for large m, random m-ary search trees behave virtually like complete m-ary trees.