算术映射交织器设计的改进

首先分析算术二次同余映射的原理 ,然后在此基础上对交织器的映射关系加以保奇偶序限制和移位运算 ,从而得到两个改进型的算术映射交织算法。通过仿真对改进型交织器的性能进行验证 ,结果说明在复杂度可比的情况下 ,改进后的交织器比传统分组交织器具有更好的译码性能。     

激波诱导惰性堆积粉尘运动的建模及数值模拟

基于空间平均的双流体模型 ,引入描述颗粒脉动速度的粒化温度 ,建立颗粒相的本构方程 ,将粒化温度模型推广到解决高速流动问题。采用AUSM+ 有限差分法 ,数值模拟激波在一定厚度的惰性粉尘床中传播及诱导粉尘颗粒运动的过程。结果表明 ,粒化温度模型较好地描述了这一过程 ,证实了此模型在处理稠密颗粒高速流动和流场存在强间断中的可行性     

球锥体高超声速绕流的俯仰阻尼导数的数值计算

采用Navier Stokes方程描述球锥体外形非定常振动流场 ,在Etkin理论下给出俯仰阻尼导数的计算公式。对定常流场的计算采用ADI形式的NND格式 ,对非定常流场的计算采用四步Runge Kutta方法 ,并引入变系数残值光顺技术加速收敛。将俯仰阻尼导数计算结果与实验及工程计算进行了比较 ,并数值研究了其随振动中心的变化规律。     

试论武器装备的效费比分析

运用价值工程(VE)方法分析武器装备,称效费比为价值。按照杜佩(Dupuy)的方法,把武器装备的效能转化为“战斗效能值”(OLI),又计算出了武器装备的全寿命费用,然后将2者加以对比,获得效能—费用的最佳组合,同时提出了选择武器装备系统的定量分析方法。这些对于提高我国国防经济效益,具有一定的指导和借鉴意义。     

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

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

飞船再入舱三维化学非平衡流数值模拟

对飞船再入舱高超声速化学非平衡三维流场进行数值模拟。控制方程为含化学反应源项的全Ｎａｖｉｅｒ－ Ｓｔｏｋｅｓ 方程组, 化学模型为高温空气的七组元模型, 其组元成分为Ｎ２ 、Ｏ２、ＮＯ、Ｎ、Ｏ、ＮＯ＋ 、ｅ－ 。差分格式采用张涵信院士提出的ＮＮＤ激波捕捉格式并用全耦合方法处理流动方程及化学反应方程, 对化学反应源项采用全隐式处理, 运用时间预处理技术以加快收敛。同时, 也对完全气体模型进行计算, 以分析真实气体效应。与实验数据对比, 说明本文结果是可信的。     

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     

Coherent systems based on sequential order statistics

The sequential order statistics (SOS) are a good way to model the lifetimes of the components in a system when the failure of a component at time t affects the performance of the working components at this age t. In this article, we study properties of the lifetimes of the coherent systems obtained using SOS. Specifically, we obtain a mixture representation based on the signature of the system. This representation is used to obtain stochastic comparisons. To get these comparisons, we obtain some ordering properties for the SOS, which in this context represent the lifetimes of k‐out‐of‐n systems. In particular, we show that they are not necessarily hazard rate ordered. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011