测试点的选取问题

在故障检测的过程中 ,每个测试点检测需要的时间可能不同。本文研究了如何选取一些测试点 ,使得这些测试点可以检测所有故障 ,而所需时间最少的问题。我们将其转化成整数规划问题 ,并给出一个求解算法 .最后给出一个实例对算法加以说明。     

A single‐period inventory placement problem for a serial supply chain

This article addresses the inventory placement problem in a serial supply chain facing a stochastic demand for a single planning period. All customer demand is served from stage 1, where the product is stored in its final form. If the demand exceeds the supply at stage 1, then stage 1 is resupplied from stocks held at the upstream stages 2 through N, where the product may be stored in finished form or as raw materials or subassemblies. All stocking decisions are made before the demand occurs. The demand is nonnegative and continuous with a known probability distribution, and the purchasing, holding, shipping, processing, and shortage costs are proportional. There are no fixed costs. All unsatisfied demand is lost. The objective is to select the stock quantities that should be placed different stages so as to maximize the expected profit. Under reasonable cost assumptions, this leads to a convex constrained optimization problem. We characterize the properties of the optimal solution and propose an effective algorithm for its computation. For the case of normal demands, the calculations can be done on a spreadsheet. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:506–517, 2001     

一种基于程序域边界分析的测试方法

边界附近的点对程序故障更加敏感.针对这一特征,提出了一种基于程序域边界分析的测试方法.从被测程序本身出发,进行定义域确定及子域划分,分析定义域边界和子域边界,并跟据其边界测试点产生测试用例,以检测域边界附近的处理.实验表明对定义域边界及其子域边界进行测试,可有效地提高故障覆盖率.     

Timely exposure of a secret project: Which activities to monitor?

A defender wants to detect as quickly as possible whether some attacker is secretly conducting a project that could harm the defender. Security services, for example, need to expose a terrorist plot in time to prevent it. The attacker, in turn, schedules his activities so as to remain undiscovered as long as possible. One pressing question for the defender is: which of the project's activities to focus intelligence efforts on? We model the situation as a zero‐sum game, establish that a late‐start schedule defines a dominant attacker strategy, and describe a dynamic program that yields a Nash equilibrium for the zero‐sum game. Through an innovative use of cooperative game theory, we measure the harm reduction thanks to each activity's intelligence effort, obtain insight into what makes intelligence effort more effective, and show how to identify opportunities for further harm reduction. We use a detailed example of a nuclear weapons development project to demonstrate how a careful trade‐off between time and ease of detection can reduce the harm significantly.     

An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines

We consider the multitasking scheduling problem on unrelated parallel machines to minimize the total weighted completion time. In this problem, each machine processes a set of jobs, while the processing of a selected job on a machine may be interrupted by other available jobs scheduled on the same machine but unfinished. To solve this problem, we propose an exact branch‐and‐price algorithm, where the master problem at each search node is solved by a novel column generation scheme, called in‐out column generation, to maintain the stability of the dual variables. We use a greedy heuristic to obtain a set of initial columns to start the in‐out column generation, and a hybrid strategy combining a genetic algorithm and an exact dynamic programming algorithm to solve the pricing subproblems approximately and exactly, respectively. Using randomly generated data, we conduct numerical studies to evaluate the performance of the proposed solution approach. We also examine the effects of multitasking on the scheduling outcomes, with which the decision maker can justify making investments to adopt or avoid multitasking.     

Shortest path interdiction problem with arc improvement recourse: A multiobjective approach

We consider the shortest path interdiction problem involving two agents, a leader and a follower, playing a Stackelberg game. The leader seeks to maximize the follower's minimum costs by interdicting certain arcs, thus increasing the travel time of those arcs. The follower may improve the network after the interdiction by lowering the costs of some arcs, subject to a cardinality budget restriction on arc improvements. The leader and the follower are both aware of all problem data, with the exception that the leader is unaware of the follower's improvement budget. The effectiveness of an interdiction action is given by the length of a shortest path after arc costs are adjusted by both the interdiction and improvement. We propose a multiobjective optimization model for this problem, with each objective corresponding to a different possible improvement budget value. We provide mathematical optimization techniques to generate a complete set of strategies that are Pareto‐optimal. Additionally, for the special case of series‐parallel graphs, we provide a dynamic‐programming algorithm for generating all Pareto‐optimal solutions.     

慢刀伺服加工环曲面的刀具路径规划方法

如何规划刀具路径、进而获得高质量的数控加工代码,是应用慢刀伺服技术加工环曲面的关键技术之一。提出了基于等距面规划刀位点轨迹的刀具路径规划方法,推导了外凸环曲面的面形方程及其等距面方程,对比分析了两种导动曲线及两种数据点离散方法,优选了刀具路径规划方案,应用VB.net语言编写了慢刀伺服加工环曲面用数控代码生成软件,在Vericut平台上对数控代码进行了仿真验证,直观地展示了虚拟加工面相对理论曲面的残留区域,仿真结果验证了方法的可行性。结果表明:将外凸环曲面方程中的非一次常数项a变为a+r_d,即得到外凸环曲面的等距面方程;所提刀具路径规划方法适用于慢刀伺服加工外凸环曲面;该方法对应用慢刀伺服技术加工其他面型的光学镜面具有借鉴价值。     

Mixed rules in multi‐issue allocation situations

Multi‐issue allocation situations study problems where an estate must be divided among a group of agents. The claim of each agent is a vector specifying the amount claimed by each agent on each issue. We present a two‐stage rule. First, we divide the estate among the issues following the constrained equal awards rule. Second, the amount assigned to each issue is divided among the agents in proportion to their demands on this issue. We apply the rule to two real‐world problems: the distribution of natural resources between countries and the distribution of budget for education and research between universities.     

常规导弹作战批量测试优化研究

短时间内测试大批量合格的常规导弹是未来作战的客观要求.结合导弹部队的作战实际情况,分析了当前技术阵地测试所面临的问题,提出了一些改革的方法.改造技术阵地测试设备,提高操作人员的熟练程度,采用并行技术和关键路技术优化导弹测试流程,同时建立战时应急状态下的测试流程,特别是导弹批量测试技术的提出,将极大地提高导弹测试速度,缩短测试时间,为将来技术阵地的建设提供了建议,同时也对将来常规导弹的设计和研制提出了更高的要求.     

On a class of multiple failure mode systems

The primary objective of this work is to introduce and perform a detailed study of a class of multistate reliability structures in which no ordering in the levels of components' performances is necessary. In particular, the present paper develops the basic theory (exact reliability formulae, reliability bounds, asymptotic results) that will make it feasible to investigate systems whose components are allowed to experience m ≥ 2 kinds of failure (failure modes), and their breakdown is described by different families of cut sets in each mode. For illustration purposes, two classical (binary) systems are extended to analogous multiple failure mode structures, and their reliability performance (bounds and asymptotic behavior) is investigated by numerical experimentation. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 167–185, 2002; DOI 10.1002/nav.10007