同轴环缝气流作用下锥形液膜线性稳定性分析

为了分析气液同轴离心式喷嘴的雾化机理,对同轴气体作用下的锥形液膜进行时间稳定性分析,推导同轴气体作用下锥形液膜的色散方程,建立离心式喷嘴出口参数预测模型,用于数值求解色散方程。结果表明：喷嘴出口液膜厚度随着喷注压降的增加而减小,喷雾锥角、液膜速度和轴向速度随着喷注压降的增加而增大。同轴气体作用下液膜由正弦模式的表面波主导,因为正弦模式的表面波增长率远大于曲张模式的表面波增长率。当环缝气体喷注速度较小时,增加气体速度会减小气液相对速度,从而减弱气液相互作用,使得液膜主导表面波增长率和频率减小、破碎时间和破碎长度增加。而当环缝气体速度超过一个临界值后,随着气体速度的增大,液膜主导表面波增长率和频率迅速增大,破碎时间和破碎长度迅速减小。     

定子磁钢轨道拼接错位对动圈式永磁直线电机性能的影响

陆基车载无人机电磁弹射器是一种新型的弹射起飞装置。为了实现高机动性,提出双边动圈式永磁直流直线电机和定子磁钢轨道分段拼接结构方案。为了评估定子磁钢轨道拼接可能对电机性能的影响,建立了永磁直线电机模型。利用有限元分析软件,分析研究了轨道分段拼接上下错位、左右错位以及倾斜错位可能造成的影响,根据分析结果给出了磁钢轨道拼接错位所允许的偏移范围大小。     

无人战斗机航路规划圆切线算法

通过对无人战斗机低空进入敌防区面临的各种威胁进行分析,建立了适用于圆切线算法的威胁场模型;由于可行方向法对威胁圆叠加时规划出的航路效果不理想,提出了圆的切线算法理论作为此航路规划方法的改进,采用随机产生威胁场的方法来模拟多变的战场环境,并且进行了理论分析,最后得出仿真结果.仿真证明,将两种方法结合规划出的飞行航线在航程上是比较理想的,而且路径规则的效果也得到了很大的提高.     

永磁无刷直流直线电机齿槽力补偿控制研究

永磁无刷直流直线电机的齿槽定位力对其低速性能影响很大,而单纯的设计方法不可能完全消除齿槽力的影响,为此,必须在控制系统中对齿槽力进行补偿。针对包含齿槽力模型的理想电机控制系统进行了理论分析,指出通过引入位置反馈环节可以消除齿槽力的不良影响。利用有限元分析方法计算了电机的推力和齿槽力波形,验证了低速条件下推力波动主要由齿槽力引起,并说明可以通过位置反馈来补偿推力波动。最后,提出将一个齿槽力周期分为多个区间,然后分段进行线性补偿的简易控制方法。该方法无需高精度的定位装置和复杂的控制算法即可实现对电机齿槽力的补偿,实验结果表明,所提方法能够有效抑制电机的推力波动。     

科研经费管理决策支持系统若干模型

本文应用多目标决策原理和计算机技术,在分析用户需求的基础上,建立了科研任务项目的预测评价和经费分配模型,并分析了有关模型的关系和解决性质。根据这些模型和决策的特点,简要叙述了该系统的主要功能。我们相信。该系统的应用,将给管理人员提供方便,且使管理进一步科学化,让有限的经费发挥更大的作用。     

A specially structured nonlinear integer resource allocation problem

We present an algorithm for solving a specially structured nonlinear integer resource allocation problem. This problem was motivated by a capacity planning study done at a large Health Maintenance Organization in Texas. Specifically, we focus on a class of nonlinear resource allocation problems that involve the minimization of a convex function over one general convex constraint, a set of block diagonal convex constraints, and bounds on the integer variables. The continuous variable problem is also considered. The continuous problem is solved by taking advantage of the structure of the Karush‐Kuhn‐Tucker (KKT) conditions. This method for solving the continuous problem is then incorporated in a branch and bound algorithm to solve the integer problem. Various reoptimization results, multiplier bounding results, and heuristics are used to improve the efficiency of the algorithms. We show how the algorithms can be extended to obtain a globally optimal solution to the nonconvex version of the problem. We further show that the methods can be applied to problems in production planning and financial optimization. Extensive computational testing of the algorithms is reported for a variety of applications on continuous problems with up to 1,000,000 variables and integer problems with up to 1000 variables. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 770–792, 2003.     

The value of information sharing in a two‐stage supply chain with production capacity constraints

We consider a simple two‐stage supply chain with a single retailer facing i.i.d. demand and a single manufacturer with finite production capacity. We analyze the value of information sharing between the retailer and the manufacturer over a finite time horizon. In our model, the manufacturer receives demand information from the retailer even during time periods in which the retailer does not order. To analyze the impact of information sharing, we consider the following three strategies: (1) the retailer does not share demand information with the manufacturer; (2) the retailer does share demand information with the manufacturer and the manufacturer uses the optimal policy to schedule production; (3) the retailer shares demand information with the manufacturer and the manufacturer uses a greedy policy to schedule production. These strategies allow us to study the impact of information sharing on the manufacturer as a function of the production capacity, and the frequency and timing in which demand information is shared. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Optimal stopping in software testing

In this paper we address the problem of how to decide when to terminate the testing/modification process and to release the software during the development phase. We present a Bayesian decision theoretic approach by formulating the optimal release problem as a sequential decision problem. By using a non‐Gaussian Kalman filter type model, proposed by Chen and Singpurwalla (1994), to track software reliability, we are able to obtain tractable expressions for inference and determine a one‐stage look ahead stopping rule under reasonable conditions and a class of loss functions. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

同时强镇定的一个充分条件

一个稳定的控制器可同时镇定n个对象(同时强镇定)等价于一个控制嚣(不一定稳定)同时镇定n+1个对象(同时镇定).两个以上对象的同时强镇定和三个以上对象的同时镇定是线性系统中一个亟待解决的公开问题.文中所作的基本假定是所有的对象具有相同的简单不稳定零点,在此条件下给出了n个对象同时强镇定的一个充分条件.此条件仅需确定n个对象的不稳定零点并且判定由不稳定零点导出一个相应矩阵是正定的,就能判定n个对象同时强镇定,因此是一个易于检验的充分条件.同时给出了n个对象同时强镇定的算法.丰富了同时强镇定的条件和算法.     

VB程序设计课程教学的探索与实践

实践表明,对影响VB程序设计课程教学中存在的突出问题进行认真分析,充分利用网络教学平台,改革课堂教学方法、抓好上机实践环节。此举有效地激发了学生的学习兴趣,提高学生的编程能力,同时也有助于提高教学质量和效果。