非周期不完全检测下的维修优化

针对gamma退化型单部件系统,基于更新和半更新过程理论建立了以期望费用率最小为目标的非周期不完全检测下的维修优化模型。利用检测规划函数使系统的检测间隔期可以依据系统的状态进行调整。为更加贴近实际,模型考虑了测量误差对维修优化的影响。通过计算可以得到最优预防性维修阈值和检测方案。给出了模型的应用算例,通过对退化速率和费用参数的灵敏度分析说明了模型的有效性。与不考虑检测误差的优化结果进行对比,证明了考虑检测误差的重要性。     

基于灰色系统理论的军队油料节约人员360度绩效评估

基于360度绩效评估理论,从德、能、勤、绩4个方面构建了包含4个1级指标和16个2级指标的军队油料节约人员360度绩效评估指标体系。利用层次分析法确定了各评估指标的权重,运用灰色系统理论的原理和方法,构建了多层次灰色评估模型,并对某油料节约小组5位油料节约人员进行了360度绩效评估。案例应用表明,此方法具有系统综合各层评估者提供的"贫信息"的优点,不仅能得出被评估者的灰类及优劣顺序,而且得到了各指标所属灰类和具体的灰色评价权值,使360度绩效较好地实现了绩效反馈的目的。该研究为军队油料节约人员绩效管理工作提供了新的思路和方法。     

一种鲁棒的场地球类视频中的球门探测方法

在场地球类视频中,球门常常会伴随着精彩片段而出现。因此,球门探测是体育视频的基础,同时也是视频高层语义概念探测的研究热点。目前,利用机器学习方法进行视频中的对象探测是非常有前途的研究领域。基于此,提出一种基于模糊决策树的球门探测算法,用来探测场地球类视频中球门帧的出现,为了提高分类准确性,在模糊决策树训练的过程中加入了平衡处理。实验结果表明,与基于阈值和决策树的算法相比,该算法可以得到更好的分类结果(F-measure>95%),并且我们可以从所建立的树中推导出模糊规则来解释分类模型。     

二进制无线传感器网络目标定位解析算法初步研究

针对二进制传感器网络目标定位跟踪问题,提出一种利用传感器位置信息和目标穿过传感器探测区域的时间信息进行解算的解析算法,并对该算法进行了仿真验证。仿真结果表明,相对于目前最常用的线性拟和算法,该算法具有对目标经过的传感器数量要求低、解算精度高等优点。     

Performance evaluation of a production/inventory system with periodic review and endogenous lead times

This paper considers a discrete time, single item production/inventory system with random period demands. Inventory levels are reviewed periodically and managed using a base‐stock policy. Replenishment orders are placed with the production system which is capacitated in the sense that there is a single server that sequentially processes the items one at a time with stochastic unit processing times. In this setting the variability in demand determines the arrival pattern of production orders at the queue, influencing supply lead times. In addition, the inventory behavior is impacted by the correlation between demand and lead times: a large demand size corresponds to a long lead time, depleting the inventory longer. The contribution of this paper is threefold. First, we present an exact procedure based on matrix‐analytic techniques for computing the replenishment lead time distribution given an arbitrary discrete demand distribution. Second, we numerically characterize the distribution of inventory levels, and various other performance measures such as fill rate, base‐stock levels and optimal safety stocks, taking the correlation between demand and lead times into account. Third, we develop an algorithm to fit the first two moments of the demand and service time distribution to a discrete phase‐type distribution with a minimal number of phases. This provides a practical tool to analyze the effect of demand variability, as measured by its coefficient of variation, on system performance. We also show that our model is more appropriate than some existing models of capacitated systems in discrete time. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Optimizing the quality control station configuration

We study unreliable serial production lines with known failure probabilities for each operation. Such a production line consists of a series of stations, existing machines, and optional quality control stations (QCSs). Our aim is to decide on the allocation of the QCSs within the assembly line, so as to maximize the expected profit of the system. In such a problem, the designer has to determine the QCS configuration and the production rate simultaneously. The profit maximization problem is approximated assuming exponentially distributed processing times, Poisson arrival process of jobs into the system, and the existing of holding costs. The novel feature of our model is the incorporation of holding costs that significantly complicated the problem. Our approximation approach uses a branch and bound strategy that employs our fast dynamic programming algorithm for minimizing the expected operational costs for a given production rate as a subroutine. Extensive numerical experiments are conducted to demonstrate the efficiency of the branch and bound procedure for solving large scale instances of the problem and for obtaining some qualitative insights.

相似文献   

现代文本分类技术研究

分析了当前的文本分类技术,总结了文本分类需要解决的问题;在详细比较了各种不同的分类算法以及文本模型以后,为进一步开展优化以及提高文本分类技术的研究工作提供了一些参考和建议。     

一类复变函数问题的统一解法

本文通过具体例子阐述了一类复变函数问题的统一解法,而且简单易行。     

A stochastic assignment problem

There are n boxes with box i having a quota value Balls arrive sequentially, with each ball having a binary vector attached to it, with the interpretation being that if X_i = 1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas. © 2014 Wiley Periodicals, Inc. 62:23–31, 2015     

基于STN的任务执行过程中的资源冲突自动消解

任务在执行过程中受到各种因素的影响,任务时间可能会偏离预定计划,在资源数量有限的情况下,由于要满足时间的约束,往往会出现时间重叠而发生资源冲突。消解这种资源冲突的一个最直接的方法是及时调整任务计划时间消解潜在的资源冲突。针对任务执行过程中冲突消解人工决策耗时较长的问题,设计了一种基于STN的任务在执行过程中的自动消解方法,通过案例仿真,证明方法是可行的,并且能够比人工决策方式节约时间。