基于EPA标准的HVP型阀门定位器开发

我国拥有自主知识产权的工业以态网总线标准EPA在推广应用中面临缺乏足够现场设备支持的困境.针对现状,在现有HVP型智能阀门定位器的基础上,采用双CPU方案,开发符合EPA通信协议要求的智能阀门定位器.给出了EPA阀门定位器开发的总体方案、硬件设计和软件设计,开发的阀门定位器通过EPA一致性、互可操作性测试以及产品全功能...     

罗兰C双台链交叉定位算法研究

在推导罗兰C双台链交叉定位算法基础上,根据试验得到的时差测量结果进行了单台链双曲线定位、非时基交叉圆定位以及双台链交叉定位算法比较.结果表明:测量点几何因子GDOP较好时,单台链双曲线定位与交叉圆定位方法的定位结果基本相同,而GDOP较差时,交叉圆定位方法的定位结果明显优于单台链双曲线定位算法的定位结果,但两种情况下的...     

Transient analysis of Markov models of fault‐tolerant systems with deferred repair using split regenerative randomization

The (standard) randomization method is an attractive alternative for the transient analysis of continuous time Markov models. The main advantages of the method are numerical stability, well‐controlled computation error, and ability to specify the computation error in advance. However, the fact that the method can be computationally very expensive limits its applicability. In this paper, we develop a new method called split regenerative randomization, which, having the same good properties as standard randomization, can be significantly more efficient. The method covers reliability‐like models with a particular but quite general structure and requires the selection of a subset of states and a regenerative state satisfying some conditions. For a class of continuous time Markov models, model class C₂, including typical failure/repair reliability‐like models with exponential failure and repair time distributions and deferred repair, natural selections are available for both the subset of states and the regenerative state and, for those natural selections, theoretical results are available assessing the efficiency of the method in terms of “visible” model characteristics. Those results can be used to anticipate when the method can be expected to be competitive. We illustrate the application of the method using a large class C₂ model and show that for models in that class the method can indeed be significantly more efficient than previously available randomization‐based methods. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Dual‐ascent and primal heuristics for production‐assembly‐distribution system design

This article proposes two dual‐ascent algorithms and uses each in combination with a primal drop heuristic embedded within a branch and bound framework to solve the uncapacitated production assembly distribution system (i.e., supply chain) design problem, which is formulated as a mixed integer program. Computational results indicate that one approach, which combines primal drop and dual‐ascent heuristics, can solve instances within reasonable time and prescribes solutions with gaps between the primal and dual solution values that are less than 0.15%, an efficacy suiting it for actual large‐scale applications. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

消防给水系统设计审查及验收常见问题

消防给水系统是建筑给排水系统中的一个重要组成部分,是保障消防安全的基础设施.从消防设计审查的角度出发,提出消防给水设计中的常见问题以及设计中不太重视的消防排水问题;从消防验收的角度出发,列出消防工程验收过程中呈现的常见问题,以期引起重视.     

考虑战损件回收再造的战场军需备件供应优化研究

在考虑军需备件需求和战损件修复不确定性的条件下,研究了战场上军需备件供应优化问题,建立了优化问题的数学模型,证明了模型的凸函数特性,给出了模型的最优解析解计算方法.     

医院供配电系统谐波测量和分析

为治理日趋严重的医院供配电系统谐波污染,需要深入了解医院谐波分布。利用FLUKE 43B对某医院进行现场谐波测试,基于所得数据重点分析了医院供配电系统谐波污染和谐波源分布情况,根据医院谐波污染特点总结了治理方法。结果表明:医院供配电系统存在严重的谐波污染。被测量医院设备先进,种类齐全,测试所得数据具有较强的代表性,可为医院供配电系统谐波研究、谐波治理和滤波设备选择提供基础数据参考。     

N2O/C7H8单喷嘴燃气发生器试验研究

以基于N2O/C7H8的燃烧驱动混合型气动CO2激光器点火试验为研究背景,设计了液态N2O供应系统及N2O/C7H8单喷嘴燃气发生器.对液态N2O供应系统、N2O/C7H8的点火及燃烧性能进行了研究.试验结果表明:设计的N2O供应系统能够实现液态N2O的稳定供应;在设定的时序下,两个设计工况(余氧系数分别为0.3和0....     

链约束下加工时间恶化的Flow Shop排序问题

讨论作业具有线性加工时间,作业间具有链约束的两台处理机流水作业排序问题,目标函数为极小化完工时间。在作业加工时间简单线性恶化下,提出作业的非负开始和停止延迟恶化率,构造了满足约束条件的复合作业。在此基础上,给出作业间具有平行链约束的两台处理机流水作业排序问题的最优多项式算法。     

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