Orientation and alignment of reagent molecules by two-photon excitation

The expressions used for describing the angular distribution of oriented and aligned reagent molecules are derived. The algebraic forms of orientation and alignment parameters of molecules in the excited states are obtained for two-photon excitation. The reagent molecules after absorbing two-photon may produce the higher order orientation and alignment than doing one-photon. (C) 2002 Elsevier Science B.V. All rights reserved.

Modelica软件中微分代数方程指标约简算法分析

Modelica建模软件会产生高指标的微分代数方程(DAE),因为现有数值求解器一般不能直接对高指标DAE进行求解,所以Modelica建模软件必须对高指标DAE进行指标约简。为提高Modelica建模软件性能,针对现有指标约简算法,展开了理论分析和实验比较,着重对负权二部图算法进行了详细分析,并给出了负权二部图算法的时间复杂度。理论分析和实验结果表明,负权二部图算法相对Pantelides算法有较好的性能,因此可以考虑在Modelica建模软件中使用负权二部图算法来提高性能。

Mechanisms of sodium and potassium ions transfer facilitated by dibenzo-15-crown-5 across the water /1,2-dichloroethane interface using micropipettes

The transfer of sodium and potassium ions facilitated by dibenzo-15-crown-5 (DB15C5) has been studied at the micro-water/1,2-dichloroethane (water/DCE) interface supported at the tip of a micropipette. Cyclic volt-ammetric measurements were performed in two limiting conditions: the bulk concentration of Na+ or K+ in the aqueous phase is much higher than that of DB15C5 in the organic phase (DB15C5 diffusion controlled process) and the reverse condition (metal ion diffusion controlled process). The mechanisms of the facilitated Na+ transfer by DB15C5 are both transfer by interfacial complexation (TIC) with 1 : 1 stoichiometry under these two conditions, and the corresponding association constants were determined at log beta(1) = 8.97 +/- 0.05 or log beta(1) = 8.63 +/- 0.03. However, the transfers of K+ facilitated by DB15C5 show different behavior. In the former case it is a TIC process and its stoichiometry is 1 : 2, whereas in the latter case two peaks during the forward scan were observed, the first of which was confirmed as the formation of K (DB15C5)(2) at the interface by a TIC mechanism, while the second one may be another TIC process with 1 : 1 stoichiometry in the more positive potential. The relevant association constants calculated for the complexed ion, K+(DB15C5)(2), in the organic phase in two cases, logbeta(2), are 13.64 +/- 0.03 and 11.34 +/- 0.24, respectively.

可重构星球探测机器人的运动学建模及轨迹规划

提出了可重构星球探测机器人的概念,对系统中子机器人的研究进行了重点论述.通过设计恰当的子机器人连杆坐标系,利用Denavit Hartenberg方法完成了子机器人的运动学建模,并直接给出了子机器人的运动学正解模型.由于使用单一的求解算法不能求出工作空间的封闭解,因此综合利用代数法、几何法原理及空间投影关系,结合子机器人的结构特殊性推导出了运动学逆解,从而得到了工作空间内的所有解.在此基础上,考虑结构间的约束关系,给出了子机器人的工作空间及轨迹规划方法.最后,使用OpenGL对设计的子机器人系统进行了运动学仿真实验,实验以末端操作器的直线运动为例,充分考虑空间几何的关系,其结果有效地证明了建模及轨迹规划的正确性.

统计不相关最佳鉴别矢量集的本质研究

对统计不相关最佳鉴别矢量集的本质进行研究 ,在基于总体散布矩阵特征分解的基础上 ,构造了一种白化变换 ,使得变换后的样本空间中的总体散布矩阵为单位矩阵 ,这样使得传统的最佳鉴别矢量集算法得到的均是具有统计不相关的最佳鉴别矢量集 ,从而揭示了统计不相关最佳鉴别变换的本质———白化变换加普通的线性鉴别变换。该方法的最大优点在于所获得的最优鉴别矢量同时具有正交性和统计不相关性。该方法对代数特征抽取具有普遍适用性。用ORL人脸数据库的数值实验 ,验证了该方法的有效性

一种新的图像特征抽取方法研究

对最佳鉴别矢量的求解方法进行了研究，根据矩阵的分块理论和优化理论，在一定的条件下，从理论上得到类间散布矩阵和总体散布矩阵的一种简洁表示方法，提出了求解最佳鉴别矢量的一种新算法，该算法的优点是计算量明显减少。ORL人脸数据库的数值实验，验证了上述论断的正确性。实验结果表明，虽然识别率与分块维数之间存在非线性关系，但可以通过选择适当的分块维数来获得较高的识别率。类间散布矩阵和总体散布矩阵的一种简洁表示方法适合于一切使用Fisher鉴别准则的模式识别问题。

复杂条件地层滤波预测的理论与关键技术研究

The theory researches of prediction about stratigraphic filtering in complex condition are carried out, and three key techniques are put forward in this dissertation. Theoretical aspects: The prediction equations for both slant incidence in horizontally layered medium and that in laterally variant velocity medium are expressed appropriately. Solving the equations, the linear prediction operator of overlaid layers, then corresponding reflection/transmission operators, can be obtained. The properties of linear prediction operator are elucidated followed by putting forward the event model for generalized Goupillaud layers. Key technique 1: Spectral factorization is introduced to solve the prediction equations in complex condition and numerical results are illustrated. Key technique 2: So-called large-step wavefield extrapolation of one-way wave under laterally variant velocity circumstance is studied. Based on Lie algebraic integral and structure preserving algorithm, large-step wavefield depth extrapolation scheme is set forth. In this method, the complex phase of wavefield extrapolation operator’s symbol is expressed as a linear combination of wavenumbers with the coefficients of this linear combination in the form of the integral of interval velocity and its derivatives over depth. The exponential transform of the complex phase is implemented through phase shifting, BCH splitting and orthogonal polynomial expansion. The results of numerical test show that large-step scheme takes on a great number of advantages as low accumulating error, cheapness, well adaptability to laterally variant velocity, small dispersive, etc. Key technique 3: Utilizing large-step wavefield extrapolation scheme and based on the idea of local harmonic decomposition, the technique generating angle gathers for 2D case is generalized to 3D case so as to solve the problems generating and storing 3D prestack angle gathers. Shot domain parallel scheme is adopted by which main duty for servant-nodes is to compute trigonometric expansion coefficients, while that for host-node is to reclaim them with which object-oriented angle gathers yield. In theoretical research, many efforts have been made in probing into the traits of uncertainties within macro-dynamic procedures.

Learning Fine Motion by Markov Mixtures of Experts

Compliant control is a standard method for performing fine manipulation tasks, like grasping and assembly, but it requires estimation of the state of contact between the robot arm and the objects involved. Here we present a method to learn a model of the movement from measured data. The method requires little or no prior knowledge and the resulting model explicitly estimates the state of contact. The current state of contact is viewed as the hidden state variable of a discrete HMM. The control dependent transition probabilities between states are modeled as parametrized functions of the measurement We show that their parameters can be estimated from measurements concurrently with the estimation of the parameters of the movement in each state of contact. The learning algorithm is a variant of the EM procedure. The E step is computed exactly; solving the M step exactly would require solving a set of coupled nonlinear algebraic equations in the parameters. Instead, gradient ascent is used to produce an increase in likelihood.

The Use of Equality in Deduction and Knowledge Representation

This report describes a system which maintains canonical expressions for designators under a set of equalities. Substitution is used to maintain all knowledge in terms of these canonical expressions. A partial order on designators, termed the better-name relation, is used in the choice of canonical expressions. It is shown that with an appropriate better-name relation an important engineering reasoning technique, propagation of constraints, can be implemented as a special case of this substitution process. Special purpose algebraic simplification procedures are embedded such that they interact effectively with the equality system. An electrical circuit analysis system is developed which relies upon constraint propagation and algebraic simplification as primary reasoning techniques. The reasoning is guided by a better-name relation in which referentially transparent terms are preferred to referentially opaque ones. Multiple description of subcircuits are shown to interact strongly with the reasoning mechanism.

Quantum Stratonovich Stochastic Calculus and the Quantum Wong-Zakai Theorem

Gough, John, 'Quantum Stratonovich Stochastic Calculus and the Quantum Wong-Zakai Theorem', Journal of Mathematical Physics. 47, 113509, (2006)

The Geometry of Frequency Squares

Mavron, Vassili; Jungnickel, D.; McDonough, T.P., (2001) 'The Geometry of Frequency Squares', Journal of Combinatorial Theory, Series A 96, pp.376-387 RAE2008

Quasi -symmetric designs with good blocks and intersection number one

Mavron, Vassili; McDonough, T.P.; Schrikhande, M.S., (2003) 'Quasi -symmetric designs with good blocks and intersection number one', Designs Codes and Cryptography 28(2) pp.147-162 RAE2008

Information sets and partial permutation decoding for codes from finite geometries

Mavron, Vassili; McDonough, T.P.; Key, J.D., (2006) 'Information sets and partial permutation decoding for codes from finite geometries', Finite Fields and their applications 12(2) pp.232-247 RAE2008

Non-tactical symmetric nets

Mavron, Vassili; Al-Kenani, A.N., (2003) 'Non-tactical symmetric nets', Journal of the London Mathematical Society 67(2) pp.273-288 RAE2008

Systematic Verification of Safety Properties of Arbitrary Network Protocol Compositions Using CHAIN

Formal correctness of complex multi-party network protocols can be difficult to verify. While models of specific fixed compositions of agents can be checked against design constraints, protocols which lend themselves to arbitrarily many compositions of agents-such as the chaining of proxies or the peering of routers-are more difficult to verify because they represent potentially infinite state spaces and may exhibit emergent behaviors which may not materialize under particular fixed compositions. We address this challenge by developing an algebraic approach that enables us to reduce arbitrary compositions of network agents into a behaviorally-equivalent (with respect to some correctness property) compact, canonical representation, which is amenable to mechanical verification. Our approach consists of an algebra and a set of property-preserving rewrite rules for the Canonical Homomorphic Abstraction of Infinite Network protocol compositions (CHAIN). Using CHAIN, an expression over our algebra (i.e., a set of configurations of network protocol agents) can be reduced to another behaviorally-equivalent expression (i.e., a smaller set of configurations). Repeated applications of such rewrite rules produces a canonical expression which can be checked mechanically. We demonstrate our approach by characterizing deadlock-prone configurations of HTTP agents, as well as establishing useful properties of an overlay protocol for scheduling MPEG frames, and of a protocol for Web intra-cache consistency.