基于随机服务资源管理对象的装备维修保障系统仿真建模

装备维修保障系统(EMSS)是一类复杂的动态系统,如何对其有效地仿真建模是一个问题。首先,以"物理层—业务层"的两层分解方法详细地对EMSS进行分析。然后,将一般的面向对象思想扩展为随机服务资源管理对象(SSRMO)来对EMSS物理层仿真建模。接着,先给出了基于UML动态建模技术的EMSS业务建模方法,然后将业务流程分解为每个SSRMO的业务规则来实现EMSS的业务流程模型。最后,给出了一个全面的仿真实例并给出了详尽的仿真结果,揭示了两层分析法的较完备性和SSRMO对物理资源和人为规则进行建模的可行性。     

基于步进频率正交信号的星载MIMO-GMTI雷达空时频处理研究

多发多收(MIMO)体制雷达综合采用多通道、多频技术,为解决星载GMTI面临的探测慢速运动目标和消除盲速估计等问题提供了有效途径。MIMO雷达工作的基础是有效的波形设计。因此,在分析正交波形性能的基础上,结合GMTI应用需求,建立了星载MIMO雷达步进频率正交信号的基本参数确定准则,研究了步进频率MIMO雷达空时频联合自适应处理的基本原理,通过仿真验证了MIMO雷达在杂波抑制和GMTI性能上的优势。     

建筑火灾风险模糊综合评估方法研究

按照建筑火灾发展的不同时间阶段,建立了四阶段的模糊综合评估模型,用来评估财产损失和建筑损坏情况。根据专家意见和笔者研究,确定了建筑火灾风险评估指标体系,使用层次分析法得到各指标权重,并对某大厦进行了火灾风险评估。研究结果表明该方法具有较好的应用价值,实现了用模糊综合评估方法对建筑火灾分阶段的风险评估,反映出火灾发展各时间阶段的情况和影响火灾风险的主要因素。     

低空情况下中末制导交班问题解决方案探讨

低空环境下,由于地海杂波、多路径效应等的影响,雷达的探测精度大幅降低,进而影响采用复合制导体制的防空导弹武器系统的中末制导交班。为解决这一问题,提出了主动导引头一维角度搜索的系统解决方案。对导引头角度搜索方案进行了设计,并仿真分析了导引头角度搜索截获性能。仿真结果表明,该方案能够较好地解决低空环境下的中末制导交班问题。     

美军“多域战”概念探析

"多域战"概念由美陆军率先提出,是美军在联合作战概念上的又一次创新。"多域战"是美陆军力图拓展多领域作战能力、美军反制"反介入/区域拒止"威胁和打造在未来高强度对抗战争中的新优势的有力手段。"多域战"概念具有作战领域多维扩展、要素体系高度融合、指挥体制扁平灵活、军队编制精简多能和技术装备革新整合的特点。近年来,美军不断推动"多域战"的完善,为其发展提供了理论支撑、科技支撑、实践支撑和智力支撑。美军"多域战"概念的实施前景挑战与机遇并存。     

国防科技助力“一带一路”建设

国防科技能够为"一带一路"沿线国家的经济、政治、安全、科技、文明等方面的发展进步做出重要贡献,我国可以将核能、航空、航天、船舶等国防科技领域作为重点先导领域推进实施。要着眼面临的机遇与挑战,着重从促进战略对接、打造品牌优势、推进军民融合、加强人才培养和关注人文交流等方面搞好战略应对。     

Estimating the probability that a simulated system will be the best

Consider a stochastic simulation experiment consisting of v independent vector replications consisting of an observation from each of k independent systems. Typical system comparisons are based on mean (long‐run) performance. However, the probability that a system will actually be the best is sometimes more relevant, and can provide a very different perspective than the systems' means. Empirically, we select one system as the best performer (i.e., it wins) on each replication. Each system has an unknown constant probability of winning on any replication and the numbers of wins for the individual systems follow a multinomial distribution. Procedures exist for selecting the system with the largest probability of being the best. This paper addresses the companion problem of estimating the probability that each system will be the best. The maximum likelihood estimators (MLEs) of the multinomial cell probabilities for a set of v vector replications across k systems are well known. We use these same v vector replications to form v^k unique vectors (termed pseudo‐replications) that contain one observation from each system and develop estimators based on AVC (All Vector Comparisons). In other words, we compare every observation from each system with every combination of observations from the remaining systems and note the best performer in each pseudo‐replication. AVC provides lower variance estimators of the probability that each system will be the best than the MLEs. We also derive confidence intervals for the AVC point estimators, present a portion of an extensive empirical evaluation and provide a realistic example. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 341–358, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10019     

Dominating sets for rectilinear center location problems with polyhedral barriers

In planar location problems with barriers one considers regions which are forbidden for the siting of new facilities as well as for trespassing. These problems are important since they model various actual applications. The resulting mathematical models have a nonconvex objective function and are therefore difficult to tackle using standard methods of location theory even in the case of simple barrier shapes and distance functions. For the case of center objectives with barrier distances obtained from the rectilinear or Manhattan metric, it is shown that the problem can be solved in polynomial time by identifying a dominating set. The resulting genuinely polynomial algorithm can be combined with bound computations which are derived from solving closely connected restricted location and network location problems. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 647–665, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10038     

An asymptotically optimal greedy heuristic for the multiperiod single‐sourcing problem: The cyclic case

The dynamics of the environment in which supply chains evolve requires that companies frequently redesign their logistics distribution networks. In this paper we address a multiperiod single‐sourcing problem that can be used as a strategic tool for evaluating the costs of logistics network designs in a dynamic environment. The distribution networks that we consider consist of a set of production and storage facilities, and a set of customers who do not hold inventories. The facilities face production capacities, and each customer's demand needs to be delivered by a single facility in each period. We deal with the assignment of customers to facilities, as well as the location, timing, and size of inventories. In addition, to mitigate start and end‐of‐study effects, we view the planning period as a typical future one, which will repeat itself. This leads to a cyclic model, in which starting and ending inventories are equal. Based on an assignment formulation of the problem, we propose a greedy heuristic, and prove that this greedy heuristic is asymptotically feasible and optimal in a probabilistic sense. We illustrate the behavior of the greedy heuristic, as well as some improvements where the greedy heuristic is used as the starting point of a local interchange procedure, on a set of randomly generated test problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 412–437, 2003     

A simulation study of the efficiency of empirical Bayes' estimators of multiple correlated probability vectors

Empirical Bayes' methods had been used by Brier, Zacks, and Marlow [1] for estimating performance characteristic vectors of success probabilities. The problem is that of estimating k-dimensional success probabilities of dependent binomial random variables, which are highly correlated. The present study reinforces the results of the previous one by showing, via simulations, that the relative efficiency of the empirical Bayes estimators, compared to the Stein-type and to the maximum-likelihood ones, is very high. This holds even if the success proportions are based on a small number of trials. We study the case of equicorrelation structure with positive correlations.