-
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.
標(biāo)簽：
capacities
stochastic
addresses
network
上傳時(shí)間：
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.
標(biāo)簽：
capacities
stochastic
addresses
network
上傳時(shí)間：
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.
標(biāo)簽：
capacities
stochastic
addresses
network
上傳時(shí)間：
2014-01-09
上傳用戶：二驅(qū)蚊器
-
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.
標(biāo)簽：
capacities
stochastic
addresses
network
上傳時(shí)間：
2013-12-28
上傳用戶：獨(dú)孤求源
-
Returns weighted percentiles of a sample given the weight vector w
％ The idea is to give more emphasis in some examples of data as compared to
％ others by giving more weight. For example, we could give lower weights to
％ the outliers.
％ The motivation to write this function is to compute percentiles for Monte
％ Carlos simulations where some simulations are very bad (in terms of goodness
％ of fit between simulated and actual value) than the others and to give
％ the lower weights based on some goodness of fit criteria.
標(biāo)簽：
percentiles
weighted
Returns
sample
上傳時(shí)間：
2016-01-28
上傳用戶：小儒尼尼奧
-
Easy-to-Use, Ultra-Tiny, Differential, 16-Bit Delta Sigma ADC With I2C Interface
The LTC2453 is an ultra-tiny, fully differential, 16-bit, analog-to-digital converter. The LTC2453 uses a single 2.7V to 5.5V supply and communicates through an I2C interface. The ADC is available in an 8-pin, 3mm x 2mm DFN package. It includes an integrated oscillator that does not require any external components. It uses a delta-sigma modulator as a converter core and has no latency for multiplexed applications. The LTC2453 includes a proprietary input sampling scheme that reduces the average input sampling current several orders of magnitude lower than conventional delta-sigma converters. Additionally, due to its architecture, there is negligible current leakage between the input pins.
標(biāo)簽：
Differential
Easy-to-Use
Ultra-Tiny
Interface
上傳時(shí)間：
2014-01-08
上傳用戶：鳳臨西北
-
Express DSP compliant C55x DTMF detector software is proposed in two versions: one with a 5 ms frame
size and one with a 10 ms frame size. The versions are quite similar in behavior. The version with a 10 ms
frame size is faster, but the overall quality is higher in the 5 ms version, due to lower time granularity. DTMF算法for TI DSP 54X/55X
標(biāo)簽：
compliant
detector
software
proposed
上傳時(shí)間：
2016-02-15
上傳用戶：liuchee
-
Squaring circuits are an important building block for impulse-radio UWB non-coherent receivers. This work proposes a squarer, based on the quadratic law of saturated transistors. Such a circuit has already been proposed for lower frequency applications, therefore this work focuses on the extension to ultra wide bandwidth, with particular care to the consequences related to the deviation from the ideal quadratic law of 0.18μm CMOS transistors.
標(biāo)簽：
impulse-radio
non-coherent
important
receivers
上傳時(shí)間：
2013-12-24
上傳用戶：kikye
-
輕易學(xué)好C++編程技巧 - 進(jìn)楷 (香港科技大學(xué)筆記 19課) 內(nèi)容包括
1) base C++ review,
2) Pointers and Dynamic Objects,
3) Recursion,Linked Lists,
4) Stacks and Queues,
5) Algorithm Analysis,
6) Insertion Sort and Mergesort,
7) Quicksort,
8) Heaps and Heapsort,
9) lower Bound of Sorting and Radix Sort,
10) Binary Trees and Binary Search Trees
11) AVL Trees,
12) B+ Trees
13) Graphs and Breadth-First Search
14) Depth-First Search
15) Connected Components, Directed Graphs,
16) Topological Sort
17) Hashing
18) Pattern Matching
19) Additional Review
標(biāo)簽：
Pointers
Dynamic
Objects
review
上傳時(shí)間：
2014-10-10
上傳用戶：chfanjiang
-
The "GEE! It s Simple" package illustrates Gaussian elimination with partial pivoting, which produces a factorization of P*A into the product L*U where P is a permutation matrix, and L and U are lower and upper triangular, respectively.
The functions in this package are accurate, but they are far slower than their MATLAB equivalents (x=A\b, [L,U,p]=lu(A), and so on). They are presented here merely to illustrate and educate. "Real" production code should use backslash and lu, not this package.
標(biāo)簽：
illustrates
elimination
Gaussian
pivoting
上傳時(shí)間：
2016-11-09
上傳用戶：wang5829
