基于XPS对硫铁矿去除SeO2-3的机理研究

硒是动植物及人体生长必需的十五种微量元素之一，具有清除体内自由基、抗氧化、增强免疫力等功能，但其安全剂量的范围却很窄。利用扫描电子显微镜（SEM）和X射线衍射仪（XRD）对湿法球磨制备的硫铁矿形貌进行了表征。SEM观测发现加乙醇助磨后的硫铁矿为粒径大小较均匀的球形颗粒团聚体，粒径范围在17～200 nm之间，平均粒径138 nm。XRD衍射图谱中的特征峰与FeS₂衍射图谱中各峰位置基本一致，因此判定硫铁矿中主要化学组分为FeS₂，且图谱中基本没有杂峰，表明制备过程中并未混入杂质，样品纯度较高。实验结果表明，该法制备的硫铁矿具有颗粒粒径小、比表面积大、反应活性高等优点。研究中利用X射线光电子能谱仪（XPS）对硫铁矿去除水体中SeO2-₃的机理进行了研究。研究结果表明, （1）在较为广泛的实验pH范围（pH 2.2～11.5），硫铁矿均能有效去除水体中SeO2-₃，去除效率（除pH值7.8以外）均达到90%以上；（2）硫铁矿与SeO2-₃发生反应后，其主要组成元素的XPS特征峰结合能有所减小，表明硫铁矿表面发生了一定化学变化；（3）酸碱环境下硫铁矿去除SeO2-₃的机理不完全相同，酸性环境下，硫铁矿对SeO2-₃的去除是单纯的氧化还原过程，即硫铁矿中被酸活化的S2-₂将SeO2-₃还原为单质Se(0)，并且酸性越强，SeO2-₃去除效果越好；碱性环境下，SeO2-₃的去除过程中氧化还原与络合反应并存，硫铁矿表面有络合态Fe(OH)SeO₃和单质Se(0)两种存在形态，且碱性越强，络合态Fe(OH)SeO₃含量越高。以上研究结果为硫铁矿去除固定水体和土壤中以SeO2-₃为代表的可变价金属阴离子提供重要理论依据和应用基础。     

The character and the wave front set correspondence in the stable range

We relate the distribution characters and the wave front sets of unitary representation for real reductive dual pairs of type I in the stable range.     

Microstructural stability and age-hardening behavior of Re-added dual two-phase Ni3Al and Ni3V intermetallic alloys

The effect of Re addition on the microstructure and hardening behaviour of the dual two-phase Ni₃Al (L1₂) and Ni₃V (D0₂₂) intermetallic alloy was investigated by scanning electron microscopy, transmission electron microscopy and Vickers hardness test. The two-phase eutectoid microstructure accompanying the Re-rich precipitates were observed in the channel region of the alloys in which Re substituted for Ni but not in those in which Re substituted for Al and V. The concomitant addition of Nb (or Ta) with Re more stabilized the two-phase eutectoid microstructure and consequently more induced the fine precipitates in the channel region. The annealing at temperatures below the eutectoid temperature was necessary to induce the fine precipitates in the channel region and thereby result in the precipitation hardening. The fine precipitation in the channel region and related hardening was attributed to the alloying feature so that Re is soluble in the A1 (fcc) phase at high temperatures and becomes less soluble in the two intermetallic phases decomposed from the A1 phase at low temperatures.     

Enlargement of the Wiener filtration by an absolutely continuous random variable via Malliavin’s calculus

Summary. The analytic treatment of problems related to the asymptotic behaviour of random dynamical systems generated by stochastic differential equations suffers from the presence of non-adapted random invariant measures. Semimartingale theory becomes accessible if the underlying Wiener filtration is enlarged by the information carried by the orthogonal projectors on the Oseledets spaces of the (linearized) system. We study the corresponding problem of preservation of the semimartingale property and the validity of a priori inequalities between the norms of stochastic integrals in the enlarged filtration and norms of their quadratic variations in case the random element F enlarging the filtration is real valued and possesses an absolutely continuous law. Applying the tools of Malliavin’s calculus, we give smoothness conditions on F under which the semimartingale property is preserved and a priori martingale inequalities are valid. Received: 12 April 1995 / In revised form: 7 March 1996     

Optimality of the double exponential formula – functional analysis approach –

Summary. In the light of the functional analysis theory we establish the optimality of the double exponential formula. The argument consists of the following three ingredients: (1) introduction of a number of spaces of functions analytic in a strip region about the real axis, each space being characterized by the decay rate of their elements (functions) in the neighborhood of the infinity; (2) proof of the (near-) optimality of the trapezoidal formula in each space introduced in (1) by showing the (near-) equality between an upper estimate for the error norm of the trapezoidal formula and a lower estimate for the minimum error norm of quadratures; (3) nonexistence theorem for the spaces, the characterizing decay rate of which is more rapid than the double exponential. Received September 15, 1995 / Accepted December 14, 1995     

Numerical methods for finding multiple eigenvalues of matrices depending on parameters

Summary. Let be a square matrix dependent on parameters and , of which we choose as the eigenvalue parameter. Many computational problems are equivalent to finding a point such that has a multiple eigenvalue at . An incomplete decomposition of a matrix dependent on several parameters is proposed. Based on the developed theory two new algorithms are presented for computing multiple eigenvalues of with geometric multiplicity . A third algorithm is designed for the computation of multiple eigenvalues with geometric multiplicity but which also appears to have local quadratic convergence to semi-simple eigenvalues. Convergence analyses of these methods are given. Several numerical examples are presented which illustrate the behaviour and applications of our methods. Received December 19, 1994 / Revised version received January 18, 1996     

Reducing systems of linear differential equations to a passive form

In this paper, an application of the Riquer-Thomas-Janet theory is described for the problem of transforming a system of partial differential equations into a passive form, i.e., to a special form which contains explicitly both the equations of the initial system and all their nontrivial differential consequences. This special representation of a system markedly facilitates the subsequent integration of the corresponding differential equations. In this paper, the modern approach to the indicated problem is presented. This is the approach adopted in the Knuth-Bendix procedure [13] for critical-pair/completion and then Buchberger's algorithm for completion of polynomial ideal bases [13] (or, alternatively, for the construction of Groebner bases for ideals in a differential operator ring [14]). The algorithm of reduction to the passive form for linear system of partial differential equations and its implementation in the algorithmic language REFAL, as well as the capabilities of the corresponding program, are outlined. Examples illustrating the power and efficiency of the system are presented.