纯时滞三种群捕食系统持续生存与全局吸引性

研究了具有HollingⅡ功能性反应的纯时滞的两捕食者、一食饵生物系统,通过构造合理的Lyapunov函数讨论了系统的全局吸引性,并得到系统持续生存的充分条件。     

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

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

基于时间序无圈有向图的多准则优化成像调度

合理有效地利用遥感卫星资源获取更多高质量影像数据是卫星成像调度的重要工作。提出了一种新的成像调度解决方案。应用图论相关理论,建立卫星成像时间序无圈有向图模型,利用多项准则作为衡量标准对不同成像路径进行评价,提出时间序多准则最短路径算法求取优化成像路径。理论分析和实验表明,该解决方案可以在较短时间内获得多条pareto优化成像路径,具有良好的调度性能。     

辉煌与式微：《今古奇观》的历史沉浮

《今古奇观》是中国话本小说史上重要的小说选集,成书于崇祯五年至十七年之间。热情歌颂了明代中叶以来趋于活跃的市民精神和个性解放。世界范围内,有关《今古奇观》的研究日渐式微,但是从历史时段和选本观念来看,仍有难以掩盖的辉煌。     

变论域模糊自适应滑模有限时间收敛制导律

针对拦截高速机动目标的需求,研究了一种变论域模糊自适应滑模有限时间收敛制导律。推导了导弹-目标空间拦截模型,设计了三维滑模制导律;根据有限时间收敛制导律专家的经验,采用模糊自适应控制方法对滑模制导律的非切换项进行逼近,并设计了有限时间收敛模糊控制规则;提出了一种新型变论域伸缩因子,设计了基于新型伸缩因子的变论域模糊自适应滑模有限时间收敛制导律。仿真结果表明,所设计的制导律能够使导弹准确命中目标,并能够达到视线角速率有限时间收敛,且与比例制导律相比,具有更高的制导精度和更短的飞行时间。     

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

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

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     

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     

基于时间反转声学理论的超声相控阵超分辨率成像方法

在超声相控阵检测领域,常规成像方法遵守瑞利准则,其成像分辨率受到波长限制。研究时间反转多信号分类(Time Reversal-MUltiple SIgnal Classification, TR-MUSIC)方法,在保持超声波工作频率不变且不影响系统探测深度的前提下,可提高成像分辨率,实现超分辨率成像。通过全矩阵采集方法获取被测对象的超声阵列数据;利用平面B扫描和TR-MUSIC方法处理数据,得到二维和三维超声图像;依据图像特征评估被测对象内部状况。实验选取加工不锈钢试块作为被测对象,搭建超声相控阵检测系统,在试块内部加工6个直径为1 mm、可视为点散射体的相邻贯通孔作为缺陷。实验表明,TR-MUSIC方法能够区分并定位这6个相邻点散射体,而平面B扫描方法则不能。因此,基于时间反转声学理论的TR-MUSIC方法可以提高成像分辨率,改善超声图像质量。