Lower bounds for single-machine scheduling problems

This article addresses deterministic, nonpreemptive scheduling of n jobs with unequal release times on a single machine to minimize the sum of job completion times. This problem is known to be NP-hard. The article compares six available lower bounds in the literature and shows that the lower bound based on the optimal solution to the preemptive version of the problem is the dominant lower bound.     

On the number of games played in a best of (2n – 1) series

Let p(⩾0.5) denote the probability that team A beats B in a single game. The series continues until either A or B wins n games. Assuming that these games are independent replications, we study some features of the distribution of X_n, the number of games played in the series. It is shown that X_n is unimodal, has an IFRA distribution, and is stochastically decreasing in p. Close approximations to its mode, mean, and variance are given. Finally, it is shown that the maximum-likelihood estimator of p based on X_n is unique.     

Estimating moments of the minimum order statistic from normal populations—a bayesian approach

Let Yⁱ ∽ N(θⁱ, σ), i = 1, …, p, be independently distributed, where θⁱ and σ are unknown. A Bayesian approach is used to estimate the first two moments of the minimum order statistic, W = min (Y¹, …, Y^p). In order to compute the Bayes estimates, one has to evaluate the predictive densities of the Yⁱ's conditional on past data. Although the required predictive densities are complicated in form, an efficient algorithm to calculate them has been developed and given in the article. An application of the Bayesian method in a continuous-review control model with multiple suppliers is discussed. © 1994 John Wiley & Sons, Inc.     

海岸雷达阵地抗精确打击工程防护

在分析海岸雷达阵地组成要素及其特点的基础上,针对海岸雷达阵地可能面临的侦察定位、软毁伤和硬打击等方面威胁,提出了避免和减少多种威胁毁伤作用的防护思路,探讨了规划布局、隐真示假、干扰致偏、喷涂加固等防护措施,为深入开展海岸雷达阵地防护技术研究和规划设计实践提供参考。     

Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.     

Clinical Characterization of Insomnia among Veterans with PTSD: Identifying Risk Factors for Diagnosis and Treatment with Sedative-Hypnotics

Abstract

Insomnia is prevalent among Veterans with post-traumatic stress disorder (PTSD), it exacerbates PTSD symptoms, and it contributes to impaired functioning and quality of life. To improve treatment outcomes, it is important to identify risk factors for insomnia and sedative-hypnotic use. Classification and regression trees and logistic regression models were used to identify variables associated with insomnia or sedative-hypnotic use. Key findings include low insomnia diagnosis rates (3.5–5.6%) and high rates of sedative-hypnotics (44.2–49.0%). Younger Veterans and those without a breathing-related sleep disorder (BRSD) were more likely to receive an insomnia diagnosis. Veterans with greater service connection and those with an alcohol/substance use disorder were more likely to be prescribed sedative-hypnotics. Interaction terms may have identified potential groups at risk of being under-diagnosed with insomnia (i.e. non-black Veterans with psychiatric co-morbidity, black Veterans without psychiatric co-morbidity) as well as groups at risk for sedative-hypnotic use (i.e. younger Veterans without BRSD). In sum, Veterans with PTSD have high rates of sedative-hypnotic use despite minimal evidence they are effective. This is counter to recommendations indicating behavioral interventions are the first-line treatment. Policy changes are needed to reduce use of sedative-hypnotics and increase access to behavioral insomnia interventions.     

战争设计工程中多层次任务分解方法

战争设计工程是针对未来战争进行设计的,需要充分发挥各领域专家集体智慧.对领域专家在战争设计各个阶段执行活动的分析,是确定对领域专家选取指标体系和确定战争设计工程团队的基础.首先分析了战争设计工程(WDE)中领域专家的组成,进而给出了战争设计流程中各阶段领域专家需要完成的任务,在此基础上,提出了一种多层次任务分解方法,用于构建各领域专家在各个阶段需要完成的活动集.     

基于AOPN的维修保障系统建模与分析方法

提出了一种可用于维修保障系统建模与分析的面向方面的Petri网模型(APON),给出了该模型形式化描述,该模型引入了方面、方面库所、方面变迁、消息颜色以及对象与方面间的消息传递函数等新的概念,体现了面向方面的思想,具有很好的模块性、继承性和可维护性,能够反映维修保障系统的动态柔性特点,最后给出了一个应用实例.