于改进UGF算法的线性拓扑WSN系统可靠性评估

提出了面向感知数据融合的通用发生函数(UGF)改进算法,并使用该算法对线性拓扑结构的无线传感网络(WSN)可靠性进行了评估。首先对PEGASIS协议下WSN的线性拓扑结构及数据传输过程进行抽象,建立了双向连续k/n:F系统模型。然后根据WSN感知数据传输及融合方式,在改进算法中重新定义了传感节点的UGF表达式和组合算子。最后对双向连续k/n:F模型进行单向化分解,根据得到的单向模型可靠性推导出双向模型的可靠性表达式。通过具体实例对提出的改进算法进行了验证,计算结果显示改进的算法可有效解决传感网络线性拓扑结构可靠性评估问题。     

基于遗传算法的多目标可靠性优化

在元件的体积、重量和造价的共同约束下的多级串并联系统的可靠性优化问题是一个具有多局部极值的、非线性的、同时具有整数和实数变量的混合优化问题.将遗传算法和多目标可靠性分配问题相结合,对可靠性分配问题进行求解,得到较好效果,从而得出结论,遗传算法在求解多目标可靠性优化问题中是一种行之有效的方法.     

GA算子的代数模型

采用矩阵形式表示遗传操作过程 ,可为遗传算法程序设计提供简明的数学模型     

基于NBUMg类分布的更换策略比较

证明了年龄更换策略和成批更换策略依矩母函数序减少(增加)任意时间间隔内的失效次数的充要条件是基分布具有NBUMg (NWUMg)性质;更换间隔不同的成批更换策略在相同工作时间内的失效次数也作了比较.     

一个水流问题的遗传算法求解

应用遗传算法(GA)来讨论一个水流问题.这个水流问题曾是不少统计学者用来考察不同试验设计和建模方法的常用案例.通过本例旨在说明遗传算法确为求解复杂系统优化问题的有力工具.     

Crowding with nearest neighbors replacement for multiple species niching and building blocks preservation in binary multimodal functions optimization

This paper introduces a novel niching scheme called the q-nearest neighbors replacement (q-NNR) method in the framework of the steady-state GAs (SSGAs) for solving binary multimodal optimization problems. A detailed comparison of the main niching approaches are presented first. The niching paradigm and difference of the selection-recombination genetic algorithms (GAs) and the recombination-replacement SSGAs are discussed. Then the q-NNR is developed by adopting special replacement policies based on the SSGAs; a Boltzmann scheme for dynamically sizing the nearest neighbors set is designed to achieve a speed-up and control the proportion of individuals adapted to different niches. Finally, experiments are carried out on a set of test functions characterized by deception, epistasis, symmetry and multimodality. The results are satisfactory and illustrate the effectivity and efficiency of the proposed niching method.     

First Steps Towards an Institution of Algebra Replacement Systems

Algebra replacement systems are introduced as formal models of state dependent and state transforming systems. The first part of an institution of algebra replacement systems is developed, that is, a model theoretic and logical framework that can be used to describe and reason about such systems. The usual operational understanding of a replacement system as a labeled transition system is then considered as one particular model in the model category. Under appropriate conditions such a constructed replacement system is initial.     

The generalized HNBUE (HNWUE) class of life distributions

This paper examines the properties of a new class of life distributions (and its dual class), named GHNBUE (GHNWUE) whose members have a coefficient of variation less than (greater than) or equal to one. We characterize the GHNBUE (GHNWUE) property by using the Laplace transform. Several interesting shock models leading to the GHNBUE (GHNWUE) property are studied. These include both homogeneous and nonhomogeneous Poisson processes governing the arrival of shocks. A certain cumulative damage model is also investigated. We also examine whether the GHNBUE (GHNWUE) property is preserved under the reliability operations: (i) Convolution, (ii) mixtures and (iii) formation of coherent systems.

---

Zusammenfassung Diese Arbeit untersucht Eigenschaften einer neuen Klasse von Lebensdauer-Verteilungen (und deren dualen Klasse), welche GHNBUE (bzw. GHNWUE) genannt wird und deren Elemente einen Variationskoeffizienten 1 (bzw. 1) haben. Wir charakterisieren die GNBUE (GHNWUE) Eigenschaft mit Hilfe der Laplace-Transformierten der Verteilung. Es werden verschiedene interessente Schockmodelle, welche zur GHNBUE (GHNWUE) Eigenschaft führen, studiert. Als Ankunftsprozesse der Schocks verwenden wir homogene und inhomogene Poisson-Prozesse. Auch ein gewisses additives Schadensmodell wird untersucht. Wir befassen uns auch mit der Frage, ob die GHNBUE (GHNWUE) Eigenschaft unter folgenden Zuverlässigkeitsoperationen erhalten bleibt: 1. Faltung, 2. Mischungen, 3. Bildung kohärenter Systeme.

     

Waiting time problems for a two-dimensional pattern

We consider waiting time problems for a two-dimensional pattern in a sequence of i.i.d. random vectors each of whose entries is 0 or 1. We deal with a two-dimensional pattern with a general shape in the two-dimensional lattice which is generated by the above sequence of random vectors. A general method for obtaining the exact distribution of the waiting time for the first occurrence of the pattern in the sequence is presented. The method is an extension of the method of conditional probability generating functions and it is very suitable for computations with computer algebra systems as well as usual numerical computations. Computational results applied to computation of exact system reliability are also given. Department of Statistical Science, School of Mathematical and Physical Science, The Graduate University for Advanced Studies This research was partially supported by the ISM Cooperative Research Program (2002-ISM-CRP-2007).     

绿色建筑项目管理综合均衡优化研究

绿色建筑凭借其诸多优点,已然成为我国未来建筑发展的新方向,而对绿色建筑的工期、成本和功能进行全面系统研究并进行综合均衡优化,对于促进绿色建筑的发展具有深远影响.在描述各工程活动的成本和持续时间之间、功能和持续时间之间的非线性关系基础上,运用多属性效用函数理论构建了绿色建筑项目的功能一工期一成本综合均衡优化模型,并用遗传算法进行求解,可以得到最佳均衡解.最后通过一个实例验证了优化模型具有良好的科学性和实用性.     

A generalized Pólya urn model and related multivariate distributions

In this paper, we study of Pólya urn model containing balls of (m+1) different labels under a general replacement scheme, which is characterized by an (m+1) × (m+1) addition matrix of integers without constraints on the values of these (m+1)² integers other than non-negativity. LetX ₁,X ₂,...,X _n be trials obtained by the Pólya urn scheme (with possible outcomes: “O”, “1”,...“m”). We consider the multivariate distributions of the numbers of occurrences of runs of different types arising from the various enumeration schemes and give a recursive formula of the probability generating function. Some closed form expressions are derived as special cases, which have potential applications to various areas. Our methods for the derivation of the multivariate run-related distribution are very simple and suitable for numerical and symbolic calculations by means of computer algebra systems. The results presented here develop a general workable framework for the study of Pólya urn models. Our attempts are very useful for understanding non-classic urn models. Finally, numerical examples are also given in order to illustrate the feasibility of our results. This research was partially supported by the ISM Cooperative Research Program (2003-ISM·CRP-2007).     

基于遗传算法的二层线性规划问题的求解算法

本研究了下层以最优解返回上层的二层线性规划问题的遗传算法。在提出可行度概念的基础上，构造了二层线性规划上层规划问题的适应度函数，由此设计了求解二层线性规划问题遗传算法。为了提高遗传算法处理约束的能力，在产生初始种群时将随机产生的初始种群变为满足约束的初始种群，从而避免了使用罚函数处理约束带来的困难，最后用实例验证了本提出的二层线性规划的遗传算法的有效性。