USB与RS232接口转换器的设计

针对RS232接口向USB接口转换的需求,提出两类设计方案。一类方案以CY7C68013芯片为代表,从硬件底层固件开始,进行全面系统开发。另一类采用类似CP2102的USB/RS232双向转换专用芯片进行设计,只需对芯片功能了解和应用,无须深入开发。第一类方案由于成本和开发难度的限制而很少被采用,但在特殊的操作系统或专门的应用条件下是优选方案。第二类方案经常被采用,但因受到芯片生产商的限制而无法进行特殊的应用。应用设计人员可以根据实际情况选择适合的方案。     

谈军校图书馆在信息素质教育中的地位和作用

介绍了信息素质及其教育的相关概念和理论,提出信息素质是军校生最根本的素质,并对图书馆在军校生信息素质教育中的主体地位进行了分析和阐述,概述了对信息素质教育与图书馆未来建设的认识。     

Machine scheduling with pickup and delivery

The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single‐machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP‐hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Attrition through a partially coordinated area defense

An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Finding the Kth shortest path in a time‐schedule network

We consider the problem of finding the Kth shortest path for a time‐schedule network, where each node in the network has a list of prespecified departure times, and departure from the node can take place only at one of these departure times. We develop a polynomial time algorithm independent of K for finding the Kth shortest path. The proposed algorithm constructs a map structure at each node in the network, using which we can directly find the Kth shortest path without having to enumerate the first K − 1 paths. Since the same map structure is used for different K values, it is not necessary to reconstruct the table for additional paths. Consequently, the algorithm is suitable for directly finding multiple shortest paths in the same network. Furthermore, the algorithm is modified slightly for enumerating the first K shortest paths and is shown to have the lowest possible time complexity under a condition that holds for most practical networks. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost

We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

火炮动态后坐装置有限元分析与优化

活塞缸是火炮动态后坐装置中的关键部件,其结构强度设计是整个实验装置强度设计的核心。利用I-DEAS软件,在对其进行实体建模和有限元网格划分的基础上,计算了活塞缸整体的应力应变值,得到了活塞缸工作时的应力应变图,并对其结构中应力状况恶劣的部位进行了结构优化。     

基于空时内插的机载双基地雷达杂波抑制方法

针对机载双基地雷达下视环境下非均匀地杂波的抑制问题,首先论述了抑制双基地机载雷达非均匀杂波的内插变换类空时自适应处理(space time adaptive processing,STAP)方法。然后在此基础上,提出了一种改进的空时二维内插变换方法(improved space time interpolation transfor-mation,ImSTINT)。该方法将训练样本的杂波子空间映射到单基地地基雷达的杂波子空间中,减少了变换后杂波子空间的自由度。仿真表明该方法比传统的内插变换类方法的杂波抑制性能好,且具有较强的稳健性和较少的样本量需求。     

专门用途英语课程中的合作教学

深刻认识专门用途英语的特点以及专门用途英语在专业课教学中的重要作用,并根据专门用途英语教师的素质要求和武警学院专门用途英语教师队伍的现状,提出了专门用途英语教师队伍建设和提高专门用途英语教学质量的四种合作教学模式。     

超级电容起动动态过程分析与建模仿真

为了改进装甲车辆起动性能,提出了用超级电容替代蓄电池起动的方案。介绍了超级电容的特性,建立了起动系统模型并进行了仿真研究,对仿真结果进行了实验验证。结果表明:仿真与实验的结论基本吻合,显示了该方案的可行性。