反射式微光机电系统(MOEMS)的研究现状与展望

反射式微光机电系统是微光机电系统中的重要组成部分,近年来得到了较快的发展。介绍了反射式微光机电系统(MOEMS)的研究现状和最新进展。根据反射式微光机电系统的分类,列举了一些具有代表性的反射式MOEMS器件。简要介绍了反射式MOEMS的加工工艺;阐述了反射式MOEMS的应用领域;展望了发展前景。     

一种新颖的用于光腔模式及光束传输模拟的特征向量法

根据有限元法单元划分的思想，提出了一种新颖的模拟光腔模式及光束传输的特征向量法. 该方法的关键之处在于基于衍射积分理论构造了一种新的光束传输矩阵，通过求解特征矩阵方程可一次性得到谐振腔的一系列特征向量，每一列特征向量即代表了腔镜上光场的一个确定模式的振幅及相位分布. 并可采用该方法模拟光场传输到腔内或腔外任意地方的场分布. 该方法将传统方法中大量的迭代过程转化成为本征积分方程特征向量的求解过程，并与初值取值无关，且可一次性求得多个模式分布，从而可方便地分析谐振腔的模式鉴别能力. 特征向量法对圆形镜共焦 关键词： 谐振腔 特征向量法 模式分布     

基于径向基函数神经网络的Lorenz混沌系统滑模控制

针对受参数不确定和外扰影响的混沌Lorenz系统，提出一种基于径向基函数（RBF）神经网 络的滑模控制方法.基于被控系统在不稳定平衡点处状态误差的可控规范形，设计滑模切换 面并将其作为神经网络的唯一输入.单入单出形式的RBF控制器隐层只需7个径向基函数，网 络的权值则依滑模趋近条件在线确定.仿真表明该控制器对系统参数突变和外部干扰具有鲁棒性，同时抑制了抖振. 关键词： 混沌控制 滑模 径向基函数神经网络 Lorenz系统     

Equivalence of two linear programming relaxations for broadcast scheduling

A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem.     

Robust linear optimization under general norms

We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients.     

Shell effects in the symmetric-modal fission of pre-actinide nuclei

Mass distributions of fragments in the low-energy fission of nuclei from ¹⁸⁷Ir to ²¹³At have been analysed. This analysis has shown that shell effects in symmetric-mode fragment mass yields from the fission of pre-actinide nuclei could be described if one assumes the existence of two strongly deformed neutron shells in the arising fragments with neutron numbers N₁ ≈ 52 and N₂ ≈ 68. A new method has been proposed for quantitatively describing the mass distributions of the symmetric fission mode for pre-actinides with A ≈ 180–220.     

The projective method for solving linear matrix inequalities

Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed.     

Some Properties of Quasi-keep-range Operators and Their Applications

ＳｏｍｅＰｒｏｐｅｒｔｉｅｓｏｆＱｕａｓｉ┐ｋｅｅｐ┐ｒａｎｇｅＯｐｅｒａｔｏｒｓａｎｄＴｈｅｉｒＡｐｐｌｉｃａｔｉｏｎｓＬａｉＣｈｕｎｈｕｉ（赖春晖）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＺｈａｎｇｚｈｏｕＴｅａｃｈｅｒｓＣｏｌｅｇｅ，...     

On a Question of Phillips

In [5] Phillips proved that one can obtain the additive group of any nonstandard model *? of the ring ? of integers by using a linear mod 1 function h : F ?, where F is the α-dimensional vector space over ? when α is the cardinality of *?. In this connection it arises the question whether there are linear mod 1 functions which are neither addition nor quasi-linear. We prove that this is the case.     

Volumetric path following algorithms for linear programming

We consider the construction of small step path following algorithms using volumetric, and mixed volumetric-logarithmic, barriers. We establish quadratic convergence of a volumetric centering measure using pure Newton steps, enabling us to use relatively standard proof techniques for several subsequently needed results. Using a mixed volumetric-logarithmic barrier we obtain an O(n ^1/4 m ^1/4 L) iteration algorithm for linear programs withn variables andm inequality constraints, providing an alternative derivation for results first obtained by Vaidya and Atkinson. In addition, we show that the same iteration complexity can be attained while holding the work per iteration to O(n ² m), as opposed to O(nm ²), operations, by avoiding use of the true Hessian of the volumetric barrier. Our analysis also provides a simplified proof of self-concordancy of the volumetric and mixed volumetric-logarithmic barriers, originally due to Nesterov and Nemirovskii. This paper was first presented at the 1994 Faculty Research Seminar “Optimization in Theory and Practice”, at the University of Iowa Center for Advanced Studies.