演化硬件中变异概率对进化算法首次命中时间的影响

在(1+1)EAs中,采用马尔可夫链推移时间分析法,推导出了平均首次命中时间的表达式。从理论上分析了变异概率对平均首次命中时间的影响。结果表明适当的变异概率会缩短平均首次命中时间,加快进化算法的寻优时间。     

谈自给式呼吸器的选用

论述了自给式呼吸器在灾害事故抢险救援中的重要性,分析了三种自给式呼吸器的使用特点和使用注意事项,介绍了三种常用的自给式呼吸器防护时间的确定方法,以及在实际救援作业中合理选用呼吸器应考虑的事项。     

基于CP CI总线的时统模块测量电路设计

为解决时统模块的测试问题,提出了一种基于CPCI总线的数字时统模块测量电路。重点对测量电路的组成、测量原理、CPCI总线接口设计与驱动设计等内容进行了介绍。提出的测量电路满足了4块某型时统模块的批量测试需求。该测量电路具有稳定性高、性价比高、易于实现等优点,适合于工程应用。     

边消警文献信息资源保障体系建设构想

阐述了边消警文献信息资源保障体系建设的内涵和建设原则,从资源体系建设、服务体系建设、网络平台建设和保障体系建设等四方面对边消警文献信息资源保障体系建设的内容进行了探讨.     

Single machine just‐in‐time scheduling problems with two competing agents

In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single‐machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due‐date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP‐hard even for a nonrestrictive due‐date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due‐date (a sufficiently small due‐date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP‐hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 1–16, 2014     

Choosing arrival process models for service systems: Tests of a nonhomogeneous Poisson process

Service systems such as call centers and hospital emergency rooms typically have strongly time‐varying arrival rates. Thus, a nonhomogeneous Poisson process (NHPP) is a natural model for the arrival process in a queueing model for performance analysis. Nevertheless, it is important to perform statistical tests with service system data to confirm that an NHPP is actually appropriate, as emphasized by Brown et al. [8]. They suggested a specific statistical test based on the Kolmogorov–Smirnov (KS) statistic after exploiting the conditional‐uniform (CU) property to transform the NHPP into a sequence of i.i.d. random variables uniformly distributed on [0,1] and then performing a logarithmic transformation of the data. We investigate why it is important to perform the final data transformation and consider what form it should take. We conduct extensive simulation experiments to study the power of these alternative statistical tests. We conclude that the general approach of Brown et al. [8] is excellent, but that an alternative data transformation proposed by Lewis [22], drawing upon Durbin [10], produces a test of an NHPP test with consistently greater power. We also conclude that the KS test after the CU transformation, without any additional data transformation, tends to be best to test against alternative hypotheses that primarily differ from an NHPP only through stochastic and time dependence. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 66–90, 2014     

Approximation algorithms for capacitated stochastic inventory systems with setup costs

We develop the first approximation algorithm with worst‐case performance guarantee for capacitated stochastic periodic‐review inventory systems with setup costs. The structure of the optimal control policy for such systems is extremely complicated, and indeed, only some partial characterization is available. Thus, finding provably near‐optimal control policies has been an open challenge. In this article, we construct computationally efficient approximate optimal policies for these systems whose demands can be nonstationary and/or correlated over time, and show that these policies have a worst‐case performance guarantee of 4. We demonstrate through extensive numerical studies that the policies empirically perform well, and they are significantly better than the theoretical worst‐case guarantees. We also extend the analyses and results to the case with batch ordering constraints, where the order size has to be an integer multiple of a base load. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 304–319, 2014     

飞行器试验多测控目标发射零点应急处理方法

飞行器飞行试验任务中,发射零点T0是整个测控系统启动运行的基准点,是保证测控系统有条不紊正常工作的关键因素。特别是执行多个测控目标连射飞行试验任务,多个发射零点的正确处理更是关乎试验任务的成败。在分析发射零点形成机制基础上,对发射零点在指控系统实时测控软件中的处理方法进行了研究,提出了一种实时测控软件重启后重新获得多测控目标正确发射零点的应急处理方法,解决了试验过程中一旦实时测控软件因重大软件故障导致初始发射零点丢失的问题,保障了试验任务的顺利进行。     

基于RCS序列的助推段弹道导弹识别

在弹道导弹的助推段,通过低分辨率雷达得到RCS序列作为识别的重要信息。由于运动特性和电磁散射特性的差异,弹道导弹在助推段的RCS序列与其他目标相比具有可识别性,但需要对其RCS序列进行处理。基于目标识别技术,详细阐述能从RCS序列中提取出的特征参数,并通过直方图、N点截图等方法给出了直观的反映。最后,将弹道导弹助推段特征与飞机、燃料舱等典型目标进行对比,得到可以作为识别参量的特征参数,并通过类内类间距离验证了有效性。