VOA广播英语新闻的结构和语言特点

英语新闻忠实记录了现代英语的发展演变.文章简单介绍了VOA广播英语新闻的基本情况,主要分析了VOA广播新闻在结构和语言方面的特点,旨在帮助学生更好地理解新闻英语,并通过广播英语新闻,促进英语学习.     

The dynamic and stochastic knapsack Problem with homogeneous‐sized items and postponement options

This article generalizes the dynamic and stochastic knapsack problem by allowing the decision‐maker to postpone the accept/reject decision for an item and maintain a queue of waiting items to be considered later. Postponed decisions are penalized with delay costs, while idle capacity incurs a holding cost. This generalization addresses applications where requests of scarce resources can be delayed, for example, dispatching in logistics and allocation of funding to investments. We model the problem as a Markov decision process and analyze it through dynamic programming. We show that the optimal policy with homogeneous‐sized items possesses a bithreshold structure, despite the high dimensionality of the decision space. Finally, the value (or price) of postponement is illustrated through numerical examples. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 267–292, 2015     

Sequential and systematic sampling plans for the Markov‐dependent production process

Acceptance sampling plans are used to assess the quality of an ongoing production process, in addition to the lot acceptance. In this paper, we consider sampling inspection plans for monitoring the Markov‐dependent production process. We construct sequential plans that satisfy the usual probability requirements at acceptable quality level and rejectable quality level and, in addition, possess the minimum average sample number under semicurtailed inspection. As these plans result in large sample sizes, especially when the serial correlation is high, we suggest new plans called “systematic sampling plans.” The minimum average sample number systematic plans that satisfy the probability requirements are constructed. Our algorithm uses some simple recurrence relations to compute the required acceptance probabilities. The optimal systematic plans require much smaller sample sizes and acceptance numbers, compared to the sequential plans. However, they need larger production runs to make a decision. Tables for choosing appropriate sequential and systematic plans are provided. The problem of selecting the best systematic sampling plan is also addressed. The operating characteristic curves of some of the sequential and the systematic plans are compared, and are observed to be almost identical. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 451–467, 2001     

对网络教学的几点思考

随着网络技术、多媒体技术的发展,网络教学已经成为一种重要的教学形式,如何正确把握网络教学的模式,抓住特点,准确定位教师在网络教学中的角色,上好每一堂课,应该是每一位老师考虑的问题。     

“费太因”式恐怖袭击的主要特点及对策

＂费太因＂式恐怖袭击手段残忍、破坏性大、轰动性强,已经成为恐怖分子实施暴力破坏活动的重要手段。科学地分析＂费太因＂式恐怖袭击的主要特点,为有效打击此类恐怖袭击寻找科学的方法和措施,从而给恐怖分子以沉重的打击。     

模糊决策融合的红外弱小目标序列检测

针对红外序列图像中运动弱小点目标的检测问题,重点研究序列关联检测算法.在多帧关联检测的基础上,引入决策融合概念,建立了基于模糊决策融合的序列关联检测方法.基于贝叶斯最小风险准则建立分布式决策模糊融合方法,有效融合单帧检测的结果,提高序列检测算法的性能.实测数据的实验结果验证了基于贝叶斯最小风险准则的分布式决策模糊融合方法的可行性和有效性.     

一种基于分组序贯的红外弱小点目标跟踪方法

针对红外序列图像中运动弱小点目标的检测跟踪问题,在多假设跟踪算法(MHT)的基础上提出了一种分组序贯的思想.基于这种思想,给出了一种多组独立检测法.对这种方法进行仿真,并与多级假设检验的截断序贯处理算法进行比较.实验结果证明在相同虚警概率情况下多组独立检测法的检测概率与截断序贯处理算法的检测概率相近,但运算量要远小于后者.     

高压细水雾灭火装置在灭火救援中的应用

着重阐述了细水雾灭火技术作为一种新型灭火技术,其产生的背景和意义,介绍了细水雾灭火装置的灭火原理和技术特点,并结合高压细水雾灭火装置,提出了在消防部队灭火救援应用中存在的问题和应掌握的技术要领。     

驱护舰指挥关系的时效和质量熵分析方法

为了解决如何对驱护舰指挥关系的优化进行定量分析,首先定性分析了新应用的方面指挥模式,继而以指挥组织结构的时效性和准确性为测评指标,建立了基于熵理论的优化分析数学模型,并对现有的两种指挥关系进行了定量计算分析,得到了与定性分析相一致的结论.该方法能在定性分析的基础上定量地研究驱护舰指挥关系的优劣,为定性分析提供有力的数据支持,对驱护舰指挥关系的优化分析具有参考价值.     

Doubly Stochastic Sequential Assignment Problem

This article introduces the Doubly Stochastic Sequential Assignment Problem (DSSAP), an extension of the Sequential Stochastic Assignment Problem (SSAP), where sequentially arriving tasks are assigned to workers with random success rates. A given number of tasks arrive sequentially, each with a random value coming from a known distribution. On a task arrival, it must be assigned to one of the available workers, each with a random success rate coming from a known distribution. Optimal assignment policies are proposed for DSSAP under various assumptions on the random success rates. The optimal assignment algorithm for the general case of DSSAP, where workers have distinct success rate distribution, has an exponential running time. An approximation algorithm that achieves a fraction of the maximum total expected reward in a polynomial time is proposed. The results are illustrated by several numerical experiments. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 124–137, 2016