A complete importance ranking for components of binary coherent systems,with extensions to multi-state systems

Means of measuring and ranking a system's components relative to their importance to the system reliability have been developed by a number of authors. This paper investigates a new ranking that is based upon minimal cuts and compares it with existing definitions. The new ranking is shown to be easily calculated from readily obtainable information and to be most useful for systems composed of highly reliable components. The paper also discusses extensions of importance measures and rankings to systems in which both the system and its components may be in any of a finite number of states. Many of the results about importance measures and rankings for binary systems are shown to extend to the more sophisticated multi-state systems. Also, the multi-state importance measures and rankings are shown to be decomposable into a number of sub-measures and rankings.     

Quadratic programming with quadratic constraints

A program with a quadratic objective function and quadratic constraints is considered. Two duals to such programs are provided, and an algorithm is presented based upon approximations to the duals. The algorithm consists of a sequence of linear programs and programs involving the optimization of a quadratic function either unconstrained or constrained to the nonnegative orthant. An example involving production planning is presented.     

Cyclic best first search: Using contours to guide branch‐and‐bound algorithms

The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017     

基于发动机工作过程计算的空气滤清器模型

针对二级滤清式自动抽尘空气滤清器进行研究,提出了其基于发动机工作过程计算的功率损失计算模型.该模型以发动机工作过程计算为基础,考虑了空气滤清器进气阻力与发动机工作过程之间的影响.通过实例计算,说明该模型能够用来模拟空气滤清器所造成的功率损失,随发动机工况的变化关系,从而为进一步模拟动力装置效率打下相应的基础.     

基于新型滑模面的机械臂快速轨迹跟踪滑模变结构控制

从滑模变结构控制的趋近运动和滑模运动两个阶段人手,分别对影响其性能的滑模面和趋近律进行了设计．首先,基于线性滑模面和终端滑模面,设计了一种具有较快收敛速度的新型非线性滑模面,以缩短系统在滑模运动阶段的运动时间．同时,根据幂次趋近律提出了一种改进的趋近律设计方法,保证了其趋近运动的速度,并减弱了传统滑模变结构控制所固有的抖振．最后,将该方法用于机械臂的滑模轨迹跟踪控制策略设计,仿真结果表明,该策略保证了机械臂对期望轨迹的快速跟踪,具有较强的鲁棒性,并且验证了控制策略的有效性．     

全信息图像质量评估研究的发展综述

随着图像技术的广泛应用,图像的质量评估问题,即信息的可靠性问题,在自动化系统中的地位日益重要。全信息图像质量评估是针对目标原始图像和被测图像都已知时的被测图像评估。从历史发展角度系统地回顾了20世纪60年代以来全信息图像质量评估研究的发展历程和现状,并从算法的构成角度对代表性的全信息图像质量评估算法进行了分类与分析。由于图像质量评估函数的性能测定在其研究中具有重要的地位,对于图像质量评估函数的性能测定方案给予了说明。最后,从研究的深入角度上讨论图像质量评估研究的未来发展趋势。     

短波自动链路建立性能分析与优化设计

文章在分析2G-ALE建链流程的基础上,建立了平均建链概率和平均建链时间性能指标数学模型,依据此模型分析了信道扫描速率以及引导呼叫的长度对平均建链时间的影响。通过仿真比较了两种信道驻留时间的优化方案,结果表明在差信道条件下适当降低信道扫描速率可以减少平均建链时间。指标模型和仿真分析对于ALE系统的设计优化具有一定的参考意义。     

A dynamic-programming approach to continuous-review obsolescent inventory problems

Inventory models of modern production and service operations should take into consideration possible exogenous failures or the abrupt decline of demand resulting from obsolescence. This article analyzes continuous-review versions of the classical obsolescence problem in inventory theory. We assume a deterministic demand model and general continuous random times to obsolescence (“failure”). Using continuous dynamic programming, we investigate structural properties of the problem and propose explicit and workable solution techniques. These techniques apply to two fairly wide (and sometimes overlapping) classes of failure distributions: those which are increasing in failure rate and those which have finite support. Consequently, several specific failure processes in continuous time are given exact solutions. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 757–774, 1997     

Probabilistic a priori routing-location problems

In many routing-location models customers located at nodes of a network generate calls for service with known probabilities. The customers that request service in a particular day are served by a single server that performs a service tour visiting these customers. The order of providing service to customers for each potential list of calls is uniquely defined by some a priori fixed basic sequence of all the customers (a priori tour). The problems addressed in this article are to find an optimal home location or an optimal basic sequence for the server so as to minimize the expectation of a criterion. The following criteria are considered: the total waiting time of all the customers, the total length of the tour, the maximal waiting time of a customer, the average traveled length per customer, and the average waiting time per customer. We present polynomial-time algorithms for the location problems. For the routing problems we present lower bounds that can be calculated efficiently (in polynomial time) and used in a branch-and-bound scheme. © 1994 John Wiley & Sons, Inc.