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.     

二进制分辨矩阵在连续属性约简中的研究

针对二进制分辨矩阵无法处理连续型数据,提出一种基于邻域的改进二进制分辨矩阵及其属性约简方法。实验结果表明,与先数据离散化,后属性约简的方法相比,利用文中方法提取出的特征属性的分类能力更高。     

邻域等价关系诱导的改进ID3决策树算法

经典ID3决策树算法适用于离散型数据分类,但用于连续处理时需要数据离散化容易导致信息损失。提出邻域等价关系从而诱导邻域ID3(NID3)决策树算法,NID3算法改进了ID3决策树算法,能够直接实施连续预测并获取更好的分类效果。在邻域决策系统中,挖掘一种邻域等价关系;基于邻域等价粒化,构建邻域信息度量;基于邻域信息增益,设计NID3决策树算法。实例分析与数据实验均表明,NID3算法具有连续数据分类预测有效性,在分类机器学习中优于ID3算法。     

A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests

Combinatorial optimization problems are usually modeled in a static fashion. In this kind of problems, all data are known in advance, i.e. before the optimization process has started. However, in practice, many problems are dynamic, and change while the optimization is in progress. For example, in the dynamic vehicle routing problem (DVRP), new orders arrive when the working day plan is in progress. In this case, routes must be reconfigured dynamically while executing the current simulation. The DVRP is an extension of a conventional routing problem, its main interest being the connection to many real word applications (repair services, courier mail services, dial-a-ride services, etc.). In this article, a DVRP is examined, and solving methods based on particle swarm optimization and variable neighborhood search paradigms are proposed. The performance of both approaches is evaluated using a new set of benchmarks that we introduce here as well as existing benchmarks in the literature. Finally, we measure the behavior of both methods in terms of dynamic adaptation.     

基于邻域彩色变化矢量场的图像边缘检测技术研究*

首先进行了边缘检测系统结构设计,建立了图像邻域彩色变化矢量场的数理模型,提出了用图像邻域彩色变化方向锐度描述图像边缘,进而应用模糊聚类自适应检测边缘.实验表明:与基于梯度的边缘检测技术相比,该方法在噪声抑制以及边缘准确定位上均取得了好的效果,是一种应用广泛的优秀边缘检测算法.