CPN仿真的C4ISR体系结构验证评估

在分析基于CPN (Colored Petri Net)仿真的体系结构验证评估过程的基础上,对体系结构产品到可执行模型的转换方法进行了探讨,并结合实例利用具体信息系统对其体系结构进行了逻辑验证、行为和效能评估.     

旧中国海军鱼雷艇部队发展史略

从清朝末年开始,中国海军就追随世界海军发展的潮流,着手购买和列装鱼雷艇.在此后的数十年间,清朝和民国先后向德国、英国及日本购买了50多艘鱼雷艇,并组建了鱼雷艇部队.在近现代的几次对外战争中,也多次出现过中国海军鱼雷艇的身影.由于种种原因,旧中国海军的鱼雷艇未能在战争中发挥出应有的作用.     

C4ISR系统需求模型化开发方法研究

本文分析了软件需求和军事需求之间的区别,论证了军事需求的独特性及其面临的问题,并结合我军指挥信息系统需求研究的实践,提出了C4ISR系统需求模型化开发方法,包括需求模型化的过程、需求模型的组成及描述方式.     

略论新世纪图书馆立身之本

在21世纪,图书馆只有以信息为基础,面向读者,提高效益,不断革新才能生存和发展。     

Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine

This paper tackles the general single machine scheduling problem, where jobs have different release and due dates and the objective is to minimize the weighted number of late jobs. The notion of master sequence is first introduced, i.e., a sequence that contains at least an optimal sequence of jobs on time. This master sequence is used to derive an original mixed‐integer linear programming formulation. By relaxing some constraints, a Lagrangean relaxation algorithm is designed which gives both lower and upper bounds. The special case where jobs have equal weights is analyzed. Computational results are presented and, although the duality gap becomes larger with the number of jobs, it is possible to solve problems of more than 100 jobs. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003     

Discrete‐time analysis of MAP/PH/1 multiclass general preemptive priority queue

We use the matrix‐geometric method to study the MAP/PH/1 general preemptive priority queue with a multiple class of jobs. A procedure for obtaining the block matrices representing the transition matrix P is presented. We show that the special upper triangular structure of the matrix R obtained by Miller [Computation of steady‐state probabilities for M/M/1 priority queues, Oper Res 29(5) (1981), 945–958] can be extended to an upper triangular block structure. Moreover, the subblock matrices of matrix R also have such a structure. With this special structure, we develop a procedure to compute the matrix R. After obtaining the stationary distribution of the system, we study two primary performance indices, namely, the distributions of the number of jobs of each type in the system and their waiting times. Although most of our analysis is carried out for the case of K = 3, the developed approach is general enough to study the other cases (K ≥ 4). © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 662–682, 2003.     

Scheduling patients in an ambulatory surgical center

This paper presents a deterministic approach to schedule patients in an ambulatory surgical center (ASC) such that the number of postanesthesia care unit nurses at the center is minimized. We formulate the patient scheduling problem as new variants of the no‐wait, two‐stage process shop scheduling problem and present computational complexity results for the new scheduling models. Also, we develop a tabu search‐based heuristic algorithm to solve the patient scheduling problem. Our algorithm is shown to be very effective in finding near optimal schedules on a set of real data from a university hospital's ASC. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

一种快速有效的循环平稳信号检测方法

TSAE-Z算法把时间切片自相关包络检测和可变步进的Zoom-FFT检测相结合,实现了对循环平稳信号的快速、精确检测,仿真结果表明,在相同数据长度条件下,TSAE-Z算法能够使检测运算时间减少3个数量级;在相同执行时间的条件下,TSAE-Z算法能在提高检测分辨率的同时使检测性能提升6dB以上。     

软件化雷达的多路超高速ADC数字谱分析

用于软件雷达硬件平台的并行多路等效时间超高速ADC系统中,客观地存在着诸多不可避免的工作非均匀性,如:时基抖动、通道直流偏置不均衡及通道增益不一致等等,而造成取样输出信号的频谱发生畸变,影响雷达系统性能.综合讨论了由于采样非均匀和通道偏置及增益不一致对取样信号数字谱的影响,在矩形抽样和理想抽样情况下,建立了该信号数字频谱的完整数学模型,并以理想抽样的正弦信号为例进行详细分析,得到了采样系统输出信噪比的计算公式,为系统的后续补偿校正,及对软件雷达系统指标的确定与分配提供了参考和依据.     

Optimal empty vehicle redistribution for hub‐and‐spoke transportation systems

This article considers the empty vehicle redistribution problem in a hub‐and‐spoke transportation system, with random demands and stochastic transportation times. An event‐driven model is formulated, which yields the implicit optimal control policy. Based on the analytical results for two‐depot systems, a dynamic decomposition procedure is presented which produces a near‐optimal policy with linear computational complexity in terms of the number of spokes. The resulting policy has the same asymptotic behavior as that of the optimal policy. It is found that the threshold‐type control policy is not usually optimal in such systems. The results are illustrated through small‐scale numerical examples. Through simulation the robustness of the dynamic decomposition policy is tested using a variety of scenarios: more spokes, more vehicles, different combinations of distribution types for the empty vehicle travel times and loaded vehicle arrivals. This shows that the dynamic decomposition policy is significantly better than a heuristics policy in all scenarios and appears to be robust to the assumptions of the distribution types. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008