LVC时间管理的实时性研究

针对当前分布交互仿真系统实时性方面不足而导致的真实仿真、虚拟仿真和构造仿真之间无法实现互操作的问题，通过对DIS、HLA等分布交互仿真体系结构的实时性影响因素进行分析，给出了LVC时间管理的实时性方法，并完成了LVC时间管理中间件的设计和中间件的性能测试。测试结果表明，该方法可以显著改善系统的实时性，对真实仿真、虚拟仿真和构造仿真（LVC）之间互操作的进一步研究具有重要的参考意义。     

LVC仿真技术综述

建模与仿真已成为装备研制的重要手段。为了规范仿真测试系统的体系结构,提高模型及仿真的互操作性、可重用性和可组合性,首先分析了装备仿真测试对LVC仿真技术的需求,然后介绍了国外LVC仿真技术的现状、问题、解决方法和给我们的启示。最后提出了研究LVC仿真一体化体系结构技术的建议,包括需要研究的具体内容和相关的措施。     

RTI／网络交互等待时间的测试

联合先进分布式仿真(JADS)联合试验部队是美国防部长办公室特许建立的,研究把高级分布式仿真(ADS)技术应用到试验和评估(T＆E)中.JADS执行三项试验计划(C4I,精确制导弹药和电子战),说明整个试验和评估范围的若干部分,并且观察试验和评估团体内的其它活动,以得出结论,其中一部分是电子战试验,采用高层体系结构(HLA).为了在试验执行之前理解预计的等待时间,JADS建立了一个试验台综合并对硬件和主要的软件组件进行试验.本文讨论在建立网络和自卫干扰机(SPI)试验联邦前测试广域网系统的等待时间的JADS计划.本文的重点是JADS描述RTI/网络交互所用的过程和工具的特征、在试验台上进行的系统特征测量,以及如何把该系统表征反馈进联邦的设计中去.     

基于HLA的电子战仿真测试与评估

针对电子战系统的特点,介绍了电子战系统开发与测试的一般过程。分析基于高层体系结构的电子战仿真测试与评估包括两个方面,HLA各组成部分性能以及电子战系统自身效能的测试与评估。在分析美国电子战仿真测试的基础上,将基于HLA的电子战系统应用于指挥自动化体系对抗仿真中,设计了对应的框架结构。分别对运行支撑系统KD-RTI和DMSORTI1.3v6在不同传输方式下的传输时延和丢包率进行了比较。进一步以信息的完备性为指标,对电子战系统的作战效能进行了评估。     

电子战仿真模型库系统建设方法

电子战仿真模型库系统提供经过校验的、可重用的模型,能够提高电子战模型和仿真设计与实现的效率和质量。总结分析了国内外相关的研究与开发工作,探讨了电子战仿真模型库系统的建设方法。其中,定义了电子战仿真模型设计规范的内涵,并通过示例展示了统一建模语言在电子战仿真模型设计规范描述中的应用;讨论了电子战仿真模型库系统功能、体系结构和安全性的设计方法。     

HLA的综合电子战体系对抗仿真系统

综合电子战体系对抗仿真系统是适应现代战争的研究需要而建立的用于研究和评估综合电子战系统在体系对抗下的作战效能的计算机作战模拟系统,首先阐述了基于HLA的电子战体系对抗仿真系统的总体设计规范,介绍了其体系结构,然后重点分析了体系对抗仿真中基于多层复合的仿真建模方法,最后讨论了电子战体系对抗仿真系统的设计.     

TENA体系结构在美军JMETC中的成功运用

美军联合任务环境试验能力(JMETC)是一种真实的、虚拟的和构造的(LVC)分布式试验系统,采用试验与训练使能体系结构(TENA)作为其基础体系结构.TENA提供了促进靶场测控系统间互操作性所需要的体系结构和软件能力,在重要的实地演习和许多分布式的试验事件中都得以成功使用,大幅提升了美军分布式试验和训练能力.     

ICE中间件的LVC集成模型研究

提出一种组合式建模方法,基于RLFP 4种模型,包括需求模型、逻辑模型、功能模型、物理模型对LVC仿真系统进行构建,并实现4种模型之间的转换,得到可实现仿真验证的LVC集成模型;其次介绍了一种分布式中间件ICE及其通信模式,用于实现LVC仿真模型的集成,并针对当前LVC系统中存在的弱实时性问题提出了一种时间管理方法,最后借助一个仿真训练实例验证LVC仿真系统的通信和集成方法。     

电子战训练仿真系统分析与设计

电子战仿真训练基于建模仿真与计算机技术,其意义在于为仿真对抗演练高级训练模式创造条件.以电子战训练仿真系统开发为应用背景,提出了一种基于高层体系结构(HLA)仿真系统的分析与设计方法,以通信对抗训练仿真为例,展示了所提出的方法的可应用性,联邦成员代码自动生成工具与统一建模语言(UML)的应用提高了电子战训练仿真系统分析与设计的效率.     

STK在电子战交战过程仿真中的应用

针对电子战交战过程仿真中作战效果难以评估、交战过程难以描述的问题,利用系统建模和视景仿真技术,探索了STK在电子战交战过程仿真中的应用方法,分析了STK的电子战仿真应用能力,建立了STK在电子进攻、电子防护和电子支援过程中应用的步骤,并以EA-18G为例,对其电子战交战过程进行了仿真和分析,为进行电子战交战过程数据化、工程化、可视化仿真提供了参考.     

Improved bounds for batch scheduling with nonidentical job sizes

Here, we revisit the bounded batch scheduling problem with nonidentical job sizes on single and parallel identical machines, with the objective of minimizing the makespan. For the single machine case, we present an algorithm which calls an online algorithm (chosen arbitrarily) for the one‐dimensional bin‐packing problem as a sub‐procedure, and prove that its worst‐case ratio is the same as the absolute performance ratio of . Hence, there exists an algorithm with worst‐case ratio , which is better than any known upper bound on this problem. For the parallel machines case, we prove that there does not exist any polynomial‐time algorithm with worst‐case ratio smaller than 2 unless P = NP, even if all jobs have unit processing time. Then we present an algorithm with worst‐case ratio arbitrarily close to 2. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 351–358, 2014     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015     

Defense spending and economic growth: Extended empirical analysis for the European Union

Previous empirical studies on the defense spending-economic growth nexus such as Kollias et al. (2007 Kollias, C., N. Mylonidis, and S. Paleologou. 2007. “A panel data analysis of the nexus between defense spending and growth in the European Union.” Defense and Peace Economics 18 (1): 75–85.[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]), Mylonidis (2008 Mylonidis, N. 2008. “Revisiting the nexus between military spending and growth in the European Union.” Defense and Peace Economics 19 (4): 265–272.[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]), Dunne and Nikolaidou (2012 Dunne, J. P., and E. Nikolaidou. 2012. “Defense spending and economic growth in the EU15.” Defense and Peace Economics 23 (6): 537–548.[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]) analyzed this relationship in the case of the EU15. This study extends the analysis with the inclusion of more EU members and investigates the long run causal ordering between the two variables. Findings reported herein are not uniformed across all EU members. It is also found that end of Cold War has significant negative impact on defense expenditures of former east-European countries.     

THE FATE OF DISPUTED TERRITORIES: AN ECONOMIC ANALYSIS

This paper presents a simple model to characterize the outcome of a land dispute between two rival parties using a Stackelberg game. Unlike Gershenson and Grossman (2000 Gershenson, D. and Grossman, H.I. 2000. Civil conflict: ended or never ending?. Journal of Conflict Resolution, 44(6): 807–821.  [Google Scholar]), we assume that the opposing parties have access to different technologies for challenging and defending in conflict. We derive the conditions under which territorial conflict between the two parties is less likely to persist indefinitely. Allowing for an exogenous destruction term as in Garfinkel and Skaperdas (2000 Garfinkel, M. and Skaperdas, S. 2000. Conflict without misperceptions or incomplete information: how the future matters. Journal of Conflict Resolution, 44(6): 793–807. [Crossref], [Web of Science ®] , [Google Scholar]), we show that, when the nature of conflict becomes more destructive, the likelihood of a peaceful outcome, in which the territory’s initial possessor deters the challenging party, increases if the initial possessor holds more intrinsic value for the disputed land. Following Siqueira (2003 Siqueira, K. 2003. Conflict and third‐party intervention. Defence and Peace Economics, 14(6): 389–400. [Taylor & Francis Online], [Web of Science ®] , [Google Scholar]), our model has policy implications for peace through third‐party intervention.     

Scheduling twin robots on a line

This article introduces the twin robots scheduling problem (TRSP), in which two robots positioned at the opposite ends of a rail are required to deliver items to positions along the rail, and the objective is to minimize the makespan. A proof of ‐hardness of the TRSP is presented, along with exact and heuristic algorithms. Computational results on challenging instances are provided.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 119–130, 2014     

A stochastic assignment problem

There are n boxes with box i having a quota value Balls arrive sequentially, with each ball having a binary vector attached to it, with the interpretation being that if X_i = 1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas. © 2014 Wiley Periodicals, Inc. 62:23–31, 2015     

Analysis of practical policies for a single link distribution system

In this paper we consider a transportation problem where several products have to be shipped from an origin to a destination by means of vehicles with given capacity. Each product is made available at the origin and consumed at the destination at the same constant rate. The time between consecutive shipments must be greater than a given minimum time. All demand needs to be satisfied on time and backlogging is not allowed. The problem is to decide when to make the shipments and how to load the vehicles with the objective of minimizing the long run average of the transportation and the inventory costs at the origin and at the destination over an infinite horizon. We consider two classes of practical shipping policies, the zero inventory ordering (ZIO) policies and the frequency‐based periodic shipping (FBPS) policies. We show that, in the worst‐case, the Best ZIO policy has a performance ratio of . A better performance guarantee of is shown for the best possible FBPS policy. The performance guarantees are tight. Finally, combining the Best ZIO and the Best FBPS policies, a policy that guarantees a performance is obtained. Computational results show that this policy gives an average percent optimality gap on all the tested instances of <1%. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Approximation algorithms for sequential batch‐testing of series systems

We introduce and study a generalization of the classic sequential testing problem, asking to identify the correct state of a given series system that consists of independent stochastic components. In this setting, costly tests are required to examine the state of individual components, which are sequentially tested until the correct system state can be uniquely identified. The goal is to propose a policy that minimizes the expected testing cost, given a‐priori probabilistic information on the stochastic nature of each individual component. Unlike the classic setting, where variables are tested one after the other, we allow multiple tests to be conducted simultaneously, at the expense of incurring an additional set‐up cost. The main contribution of this article consists in showing that the batch testing problem can be approximated in polynomial time within factor , for any fixed . In addition, we explain how, in spite of its highly nonlinear objective function, the batch testing problem can be formulated as an approximate integer program of polynomial size, while blowing up its expected cost by a factor of at most . Finally, we conduct extensive computational experiments, to demonstrate the practical effectiveness of these algorithms as well as to evaluate their limitations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 275–286, 2016     

RAIN,GROWTH, AND CIVIL WAR: THE IMPORTANCE OF LOCATION

We re‐examine the Miguel et al. (2004 Miguel, E., Satyanath, S. and Sergenti, E. 2004. Economic shocks and civil conflict: an instrumental variables approach. Journal of Political Economy, 112(4): 725–753. [Crossref], [Web of Science ®] , [Google Scholar]) study of the impact of growth on civil war, using growth in rainfall as an instrument. Miguel et al. (2004 Miguel, E., Satyanath, S. and Sergenti, E. 2004. Economic shocks and civil conflict: an instrumental variables approach. Journal of Political Economy, 112(4): 725–753. [Crossref], [Web of Science ®] , [Google Scholar]) – in our view, erroneously – include countries participating in civil wars in other states. Restricting the conflict data to states with conflict on their own territory reduces the estimated impact of economic growth on civil war. We show how spatial correlations in rainfall growth and participation in civil conflicts induce a stronger apparent relationship in the mis‐classified data.     

AN ENDOGENOUS GROWTH MODEL OF CAPITAL AND ARMS ACCUMULATION

This paper attempts to examine the effect of an anticipated foreign military threat on the steady‐state growth rate and the transitional behavior of the economy. The modeling strategy follows the Sandler and Hartley (1995 Sandler, T. and Hartley, K. 1995. The Economics of Defense, Cambridge: Cambridge University Press.  [Google Scholar]) and Dunne et al. (2005 Dunne, J.P., Smith, R.P. and Willenbockel, D. 2005. Models of military expenditure and growth: a critical review. Defence and Peace Economics, 16: 449–461. [Taylor & Francis Online], [Web of Science ®] , [Google Scholar]) viewpoints to emphasize the role of national defense in affecting growth from the perspective of both the demand and the supply sides. We thus combine the public capital version of endogenous growth with a framework of competitive arms accumulation. It is found that the key factor determining the steady state and the transitional effects of a rise in the foreign military threat on the home weapon–capital ratio, the consumption–capital ratio, and the rate of economic growth, is the degree of relative risk aversion.