盲自适应的多用户CDMA阵列接收机

研究了基于CMOE准则的空时多用户检测及其自适应实现。这是一种盲方法 ,不要求任何训练序列 ,能够抑制多址干扰 ,解决远近效应问题。进一步 ,分析了多用户CDMA阵列接收机的性能 ,并且与多用户单天线接收机、单用户阵列接收机以及单用户单天线接收机进行了比较。     

空时分组编码的译码算法

空时分组编码是最近提出的使用多个天线应用于瑞利衰落信道的编码技术。利用传输矩阵的正交性推导出其译码算法的一般表达式     

装备性能影响舰艇作战能力的敏感性研究

首先给出了基于效用函数的舰载武器系统作战能力评估模型,以便在装备性能与舰艇作战能力之间建立联系,在此基础上对部分装备的性能变化影响舰艇作战能力的敏感性进行了分析.     

微小型固体火箭发动机点火特性试验

设计了一种适用于某微小型固体火箭发动机的点火器 ,对某微小型固体火箭发动机的点火特性进行了大量试验研究 ,引入了初始点火压强的概念 ,找出了影响点火延迟时间散布的主要规律 ,确定了能满足微小型固体火箭发动机点火性能的点火方案     

正弦波型直流无刷电动机位置伺服系统的变结构控制

在分析正弦波型直流无刷电动机数学模型的基础上,采用比例等速变速控制策略(PCV)设计控制器,应用于正弦波型直流无刷电动机位置伺服系统.仿真结果表明:与传统PI控制器比较,PCV控制策略可以明显改善系统的品质,并增强系统的鲁棒性.     

紧固件拆装时间预计模型

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

气控软体驱动器结构分析与优化设计

气控软体驱动器的结构特性对其运动和力学特性影响显著,目前气控软体驱动器支反力和倾角性能亟须提升.基于ABAQUS提供的脚本接口,采用Python语言开发脚本建立气控软体驱动器参数化仿真模型,将尺寸因子作为优化变量,联立Isight和ABAQUS,采用单因子试验方法确定倾角和支反力两个目标量的高敏感性影响因子.运用归一化...     

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