GPS双星航姿测量研究

提出用两部测量型GPS接收机 ,实时观测两颗以上GPS卫星在站心坐标系下的高度角、方位角和载波相位 ,来推算基线 (船体 )的航向和姿态 ,初步解决了整周模糊度的解算问题 .文中对影响航向和姿态准确解算的因素进行了分析 ,并提出了改进的办法 .     

燃气轮机实际简单循环熵产分析

针对燃气轮机实际简单循环,应用熵产分析,对循环各部件不可逆损失分配情况进行分析,并给出实例计算.结果表明,燃烧室不可逆损失最大,其次是排气过程.     

一类具有免疫时滞和病毒颗粒的HIV模型的动力学性态分析

考虑感染细胞的治愈和未感染细胞吸收作用的影响,研究一类具有免疫时滞和病毒颗粒的HIV模型,通过分析特征方程研究平衡点的局部稳定性,利用规范型理论和中心流行定理得到确定Hopl分支方向和分支周期解稳定性的计算公式,并通过构造Lyapunov泛函,讨论未感染平衡点的全局稳定性．     

Resourcing for defense: Solving the roles and missions puzzle

One of the most important issues facing the post‐Cold War U.S. defense establishment concerns the future allocation of combat tasks and responsibilities among different branches of the armed forces. The challenge is to reduce unnecessary redundancy across roles and missions when resources are highly constrained, without compromising military effectiveness. Defining the policy problem as one of resource allocation rather than operational effectiveness, we develop a methodology for allocating roles and missions. Our methodology focuses at the highest level of force aggregation and uses a mathematical programming model to produce cross‐service cross‐mission trade‐offs that will yield the best total force combat and non‐combat potential within resource consumption constraints.     

LEACH—DRT算法中基于神经网络的数据预测算法

为了保证无线传感器网络中数据的完整性,针对基于LEACH路由协议的动态轮时间算法存在的问题,提出一种基于人工神经网络的数据预测算法。该动态轮时间算法中,部分簇因调整后的轮时间不足以完成数据的采集而丢失数据。数据预测算法结合传感器节点数据具有时空相关性的特点,将时空延迟算子引入神经网络模型,并通过建立的神经网络模型对数据进行预测。仿真时采用伯克利英特尔实验室的传感器数据,通过Mafl软件对模型进行测试并分析仿真结果。实验结果表明：该算法对连续多个数据的预测效果理想,预测误差始终保持在较低水平。     

一维热构件模型及其在船用核动力装置运行分析中的应用

建立了一维热构件模型 ,该模型具有广泛的适用性 ,可以模拟是否有内热源、不同几何形状及具有多种边界条件的热构件 .方程采用隐式有限差分法求解热传导方程 ,并将模型应用于核动力装置的运行分析中 .计算结果表明 ,本文所建立的一维热构件模型能逼真地描述一维热构件的温度场分布 ,计算精度高 .     

潜射反舰导弹武器系统作战效能指标体系设计初探

根据潜射反舰导弹武器系统作战使用情况,在借鉴ＷＳＥＩＡＣ系统效能分析方法基础上,结合作战运用效能分析方法,初步探讨了该武器系统作战效能指标体系的设计过程。     

Analysis of a finite‐buffer bulk‐service queue with discrete‐Markovian arrival process: D‐MAP/Ga,b/1/N

Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003.     

Network reliability assessment in a random environment

In this paper we consider networks that consist of components operating under a randomly changing common environment. Our work is motivated by power system networks that are subject to fluctuating weather conditions over time that affect the performance of the network. We develop a general setup for any network that is subject to such environment and present results for network reliability assessment under two repair scenarios. We also present Bayesian analysis of network failure data and illustrate how reliability predictions can be obtained for the network. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 574–591, 2003     

Scheduling jobs with piecewise linear decreasing processing times

We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003