基于逆动力学分析的履带车辆行驶路面测量方法研究

履带车辆行驶路面多为山地、丘陵等非人工构筑路面。以该类行驶路面为研究对象,利用Kane-Huston方法对履带车辆进行逆动力学分析,给出履带车辆行驶路面的测量原理,在此基础上设计一种间接进行行驶路面测量的方法,并在某车辆试验场预设行驶路面进行实地测量。通过测量结果的计算和比较,证明该方法是切实可行的。     

ARIA分组密码差分功耗分析

分析了密码算法加密过程的功耗泄露模型,给出了差分功耗分析的基本原理,针对ARIA分组密码中查找S盒的功耗泄漏进行了差分功耗分析,并进行仿真实验。实验结果表明：ARIA密码中S盒查表操作功耗消耗易遭受差分功耗攻击,对800个随机明文的功耗曲线进行实验分析,可获取ARIA加密前4轮轮密钥,结合密钥扩展算法即可获取128位的主密钥。     

Multi‐period maintenance scheduling of tree networks with minimum flow disruption

We introduce a multi‐period tree network maintenance scheduling model and investigate the effect of maintenance capacity restrictions on traffic/information flow interruptions. Network maintenance refers to activities that are performed to keep a network operational. For linear networks with uniform flow between every pair of nodes, we devise a polynomial‐time combinatorial algorithm that minimizes flow disruption. The spiral structure of the optimal maintenance schedule sheds insights into general network maintenance scheduling. The maintenance problem on linear networks with a general flow structure is strongly NP‐hard. We formulate this problem as a linear integer program, derive strong valid inequalities, and conduct a polyhedral study of the formulation. Polyhedral analysis shows that the relaxation of our linear network formulation is tight when capacities and flows are uniform. The linear network formulation is then extended to an integer program for solving the tree network maintenance scheduling problem. Preliminary computations indicate that the strengthened formulations can solve reasonably sized problems on tree networks and that the intuitions gained from the uniform flow case continue to hold in general settings. Finally, we extend the approach to directed networks and to maintenance of network nodes. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

战场损伤分析过程研究及其应用

以某型火炮为例,详细介绍了利用基本功能项目分析、损伤模式及影响分析、损伤树分析及损伤定位分析等技术进行战场损伤分析的过程,阐述了各技术在分析过程中相互支持的关系,说明了它们在损伤评估系统中的应用,最后指出了分析过程中存在的一些问题。     

关于小尺寸装药用炸药薄膜的研究

利用真空蒸镀技术对太安炸药薄膜及其在小尺寸装药上的应用进行了研究。实验表明利用真空蒸镀技术可以研制出性能优良的炸药薄膜 ;红外光谱分析证明太安在蒸镀前后没有发生质的变化 ;扫描电镜分析得出了太安薄膜的微观结构 ;太安炸药薄膜在小尺寸装药上的应用表明了该装药具有可靠的传爆功能。     

保障性分析在现役装备维修资源确定中的应用

针对我军现役装备维修保障资源建设中的弊端,分析了在现役装备维修保障资源确定中实施保障性分析的可行性,并介绍了与传统保障性分析的不同点及其主要流程,从而为我军现役装备维修保障的确定与配置实施提供了一个良好的思考方向。     

弹性直槽式摆盘发动机的动力学分析

对弹性直导槽约束的摆盘发动机进行运动学和动力学研究,建立了该发动机工作过程的数学模型,并进行了仿真计算和结果分析,为解决运动部件不平衡性引起振动和噪声的问题提供了理论依据.     

The Economic Effect of Military Facility Contraction: A Naval Case Study

The global financial turmoil of 2008 has resulted in the curtailment of military expenditure in most western countries. At a sub-regional-level reductions in the level of activity at a major military facility can have significant economic impact. In the light of this, the paper has two objectives: to analyse the impact of the decision to terminate naval shipbuilding at the United Kingdom’s Portsmouth Naval Base; and, for illustrative purposes, to examine the possible economic consequences of further contraction at the facility. In pursuit of these aims, it is necessary to establish the output, income and employment generated by the base using a bespoke input–output model. The methodology employed can, with appropriate adjustments, be utilised in other military or civilian contexts.     

Steady‐state diffusion approximations for discrete‐time queue in hospital inpatient flow management

In this article, we analyze a discrete‐time queue that is motivated from studying hospital inpatient flow management, where the customer count process captures the midnight inpatient census. The stationary distribution of the customer count has no explicit form and is difficult to compute in certain parameter regimes. Using the Stein's method framework, we identify a continuous random variable to approximate the steady‐state customer count. The continuous random variable corresponds to the stationary distribution of a diffusion process with state‐dependent diffusion coefficients. We characterize the error bounds of this approximation under a variety of system load conditions—from lightly loaded to heavily loaded. We also identify the critical role that the service rate plays in the convergence rate of the error bounds. We perform extensive numerical experiments to support the theoretical findings and to demonstrate the approximation quality. In particular, we show that our approximation performs better than those based on constant diffusion coefficients when the number of servers is small, which is relevant to decision making in a single hospital ward.     

Aggregating courier deliveries

We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound.