Trackless online algorithms for the server problem
|
|
- Marian Hamilton
- 8 years ago
- Views:
Transcription
1 Iformatio Processig Letters 74 (2000) Trackless olie algorithms for the server problem Wolfgag W. Bei,LawreceL.Larmore 1 Departmet of Computer Sciece, Uiversity of Nevada, Las Vegas, NV 89154, USA Received 22 Jue 1999; received i revised form 1 November 1999 Commuicated by S.E. Hambrusch Abstract A class of simple olie algorithms for the k-server problem is idetified. This class, for which the term trackless is itroduced, icludes may kow server algorithms. The k-server cojecture fails for trackless algorithms. A lower boud of 23/11 o the competitiveess of ay determiistic trackless 2-server algorithm ad a lower boud of 1 + 2/2 othe competitiveess of ay radomized trackless 2-server problem are give Published by Elsevier Sciece B.V. All rights reserved. Keywords: Desig of algorithms; Olie algorithms; Radomized algorithms; Competitive aalysis; k-server problem; Pagig 1. Itroductio Irai ad Rubifeld [10] give a simple algorithm for the 2-server problem i a arbitrary metric space, which is betwee 6- ad 10-competitive. This algorithm is remarkable i at least two ways. First, it uses oly costat memory ad, for each request, serves the request i costat time. Secodly, the algorithm ca be oblivious to the actual metric space, as log as the distaces from the servers to the request poit are kow. I effect, the algorithm i its implemetatio ever requires a data type poit. By cotrast, the work fuctio algorithm (WFA) [7], which is kow to be 2-competitive for the 2-server problem (ad (2k 1)-competitive for the k-server problem [11]) may eed to retai iformatio about all previously requested poits. Correspodig author. bei@cs.ulv.edu. Research supported by NSF grat CCR larmore@cs.ulv.edu. Research supported by NSF grat CCR Borodi ad El-Yaiv [2] posed as a ope questio to show a lower boud greater tha 2 o the competitive ratio of ay determiistic 2-server algorithm that uses costat time ad space per request. They also metio that for such a lower boud the model of computatio eeded to be formalized. Such a model is difficult to formalize because ulimited iformatio ca be hidde eve i a sigle real umber. I this paper we itroduce the cocept of a trackless olie algorithm. Tracklessess is a property of a olie algorithm for the server problem which is a restrictio o what iput data the algorithm uses i its computatio, ad o what outputs the algorithm gives. Specifically, for each request poit, the algorithm is oly give as iput the distaces of the curret server positios to the request poit. A trackless algorithm may memorize such distace values, but is restricted from storig explicitly ay poits of the metric space. I the algorithm s respose to a request, the algorithm is limited to producig output that idetifies which server moves, ad does ot metio poits i the metric space explicitly. May kow /00/$ see frot matter 2000 Published by Elsevier Sciece B.V. All rights reserved. PII: S (00)00034-X
2 74 W.W. Bei, L.L. Larmore / Iformatio Processig Letters 74 (2000) algorithms are trackless. These iclude BALANCE2, BALANCE_SLACK, RANDOM_SLACK ad HAR- MONIC, whereas, for example, WFA is ot trackless. The cocept of tracklessess ca be geeralized to other olie problems. For example, there is a obvious extesio to the pagig problem. It would be desirable to settle the k-server cojecture by fidig a k-competitive algorithm for the k- server problem, ad it would be desirable if that algorithm were simple, i the sese that it uses few iputs as well as little time ad space. The results i this paper give a idicatio that this may ot be possible. We suspect that if there is a k- competitive olie algorithm for the k-server problem, it caot be simple. I particular, we show that, if oly trackless algorithms are cosidered, the k-server cojecture fails. (I fact, it fails for k = 2.) This is true despite the fact that the trackless model does ot require memoryless computatio. Our mai result is a lower boud of o the competiveess of ay determiistic trackless olie algorithm for the 2-server problem. For radomized trackless olie algorithms for the 2-server problem agaist a oblivious adversary, we show a lower boud of 1 + 2/ o the competitiveess. This is higher tha the best kow lower boud for the same problem without the tracklessess restrictio. 2. The trackless k-server problem I the k-server problem we are give k 2 mobile servers 1,...,k that reside i a metric space M. A sequece of requests ϱ = r 1...r is issued, where each request is specified by a poit r t M. To satisfy this request, oe of the servers must be moved to r t, t = 1,...,, at a cost equal to the distace from its curret locatio to r t. A algorithm A for the k-server problem decides which server should be moved at each step t. A is said to be olie if its decisios are made without the kowledge of future requests. Our goal is to miimize the total service cost. A is C-competitive ifthecosticurredbya to service each request sequece ϱ is at most C times the optimal (offlie) service cost for ϱ, plus possibly a additive costat idepedet of ϱ. (See Chapter 1 of [2] for a comprehesive discussio of competitiveess.) The competitive ratio of A is the smallest C for which A is C-competitive. Assume ow that the servers are iitially located at poits s1 0,...,s0 k M. Letst i M deote the locatio of server i at time t, meaig after the request r t has bee serviced. Note that si t 1 r t is the distace betwee the locatio of s i ad the request r t at the time that request is made, ad before ay server has moved. We say that a poit p M is active at step t if there is either a server or a request at p at the time of the tth request. That is, p is active at step t if ad oly if p {r t,s1 t 1,...,sk t 1 }. We defie a A to be a trackless algorithm for the k-server problem if: (1) A ca oly move a server to a active poit. That is, every output of A at step t is of the form Move s i to r or Moves i to s j. (2) A receives at step t as iputs oly {si t 1 r t } for 1 i k. We assume that A iitially kows the distaces amog all servers. We do ot restrict the computatioal power of a trackless algorithm, ad we allow A to store iputs from previous steps ad use them i its calculatios. 2 However, all trackless algorithms curretly i the literature use oly O(k) time at each step to make their calculatios. We ow review some of these. Irai Rubifeld Algorithm. The Irai Rubifeld Algorithm, also kow as BALANCE2 [10], is a determiistic trackless algorithm for the k-server problem i a arbitrary metric space. It uses O(k) memory ad O(k) time at each step. For k = 2, the competitiveess of BALANCE2 is at most 10, but a 6 poit couter-example shows that the competitiveess caot be less tha 6 for geeral spaces [4]. BALANCE_SLACK. BALANCE_SLACK is a determiistic trackless algorithm for the 2-server problem i a arbitrary metric space [4]. It uses O(1) memory ad O(1) time at each step. It is 4-competitive for a arbitrary metric space. RANDOM_SLACK. RANDOM_SLACK is a radomized trackless algorithm for the 2-server problem 2 Note therefore, that at step t, A may kow the distaces amog all servers before ad after each request.
3 W.W. Bei, L.L. Larmore / Iformatio Processig Letters 74 (2000) i a arbitrary metric space [4]. It is memoryless ad uses O(1) time at each step. It is 2-competitive for a arbitrary metric space. HARMONIC. HARMONIC is a radomized trackless algorithm for the k-server problem i a arbitrary metric space. It uses O(k) time at each step, ad is memoryless. Its competitiveess is cojectured to be ( k+1) 2, see [13]. For k = 2, its competitiveess is kow to be 3, see [6]. LRU. Least Recetly Used ad other markig algorithms are trackless k-competitive algorithms for the pagig problem with cache size k, which is equivalet to the k-server problem i a uiform space [3,14]. They use O(k) memory. (See [2] for a survey.) MARK. MARK is a trackless radomized algorithm for the pagig problem with cache size k [9]. It uses O(k) memory ad is (2H k 1)-competitive [1], where H k is the kth Harmoic umber. 3. The determiistic lower boud I this sectio, we prove that o trackless algorithm for the 2-server problem which works for all metric spaces ca be less tha competitive. First we state, without proof, three easy techical lemmas. We say that A s servers match the servers of a optimal offlie algorithm (referred to as the optimal servers, for short) if they are at the same poits. Without loss of geerality, every trackless olie algorithm is lazy, as follows from Lemma 3 below. Lemma 3. Give ay trackless olie algorithm for the k-server problem, there is a lazy trackless olie algorithm for the k-server problem which does ot have greater cost. We are ow ready to state the lower boud result. Theorem 1. There is o determiistic trackless olie algorithm for the 2-server problem which is C- competitive for ay C< Proof. Let M be the set of vertices of the tiles of a tilig of the plae ito cogruet equilateral triagles (see Fig. 1). We thik of M as a ifiite graph, where the edges are the edges of the triagles. Distace is defied to be the legth (umber of edges) of the shortest path betwee two poits. Now, let A be ay trackless algorithm for the 2- server problem i M. We assume that the two servers begi at poits which are distace 1 apart i M. We show that there exists a request sequece, α, im such that, after A services α, its two servers are agai distace 1 apart, ad the total cost of movig the servers is positive ad is at least times the optimal cost. We call such a sequece a phase. To show that A caot be C-competitive for ay C< 23 11,wesimply request may phases. We ow describe the request sequece α.weleta,b be the locatios of the servers 1 ad 2, respectively, at Lemma 1. If the optimal servers are at two distict poits x ad y, there is a request sequece whose optimal cost is zero, ad which forces A to move its two servers to x ad y. Lemma 2. If the optimal servers match A s servers at distict poits x ad y,wherexy = d 1, ad if there is a poit z such that xz = yz = d 2, the there is a request sequece such that, if A serves this sequece, it pays d 1 + d 2, the optimal cost is d 2, ad at the ed of the service A s servers match the optimal servers, either at x,z or at y,z. We say that A is lazy if it moves at most oe server at each step, ad the oly to the curret request poit. Fig. 1. The metric space M.
4 76 W.W. Bei, L.L. Larmore / Iformatio Processig Letters 74 (2000) the begiig of a phase. Pick poits c,d,e,p,q M such that: (1) cd = de = 1, ad = ae = 4, ad ac = bc = bd = be = 3. (2) pq = 1, aq = 2, ad ap = bp = bq = 3. Because of the geometry of M such poits exist, see Fig. 1. There are six cases depedig o whe A moves server 2 for the first time: we assume that A serves c with 1. Case 1: A serves cd with 1, 2. I this case, defie α to be the cocateatio of four parts. The first part is cd. The secod part is a sequece give by Lemma 1 which forces the servers to a ad d, which are 4 apart. The third part is give by Lemma 2, ad forces the servers to poits which are 2 apart. The fourth part is give by Lemma 2 agai, ad forces the servers to poits which are 1 apart. The algorithm pays 6 to service cd, paysatleast 3 to servicethe secodpart, at least 6 to service the third part, ad at least 3 to service the fourth part. Thus, the algorithm pays at least 18 to service α. The optimal service serves cd with servers 2, 2, at a cost of 4. The cost of servicig the secod part is 0, as the optimal servers are already at a,d.the optimal cost to service the third part is 2 ad to service the fourth part is 1, by Lemma 2. Thus, the optimal cost of servicig α is 7. Case 2: A serves cde with 1, 1, 2. I this case, defie α to be cde, followed by a sequece, as give by Lemma 1, that forces the servers to a ad e, followed by two sequeces that force the servers to poits which are 1 apart, due to Lemma 2 as described i Case 1. The total cost for A for the phase is at least 20, while the optimal cost is 8. Case 3: A serves cded with 1, 1, 1, 2. I this case, defie α to be cded, followed by a sequece, as give by Lemma 1, that forces the servers to a ad d, followed by two sequeces that force the servers to poits which are 1 apart, as give by Lemma 2. The total cost for A for the phase is at least 21, while the optimal cost is 9. Case 4: A serves cdede with 1, 1, 1, 1, 2. I this case, defie α to be cdede, followed by a sequece, as give by Lemma 1, that forces the servers to a ad e, followed by two sequeces that force the servers to poits which are 1 apart, as give by Lemma 2. The total cost for A for the phase is at least 22, while the optimal cost is 10. Case 5: A serves cdeded with 1, 1, 1, 1, 1, 2. I this case, defie α to be cdeded, followed by a sequece, as give by Lemma 1, that forces the servers to a ad d, followed by two sequeces that force the servers to poits which are 1 apart, as give by Lemma 2. The total cost for A for the phase is at least 23, while the optimal cost is 11. Case 6: A serves cdeded with 1, 1, 1, 1, 1, 1. I this case, defie α to be pqpqpq, followed by a sequece, as give by Lemma 1, that forces the servers to p ad q, which are 1 apart. It is here that the trackless property of A plays a role. Sice A is trackless, it must respod to p the same way it would respod to c, amely by movig server 1, because the oly iput A uses is the pair of distaces (s 1 r, s 2 r),whichis(3, 3) whether r is c or p. Similarly, oce server 1 is at p, A must respod to the request at q i the same maer as it would to the request d if server 1 were at c, because i each case, the iput is the pair (1, 3). Extedig this argumet for the etire sequece, we see that A must serve α = pqpqpq i the same way as it would serve cdeded, amely with 1, 1, 1, 1, 1, 1. Thus, after six steps, server 1 is at q ad server 2 is at b. The total cost for A for the phase is at least 11, while the optimal cost is 5. Sice mi { 18 7, 20 8, 21 9, 22 10, 23 11, 11 5 we have cost A cost opt } = 23 11, for the phase. We retur to the situatio where if c is the first request, A serves that request with server 2. By the property of tracklessess, A must also serve with 2 if the first request is p. There is a symmetry of M which iterchages a ad b, ad which iterchages c ad p (see Fig. 1). Thus, by symmetry, a request sequece ca always be chose so that cost A cost opt for the phase. This completes the proof of the lower boud. Fially we ote that the metric space M ca be mapped oto a torus as i Fig. 2. A momet s thought shows that with such a mappig the couterexample ca be produced usig this fiite space of oly 64 poits.
5 W.W. Bei, L.L. Larmore / Iformatio Processig Letters 74 (2000) Fig. 2. A mappig of M oto a torus. 4. The radomized lower boud I this sectio, we show that o trackless radomized olie algorithm for the 2-server problem ca have competitiveess less tha / Let be a large iteger, ad let ε = 2 2/. Let M be a metric space cosistig of a poit a ad a ulimited umber of poits b 1,b 1,b 2,... where the distace from a to each b i is 1, ad the distace from b i to b j is ε for i j. We refer to the set b 1,b 2,b 3,... as the B-cluster. Let the iitial positios of the servers be a ad b 1. We defie a radomized oblivious adversary agaist which every determiistic algorithm is ot better tha (1+ 2/2)-competitive. By [15], this proves the lower boud. The adversary request sequece cosists of a sufficietly large umber of phases. At the begiig of each phase, the optimal servers are located at a ad at some b k, ad the algorithm s two servers are located at a ad b l for some l. We ow describe oe phase. Poits i the B-cluster will ot be re-used from phase to phase; b 1 will be cosidered to be used before the first phase, hece will ever be requested. Let m be the umber of poits i the B-cluster that have bee used up to the begiig of this phase. (Those poits will ecessarily be b 1...b m.) For each phase, idepedetly, the adversary chooses oe of two strategies, which we call buzz ad wader. With probability 2 1, the adversary chooses to buzz durig that phase, ad with probability 2 2 the adversary chooses to wader durig that phase. If the adversary chooses to buzz durig the curret phase, it requests (b m+1 b m+2 ) a. I this case, the adversary moves its servers to b m+1 ad b m+2 ad the at the ed of the phase moves oe server to a. The optimal cost for this phase is thus 2 + ε. With probability 2 2, the adversary chooses to wader durig the curret phase. I this case, the adversary radomly chooses a iteger i i the rage 1..., with equal probability for each i. The adversary the requests the sequece b m+1 b m+2 b m+3...b m+i a. The adversary serves by movig oe server aroud iside the B-cluster ad leavig the other server at a. Thus, the optimal cost for the phase is iε. I either case, the phase eds with the request a. The expected optimal cost for oe phase is E cost opt = + 1 ( ) ( ) 2 2 ε + (2 + ε) = 4 ( ) O. We ow compute the expected cost E cost A durig oe phase. For ay iteger t 0, let A t be the determiistic algorithm which serves the first t requests i the B-cluster with the same oe server that starts i the B-cluster, ad the, at step t + 1, if the request poit is i the B-cluster, moves its server from a. After that, A t uses its two servers to serve all further requests i the B-cluster, fially movig oe of them back to a whe a is requested at the ed of the phase. Let A be the stubbor algorithm, which serves all requests i the B-cluster with oe server, ever movig the server from a durig that phase. It is clear that ay lazy radomized algorithm A must behave as either A,or A t for some t, durig each phase. Lemma 4. Durig each phase, E cost A 2 ( ) 1 2 O. Proof. Case I: A = A. I this case, A expeds 2ε with probability 2 1, ad with probability 2 2, expeds εi where the average value of i is ( + 1)/2. Thus E cost A = + 1 ( ) ( ) 2 2 ε + 2ε > 2 2.
6 78 W.W. Bei, L.L. Larmore / Iformatio Processig Letters 74 (2000) Case II: A = A t for t<. If the adversary buzzes, the A expeds tε before it moves a over to the B-cluster, after which further service is free, other tha the fial move back to a. Itmustalsopay2to jump from a to the B-cluster ad back. If the adversary waders, the either i t,iwhich case A ever moves its server from a, but pays iε to move its server aroud iside the B-cluster, or i>t,i which case A pays tε to move its server aroud iside the B-cluster before it moves a server from a,butthe must pay (i t 1)ε more to move servers aroud iside the B cluster after that. It must also pay 2 to jump from a to the B-cluster ad back. Summig up the terms, we have E cost At = t i=1 + 1 ( ) 2 2 iε i=t+1 1 ( )( ) (i 1)ε + ( 2 1 ) (2 + tε) = 2 ( ) 1 2 ± O. Case III: A = A t for t. Ift 2, thea t behaves exactly as A, ad we are doe. Thus, we ca assume that t<2. If the adversary buzzes, A expeds tε + 2, while if the adversary waders, A expeds iε. Summig up the terms, we have E cost A = i=1 1 ( ) ( ) 2 2 iε (2 + tε) (t )ε 2 2. Theorem 2. There is o radomized trackless olie algorithm for the 2-server problem which is C-competitive for ay C<1+2 1/ agaist the oblivious adversary ± O ( 1 ad we are doe. 5. Fial commets ) = /2 ± O ( ) 1 Thetreealgorithmisak-competitive algorithm for the k-server problem i trees [5]. We ote that the tree algorithm, although ot explicitly trackless, ca be rewritte as a trackless algorithm. The trackless versio uses a virtual tree, which the algorithm builds from the trackless iput. The tree may differ from the actual tree, but it is a close eough approximatio to esure k-competitiveess. The costructio ad proof are somewhat tedious ad will be published elsewhere. The radomized competitiveess of the 2-server problem is ot kow. The best kow upper boud is 2, ad the best kow lower boud is 1 + e 1/ [8], while we ca show a lower boud of / for the competitiveess of ay radomized trackless algorithm for the 2-server problem i geeral metric spaces. This is a idicator, but ot a proof, that the radomized competitiveess ad the radomized trackless competitiveess of the k-server problem i geeral are differet. For uiform spaces, the determiistic competitiveess of the k-server problem is k, ad sice a uiform space ca be embedded i a tree, there is also a k- competitive trackless algorithm. But the situatio for radomized algorithms is differet. I particular, there is a 3 2 -competitive radomized olie algorithm for the 2-server problem i a uiform space ad this is kow to be optimal agaist a oblivious adversary [12]. Prelimiary calculatios idicate that there is o radomized trackless algorithm for that problem with competitiveess less tha Refereces Proof. Suppose that C< /2.Letϱ be the request sequece i M cosistig of the cocateatio of a large umber of idepedet radomly chose phases. The, by Lemma 4, for ay determiistic trackless olie algorithm A, the ratio cost A / cost opt coverges to [1] D. Achlioptas, M. Chrobak, J. Noga, Competitive aalysis of radomized pagig algorithms, i: Proc. 4th Europea Symp. o Algorithms, Lecture Notes i Comput. Sci., Vol. 1136, Spriger, Berli, 1996, pp [2] A. Borodi, R. El-Yaiv, Olie computatio ad competitive aalysis, Cambridge Uiversity Press, cup.org/titles/56/ html.
7 W.W. Bei, L.L. Larmore / Iformatio Processig Letters 74 (2000) [3] A. Borodi, S. Irai, P. Raghava, B. Schieber, Competitive pagig with locality of referece, J. Comput. Systems Sci. 50 (1995) [4] M. Chrobak, L.L. Larmore, O fast algorithms for two servers, J. Algorithms 12 (1991) [5] M. Chrobak, L.L. Larmore, A optimal olie algorithm for k servers o trees, SIAM J. Comput. 20 (1991) [6] M. Chrobak, L.L. Larmore, HARMONIC is three-competitive for two servers, Theoret. Comput. Sci. 98 (1992) [7] M. Chrobak, L.L. Larmore, The server problem ad olie games, i: DIMACS Series i Discrete Mathematics ad Theoretical Computer Sciece, Vol. 7, 1992, pp [8] M. Chrobak, L.L. Larmore, C. Lud, N. Reigold, A better lower boud o the competitive ratio of the radomized 2- server problem, Iform. Process. Lett. 63 (2) (1997) [9] A. Fiat, R. Karp, M. Luby, L.A. McGeoch, D. Sleator, N.E. Youg, Competitive pagig algorithms, J. Algorithms 12 (1991) [10] S. Irai, R. Rubifeld, A competitive 2-server algorithm, Iform. Process. Lett. 39 (1991) [11] E. Koutsoupias, C. Papadimitriou, O the k-server cojecture, J. ACM 42 (1995) [12] L. McGeoch, D. Sleator, A strogly competitive radomized pagig algorithm, J. Algorithms 6 (1991) [13] P. Raghava, M. Sir, Memory versus radomizatio i o-lie algorithms, IBM J. Res. Developmet 38 (1994) [14] D. Sleator, R.E. Tarja, Amortized efficiecy of list update ad pagig rules, Comm. ACM 28 (1985) [15] A.C.C. Yao, Probabilistic computatios: Towards a uified measure of complexity, i: Proc. 11th Symp. Theory of Computig, 1980.
5 Boolean Decision Trees (February 11)
5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected
More informationDepartment of Computer Science, University of Otago
Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly
More informationProperties of MLE: consistency, asymptotic normality. Fisher information.
Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout
More informationChapter 6: Variance, the law of large numbers and the Monte-Carlo method
Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value
More informationIn nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008
I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces
More informationAsymptotic Growth of Functions
CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll
More informationIncremental calculation of weighted mean and variance
Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically
More informationLecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem
Lecture 4: Cauchy sequeces, Bolzao-Weierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits
More informationPerfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing
SIAM REVIEW Vol. 44, No. 1, pp. 95 108 c 2002 Society for Idustrial ad Applied Mathematics Perfect Packig Theorems ad the Average-Case Behavior of Optimal ad Olie Bi Packig E. G. Coffma, Jr. C. Courcoubetis
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13
EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may
More informationA Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length
Joural o Satisfiability, Boolea Modelig ad Computatio 1 2005) 49-60 A Faster Clause-Shorteig Algorithm for SAT with No Restrictio o Clause Legth Evgey Datsi Alexader Wolpert Departmet of Computer Sciece
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More informationChapter 7 Methods of Finding Estimators
Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of
More informationSoving Recurrence Relations
Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree
More information0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5
Sectio 13 Kolmogorov-Smirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.
More informationCooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley
Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Cosider a legth- sequece x[ with a -poit DFT X[ where Represet the idices ad as +, +, Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Usig these
More informationModified Line Search Method for Global Optimization
Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o
More informationPROCEEDINGS OF THE YEREVAN STATE UNIVERSITY AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical ad Mathematical Scieces 2015, 1, p. 15 19 M a t h e m a t i c s AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM A. G. GULYAN Chair of Actuarial Mathematics
More informationIrreducible polynomials with consecutive zero coefficients
Irreducible polyomials with cosecutive zero coefficiets Theodoulos Garefalakis Departmet of Mathematics, Uiversity of Crete, 71409 Heraklio, Greece Abstract Let q be a prime power. We cosider the problem
More informationI. Chi-squared Distributions
1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.
More informationA Combined Continuous/Binary Genetic Algorithm for Microstrip Antenna Design
A Combied Cotiuous/Biary Geetic Algorithm for Microstrip Atea Desig Rady L. Haupt The Pesylvaia State Uiversity Applied Research Laboratory P. O. Box 30 State College, PA 16804-0030 haupt@ieee.org Abstract:
More informationFactors of sums of powers of binomial coefficients
ACTA ARITHMETICA LXXXVI.1 (1998) Factors of sums of powers of biomial coefficiets by Neil J. Cali (Clemso, S.C.) Dedicated to the memory of Paul Erdős 1. Itroductio. It is well ow that if ( ) a f,a = the
More informationInfinite Sequences and Series
CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...
More informationDesigning Incentives for Online Question and Answer Forums
Desigig Icetives for Olie Questio ad Aswer Forums Shaili Jai School of Egieerig ad Applied Scieces Harvard Uiversity Cambridge, MA 0238 USA shailij@eecs.harvard.edu Yilig Che School of Egieerig ad Applied
More informationStochastic Online Scheduling with Precedence Constraints
Stochastic Olie Schedulig with Precedece Costraits Nicole Megow Tark Vredeveld July 15, 2008 Abstract We cosider the preemptive ad o-preemptive problems of schedulig obs with precedece costraits o parallel
More informationMetrical Task Systems and the k-server Problem on HSTs
Metrical Task Systems ad the k-server Problem o HSTs Nikhil Basal 1, Niv Buchbider 2, ad Joseph Seffi) Naor 3, 1 IBM T. J. Watso Research Ceter, Yorktow Heights, NY 10598. 2 Microsoft Research, Cambridge,
More informationA probabilistic proof of a binomial identity
A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two
More informationSection 11.3: The Integral Test
Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult
More informationConvexity, Inequalities, and Norms
Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for
More information1 Computing the Standard Deviation of Sample Means
Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.
More informationAnnuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.
Auities Uder Radom Rates of Iterest II By Abraham Zas Techio I.I.T. Haifa ISRAEL ad Haifa Uiversity Haifa ISRAEL Departmet of Mathematics, Techio - Israel Istitute of Techology, 3000, Haifa, Israel I memory
More informationTaking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling
Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed Multi-Evet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria
More informationCS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations
CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad
More information1. MATHEMATICAL INDUCTION
1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1
More informationLecture 2: Karger s Min Cut Algorithm
priceto uiv. F 3 cos 5: Advaced Algorithm Desig Lecture : Karger s Mi Cut Algorithm Lecturer: Sajeev Arora Scribe:Sajeev Today s topic is simple but gorgeous: Karger s mi cut algorithm ad its extesio.
More informationProject Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments
Project Deliverables CS 361, Lecture 28 Jared Saia Uiversity of New Mexico Each Group should tur i oe group project cosistig of: About 6-12 pages of text (ca be loger with appedix) 6-12 figures (please
More informationwhere: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return
EVALUATING ALTERNATIVE CAPITAL INVESTMENT PROGRAMS By Ke D. Duft, Extesio Ecoomist I the March 98 issue of this publicatio we reviewed the procedure by which a capital ivestmet project was assessed. The
More informationUniversal coding for classes of sources
Coexios module: m46228 Uiversal codig for classes of sources Dever Greee This work is produced by The Coexios Project ad licesed uder the Creative Commos Attributio Licese We have discussed several parametric
More informationThe Power of Free Branching in a General Model of Backtracking and Dynamic Programming Algorithms
The Power of Free Brachig i a Geeral Model of Backtrackig ad Dyamic Programmig Algorithms SASHKA DAVIS IDA/Ceter for Computig Scieces Bowie, MD sashka.davis@gmail.com RUSSELL IMPAGLIAZZO Dept. of Computer
More informationSAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx
SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval
More informationConvention Paper 6764
Audio Egieerig Society Covetio Paper 6764 Preseted at the 10th Covetio 006 May 0 3 Paris, Frace This covetio paper has bee reproduced from the author's advace mauscript, without editig, correctios, or
More informationThe Stable Marriage Problem
The Stable Marriage Problem William Hut Lae Departmet of Computer Sciece ad Electrical Egieerig, West Virgiia Uiversity, Morgatow, WV William.Hut@mail.wvu.edu 1 Itroductio Imagie you are a matchmaker,
More informationTHE HEIGHT OF q-binary SEARCH TREES
THE HEIGHT OF q-binary SEARCH TREES MICHAEL DRMOTA AND HELMUT PRODINGER Abstract. q biary search trees are obtaied from words, equipped with the geometric distributio istead of permutatios. The average
More informationSequences and Series
CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their
More informationTHE ABRACADABRA PROBLEM
THE ABRACADABRA PROBLEM FRANCESCO CARAVENNA Abstract. We preset a detailed solutio of Exercise E0.6 i [Wil9]: i a radom sequece of letters, draw idepedetly ad uiformly from the Eglish alphabet, the expected
More informationApproximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find
1.8 Approximatig Area uder a curve with rectagles 1.6 To fid the area uder a curve we approximate the area usig rectagles ad the use limits to fid 1.4 the area. Example 1 Suppose we wat to estimate 1.
More informationBuilding Blocks Problem Related to Harmonic Series
TMME, vol3, o, p.76 Buildig Blocks Problem Related to Harmoic Series Yutaka Nishiyama Osaka Uiversity of Ecoomics, Japa Abstract: I this discussio I give a eplaatio of the divergece ad covergece of ifiite
More informationTrigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is
0_0605.qxd /5/05 0:45 AM Page 470 470 Chapter 6 Additioal Topics i Trigoometry 6.5 Trigoometric Form of a Complex Number What you should lear Plot complex umbers i the complex plae ad fid absolute values
More informationChapter 5 O A Cojecture Of Erdíos Proceedigs NCUR VIII è1994è, Vol II, pp 794í798 Jeærey F Gold Departmet of Mathematics, Departmet of Physics Uiversity of Utah Do H Tucker Departmet of Mathematics Uiversity
More informationThe Fundamental Capacity-Delay Tradeoff in Large Mobile Ad Hoc Networks
The Fudametal Capacity-Delay Tradeoff i Large Mobile Ad Hoc Networks Xiaoju Li ad Ness B. Shroff School of Electrical ad Computer Egieerig, Purdue Uiversity West Lafayette, IN 47907, U.S.A. {lix, shroff}@ec.purdue.edu
More informationFactoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett <garrett@math.umn.edu>
(March 16, 004) Factorig x 1: cyclotomic ad Aurifeuillia polyomials Paul Garrett Polyomials of the form x 1, x 3 1, x 4 1 have at least oe systematic factorizatio x 1 = (x 1)(x 1
More informationMARTINGALES AND A BASIC APPLICATION
MARTINGALES AND A BASIC APPLICATION TURNER SMITH Abstract. This paper will develop the measure-theoretic approach to probability i order to preset the defiitio of martigales. From there we will apply this
More informationTHE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n
We will cosider the liear regressio model i matrix form. For simple liear regressio, meaig oe predictor, the model is i = + x i + ε i for i =,,,, This model icludes the assumptio that the ε i s are a sample
More informationWeek 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable
Week 3 Coditioal probabilities, Bayes formula, WEEK 3 page 1 Expected value of a radom variable We recall our discussio of 5 card poker hads. Example 13 : a) What is the probability of evet A that a 5
More informationChair for Network Architectures and Services Institute of Informatics TU München Prof. Carle. Network Security. Chapter 2 Basics
Chair for Network Architectures ad Services Istitute of Iformatics TU Müche Prof. Carle Network Security Chapter 2 Basics 2.4 Radom Number Geeratio for Cryptographic Protocols Motivatio It is crucial to
More informationCHAPTER 3 DIGITAL CODING OF SIGNALS
CHAPTER 3 DIGITAL CODING OF SIGNALS Computers are ofte used to automate the recordig of measuremets. The trasducers ad sigal coditioig circuits produce a voltage sigal that is proportioal to a quatity
More informationLecture 4: Cheeger s Inequality
Spectral Graph Theory ad Applicatios WS 0/0 Lecture 4: Cheeger s Iequality Lecturer: Thomas Sauerwald & He Su Statemet of Cheeger s Iequality I this lecture we assume for simplicity that G is a d-regular
More informationCase Study. Normal and t Distributions. Density Plot. Normal Distributions
Case Study Normal ad t Distributios Bret Halo ad Bret Larget Departmet of Statistics Uiversity of Wiscosi Madiso October 11 13, 2011 Case Study Body temperature varies withi idividuals over time (it ca
More informationTradigms of Astundithi and Toyota
Tradig the radomess - Desigig a optimal tradig strategy uder a drifted radom walk price model Yuao Wu Math 20 Project Paper Professor Zachary Hamaker Abstract: I this paper the author iteds to explore
More informationLecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)
18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the Bru-Mikowski iequality for boxes. Today we ll go over the
More informationCapacity of Wireless Networks with Heterogeneous Traffic
Capacity of Wireless Networks with Heterogeeous Traffic Migyue Ji, Zheg Wag, Hamid R. Sadjadpour, J.J. Garcia-Lua-Aceves Departmet of Electrical Egieerig ad Computer Egieerig Uiversity of Califoria, Sata
More informationHow to read A Mutual Fund shareholder report
Ivestor BulletI How to read A Mutual Fud shareholder report The SEC s Office of Ivestor Educatio ad Advocacy is issuig this Ivestor Bulleti to educate idividual ivestors about mutual fud shareholder reports.
More informationConfidence Intervals for One Mean
Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a
More informationA Recursive Formula for Moments of a Binomial Distribution
A Recursive Formula for Momets of a Biomial Distributio Árpád Béyi beyi@mathumassedu, Uiversity of Massachusetts, Amherst, MA 01003 ad Saverio M Maago smmaago@psavymil Naval Postgraduate School, Moterey,
More informationTHE LEAST COMMON MULTIPLE OF A QUADRATIC SEQUENCE
THE LEAST COMMON MULTIPLE OF A QUADRATIC SEQUENCE JAVIER CILLERUELO Abstract. We obtai, for ay irreducible quadratic olyomial f(x = ax 2 + bx + c, the asymtotic estimate log l.c.m. {f(1,..., f(} log. Whe
More informationHypothesis testing. Null and alternative hypotheses
Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate
More information2-3 The Remainder and Factor Theorems
- The Remaider ad Factor Theorems Factor each polyomial completely usig the give factor ad log divisio 1 x + x x 60; x + So, x + x x 60 = (x + )(x x 15) Factorig the quadratic expressio yields x + x x
More informationWHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?
WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? JÖRG JAHNEL 1. My Motivatio Some Sort of a Itroductio Last term I tought Topological Groups at the Göttige Georg August Uiversity. This
More informationOverview of some probability distributions.
Lecture Overview of some probability distributios. I this lecture we will review several commo distributios that will be used ofte throughtout the class. Each distributio is usually described by its probability
More informationBENEFIT-COST ANALYSIS Financial and Economic Appraisal using Spreadsheets
BENEIT-CST ANALYSIS iacial ad Ecoomic Appraisal usig Spreadsheets Ch. 2: Ivestmet Appraisal - Priciples Harry Campbell & Richard Brow School of Ecoomics The Uiversity of Queeslad Review of basic cocepts
More informationLecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k.
18.409 A Algorithmist s Toolkit September 17, 009 Lecture 3 Lecturer: Joatha Keler Scribe: Adre Wibisoo 1 Outlie Today s lecture covers three mai parts: Courat-Fischer formula ad Rayleigh quotiets The
More informationYour organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:
Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network
More informationCS100: Introduction to Computer Science
Review: History of Computers CS100: Itroductio to Computer Sciece Maiframes Miicomputers Lecture 2: Data Storage -- Bits, their storage ad mai memory Persoal Computers & Workstatios Review: The Role of
More informationResearch Method (I) --Knowledge on Sampling (Simple Random Sampling)
Research Method (I) --Kowledge o Samplig (Simple Radom Samplig) 1. Itroductio to samplig 1.1 Defiitio of samplig Samplig ca be defied as selectig part of the elemets i a populatio. It results i the fact
More informationCS103X: Discrete Structures Homework 4 Solutions
CS103X: Discrete Structures Homewor 4 Solutios Due February 22, 2008 Exercise 1 10 poits. Silico Valley questios: a How may possible six-figure salaries i whole dollar amouts are there that cotai at least
More informationInteger Factorization Algorithms
Iteger Factorizatio Algorithms Coelly Bares Departmet of Physics, Orego State Uiversity December 7, 004 This documet has bee placed i the public domai. Cotets I. Itroductio 3 1. Termiology 3. Fudametal
More informationMeasures of Spread and Boxplots Discrete Math, Section 9.4
Measures of Spread ad Boxplots Discrete Math, Sectio 9.4 We start with a example: Example 1: Comparig Mea ad Media Compute the mea ad media of each data set: S 1 = {4, 6, 8, 10, 1, 14, 16} S = {4, 7, 9,
More informationPermutations, the Parity Theorem, and Determinants
1 Permutatios, the Parity Theorem, ad Determiats Joh A. Guber Departmet of Electrical ad Computer Egieerig Uiversity of Wiscosi Madiso Cotets 1 What is a Permutatio 1 2 Cycles 2 2.1 Traspositios 4 3 Orbits
More informationNon-life insurance mathematics. Nils F. Haavardsson, University of Oslo and DNB Skadeforsikring
No-life isurace mathematics Nils F. Haavardsso, Uiversity of Oslo ad DNB Skadeforsikrig Mai issues so far Why does isurace work? How is risk premium defied ad why is it importat? How ca claim frequecy
More information5: Introduction to Estimation
5: Itroductio to Estimatio Cotets Acroyms ad symbols... 1 Statistical iferece... Estimatig µ with cofidece... 3 Samplig distributio of the mea... 3 Cofidece Iterval for μ whe σ is kow before had... 4 Sample
More informationhp calculators HP 12C Statistics - average and standard deviation Average and standard deviation concepts HP12C average and standard deviation
HP 1C Statistics - average ad stadard deviatio Average ad stadard deviatio cocepts HP1C average ad stadard deviatio Practice calculatig averages ad stadard deviatios with oe or two variables HP 1C Statistics
More informationGOOD PRACTICE CHECKLIST FOR INTERPRETERS WORKING WITH DOMESTIC VIOLENCE SITUATIONS
GOOD PRACTICE CHECKLIST FOR INTERPRETERS WORKING WITH DOMESTIC VIOLENCE SITUATIONS I the sprig of 2008, Stadig Together agaist Domestic Violece carried out a piece of collaborative work o domestic violece
More informationCenter, Spread, and Shape in Inference: Claims, Caveats, and Insights
Ceter, Spread, ad Shape i Iferece: Claims, Caveats, ad Isights Dr. Nacy Pfeig (Uiversity of Pittsburgh) AMATYC November 2008 Prelimiary Activities 1. I would like to produce a iterval estimate for the
More information7.1 Finding Rational Solutions of Polynomial Equations
4 Locker LESSON 7. Fidig Ratioal Solutios of Polyomial Equatios Name Class Date 7. Fidig Ratioal Solutios of Polyomial Equatios Essetial Questio: How do you fid the ratioal roots of a polyomial equatio?
More informationNATIONAL SENIOR CERTIFICATE GRADE 12
NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 04 MARKS: 50 TIME: 3 hours This questio paper cosists of 8 pages ad iformatio sheet. Please tur over Mathematics/P DBE/04 NSC Grade Eemplar INSTRUCTIONS
More informationTheorems About Power Series
Physics 6A Witer 20 Theorems About Power Series Cosider a power series, f(x) = a x, () where the a are real coefficiets ad x is a real variable. There exists a real o-egative umber R, called the radius
More informationI. Why is there a time value to money (TVM)?
Itroductio to the Time Value of Moey Lecture Outlie I. Why is there the cocept of time value? II. Sigle cash flows over multiple periods III. Groups of cash flows IV. Warigs o doig time value calculatios
More informationElementary Theory of Russian Roulette
Elemetary Theory of Russia Roulette -iterestig patters of fractios- Satoshi Hashiba Daisuke Miematsu Ryohei Miyadera Itroductio. Today we are goig to study mathematical theory of Russia roulette. If some
More informationA Constant-Factor Approximation Algorithm for the Link Building Problem
A Costat-Factor Approximatio Algorithm for the Lik Buildig Problem Marti Olse 1, Aastasios Viglas 2, ad Ilia Zvedeiouk 2 1 Ceter for Iovatio ad Busiess Developmet, Istitute of Busiess ad Techology, Aarhus
More informationINVESTMENT PERFORMANCE COUNCIL (IPC) Guidance Statement on Calculation Methodology
Adoptio Date: 4 March 2004 Effective Date: 1 Jue 2004 Retroactive Applicatio: No Public Commet Period: Aug Nov 2002 INVESTMENT PERFORMANCE COUNCIL (IPC) Preface Guidace Statemet o Calculatio Methodology
More informationEntropy of bi-capacities
Etropy of bi-capacities Iva Kojadiovic LINA CNRS FRE 2729 Site école polytechique de l uiv. de Nates Rue Christia Pauc 44306 Nates, Frace iva.kojadiovic@uiv-ates.fr Jea-Luc Marichal Applied Mathematics
More informationSystems Design Project: Indoor Location of Wireless Devices
Systems Desig Project: Idoor Locatio of Wireless Devices Prepared By: Bria Murphy Seior Systems Sciece ad Egieerig Washigto Uiversity i St. Louis Phoe: (805) 698-5295 Email: bcm1@cec.wustl.edu Supervised
More informationFloating Codes for Joint Information Storage in Write Asymmetric Memories
Floatig Codes for Joit Iformatio Storage i Write Asymmetric Memories Axiao (Adrew Jiag Computer Sciece Departmet Texas A&M Uiversity College Statio, TX 77843-311 ajiag@cs.tamu.edu Vaske Bohossia Electrical
More informationAn Efficient Polynomial Approximation of the Normal Distribution Function & Its Inverse Function
A Efficiet Polyomial Approximatio of the Normal Distributio Fuctio & Its Iverse Fuctio Wisto A. Richards, 1 Robi Atoie, * 1 Asho Sahai, ad 3 M. Raghuadh Acharya 1 Departmet of Mathematics & Computer Sciece;
More informationOverview on S-Box Design Principles
Overview o S-Box Desig Priciples Debdeep Mukhopadhyay Assistat Professor Departmet of Computer Sciece ad Egieerig Idia Istitute of Techology Kharagpur INDIA -721302 What is a S-Box? S-Boxes are Boolea
More informationConfidence Intervals. CI for a population mean (σ is known and n > 30 or the variable is normally distributed in the.
Cofidece Itervals A cofidece iterval is a iterval whose purpose is to estimate a parameter (a umber that could, i theory, be calculated from the populatio, if measuremets were available for the whole populatio).
More informationCHAPTER 3 THE TIME VALUE OF MONEY
CHAPTER 3 THE TIME VALUE OF MONEY OVERVIEW A dollar i the had today is worth more tha a dollar to be received i the future because, if you had it ow, you could ivest that dollar ad ear iterest. Of all
More informationHypergeometric Distributions
7.4 Hypergeometric Distributios Whe choosig the startig lie-up for a game, a coach obviously has to choose a differet player for each positio. Similarly, whe a uio elects delegates for a covetio or you
More informationNotes on exponential generating functions and structures.
Notes o expoetial geeratig fuctios ad structures. 1. The cocept of a structure. Cosider the followig coutig problems: (1) to fid for each the umber of partitios of a -elemet set, (2) to fid for each the
More informationChapter 7 - Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas:
Chapter 7 - Samplig Distributios 1 Itroductio What is statistics? It cosist of three major areas: Data Collectio: samplig plas ad experimetal desigs Descriptive Statistics: umerical ad graphical summaries
More information