载人飞船等离子体鞘电子密度分布的数值计算

研究高温空气的不同物理模型对载人飞船返回舱等离子体鞘电子密度的影响 ,包括热力平衡的化学非平衡模型与热力、化学都是非平衡的模型的比较 ,以及七组元模型与十一组元模型的比较。采用NND格式和时间预处理技术 ,得到了非平衡流全NS方程的时间渐近解 ,计算了载人飞船等离子体鞘电子密度的典型结果。与飞行试验及有关文献数值计算结果之比较表明 ,本文的计算结果是可信的     

非圆链轮分度线的样条拟合

非圆链传动中，两链轮分度线为非圆形，该曲线数学表达式是一个非线性函数方程组，严格求解这一函数方程组似乎毫无希望，但是依据动力学的方法可以构造此曲线的切线系，即一切线多边形。从而将这一问题转化为求与切线多边形每条边相切的逼近曲线。     

PETRI网理论在航空电子综合化系统中的应用

提出航空电子综合化系统与PETRI网理论之间的关系,给出航空电子综合化系统组网元素的PETRI网表达方法,以及航空电子综合化系统中指令消息格式的PETRI网模型,并以某型飞机航空电子综合化系统为实例,进行了建模、分析和优化的仿真.     

零动态设计方法在鱼雷纵向运动控制中的应用

鱼雷纵向运动方程是非线性微分方程 ,非线性系统近似线性化建模方法有着不可忽视的局限性 .非线性系统的精确线性化设计方法由于其复杂性而限制了它的应用 .将零动态设计方法应用于鱼雷纵向系统 ,为解决鱼雷非线性控制系统稳定设计提供了新的途径 .     

雷电冲击波的模拟

在对雷电的标准波形和它的频谱特性进行分析的基础上,讨论了一种由冲击波发生器和平行板传输线系统组成的雷电冲击波模拟装置,初步实验研究表明,用这种装置能够实现对雷电冲击波的实验室模拟。     

Rectilinear m-Center problem

In this article we consider the unweighted m-center problem with rectilinear distance. We preent an O(n^m–2 log n) algorithm for the m-center problem where m ≥ 4.     

Quality control and the sales process

Product quality is emerging as a major strategic instrument for competition. The purpose of this article is to assess the effects of quality control on sales, and, vice versa, the effects of the sales process on quality control. A model relating quality control and the sales process (advertising, repeat purchase, and word-of-mouth effects) is developed to evaluate the above relationships. Two special cases, with degenerate and beta distribution for defect items in the production lot, are analyzed in detail. In the former case, analytical results for the optimal quality control schemes are obtained, whereas in the latter, efficient bounds are derived to search for the optimal scheme. It is shown, analytically and numerically, that the sales parameters have significant impact on whether more “stringent” or “tighter” quality control is warranted. Future research directions are also discussed.     

A linear programming model for design of communications networks with time varying probabilistic demands

In this paper marginal investment costs are assumed known for two kinds of equipment stocks employed to supply telecommunications services: trunks and switching facilities. A network hierarchy is defined which includes important cases occurring in the field and also appearing in the literature. A different use of the classical concept of the marginal capacity of an additional trunk at prescribed blocking probability leads to a linear programming supply model which can be used to compute the sizes of all the high usage trunk groups. The sizes of the remaining trunk groups are approximated by the linear programming models, but can be determined more accurately by alternate methods once all high usage group sizes are computed. The approach applies to larger scale networks than previously reported in the literature and permits direct application of the duality theory of linear programming and its sensitivity analyses to the study and design of switched probabilistic communications networks with multiple busy hours during the day. Numerical results are presented for two examples based on field data, one of which having been designed by the multi-hour engineering method.     

An algorithm for a class of loading problems

The loading problem we consinder is to assign a set of discrete objects, each having a weight, to a set of boxes, each of which has a capacity limit, in such a way that every object is assigned to a box and the number of boxes used is minimized. A characterization of the assignments is offered and used to develop a set of rules for generating nonredundant assignments. The rules are incorporated into an implicit enumeration algorithm. The algorithm is tested against a very good heuristic. Computational experience shows that the algorithm is highly efficient, solving problems of up to 3600 0-1 variables in a CPU second.     

An algorithm for 0-1 multiple-knapsack problems

The 0-1 multiple-knapsack problem is an extension of the well-known 0-1 knapsack problem. It is a problem of assigning m objects, each having a value and a weight, to n knapsacks in such a way that the total weight in each knapsack is less than its capacity limit and the total value in the knapsacks is maximized. A branch-and-bound algorithm for solving the problem is developed and tested. Branching rules that avoid the search of redundant partial solutions are used in the algorithm. Various bounding techniques, including Lagrangean and surrogate relaxations, are investigated and compared.