现代坦克火控系统体系结构发展的轨迹

对现代坦克火控系统体系结构发展的轨迹进行了较为详尽的论述,分析了几种主要类型的火控系统体系结构.对于在战车火控系统的发展历程中起重要作用的指挥仪式火控系统,从上反射式系统和下反射式系统两方面进行了比较分析.最后指出了用控制主线的观点来分析和预测火控系统发展所具有的优点.     

综合性大学师范类学生学习倦怠现状研究

本文用连榕等参照Maslach编制的《大学生学习倦怠调查量表》对师范类专业大学生进行问卷调查,旨在探讨综合性大学中师范类学生学习倦怠状况。结果表明：学生的学习倦怠处于中等程度。男生的学习倦怠程度显著高于女生;不同年级的学生在学习倦怠的各个维度上差异显著;不同专业学生学习倦怠状况差异显著,理科最为严重;城镇学生的学习倦怠程度和农村学生差异不显著。     

软件分域测试可靠性评估的注记

软件可靠性评估是软件可靠性研究的重要问题.文中通过反例证明了分域测试的Thayer Lipow Nel son评估方法是不正确的,将样本点排序法用于分域产生可靠性评估,获得了软件可靠性置信下限.最后给出一个实例说明该方法的可行性.     

Probabilistic solution and bounds for serial inventory systems with discounted and average costs

We consider the infinite horizon serial inventory system with both average cost and discounted cost criteria. The optimal echelon base‐stock levels are obtained in terms of only probability distributions of leadtime demands. This analysis yields a novel approach for developing bounds and heuristics for optimal inventory control polices. In addition to deriving the known bounds in literature, we develop several new upper bounds for both average cost and discounted cost models. Numerical studies show that the bounds and heuristic are very close to optimal.© 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

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     

SG高压水室在典型循环工况下的低周疲劳评估

本文应用有限元分析了ＳＧ高压水室在典型负荷波动下的热应力,根据所计算出的峰值应力循环幅,引用低周疲劳设计曲线,对结构的低周疲劳用ＡＳＭＥ规范进行了评估,发现ＳＧ在典型载荷循环下不产生显著的低周疲劳损伤。     

Minimizing makespan in a multimode multiprocessor shop scheduling problem

We study the problem of multimode scheduling tasks on dedicated processors, with the objective of minimizing the maximum completion time. Each task can be undertaken in one among a set of predefined alternative modes, where each mode specifies a required set of dedicated processors and a processing time. At any time each processor can be used by a single task at most. General precedence constraints exist among tasks, and task preemption is not allowed. The problem consists of assigning a mode and a starting time to each task, respecting processor and precedence constraints, to minimize the time required to complete all tasks. The problem is NP-hard in several particular cases. In previous works, we studied algorithms in which a solution was obtained by means of an iterative procedure that combines mode assignment and sequencing phases separately. In this paper, we present some new heuristics where the decision on the mode assignment is taken on the basis of a partial schedule. Then, for each task, the mode selection and the starting time are chosen simultaneously considering the current processor usage. Different lower bounds are derived from a mathematical formulation of the problem and from a graph representation of a particular relaxed version of the problem. Heuristic solutions and lower bounds are evaluated on randomly generated test problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 893–911, 1999     

Newsvendor bounds and heuristics for serial supply chains with regular and expedited shipping

We study an infinite‐horizon, N‐stage, serial production/inventory system with two transportation modes between stages: regular shipping and expedited shipping. The optimal inventory policy for this system is a top–down echelon base‐stock policy, which can be computed through minimizing 2N nested convex functions recursively (Lawson and Porteus, Oper Res 48 (2000), 878–893). In this article, we first present some structural properties and comparative statics for the parameters of the optimal inventory policies, we then derive simple, newsvendor‐type lower and upper bounds for the optimal control parameters. These results are used to develop near optimal heuristic solutions for the echelon base‐stock policies. Numerical studies show that the heuristic performs well. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

软件无失效测试数据的统计分析

软件可靠性估计是软件可靠性研究的重要问题之一,文中对分布式软件系统可靠性的评估方法进行了研究,给出了软件系统可靠度的最优置信下限.最后以某大型软件的评估为例,说明该方法的应用.     

多轴越野车辆悬架部件结构优化设计

基于有限单元法、变密度方法和车辆动力学分析方法,对某型多轴越野车辆的典型部件(前悬架摆臂)主体进行了结构优化设计研究。结果表明:通过结构优化,降低了摆臂的质量,提高了摆臂的静态、动态结构刚度和强度。