军事刑事审判级别管辖的划分依据解读

军事刑事审判级别管辖的划分根据不同于普通刑事审判级别管辖的划分根据,它是以被告人的职务等级作为划分依据的。那么,这种划分依据的根据是什么?有无理论上的合理性?这便是本文所要探讨的问题。     

基于Monte Carlo方法的一对二马尔可夫随机格斗模型

讨论了一对二马尔可夫随机格斗双方获胜概率计算问题。提出了一种新颖的一对二马尔可夫随机格斗任意对抗回合双方获胜概率的计算方法,该方法首先基于Monte Carlo仿真计算各个对抗回合中双方发射次序的概率分布,再利用全概率公式确定马尔可夫链的状态转移概率矩阵,从而克服了马尔可夫随机格斗模型往往只能提供无限对抗回合之后格斗双方获胜概率的缺点,为运用马尔可夫随机格斗研究火力运用和弹药分配提供了新途径,并用实例说明了该方法的有效性。     

基于隐马尔可夫模型的IDS程序行为异常检测

提出一种新的基于隐马尔可夫模型的程序行为异常检测方法,此方法利用系统调用序列,并基于隐马尔可夫模型来描述程序行为,根据程序行为模式的出现频率对其进行分类,并将行为模式类型同隐马尔可夫模型的状态联系在一起。由于各状态对应的观测值集合互不相交,模型训练中采用了运算量较小的序列匹配方法,与传统的Baum Welch算法相比,训练时间有较大幅度的降低。考虑到模型中状态的特殊含义以及程序行为的特点,将加窗平滑后的状态序列出现概率作为判决依据。实验表明,此方法具有很高的检测准确性,其检测效率也优于同类方法。     

当前非法出入境活动发展趋势预测

将灰色系统理论与马尔可夫链方法相结合,提出了灰色模型——马尔可夫链预测当前非法出入境活动发展趋势的方法,以某年至某年出入境统计的原始数为依据,通过MATLAB编程建立起微分拟合方程和系统状态转移概率矩阵,对当前非法出入境活动的发展趋势进行了预测和分析.     

基于马尔可夫分析的人才拥有量研究

基于马尔可夫分析理论,给出了人才拥有量预测的马尔可夫模型,并且讨论了模型中转移概率的确定及模型的预测质量等问题.     

车辆装备战场损伤等级评估方法

在分析损伤程度、残存功能状态、抢修时间等影响装备损伤等级的划分与评估的主要影响因素以及装备损伤等级划分方法的基础上,研究了车辆装备战场损伤等级划分及评估的基本方法,给出了车辆装备损伤定位的基本程序,设计了车辆装备零件损伤评估的逻辑决断图和整车损伤评估表,建立了战场抢修时间、工时、人员的估算方法,并通过实例验证了评估方法的有效性和实用性。     

动态武器目标分配问题的马尔可夫性

动态武器目标分配(weapon target assignment,WTA)问题是军事运筹学研究的重要理论问题,也是作战指挥决策中迫切需要解决的现实问题。在对动态WTA问题进行描述分析的基础上,运用随机过程理论证明了动态WTA过程的马尔可夫性;给出了该马尔可夫决策过程的状态转移概率的解析表达式,并对其状态特点进行了简要分析。研究结果可以为动态WTA及相关问题的研究提供理论和方法依据。     

基于Markov状态转移的动态可靠性分析

基于系统的马尔可夫性假设,对系统状态进行适当的离散化处理,利用状态转移方法来描述系统的动态随机过程.在求得状态转移矩阵后,再建立离散动态事件树,来求得系统故障概率.用此方法具体分析了水位调节系统.     

基于马尔可夫链的装备技术成熟度评估方法

针对传统技术成熟度评估中存在的时滞问题,基于有限状态齐次马尔可夫链模型,对装备技术成熟度、集成成熟度和系统成熟度的初始状态、演化过程和稳态分布进行研究,降低了时滞带来的决策误差,通过示例进行了演示验证,示例显示建立的方法科学有效、通用性强,具有实际意义和推广价值。     

BIT系统的三态马尔可夫模型分析

BIT技术是改善系统测试性和诊断能力的重要途径,但是较高的虚警率一直是阻碍BIT广泛应用的一个重要原因。研究过程中将系统状态划分为正常、间歇、故障三种状态,建立了马尔可夫模型,分析、对比了三态模型与两态模型的关系。理论分析结果表明:基于三态模型的BIT,在提高故障检测率的同时,还可以较大程度地降低虚警率。     

兵力展开问题研究

如何将基地的兵力以最短时间展开到多个阵地中,是运输问题中的一种。为解决此问题对著名的兵力展开问题进行了研究。建立了兵力展开问题的数学模型,此模型是一个混合整数规划模型。提出了一种求解方法,该方法可解决类似的混合整数规划问题。最后给出了一个实例。     

Dynamic multiattribute models for mixed manpower systems

This paper reviews a wide variety of manpower and personnel models of the goal programming variety. This is done from a strategy-oriented point of view addressing the problems of interest for immediate implementation as well as basic problems of manpower model research development. Particular emphasis in this paper is concerned with how analytical models can be brought to bear on the problems of combining military and civilian manpower into one management system. This includes a discussion of the computer support arrangements necessary to implement the models. First, we discuss an extension of multilevel models to provide an integrated approach to program planning which includes the dynamics of the manpower requirements-inventory relationships of mixed military-civilian manpower systems. Then, focus is given to some of the potential Navy applications particularly in terms of ways the outputs from the global multilevel model might be interfaced with assignment models for operational planning. The paper concludes with a discussion of static and dynamic multiattribute assignment models which operate on the individual man-job matching level. It is at this level of detail that dynamic mixed manpower systems might be constructed for use in equal employment opportunity planning and for local organization design studies.     

Two-characteristic markov-type manpower flow models

A two-dimensional state space Markov Model of a Manpower System with special structure is analyzed. Examples are given from the military services. The probabilistic properties are discussed in detail with emphasis on computation. The basic equations of manpower stocks and flows are analyzed.     

A multiple‐shift workforce scheduling model under annualized hours

Many manufacturing and service organizations in Europe have used annualized hours, also known as flexiyear, to successfully tackle seasonal demand. Under annualized hours, the employer has a certain number of labor hours available in a year and the employer can allocate the hours over the year according to manpower need. A problem in planning for annualized hours is the scheduling of the workforce over the year. We present an algorithm to generate an annual schedule for a scenario in which a facility operates one or more shifts and manpower need may vary from week to week. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 726–736, 1999     

Manpower modeling in cost effectiveness studies of usaf program to reduce the incidence of heart disease

Planning for a cardiovascular disease reduction program, soon to be initiated by the United States Air Force, has required an evaluation of its expected cost effectiveness. During the course of this evaluation, it was necessary to consider manpower flows and their expected changes in response to the disease reduction program. This paper describes several manpower models that were applied: a simple expected value equilibrium model; a cross-sectional model that considered the length of service of personnel; and a staffing model used to optimize the allocation of paramedics to the many Air Force bases of various sizes. The relevance of these models to the cost effectiveness evaluation is shown but the detailed cost effectiveness results are not presented.     

Computing the discounted return in markov and semi-markov chains

This paper addresses the problem of computing the expected discounted return in finite Markov and semi-Markov chains. The objective is to reveal insights into two questions. First, which iterative methods hold the most promise? Second, when are interative methods preferred to Gaussian elimination? A set of twenty-seven randomly generated problems is used to compare the performance of the methods considered. The observations that apply to the problems generated here are as follows: Gauss-Seidel is not preferred to Pre-Jacobi in general. However, if the matrix is reordered in a certain way and the author's row sum extrapolation is used, then Gauss-Seidel is preferred. Transforming a semi-Markov problem into a Markov one using a transformation that comes from Schweitzer does not yield improved performance. A method analogous to symmetric successive overrelaxation (SSOR) in numerical analysis yields improved performance, especially when the row-sum extrapolation is used only sparingly. This method is then compared to Gaussian elimination and is found to be superior for most of the problems generated.     

A manpower planning/capital budgeting model (MAPCAB)

A deterministic resource allocation model is developed to optimize defense effectiveness subject to budget, manpower, and risk constraints. The model consists of two major submodels connected by a heuristic. The first is a mathematical program which optimizes the multiperiod weapon mix subject to the constraint set. The second is a manpower supply model based on a transition matrix in which individual transitions are functions of personnel related budgets and historical transition rates. The heuristic marries the submodels through an iterative process leading to improved solutions. An example is provided which demonstrates how systems are undercosted and overprocured if manpower supply is not properly reflected relative to manpower demand.     

Optimization of steerable sensor network for threat detection

A Markov chain approach to detecting a threat in a given surveillance zone by a network of steerable sensors is presented. The network has a finite number of predetermined states, and transition from one state to another follows a Markov chain. Under the assumption that the threat avoids detection, two game theoretic problems for finding an optimal Markov chain (two surveillance strategies) are formulated: the first maximizes the probability of threat detection for two consecutive detection periods, whereas the second minimizes the average time of detection for the worst‐case threat's trajectory. Both problems are reduced to linear programming, and special techniques are suggested to solve them. For a dynamic environment with moving noise sources, the optimal Markov chain changes at each detection period, and the rate of convergence of the Markov chain to its stationary distribution is analyzed. Both surveillance strategies are tested in numerical experiments and compared one with another. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

An MX/G/1 queueing system with disasters and repairs under a multiple adapted vacation policy

We consider a queueing system with batch Poisson arrivals subject to disasters which occur independently according to a Poisson process but affect the system only when the server is busy, in which case the system is cleared of all customers. Following a disaster that affects the system, the server initiates a repair period during which arriving customers accumulate without receiving service. The server operates under a Multiple Adapted Vacation policy. The stationary regime of this process is analyzed using the supplementary variables method. We obtain the probability generating function of the number of customers in the system, the fraction of customers who complete service, and the Laplace transform of the system time of a typical customer in stationarity. The stability condition for the system and the Laplace transform of the time between two consecutive disasters affecting the system is obtained by analyzing an embedded Markov renewal process. The statistical characteristics of the batches that complete service without being affected by disasters and those of the partially served batches are also derived. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 171–189, 2015