An optimal repeat inspection plan with several classifications

Multicharacteristic critical components exist in many systems. Such components could be a part of an aircraft, space shuttle or a gas ignition system. A component is critical if it causes disaster or a very high cost upon failure. In this paper, a new inspection plan for critical multicharacteristic components is presented. A mathematical model that depicts the plan is developed. An algorithm is proposed for finding the optimal number of repeat inspections and the sequence of characteristics for inspection that minimizes expected total cost per accepted component. The expected cost consists of the cost of inspection and the cost of misclassifications. The inspection plan and the model developed generalize existing models in the literature and provide a more realistic formulation. An example is given to demonstrate the plan and the model.     

旋涡运动的稳定性与角动量守恒

本文利用角动量作为Liapunov函数建立二维的圆形涡块及涡环在有限或无限区域上的(Liapunov)非线性稳定性.     

Selection and Scheduling of Advanced Missions for NASA Using 0-1 Integer Linear Programming

A 0-1 integer linear programme for the selection and scheduling of US National Aeronautics and Space Administration (NASA) missions over a long planning horizon is presented. This model was formulated to allow a higher-level user-interaction with an advanced missions database currently being developed. The model implicitly considers the multi-objective nature of the problem, which results from the desire to maximize benefits in several categories as well as from the desire to minimize cost. In addition, the model allows the planner much flexibility in the selection process. This is accomplished by allowing the planner the ability to specify long- or short-term budget constraints, precursor/follow-on mission requirements, or any number of other idiosyncratic constraints which might be of importance in the decision process. Small example problems are solved in order to illustrate the approach, and areas for further research are discussed.     

An interactive approach for multiobjective decision making

We develop an interactive approach for multiobjective decision-making problems, where the solution space is defined by a set of constraints. We first reduce the solution space by eliminating some undesirable regions. We generate solutions (partition ideals) that dominate portions of the efficient frontier and the decision maker (DM) compares these with feasible solutions. Whenever the decision maker prefers a feasible solution, we eliminate the region dominated by the partition ideal. We then employ an interactive search method on the reduced solution space to help the DM further converge toward a highly preferred solution. We demonstrate our approach and discuss some variations.     

von Neumann代数中套子代数上的Lie同构

本文给出因子von Neumann代数中的幂等算子在广义Lie积下的一个刻画; 得到因子von Neumann代数中套子代数的幂等算子在Lie积下的一个特征．作为应用, 研究了因子von Neumann代数中套子代数上的Lie同构,并证明因子von Neumann 代数中套子代数之间的Lie同构,要么是同构与广义迹之和,要么是负反同构与广义迹之和．     

强预不变凸函数的充要条件

本文讨论了强预不变凸函数与预不变凸函数、严格预不变凸函数及半严格预不变凸函数之间的关系,得到它的三个充要条件：(i)在一定条件下,f是强预不变凸函数的充分必要条件是f是预不变凸函数且f满足中间点强预不变凸性；(ii)在一定条件下,f是强预不变凸函数的充分必要条件是f是严格预不变凸函数且f满足中间点强预不变凸性；(iii)在一定条件下,f是强预不变凸函数的充分必要条件是f是半严格预不变凸函数且f满足中间点强预不变凸性．     

Discrete and Continuous Time Modulated Random Walks with Heavy-Tailed Increments

We consider a modulated process S which, conditional on a background process X, has independent increments. Assuming that S drifts to −∞ and that its increments (jumps) are heavy-tailed (in a sense made precise in the paper), we exhibit natural conditions under which the asymptotics of the tail distribution of the overall maximum of S can be computed. We present results in discrete and in continuous time. In particular, in the absence of modulation, the process S in continuous time reduces to a Lévy process with heavy-tailed Lévy measure. A central point of the paper is that we make full use of the so-called “principle of a single big jump” in order to obtain both upper and lower bounds. Thus, the proofs are entirely probabilistic. The paper is motivated by queueing and Lévy stochastic networks.     

水合乙酸锌脱水反应的动力学

用等温热重法和非等温热重法研究了Zn(CH3COO) 2·2H2 O的脱水反应 .在 61.1、62 .8、66.2、69.9℃下的等温热重数据 ,由等转化率下的lnt=E/RT +ln[g(α) /A]进行拟合 ,确定了活化能的大小 ;升温速率为 10℃ /min的非等温热重曲线显示 ,Zn(CH3COO) 2·2H2 O的脱水反应发生在 71～ 10 2℃间 ,其数据通过Doyle Zsako法进行拟合 ,以线性相关系数为判据 ,并结合等温热分析拟合结果 ,得到该脱水反应的积分动力学模式函数g(α) =[-ln( 1-α) ]2 / 3、活化能E =10 0 .8kJ/mol、指前因子ln(A/s-1) =3 6.0 9、动力学补偿效应方程为lnA =0 .3 3 3 9E + 2 .0 10 .     

On quartics with three-divisible sets of cusps

 We study the geometry and codes of quartic surfaces with many cusps. We apply Gr?bner bases to find examples of various configurations of cusps on quartics. Received: 10 May 2002 / Revised version: 11 November 2002 Published online: 3 March 2003 Permanent address: Institute of Mathematics, Jagiellonian University, ul. Reymonta 4, 30-059 Kraków, Poland. e-mail: rams@mi.uni-erlangen.de, rams@im.uj.edu.pl Research partially supported by the Schwerpunktprogramm ``Global methods in complex geometry' of the Deutsche Forschungsgemeinschaft, and by EAGER. Mathematics Subject Classification (2000): 14J25, 14J17     

Operational characteristics and power scaling of a transverse flow transversely excited CW CO<Subscript>2</Subscript> laser

Transverse flow transversely excited (TFTE) CO₂ lasers are easily scalable to multikilowatt level. The laser power can be scaled up by increasing the volumetric gas flow and discharge volume. It was observed in a TFTE CW CO₂ laser having single row of pins as an anode and tubular cathode that the laser power was not increasing when the discharge volume and the gas volumetric flow were increased by increasing the electrode separation keeping the gas flow velocity constant. The discharge voltage too remained almost constant with the change of electrode separation at the same gas flow velocity. This necessitated revision of the scaling laws for designing this type of high power CO₂ laser. Experimental results of laser performance for different electrode separations are discussed and the modifications in the scaling laws are presented.