地(舰)空导弹测试系统的设计方法探讨

导弹测试系统是进行导弹综合测试的专用地面设备系统。导弹测试系统的特点是多方面的, 包括： 测试功能全面、综合; 系统组成设备类型较多;测试安全性要求突出。如何进行导弹测试系统的优化设计, 是文章阐述内容的主题     

晶体管自差收发机优化设计的数学模型

依据自差收发机灵敏度的计算公式,在满足技术要求所规定的辐射功率和电源噪声传输系数条件下,把自差收发机的灵敏度作为目标函数,对自差收发机的电路参数作为设计变量,对自差收发机进行了优化设计,得出自差机优化设计的数学模型。     

弹道导弹基本诸元的快速装订算法研究

应用牛顿迭代法实现了弹道导弹基本诸元的快速装订。推导了根据落点偏差求飞行程序角和发射方位角的牛顿迭代公式，设计了迭代算法，并给出了实际算例。考虑到迭代算法收敛速度与所给的迭代初值有一定的关系，提出了预先准备简易射表采用反插值算法为牛顿迭代法准备初值的方法，经计算表明可以大大减少迭代次数，从而实现标准弹道的快速设计。     

特大规模组合电路高速测试生成系统ATGTA-1

针对特大规模组合电路和全扫描设计电路提出了一种高速测试生成方法，并建成了相应的测试生成系统ＡＴＧＴＡ－１。该系统采用有限回溯测试模式产生方法生成测试码，采用ｎ（机器字长）个测试码并行的单故障传播方法模拟验证测试覆盖。测试生成与故障模拟为ｎ对１紧耦合集成方式。该系统运行１０个Ｂｅｎｃｈｍａｒｋ电路，取得了低测试长度、高故障覆盖、高效率的良好效果。     

桁架式水塔结构的优化设计

本文将桁架式水塔结构等效成单自由度弹簧质量系统,考虑其在风载（包括定常与随机波动两部分）作用下,以桁架中的最大应力及频率耦合等作为约束条件的优化设计问题,导出了设计变量的最优化设计数学模型。     

全集成多功能MOSFET－C CCII连续时间滤波器的设计

本文提出了一种以第二代电流传输器（ＣＣＩＩ）作为基本单元的集成ＭＯＳ－ＦＥＴ—Ｃ多功能连续时间滤波器。它可以实现诸如低通、带通、高通二次传递函数。该电路不采用平衡结构,但ＭＯＳ管的非线性的消除程度则等同平衡结构。灵敏度也较低。     

提高大数据库管理系统运行速度浅析

本文从合理使用内存的角度,分析了影响大数据量关系型数据库管理系统运行速度的原因,提出了提高运行速度的对策及重组数据的4条原则。     

递进优化技术在汽油机工作过程优化计算中的应用

采用数学规化的方法优化汽油机的工作过程,可以在限制发动机热负荷、机械负荷、氧化氮排放和不爆震的条件下,使发动机在运行过程中经济性最好.但是要求得比较精确的优化解,一般要进行大量计算,花费较多机时.本文提出了一种分段、分层、分级的递进优化方法,应用于汽油机工作过程的优化计算中,取得了较好的效果.     

Minimizing sums and products of linear fractional functions over a polytope

In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametric transformation of the objective function serves as an efficient method for calculating global minima of these nonconvex minimization problems if the number of linear fractional terms in the objective function is less than four or five. It will be shown that the Charnes–Cooper transformation plays an essential role in solving these problems. Also a simple bounding technique using linear multiplicative programming techniques has remarkable effects on structured problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 583–596, 1999     

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2^{⌊(n−1)/2⌋} optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2^{⌊(n−1)/2⌋} sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999