A novel method for determination of lethal radius for high-explosive artillery projectiles

A new model has been defined that enables the estimation of the lethal radius (radius of efficiency) of HE (High Explosive) artillery projectiles against human targets. The model is made of several modules: CAD (Computer Aided Design) modeling, fragment mass distribution estimation, fragment initial velocity prediction, fragment trajectory calculation, effective fragment density estimation, and high explosive projectile lethal radius estimation. The results were compared with the experimental results obtained based on tests in the arena used in our country, and the agreement of the results was good. This model can be used in any terminal-ballistics scenario for high explosive projectiles since it is general, para-metric, fast and relatively easy to implement.     

A generalized assignment model for dynamic supply chain capacity planning

We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

A sequential Bayesian generalization of the Jelinski–Moranda software reliability model

The Jelinski–Moranda model of software reliability is generalized by introducing a negative‐binomial prior distribution for the number of faults remaining, together with a Gamma distribution for the rate at which each fault is exposed. This model is well suited to sequential use, where a sequence of reliability forecasts is made in the process of testing or using the software. We also investigate replacing the Gamma distribution with a worst‐case assumption about failure rates (the worst‐case failure rate in models such as this is not infinite, since faults with large failure rates are immediately discovered and removed). © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

应用知识推理的防空兵射击指挥辅助决策模型

针对现代空袭方式的新特点,提出了应用知识推理的防空兵射击指挥辅助决策模型,在已经研究比较成熟的模型算法的基础上进行了改进,并将人工智能的知识推理引入辅助决策.定量计算与定性分析相结合,为解决防空兵射击指挥这种半结构化问题提供了新的思路.     

Estimation for dirichlet mixed models

Dirichlet mixed models find wide application. Estimation is usually achieved through the method of moments. Here we present an iterative hybrid algorithm for obtaining the maximum likelihood estimate employing both modified Newton-Raphson and E-M methods. This successful MLE algorithm enables calculation of a jack-knife MLE. Simulation comparison of the three estimates is provided. The MLE substantially improves upon the moments estimator particularly with increasing dimension. The jack-knife MLE in turn offers dramatic improvement over the MLE.     

作战模拟规则探讨

作战模拟规则是作战模拟系统的核心组成部分,在简要阐述作战模拟系统中所涉及规则的概念及分类的基础上,就规则的体系结构、规则与实体、规则与行动、规则与模型之间的关系,以及规则的组成要素和规则分辨率确定原则等进行了研究。     

Landmarks in defense literature

Preliminary design of an experimental world-circling spaceship RM001 RAND Corporation, Santa Monica, Calif. (1946)     

Solving a (0, 1) hyperbolic program by branch and bound

A problem in (0, 1) hyperbolic programming is formulated and solved by the use of branch and bound methods. Computational results are presented including a comparison among several branching rules. Heuristic methods for quickly finding relatively good feasible solutions are presented and tested. The problem finds application in the scheduling of common carriers. In the solution of the main problem, a subproblem is identified and solved. A geometric analogue is presented, which allows an interesting interpretation of the subproblem. The subproblem itself finds application in the design of gambles.     

ITSON：一种基于拓扑演化的P2P智能搜索机制

P2P系统中节点的动态特性对搜索性能的稳定提出了很大挑战。借鉴社会学和组织学相应原理,提出拓扑演化模型捕获节点的运动规律。节点模拟人类在社会网络中的行为,根据自身和他人的兴趣变化,随搜索过程的进行,利用自身局部信息,动态、自适应地调整网络拓扑,及时反映资源分布以及搜索内容的动态变化,维持资源合理组织。在此基础上提出的智能搜索机制ITSON(InTelligent Search based on tOpology evolutioN),利用消息转发的智能性进行路由方向决策,从而迅速定位资源提供节点。仿真结果说明,ITSON能自动优化网络,具有良好的搜索性能和自适应特性。