Analysis on a Localized Pruning Method for Connected Dominating Sets
|
|
- Poppy Richards
- 5 years ago
- Views:
Transcription
1 JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 23, (2007) Analysis on a Localize Pruning Metho for Connecte Dominating Sets JOHN SUM 1, JIE WU 2 AND KEVIN HO 3 1 Department of Information Management Chung-Shan Meical University Taichung, 402 Taiwan pfsum@csmu.eu.tw 2 Department of Computer Science an Engineering Floria Atlantic University Boca Raton, Floria 33431, U.S.A. jie@cse.fau.eu 3 Department of Computer Science an Communication Engineering Provience University Taichung, 433 Taiwan ho@pu.eu.tw While restricte rule-k has been succeee in generating a connecte ominating set (CDS) of small size, not much theoretical analysis on the size has been one. In this paper, an analysis on the expecte size of a CDS generate by such algorithm an its relation to ifferent noe ensity is presente. Assume N noes are eploye uniformly an ranomly in a square of size L N L N (where N an L N ); three results are obtaine. (1) It is prove that the noe egree istribution of such a network follows a Poisson istribution. (2) The expecte size of a CDS that is erive by the restricte pruning rule-k is a ecreasing function with respect to the noe ensity n ˆ. For ˆn 30. it is foun that the expecte size is close to N / n ˆ. (3) It is prove that the lower boun on the expecte size of a CDS for a Poissonian network of noe ensity ˆn is given by 1 nˆ { exp( ( nˆ 1))} N. The secon result is of paramount importance for practinˆ 1 nˆ 1 tioners. It provies the information about the expecte size of a CDS when the noe ensity ˆn is between 6 an 30. The ata (expecte CDS size) for this range can harly be provie by simulations. Keywors: connecte ominating set (CDS), expecte size, lower boun, restricte pruning rule, wireless mobile a hoc network 1. INTRODUCTION In wireless a hoc networks, the selecting of a subset of noes (i.e., construction of a virtual backbone) for efficient message routing is always a crucial problem. In the last ecae, much research has been conucte in orer to evelop a simple an yet efficient algorithm for the construction of such a virtual backbone. Amongst them, istribute algorithms base on the iea of connecte ominating set (CDS) [4] have been propose an have succeee in generating a virtual backbone of small size [2, 10-13]. In these algorithms, a CDS is constructe by going through two processes, namely the marking process an the pruning process. In the marking process, a noe will mark itself true if it Receive September 15, 2006; accepte February 6, Communicate by Ten H. Lai, Chung-Ta King an Jehn-Ruey Jiang. 1073
2 1074 JOHN SUM, JIE WU AND KEVIN HO has two unconnecte neighbors. Otherwise, it will mark itself false. Once the marking process has finishe, each true noe will check if its local conition fulfills the conitions specifie by a pruning rule-k. With respect to the pruning rule-k, a marke noe unmarks itself if there exists a set of connecte noes whose coverage can cover all its neighbors an, at the same time, the ID of the marke noe is smaller than the IDs of the connecte noes. If the connecte noes are restricte to irect neighbors of the marke noe, the pruning rule is calle restricte rule-k. 1 Otherwise, it is calle unrestricte rule. Although the Wu & Li ecentralize algorithm is simple an efficient in terms of computational complexity, little theoretical work has been one concerning the size of the CDS being generate. Only Dai & Wu in [2] an Hansen et al. in [5] have provie analytical stuies on this issue. Let N be the total number of noes an N, Dai & Wu showe that the size of a pruning rule k CDS is of constant-times-larger than the minimal CDS. Hansen et al. consiere the situation that the size of the square (say L 2 N ) grows linearly with N. The expecte size of a CDS erive by the restricte pruning 2 rule-k is in an orer linear to L N an lower boune by L 2 N / π. As observe from the simulate results presente in [2], this lower boun oes not fit the cases when the noe ensity is low. In this regar, an in-epth investigation about the expecte size of a CDS generate by restricte pruning rule-k is inevitable. In particular, we woul like to investigate how the size changes with the noe ensity, an when it reaches the lower boun as erive in [5]. To o so, we nee to erive the expecte size of a CDS in terms of the noe egree istribution, an the probability that a true noe will turn out to be marke false uring the pruning process. We call the latter probability the unmarke probability. Here, noe egree is efine as the total number of neighbors a noe has. Unfortunately, we will state later in the text that this unmarke probability cannot be obtaine analytically. The ranom sampling technique is neee to etermine these values numerically. Therefore, the contributions of this paper are as follows. 1. For a network of N noes that are uniformly an ranomly generate in a square of size L N L N, the noe egree istribution follows a Poisson istribution when L N, N. 2. A proceure base on the iea of ranom sampling is propose an the unmarke probabilities against ifferent noe egrees are obtaine. 3. It is foun that the expecte size of a CDS is almost a ecreasing function with respect to the noe ensity. The size of the CDS reaches its lower boun when the noe ensity is greater than or equal to The lower boun on the expecte size of a CDS for a Poissonian network of noe ensity ˆn is given by { 1 nˆ exp( ( nˆ 1))} N. nˆ 1 nˆ 1 The thir result is of paramount importance for practitioners. It provies the information about the expecte size of a CDS when the noe ensity ˆn is between 6 an 30. The expecte CDS size for this range can harly be provie by simulations. The rest of the paper is organize in four sections. In the next section, the algorithm of the marking process an the restricte pruning rule will be presente. The noe egree istribution of a network of ranomly eploye noes will be analyze an presente in 1 In this paper, the terms restricte rule-k an restricte pruning rule-k are use interchangeably.
3 LOCAL PRUNING METHOD FOR CDS 1075 section 3. An empirical proceure to obtain the unmarke probability an the analysis on the expecte size will be eluciate in the same section. Finally, the conclusion is presente in section RESTRICTED PRUNING RULE-k Consier a mobile a hoc network of N noes that are ranomly an uniformly eploye within a two-imensional square of area L L. Because of the transmission power of a raio signal, two noes can communicate with each other if their istance apart is less than an allowable transmission range, say r (r << L). In other wors, two noes are neighbors if the istance between them is less than r. Once a noe has been eploye, (i) it generates a uniformly ranom ID for itself an broacasts to other noes nearby (if any) about its ID. Then, (ii) it waits an listens to the signals from nearby noes about their IDs an the IDs of their neighbors. In accorance with the receive list of IDs, the noe can check whether its ID is unique. If the ID alreay exists, the noe will generate another ranom ID an then repeat steps (i) an (ii). (iii) As long as the IDs have been receive, it upates the list of the IDs of its neighbors an broacasts this neighbor information to its neighbors. The listen-upate-broacast cycle is then repeate a few more times until there are no more upates on the neighbor list. The resultant network graph is enote by V. When a complete list of neighbor information has been obtaine, each noe carries out the following algorithm to etermine whether it is a gateway noe for message routing. Let i(x) an N(x) be the ID an the set of neighbor noes of a noe locate at x. The marker of x is enote by M(x). Wu-Li Marking Process [13]: A noe locate at x sets its marker to True, i.e. M(x) = T, if there exists two unconnecte neighbor noes. Dai-Wu Restricte Pruning Rule k [2]: A marke noe unmarks itself if its neighbor noes can be covere by a set of connecte neighbor noes whose IDs are larger than noe x. That is to say, M(x) = F, if there exists x 1, x 2,, x k N(x) such that (i) M(x) = T. (ii) i(x) < i(x i ) for all j = 1, 2,, k. (iii) N(x) N(x 1 ) N(x 2 ) N(x k ). (iv) x 1, x 2,, x k form a connecte graph. To realize step (ii) in practice, each marke noe first sorts the IDs of its neighbors in ascening orer. Then, all noes with IDs larger than i(x) will be selecte. The selecte neighbor noes are further checke with respect to their coverage (step (iii)) an connectivity (step (iv)). Finally, M(x) changes to F if the selecte noes form a connecte graph an can cover all the neighbors of x. The beauty of this pruning rule is that the algorithm is completely istribute. Only irect neighbor information is neee. No global information is require. Each noe can perform the pruning locally. Plus, the computational complexity is small. For a noe of
4 1076 JOHN SUM, JIE WU AND KEVIN HO egree, its complexity is in an orer of O( 2 ) 2. Consier a graph of finite-mean-noe egree (say μ) an variance (say σ 2 ). It can be shown by the Chebyshev Inequality that 1 P( μ mσ). m2 In other wors, for a finite m, pruning (1 m -2 ) noes has a complexity of just O(m 2 σ 2 ). The cost pai for conucting the marking an pruning process is low. 3. ANALYSIS Assume a network of N noes, i.e. V = N. Let P() be the noe egree istribution of V. P(M(x) = F eg(x) = ) is the probability that a noe of egree is unmarke after the pruning step. During the marking process, a noe will be marke if there are two neighbor noes of x that are not neighbors to each other. As noes are eploye uniformly an ranomly, the probability that a noe of egree will be marke in the marking process will be given by P(Noe x is marke eg(x) = ) = 1 β (-1)/2, (1) where β is the probability that the istance of any two ranom noes within a unit circle is less than or equal to the raius. By conucting a computer simulation that generates 10,000 points uniformly an ranomly in a circle of raius r, an then counts the percentage of pairs of noes whose separation is less than r, it fins that β is equal to Then P(Noe x is marke eg(x) = ) = for = 5. Fig. 1 shows the probability that a noe of egree is not marke uring the marking process. Clearly, one can assume that this probability vanishes when > Fig. 1. The probability that a noe of egree is not marke uring the marking process, i.e. β (-1)/2 versus. 2 Theorem 4 in [2].
5 LOCAL PRUNING METHOD FOR CDS 1077 Suppose a network graph is of Poisson noe egree istribution with large mean noe egree. The percentage of noes of small noe egree will be very small. One can thus assume that all noes are marke after the initial marking process has been performe. The expecte size of the CDS can be given by E Vcs = N(1 P(M(x) = F eg(x) = )P(eg(x) = )). (2) x As P(eg(x) = ) is homogenous for all x V, the expecte size can simply be expresse as follows: E Vcs = N(1 P(M() = F )P()), (3) where the factor P(M() = F ) correspons with to the probability that a noe of egree is unmarke. 3.1 Noe Degree Distribution P() Suppose the noes are ranomly an uniformly istribute, an let ˆn be the average number of noes within a unit isk. The average noe egree λ will thus be nˆ 1. The noe egree istribution of V follows a Poisson istribution. Theorem 1 For a mobile a hoc network V, in which the mobile noes are ranomly an uniformly istribute, the noe egree istribution P() is given by λ P ( ) = exp( λ), λ = nˆ 1, (4)! where ˆn is the average noe ensity. Proof: Let N be the total number of noes of V, an the area of eployment is much larger than a unit isk. The number of noes eploye within a unit isk will then follow a binomial istribution, N! P{Exactly n noes in a unit isk} (1 ) n!( N n)! δ δ = where Area of unit isk δ =. Deployment Area For large N, ˆn = Nδ an n ( N n) nˆ P{Exactly n noes in a unit isk} = exp( nˆ ). n! Therefore, the probability of a noe having noe egree (i.e., the number of neighbor noes) is given by a Poisson istribution with average noe egree λ = nˆ 1. n
6 1078 JOHN SUM, JIE WU AND KEVIN HO λ = 19 λ = Fig. 2. The noe egree istributions of V for which the noe ensities are 20 (λ = 19) an 10 (λ = 9) respectively. The y-axis correspons to value of P(), while the x-axis correspons to the noe egree. For illustration, Fig. 2 shows two examples in which ˆn equals 20 an 10 respectively. 3.2 Unmarke Probability P(M() = F ) that Recall that a marke noe x unmarks itself if there exists x 1, x 2,, x k N(x) such (i) M(x) = T. (ii) i(x) < i(x j ) for all j = 1, 2,, k. (iii) N(x) N(x 1 ) N(x 2 ) N(x k ). (iv) x 1, x 2,, x k form a connecte graph. Consier the conition (i). As we have assume that all the noes are marke, P(M(x) = T) = 1, x V. Consier the conition (ii). For a noe of egree, it might have 1 neighbor noe, 2 neighbor noes, 3 neighbor noes an so on, up to neighbor noes that have IDs larger than itself. Since all noe IDs are uniformly an ranomly generate in a constant range, say [0, 1], the probability that i(x) < i(y) for all y N(x) is given by 1 1 P(i(x) < i(y) y N(x)) = (1 uu ) =. 0 2 As a result, the probability that exactly k (k ) neighbor noes that have larger IDs is given by 1 P(Exactly k out of neighbors having larger IDs) =, k 2 for all k = 0, 1, 2,,. (5)
7 LOCAL PRUNING METHOD FOR CDS 1079 The final question left behin is this: If there are k neighbor noes with larger IDs, will these noes form a connecte graph, an simultaneously will the rest of the other k noes be neighbors of these noes? Unfortunately, it is not an easy question to answer. It all epens on the locations of these neighbor noes. Take a look at the illustrative examples shown in Fig. 3. In both cases, k = 6. Even though both sets of neighbor noes can cover the whole circle, one is connecte (Fig. 3 (a) an the other is isconnecte (Fig. 3 (b)). r r r r x x x x (a) (b) (c) () Fig. 3. (a) an (b) show two illustrative examples in which the neighbor noes of x can cover the whole circle. (a) Six neighbor noes are locate evenly on the circumference of the circle. They form a connecte graph. (b) Three neighbor noes are locate evenly on the circumference an three other noes are locate at the lower half of the circle. The graph being inuce from these neighbor noes is a isconnecte graph. (c) an () show two illustrative examples in which the neighbor noes of x cannot cover the whole circle. Again, one forms a connecte graph (c) an the other oes not (). Let Ω(x) be the unit circle centere at location x. Let X = (x 1, x 2,, x k ) Ω(x) k be an augmente ranom vector, in which x 1, x 2,, x k Ω(x). The graph inuce by X is enote by G X. Furthermore, we let I(X) be an inicator function efine as follows: 1 if GX is connecte, I( X) = (6) 0 if G is not connecte. X The coverage of X is enote by Cov(X), where k Area covere by j= 1 ( Ω( xj) Ω( x)) Cov( X ) =. Area covere by Ω( x) (7) Therefore, the probability that ( k) ranom noes in Ω(x) can be covere by the other k ranom noes in Ω(x) will be given by Pk (, ) I ( XCovX k = ) ( ) X. (8) k X Ω( x) The probability that a noe of egree will be unmarke will thus be given by 1 P(M() = F ) = Pk (, ) k = 1 k (9) 2
8 1080 JOHN SUM, JIE WU AND KEVIN HO an the expecte size of CDS is given by exp( λ)( λ/ 2) E Vcs = N 1 P( k, ). k= 1 k!( k)! (10) Unfortunately, there is no simple close-form solution for the probability P(k, ), Eq. (8). We obtaine the values empirically by a ranom sampling proceure, as epicte in Fig. 4. The iea of the proceure can be sketche as follows. In the first step, we generate Z ranom noes, x 1, x 2,, x Z, within a unit isk centere at the origin (step 1). In the secon step, for each value of noe egree, say k, we generate another k ranom noes, y 1, y 2,, y k, within the same unit isk (step 2.1.1). Then, we count the fractional number of x i s being covere by the y 1, y 2,, y k an store the value in the array OL (steps an 2.1.3). Next, the connectivity of the graph inuce by y 1, y 2,, y k is checke (step 2.1.4). Finally the fractional number counte in the step will be store in an array PC if the graph is connecte. Otherwise, the store value will be set to zero. The secon step is repeate M times. In our simulation, Z is set to 10,000. The value of k ranges from 1 to 25, an M is set to 10,000. So, before the simulation, we initialize three 2D arrays (OL, CN an PC) of imension 25 10,000. Their kjth elements, where k = 1, 2,, 25 an j = 1, 2,, 10,000, correspon to the intermeiate results obtaine in the jth simulation for noe egree k. Step 0: Initialize OL, CN, PC R 25 10,000. Step 1: Let Ω 0 be the unit isk centere at (0, 0) an then uniformly ranomly generate x 1, x 2,, x 10,000 insie Ω 0. Step 2: For k = 1, 2,, 25, 2.1 For j = 1, 2,, 10, Uniformly ranomly generate y 1, y 2,, y k insie Ω 0, k Ω κ = Set NI equals the number of x i s that are locate insie ( y ) Ω κ Set OL kj equals NI/10, Set CN kj equals 1 if y 1,, y k form a connecte graph Set PC kj equals OL kj CN kj. Fig. 4. Ranom sampling proceure for obtaining the probability P(k, ), Eq. (8). Since the kjth element in the array PC is the value I(X)Cov(X) of the jth set of ranom k noes, the value P(k, ) can then be obtaine empirically by M 1 k Pk (, ) = PCkj (11) M j= 1 for all k. The unmarke probability of a noe of egree can be obtaine. Fig. 5 shows the unmarke probability P(M() = F ) against noe egree. It is clear that the minimum unmarke probability is attaine when equals 5, where the minimum unmarke probability is equal to (This is ue to the fact that there is a small chance for a 5-noe inuce graph to form a connecte inuce graph.)
9 LOCAL PRUNING METHOD FOR CDS Unmarke Probability Noe Degree () Fig. 5. Unmarke probability. The unmarke probability reaches when = 25. It can be further note from the figure that the value of P(M() = F ) increases as increases, an then approaches 1 when is large. 3.3 Expecte Size of CDS In accorance with the formulae erive earlier for the average number of marke noes (Eq. (3)) an the theorem about the nature of noe egree istribution (Theorem 1), the expecte size of a CDS-erive restricte pruning rule can be expresse as follows: E Vcs λ = 1 exp( λ) P( ( ) = F ), N M! (12) where λ correspons to the average noe egree. Then, the expecte size of a CDS erive is evaluate by putting the values of P(M() = F ) as shown in Fig. 5 an ifferent values of λ into the Eq. (12). Fig. 6 shows the expecte size of CDS against λ. (For convenience, we simply let P(M() = F ) = for > 25.) The soli line with squares correspons to the lower boun (λ + 1) -1, while the soli line with circles correspons to our results. The soli line with squares correspons to the lower boun (λ + 1) -1. (Please refer to Appenix A for the erivation of this lower boun.) It is observe that the size is about 0.55% of the original network size when λ = 6. The factor matches the result obtaine in [2] for the same λ an N = 200. (Please refer to Appenix B for the reason why the comparison is only mae for λ = 6, not for other values of λ in their paper.) In accorance with Fig. 6, one can also see that the size of a CDS rops as the λ increases. Eventually, it rops to its lower boun when λ is close to A Tighter Lower Boun A tighter lower boun for Poissonian P() can inee be erive from the Eq. (12). Consier a marke noe of egree. One conition that a marke noe will be staying marke, after the pruning process, is when its ID is larger than all its neighbors. This probability is given by ( + 1) -1 for a marke noe with neighbors. Hence,
10 1082 JOHN SUM, JIE WU AND KEVIN HO Expecte Size Mean Noe Degree (λ) Fig. 6. Expecte size of a CDS erive by restricte pruning rule. The soli line with squares correspons to the lower boun (λ + 1) -1, while the soli line with circles correspons to our results Hansen et al Our lower boun λ Fig. 7. Comaprison between Hansen et al. an our lower bouns. The y-axis correspons to the value E[ V cs ]/N, while the x-axis correspons to noe ensity of V. E Vcs λ exp( λ). N 1 ( + 1)! Since λ exp( λ) 1 λ =, ( + 1)! λ 1 λ + 1 E Vcs exp( λ ) N. λ λ 1 In terms of noe ensity n ˆ, 1 nˆ E Vcs exp( nˆ + 1) N. nˆ 1 nˆ 1 (13) It is equal to N /( n ˆ 1) when ˆn is large an this boun is tighter than N / n ˆ for all
11 LOCAL PRUNING METHOD FOR CDS 1083 ˆn 4 (i.e. λ 3). Fig. 7 compares the ifference between the Hansen et al. lower boun an our lower boun. It is clear that there is no significant ifference when λ is large. 4. CONCLUSION In this paper, we have provie an analysis on the size of a CDS erive by the restricte pruning rule-k algorithm. For a network of N noes that are uniformly an ranomly generate in a square of size L N L N, we have shown that the noe egree istribution follows a Poisson istribution when L N, N. To argue that the noe egree istribution of the network oes not change much after the marking process has been performe; we have iscusse the probability of a noe being marke in the marking process an shown that such a probability tens to vanish when the noe ensity is high. After that, we have erive an equation to evaluate the expecte size of a CDS, in terms of the network noe egree istribution an the unmarke probabilities. As there is no close-form solution for the connecte probability an the coverage of a graph inuce by ranom noes within a circle, a computer simulate proceure base on the iea of ranom sampling has been evelope to obtain such probabilities. The probability that a noe of egree will be unmarke is obtaine an hence the expecte size of a CDS can be obtaine. Finally, the expecte size of a CDS erive by the restricte pruning rule-k is analyze with respect to ifferent noe ensities. It is foun that the size is almost a ecreasing function with respect to the noe ensity. The size reaches its lower boun when the noe ensity is equal to or greater than 30. That is to say, the CDS erive by the restricte pruning rule-k algorithm in a high noe ensity situation is a minimal CDS. The results are consistent with the existing results previously obtaine in [2] an [5]. More important, our results have fille in the gap, 6 λ 30, that has not been investigate before. By applying a similar technique, analysis on other istribute methos, such as the extene works presente in [10, 14, 15], for constructing CDS might also be possible. REFERENCES 1. B. N. Clark, C. J. Colbourn, an D. S. Johnson, Unit isk graphs, Discrete Mathematics, Vol. 86, 1990, pp F. Dai an J. Wu, An extene localize algorithm for connecte ominating set formation in a hoc wireless networks, IEEE Transactions on Parallel an Distribute Systems, Vol. 15, 2004, pp B. Das, R. Sivakumar, an V. Bhargavan, Routing in a hoc networks using a spine, in Proceeings of the 6th IEEE International Conference on Computers Communication an Networks, 1997, pp S. Guha an S. Khuller, Approximation algorithms for connecte ominating sets, Algorithmica, Vol. 20, 1998, pp F. Hansen, E. Schmutz, an L. Sheng, The expecte size of the rule k ominating set, Algorithmica, Vol. 46, 2006, pp F. Ingelrest, D. Simplot-Ryl, an I. Stojmenovic, A ominating sets an target raius base localize activity scheuling an minimum energy broacast protocol for
12 1084 JOHN SUM, JIE WU AND KEVIN HO a hoc an sensor networks, in Proceeings of the Meiterranean A Hoc Networking Workshop, 2004, pp C. R. Lin an M. Gerla, Aaptive clustering for mobile wireless networks, IEEE Journal on Selecte Areas in Communication, Vol. 15, 1996, pp H. Liu, Y. Pan, an J. Cao, An improve istribute algorithm for connecte ominating sets in wireless a hoc networks, in Proceeings of the International Symposium on Parallel an Distribute Processing an Applications, 2004, pp P. J. Wan, K. Alzoubi, an O. Frieer, Distribute construction of connecte ominating set in wireless a hoc networks, in Proceeings of IEEE INFOCOM, Vol. 3, 2002, pp J. Wu, Extene ominating-set-base routing in a hoc wireless networks with uniirectional links, IEEE Transactions on Parallel & Distribute Systems, Vol. 13, 2002, pp J. Wu an F. Dai, Mobility control an its applications in mobile a hoc networks, IEEE Network, Vol. 18, 2004, pp J. Wu an F. Dai, Efficient broacasting with guarantee coverage in mobile a hoc networks, IEEE Transactions on Mobile Computing, Vol. 4, 2005, pp J. Wu an H. Li, On calculating connecte ominating set for efficient routing in ahoc wireless networks, in Proceeings of the 3r International Workshop on Discrete Algorithms an Methos for Mobile Computing an Communication, 1999, pp J. Wu, W. Lou, an F. Dai, Extene multipoint relays to etermine connecte ominating sets in MANETs, IEEE Transactions on Computers, Vol. 55, 2006, pp J. Wu, B. Wu, an I. Stojmenovic, Power-aware broacasting an activity scheuling in a hoc wireless networks using connecte ominating sets, Wireless Communications an Mobile Computing, Vol. 4, 2003, pp APPENDIX A. Hansen et al. LOWER BOUND [5] Instea of running extensive computer simulations, Hansen et al. have presente a theoretical analysis on the size of a CDS erive by the restricte pruning rule in [5]. In one of their theorems (Theorem 5 in [5]), they show that the size of a CDS is lowerboune by l 2 N / π for ln. Here l N is the length of the square where the mobile noes are eploye. For an a hoc network consisting of N noes, l 2 N / π is equal to the total number of noes over the noe ensity. As noe ensity is equal to the average noe egree plus 1 (i.e. ˆn = λ + 1), the lower boun of the expecte size of a CDS erive by the restricte pruning rule epens on the average noe egree of the Poissonian noe egree istribution: E V cs N. λ + 1 (14)
13 LOCAL PRUNING METHOD FOR CDS 1085 B. Dai &Wu RESULT [2] In our analysis, we assume the network is of Poisson noe egree istribution. For a network of N noes eploye in a square of size L L, an each noe has transmission range r, the Poisson noe egree istribution happens when r << L an r = λ + 1 L π N. This conition is equivalent to λ << N for when L is finite. Therefore, the noe egree istribution is close to a Poisson istribution only when λ is small. The simulate results in [2] for the expecte size of a CDS at λ = 6 is consistent the results obtaine in this paper. On the contrary, the noe egree istribution of a large λ network coul harly follow a Poisson istribution. A comparison between their results an the results presente here coul not be mae. John Sum ( ) receive the B.Eng. in Electronic Engineering from Hong Kong Polytechnic University in Then, he receive his M.Phil. an Ph.D. in Computer Science an Engineering from Chinese University of Hong Kong in 1995 an 1998 respectively. Before joining the Chung Shan Meical University (Taiwan), John was teaching in several universities in Hong Kong, incluing the Hong Kong Baptist University, the Open University of Hong Kong an the Hong Kong Polytechnic University. Currently, he is an assistant professor of the Department of Information Management in the Chung Shan Meical University, Taichung, R.O.C. His current research interests inclue neural computation, mobile sensor networks an scale-free network. John Sum is a senior member of IEEE an an associate eitor of the International Journal of Computers an Applications. Jie Wu ( ) is a Distinguishe Professor at the Department of Computer Science an Engineering, Floria Atlantic University. He has publishe over 350 papers in various journals an conference proceeings. His research interests are in the areas of wireless networks an mobile computing, routing protocols, fault-tolerant computing, an interconnection networks. Dr. Wu was on the eitorial boar of IEEE Transactions on Parallel an Distribute Systems an was a co-guest-eitor of IEEE Computer an Journal of Parallel an Distribute Computing. He serve as the program co-chair for MASS 2004, program vice-chair for ICDCS 2001, an program vice-chair for ICPP He was also general co-chair for MASS 2006 an is general vice-chair for IPDPS He is the author of the text Distribute System Design publishe by the CRC press. He was also the recipient of the an Researcher of the Year Awar at Floria Atlantic University. Dr. Wu has serve as an IEEE Computer Society Distinguishe Visitor an is the Chairman of IEEE Technical Committee on Distribute Processing (TCDP). He is a Member of ACM an a Senior Member of IEEE.
14 1086 JOHN SUM, JIE WU AND KEVIN HO Kevin I-J Ho ( ) receive the B.S. in Computer Engineering from National Chiao Tung University (Taiwan) in From 1985 to 1987, he was an assistant engineer of Institute of Information Inustry, Taiwan. Then, he receive his M.S. an Ph.D. in Computer Science from University of Texas at Dallas in 1990 an 1992, respectively. Currently, he is an associate professor of Department of Computer Science an Communication Engineering, Provience University, Taiwan. His current research interests inclue image processing, algorithm esign an analysis, scheuling theory, an computer networks.
Thermal conductivity of graded composites: Numerical simulations and an effective medium approximation
JOURNAL OF MATERIALS SCIENCE 34 (999)5497 5503 Thermal conuctivity of grae composites: Numerical simulations an an effective meium approximation P. M. HUI Department of Physics, The Chinese University
More informationComputing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions
Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5
More informationSurvey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013
Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing
More informationLeaving Randomness to Nature: d-dimensional Product Codes through the lens of Generalized-LDPC codes
Leaving Ranomness to Nature: -Dimensional Prouct Coes through the lens of Generalize-LDPC coes Tavor Baharav, Kannan Ramchanran Dept. of Electrical Engineering an Computer Sciences, U.C. Berkeley {tavorb,
More informationMath 342 Partial Differential Equations «Viktor Grigoryan
Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite
More informationPower Generation and Distribution via Distributed Coordination Control
Power Generation an Distribution via Distribute Coorination Control Byeong-Yeon Kim, Kwang-Kyo Oh, an Hyo-Sung Ahn arxiv:407.4870v [math.oc] 8 Jul 204 Abstract This paper presents power coorination, power
More informationTime-of-Arrival Estimation in Non-Line-Of-Sight Environments
2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor
More informationPhysics 2212 K Quiz #2 Solutions Summer 2016
Physics 1 K Quiz # Solutions Summer 016 I. (18 points) A positron has the same mass as an electron, but has opposite charge. Consier a positron an an electron at rest, separate by a istance = 1.0 nm. What
More informationOn the Connectivity Analysis over Large-Scale Hybrid Wireless Networks
This full text paper was peer reviewe at the irection of IEEE Communications Society subject matter experts for publication in the IEEE INFOCOM proceeings This paper was presente as part of the main Technical
More informationLecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012
CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration
More informationELECTRON DIFFRACTION
ELECTRON DIFFRACTION Electrons : wave or quanta? Measurement of wavelength an momentum of electrons. Introuction Electrons isplay both wave an particle properties. What is the relationship between the
More informationLower bounds on Locality Sensitive Hashing
Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,
More informationOne-dimensional I test and direction vector I test with array references by induction variable
Int. J. High Performance Computing an Networking, Vol. 3, No. 4, 2005 219 One-imensional I test an irection vector I test with array references by inuction variable Minyi Guo School of Computer Science
More informationLeast-Squares Regression on Sparse Spaces
Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction
More informationSYNCHRONOUS SEQUENTIAL CIRCUITS
CHAPTER SYNCHRONOUS SEUENTIAL CIRCUITS Registers an counters, two very common synchronous sequential circuits, are introuce in this chapter. Register is a igital circuit for storing information. Contents
More informationChapter 4. Electrostatics of Macroscopic Media
Chapter 4. Electrostatics of Macroscopic Meia 4.1 Multipole Expansion Approximate potentials at large istances 3 x' x' (x') x x' x x Fig 4.1 We consier the potential in the far-fiel region (see Fig. 4.1
More informationLower Bounds for the Smoothed Number of Pareto optimal Solutions
Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.
More informationA Sketch of Menshikov s Theorem
A Sketch of Menshikov s Theorem Thomas Bao March 14, 2010 Abstract Let Λ be an infinite, locally finite oriente multi-graph with C Λ finite an strongly connecte, an let p
More informationarxiv: v2 [cond-mat.stat-mech] 11 Nov 2016
Noname manuscript No. (will be inserte by the eitor) Scaling properties of the number of ranom sequential asorption iterations neee to generate saturate ranom packing arxiv:607.06668v2 [con-mat.stat-mech]
More informationG j dq i + G j. q i. = a jt. and
Lagrange Multipliers Wenesay, 8 September 011 Sometimes it is convenient to use reunant coorinates, an to effect the variation of the action consistent with the constraints via the metho of Lagrange unetermine
More informationarxiv: v4 [math.pr] 27 Jul 2016
The Asymptotic Distribution of the Determinant of a Ranom Correlation Matrix arxiv:309768v4 mathpr] 7 Jul 06 AM Hanea a, & GF Nane b a Centre of xcellence for Biosecurity Risk Analysis, University of Melbourne,
More informationand from it produce the action integral whose variation we set to zero:
Lagrange Multipliers Monay, 6 September 01 Sometimes it is convenient to use reunant coorinates, an to effect the variation of the action consistent with the constraints via the metho of Lagrange unetermine
More informationOn the Broadcast Capacity of Multihop Wireless Networks: Interplay of Power, Density and Interference
On the Broacast Capacity of Multihop Wireless Networks: Interplay of Power, Density an Interference Alireza Keshavarz-Haa Ruolf Riei Department of Electrical an Computer Engineering an Department of Statistics
More informationSection 2.7 Derivatives of powers of functions
Section 2.7 Derivatives of powers of functions (3/19/08) Overview: In this section we iscuss the Chain Rule formula for the erivatives of composite functions that are forme by taking powers of other functions.
More informationQubit channels that achieve capacity with two states
Qubit channels that achieve capacity with two states Dominic W. Berry Department of Physics, The University of Queenslan, Brisbane, Queenslan 4072, Australia Receive 22 December 2004; publishe 22 March
More informationJUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson
JUST THE MATHS UNIT NUMBER 10.2 DIFFERENTIATION 2 (Rates of change) by A.J.Hobson 10.2.1 Introuction 10.2.2 Average rates of change 10.2.3 Instantaneous rates of change 10.2.4 Derivatives 10.2.5 Exercises
More informationRamsey numbers of some bipartite graphs versus complete graphs
Ramsey numbers of some bipartite graphs versus complete graphs Tao Jiang, Michael Salerno Miami University, Oxfor, OH 45056, USA Abstract. The Ramsey number r(h, K n ) is the smallest positive integer
More informationThe effect of dissipation on solutions of the complex KdV equation
Mathematics an Computers in Simulation 69 (25) 589 599 The effect of issipation on solutions of the complex KV equation Jiahong Wu a,, Juan-Ming Yuan a,b a Department of Mathematics, Oklahoma State University,
More informationRole of parameters in the stochastic dynamics of a stick-slip oscillator
Proceeing Series of the Brazilian Society of Applie an Computational Mathematics, v. 6, n. 1, 218. Trabalho apresentao no XXXVII CNMAC, S.J. os Campos - SP, 217. Proceeing Series of the Brazilian Society
More informationThe total derivative. Chapter Lagrangian and Eulerian approaches
Chapter 5 The total erivative 51 Lagrangian an Eulerian approaches The representation of a flui through scalar or vector fiels means that each physical quantity uner consieration is escribe as a function
More informationAgmon Kolmogorov Inequalities on l 2 (Z d )
Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,
More informationPhysics 505 Electricity and Magnetism Fall 2003 Prof. G. Raithel. Problem Set 3. 2 (x x ) 2 + (y y ) 2 + (z + z ) 2
Physics 505 Electricity an Magnetism Fall 003 Prof. G. Raithel Problem Set 3 Problem.7 5 Points a): Green s function: Using cartesian coorinates x = (x, y, z), it is G(x, x ) = 1 (x x ) + (y y ) + (z z
More informationx f(x) x f(x) approaching 1 approaching 0.5 approaching 1 approaching 0.
Engineering Mathematics 2 26 February 2014 Limits of functions Consier the function 1 f() = 1. The omain of this function is R + \ {1}. The function is not efine at 1. What happens when is close to 1?
More informationLecture 5. Symmetric Shearer s Lemma
Stanfor University Spring 208 Math 233: Non-constructive methos in combinatorics Instructor: Jan Vonrák Lecture ate: January 23, 208 Original scribe: Erik Bates Lecture 5 Symmetric Shearer s Lemma Here
More informationThe derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x)
Y. D. Chong (2016) MH2801: Complex Methos for the Sciences 1. Derivatives The erivative of a function f(x) is another function, efine in terms of a limiting expression: f (x) f (x) lim x δx 0 f(x + δx)
More informationAn Analytical Expression of the Probability of Error for Relaying with Decode-and-forward
An Analytical Expression of the Probability of Error for Relaying with Decoe-an-forwar Alexanre Graell i Amat an Ingmar Lan Department of Electronics, Institut TELECOM-TELECOM Bretagne, Brest, France Email:
More informationLinear First-Order Equations
5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)
More informationApproximate Constraint Satisfaction Requires Large LP Relaxations
Approximate Constraint Satisfaction Requires Large LP Relaxations oah Fleming April 19, 2018 Linear programming is a very powerful tool for attacking optimization problems. Techniques such as the ellipsoi
More informationEquilibrium in Queues Under Unknown Service Times and Service Value
University of Pennsylvania ScholarlyCommons Finance Papers Wharton Faculty Research 1-2014 Equilibrium in Queues Uner Unknown Service Times an Service Value Laurens Debo Senthil K. Veeraraghavan University
More informationQuantum Mechanics in Three Dimensions
Physics 342 Lecture 20 Quantum Mechanics in Three Dimensions Lecture 20 Physics 342 Quantum Mechanics I Monay, March 24th, 2008 We begin our spherical solutions with the simplest possible case zero potential.
More informationA note on asymptotic formulae for one-dimensional network flow problems Carlos F. Daganzo and Karen R. Smilowitz
A note on asymptotic formulae for one-imensional network flow problems Carlos F. Daganzo an Karen R. Smilowitz (to appear in Annals of Operations Research) Abstract This note evelops asymptotic formulae
More informationPerfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs
Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs Ashish Goel Michael Kapralov Sanjeev Khanna Abstract We consier the well-stuie problem of fining a perfect matching in -regular bipartite
More informationCalculus and optimization
Calculus an optimization These notes essentially correspon to mathematical appenix 2 in the text. 1 Functions of a single variable Now that we have e ne functions we turn our attention to calculus. A function
More informationinflow outflow Part I. Regular tasks for MAE598/494 Task 1
MAE 494/598, Fall 2016 Project #1 (Regular tasks = 20 points) Har copy of report is ue at the start of class on the ue ate. The rules on collaboration will be release separately. Please always follow the
More information12.11 Laplace s Equation in Cylindrical and
SEC. 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential 593 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential One of the most important PDEs in physics an engineering
More informationDiagonalization of Matrices Dr. E. Jacobs
Diagonalization of Matrices Dr. E. Jacobs One of the very interesting lessons in this course is how certain algebraic techniques can be use to solve ifferential equations. The purpose of these notes is
More informationd dx But have you ever seen a derivation of these results? We ll prove the first result below. cos h 1
Lecture 5 Some ifferentiation rules Trigonometric functions (Relevant section from Stewart, Seventh Eition: Section 3.3) You all know that sin = cos cos = sin. () But have you ever seen a erivation of
More informationDelay Limited Capacity of Ad hoc Networks: Asymptotically Optimal Transmission and Relaying Strategy
Delay Limite Capacity of A hoc Networks: Asymptotically Optimal Transmission an Relaying Strategy Eugene Perevalov Lehigh University Bethlehem, PA 85 Email: eup2@lehigh.eu Rick Blum Lehigh University Bethlehem,
More informationensembles When working with density operators, we can use this connection to define a generalized Bloch vector: v x Tr x, v y Tr y
Ph195a lecture notes, 1/3/01 Density operators for spin- 1 ensembles So far in our iscussion of spin- 1 systems, we have restricte our attention to the case of pure states an Hamiltonian evolution. Toay
More informationNode Density and Delay in Large-Scale Wireless Networks with Unreliable Links
Noe Density an Delay in Large-Scale Wireless Networks with Unreliable Links Shizhen Zhao, Xinbing Wang Department of Electronic Engineering Shanghai Jiao Tong University, China Email: {shizhenzhao,xwang}@sjtu.eu.cn
More informationA PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networks
A PAC-Bayesian Approach to Spectrally-Normalize Margin Bouns for Neural Networks Behnam Neyshabur, Srinah Bhojanapalli, Davi McAllester, Nathan Srebro Toyota Technological Institute at Chicago {bneyshabur,
More informationTutorial on Maximum Likelyhood Estimation: Parametric Density Estimation
Tutorial on Maximum Likelyhoo Estimation: Parametric Density Estimation Suhir B Kylasa 03/13/2014 1 Motivation Suppose one wishes to etermine just how biase an unfair coin is. Call the probability of tossing
More informationSensors & Transducers 2015 by IFSA Publishing, S. L.
Sensors & Transucers, Vol. 184, Issue 1, January 15, pp. 53-59 Sensors & Transucers 15 by IFSA Publishing, S. L. http://www.sensorsportal.com Non-invasive an Locally Resolve Measurement of Soun Velocity
More informationThe Exact Form and General Integrating Factors
7 The Exact Form an General Integrating Factors In the previous chapters, we ve seen how separable an linear ifferential equations can be solve using methos for converting them to forms that can be easily
More informationFinal Exam Study Guide and Practice Problems Solutions
Final Exam Stuy Guie an Practice Problems Solutions Note: These problems are just some of the types of problems that might appear on the exam. However, to fully prepare for the exam, in aition to making
More information6. Friction and viscosity in gasses
IR2 6. Friction an viscosity in gasses 6.1 Introuction Similar to fluis, also for laminar flowing gases Newtons s friction law hols true (see experiment IR1). Using Newton s law the viscosity of air uner
More informationProbabilistic Analysis of Power Assignments
Probabilistic Analysis of Power Assignments Maurits e Graaf 1,2 an Boo Manthey 1 1 University of Twente, Department of Applie Mathematics, Enschee, Netherlans m.egraaf/b.manthey@utwente.nl 2 Thales Neerlan
More informationOn Characterizing the Delay-Performance of Wireless Scheduling Algorithms
On Characterizing the Delay-Performance of Wireless Scheuling Algorithms Xiaojun Lin Center for Wireless Systems an Applications School of Electrical an Computer Engineering, Purue University West Lafayette,
More informationu!i = a T u = 0. Then S satisfies
Deterministic Conitions for Subspace Ientifiability from Incomplete Sampling Daniel L Pimentel-Alarcón, Nigel Boston, Robert D Nowak University of Wisconsin-Maison Abstract Consier an r-imensional subspace
More informationA Randomized Approximate Nearest Neighbors Algorithm - a short version
We present a ranomize algorithm for the approximate nearest neighbor problem in - imensional Eucliean space. Given N points {x } in R, the algorithm attempts to fin k nearest neighbors for each of x, where
More informationx f(x) x f(x) approaching 1 approaching 0.5 approaching 1 approaching 0.
Engineering Mathematics 2 26 February 2014 Limits of functions Consier the function 1 f() = 1. The omain of this function is R + \ {1}. The function is not efine at 1. What happens when is close to 1?
More informationEntanglement is not very useful for estimating multiple phases
PHYSICAL REVIEW A 70, 032310 (2004) Entanglement is not very useful for estimating multiple phases Manuel A. Ballester* Department of Mathematics, University of Utrecht, Box 80010, 3508 TA Utrecht, The
More informationLecture XII. where Φ is called the potential function. Let us introduce spherical coordinates defined through the relations
Lecture XII Abstract We introuce the Laplace equation in spherical coorinates an apply the metho of separation of variables to solve it. This will generate three linear orinary secon orer ifferential equations:
More informationA Course in Machine Learning
A Course in Machine Learning Hal Daumé III 12 EFFICIENT LEARNING So far, our focus has been on moels of learning an basic algorithms for those moels. We have not place much emphasis on how to learn quickly.
More informationSolutions to Math 41 Second Exam November 4, 2010
Solutions to Math 41 Secon Exam November 4, 2010 1. (13 points) Differentiate, using the metho of your choice. (a) p(t) = ln(sec t + tan t) + log 2 (2 + t) (4 points) Using the rule for the erivative of
More informationAssignment 1. g i (x 1,..., x n ) dx i = 0. i=1
Assignment 1 Golstein 1.4 The equations of motion for the rolling isk are special cases of general linear ifferential equations of constraint of the form g i (x 1,..., x n x i = 0. i=1 A constraint conition
More informationImproved Rate-Based Pull and Push Strategies in Large Distributed Networks
Improve Rate-Base Pull an Push Strategies in Large Distribute Networks Wouter Minnebo an Benny Van Hout Department of Mathematics an Computer Science University of Antwerp - imins Mielheimlaan, B-00 Antwerp,
More informationTMA 4195 Matematisk modellering Exam Tuesday December 16, :00 13:00 Problems and solution with additional comments
Problem F U L W D g m 3 2 s 2 0 0 0 0 2 kg 0 0 0 0 0 0 Table : Dimension matrix TMA 495 Matematisk moellering Exam Tuesay December 6, 2008 09:00 3:00 Problems an solution with aitional comments The necessary
More informationUNIT 4:Capacitors and Dielectric
UNIT 4:apacitors an Dielectric SF7 4. apacitor A capacitor is a evice that is capable of storing electric charges or electric potential energy. It is consist of two conucting plates separate by a small
More informationEstimation of the Maximum Domination Value in Multi-Dimensional Data Sets
Proceeings of the 4th East-European Conference on Avances in Databases an Information Systems ADBIS) 200 Estimation of the Maximum Domination Value in Multi-Dimensional Data Sets Eleftherios Tiakas, Apostolos.
More informationApproaches for Predicting Collection Efficiency of Fibrous Filters
Volume 5, Issue, Summer006 Approaches for Preicting Collection Efficiency of Fibrous Filters Q. Wang, B. Maze, H. Vahei Tafreshi, an B. Poureyhimi Nonwovens Cooperative esearch Center, North Carolina State
More informationPermanent vs. Determinant
Permanent vs. Determinant Frank Ban Introuction A major problem in theoretical computer science is the Permanent vs. Determinant problem. It asks: given an n by n matrix of ineterminates A = (a i,j ) an
More informationTopic 7: Convergence of Random Variables
Topic 7: Convergence of Ranom Variables Course 003, 2016 Page 0 The Inference Problem So far, our starting point has been a given probability space (S, F, P). We now look at how to generate information
More informationA Modification of the Jarque-Bera Test. for Normality
Int. J. Contemp. Math. Sciences, Vol. 8, 01, no. 17, 84-85 HIKARI Lt, www.m-hikari.com http://x.oi.org/10.1988/ijcms.01.9106 A Moification of the Jarque-Bera Test for Normality Moawa El-Fallah Ab El-Salam
More informationThe Complexity of Grid Coverage by Swarm Robotics
The Complexity of Gri Coverage by Swarm Robotics Yaniv Altshuler, an Alfre M. Brucstein Computer Science Department, Technion, Haifa, Israel {yanival, frey}@cs.technion.ac.il Deutsche Teleom Labs, Ben
More informationPARALLEL-PLATE CAPACITATOR
Physics Department Electric an Magnetism Laboratory PARALLEL-PLATE CAPACITATOR 1. Goal. The goal of this practice is the stuy of the electric fiel an electric potential insie a parallelplate capacitor.
More informationCAPACITANCE: CHAPTER 24. ELECTROSTATIC ENERGY and CAPACITANCE. Capacitance and capacitors Storage of electrical energy. + Example: A charged spherical
CAPACITANCE: CHAPTER 24 ELECTROSTATIC ENERGY an CAPACITANCE Capacitance an capacitors Storage of electrical energy Energy ensity of an electric fiel Combinations of capacitors In parallel In series Dielectrics
More informationNumber of wireless sensors needed to detect a wildfire
Number of wireless sensors neee to etect a wilfire Pablo I. Fierens Instituto Tecnológico e Buenos Aires (ITBA) Physics an Mathematics Department Av. Maero 399, Buenos Aires, (C1106ACD) Argentina pfierens@itba.eu.ar
More informationNew Statistical Test for Quality Control in High Dimension Data Set
International Journal of Applie Engineering Research ISSN 973-456 Volume, Number 6 (7) pp. 64-649 New Statistical Test for Quality Control in High Dimension Data Set Shamshuritawati Sharif, Suzilah Ismail
More informationarxiv: v1 [cs.it] 21 Aug 2017
Performance Gains of Optimal Antenna Deployment for Massive MIMO ystems Erem Koyuncu Department of Electrical an Computer Engineering, University of Illinois at Chicago arxiv:708.06400v [cs.it] 2 Aug 207
More informationState estimation for predictive maintenance using Kalman filter
Reliability Engineering an System Safety 66 (1999) 29 39 www.elsevier.com/locate/ress State estimation for preictive maintenance using Kalman filter S.K. Yang, T.S. Liu* Department of Mechanical Engineering,
More informationPrep 1. Oregon State University PH 213 Spring Term Suggested finish date: Monday, April 9
Oregon State University PH 213 Spring Term 2018 Prep 1 Suggeste finish ate: Monay, April 9 The formats (type, length, scope) of these Prep problems have been purposely create to closely parallel those
More informationII. First variation of functionals
II. First variation of functionals The erivative of a function being zero is a necessary conition for the etremum of that function in orinary calculus. Let us now tackle the question of the equivalent
More information'HVLJQ &RQVLGHUDWLRQ LQ 0DWHULDO 6HOHFWLRQ 'HVLJQ 6HQVLWLYLW\,1752'8&7,21
Large amping in a structural material may be either esirable or unesirable, epening on the engineering application at han. For example, amping is a esirable property to the esigner concerne with limiting
More informationWhy Bernstein Polynomials Are Better: Fuzzy-Inspired Justification
Why Bernstein Polynomials Are Better: Fuzzy-Inspire Justification Jaime Nava 1, Olga Kosheleva 2, an Vlaik Kreinovich 3 1,3 Department of Computer Science 2 Department of Teacher Eucation University of
More informationGeneralizing Kronecker Graphs in order to Model Searchable Networks
Generalizing Kronecker Graphs in orer to Moel Searchable Networks Elizabeth Boine, Babak Hassibi, Aam Wierman California Institute of Technology Pasaena, CA 925 Email: {eaboine, hassibi, aamw}@caltecheu
More informationWIRELESS sensor networks (WSN) typically consist of. Key Pre-Distributions From Graph-Based Block Designs. arxiv: v1 [cs.
1 Key Pre-Distributions From Graph-Base Block Designs Jie Ding, Abelmaji Bouaballah, an Vahi Tarokh arxiv:1506.07466v1 [cs.ni] 4 Jun 015 Abstract With the evelopment of wireless communication technologies
More informationClosed and Open Loop Optimal Control of Buffer and Energy of a Wireless Device
Close an Open Loop Optimal Control of Buffer an Energy of a Wireless Device V. S. Borkar School of Technology an Computer Science TIFR, umbai, Inia. borkar@tifr.res.in A. A. Kherani B. J. Prabhu INRIA
More informationVectors in two dimensions
Vectors in two imensions Until now, we have been working in one imension only The main reason for this is to become familiar with the main physical ieas like Newton s secon law, without the aitional complication
More informationA NONLINEAR SOURCE SEPARATION APPROACH FOR THE NICOLSKY-EISENMAN MODEL
6th European Signal Processing Conference EUSIPCO 28, Lausanne, Switzerlan, August 25-29, 28, copyright by EURASIP A NONLINEAR SOURCE SEPARATION APPROACH FOR THE NICOLSKY-EISENMAN MODEL Leonaro Tomazeli
More information26.1 Metropolis method
CS880: Approximations Algorithms Scribe: Dave Anrzejewski Lecturer: Shuchi Chawla Topic: Metropolis metho, volume estimation Date: 4/26/07 The previous lecture iscusse they some of the key concepts of
More information1. The electron volt is a measure of (A) charge (B) energy (C) impulse (D) momentum (E) velocity
AP Physics Multiple Choice Practice Electrostatics 1. The electron volt is a measure of (A) charge (B) energy (C) impulse (D) momentum (E) velocity. A soli conucting sphere is given a positive charge Q.
More information23 Implicit differentiation
23 Implicit ifferentiation 23.1 Statement The equation y = x 2 + 3x + 1 expresses a relationship between the quantities x an y. If a value of x is given, then a corresponing value of y is etermine. For
More informationResearch Article When Inflation Causes No Increase in Claim Amounts
Probability an Statistics Volume 2009, Article ID 943926, 10 pages oi:10.1155/2009/943926 Research Article When Inflation Causes No Increase in Claim Amounts Vytaras Brazauskas, 1 Bruce L. Jones, 2 an
More informationA. Exclusive KL View of the MLE
A. Exclusive KL View of the MLE Lets assume a change-of-variable moel p Z z on the ranom variable Z R m, such as the one use in Dinh et al. 2017: z 0 p 0 z 0 an z = ψz 0, where ψ is an invertible function
More informationOn colour-blind distinguishing colour pallets in regular graphs
J Comb Optim (2014 28:348 357 DOI 10.1007/s10878-012-9556-x On colour-blin istinguishing colour pallets in regular graphs Jakub Przybyło Publishe online: 25 October 2012 The Author(s 2012. This article
More informationApplications of the Wronskian to ordinary linear differential equations
Physics 116C Fall 2011 Applications of the Wronskian to orinary linear ifferential equations Consier a of n continuous functions y i (x) [i = 1,2,3,...,n], each of which is ifferentiable at least n times.
More informationEVALUATION OF LIQUEFACTION RESISTANCE AND LIQUEFACTION INDUCED SETTLEMENT FOR RECLAIMED SOIL
386 EVALUATION OF LIQUEFACTION RESISTANCE AND LIQUEFACTION INDUCED SETTLEMENT FOR RECLAIMED SOIL Lien-Kwei CHIEN 1, Yan-Nam OH 2 An Chih-Hsin CHANG 3 SUMMARY In this stuy, the fille material in Yun-Lin
More informationV q.. REASONING The potential V created by a point charge q at a spot that is located at a
8. REASONING The electric potential at a istance r from a point charge q is given by Equation 9.6 as kq / r. The total electric potential at location P ue to the four point charges is the algebraic sum
More informationProbabilistic Analysis of Power Assignments
Probabilistic Analysis of Power Assignments Maurits e Graaf 1,2 an Boo Manthey 1 1 University of Twente, Department of Applie Mathematics, Enschee, Netherlans m.egraaf/b.manthey@utwente.nl 2 Thales Neerlan
More information