Preventive replacement policies with time of operations,mission durations,minimal repairs and maintenance triggering approaches

When a mission arrives at a random time and lasts for a duration, it becomes an interesting problem to plan replacement policies according to the health condition and repair history of the operating unit, as the reliability is required at mission time and no replacement can be done preventively during the mission duration. From this viewpoint, this paper proposes that effective replacement policies should be collaborative ones gathering data from time of operations, mission durations, minimal repairs and maintenance triggering approaches. We firstly discuss replacement policies with time of operations and random arrival times of mission durations, model the policies and find optimum replacement times and mission durations to minimize the expected replacement cost rates analytically. Secondly, replacement policies with minimal repairs and mission durations are discussed in a similar analytical way. Furthermore, the maintenance triggering approaches, i.e., replacement first and last, are also considered into respective replacement policies. Numerical examples are illustrated when the arrival time of the mission has a gamma distribution and the failure time of the unit has a Weibull distribution. In addition, simple case illustrations of maintaining the production system in glass factories are given based on the assumed data.     

Maximum Cardinality Search for Computing Minimal Triangulations of Graphs

We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. Lex-BFS, a seminal algorithm for recognizing chordal graphs, was the genesis for two other classical algorithms: LEX M and MCS. LEX M extends the fundamental concept used in Lex-BFS, resulting in an algorithm that not only recognizes chordality, but also computes a minimal triangulation of an arbitrary graph. MCS simplifies the fundamental concept used in Lex-BFS, resulting in a simpler algorithm for recognizing chordal graphs. The new algorithm MCS-M combines the extension of LEX M with the simplification of MCS, achieving all the results of LEX M in the same time complexity.     

Some results on generalized residual entropy

Shannon’s entropy plays an important role in the context of information theory. Since this entropy is not applicable to a system which has survived for some units of time, the concept of residual entropy has been developed in the literature. Here we generalize the residual entropy by choosing a convex function ? with ?(1) = 0. In this paper, some orderings and aging properties have been defined in terms of the generalized residual entropy function and their properties have been studied. Quite a few results available in the literature have been generalized and some distributions (viz. uniform, exponential, Pareto, power series, finite range) have been characterized through the generalized residual entropy.     

静电火灾的产生及其防治

文章详细分析了静电产生的机理，指出积聚静电电荷的多少与材料的电阻率和介电常数有关。讨论了静电火灾发生的条件，指出静电火灾的发生具有隐蔽性、复杂性和突发性。但只要对其规律进行深入地研究，可以找到有效地防止静电火灾发生的办法。     

Periodic surface modeling for computer aided nano design

Current solid and surface modeling methods based on Euclidean geometry in traditional computer aided design are not efficient in constructing a large number of atoms and particles. In this paper, we propose a periodic surface model for computer aided nano design such that geometry of atoms and molecules can be constructed parametrically. At the molecular scale, periodicity of the model allows thousands of particles to be built efficiently. At the meso scale, inherent porosity of the model represents natural morphology of polymer and macromolecule. Surface and volume operations are defined to support crystal and molecular model creation with loci and foci periodic surfaces. The ultimate goal is to enable computer assisted material and system design at atomic, molecular, and meso scales.     

Evaluate the performance of a stochastic-flow network with cost attribute in terms of minimal cuts

This paper proposes a performance index to measure the quality level of a stochastic-flow network in which each node has a designated capacity, which will have different lower levels due to various partial and complete failures. The performance index is the probability that the maximum flow of the network equals the demand d without exceeding the budget b. A simple algorithm in terms of minimal cuts is first proposed to generate all upper boundary points for (d, b), and then the probability that the maximum flow is less than or equal to d can be calculated in terms of such points. The upper boundary point for (d, b) is a maximal vector representing the capacity of each arc such that the maximum flow of the network under the budget b is d. The performance index can be calculated by repeating the proposed algorithm to obtain all upper boundary point for (d−1, b). A benchmark example is shown to illustrate the solution procedure.     

一种基于密度的不确定数据离群点检测算法

不确定数据普遍存在于如移动计算、RFID技术和传感器网络等大量应用之中.由于不确定数据的离群点检测算法可以提高服务质量,提出一种基于密度的不确定数据离群检测算法RLOF.该算法引入一种R2-tree结构,有效降低了计算局部离群因子时的时间复杂度,同时降低了不确定数据集中的数据更新成本以及海量数据维护成本.理论分析和实验结果充分证明了该算法是有效可行的.     

Stochastic computer network with multiple terminals under total accuracy rate

From the viewpoint of service level agreements,data transmission accuracy is one of the critical performances for assessing Internet by service providers and enterprise customers.The stochastic computer network(SCN),in which each edge has several capacities and the accuracy rate,has multiple terminals.This paper is aimed mainly to evaluate the system reliability for an SCN,where system reliability is the probability that the demand can be fulfilled under the total accuracy rate.A minimal capacity vector allows the system to transmit demand to each terminal under the total accuracy rate.This study proposes an efficient algorithm to find all minimal capacity vectors by minimal paths.The system reliability can then be computed in terms of all minimal capacity vectors by the recursive sum of disjoint products(RSDP) algorithm.     

支持向量机序贯最小优化算法推导的改进

已有文献中的支持向量机SMO算法推导过程计算复杂,该文给出一个简洁推导。整个推导过程没有复杂的计算,除了误差函数外,不需引入其它中间变量。     

A constructive approach to minimal realization problem of 2D systems

Unlike in the 1D case, it is not always possible to find a minimal state-space realization for a 2D system except for some particular categories. The purpose of this paper is to explore a constructive approach to the minimal Roesser model realization problem for a class of 2D systems which does not belong to the clarified categories. As one of the main results, a constructive realization procedure is first proposed. Based on the proposed procedure, sufficient conditions and explicit construction for minimal realizations of the considered 2D systems are shown. In addition, possible variations and applications of the obtained results are discussed and illustrative examples are presented.