多目标决策的特殊坐标系求解方法

在多目标决策问题中,满意解常常要在非劣解中寻找。一般来讲,对于两个目标(二维)的解的判别并不困难,但遇到多个目标(n维),且有多个可行解时,对非劣解的判别就显得有些繁复了。因此,采用直观容易的特殊坐标系来判别"非劣解",从而给出求解多目标决策问题满意解的方法。     

动态网络安全的框架模型

针对现有的静态网络安全模型存在的问题,提出了一种动态网络安全框架模型。该安全模型利用各种安全组件构建了立体的五层防御体系,并实现了防御能力的动态升级。     

舰船可靠性对维修费用的影响分析

对两类主要影响因素分别建立了相应的数学模型．依据约化理论,建立了维修费用的ＶＡＲ模型．同时,根据统计资料分析了实际舰载主要设备的故障规律,指出了传统定时维修方式的理论基础的不完整性．     

紧固件拆装时间预计模型

紧固件拆装作业时间是影响机械产品维修性的主要因素之一,占机械产品维修作业时间的70％～80％。因此,探讨紧固件拆装作业时间的预计方法,对研究、设计机械产品的维修性,将是十分必要的。通过分析紧固件拆装作业过程,探索出了影响拆装作业时间的诸因素,并对所有的影响因素进行分析、权衡和回归,建立紧固件拆装作业时间的预计模型。将此模型在某型履带式车辆上进行了实际验证,证明了模型的正确性及通用性。     

用于无线ATM的协议及方法分析

ＷＡＴＭ 被认为是下一代个人通信网络的解决方案,或是Ｂ－ＩＳＤＮ 网络的无线延伸。目前无线ＡＴＭ 仍处于发展初期,ＡＴＭ 论坛和ＩＴＵ－Ｔ 都未制定正式标准,研究人员正在建立实验性的Ｗ ＡＴＭ 网络,并在其上面实验各种不同的协议。ＡＴＭ 类的无线网络将在未来的宽带通信网中扮演一个重要的角色     

基于最大熵谱估计验证战术导弹的气动模型

现代谱估计方法是验证系统仿真模型的有效方法。战术导弹飞行试验的遥、外测数据记录了大量的过程参数,可以利用这些参数进行气动力和气动力矩的计算,与飞行试验过程参数进行分析比较。应用最大熵谱估计检验导弹的气动力和气动力矩模型的可信性,可以给出定量的结果。文章给出的方法可以作为战术导弹气动参数模型研究的一种辅助手段。     

基于LPS模型的飞行器控制系统故障诊断方法

传统故障诊断方法一般针对测量信号而展开,未考虑其实际物理连接特性对故障诊断结果的显著影响。随着专业电气系统设计软件的广泛应用,设计人员容易获取系统的物理连接特性和逻辑连接特性。论文通过对产品层、系统层的信号、物理连接及其互连关系的分析,提出了一种将抽象的逻辑信号和具体的物理连线统一起来的逻辑物理综合(LPS)模型,并研究了基于导线表文件和网表文件的LPS模型实例化方法,开发了一套智能故障检测软件,进行了算例验证,结果表明：基于LPS模型的故障诊断方法能够将系统故障定位到指定产品级别上,具有极大的工程应用价值。     

Dynamic pricing under first order Markovian competition

We evaluate the effect of competition on prices, profits, and consumers' surplus in multiperiod, finite horizon, dynamic pricing settings. In our base model, a single myopic consumer visits two competing retailers, who offer identical goods, in a (first order Markovian) probabilistic fashion—if the posted price exceeds the consumer's valuation for the good, he returns to the same store in the following period with a certain probability. We find that even a small reduction in the return probability from one—which corresponds to the monopoly case at which prices decline linearly—is sufficient to revert the price decline from a linear into an exponential shape. Each retailer's profit is particularly sensitive to changes in his return probability when it is relatively high, and is maximized under complete loyalty behavior (i.e., return probability is one). On the other hand, consumer surplus is maximized under complete switching behavior (i.e., return probability is zero). In the presence of many similar consumers, the insights remain valid. We further focus on the extreme scenario where all consumers follow a complete switching behavior, to derive sharp bounds, and also consider the instance where, in this setting, myopic consumers are replaced with strategic consumers. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Batch scheduling on a two‐machine jobshop with machine‐dependent setup times

The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem

The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011