Adaptive random search for continuous simulation optimization

We present, analyze, and compare three random search methods for solving stochastic optimization problems with uncountable feasible regions. Our adaptive search with resampling (ASR) approach is a framework for designing provably convergent algorithms that are adaptive and may consequently involve local search. The deterministic and stochastic shrinking ball (DSB and SSB) approaches are also convergent, but they are based on pure random search with the only difference being the estimator of the optimal solution [the DSB method was originally proposed and analyzed by Baumert and Smith]. The three methods use different techniques to reduce the effects of noise in the estimated objective function values. Our ASR method achieves this goal through resampling of already sampled points, whereas the DSB and SSB approaches address it by averaging observations in balls that shrink with time. We present conditions under which the three methods are convergent, both in probability and almost surely, and provide a limited computational study aimed at comparing the methods. Although further investigation is needed, our numerical results suggest that the ASR approach is promising, especially for difficult problems where the probability of identifying good solutions using pure random search is small. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Scheduling with variable time slot costs

In this article, we study a class of new scheduling models where time slot costs have to be taken into consideration. In such models, processing a job will incur certain cost which is determined by the time slots occupied by the job in a schedule. The models apply when operational costs vary over time. The objective of the scheduling models is to minimize the total time slot costs plus a traditional scheduling performance measure. We consider the following performance measures: total completion time, maximum lateness/tardiness, total weighted number of tardy jobs, and total tardiness. We prove the intractability of the models under general parameters and provide polynomial‐time algorithms for special cases with non‐increasing time slot costs.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

The transshipment fund mechanism: Coordinating the decentralized multilocation transshipment problem

The multilocation replenishment and transshipment problem is concerned with several retailers facing random demand for the same item at distinct markets, that may use transshipments to eliminate excess inventory/shortages after demand realization. When the system is decentralized so that each retailer operates to maximize their own profit, there are incentive problems that prevent coordination. These problems arise even with two retailers who may pay each other for transshipped units. We propose a new mechanism based on a transshipment fund, which is the first to coordinate the system, in a fully noncooperative setting, for all instances of two retailers as well as all instances of any number of retailers. Moreover, our mechanism strongly coordinates the system, i.e., achieves coordination as the unique equilibrium. The computation and information requirements of this mechanism are realistic and relatively modest. We also present necessary and sufficient conditions for coordination and prove they are always satisfied with our mechanism. Numerical examples illustrate some of the properties underlying this mechanism for two retailers. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于两阶段感染过程分析的蠕虫传播模型SSI

合理的蠕虫传播模型可以准确地描述蠕虫类恶意代码在网络中的传播行为,有助于在开展蠕虫防护、检测和抑制技术的研究时更深入地分析蠕虫的传播机制。通过引入和分析蠕虫的感染时间这个在经典的传染病模型研究中被忽略的重要因素,使用确定性建模分析方法推导得出SSI蠕虫传播模型,合理地反映网络中的脆弱性主机在蠕虫传播时可能的状态转换。模拟仿真表明,SSI模型可以相对准确地描述蠕虫类恶意代码在网络中的传播过程。     

一种无线传感器网络中的Sybil攻击检测方案

Sybil攻击破坏无线传感器网络中的数据融合、公平资源分配等机制,因此对Sybil攻击的防范与检测具有很重要的意义。将一种基于到达时间差（TDOA）的三维定位引入到Sybil攻击的检测中,算法可以检测存在的Sybil攻击并对Sybil节点进行定位。通过性能分析证明该算法具有开销小、有效性高的特点。     

某型自行火炮传动系统延迟时间维修建模实例研究

对某型自行火炮底盘传动系统维修保障现状和维修数据进行分析,引入延迟时间概念及其维修建模方法,建立延迟时间维修优化模型,提出主客观数据相结合的贝叶斯参数估计方法。考虑到设备的客观数据不足的情况,首先利用主观数据进行参数估计,在此基础上,再通过逐步完善的客观数据进行参数修正。最后,在一些满足实际情况的假定条件下,运用建立的延迟时间费用模型对检测周期进行了优化分析。     

一类具有时滞的病毒动力学模型分析

研究一类具有时滞的病毒动力学模型。研究了系统解的有界性;讨论了各个非负平衡点的局部稳定性,应用比较定理得到了各非负平衡点全局渐近稳定的充分条件。     

战役物资供应链定性仿真研究

运用定性建模与仿真的方法研究战役物资供应链的整体供应能力,能从整体性角度出发,全局遍历战役物资供应链的不利影响因素。简要介绍了SDG(Signed Directed Graph)定性仿真工具的结构和功能;建立了战役物资供应链整体功能定性仿真模型;根据案例描述,把定量描述转化成定性值,设置定性仿真初始值,进行定性仿真实验。仿真结果为:影响战役物资供应链整体供应能力的主要不利因素为"敌火力打击我战役供应指挥机构",可找到其产生的推理路径,改变定性初始值的设置,控制不利影响因素出现的次数。     

Sol-gel法制备纳米TiO_2凝胶过程的控制

以钛酸四丁酯为前驱物,采用溶胶-凝胶法制备TiO2凝胶。通过改变各原料的配比和实验条件对凝胶过程中的作用机理进行了探究。结果表明:当无水乙醇与钛酸四丁酯的摩尔比为12:1,蒸馏水与钛酸四丁酯的摩尔比为3:1,抑制剂与钛酸四丁酯的摩尔比为1:1～2:1,pH=2,最适水解温度为25℃时,制得了稳定的二氧化钛凝胶。     

基于马尔可夫更新过程的装甲装备使用可用度模型

针对在装甲装备使用可用度评估中,采用统计评估法存在统计周期长和不能用于研制阶段的缺点,利用马尔可夫更新过程,建立了考虑工作时间、修复性维修时间、延误时间和预防性维修时间的装甲装备的稳态可用度模型,并进行了示例应用。该模型可以在装备研制阶段,根据装备各项时间参数的分布,来估计装甲装备的使用可用度,可为装备设计、装备维修间隔期规划等提供理论和方法指导。