温熵图在热力学中的应用

本文给出了用温熵图证明卡诺定理的更直观更简单的方法;并通过实例证明采用温熵图处理某些热力学问题得出结论的过程也比使用P—V图或常用的热力学方法更为直观、方便。     

一种发送速率精确可控的分布式网络流量生成方法

介绍了一种灵活高效的分布式网络流量生成方法;通过加入权重因子,利用反馈机制不断对产生的网络流量进行调整直至流量大小误差符合用户设定需求;结合ON／OFF模型,采用分布式结构产生了流量速率可调节的具有自相似特性的网络流量。通过该方法产生的网络流量大小精确可控,且具有自相似性,能更好地反映出真实网络流量的特性。     

坦克嵌入式车场射击训练炮长操纵控制模型

在嵌入式射击模拟训练系统中,针对炮长操作过程对模拟训练的影响,建立了炮长操纵控制模型。炮长操纵控制模型包括炮长操纵模型和炮长射击决策模型。炮长操纵模型的建立是基于装备的物理模型和人的生理反应模型。炮长射击决策模型根据坦克射击教范要求,采用与/或正向演绎推理得到。在炮长操纵控制模型基础上,建立了射击反应时间模型,并与实际装备操作进行了比较,对建立的操纵控制模型进行了验证。     

时域基音同步叠加(TD-PSOLA)算法研究

针对TD-PSOLA算法的合成语音容易出现相位不连续的问题,提出了一种改进的平移综合方法。仿真结果显示,改进的算法能够提高合成语音的质量。     

The effects of information on a queue with balking and phase‐type service times

This article generalizes the models in Guo and Zipkin, who focus on exponential service times, to systems with phase‐type service times. Each arriving customer decides whether to stay or balk based on his expected waiting cost, conditional on the information provided. We show how to compute the throughput and customers' average utility in each case. We then obtain some analytical and numerical results to assess the effect of more or less information. We also show that service‐time variability degrades the system's performance. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

连续波DF/HF化学激光器喷管中氟原子复合计算

氟原子是连续波DF/HF化学激光器泵浦反应的重要参与者,其浓度分布尤其直接影响冷反应型激光器的泵浦效率及激射强度.在参与反应之前,氟原子将受到三体复合和壁面复合因素的影响而部分复合为氟分子.研究该因素对氟原子浓度的影响对激光器的分析优化是十分重要的.已有一定的实验方法可对其浓度进行测量研究,并建立了理论模型描述.将其与计算流体力学方法相结合对氟原子分布进行计算,研究了该方法的有效性,并对不同收缩段型面下氟原子复合进行了计算研究.     

基于先验信息的分布式星载单基线SAR/ATI方法

在综述了分布式星载SAP/ATI技术的基础上,阐述了单基线SAP/ATI技术的原理和杂波、噪声对检测、测速性能的影响,给出了一种基于先验信息的单基线SAR/ATI检测和测速方法,最后基于多功能的天基雷达仿真系统进行了仿真实验和性能分析.     

Two-agent scheduling with linear resource-dependent processing times

This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms.     

常规导弹战前运输任务优化模型

制定常规导弹战前运输计划时,各车辆运输时间和运输路线的安排是一个组合优化问题.运用军事运筹学和不确定性优化理论,充分考虑节点冲突性、车辆隐蔽性、任务时间、道路容量等因素,建立了运输任务方案的优化模型.该研究为常规导弹波次作战计划的制定和优化提供模型支持,有助于提高常规导弹作战指挥自动化和部队的生存能力.