On labeling the vertices of products of complete graphs with distance constraints

Variations of Hale's channel assignment problem, the L(j, k)‐labeling problem and the radio labeling problem require the assignment of integers to the vertices of a graph G subject to various distance constraints. The λ_j,k‐number of G and the radio number of G are respectively the minimum span among all L(j, k)‐labelings, and the minimum span plus 1 of all radio labelings of G (defined in the Introduction). In this paper, we establish the λ_j,k‐number of ∏ K for pairwise relatively prime integers t₁ < t₂ < … < t_q, t₁ ≥ 2. We also show the existence of an infinite class of graphs G with radio number |V(G)| for any diameter d(G). © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

谈网络理论与现代控制论的交叉结合

当前计算机技术的飞速发展和多学科的交叉结合,给复杂网络的设计和计算等带来了深刻的变化。"现代控制论"与"现代网络理论"一直紧密地联系着,控制论的要领与方法已渗透到网络分析中,可以认为网络理论是受基尔霍夫定律约束的系统理论的子学科。     

舰船建造费随批量变化的成长模型分析

应用微分方程、回归分析及生长曲线３段估算法,建立批量生产条件下舰船单价变化模型,这一模型可与其他模型综合应用以取得更理想的结果．     

开关电源的电磁干扰与抑制

通过分析开关电源产生ＥＭＩ信号的原因,叙述了电磁兼容的重要性,针对开关电源中ＥＭＩ信号的特点,重点介绍了几种抑制ＥＭＩ信号的方法和措施     

基于尺度空间理论的多门限化技术

本文基于尺度空间理论提出了两种多门限化方法：第一种新方法先由精到粗求直方图在不同尺度下的表征,再由粗到精校正定位,最后由生命期长短来确定门限;第二种方法首先在一粗尺度上找特征结构,再由粗到精“聚焦”到最精尺度上获取门限。两方法克服了以往一般门限法的若干缺陷,不仅定位准确,而且普适性强。实验证明新方法是令人满意的。     

What is the global landpower network and what value might it provide?

US national security guidance, as well as the US Army’s operational experiences since 2001, emphasizes the importance of working closely with partner countries to achieve US strategic objectives. The US Army has introduced the global landpower network (GLN) concept as a means to integrate, sustain and advance the Army’s considerable ongoing efforts to meet US national security guidance. This study develops the GLN concept further, and addresses three questions. What benefits can the GLN provide the Army? What are the essential components of the GLN? What options exist for implementing the GLN concept? By developing the GLN concept, the Army has the opportunity to transition the GLN from an often ad hoc and reactive set of relationships to one that the Army more self-consciously prioritizes and leverages as a resource to meet US strategic objectives.     

Benders' cuts guided large neighborhood search for the traveling umpire problem

This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

军机进近优先级别评估

针对军机自身状况以及军机进近飞行特点,分析了影响军机进近优先级别的因素,采用灰色关联分析的思想,运用熵值法对这些影响因素进行了量化分析,建立了军机进近优先级别的灰熵评估模型,最后通过程序实现其算法,展示了军机进近优先级别评估的过程,表明该灰熵评估模型在实际的军机进近飞行管理工作中具有一定的应用价值和发展前景.     

Optimal sample size allocation for tests with multiple levels of stress with extreme value regression

In this article, we discuss the optimal allocation problem in a multiple stress levels life‐testing experiment when an extreme value regression model is used for statistical analysis. We derive the maximum likelihood estimators, the Fisher information, and the asymptotic variance–covariance matrix of the maximum likelihood estimators. Three optimality criteria are defined and the optimal allocation of units for two‐ and k‐stress level situations are determined. We demonstrate the efficiency of the optimal allocation of units in a multiple stress levels life‐testing experiment by using real experimental situations discussed earlier by McCool and Nelson and Meeker. Monte Carlo simulations are used to show that the optimality results hold for small sample sizes as well. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007