Reliability analysis of non‐repairable systems modeled by dynamic fault trees with priority AND gates

Many real‐life systems are typically involved in sequence‐dependent failure behaviors. Such systems can be modeled by dynamic fault trees (DFTs) with priority AND gates, in which the occurrence of the top events depends on not only combinations of basic events but also their failure sequences. To the author's knowledge, the existing methods for reliability assessment of DFTs with priority AND gates are mainly Markov‐state‐space‐based, inclusion–exclusion‐based, Monte Carlo simulation‐based, or sequential binary decision diagram‐based approaches. Unfortunately, all these methods have their shortcomings. They either suffer the problem of state space explosion or are restricted to exponential components time‐to‐failure distributions or need a long computation time to obtain a solution with a high accuracy. In this article, a novel method based on dynamic binary decision tree (DBDT) is first proposed. To build the DBDT model of a given DFT, we present an adapted format of the traditional Shannon's decomposition theorem. Considering that the chosen variable index has a great effect on the final scale of disjoint calculable cut sequences generated from a built DBDT, which to some extent determines the computational efficiency of the proposed method, some heuristic branching rules are presented. To validate our proposed method, a case study is analyzed. The results indicate that the proposed method is reasonable and efficient. Copyright © 2015 John Wiley & Sons, Ltd.     

The deterministic multi-item dynamic lot size problem with joint business volume discount

This paper considers the multi-item dynamic lot size model where joint business volume discount is applied for all items purchased whenever the total dollar value of an order reaches a certain level. Multi-item discounts are prevalent in practical applications, yet the literature has only considered limited instances of single-item models. We establish the mathematical formulation and design an effective dynamic programming based heuristic. Computational results disclose our approach obtains high quality solutions that dominate the best known heuristic for the simplified one-item case, and that proves vastly superior to the state-of-the-art CPLEX MIP code for the multi-item case (for which no alternative heuristics have been devised). We obtained significantly better solutions than CPLEX for the more complex problems, while running from 4800 to over 100,000 times faster. Enhanced variants of our method improve these outcomes further. This revised version was published online in June 2006 with corrections to the Cover Date.     

同顺序流水作业排序问题的一个启发式算法

本文主要给出了同顺序m×n排序问题初始序的选取方法以及通过计算可避免出现高重循环的初始序的排序算法,然后又给出了利用矩阵可行线性质将初始序调试成较优序的可行方法.利用该文方法对n=15,m=3～14的144个例题计算,得出平均相对误差为3.145%的结果,对于m=3与m=4的128个例题计算,得出平均相对误差为0.6306%.统计结果表明该方法可在实际中进行应用.     

Virtual Path Design in Service-Specific ATM Networks

This paper addresses the problem of virtual path management in ATM networks, which is the problem of jointly selecting efficient virtual trunk routes and sizing them to meet end-to-end grade-of-service requirements. The problem is posed over capacitated networks and is formulated as a two-level multi-commodity network flow problem with linear side-constraints (physical layer capacity) and non-linear side constraints (end-to-end/link blocking). Through a variety of examples we show the method (i) generates solutions that agree with engineering judgement, (ii) can solve VP layout management for realistic size networks (of up to 200 nodes) in reasonable time and (iii) provides upper bounds on how far the solution strays from the mathematically optimal design.     

Wrap-Around L2-Discrepancy of Random Sampling, Latin Hypercube and Uniform Designs

For comparing random designs and Latin hypercube designs, this paper con- siders a wrap-around version of the L₂-discrepancy (WD). The theoretical expectation and variance of this discrepancy are derived for these two designs. The expectation and variance of Latin hypercube designs are significantly lower than those of the corresponding random designs. We also study construction of the uniform design under the WD and show that one-dimensional uniform design under this discrepancy can be any set of equidistant points. For high dimensional uniform designs we apply the threshold accepting heuristic for finding low discrepancy designs. We also show that the conjecture proposed by K. T. Fang, D. K. J. Lin, P. Winker, and Y. Zhang (2000, Technometrics) is true under the WD when the design is complete.     

Effective Heuristics for the GPS Survey Network of Malta: Simulated Annealing and Tabu Search Techniques

A GPS network can be defined as a set of stations, co-ordinated by a series of sessions formed by placing receivers on the stations. This paper shows how to search for the best order in which to observe these sessions giving the cheapest schedule. The complexity of observing GPS networks increases with their size and become highly difficult to solve effectively. To obtain good methods to solve this problem a new area of research is implemented. This area is based on developed heuristic techniques that provide an optimal or near optimal solution for large networks. Comparing their outcome in terms of solution quality and computational effort proves the performance of the developed techniques.     

高效液相色谱法测定庆大霉素C组分的不同检测方式测定结果的比较

各国药典中关于庆大霉素C组分的测定方法均为高效液相色谱法,但检测方式及分离效果不同。为此采用直观推导式演进特征投影法(HELP),对高效液相色谱-二极管阵列检测采集的庆大霉素C组分色谱数据进行解析,分辨出各物质的色谱曲线,在扣除了未分离的杂质峰对庆大霉素C1组分的干扰后,对柱前邻苯二醛衍生化-二极管阵列检测法及目前中国药典 2005 版收载的高效液相色谱-蒸发光散射检测方法测定庆大霉素C组分的准确性进行了比较,并运用柱切换技术,证明二者测定结果的一致性。     

唇形科植物挥发油化学成分的GC/MS研究

在运用GC/MS技术的基础上采用HELP(直观推导式演进特征投影法)方法研究了九种唇形科植物的化学成分, 并以唇形科植物半枝莲为例详细介绍了HELP的解析过程. 应用总体积积分法测定各成分的相对百分含量. 鉴定出相对共有成分达70余种, 大多数为萜类化合物及其衍生物. 不同的唇形科植物的挥发油化学成分与特征成分有明显差异. 九种药材挥发性成分中均含有桉油精(Eucalyptol, 含量0.10%～1.01%)和芳樟醇(Linalool, 0.11%～3.05%). 利用GC/MS分析法结合化学计量学分辨方法鉴定挥发油化学成分, 比单独使用GC-MS法结果更准确、可靠.     

分子亲脂-亲水性的量子化学描述II. 氨基酸侧链的亲水指标和亲脂指标

在启发式亲脂势HMLP(heuristicmolecularlipophilicitypotential)的基础上提出了分子、分子片段和原子的亲水指标和亲脂指标.计算出了20个天然氨基酸侧链的亲水、亲脂指标和亲水、亲脂表面积,并用线性自由能函数表达氨基酸侧链的溶剂化自由能,?Gsol,=b0 b1Li b2Hi b3Si b4Si.应用线性自由能函数和氨基酸侧链的亲水和亲脂! -i指标,计算了20个氨基酸残基的3种相转移自由能(蒸气-水、蒸气-正辛醇、正辛醇-水)和正辛醇-水分配系数logPow,取得了与实验值高度一致的良好效果.HMLP的亲水和亲脂指标是HMLP的指标化,扩展了这一方法的使用范围.氨基酸侧链的亲水、亲脂指标和线性自由能函数有望用于生物大分子受体与配体的结合自由能的估算、蛋白质的结构与功能、蛋白-蛋白相互作用和识别的研究.     

多元曲线分辨结合在线红外用于3-氨基-4-氨基肟基呋咱的合成反应机理

利用红外光谱在线监测丙二睛、亚硝酸钠和盐酸羟胺合成3-氨基-4-氨基肟基呋咱的反应过程,采用多元曲线分辨-交替最小二乘法（MCR-ALS）、直观推导式演进特征投影法(HELP)等化学计量学方法对反应过程所获得的实时红外光谱数据矩阵进行解析,得到了各组分纯物质的浓度变化曲线和对应的红外光谱,并将多元曲线分辨 交替最小二乘法与直观推导式演进特征投影法的分析结果进行比较,得出可相互验证的一致结论,据此推出该反应合理的反应机理。 2种方法得到的反应物与生成物的光谱与原光谱的相似度近似于1,说明该解析方法具有准确性和可靠性。 结果表明,化学计量学结合红外光谱可有效的应用于3-氨基-4-氨基肟基呋咱合成过程的机理推断。