多自由度系统及结构非线性自由振动的摄动谐波平衡法

本文在谐波平衡法的基础上,引入摄动的思想,得出了解多自由度系统及结构的非线性自由振动的新方法。其解的形式为小参数和谐波的级数形式,因此,其解不会遗漏任何项,方程为线性的代数方程;利用线性变换,将系数矩阵变换为对角阵,一旦求出线性模态,就可得其解,比线性化迭代法优越得多。算例表明,本文方法对于小振幅有较高的精度,对于较大振幅其结果也是令人满意的。     

高可靠、强实时分布式系统的切换技术研究

本文首先给出某高可靠、强实时分布式系统及系统的两种切换方案的简要描述，然后对切换技术的实现进行讨论；最后，在建立强实时双工系统的可靠性模型基础上，对系统的两种切换方案进行分析与比较。研究结果表明：对于本系统，机组级切换优于结点机级切换，且可以减少程序的复杂度，提高系统的可靠性与实时性。     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

一种新的并行多通道数据采集系统时序偏差校正技术

介绍了多通道并行采样技术在高速数据采集系统的应用和其局限性 ,然后给出了一种测量多通道系统各通道间时序偏差的方法 ;接着提出了一种在数字域校正通道间时序偏差的新方法 ,可以大大提高多通道并行采样技术的性能 ;最后对该方法进行了仿真以验证其可行性和性能。     

信息战建模的分析与探讨

通过对信息战建模的分析与总结,指出了一个完善的信息战建模方法应具备的基本功能;给出了这种建模方法的结构流图,并分析了结构流图的构成.该方法建立的信息战模型,能有效地识别信息战的效果,对信息战的理论发展和具体实施都有较重要的指导作用.     

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

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

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