基于GERT网络的非等概率共因失效系统故障间隔期预测

利用泊松过程描述了系统共因失效的发生规律,并针对冲击应力下各部件失效概率不同的假设,以状态转移概率和冲击应力间隔时间为GERT网络的参数,构建了非等概率共因失效下的故障间隔期预测模型,并利用流图增益矩阵进行传递函数的快速求解。按照系统最小割集划分故障模式,将系统分解成若干个GERT子网络,并分析各自故障间隔期,以间隔时间最短的最小割集作为决定系统平均无故障时长的关键割集。与已有文献中的方法进行对比,详细讨论了本文所提方法计算非等概率共因失效系统故障间隔期的优势。最后的仿真结果表明,本文提出的模型能够正确预测系统的平均无故障时间。     

Petri网系统的可达性分析

对Petri网系统的可达性问题做了综合性的阐述和分析, 提出了利用能量优化方法来解决可达性问题的方法, 并在此基础上结合计算代数方法和神经计算模型对可达性问题做了进一步的研究. 主要工作包括 1.给出了Petri网到线性空间的映射规则及其可达性的等价性定理; 2.建立了能量优化模型, 将可达性判断化为优化问题; 3.用神经网络来求解能量优化模型; 4. 最后综合了计算代数方法和能量优化模型的优点给出一个基于计算代数和神经计算的方法. 作者提出了一种利用基于硬件的大规模并行的神经计算来代替基于软件的串行的数字计算的可达性判断的解决方案.     

基于堵塞割集评估随机流动网络的可靠性

基于流动单元在网络中随机流动的特点,提出一种新的网络模型——随机流动网络;建立了该网络模型中个体流动单元随机流动的饱和流模型。网络有多种饱和状态并且总有相对应的堵塞割集。尝试用两端点网络饱和流值不小于给定需求的概率评估网络实际流通能力的可靠性。基于饱和流模型,可以仿真出网络中饱和流分布及各弧流量分布情况;利用网络中堵塞割集弧流量分布建立了评估网络可靠性的表达式。最后通过实例分析给定不同网络需求时相对应的可靠性。     

基于Petri Fault Net的磁浮列车悬浮系统故障分析

随着磁浮列车技术的商业化应用,磁浮列车系统故障诊断越来越受到重视。以中低速磁浮列车为背景,在建立磁浮列车悬浮系统故障模型的基础上,针对磁浮列车悬浮系统的复杂性,将基于Petri Net的故障诊断理论Petri Fault Net应用于磁浮列车悬浮系统的故障诊断中。给出了基于Petri网的最小割集寻找方法;根据磁浮列车2001年以来的运行数据统计,计算出了节点的P概率/T概率;在此基础上进行了故障定位和影响分析。列车的试验运行验证了提出的理论准确性。     

基于模型的定性推理故障诊断方法研究

提出了一种基本模型的定性推理故障诊断方法 ,其基本思想是以定性推理方法为基础 ,并结合系统的模型知识进行故障诊断。首先通过建立系统部件模型的正常和故障工作模式库 ,以及用有向连接图和支路关联矩阵来建立系统的结构描述 ,然后在部件模式库中搜索满足已知条件的模式 ,来诊断出故障的部件     

描述复杂系统故障关系的条件故障图

在复杂系统故障关系分析中 ,为了准确、有效地描述系统状态条件同其故障关系间所存在的关联 ,提出了条件故障图的描述模型。界定并分析了描述系统状态关系的状态树 ,并将它与故障图相结合形成条件故障图。界定并分析了条件故障图的结构及其中的状态条件变化特性。将它应用于航空发动机的控制系统 ,并给出了一个特征实例。条件故障图可以有效地描述状态条件对故障关系的影响及作用 ,适用于对故障关系的自动化描述及分析     

n/k(G)表决冗余多阶段任务系统可靠性优化模型

提出采用多阶段任务系统（phased mission systems, PMS）冗余故障树模型和PMS冗余二元决策图（binary decision diagram, BDD）模型来描述冗余多阶段任务系统;通过递归法实现PMS冗余故障树模型到PMS冗余BDD模型的转换,从而得到整个PMS的最小割集;在分析n/k(G)表决冗余模块在PMS中可靠度计算模型的基础上得到整个PMS的可靠性计算模型。以费用最小为目标,构建多阶段任务系统可靠性冗余优化模型,并应用微粒群算法对模型进行求解。算例通过一个三个阶段n/k(G)表决系统来阐述该方法的应用,并验证了模型的合理性及算法的有效性。     

利用流图直接建模的新型系统AUTO-DYNAMO及其研制

DYNAMO语言是系统动力学的专用仿真语言.在IBM PC机上开发的AUTO—DYNAMO系统实现了系统动力学流图的直接图形建模和从流图模型到DYNAMO程序模型的自动转化,从而使人们能集中精力于模型的建立、研究和决策方案的确定上来,促进了系统动力学的推广使用.本文将着重讨论利用系统动力学流图的直接图形建模以及DYNAMO仿真程序的自动生成过程的程序实现.     

由Petri网模型求系统最小割集的自顶向下法

研究了系统逻辑关系的Petri网表示 ,基于Petri网的建模方法 ,采用Petri网模型求系统最小割集的自顶向下法。与故障树方法相比 ,这种方法可同时获得系统的最小割集和最小路集 ,且求解的效率高。实例分析证实了这一点。     

利用极小割计算随机流网络可靠度的一种算法

对随机流网络可靠度的计算问题进行了研究.提出了网络元件(边和结点)容量下确界的概念,在求基于每个极小割集的每个元件的容量向量时,对其满足的约束条件进行了改进,使其可行解集合大大减小.同时给出了两个引理,根据这两个引理,使得求基于极小割集的所有d-上界点变得非常简单,从而得到了一个计算随机流网络最大流量不少于给定需求流量d+1的可靠度的有效算法.最后,通过实例验证了该方法的有效性.     

基于适应性Agent图的交通系统脆性研究

针对系统脆性的研究,以复杂适应系统和图论为理论基础,提出了Agent图的概念,其中图的每个顶点被看作一个具有适应性的主体。然后将Agent图应用于交通系统脆性的研究,交通网络组成了一个赋权图,网络中各节点作为顶点;考虑到它们之间的交互作用,建立了系统主体崩溃程度的演化规则,进而对交通系统脆性行为进行仿真。     

A Table Based Algorithm for Minimum Directed Spanning Trees

1. INTRODUCTIONSeveral optimal spanning tree methods have been developed for the weighted undirected graph. The commonlyused methods are Kruskal's method (also called Greedy algorithm) and Disorder algorithm [4]. As for theweighted digraph, little work has been done [1]. In practice, the complicated digraph is difficult to be depicted,but easy to be expressed in the form of a table. Based on the table expression instead of the digraph expression,an optimal spanning rooted-tree method cal…     

An Explicit Integer Programming Model of the Minimal Spanning Tree Problem for Digraphs with Asymmetric Weights

1.INTRODUCTIONTheminimalspanningtreeproblemfortheundirectedgraphhasbeenwellstidiedanduntilnowmanyefficientalgorithms[4]havebeenproposed.Ithasbeenobservedbymanypeoplethatastrikingnumberofquitediversemathematicalproblemscanbeformulatedastheproblemsinintegerprogramming.Althoughtheminimalspanningtreeproblemhasbeenformulatedinthisway,suchas[3,5-8],buttheyareallimplicit,thatis,theformulationcontaillssomeunformulatedstatementsintheconstraintsuchasX:spanningtreewhichmakestilefornnllationunsolvabl…     

一种基于有向图模型的模糊多故障诊断算法

基于最大后验概率准则的复杂系统多故障诊断推理算法依赖于系统先验故障概率的获取.针对这一不足,提出了一种基于有向图模型的系统级模糊故障诊断算法.首先用有向图模型描述大型复杂系统各子系统及故障观测节点问的信息依赖关系,建立故障依赖矩阵;然后在故障观测概率空间建立特征故障观测概率矩阵;在此基础上设计了模糊函数以描述实际观测向量与故障特征向量的相似度,并提出了相应的诊断算法.仿真结果表明该算法具有足够的故障诊断精度和诊断效率.     

基于最短时间碎片的在线生产调度算法研究

针对订单型企业的在线生产调度问题,文章通过统计每个设备上允许插入工序的时间区间,提出了基于最短时间碎片的启发式在线生产调度算法.该算法的主要思路是将工序的先后约束关系和在同一设备上的先后执行关系统一建模为无圈有向图,从而依据最短时间碎片将新订单的调度过程转化为在有向图中添加顶点和有向边的过程.仿真实验结果表明该算法可以在保证订单交付期的前提下实现排产任务,并尽可能少地变更已排产工序在设备上的相对位置;在订单频繁到达时,调度的设备利用率较高,达到了约94%;此外,算法运行较快,适用于较大规模在线生产调度问题的求解.     

Bipartite Consensus of Discrete-Time Double-Integrator Multi-Agent Systems with Measurement Noise

The effects of measurement noise are investigated in the context of bipartite consensus of multi-agent systems. In the system setting, discrete-time double-integrator dynamics are assumed for the agent, and measurement noise is present for the agent receiving the state information from its neighbors. Time-varying stochastic bipartite consensus protocols are designed in order to lessen the harmful effects of the noise. Consequently, the state transition matrix of the closed-loop system is analyzed, and sufficient and necessary conditions for the proposed protocol to be a mean square bipartite consensus protocol are given with the help of linear transformation and algebraic graph theory. It is proven that the signed digraph to be structurally balanced and having a spanning tree are the weakest communication assumptions for ensuring bipartite consensus. In particular, the proposed protocol is a mean square bipartite average consensus one if the signed digraph is also weight balanced.     

Table Operation Method for Optimal Spanning Tree Problem

1.INTRODUCTIONSeveraloptimalspanningtreemethodshavebeendevelopedfortheweightundirectedgraph.ThecommonlyusedmethodsareKruskal'sMethod[4](alsocalledGreedyAlgoritlun)andDisorderAlgorithm[4j.Asfortheweightdigraph,littleworkhasbeendone.Inthepractice,thecomplicateddigraphisdifficulttodepict,butitiseasytobeexpressedintheformofatable.Basedoilthetableexpressioninsteadofthedigraphexpression,thispaperdevelopsanoptimalspanningrooted-treemethodcalledtableoperationsmethod(TOM).2.SOMEBASICCONCE…     

THE NORMALITY OF CAYLEY GRAPHS OF FINITE ABELIAN GROUPS WITH VALENCY 5

1. IntroductionLet G be a finite group and S a subset of G not colltaining the idelltity elemellt 1. TheCayley digraph X ~ Cay(G, S) of G on S is defined byV(X) = G, E(X) ~ {(g, sg)jg E G, s E S}.Immediately from the definition there are three obvious facts: (1) Ant(X), the automorphismgroup of X, contains the right regular representation GR of G; (2) X is connected if and onlyif G = (S}, (3) X is an undirected graph (by coalescing each pair (g, sg) and (sg, g) of directededges int…     

Weighted average consensus problem in networks of agents with diverse time-delays

This paper studies the weighted average consensus problem for networks of agents with fixed directed asymmetric unbalance information exchange topology. We suppose that the classical distributed consensus protocol is destroyed by diverse time-delays which include communication time-delay and self time-delay. Based on the generalized Nyquist stability criterion and the Gerschgorin disk theorem, some sufficient conditions for the consensus of multi-agent systems are obtained. And we give the expression of the weighted average consensus value for our consensus protocol. Finally, numerical examples are presented to illustrate the theoretical results.     

ON PAIRED PRIORITIZATIONS OF CRITERIA IN THE PERSPECTIVE OF DIAGRAPHS

It is not usually independent among criteria in multi-criteria decision making(MCDM),and various dependences of criteria greatly influence the results of decision making.If an exact decision is desired,we must make clear the role of the dependences of criteria.Prioritizations,a new kind of dependences of criteria proposed recently,imply that the importance weights of criteria with lower priority for an alternative rely on whether the alternative satisfies the decision maker under criteria with higher priority.It has been validated that there exist lots of relevant applications in our daily activities.However,most existing literatures focus on how to deal with the problems of MCDM with ordered prioritizations among criteria(a special form of prioritizations).The characteristics of prioritizations are not dug deep.This paper constructs a new form of prioritizations,called paired prioritizations,so as to reduce or even avoid imperfect rationality of decision makers hidden in the ordered prioritizations.We first represent binary paired prioritizations as a digraph,based on which we discover two kinds of imperfect rationality(inconsistency and incompleteness) produced in the period that the decision maker supplies the binary paired prioritizations.After the given paired prioritizations are consistent and complete,we develop an approach to transform the paired prioritizations to ordered prioritizations.The latter can be used to handle prioritized MCDM problems.Moreover,uncertainty,another kind of imperfect rationality,is considered when the decision maker provides the fuzzy paired prioritizations based on a set of linguistic labels.We construct a fuzzy digraph whose fuzzy relations are just the fuzzy paired prioritizations.The ordered prioritizations can then be derived with the aid of the fuzzy digraph.Two use cases are taken to show the process of transformations from binary/fuzzy paired prioritizations to ordered prioritizations.