Statistical analysis for masked system life data from Marshall‐Olkin Weibull distribution under progressive hybrid censoring

This paper considers the statistical analysis of masked data in a series system, where the components are assumed to have Marshall‐Olkin Weibull distribution. Based on type‐I progressive hybrid censored and masked data, we derive the maximum likelihood estimates, approximate confidence intervals, and bootstrap confidence intervals of unknown parameters. As the maximum likelihood estimate does not exist for small sample size, Gibbs sampling is used to obtain the Bayesian estimates and Monte Carlo method is employed to construct the credible intervals based on Jefferys prior with partial information. Numerical simulations are performed to compare the performances of the proposed methods and one data set is analyzed.     

滑模控制的新型双幂次组合函数趋近律

提出一种基于双幂次组合函数趋近律的新型滑模控制方案。与现有的快速幂次或双幂次趋近律相比,具有更快的收敛速度,同时还保持了全局固定时间收敛特性,收敛时间上界与滑模初值无关。当系统存在有界扰动时,能够使滑模变量在有限时间内收敛到稳态误差界内,同时其稳态误差要小于现有方法的。仿真实验验证了该方法的有效性及理论分析的正确性。     

基于复杂排队系统的三值光学计算机服务模型与性能分析

三值光学计算机的运算请求处理过程缺乏合理、系统的性能评价标准与体系。基于M/M/1、M/M/n、M~X/M/1和M/M~B/1构成的复杂排队系统,构建三值光学计算机的四阶段服务模型,同时建立立即调度和结束时调度两种策略和算法。基于不同排队系统讨论运算请求的接收时间、预处理时间、运算时间和发送时间的计算方法,进而得到最终响应时间。通过仿真实验对两种策略的模型进行验证,结果表明,结束时调度策略明显优于立即调度策略。     

线性调频连续波雷达低空小目标长时间相参积累方法

针对小型无人机目标雷达回波弱、目标检测难的问题,研究了在线性调频连续波(linear frequency modulation continuous wave, LFMCW)体制雷达下的长时间相参积累方法。通过推导LFMCW雷达回波表达式,提出了基于时域差频信号线性调频-Z变换的拉东-傅里叶变换实现方法。评估了该方法的运算量,并与频域实现的方法进行对比。经过仿真和实测数据验证了本文算法对LFMCW雷达下的弱目标相参积累的有效性。     

Research on design and firing performance of Si-based detonator

For the chip integration of MEMS (micro-electromechanical system) safety and arming device, a miniature detonator needs to be developed to reduce the weight and volume of explosive train. A Si-based micro-detonator is designed and fabricated, which meets the requirement of MEMS safety and arming device. The firing sensitivity of micro-detonator is tested according to GJB/z377A-94 sensitivity test methods: Langlie. The function time of micro-detonator is measured using wire probe and photoelectric transducer. The result shows the average firing voltage is 6.4 V when the discharge capacitance of firing electro-circuit is 33 μF. And the average function time is 5.48 μs. The firing energy actually utilized by Si-based micro-detonator is explored.     

数字电位器在P T100温度仿真中的应用

伴随高速可编程逻辑器件的广泛应用,实时快速可靠地对系统状态信号进行处理,实现对复杂机电系统运行状态的实时监控成为用户追求的目标。基于数字电位器由于可调精度高,控制方便,性能稳定等优点,给出了一种基于CPLD可编程器件,通过数字电位器实现在半实物仿真系统中对PT100热电阻的阻值变化进行等效模拟的工程应用。利用本研究内容,通过上位机界面对系统温度参数进行人工设定,即可轻易实现对PT100热电阻在不同温度下阻值的真实模拟,检验实际系统温度监测装置软硬件的可靠性,确保系统安全运行。     

基于消防响应时间满意度的消防站布局优化研究

消防站布局是否合理是及时扑灭火灾的关键,当前城市消防站规划方法主观性较大,缺乏量化数据支持,研究科学合理的城市消防站布局优化方法,具有十分重要的意义。在吸收前人研究的基础上,运用区域火灾风险评估、ARCGIS、遗传算法等,在构建消防响应时间满意度函数的基础上,构建了基于消防响应时间满意度的消防站布局优化选址方法。该方法从消防需求角度对研究区域的消防站布局进行了规划,达到用最少的消防站覆盖全部的消防需求点,以实现消防资源的最优化配置。     

Axis2与NET平台间Web服务安全交互研究与实现

Web服务基于一系列开放的标准技术,具有松散耦合、语言中立、平台无关、互操作性的优点。近年来,在武警部队信息化建设中,很多平台都构建了Web服务。但由于Web服务的各个平台对WS—Security规范的支持不统一,这就为全部队涉及不同业务部门的异构平台web服务的安全交互带来了问题。通过分析NET和Axis2Web服务平台对WS—Security规范的支持,提出一个方案来解决多个异构Web服务平台之间的安全交互问题,最后通过实验证明了该方案的可行性。     

Inventory control and replenishment with flexible delivery‐time upgrade

We consider a capacitated inventory model with flexible delivery upgrades, in which the seller allocates its on‐hand inventory to price‐ and delivery‐time‐sensitive customers. The seller has two decisions: inventory commitment and replenishment. The former addresses how the on‐hand inventories are allocated between the two classes of customers within an inventory cycle. The latter addresses how the inventory is replenished between inventory cycles. We develop optimal inventory allocation, upgrade, and replenishment policies and demonstrate that the optimal policy can be characterized by a set of switching curves. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 418–426, 2014     

A branch‐and‐price approach for the stochastic generalized assignment problem

In this article, we address a stochastic generalized assignment machine scheduling problem in which the processing times of jobs are assumed to be random variables. We develop a branch‐and‐price (B&P) approach for solving this problem wherein the pricing problem is separable with respect to each machine, and has the structure of a multidimensional knapsack problem. In addition, we explore two other extensions of this method—one that utilizes a dual‐stabilization technique and another that incorporates an advanced‐start procedure to obtain an initial feasible solution. We compare the performance of these methods with that of the branch‐and‐cut (B&C) method within CPLEX. Our results show that all B&P‐based approaches perform better than the B&C method, with the best performance obtained for the B&P procedure that includes both the extensions aforementioned. We also utilize a Monte Carlo method within the B&P scheme, which affords the use of a small subset of scenarios at a time to estimate the “true” optimal objective function value. Our experimental investigation reveals that this approach readily yields solutions lying within 5% of optimality, while providing more than a 10‐fold savings in CPU times in comparison with the best of the other proposed B&P procedures. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 131–143, 2014