This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.
标签： capacities stochastic addresses network
上传时间： 2015-12-03
上传用户：xfbs821
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.
标签： capacities stochastic addresses network
上传时间： 2013-12-25
上传用户：ggwz258
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.
标签： capacities stochastic addresses network
上传时间： 2014-01-09
上传用户：二驱蚊器
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.
标签： capacities stochastic addresses network
上传时间： 2013-12-28
上传用户：独孤求源
Each arc of a binary-state network has good/bad states. The system reliability, the probability that source s communicates with sink t, can be computed in terms of minimal paths (MPs). An MP is an ordered sequence of arcs from s to t that has no cycle. Note that a minimal path is different from the so-called minimum path. The latter is a path with minimum cost.
标签： binary-state reliability probability network
上传时间： 2015-12-04
上传用户：xcy122677
经典的BP neural network 算法
上传时间： 2013-12-14
上传用户：zycidjl
经典的SOM Neural Network 算法
上传时间： 2015-12-04
上传用户：hgy9473
A stochastic-flow network consists of a set of nodes, including source nodes which supply various resources and sink nodes at which resource demands take place, and a collection of arcs whose capacities have multiple operational states.
标签： nodes stochastic-flow including consists
上传时间： 2013-12-22
上传用户：wlcaption
“网络基本输入／输出系统”（Network Basic Input/Output System, NetBIOS）是一种标准的应用程序编程接口（ A P I），1 9 8 3年由S y t e k公司专为I B M开发成功)
标签： Network NetBIOS Output System
上传时间： 2015-12-09
上传用户：wanghui2438
关于UTRAN(Universal Terrestrial Radio Access Network 通用陆地无线接入网络)的全面描述. 对UTRAN的结构,协议层,操作&管理要求等详细描述,学习TD的好材料
标签： UTRAN Terrestrial Universal Network
上传时间： 2014-02-09
上传用户：dave520l
