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

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

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

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

线性系统的鲁棒容错控制设计方法

考虑了线性故障系统的鲁棒容错控制问题。利用状态反馈特征结构配置参数化结果,提出了一种鲁棒容错控制设计方法。该方法将故障系统的鲁棒容错控制问题转化为含有约束的最小化问题。数值算例及其仿真结果验证了所设计方法的简单性和有效性。     

对我国农村环境污染防治对策的系统分析

分析了现阶段我国农村环境污染的主要特点,并对农村环境污染防治的宏观对策进行了系统性分析。由手农村污染严重、防治形势严峻且比城市环境污染情况复杂,在制定农村环境污染防治对策时,需要运用系统工程原理全方位、全过程分析实际情况,制定整体效果最优的系统化对策组合,并注意对策措施的系统性、协调性、连续性和针对性。     

一种面向Agent的概念化建模方法*

面向Agent的建模方法为基于Agent系统的概念化描述提供了一种新的技术.针对多Agent系统分析与建模问题,扩展并规范了面向Agent概念化建模过程,定义了Agent模型及其扩展模型,并给出了形式化描述.同时,给出面向Agent的分析和设计过程,为其具体建模提供了一种高层指导.最后,与其它现有面向Agent的方法在应用方面进行了类比分析,为该方法的广泛和深入地应用研究打下基础.     

FIPA规范的防空导弹体系Agent建模方法

针对防空导弹体系建模的复杂性,探讨研究防空导弹体系的Agent建模方法.提出了基于G/A矩阵的Agent建模方法步骤,通过分析角色之间的关系描述了Agent组织结构,给出了角色类和Agent类的统一定义,并建立了Agent结构框架和类实现模型,最后构建了基于FIPA规范的MAS综合集成框架.该方法的提出,为防空导弹体系的进一步建模提供了方法依据.     

一类非线性控制系统模型的数学分析

采用非线性分析的方法,研究了一类非线性控制系统模型,得到解的整体存在性。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Value management of diagnostic equipment with cancelation,no‐show,and emergency patients

Magnetic resonance imaging and other multifunctional diagnostic facilities, which are considered as scarce resources of hospitals, typically provide services to patients with different medical needs. This article examines the admission policies during the appointment management of such facilities. We consider two categories of patients: regular patients who are scheduled in advance through an appointment system and emergency patients with randomly generated demands during the workday that must be served as soon as possible. According to the actual medical needs of patients, regular patients are segmented into multiple classes with different cancelation rates, no‐show probabilities, unit value contributions, and average service times. Management makes admission decisions on whether or not to accept a service request from a regular patient during the booking horizon to improve the overall value that could be generated during the workday. The decisions should be made by considering the cancelation and no‐show behavior of booked patients as well as the emergency patients that would have to be served because any overtime service would lead to higher costs. We studied the optimal admission decision using a continuous‐time discrete‐state dynamic programming model. Identifying an optimal policy for this discrete model is analytically intractable and numerically inefficient because the state is multidimensional and infinite. We propose to study a deterministic counterpart of the problem (i.e., the fluid control problem) and to develop a time‐based fluid policy that is shown to be asymptotically optimal for large‐scale problems. Furthermore, we propose to adopt a mixed fluid policy that is developed based on the information obtained from the fluid control problem. Numerical experiments demonstrate that this improved policy works effectively for small‐scale problems. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 287–304, 2016     

武器装备体系能力矩阵评估方法

针对武器装备体系能力难以客观、定量评估的问题,引入复杂网络理论,提出了基于矩阵运算的武器装备体系能力评估方法。分析了武器装备体系能力的概念,建立了武器装备体系的复杂层次网络模型,描述了装备网络的组成、运行过程,定义了装备网络的矩阵描述方法和矩阵运算规则,提出了装备网络作战能力描述参数,给出了装备网络能力的矩阵计算方法,进行了影响因素分析,最后通过实例验证了方法可行性、有效性和灵活性。