以优质的信息服务打造武警高校名牌图书馆

武警院校图书馆要以提供优质的信息服务为着眼点,不断创新服务理念、服务方法和服务手段,并通过各项措施保障优质信息服务,达到创建武警高校名牌图书馆的目的。     

网络中心战战场精确时间的同步技术

本文阐述网络中心战战场的时间同步技术、精确时间体系结构、双向比对远距离时间同步技术。对各种时间获取技术进行了比较,对GPS定时原理作了较为详细的说明。     

Deterministic and stochastic scheduling with teamwork tasks

We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f₁(C₁), f₂(C₂), … , f_n(C_n)), where f_i(C_i) is a general, nondecreasing function of the completion time C_i of task i. We show that the optimal sequence to minimize the maximum cost MC = max f_i(C_i) can be derived by a simple rule if there exists an order f₁(t) ≤ … ≤ f_n(t) for all t between the functions {f_i(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ f_i(C_i) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Flow‐shop batch scheduling with identical processing‐time jobs

In many practical situations of production scheduling, it is either necessary or recommended to group a large number of jobs into a relatively small number of batches. A decision needs to be made regarding both the batching (i.e., determining the number and the size of the batches) and the sequencing (of batches and of jobs within batches). A setup cost is incurred whenever a batch begins processing on a given machine. This paper focuses on batch scheduling of identical processing‐time jobs, and machine‐ and sequence‐independent setup times on an m‐machine flow‐shop. The objective is to find an allocation to batches and their schedule in order to minimize flow‐time. We introduce a surprising and nonintuitive solution for the problem. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Bounding the optimal burn‐in time for a system with two types of failure

Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we consider the problem of determining bounds to the optimal burn‐in time and optimal replacement policy maximizing the steady state availability of a repairable system. It is assumed that two types of system failures may occur: One is Type I failure (minor failure), which can be removed by a minimal repair, and the other is Type II failure (catastrophic failure), which can be removed only by a complete repair. Assuming that the underlying lifetime distribution of the system has a bathtub‐shaped failure rate function, upper and lower bounds for the optimal burn‐in time are provided. Furthermore, some other applications of optimal burn‐in are also considered. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Production scheduling with history‐dependent setup times

We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

振荡器相位噪声对GNSS接收机载波跟踪数字锁相环性能的影响

关于振荡器相位噪声引起的GNSS接收机载波跟踪数字锁相环相位抖动,目前的解析结论仍是基于模拟锁相环的,不能说明相位抖动大小与中频积累时间的关系,因此不能有效指导高灵敏度、高精度载波跟踪锁相环参数设计.本文首先推导中频积累输出的频率白噪声、频率游走噪声序列的功率谱,然后基于数字二阶锁相环离散线性模型导出了环路相位抖动公式并进行了仿真验证,最后对公式进行了解析和数值分析.分析结果表明:频率白噪声、频率游走噪声引起的二阶载波跟踪锁相环相位抖动,均随中频积累时间单调递增,随环路带宽先递减后递增.本文推得的相位抖动公式及其随参数变化特征的分析结论,可用于具体指导GNSS载波跟踪锁相环参数设计.     

主动隔振系统的最优控制时滞

针对主动隔振系统带有时滞的鲁棒渐进稳定问题,研究了时滞的存在对最优控制算法控制效果的影响,运用MATLAB中LMI工具,采用变步长试凑的方法,解出了最优控制系统反馈控制鲁棒渐进稳定的最大允许时滞上界。最后,通过数值仿真,验证了理论的正确性。仿真结果表明:随着控制时滞的增大,主动隔振效果逐渐变差,一旦反馈控制力时滞超过最大允许时滞上界,系统便将发散。同时,增大反馈控制力和减小加权矩阵控制目标的相应权值,可以提高最大允许时滞上界。     

基于WVD-Radon变换的宽带延展目标回波参数提取

分析了宽带延展目标的时延-时间伸缩效应及其导致的回波信号在时域和频率域的特性;针对LFM信号的时频分布特点,利用WVD和Radon联合变换技术,提取LFM信号在时-频域分布上的特性参数,提出了一种宽带延展目标回波参数提取方法,得到了目标的时延—时间伸缩分布.仿真结果表明,该方法是可行的.     

非平稳数据处理方法与瞬时频率

利用“经验模式分解”(EMD)方法,任何复杂的数集都能够被分解为有限且通常数量较少的“本征模式函数”。“本征模式函数”产生瞬时频率,最终结果表示为H ilbert谱规定的能量-频率-时间分布。应用“经验模式分解”方法表示自然现象中的传统非线性平衡系统及其数据的数值结果,同时给出实例展示了这种新方法的作用和效果。这种方法阐明了能量-频率-时间分布,进一步显示出对非线性非平稳系统的处理效果———精确化、形象化和可视化。