装备保障路径选择算法研究

战争时效性对装备保障提出了更高的要求。针对装备保障路径的特点,对传统的解决最短路问题的Dijksta算法进行改进,引入并行处理的概念,提出了改进的最短路算法,建立了新的路径选择评价模型。经实验,此算法可快速、科学和稳定地解决一定范围内装备保障路径选优问题。     

基于无伸缩因子CORDIC算法的DDS设计

提出一种无伸缩因子的双曲线坐标旋转数字计算(CORDIC)算法,该算法解决了伸缩因子的补偿问题,扩展了传统算法中受限的收敛域。对改进算法进行了误差分析,并通过仿真图直观比较,表明采用的算法精度满足硬件精度要求。提出了一种CORDIC算法的多级流水线结构和一种新的直接数字频率合成器(DDS)设计方法,此方案降低了硬件复杂度,易于实现。     

采用贪婪启发式的异构WSNs部分覆盖算法

异构无线传感网络(Wireless Sensor Networks,WSNs)的多数监测应用要求监测区域被部分覆盖。因此,对异构WSNs的部分覆盖问题进行研究。提出基于贪婪启发式的部分覆盖算法(Greedy Heuristic-based Partial Coverage,GHPC)。先对异构WSNs的部分覆盖问题进行定义和形式化表述,再利用贪婪启发式算法求解。GHPC算法选择具有最大覆盖贡献的节点加入覆盖集,进而满足覆盖要求。仿真数据表明,与同类算法相比,提出的GHPC算法能够在满足覆盖要求的同时,降低活动节点数。     

机动目标跟踪的修正输入估计(MIE)算法与自适应α-β算法

机动目标的跟踪是雷达数据处理中的重要问题,对此进行了探讨的代表性的算法有Singer算法、IE算法、VD算法、IMM算法等。本文提出了修正的输入估计(MIE)与自适应的α—β两种新算法。MIE算法性能与IE算法相当,但运算量比IE算法小。自适应α—β算法的性能略低于以上几种算法,但运算量则大大低于上述几种算法,在对性能要求不很高的情况下,采用这种算法是较为合适的。     

互补问题中无SLC限制的内点算法

针对互补问题提出了一种无SLC限制的内点算法,仅要求线性函数F(x)=Hx q中的F是一个P*(τ)函数,不需要满足范数Lipschitz条件.并对该算法的全局收敛性做了证明。     

基于IMM-RUASFF的网络化目标跟踪算法

针对目前网络化目标跟踪算法存在实时性差、精度低等问题进行了研究。首先,基于网络信息共享需求,建立了网络探测节点的目标跟踪模型;其次,网络探测节点目标跟踪需求和实战要求发现目标经常是有多种运动状态并存,而单一模型的滤波器不能满足对机动目标跟踪性能的要求,采用了基于交互式多模型(Interacting Multiple Model,IMM)的有反馈实时更新的异步状态融合算法。最后,针对多个探测节点目标跟踪的状态融合估计问题,提出了一种有反馈实时更新的异步状态融合算法,通过仿真验证了算法的有效性。     

二进制无线传感器网络目标定位解析算法初步研究

针对二进制传感器网络目标定位跟踪问题,提出一种利用传感器位置信息和目标穿过传感器探测区域的时间信息进行解算的解析算法,并对该算法进行了仿真验证。仿真结果表明,相对于目前最常用的线性拟和算法,该算法具有对目标经过的传感器数量要求低、解算精度高等优点。     

光纤通道调度算法研究

针对光纤通道协议中没有规定数据调度算法的问题,在满足系统实时性的情况下,经过对FC-AE-ASM协议的深入分析,提出一种基于令牌桶的优先级和加权轮转相结合的调度算法,同时给出了权值分配和轮转周期的确定方法。在以消息的延迟率作为算法性能的评价指标的基础上,经过仿真,对调度算法的性能进行了验证,结果显示出该算法可以很好地满足航空电子系统实时性要求。     

一种面向异构车载通信中基于高效签密的安全通信机制

采用不同加密技术的车辆或者其他通信实体进行通信,就形成了异构车载网络。针对异构车载网络的安全和隐私问题,提出轻量的基于身份的条件隐私保护的签密算法（Lightweight Identity-based Conditional privacy-preserving Signcryption,LICS）。LICS算法利用双线性对满足车间通信的安全要求。同时,LCIS算法确保消息能够从基于身份加密（Identity-Based Cryptosystem,IBC）的车辆传输至基于公钥基础设施（Public-Key Infrastructure,PKI）的车辆。此外,LICS算法支持批量解签密,允许接收者同时批量处理多条消息,提高了解签密效率。在随机预言模型下基于q-线性Diffie-Hellman逆和q-强Diffie-Hellman的困难性问题下证明了LICS算法的安全性。性能分析表明,提出的LICS算法降低了算法的运算时间,减少了通信成本。     

机载制导武器的武器-目标分配算法研究

机载制导武器的武器-目标分配算法是智能航空指控系统的一个基础研究问题。本文在建立了武器-目标分配的基本概念和对算法要求的基础上,提出了两种武器-目标分配算法;基于决策论的武器-目标分配算法和基于导弹截获区的武器-目标分配算法,并对基于导弹截获区的武器-目标分配算法进行了仿真实验。结果表明,此算法具有高透明性、有限消除最大威肋、杀伤概率最大、充分利用机载武器等特点。     

Scheduling and lot streaming in two‐machine open shops with no‐wait in process

We study the problem of minimizing the makespan in no‐wait two‐machine open shops producing multiple products using lot streaming. In no‐wait open shop scheduling, sublot sizes are necessarily consistent; i.e., they remain the same over all machines. This intractable problem requires finding sublot sizes, a product sequence for each machine, and a machine sequence for each product. We develop a dynamic programming algorithm to generate all the dominant schedule profiles for each product that are required to formulate the open shop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and test a computationally efficient heuristic for the open shop problem. Our results indicate that solutions can quickly be found for two machine open shops with up to 50 products. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Stochastic call center staffing with uncertain arrival,service and abandonment rates: A Bayesian perspective

In this article, we introduce staffing strategies for the Erlang‐A queuing system in call center operations with uncertain arrival, service, and abandonment rates. In doing so, we model the system rates using gamma distributions that create randomness in operating characteristics used in the optimization formulation. We divide the day into discrete time intervals where a simulation based stochastic programming method is used to determine staffing levels. More specifically, we develop a model to select the optimal number of agents required for a given time interval by minimizing an expected cost function, which consists of agent and abandonment (opportunity) costs, while considering the service quality requirements such as the delay probability. The objective function as well as the constraints in our formulation are random variables. The novelty of our approach is to introduce a solution method for the staffing of an operation where all three system rates (arrival, service, and abandonment) are random variables. We illustrate the use of the proposed model using both real and simulated call center data. In addition, we provide solution comparisons across different formulations, consider a dynamic extension, and discuss sensitivity implications of changing constraint upper bounds as well as prior hyper‐parameters. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 460–478, 2016     

The collection depots location problem on networks

In this paper we investigate the collection depots location problem on a network. A facility needs to be located to serve a set of customers. Each service consists of a trip to the customer, collecting materials, dropping the materials at one of the available collection depots and returning to the facility to wait for the next call. Two objectives are considered: minimizing the weighted sum of distances and minimizing the maximum distance. The properties of the solutions to these problems are described. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 15–24, 2002; DOI 10.1002/nav.10000     

由四川汶川地震看科学施救

四川汶川地震发生后，党中央、国务院高度重视，迅速调集救援力量展开救援，并提出了科学施救原则。救援中，各救援力量严格贯彻落实科学施救原则，最大限度地降低人员伤亡和财产损失。就汶川地震的特点如何理解和贯彻科学施救原则谈谈自己的认识。     

Efficient algorithms for flexible job shop scheduling with parallel machines

Job shop scheduling with a bank of machines in parallel is important from both theoretical and practical points of view. Herein we focus on the scheduling problem of minimizing the makespan in a flexible two-center job shop. The first center consists of one machine and the second has k parallel machines. An easy-to-perform approximate algorithm for minimizing the makespan with one-unit-time operations in the first center and k-unit-time operations in the second center is proposed. The algorithm has the absolute worst-case error bound of k − 1 , and thus for k = 1 it is optimal. Importantly, it runs in linear time and its error bound is independent of the number of jobs to be processed. Moreover, the algorithm can be modified to give an optimal schedule for k = 2 .     

Proactive release procedures for just‐in‐time job shop environments,subject to machine failures

In this paper, we consider just‐in‐time job shop environments (job shop problems with an objective of minimizing the sum of tardiness and inventory costs), subject to uncertainty due to machine failures. We present techniques for proactive uncertainty management that exploit prior knowledge of uncertainty to build competitive release dates, whose execution improves performance. These techniques determine the release dates of different jobs based on measures of shop load, statistical data of machine failures, and repairs with a tradeoff between inventory and tardiness costs. Empirical results show that our methodology is very promising in comparison with simulated annealing and the best of 39 combinations of dispatch rules & release policies, under different frequencies of breakdowns. We observe that the performance of the proactive technique compared to the other two approaches improves in schedule quality (maximizing delivery performance while minimizing costs) with increase in frequency of breakdowns. The proactive technique presented here is also computationally less expensive than the other two approaches. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

新型逻辑器件与数字电子产品的系统集成研究

提出了一种实现电子产品系统集成和小型化的设计思想 ,探讨了采用FPGA (FieldPro grammableGateArray) ,SOC(System On a Chip) ,IP(IntellectualProperty)等新型逻辑器件以及EDA(ElectronicDesignAutomation)手段的设计方法 ,实现软硬件协同仿真、验证和电子虚拟样机以及设计重用的设计理念 ,为 2 1世纪智能电子产品的系统集成开辟了一条先进的技术途径。     

Zero-sum games with multiple goals

This paper investigates a class of two-person zero-sum multiple payoff games in which each component is deterministic. The problem of minimizing a player's total underachievement of a fixed set of goals is shown to reduce to a linear programming problem. Applications are discussed and illustrative examples are presented.     

线性核时频信号表示及其仿真

根据ｃｈｉｒｐ信号在模糊域的特点,本文提出了线性核时频表示方法。这种方法在提高分辨率、消除交叉项以及抑制噪声等方面都具有较高的性能。理论分析和实验结果都证实了这种方法的有效性     

Algorithms for minimizing total cost,bottleneck time and bottleneck shipment in transportation problems

We consider the transportation problem of determining nonnegative shipments from a set of m warehouses with given availabilities to a set of n markets with given requirements. Three objectives are defined for each solution: (i) total cost, TC, (ii) bottleneck time, BT (i.e., maximum transportation time for a positive shipment), and (iii) bottleneck shipment, SB (i.e., total shipment over routes with bottleneck time). An algorithm is given for determining all efficient (pareto-optimal or nondominated) (TC, BT) solution pairs. The special case of this algorithm when all the unit cost coefficients are zero is shown to be the same as the algorithms for minimizing BT. provided by Szwarc and Hammer. This algorithm for minimizing BT is shown to be computationally superior. Transportation or assignment problems with m=n=100 average about a second on the UNIVAC 1108 computer (FORTRAN V)) to the threshold algorithm for minimizing BT. The algorithm is then extended to provide not only all the efficient (TC, BT) solution pairs but also, for each such BT, all the efficient (TC, SB) solution pairs. The algorithms are based on the cost operator theory of parametric programming for the transportation problem developed by the authors.