Sojourn times in G/M/1 fork‐join networks

We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Bayesian enhanced decision making for deteriorating repairable systems with preventive maintenance

Since a system and its components usually deteriorate with age, preventive maintenance (PM) is often performed to restore or keep the function of a system in a good state. Furthermore, PM is capable of improving the health condition of the system and thus prolongs its effective age. There has been a vast amount of research to find optimal PM policies for deteriorating repairable systems. However, such decisions involve numerous uncertainties and the analyses are typically difficult to perform because of the scarcity of data. It is therefore important to make use of all information in an efficient way. In this article, a Bayesian decision model is developed to determine the optimal number of PM actions for systems which are maintained according to a periodic PM policy. A non‐homogeneous Poisson process with a power law failure intensity is used to describe the deteriorating behavior of the repairable system. It is assumed that the status of the system after a PM is somewhere between as good as new for a perfect repair and as good as old for a minimal repair, and for failures between two preventive maintenances, the system undergoes minimal repairs. Finally, a numerical example is given and the results of the proposed approach are discussed after performing sensitivity analysis. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

近代物理实验教学改革与创新性人才培养

近代物理实验教学应积极进行改革,以适应时代发展的需要。本文结合石河子大学师范学院物理系实际,提出通过对实验教学模式调整,在教学上采用分层次的模式来进行教学。在近代物理实验室开展科研,实施开放实验室,创造个性发展空间,培养学生勇于探索、善于研究创新的精神。     

基于页面关联比重的PageRank排序算法的改进

对比分析了基于链接分析的搜索引擎排序算法PageRank和HITS,针对原有PageRank算法采用的平分页面自身PageRank值的策略,提出了按基于关键词集的网页关联比重分配PageRank值的改进算法。该改进算法根据用户搜索的关键词,按照超链接的网页关联比重为超链接赋予权重,增强了已有算法的有效性。     

基于改进AHP与集对分析法的防空兵群阵地选择

防空兵群阵地选择是防空兵力部署的前提条件,阵地选择与配置的正确与否是防空兵部队能否有效进行抗击敌空袭兵器的一个重要因素.在分析以往防空阵地优选方法不足的基础上,提出了基于改进的层次分析与集对分析的多因素优选方法,建立了防空兵群配置地域方案优选的模型.通过实例分析了影响防空兵群阵地选择的相关因素,确定了配置地域优选的指标体系,用三标度法确定指标因素的权重,以相对贴近度的大小对待选阵地进行优选和排序.该方法能够定性与定量相结合,模型简单规范,为防空兵群阵地优选提供了一种有效的方法和途径.     

多输入多输出雷达恒模稳健波形联合优化算法

针对目标冲激响应及杂波冲激响应分布特性先验知识不准确导致的多输入多输出雷达检测性能下降的问题,提出恒模稳健波形与接收机滤波器联合优化算法。将目标冲激响应及杂波冲激响应分布特性先验知识不准确时的优化问题建模为一个极大极小化问题。运用迭代优化算法将联合优化问题分解为两个子优化步骤:将波形固定时的接收机滤波器权值优化问题建模为广义瑞利商模型,求解得到相应的接收机滤波器权值矢量;利用半正定松弛技术对权值固定时的波形优化问题进行求解,获得对应的波形矩阵,并根据得到的波形矩阵,通过高斯随机化的方法获得所需的恒模波形。对所提算法的收敛性进行了证明,仿真结果表明所提算法有效。     

Steady‐state diffusion approximations for discrete‐time queue in hospital inpatient flow management

In this article, we analyze a discrete‐time queue that is motivated from studying hospital inpatient flow management, where the customer count process captures the midnight inpatient census. The stationary distribution of the customer count has no explicit form and is difficult to compute in certain parameter regimes. Using the Stein's method framework, we identify a continuous random variable to approximate the steady‐state customer count. The continuous random variable corresponds to the stationary distribution of a diffusion process with state‐dependent diffusion coefficients. We characterize the error bounds of this approximation under a variety of system load conditions—from lightly loaded to heavily loaded. We also identify the critical role that the service rate plays in the convergence rate of the error bounds. We perform extensive numerical experiments to support the theoretical findings and to demonstrate the approximation quality. In particular, we show that our approximation performs better than those based on constant diffusion coefficients when the number of servers is small, which is relevant to decision making in a single hospital ward.     

基于大数据的战区联合作战装备保障决策

大数据技术在决策领域的不断应用,将给装备保障决策方式带来重大变革。本文研究基于大数据的战区联合作战装备保障决策问题,提升信息化条件下装备保障准确、高效的决策方式等方面发挥重大作用。阐述了大数据的基本内涵,在决策领域的应用价值。通过系统推理的方法对战区联合作战装备保障决策的分析,提出基于大数据的战区联合作战装备保障决策基本构想,画出科学决策过程示意图,构建大数据战区联合作战装备保障辅助决策系统。结合研究大数据在战区联合作战装备保障决策领域的现实情况,提出相对应的措施建议。     

卫星导航天线阵的载波联合跟踪算法

测量卫星导航信号在天线阵各阵元上的载波相位之差可用于卫星波达方向解算,但传统的各阵元独立跟踪算法在干扰条件下无法实现高精度跟踪且容易失锁。针对此问题,通过将天线阵各阵元的载波相位分解为公共的平均载波相位和低动态的残余载波相位,提出了一种联合载波跟踪算法。该算法利用平均载波相位为每个阵元共有的特点,通过对全部阵元的联合处理来提高其跟踪精度,同时通过缩小环路噪声带宽来提高残余载波相位跟踪精度。理论分析与仿真结果表明,该算法提高了波达方向解算所需的阵元间载波相位差的测量精度及跟踪灵敏度,四阵元天线阵在典型应用条件下,跟踪灵敏度提高4d B,相同载噪比下载波相位差测量精度提高3倍。     

基于QFD及粗糙集的保障能力需求满足度评价方法

针对传统能力评价中指标及其权重的确定具有不一致性和不确定性特点,提出了一种以保障能力需求满足度为依据的评价方法。利用由保障能力-保障性能-保障特性映射的质量屋信息,按照构建质量屋的反方向将保障特性满足度转化为保障能力满足度。为了有效处理模糊和不确定的保障特性评价信息,采用粗糙集理论将评价数据表达为粗糙数形式。最后举例验证了方法的有效性。