英语歧义的理解与修辞功能

基于英语学习者有时候为歧义所困 ,从语义学和语用学的角度讨论了英语歧义的分类、理解和修辞功能 ;通过实例进行研究和分析 ,指出了影响歧义理解的主要因素并提出了相关对策 ;介绍了歧义的积极作用 .     

装备器材库温湿度监控系统的设计与实现

军用装备器材仓库温湿度监控是目前亟待解决的问题.文中详细地阐述了种切实可行的设计方法--主从式两级数字化监控系统的设计原理与实现方法,并用Borland C++Builder语言对其组态软件进行程序设计.     

串联电路的谐振及其实验方法的研究

本文主要介绍电路中的串联谐振的利弊、串联谐振曲线的测试以及串联谐振曲线与品质因数的关系、品质因数与选择性及灵敏性的关系并研究实验测试电路和方法。     

A branch and bound algorithm for the minimum storage‐time sequencing problem

The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000     

多层粘弹阻尼复合结构阻尼性能的研究

制备了多层粘弹阻尼复合结构,并研究了其阻尼性能.实验结果表明,多层粘弹弱约束阻尼复合结构的阻尼性能优于多层粘弹自由阻尼复合结构的阻尼性能.     

基于PIC系列单片机的迫弹电子时间引信控制系统设计

介绍了迫弹电子时间引信控制系统的电路组成、工作原理及其功能,并以PIC16F873A型单片机作为控制器核心,对引信的工作过程进行控制,提高了引信的安全性和可靠性。     

基于多目标模糊决策模型的联合作战方案优选

为选择作战方案中的最优方案,对所有的方案进行了排序,依据定性准则和定量的数学模型,利用多目标模糊决策分析方法,对联合作战方案的相关因素进行了分析,综合评价出各方案的优劣程度,最后得到了较为合理的作战方案先后顺序.     

狮子搏兔,亦用全力——谈《水浒传》对几个小情节的处理

《水浒传》的情节所体现出的作者的艺术造诣,一直为读者和批评家津津乐道。对于三个女人的情节,体现了现代文学理论的设计理念,值得我们重视。本文试从因果逻辑这一规律来考察这三个相似情节中的相异性,从中我们可以看出作者深厚的艺术功底。     

Rayleigh衰落信道下一种实用的Turbo解码算法

通过理论和仿真实验证明:无论Rayleigh衰落信道是否完美估计,Max-Log-MAP算法都与信噪比无关,而且还与其他信道参数无关.通过缩放Max-Log-MAP算法输出软信息的幅度,在没有增加运算量的前提下,解码性能提高到了与Log-MAP算法相当的程度.由于缩放软信息的Max-Log-MAP算法不需要任何信道参数...