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
上传用户：独孤求源
This document contains a general overview in the first few sections as well as a more detailed reference in later sections for SVMpython. If you re already familiar with SVMpython, it s possible to get a pretty good idea of how to use the package merely by browsing through svmstruct.py and multiclass.py. This document provides a more in depth view of how to use the package. Note that this is not a conversion of SVMstruct to Python. It is merely an embedding of Python in existing C code. All code other than the user implemented API functions is still in C, including optimization.
标签： document contains detailed overview
上传时间： 2013-12-14
上传用户：希酱大魔王
Yet another Java implementation for the addictive Minesweeper game. This game comes with a number of options unavailable in Windows s version, such as allowing more than one mines in a square.
标签： game implementation Minesweeper addictive
上传时间： 2014-01-06
上传用户：zhaiyanzhong
#ifdef _AFXDLL Enable3dControls() // Call this when using MFC in a shared DLL #else Enable3dControlsStatic() // Call this when linking to MFC statically #endif CPreviewDialogDlg dlg m_pMainWnd = &dlg int nResponse = dlg.DoModal() if (nResponse == IDOK) { // TODO: Place code here to handle when the dialog is // dismissed with OK } else if (nResponse == IDCANCEL) { // TODO: Place code here to handle when the dialog is // dismissed with Cancel } // Since the dialog has been closed, return FALSE so that we exit the // application, rather than start the application s message pump. return FALSE }
标签： Enable3dControls Enable3d AFXDLL shared
上传时间： 2015-12-19
上传用户：hustfanenze
In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical particle filtering algorithm. Each particle contains a logical formula that describes a set of states. The algorithm updates the formulae as new observations are received. Since a single particle tracks many states, this filter can be more accurate than a traditional particle filter in high dimensional state spaces, as we demonstrate in experiments.
标签： relational filtering consider problem
上传时间： 2016-01-02
上传用户：海陆空653
We present a particle filter construction for a system that exhibits time-scale separation. The separation of time-scales allows two simplifications that we exploit: i) The use of the averaging principle for the dimensional reduction of the system needed to solve for each particle and ii) the factorization of the transition probability which allows the Rao-Blackwellization of the filtering step. Both simplifications can be implemented using the coarse projective integration framework. The resulting particle filter is faster and has smaller variance than the particle filter based on the original system. The convergence of the new particle filter to the analytical filter for the original system is proved and some numerical results are provided.
标签： construction separation time-scale particle
上传时间： 2016-01-02
上传用户：fhzm5658
java语言开发的P2P流媒体系统，“Stream-2-Stream implements multicast+, a next generation streaming protocol. Multicast+ is more efficient and requires less bandwidth than direct streaming (e.g. shoutcast/icecast). Stream-2-Stream (abbreviated "s2s" or "S2S") stations have no user limit stations can be set up without paying a fortune for bandwidth. Stream-2-Stream saves bandwidth by passing streams from one peer to another through multicast and unicast p2p, rather than everyone getting a stream from one central server (Shoutcast/Icecast). ”更多：http://s2s.sourceforge.net/about.php
上传时间： 2016-01-09
上传用户：ikemada
In this paper, a new family of Cassinian wave-guides is proposed, simulating and calculation are finished with CST Microwave Studio that based on Finite Integral Technique (FIT), and some results are given. Electromagnetic field mode type of it is TE, electromagnetic field is stronger near neck region, and some resonance frequencies appear. The new Cassinian curve wave-guides will possess higher power than ones of the rectangular and elliptic wave-guides because the height at the position where maximal electric field occurs is smaller.
标签： calculation wave-guides simulating Cassinian
上传时间： 2014-01-18
上传用户：netwolf
