A comparative study of three tool replacement/operation sequencing strategies in a flexible manufacturing system

This paper studies three tool replacement/operation sequencing strategies for a flexible manufacturing system over a finite time horizon: (1) failure replacement—replace the tool only upon failure, (2) optimal preventive tool replacement for a fixed sequence of operations, and (3) joint scheduling of the optimal preventive tool replacement times and the optimal sequence of operations. Stochastic dynamic decision models are used for strategies 2 and 3. The optimization criterion for strategies 2 and 3 is the minimization of the total expected cost over the finite time horizon. We will show through numerical studies that, with the same amount of information, the total expected costs can be reduced considerably by choosing an optimal strategy. Our conclusion is that in flexible manufacturing, optimal tool replacement and optimal operations sequencing are not separate issues. They should be considered jointly to minimize the expected total cost. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 479–499, 2000     

Bayesian testing strategies for software with an operational profile

We consider a software reliability model where the failure rate of each fault depends on the specific operation performed. The software is tested in a given sequence of test cases for fixed durations of time to collect data on failure times. We present a Bayesian analysis of software failure data by treating the initial number of faults as a random variable. Our analysis relies on the Markov Chain Monte Carlo methods and is used for developing optimal testing strategies in an adaptive manner. Two different models involving individual and common faults are analyzed. We illustrate an implementation of our approach by using some simulated failure data. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:747–763, 2001     

指控软件可用性工程生命周期模型

针对当前装甲指控软件的应用现状和存在的问题,运用可用性工程理论和方法,提出了指控软件的可用性工程生命周期模型,该模型包括可用性需求分析、模型构建、可用性设计、可用性测试与评估、安装部署与使用体验、用户反馈等过程。通过与一般软件测试的比较,强调可用性测试实验环境的作用。该模型突出用户的作用,重视用户反馈,可为指控软件的设计和开发提供理论指导。     

基于遗传算法的结构测试数据自动生成

生成测试数据是软件测试的主要过程,将遗传算法引入到测试数据的自动生成中,重点介绍其生成过程,并对遗传操作进行改进,在一定程度上降低算法的过早收敛性.最后构建出基于遗传算法的测试数据生成模型.并用实例证明算法的高效性.     

一类安全性苛求软件非规则测试案例自动生成技术

目前,铁路车站计算机联锁软件测试平台包含自动测试和人工测试.人工测试案例是一些复杂的非规则的案例,这部分案例由于难以自动生成而至今没有纳入自动化测试.在对这部分案例进行分析基础上,通过一系列定义,用抽象的脚本语言对其进行描述,并给出脚本的案例还原算法,从而使其能够自动生成.     

基于复杂性的战场损伤定位流程评价模型研究

损伤定位流程制定的合理与否是衡量一个评估员水平高低的重要指标之一。对损伤定位流程的评价涉及到所用时间、工具、操作的难度等指标都可以用其复杂性来表示,目前鲜有关于损伤定位流程评价的研究,因此提出战场损伤定位流程的复杂性,并借鉴软件工程领域的程序复杂性量化方法——图熵法对其进行量化。经过数据验证,复杂性与评估时间之间存在较好的拟合关系,并用实例说明了模型的应用效果。     

Operations sequencing for a multi‐stage production inventory system

This article studies operations sequencing for a multi‐stage production inventory system with lead times under predictable (deterministic) yield losses and random demand. We consider various cases with either full or partial release of work‐in‐process inventories, for either pre‐operation or post‐operation cost structures, and under either the total discounted or average cost criteria. We derive necessary and sufficient criteria for the optimal sequence of operations in all cases. While the criteria differ in their specific forms, they all lead to the same principal: those operations with (1) lower yields, (2) lower processing costs, (3) longer lead times, and (4) lower inventory holding costs should be placed higher upstream in the system.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 144–154, 2014     

基于标杆技术比较的靶场软件界面试验技术研究

根据靶场软件试验不同于第三方软件测评方进行软件界面"易用性、好用性"试验评价的需求,从质量管理对设计开发的验证和确认要求、工程与技术的关系、用户3种需求的关系,分析了基于工程标准检查表方法和用户测试方法用于靶场软件界面试验的不足,提出了基于标杆技术比较的靶场软件界面试验技术,并应用该方法对典型GUI图形用户软件界面进行了试验评价,给出了改进人机界面设计的对策。基于标杆技术比较的靶场软件界面试验技术可用于指导靶场开展软件界面试验,提高靶场作战试验能力。     

基于改进Markov模型软件测试策略

针对已有软件测试Markov模型与工程实践不符的情况，通过引入软件需求覆盖率改进Markov模型。在改进的Markov模型基础上，本文以软件测试过程中测试总代价最小为控制目标，采用交叉熵方法修正测试剖面，由优化测试剖面生成测试用例序列。仿真结果表明这种方法能够有效地降低软件测试总代价，是一种有效的软件测试方法。     

软件的单故障模型及故障的测试方法

研究表明,软件中残留的故障一般都是难以测试,这些故障往往都是局部的、检测概率比较“小”的故障,也就是说,和正确的软件相比,这些故障的表现往往只是一个或几个符号发生错误,现提出的软件单故障模型正是基于这个原理。测试方法是以面向故障为基础,将故障的检测分为3个部分:故障语句的执行,故障的激活和故障的传播。为加速测试用例的生成,也同时提出了软件的故障模拟方法。最后,给出了部分实验结果。     

Dynamic programming approach to the optimization of Naval aircraft rework and replacement policies

This paper describes a method for determining optimal repair and replacement policies for aireraft, with specific reference to the F–4. The objective of the analysis is to choose the set of policies from all possible alternatives over a finite planning horizon which minimizes the cost of operations. A dynamic program is presented which seeks an optimal path through a series of decision periods, when each period begins with the choice of keeping an aircraft, reworking it before further operation, or buying a new one. We do not consider changes in technology. Therefore, when a replacement does occur, it is made with a similar aircraft. Multivariate statistical techniques are used to estimate the relevant costs as a function of age, and time since last rework.     

软件测试方法综述

论述了软件测试技术近几年来研究的最新成果。包括软件的故障模型、白盒测试技术、黑盒测试技术、人工测试技术、可靠性测试技术和测试性设计技术等。以作为对近十几年来软件测试技术发展的总结,还初步的探讨了软件测试技术今后的发展。     

The Effectiveness of Coercive and Persuasive Counterinsurgency Practices since 1945

Which counterinsurgency approaches are most effective in defeating insurgencies? Counterinsurgency advocates and critics have debated the effectiveness of winning hearts and minds as well as using brute force against ordinary civilians. But little scholarship has sought to systemically compare these counterinsurgency approaches among a broad range of cases. This paper seeks to remedy this gap in the literature with an empirical analysis of 47 counterinsurgency wars from 1945–2000 to evaluate the effectiveness of coercive and persuasive approaches to counterinsurgency. To do so, I use crisp-set qualitative comparative analysis (QCA), or Boolean analysis, to identify the presence or absence of six coercive and persuasive counterinsurgency practices across all cases. This method enables me to highlight how counterinsurgency victory can be produced by combinations of practices rather than a single set of practices that might be expected to be useful across cases. The results demonstrate that many combinations of coercive, persuasive, and mixed counterinsurgency practices can lead to victory. However, more persuasive combinations of practices consistently lead to counterinsurgent victory compared to others, although limited coercion against civilians is constant in all cases of counterinsurgency. These findings cast doubt on the ability of counterinsurgents to refrain from harming civilians and suggest that victory requires a mix of both positive and negative incentives for cooperation.     

FP GA软件测试过程及管理

船舶领域的FPGA软件测试严重滞后于应用增长的速度,部分型号甚至未将其纳入测试范畴。在研制过程中,由FPGA故障导致的修改调试已成为影响进度和增加成本的瓶颈。因此,针对FGPA软件特点及其测试的现状,对其测试过程、测试模型和过程管理进行研究,并给出完整的过程管理体系。通过采用规范化、有序化、系统化、面向工程的、面向任务的文档及配套管理手段进行正确引导、组织和实施测试活动,持续改进测试流程中各个阶段工作质量和效用,及早及时地发现和关闭开发过程中存在的缺陷,提高设计和测试的沟通效率,最终保证FPGA产品的质量,提升客户的满意度。     

Optimal service and arrival rates in Jackson queueing networks

In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000     

Joint pricing,assortment, and inventory decisions for a retailer's product line

Consider a set of product variants that are differentiated by some secondary attributes such as flavor, color, or size. The retailer's problem is to jointly determine the set of variants to include in her product line (“assortment”), together with their prices and inventory levels, so as to maximize her expected profit. We model the consumer choice process using a multinomial logit choice model and consider a newsvendor type inventory setting. We derive the structure of the optimal assortment for some important special cases, including the case of horizontally differentiated items, and propose a dominance relationship for the general case that simplifies the search for an optimal assortment. We also discuss structural properties of the optimal prices. Finally, motivated by our analytical results, we propose a heuristic solution procedure, which is shown to be quite effective through a numerical study. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Decision support model for effects estimation and proportionality assessment for targeting in cyber operations

Cyber operations are relatively a new phenomenon of the last two decades.During that period,they have increased in number,complexity,and agility,while their design and development have been processes well kept under secrecy.As a consequence,limited data(sets)regarding these incidents are available.Although various academic and practitioner public communities addressed some of the key points and dilemmas that surround cyber operations(such as attack,target identification and selection,and collateral damage),still methodologies and models are needed in order to plan,execute,and assess them in a responsibly and legally compliant way.Based on these facts,it is the aim of this article to propose a model that i))estimates and classifies the effects of cyber operations,and ii)assesses proportionality in order to support targeting decisions in cyber operations.In order to do that,a multi-layered fuzzy model was designed and implemented by analysing real and virtual realistic cyber operations combined with interviews and focus groups with technical-military experts.The proposed model was evaluated on two cyber operations use cases in a focus group with four technical-military experts.Both the design and the results of the evaluation are revealed in this article.     

Makespan minimization in the two‐machine flowshop batch scheduling problem

In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part‐types are to be produced in a flexible manufacturing cell organized into a two‐stage production line. The jobs are processed in batches on the first machine, and the completion time of a job is defined as the completion time of the batch containing it. When processing of all jobs in a batch is completed on the first machine, the whole batch of jobs is transferred intact to the second machine. A constant setup time is incurred whenever a batch is formed on any machine. The tradeoff between the setup times and batch processing times gives rise to the batch composition decision. The problem is to find the optimal batch composition and the optimal schedule of the batches so that the makespan is minimized. The problem is shown to be strongly NP‐hard. We identify some special cases by introducing their corresponding solution methods. Heuristic algorithms are also proposed to derive approximate solutions. We conduct computational experiments to study the effectiveness of the proposed heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 128–144, 2000     

符号执行火控系统诸元解算程序测试用例生成技术

火控系统作为各种武器装备的中枢和大脑,控制着武器系统的运转,其有效性直接关系着射击的成败甚至武器系统的综合效能。诸元解算程序是将各种输入条件依据弹道模型经过多次迭代转换为射击诸元,由于其复杂性,当前软件测试用例只是在几个关键点上进行校验,很难覆盖程序所有分支和路径,存在着测试不充分。针对这个问题,提出了一种基于符号执行的用例自动生成技术,结合解弹道方程组约束条件和程序分支控制变量使用符号执行框架内能够得到覆盖所有可能的执行路径,从而保证测试的充分性。     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000