特大规模组合电路高速测试生成系统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     

Coordinated replenishments from multiple suppliers with price discounts

In this study we present an integer programming model for determining an optimal inbound consolidation strategy for a purchasing manager who receives items from several suppliers. The model considers multiple suppliers with limited capacity, transportation economies, and quantity discounts. We propose an integrated branch and bound procedure for solving the model. This procedure, applied to a Lagrangean dual at every node of the search tree, combines the subgradient method with a primal heuristic that interact to change the Lagrangean multipliers and tighten the upper and lower bounds. An enhancement to the branch and bound procedure is developed using surrogate constraints, which is found to be beneficial for solving large problems. We report computational results for a variety of problems, with as many as 70,200 variables and 3665 constraints. Computational testing indicates that our procedure is significantly faster than the general purpose integer programming code OSL. A regression analysis is performed to determine the most significant parameters of our model. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 579–598, 1998     

基于数据库的电子对抗作战效能分析系统的设计

介绍了基于数据库的电子对抗作战效能分析系统设计的基本思路.系统采用模块化设计,指挥员可根据不同需要添加或删减模块以达到自己的目的.同时,系统采用了双缓冲读取数据机制,很好地解决了仿真推演所需数据量大与电子对抗作战态势实时显示之间的矛盾,将无形的电磁态势以形象直观的形式显现出来,有助于指挥员加深对电子对抗这种作战手段的理解、战术的运用以及辅助作出正确的决策.