油料保障人员胜任特征评价模型研究

在回顾总结国内外胜任特征研究成果的基础上,采用职务分析法、BEI方法对118名油料保障人员进行了实际问卷调查,整理获得优秀油料保障人员胜任特征指标共24个.将这些特征编制likert5点量表,筛选出3类12项指标,构建了我军油料保障人员胜任特征评价模型,并进行了简单运用.研究结果可以为我军油料保障人员的选拔、评价提供理论依据.     

复杂多功能区域人员疏散方案优化设计探讨

针对复杂多功能区域建筑物,设定了最不利疏散条件和火灾发展过程处于最不利情况的模拟场景.根据火灾烟气危险状态判据临界值,结合复杂多功能区域疏散性能模拟软件,模拟预测某超市二楼商业区火灾烟气流动特性数据,计算出该商业区的人员可用安全疏散时间,进而为消防疏散方案设计人员提供重要数据依据,便于其结合工程实际情况进行消防方案优化改进,确保商业区在火灾事故时,具备一定的安全疏散系统设施和足够的安全疏散时间.     

把握四个环节 做好个别人员工作

一、端正根本态度，树立正确观点，是做好个别人员工作的前提。有的干部因个别人员思想消极、表现落后、管理上比较“刺头”，而对其持有偏见，时而流露出“朽木不可雕”、“破罐子破摔”的想法，这是很不妥的。这样不仅转化不了个别人员，反而会使个别人员更加“个别”，使潜在矛盾进一步激化，甚至引发案件问题。（一）关心个别人员的困难。     

平面杆系任意截面内力算法构造及其应用

讨论了受任意集中力、集中力偶和线性分布力作用的平面杆系结构内力分析技术.遍历单元的轴向和横向荷载特征点,生成该单元的“轴向荷载教组”和“横向荷载数组”,以此为基础,构造内力计算的“特征点截面法”和“特征点递推算法”,并进行了分析.分析结果表明:两种算法适合包含梯形分布的复杂荷载组合,是一种实用的平面杆系内力计算技术,可...     

专家组召开各类人员座谈会 走访部系及职能处室

评估期间,评估专家分组召开了各类人员座谈会,走访了各教学部系及职能处室。先后组织召开了院领导座谈会,教学管理人员、离退休干部、教师、学员座谈会;走访了基础部、边防系、消防工程系、消防指挥系、警卫系、部队管理系、维和培训中心,训练部学院办公室、教务处、教保处、图书馆、编辑出版中心、模拟演练与信息管理中心、实验教学管理中心，政治部组织处、干部处、宣传处，院务部财务处、营房处，科研部组织计划处，基础部军体教研室等有关处室；随堂进行了听课；查阅了学员试卷和毕业论文；组织学员（随机抽取）进行了英语技能测试、计算机技能测试和基本技能（400米障碍）测试。     

公共场所人员消防安全疏散模拟系统设计

公共场所的人员消防安全疏散问题是确保火灾下人员生命安全的关键.为模拟公共场所人员的消防安全疏散行为,提出了一种基于元胞自动机的火灾情况下人员疏散模型.在详细的系统需求分析、概要设计和详细设计基础上,开发了公共场所人员消防安全疏散模拟系统,并进行了系统测试和火灾情况下人员疏散过程模拟.该系统实现了生成公共场所火灾场景、计算并模拟人员疏散行为、管理消防安全疏散规范及算法等功能,系统运行稳定,对人员疏散的模拟过程与实际相符,具有操作简单、模拟直观、数据可靠、扩张性强等特点,能够为研究火灾环境下公共场所人员安全疏散问题提供平台.     

国动委办事机构人员应注重强“三力”

省（自治区）、市（州）、县（市、区）国动委办事机构人员是各级国防动员委员会和首长的“智囊”和“助手”，也是落实国家国防动员决策部署的“一线”指挥员和国防动员工作的具体组织者。面对新的形势任务，培养一支政治坚定、业务精通、作风优良、反应灵敏、工作高效的高素质办事机构干部队伍，是摆在各级国动委办事机构面前的一个重要课题。     

公众聚集场所火灾危险性评估方法研究

针对公众聚集场所火灾危险性特点，从建筑特征、危险源、消防设施、人员疏散和安全管理等五个方面建立火灾危险性评价指标体系。在此基础上通过专家打分和层次分析法，计算得出各指标因子的权重值，根据有关标准和规范，对各评价指标因子进行等级划分，设计安全检查评分表，采用线性加权模型，计算该场所的系统安全分值，得出火灾危险性评价结果。最后给出一个评估实例，对评估方法进行验证。     

谈“三非”人员对我国的不良影响及对策

近年来，我国的“三非”问题逐渐凸显，大量“三非”人员的涌入给我国的国家尊严、国防安全、社会稳定、经济发展以及人口素质等诸多方面都带来了冲击。研究化解、预防“三非”人员，将对我国的经济发展、社会稳定具有极为重要的现实意义。     

云南民兵预备役人员积极参与“禁毒防艾”工作

近年来，云南省军区积极组织民兵预备役人员主动配合地方公安和卫生部门开展禁毒、缉毒、戒毒活动，为遏制毒品和艾滋病的蔓延、维护边防社会稳定做出了积极贡献。一是发挥民兵在禁防工作中的“宣传员”作用。配合地方有关部门，利用国际禁毒日、世界艾滋病日、民族节日、群众集市等时机，开展“送法下乡”活动，深入村寨散发禁防宣传手册，     

Approximation for the departure process of a queue in a network

A simple renewal process is identified to approximate the complex departure process of a queue often found in queueing network models. The arrival process to the queue is the superposition or merging of several independent component-renewal processes that are approximations of departure processes from other queues and external arrival processes; there is a single server with exponential service times, and the waiting space is infinite. The departure process of this queue is of interest because it is the arrival process to other queues in the network. The approximation proposed is a hybrid; the mean and variance of the approximating departure intervals is a weighted average of those determined by basic methods in Whitt [41] with the weighting function empirically determined using simulation. Tandem queueing systems with superposition arrival processes and exponential service times are used to evaluate the approximation. The departure process of the first queue in the tandem is approximated by a renewal process, the tandem system is replaced by two independent queues, and the second queue is solved analytically. When compared to simulation estimates, the average absolute error in hybrid approximations of the expected number in the second queue is 6%, a significant improvement over 22–41% in the basic methods.     

Arrival and departure state distributions in the general bulk‐service queue

In this paper, we give an explicit relation between steady‐state probability distributions of the buffer occupancy at customer entrance and departure epochs, for the classical single‐server system G/G^[N]/1 with batch services and for the finite capacity case. The method relies on level‐crossing arguments. For the particular case of Poisson input, we also express the loss probability in terms of state probabilities at departure epochs, yielding probabilities observed by arriving customers. This work provides the “bulk queue” version of a result established by Burke, who stated the equality between probabilities at arrival and departure epochs for systems with “unit jumps.” © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 107–118, 1999     

Optimal control of an M/G/1 queue with impatient priority customers

An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001     

Analysis of a finite‐buffer bulk‐service queue with discrete‐Markovian arrival process: D‐MAP/Ga,b/1/N

Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003.     

Customer delays in M/M/c repair systems with spares

A service center to which customers bring failed items for repair is considered. The items are exchangeable in the sense that a customer is ready to take in return for the failed item he brought to the center any good item of the same kind. This exchangeability feature makes it possible for the service center to possess spares. The focus of the article is on customer delay in the system—the time that elapses since the arrival of a customer with a failed item and his departure with a good one—when repaired items are given to waiting customers on a FIFO basis. An algorithm is developed for the computation of the delay distribution when the item repair system operates as an M/M/c queue.     

Single-lane bridge serving two-lane traffic

This paper presents a mathematical model of a single-lane bridge serving two-way traffic in alternating directions (with an FIFO rule observed within each directional queue). While the bridge serves cars moving in one direction, cars approaching from the opposite direction wait in a queue at its foot. When cars in the current direction finish crossing the bridge, it begins serving cars from the other direction, if any are present. A newly-arrived car finding an empty bridge mounts it immediately. Several cars moving in the same direction may occupy the bridge simultaneously. The crossing speed is assumed to be constant, and the arrival processes in both directions are assumed to be independent, homogeneous Poisson processes. A generalization of the alternating-priority models [1, 2] is developed to arrive at the Laplace-Stieltjes transform and the expected value of the flow time (the time interval between the moments of arrival at the bridge and departure from it) for steady state conditions. The results are discussed and some examples are presented graphically.     

Application of level crossing analysis to discrete state processes in queueing systems

In this paper we introduce a discrete state level crossing analysis and present some basic results and a key theorem of level crossings. We illustrate the fertility of the discrete state level crossing analysis by applying it to queueing systems with (i) bulk arrival, (ii) instantaneous feedback, (iii) limited waiting space, and (iv) to machine interference problems.     

Bilateral phase-type distributions

In this article we define a class of distributions called bilateral phase type (BPH), and study its closure and computational properties. The class of BPH distributions is closed under convolution, negative convolution, and mixtures. The one-sided version of BPH, called generalized phase type (GPH), is also defined. The class of GPH distributions is strictly larger than the class of phase-type distributions introduced by Neuts, and is closed under convolution, negative convolution with nonnegativity condition, mixtures, and formation of coherent systems. We give computational schemes to compute the resulting distributions from the above operations and extend them to analyze queueing processes. In particular, we present efficient algorithms to compute the steady-state and transient waiting times in GPH/GPH/1 queues and a simple algorithm to compute the steady-state waiting time in M/GPH/1 queues.     

一个分析与计算曲面结构的有效方法

给出了一种分析计算CAD曲面模型的数值方法。该方法将构成CAD模型的曲面片视作计算单元(面素单元),建立各面素单元的控制方程,再结合CAD曲面模型的流形特征组装各个单元控制方程以求整体解。面素单元的控制方程可根据问题的求解目标分别利用有限元—边界元耦合、有限元—无单元及其他耦合形成。结合线弹性问题的求解,系统地介绍了面素单元法的单元划分与处理、单元控制方程建立等核心环节。还给出了一个分析三倒圆过渡面静载荷变形的实例及其与ANSYS对照的结果。     

公共娱乐场所电气火灾成因分析和预防对策

公共娱乐场所在利用大量电气设备、设施为人们提供舒适环境的同时,也增大了电气火灾发生的危险性。分析了公共娱乐场所电气火灾的特点及成因,提出了预防公共娱乐场所电气火灾的消防安全管理对策。