Opportunistic retooling of a flexible machine subject to failure

A set of jobs can be processed without interruption by a flexible machine only if the set of tools required by all jobs can be loaded in the tool magazine. However, in practice the total number of tools required by a job set would exceed the tool magazine capacity. In such situations, the job set has to be carefully partitioned at the start of the production run such that each partition can be processed without interruption. During the production run, if there are unscheduled machine downtimes due to machine failure, this provides an additional opportunity to optimally retool the magazine for a smaller job set consisting of just the unprocessed jobs. In this paper, we study job sequencing rules that allow us to minimize the total expected cost of machine down time due to machine failures and magazine retooling, assuming a dynamic re‐sequencing of the unprocessed jobs after each machine failure. Using these rules, we develop a branch‐and‐bound heuristic that allows us to solve problems of reasonable size. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 79–97, 2001     

Iterative coloring extension of a maximum clique

In this paper we present an improved branch and bound algorithm for the vertex coloring problem. The idea is to try to extend the coloring of a maximum clique to its adjacent vertices. If this succeeds, its successive neighbors are considered; in case of failure (i.e., in the case the initial colors are not sufficient), working on the subgraph induced by the maximum clique and its neighborhood, the lower bound is improved by seeking for an optimal coloring of this subgraph by branch and bound. The process is repeated iteratively until the whole graph is examined. The iterative scheme exploits a further lower bound obtained by integrating a simple algorithm into the maximum clique search, and a new method to compute upper bounds on subgraphs. Furthermore, a new branching rule and a method for the selection of the initial maximum clique are presented. Extensive computational results and comparisons with existing exact coloring algorithms on random graphs and benchmarks are given. © 2001 John Wiley & Sons, Inc. Naval Research Logistic 48: 518–550, 2001     

某区域锅炉房节能改造措施及其效果

针对现有锅炉房供热中存在的诸如能源的大量浪费和不能充分满足热用户需求等问题,以某锅炉房节能改造为例,从区域锅炉房现有的条件下对系统实施三方面的改造:一是加装微机监控系统,二是加装锅炉分层给煤装置,三是风机的变频改造;并从技术和经济方面加以分析论证,改造方案合理,采取的措施得当,节能效果明显。     

上下文感知的深度弱监督图像哈希表示学习方法

针对现有深度监督图像哈希表示学习方法依赖于图像的类别信息,难以在现实中被广泛应用问题,利用与图像相关的标签信息作为监督信息,提出上下文感知的深度弱监督图像哈希表示学习方法。该方法一方面通过自适应捕获图像区域特征的相关上下文来增强它们的表示能力,另一方面通过引入判别损失来提高学习到的哈希码表示的判别性。在现有两个公开数据集上的大量实验结果证明了该方法的有效性。     

地空导弹与弹道导弹的技术融合正在促使这两类导弹产生突破性的发展

地空导弹采用弹道导弹的抛物弹道技术 ,能够实现应用固体推进剂达到低质量远射程的目标。弹道导弹采用地空导弹末段弹道的寻的制导控制技术 ,可以达到降速、增程并实现末段有效制导控制和弹道机动的目标 ,从而大幅度提高命中精度和突防概率。地空导弹和弹道导弹之间的技术融合 ,已经开始并将很快形成这两类导弹的新一轮突破性的发展     

目标数据关联多因素分布式推理判决系统推理结构

目标数据关联多因素分布式推理判决系统 ,是一基于分布式判决分类系统理论进行目标数据关联分析的大规模推理判决系统 ,在C3I系统中有着广泛的应用前景。本文在分析推理判决系统的推理规则类型和状态类型的基础上 ,给出系统的推理结构图 ,该推理结构是正关联神经推理结构     

大型文化商贸活动的火灾危险性及消防安全措施

本文就四川泸州的一次大型文化商贸活动 ,分析了大型商贸活动的特点及火灾危险性 ,并提出相应的消防安全对策。     

基于单元体设计的装甲装备弹目交会建模方法

为了提高作战仿真效果的可信度,提出了一种基于单元体的解决思路,并通过弹头终点弹道特性、装备几何特征、弹头与目标的关系分析,建立了陆军作战仿真的弹目交会模型。试验测试结果表明:该模型能够仿真作战过程中的弹头命中点坐标,满足作战仿真系统的准确性、实时性要求。     

Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraints

In this article, we propose a branch‐and‐price‐and‐cut (BPC) algorithm to exactly solve the manpower routing problem with synchronization constraints (MRPSC). Compared with the classical vehicle routing problems (VRPs), the defining characteristic of the MRPSC is that multiple workers are required to work together and start at the same time to carry out a job, that is, the routes of the scheduling subjects are dependent. The incorporation of the synchronization constraints increases the difficulty of the MRPSC significantly and makes the existing VRP exact algorithm inapplicable. Although there are many types of valid inequalities for the VRP or its variants, so far we can only adapt the infeasible path elimination inequality and the weak clique inequality to handle the synchronization constraints in our BPC algorithm. The experimental results at the root node of the branch‐and‐bound tree show that the employed inequalities can effectively improve the lower bound of the problem. Compared with ILOG CPLEX, our BPC algorithm managed to find optimal solutions for more test instances within 1 hour. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 138–171, 2016     

From elite consumption to popular opinion: framing of the US drone program in Pakistani newspapers

The United States has conducted armed drone strikes in Pakistan since 2004. While there has been some recent work on Pakistani public opinion about drones, there is very little research on how Pakistan’s media characterize the US drone program. This is an important gap in understanding the determinants of Pakistani popular perceptions of this program. Decades of research has shown that “news framing”, a process by which certain aspects of a complex concept are emphasized in political communications with others played down, influences individual cognition while forming political opinions. In this essay, we address this lacuna by assembling an unprecedented sample of editorials about the drone program from three English newspapers and one Urdu newspaper and analyzing the news frames within them. We next compare the trends in these news frames to public opinion data collected by Pew between the spring of 2009 and 2014. Initially, most Pakistanis were unaware of the drone program, media coverage of the program expanded as drone strikes increased in frequency. While Pakistanis became more cognizant of the US drone strikes, even by 2014 large minorities remained unaware. Pakistani public opinion strongly reflected the top media frames, particularly those that are negative. This is an important finding suggesting that newspaper editorials are a good barometer of Pakistani opinions despite the fact that only information elites rely upon newspapers for political information.