Exploration of Reactivity of Eu(TTA)2(phen)(MA)

The reactivity of Eu(TTA)2(phen)(MA) (HTTA=2-thenoyltrifluoroacetone, MA=maleic anhydride) was studied. A series of products were prepared by direct polymerization, suspension polymerization, and alternate suspension and solution copolymerization with the styrene. And then we reactivity of these products were studied. The complexes were investigated and characterized by X-ray Diffraction (XRD), gel permeation chromatography (GPC) and fluorescence spectrophotometer. Although high polymerization degree is not found in the exploration of reactivity, it is found that the fluorescent intensity of complexes prepared by suspension polymerization increases significantly compared with the original particles, which is five times higher than that of the pure rare earth complex.     

Effect of Rare Earths on Electronic Structure of (110) Twin Martensite Boundary for Ni2MnGa Alloy

The doping effect of rare earth elements (Tb and Sm) on the electronic structure of (110) martensitic twin boundary in Ni2MnGa alloys was investigated by using ab initio method within the DFT and the supercell implementation. The calculated results show that the atomic relaxation lowers the boundary energy and the segregation energy. Sm seems easier to segregate to the boundary and has a greater doping effect compared with Tb due to its lower segregation energy and bigger bonder order with neighboring atoms. Tb makes a greater contribution to the magnetic properties of the twin boundary than Sm.     

带有Agent特征的全局流程集成平台研究

针对政府信息化建设中的特殊应用,借鉴MAS思想提出了全局流程的概念,并把全局流程与局部流程区分开来.在此基础上建立了全局流程集成平台,详细讨论了平台的设计思想、结构和关键的组成部分.实践表明,平台的流程描述能力强、层次结构清晰,具有通用性,能体现Agent的自治性、自主性、协作性和适应性,有效地支持了电子政务中典型应用的开发,适合作为开发以业务流程为中心的应用系统的支撑平台.     

Cones and foci: A mechanical framework for protocol verification

We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between data objects. Compared to the original cones and foci method from Groote and Springintveld, our method is more generally applicable, because it does not require a preprocessing step to eliminate τ-loops. We prove soundness of our approach and present a set of rules to prove the reachability of focus points. Our method has been formalized and proved correct using PVS. Thus we have established a framework for mechanical protocol verification. We apply this framework to the Concurrent Alternating Bit Protocol.

---

     

Tilting Micromirror With a Liquid-Metal Pivot

In this paper, we have developed a new micromirror with a compact footprint which can be rapidly tilted to large angles. The micromirror is supported by a liquid-metal drop (LMD) with low vapor pressure and is rotated by an electrostatic torque. A torsional spring model is proposed to predict the equivalent torsional constant of the LMD and the resonant frequency of the mirror. Micromirrors (1 mmtimes1 mmtimes25 mum) and actuating electrodes are microfabricated with a centralized wetting area surrounded by a nonwetting parylene area to confine the LMD. Our measurements of the mirror show the average snap-down voltage of ~ 79 V and the resonant frequency of 165 Hz. A single mirror is actuated to steer a laser beam with a maximum deflected angle of 23.6deg. A 1times3 mirror array is demonstrated for light switching, and has greater than 1 : 64 idle/deflection contrast. We also test the stability of the mirror to mechanical shake up to 56 g (g = 9.807 m/s²). The prototype mirror has 3.6 million cycles of operation     

The control of a two-level Markov decision process by time aggregation

The solution of Markov Decision Processes (MDPs) often relies on special properties of the processes. For two-level MDPs, the difference in the rates of state changes of the upper and lower levels has led to limiting or approximate solutions of such problems. In this paper, we solve a two-level MDP without making any assumption on the rates of state changes of the two levels. We first show that such a two-level MDP is a non-standard one where the optimal actions of different states can be related to each other. Then we give assumptions (conditions) under which such a specially constrained MDP can be solved by policy iteration. We further show that the computational effort can be reduced by decomposing the MDP. A two-level MDP with M upper-level states can be decomposed into one MDP for the upper level and M to M(M-1) MDPs for the lower level, depending on the structure of the two-level MDP. The upper-level MDP is solved by time aggregation, a technique introduced in a recent paper [Cao, X.-R., Ren, Z. Y., Bhatnagar, S., Fu, M., & Marcus, S. (2002). A time aggregation approach to Markov decision processes. Automatica, 38(6), 929-943.], and the lower-level MDPs are solved by embedded Markov chains.     

Comments on: “Efficient robust constrained model predictive control with a time varying terminal constraint set” by Wan and Kothare

We present an algorithm that modifies the original formulation proposed in Wan and Kothare [Efficient robust constrained model predictive control with a time-varying terminal constraint set, Systems Control Lett. 48 (2003) 375–383]. The modified algorithm can be proved to be robustly stabilizing and preserves all the advantages of the original algorithm, thereby overcoming the limitation pointed out recently by Pluymers et al. [Min–max feedback MPC using a time-varying terminal constraint set and comments on “Efficient robust constrained model predictive control with a time-varying terminal constraint set”, Systems Control Lett. 54 (2005) 1143–1148].     

基于神经网络的汽车牌照自动识别技术研究

文章提出了一种应用BP神经网络识别汽车牌照字符的方法,重点讨论了关于BP神经网络学习过程初始权值的选取、隐含层节点数的确定和权值学习算法的改进问题,实验结果表明:该方法用于车牌识别具有较快的收敛速度和较高的识别精度。     

WWW搜索引擎的数据采集技术

该文主要研究了WEB搜索引擎中的数据采集技术和WEB搜索引擎数据采集机器人的关键技术和设计时应考虑的问题及相应的解决方法,并结合专题型搜索引擎的特点提出了一些搜索引擎的数据采集策略。     

基于图像的快速碰撞检测算法

基于图像的碰撞检测算法是一类较新的碰撞检测方法，它有效地利用图形硬件的加速功能，以减轻CPU的负担，文中提出一种基于图像的快速碰撞检测算法，该算法在继承一般基于图像的碰撞检测算法优点的同时，不但能处理任意形状的多面体，而且具有更高效率，该算法主要采用对物体表面进行自动凸分解，将凸分解结果合理的组织成层次二叉树结构，以及绘制加速等技术，与相关算法的实验比较说明，该算法在性能上有较大的提高。