本文選題：無圈序貫網(wǎng)絡(luò) + 多狀態(tài)節(jié)點(diǎn)�。� 參考：《西南交通大學(xué)》2016年碩士論文

【摘要】：本文主要研究無圈序貫網(wǎng)絡(luò)的可靠性問題,無圈序貫網(wǎng)絡(luò)主要分為兩類：含有多狀態(tài)節(jié)點(diǎn)的無圈序貫網(wǎng)絡(luò)(Acyclic consecutively multistate-node network-ACMNN)和含有多狀態(tài)弧的無圈序貫網(wǎng)絡(luò)(Acyclic consecutively multistate-arc Network-ACMAN)。本文第三章主要介紹Levitin和Yeh對(duì)ACMNN可靠性的研究成果及研究成果存在的局限性。Levitin假設(shè)網(wǎng)絡(luò)中的所有節(jié)點(diǎn)完全可靠、弧具有正常和失效兩種狀態(tài),提出了基于節(jié)點(diǎn)的一般生成函數(shù)(universal generating function-UGF)和逐步遞歸對(duì)網(wǎng)絡(luò)可靠性進(jìn)行評(píng)價(jià)的方法,解決了ACMNN的可靠性評(píng)價(jià)問題,但是節(jié)點(diǎn)完全可靠的假設(shè)限制了該方法的應(yīng)用。Yeh首次提出k-/n屈節(jié)點(diǎn),并結(jié)合k+/n節(jié)點(diǎn)提出含有k/n節(jié)點(diǎn)的ACMNN的概念。Yeh對(duì)UGF進(jìn)行了改進(jìn),但是由于改進(jìn)的UGF只能表示每個(gè)節(jié)點(diǎn)是否接受到信號(hào)并不能表示每個(gè)節(jié)點(diǎn)接受到的信號(hào)的數(shù)量,在遞歸過程中需要為普通節(jié)點(diǎn)、k+/n節(jié)點(diǎn)和k-/n節(jié)點(diǎn)制定不同的遞歸方法,遞歸過程十分復(fù)雜。針對(duì)Levitin和Yeh研究的局限性,本文第四章提出n中取[k1,k2]節(jié)點(diǎn)的概念：當(dāng)節(jié)點(diǎn)接收到的信號(hào)數(shù)量不小于k1且不大于k2時(shí)節(jié)點(diǎn)正常,否則失效。將包含普通節(jié)點(diǎn)在內(nèi)的所有的節(jié)點(diǎn)都表示為[k1,k2]/n節(jié)點(diǎn)。隨后針對(duì)[k1,k2]/n節(jié)點(diǎn)的特點(diǎn)改進(jìn)UGF,改進(jìn)后的UGF即可以表示節(jié)點(diǎn)是否接受到信號(hào)又可以表示節(jié)點(diǎn)接受到的信號(hào)數(shù)量,建立適合[k1,k2]/n節(jié)點(diǎn)的遞歸過程。并利用[k1,k2]/n節(jié)點(diǎn)和ACMNN的特點(diǎn),對(duì)遞歸過程進(jìn)行簡(jiǎn)化,解決了含有[k1,k2]/n節(jié)點(diǎn)的ACMNN的可靠性問題且有效的簡(jiǎn)化了遞歸過程。利用JAVA編程,開發(fā)出解決含有[k1,k2]/n節(jié)點(diǎn)的ACMNN的可靠性問題的軟件。本文第五章利用UGF和遞歸方法解決了含有多狀態(tài)弧和兩狀態(tài)節(jié)點(diǎn)的ACMAN的可靠性的評(píng)價(jià)問題。在ACMAN中,弧具有多狀態(tài),不同的弧在相同的狀態(tài)能夠傳遞的信號(hào)強(qiáng)度不同、節(jié)點(diǎn)具有兩狀態(tài)且信號(hào)的傳遞滿足流量守恒定律。因此需要對(duì)UGF進(jìn)行改進(jìn),改進(jìn)后的UGF不僅可以表示節(jié)點(diǎn)是否接收到信號(hào)及接收到的信號(hào)的數(shù)量,還可以表示接受到的信號(hào)狀態(tài)和對(duì)應(yīng)的信號(hào)強(qiáng)度。然后建立節(jié)點(diǎn)UGF的遞歸過程,并總結(jié)含有多狀態(tài)弧的ACMAN的特點(diǎn)和性質(zhì),對(duì)遞歸過程進(jìn)行簡(jiǎn)化,解決了含有多狀態(tài)弧的ACMAN的可靠性評(píng)價(jià)問題。并利用JAVA編程,開發(fā)出解決ACMAN可靠性問題的軟件。
[Abstract]:In this paper, we study the reliability of acyclic sequential networks, which are divided into two categories: (Acyclic consecutively multistate-node network-ACMNN with multi-state nodes and (Acyclic consecutively multistate-arc network-ACMAN with multi-state arcs. In the third chapter, we mainly introduce Levitin and Yeh's research results on the reliability of ACMNN and their limitations. Levitin assumes that all nodes in the network are completely reliable, and the arc has two normal and failure states. In this paper, the general generating function (universal generating function-UGF based on nodes and the method of evaluating the network reliability with stepwise recursion are proposed, and the problem of reliability evaluation of the network is solved. However, the assumption that the nodes are completely reliable limits the application of the method. Yeh proposes the k-rn node for the first time, and improves the UGF based on the concept of ACMNN with k / n node. However, since the improved UGF can only indicate whether each node receives a signal or not, the number of signals received by each node does not represent the number of signals received by each node. In the process of recursion, different recursive methods should be developed for the ordinary node k / n node and k-r / n node. The recursive process is very complex. In view of the limitations of Levitin and Yeh studies, the concept of [k1k2] node in n is proposed in chapter 4: if the number of signals received by the node is not less than K1 and is not greater than K2, the node will fail. All nodes including ordinary nodes are represented as [k1k2] / n nodes. Then, according to the characteristics of [k1k2] / n node, the improved UGF can indicate whether the node receives the signal or not and the number of signals received by the node, and establish a recursive process suitable for [k1k2] / n node. Using the characteristics of [k1k2] / n node and ACMNN, the recursive process is simplified, the reliability problem of ACMNN with [k1k2] / n node is solved, and the recursive process is simplified effectively. A software is developed to solve the reliability problem of ACMNN with [k1k2] / n node by Java programming. In chapter 5, the reliability evaluation of ACMAN with multi-state arcs and two-state nodes is solved by using UGF and recursive method. In ACMAN, arcs have multiple states, different arcs can transfer different signals in the same state, nodes have two states and the signal transmission meets the law of conservation of flow. So we need to improve UGF. The improved UGF can not only indicate whether the node receives the signal and the number of the received signal, but also indicate the state of the received signal and the corresponding signal intensity. Then, the recursive process of node UGF is established, and the characteristics and properties of ACMAN with multi-state arc are summarized, the recursive process is simplified, and the reliability evaluation problem of ACMAN with multi-state arc is solved. And using Java programming, developed to solve the ACMAN reliability problem software.
【學(xué)位授予單位】：西南交通大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2016
【分類號(hào)】：O213.2

【相似文獻(xiàn)】

相關(guān)期刊論文 前10條

1 李國慶,程林鳳;組合問題中生成函數(shù)的應(yīng)用[J];彭城職業(yè)大學(xué)學(xué)報(bào);2001年02期

2 邱紅軍;張艷紅;;生成函數(shù)在概率計(jì)算中的應(yīng)用[J];科技信息;2009年34期

3 朱偉義;;冪和序列的生成函數(shù)與冪和新的計(jì)算公式[J];商洛學(xué)院學(xué)報(bào);2009年06期

4 安永紅;張春霞;;生成函數(shù)的若干應(yīng)用[J];呼倫貝爾學(xué)院學(xué)報(bào);2010年03期

5 陳廣軍;;由生成函數(shù)構(gòu)成的梯度投影法[J];運(yùn)籌學(xué)雜志;1987年01期

6 邵學(xué)才，李東昊，，葉秀明;一些特殊圖的生成函數(shù)[J];北京工業(yè)大學(xué)學(xué)報(bào);1996年03期

7 于秀源,周岳;關(guān)于位數(shù)碼列的生成函數(shù)的注記[J];杭州師范學(xué)院學(xué)報(bào);1999年06期

8 于秀源,周岳;關(guān)于位數(shù)碼列的生成函數(shù)的注記[J];杭州師范學(xué)院學(xué)報(bào);1999年06期

9 邱建霞;環(huán)狀限距組合計(jì)數(shù)的一些結(jié)果[J];海南師范學(xué)院學(xué)報(bào)(自然科學(xué)版);2003年04期

10 李中恢;黃小潔;;生成函數(shù)及其應(yīng)用[J];寧波教育學(xué)院學(xué)報(bào);2007年02期

相關(guān)會(huì)議論文 前3條

1 孟昭為;;數(shù)列的生成函數(shù)及其在概率計(jì)算中的應(yīng)用[A];數(shù)學(xué)及其應(yīng)用文集——中南模糊數(shù)學(xué)和系統(tǒng)分會(huì)第三屆年會(huì)論文集（上卷）[C];1995年

2 章忠志;;Random walks in complex networks[A];第六屆全國網(wǎng)絡(luò)科學(xué)論壇暨第二屆全國混沌應(yīng)用研討會(huì)論文集[C];2010年

3 亓萬鋒;羅鐘鉉;樊鑫;;由任意擴(kuò)張矩陣的Primal逼近型細(xì)分推導(dǎo)的細(xì)分[A];第六屆全國幾何設(shè)計(jì)與計(jì)算學(xué)術(shù)會(huì)議論文集[C];2013年

相關(guān)博士學(xué)位論文 前6條

1 亓萬鋒;基于生成函數(shù)的細(xì)分格式和小波研究[D];大連理工大學(xué);2013年

2 安宗文;基于通用生成函數(shù)的離散化應(yīng)力—強(qiáng)度干涉模型研究[D];電子科技大學(xué);2009年

3 代玉林;上升序列與排列中的有禁模式[D];南開大學(xué);2013年

4 樊如冰;分拆鉤和秩的組合研究[D];南開大學(xué);2014年

5 張永杰;分拆與匹配中的有禁模式[D];南開大學(xué);2009年

6 李淑萍;網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)對(duì)傳播的影響研究[D];中北大學(xué);2015年

相關(guān)碩士學(xué)位論文 前8條

1 陳垂波;相互作用網(wǎng)絡(luò)的滲流問題研究[D];電子科技大學(xué);2015年

2 霍婭鮮;滲流理論在多階段疾病傳播網(wǎng)絡(luò)中的應(yīng)用[D];中北大學(xué);2016年

3 陳靜靜;無圈序貫網(wǎng)絡(luò)的可靠性研究[D];西南交通大學(xué);2016年

4 邵文凱;狄利克萊級(jí)數(shù)及其生成函數(shù)[D];四川師范大學(xué);2012年

5 員雪莉;平面樹中給定出度或度的點(diǎn)的計(jì)數(shù)[D];華東師范大學(xué);2015年

6 李雪陽;變系數(shù)廣義Hamilton系統(tǒng)的生成函數(shù)方法[D];湘潭大學(xué);2010年

7 何佳;K-叉樹中給定出度的點(diǎn)的計(jì)數(shù)[D];華東師范大學(xué);2015年

8 孫曉敏;三類WZ-方程的一些探討[D];蘇州大學(xué);2012年

本文編號(hào)：2062548