1 Inroducion A (1 + ") loss-resilien code encodes essages consising of sybols ino an encoding consising of c sybols, c > 1, such ha he essage sybols c
|
|
- Anastasia Ward
- 5 years ago
- Views:
Transcription
1 A Lower Bound for a Class of Grah Based Loss-Resilien Codes Johannes Bloer Bea Trachsler 1 May 5, 1998 Absrac. Recenly, Luby e al. consruced inforaion-heoreically alos oial loss-resilien codes. The consrucion is based on a sequence of biarie grahs. Using a robabilisic consrucion for he individual biarie grahs, hey obain loss-resilien codes ha have very ecien encoding and decoding algorihs. They lef oen he quesion wheher here are oher biarie grahs leading o codes wih even ore ecien encoding and decoding algorihs. In his aer we show ha if one follows he basic consrucion used by Luby e al., hen heir choice of biarie grahs leads o codes wih asyoically oial encoding and decoding algorihs. Auhors' addresses Johannes Bloer and Bea Trachsler Insiue for Theoreical Couer Science ETH Zenru CH-8092 Zurich Swizerland Technical Reor #298, Deareen Inforaik, ETH Zurich. Elecronically available fro f//f.inf.ehz.ch/ub/ublicaions/ech-reors/ 1 Work of boh auhors has been suored by Gran fro Schweizer Naionalfonds (SNF). 1
2 1 Inroducion A (1 + ") loss-resilien code encodes essages consising of sybols ino an encoding consising of c sybols, c > 1, such ha he essage sybols can be reconsruced fro any subse of (1 + ") sybols of he encoding. If " = 0 hen hese codes are usually called MDS codes (Maxiu Disance Searable). If he reconsrucion is guaraneed o be successful only wih high robabiliy, hen he code is called a robabilisic (1 + ") loss-resilien code. Here he robabiliy is wih resec o rando subses of (1 + ") sybols of he encoding. Loss-resilien codes have alicaions for exale in neworking. In realie alicaions, where reransission of los ackes is no feasible, hey can be used o roec agains he eecs of acke losses. For exale, any MPEG video layers canno deal wih disrued MPEG sreas. Even if hey can, video qualiy usually suers signicanly fro acke losses. In [2] Luby e al. inroduced a faily of robabilisic (1 + ") loss-resilien codes wih very ecien encoding and decoding algorihs. The codes are based on a sequence of biarie grahs. The individual biarie grahs are obained by a robabilisic consrucion using a very secial disribuion on biarie grahs. This lef oen he quesion, wheher choosing dieren biarie grahs can lead o codes wih ore ecien encoding and decoding algorihs. In his aer we show ha no aer how he individual biarie grahs are chosen, codes based on a sequence of biarie grahs as roosed in [2] lead o loss-resilien codes for which he encoding and decoding requires ie ( ln(1=")). To be ore recise, if we wan ha wih non-consan robabiliy a rando subse of (1 + ") sybols of he encoding allows o reconsruc he enire essage, hen he average degree of he biarie grahs has o be (ln(1=")). This lower bound on he average degree iediaely leads o he lower bounds for he encoding and decoding ies. The aer is organized as follows. In Secion 2 we review he codes of Luby e al. in ore deail. In Secions 3 and 4 we sae and rove our ain resuls. In Secion 5 we indicae how o rene he roofs of Secion 4 in order o obain lower bounds for he encoding and decoding ies ha alos ach he uer bounds given in [2]. 2 An Ecien Loss-Resilien Code In his secion we inroduce he coding schee by Luby e al. The goal is o give a shor overview of he consrucion. Proofs can be found in [2, 1]. For an inroducion o coding heory we refer o [3]. In he following we denoe essage sybols by bis alhough in racice one acually uses bi srings. I is sraighforward o generalize he consrucion of Luby e al. o bi srings. 2
3 The ain ar of he schee is a rando direced acyclic grah whose nodes are ariioned ino ses S i, 0 i `, such ha js i+1 j = js i j, where 0 < < 1. The nodes in S 0 corresond o he essage bis of he code. The nuber of essage bis is denoed by. The nodes in S i, 1 i `, corresond o he check bis. The edges of he grah go only fro S i o S i+1, 0 i ` 1. The consrucion allows for a very sile and ecien encoding algorih which 2 ` S` loss-resilien code C S 2 S 1 S 0 Figure 2.1 Coding schee by Luby e al. coues he check bis in he ses S 2 ; ; S` fro lef o righ by ieraing he following oeraion. Encoding. The value of a node in S i+1 is coued as he XOR of he values of is neighbors in S i. The running ie of his ar of he encoding algorih is roorional o he nuber of edges in he grah. The decoding is done fro righ o lef. I urns ou o be ore robleaic alhough he underlying oeraion is eleenary as well. Decoding. Assue ha he value of a node c in S i+1 and he values of all bu one of is neighbors in S i are known. Then he value of he issing neighbor in S i is coued by he XOR of he value of c and he values of is known neighbors. For his rocedure o recover all essage bis, one has o guaranee ha as long as here are nodes in S i, whose values are unknown, here is a node c in S i+1 o which he basic decoding oeraion can be alied. In [2] his guaranee is obained using rando biarie grahs wih he following roeries o connec S i and S i+1 3
4 1. Wih high robabiliy he bis in S i can be reconsruced by he decoding oeraion fro above if all he bis in S i+1 are known and only a (1 ") ar of he bis in S i is los. 2. Aroxiaely, he average ou-degree of he nodes in S i is ln(1="). To sar his rocedure wih levels S` and S`1 one has o guaranee ha all of he bis a he las level S` are known. The idea is o choose ` in such a way ha an ecien sandard loss-resilien code C wih rae 1 can encode and decode S` in linear ie wih resec o. Since in racice he os ecien loss-resilien codes have quadraic ie encoding and decoding algorihs, we choose ` such ha js`j 2 Hence for his ar of he encoding and decoding can be done in ie linear in. Since he encoding and he decoding in he grah ake ie roorional o he nuber of edges, he running ie of he overall encoding and decoding algorihs is O( ln(1=")). Fro he discussion above i also follows ha he code is a (1 + ") lossresilien code. Finally, we clai ha he rae of he code is 1. This follows fro he fac ha he encoding lengh is given by `X j j=0 {z } # nodes in S 0 [ [ S` 3 The Lower Bound + `+1 1 {z } # check bis of C = 1 For he following arguens we only need he srucure of he biarie grah ha connecs he nodes in S 0 o he nodes in S 1. Firs, we ake he following inforaion-heoreical observaion. I is he key arguen for he resuls below. Proosiion 3.1. Denoe he se of nodes corresonding o he los essage bis by T. Then he se (T ) of nodes conneced o T has o be a leas as large as T if he decoding algorih erinaes successfully. Proof. If j(t )j < jt j, he check bis do no conain enough inforaion o recover all he essage bis. Fro his we can derive a lower bound for he average degree ` of he nodes in S 0. Lea 3.2. Assue ha a node in S 0 is conained in T uniforly and indeendenly wih robabiliy (1 "), where 0 < " < 1 is consan. If he average 4
5 degree ` of he nodes in S 0 saises ` < 1 4 (1 ) ln 1 " ; (3.1) hen he robabiliy ha he se (T ) is saller han T is (1). The roof of his lea will be given in he nex secion. Reark 3.1. Noice ha is he inforaion-heoreically oial erasure robabiliy for he essage bis. A coding schee ha guaranees a successful decoding a his erasure robabiliy leads o an oial MDS code. Proosiion 3.1 and Lea 3.2 ily he following lower bound for he running ie of he encoding and decoding algorih by Luby e al. Theore 3.3. Assue ha he essage bis are los uniforly and indeendenly wih robabiliy (1 "), where 0 < " < 1 is consan. If he robabiliy ha he decoding fails is required o be o(1), hen he encoding and he decoding akes ie ( ln(1=")). 4 The Proof of Lea 3.2 For he roof we use he following sraegy. To show ha for ` < 1 4 (1 ) ln 1 " he robabiliy Pr[j(T )j < jt j] is (1), for all values of jt j in soe inerval I, we esiae he execed size of he se (T ) of neighbors of T. Then we aly Markov's inequaliy o obain a consan lower bound on Pr[j(T )j < jt j j jt j = ]. Choosing I such ha Pr[jT j 2 I] is consan, nishes he roof. Since every node in S 0 lies in T wih robabiliy = (1"), he execaion and he sandard deviaion are Dene I by E[jT j] = ; [jt j] = (1 ) I = [ in ; ax ] where in def = (1 2") def ax = Noice ha he execaion of jt j lies in he iddle of I. inequaliy Pr [jt j =2 I] = Pr jt j E[jT j] > " jt = Pr j E[jT j] " > [jt j] (1) By Chebyshev's k("; ) 1 where k("; ) = (1) " 2 2 5
6 Hence Pr [jt j 2 I] 1 k("; ) 1 jt j = We wan o show ha for any 2 I he robabiliy Pr j(t )j < jt j is (1). For his we coue E j(t )j jt j =. Fix an arbirary 2 I. Condiioned on jt j = he robabiliy ha a xed d node w 2 S 1 is no conneced o a rando se T of size is w =, where d w denoes he in-degree of w. Hence Pr w 2 (T ) dw jt j = = 1 Since js 1 j =, E j(t )j X dw jt j = = w2s 1 Lea 4.1. If he average in-degree r in S 1 saises r, hen X 1 r w2s 1 dw x Proof. Since is a convex funcion in x, X dw w2s 1 r Now he roof is coleed by he following calculaion r = ( r)( r 1) ( r + 1) ( 1) ( + 1) = 1 r 1 1 r 1 r 1 r + 1 Since r = ` and since ` is bounded by a consan, we can assue ha r 1 2 ( ) for large enough. By Lea 4.1 and using 1 x e2x ; 0 x 1=2, E j(t )j jt j = 1 1 r 1 e 2 r! 6
7 Since ax ax = 1, E j(t )j jt j = 1 e 2 1 r (4.1) for an arbirary 2 I. Now we derive a suiable inequaliy for he condiional execaion of j(t )j. Lea 4.2. If ` < 1 4 (1 ) ln 1 ", hen for any 2 I. E j(t )j jt j = < 1 " (4.2) Proof. Assue ha E j(t )j jt j = 1 " Then wih (4.1) " e 2 1 r Hence r ln 1 " and nally ` = r 1 4 (1 ) ln 1 " This conradics he condiion of he lea. Now we can nish he roof of Lea 3.2. Pr j(t )j jt j jt j = Pr j(t )j in jt j = for an arbirary 2 I. Since in Lea 3.2 we assue ` < 1 4 (1 ) ln 1 ", inequaliy (4.2) ilies in = (1 2") = 1 2" 1 " (1 ") for any 2 I. By Markov's inequaliy Pr j(t )j jt j > 1 2" 1 " E j(t )j 1 " jt j = 1 2" 7 jt j =
8 Thus for an arbirary 2 I. Hence Pr j(t )j < jt j Therefore Pr j(t )j < jt j " 2" jt j = 1 2" X jt j 2 I = Pr j(t )j < jt j jt j = Pr [jt j = ] 2I " 2" 1 2" " 2" = 1 2" X 2I Pr [jt j = ] Pr [jt j 2 I] Pr [j(t )j < jt j] Pr j(t )j < jt j " 2" (Pr [jt j 2 I])2 1 2" " 2" 1 2k("; ) 1 1 2" This colees he roof. jt j 2 I Pr [jt j 2 I] = (1) 5 A Degree Bound wih Beer Consans In his secion we wan o irove he consans in Lea 3.2. Corollary 5.1. Assue ha a node in S 0 is conained in T uniforly and indeendenly wih robabiliy (1 "), where 0 < " < 1 is consan. If he average degree ` of he nodes in S 0 saises ` < (1 )(1 ") ln 1 " C (5.1) where C = (1 )(1 ") ln 2, hen he robabiliy ha he se (T ) is saller han T is (1). Reark 5.1. In he consrucion by Luby e al. he average degree of he nodes in S 0 is a leas ln 1 (see [2]). This is for sall " u o a consan facor (1 ) " he sae as he righ hand side of (5.1). The roof of his corollary is alos he sae as he roof of Lea 3.2. Consider inequaliy (4.1). I can be relaced by E j(t )j jt j = 1 e c(1) r for an arbirary 2 I where 0 < c < 1. Insead of (4.2) we obain (5.2) 8
9 Lea 5.2. If ` < (1 )(1 ") ln 1 2", hen for any 2 I. Proof. Assue ha E j(t )j E j(t )j jt j = < 1 (2") 1" jt j = 1 (2") 1" (5.3) Then by (5.2) wih c = 1 " (2") 1" e r 1"(1) Hence r 1 (1 ") ln 1 2" and nally ` = r (1 )(1 ") ln 1 2" This conradics he condiion of he lea. The res of he roof follows along he sae lines as he roof in Secion 4. References [1] Michael G. Luby, Michael Mizenacher, and M. Ain Shokrollahi. Analysis of rando rocesses via and-or ree evaluaion. In Proceedings of he Ninh Annual ACM-SIAM Syosiu on Discree Algorihs, ages 364{ 373, San Francisco, California, 25{27 January [2] Michael G. Luby, Michael Mizenacher, M. Ain Shokrollahi, Daniel A. Sielan, and Volker Seann. Pracical loss-resilien codes. In Proceedings of he Tweny-Ninh Annual ACM Syosiu on Theory of Couing, ages 150{159, El Paso, Texas, 4{6 May [3] J. H. van Lin. Inroducion o Coding Theory. Sringer-Verlag,
Riemann Hypothesis and Primorial Number. Choe Ryong Gil
Rieann Hyohesis Priorial Nuber Choe Ryong Gil Dearen of Maheaics Universiy of Sciences Gwahak- dong Unjong Disric Pyongyang DPRKorea Eail; ryonggilchoe@sar-conek Augus 8 5 Absrac; In his aer we consider
More informationProblem set 2 for the course on. Markov chains and mixing times
J. Seif T. Hirscher Soluions o Proble se for he course on Markov chains and ixing ies February 7, 04 Exercise 7 (Reversible chains). (i) Assue ha we have a Markov chain wih ransiion arix P, such ha here
More informationA note on diagonalization of integral quadratic forms modulo p m
NNTDM 7 ( 3-36 A noe on diagonalizaion of inegral quadraic fors odulo Ali H Hakai Dearen of Maheaics King Khalid Universiy POo 94 Abha Posal Code: 643 Saudi Arabia E-ail: aalhakai@kkuedusa Absrac: Le be
More informationStopping Brownian Motion without Anticipation as Close as Possible to its Ultimate Maximum
Theory Probab. Al. Vol. 45, No.,, (5-36) Research Reor No. 45, 999, De. Theore. Sais. Aarhus Soing Brownian Moion wihou Aniciaion as Close as Possible o is Ulimae Maximum S. E. GRAVERSEN 3, G. PESKIR 3,
More informationChapter 3 Common Families of Distributions
Chaer 3 Common Families of Disribuions Secion 31 - Inroducion Purose of his Chaer: Caalog many of common saisical disribuions (families of disribuions ha are indeed by one or more arameers) Wha we should
More informationA note to the convergence rates in precise asymptotics
He Journal of Inequaliies and Alicaions 203, 203:378 h://www.journalofinequaliiesandalicaions.com/conen/203//378 R E S E A R C H Oen Access A noe o he convergence raes in recise asymoics Jianjun He * *
More informationODEs II, Lecture 1: Homogeneous Linear Systems - I. Mike Raugh 1. March 8, 2004
ODEs II, Lecure : Homogeneous Linear Sysems - I Mike Raugh March 8, 4 Inroducion. In he firs lecure we discussed a sysem of linear ODEs for modeling he excreion of lead from he human body, saw how o ransform
More informationIntroduction to Numerical Analysis. In this lesson you will be taken through a pair of techniques that will be used to solve the equations of.
Inroducion o Nuerical Analysis oion In his lesson you will be aen hrough a pair of echniques ha will be used o solve he equaions of and v dx d a F d for siuaions in which F is well nown, and he iniial
More information1. Calibration factor
Annex_C_MUBDandP_eng_.doc, p. of pages Annex C: Measureen uncerainy of he oal heigh of profile of a deph-seing sandard ih he sandard deviaion of he groove deph as opography er In his exaple, he uncerainy
More informationChapter 2. First Order Scalar Equations
Chaper. Firs Order Scalar Equaions We sar our sudy of differenial equaions in he same way he pioneers in his field did. We show paricular echniques o solve paricular ypes of firs order differenial equaions.
More informationEXPONENTIAL PROBABILITY DISTRIBUTION
MTH/STA 56 EXPONENTIAL PROBABILITY DISTRIBUTION As discussed in Exaple (of Secion of Unifor Probabili Disribuion), in a Poisson process, evens are occurring independenl a rando and a a unifor rae per uni
More information1 Widrow-Hoff Algorithm
COS 511: heoreical Machine Learning Lecurer: Rob Schapire Lecure # 18 Scribe: Shaoqing Yang April 10, 014 1 Widrow-Hoff Algorih Firs le s review he Widrow-Hoff algorih ha was covered fro las lecure: Algorih
More informationFourier Series & The Fourier Transform. Joseph Fourier, our hero. Lord Kelvin on Fourier s theorem. What do we want from the Fourier Transform?
ourier Series & The ourier Transfor Wha is he ourier Transfor? Wha do we wan fro he ourier Transfor? We desire a easure of he frequencies presen in a wave. This will lead o a definiion of he er, he specru.
More informationSome Ramsey results for the n-cube
Some Ramsey resuls for he n-cube Ron Graham Universiy of California, San Diego Jozsef Solymosi Universiy of Briish Columbia, Vancouver, Canada Absrac In his noe we esablish a Ramsey-ype resul for cerain
More information23.2. Representing Periodic Functions by Fourier Series. Introduction. Prerequisites. Learning Outcomes
Represening Periodic Funcions by Fourier Series 3. Inroducion In his Secion we show how a periodic funcion can be expressed as a series of sines and cosines. We begin by obaining some sandard inegrals
More informationVehicle Arrival Models : Headway
Chaper 12 Vehicle Arrival Models : Headway 12.1 Inroducion Modelling arrival of vehicle a secion of road is an imporan sep in raffic flow modelling. I has imporan applicaion in raffic flow simulaion where
More informationExistence of Weak Solutions for Elliptic Nonlinear System in R N
Inernaional Journal of Parial Differenial Equaions and Alicaions, 4, Vol., o., 3-37 Available online a h://ubs.scieub.co/idea///3 Science and Educaion Publishing DOI:.69/idea---3 Exisence of Wea Soluions
More informationChapter 2. Models, Censoring, and Likelihood for Failure-Time Data
Chaper 2 Models, Censoring, and Likelihood for Failure-Time Daa William Q. Meeker and Luis A. Escobar Iowa Sae Universiy and Louisiana Sae Universiy Copyrigh 1998-2008 W. Q. Meeker and L. A. Escobar. Based
More information1 Review of Zero-Sum Games
COS 5: heoreical Machine Learning Lecurer: Rob Schapire Lecure #23 Scribe: Eugene Brevdo April 30, 2008 Review of Zero-Sum Games Las ime we inroduced a mahemaical model for wo player zero-sum games. Any
More informationKriging Models Predicting Atrazine Concentrations in Surface Water Draining Agricultural Watersheds
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Kriging Models Predicing Arazine Concenraions in Surface Waer Draining Agriculural Waersheds Paul L. Mosquin, Jeremy Aldworh, Wenlin Chen Supplemenal Maerial Number
More informationDirac s hole theory and the Pauli principle: clearing up the confusion.
Dirac s hole heory and he Pauli rincile: clearing u he conusion. Dan Solomon Rauland-Borg Cororaion 8 W. Cenral Road Moun Prosec IL 656 USA Email: dan.solomon@rauland.com Absrac. In Dirac s hole heory
More informationRainbow saturation and graph capacities
Rainbow sauraion and graph capaciies Dániel Korándi Absrac The -colored rainbow sauraion number rsa (n, F ) is he minimum size of a -edge-colored graph on n verices ha conains no rainbow copy of F, bu
More informationA Specification Test for Linear Dynamic Stochastic General Equilibrium Models
Journal of Saisical and Economeric Mehods, vol.1, no.2, 2012, 65-70 ISSN: 2241-0384 (prin), 2241-0376 (online) Scienpress Ld, 2012 A Specificaion Tes for Linear Dynamic Sochasic General Equilibrium Models
More informationarxiv: v1 [math.gm] 7 Nov 2017
A TOUR ON THE MASTER FUNCTION THEOPHILUS AGAMA arxiv:7.0665v [mah.gm] 7 Nov 07 Absrac. In his aer we sudy a funcion defined on naural numbers having eacly wo rime facors. Using his funcion, we esablish
More informationPlanar Curves out of Their Curvatures in R
Planar Curves ou o Their Curvaures in R Tala Alkhouli Alied Science Dearen Aqaba College Al Balqa Alied Universiy Aqaba Jordan doi: 9/esj6vn6 URL:h://dxdoiorg/9/esj6vn6 Absrac This research ais o inroduce
More informationLecture 18 GMM:IV, Nonlinear Models
Lecure 8 :IV, Nonlinear Models Le Z, be an rx funcion of a kx paraeer vecor, r > k, and a rando vecor Z, such ha he r populaion oen condiions also called esiain equaions EZ, hold for all, where is he rue
More informationExponential Weighted Moving Average (EWMA) Chart Under The Assumption of Moderateness And Its 3 Control Limits
DOI: 0.545/mjis.07.5009 Exponenial Weighed Moving Average (EWMA) Char Under The Assumpion of Moderaeness And Is 3 Conrol Limis KALPESH S TAILOR Assisan Professor, Deparmen of Saisics, M. K. Bhavnagar Universiy,
More information11!Hí MATHEMATICS : ERDŐS AND ULAM PROC. N. A. S. of decomposiion, properly speaking) conradics he possibiliy of defining a counably addiive real-valu
ON EQUATIONS WITH SETS AS UNKNOWNS BY PAUL ERDŐS AND S. ULAM DEPARTMENT OF MATHEMATICS, UNIVERSITY OF COLORADO, BOULDER Communicaed May 27, 1968 We shall presen here a number of resuls in se heory concerning
More informationT L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB
Elecronic Companion EC.1. Proofs of Technical Lemmas and Theorems LEMMA 1. Le C(RB) be he oal cos incurred by he RB policy. Then we have, T L E[C(RB)] 3 E[Z RB ]. (EC.1) Proof of Lemma 1. Using he marginal
More informationarxiv: v1 [math.fa] 12 Jul 2012
AN EXTENSION OF THE LÖWNER HEINZ INEQUALITY MOHAMMAD SAL MOSLEHIAN AND HAMED NAJAFI arxiv:27.2864v [ah.fa] 2 Jul 22 Absrac. We exend he celebraed Löwner Heinz inequaliy by showing ha if A, B are Hilber
More informationFinal Spring 2007
.615 Final Spring 7 Overview The purpose of he final exam is o calculae he MHD β limi in a high-bea oroidal okamak agains he dangerous n = 1 exernal ballooning-kink mode. Effecively, his corresponds o
More information20. Applications of the Genetic-Drift Model
0. Applicaions of he Geneic-Drif Model 1) Deermining he probabiliy of forming any paricular combinaion of genoypes in he nex generaion: Example: If he parenal allele frequencies are p 0 = 0.35 and q 0
More informationDecision Tree Learning. Decision Tree Learning. Decision Trees. Decision Trees: Operation. Blue slides: Mitchell. Orange slides: Alpaydin Humidity
Decision Tree Learning Decision Tree Learning Blue slides: Michell Oulook Orange slides: Alpaydin Huidiy Sunny Overcas Rain ral Srong Learn o approxiae discree-valued arge funcions. Sep-by-sep decision
More informationTheoretical Computer Science. Approximately optimal trees for group key management with batch updates
Theoreical Compuer Science 410 2009) 101 1021 Conens liss available a ScienceDirec Theoreical Compuer Science journal homepage: www.elsevier.com/locae/cs Approximaely opimal rees for group key managemen
More informationConservation of Momentum. The purpose of this experiment is to verify the conservation of momentum in two dimensions.
Conseraion of Moenu Purose The urose of his exerien is o erify he conseraion of oenu in wo diensions. Inroducion and Theory The oenu of a body ( ) is defined as he roduc of is ass () and elociy ( ): When
More informationMath 10B: Mock Mid II. April 13, 2016
Name: Soluions Mah 10B: Mock Mid II April 13, 016 1. ( poins) Sae, wih jusificaion, wheher he following saemens are rue or false. (a) If a 3 3 marix A saisfies A 3 A = 0, hen i canno be inverible. True.
More informationd 1 = c 1 b 2 - b 1 c 2 d 2 = c 1 b 3 - b 1 c 3
and d = c b - b c c d = c b - b c c This process is coninued unil he nh row has been compleed. The complee array of coefficiens is riangular. Noe ha in developing he array an enire row may be divided or
More informationNote on oscillation conditions for first-order delay differential equations
Elecronic Journal of Qualiaive Theory of Differenial Equaions 2016, No. 2, 1 10; doi: 10.14232/ejqde.2016.1.2 hp://www.ah.u-szeged.hu/ejqde/ Noe on oscillaion condiions for firs-order delay differenial
More informationLongest Common Prefixes
Longes Common Prefixes The sandard ordering for srings is he lexicographical order. I is induced by an order over he alphabe. We will use he same symbols (,
More informationOn a problem of Graham By E. ERDŐS and E. SZEMERÉDI (Budapest) GRAHAM stated the following conjecture : Let p be a prime and a 1,..., ap p non-zero re
On a roblem of Graham By E. ERDŐS and E. SZEMERÉDI (Budaes) GRAHAM saed he following conjecure : Le be a rime and a 1,..., a non-zero residues (mod ). Assume ha if ' a i a i, ei=0 or 1 (no all e i=0) is
More informationRise-Time Distortion of Signal without Carrying Signal
Journal of Physics: Conference Series PAPER OPEN ACCESS Rise-Time Disorion of Signal wihou Carrying Signal To cie his aricle: N S Bukhman 6 J. Phys.: Conf. Ser. 738 8 View he aricle online for udaes and
More informationDescription of the MS-Regress R package (Rmetrics)
Descriion of he MS-Regress R ackage (Rmerics) Auhor: Marcelo Perlin PhD Suden / ICMA Reading Universiy Email: marceloerlin@gmail.com / m.erlin@icmacenre.ac.uk The urose of his documen is o show he general
More informationChristos Papadimitriou & Luca Trevisan November 22, 2016
U.C. Bereley CS170: Algorihms Handou LN-11-22 Chrisos Papadimiriou & Luca Trevisan November 22, 2016 Sreaming algorihms In his lecure and he nex one we sudy memory-efficien algorihms ha process a sream
More informationOn asymptotic behavior of composite integers n = pq Yasufumi Hashimoto
Journal of Mah-for-Indusry Vol1009A-6 45 49 On asymoic behavior of comosie inegers n = q Yasufumi Hashimoo Received on March 1 009 Absrac In his aer we sudy he asymoic behavior of he number of comosie
More informationNotes for Lecture 17-18
U.C. Berkeley CS278: Compuaional Complexiy Handou N7-8 Professor Luca Trevisan April 3-8, 2008 Noes for Lecure 7-8 In hese wo lecures we prove he firs half of he PCP Theorem, he Amplificaion Lemma, up
More informationOn Measuring Pro-Poor Growth. 1. On Various Ways of Measuring Pro-Poor Growth: A Short Review of the Literature
On Measuring Pro-Poor Growh 1. On Various Ways of Measuring Pro-Poor Growh: A Shor eview of he Lieraure During he pas en years or so here have been various suggesions concerning he way one should check
More informationApproximation Algorithms for Unique Games via Orthogonal Separators
Approximaion Algorihms for Unique Games via Orhogonal Separaors Lecure noes by Konsanin Makarychev. Lecure noes are based on he papers [CMM06a, CMM06b, LM4]. Unique Games In hese lecure noes, we define
More informationGMM - Generalized Method of Moments
GMM - Generalized Mehod of Momens Conens GMM esimaion, shor inroducion 2 GMM inuiion: Maching momens 2 3 General overview of GMM esimaion. 3 3. Weighing marix...........................................
More informationMath 333 Problem Set #2 Solution 14 February 2003
Mah 333 Problem Se #2 Soluion 14 February 2003 A1. Solve he iniial value problem dy dx = x2 + e 3x ; 2y 4 y(0) = 1. Soluion: This is separable; we wrie 2y 4 dy = x 2 + e x dx and inegrae o ge The iniial
More informationThus the force is proportional but opposite to the displacement away from equilibrium.
Chaper 3 : Siple Haronic Moion Hooe s law saes ha he force (F) eered by an ideal spring is proporional o is elongaion l F= l where is he spring consan. Consider a ass hanging on a he spring. In equilibriu
More informationPENALIZED LEAST SQUARES AND PENALIZED LIKELIHOOD
PENALIZED LEAST SQUARES AND PENALIZED LIKELIHOOD HAN XIAO 1. Penalized Leas Squares Lasso solves he following opimizaion problem, ˆβ lasso = arg max β R p+1 1 N y i β 0 N x ij β j β j (1.1) for some 0.
More informationMatrix Versions of Some Refinements of the Arithmetic-Geometric Mean Inequality
Marix Versions of Some Refinemens of he Arihmeic-Geomeric Mean Inequaliy Bao Qi Feng and Andrew Tonge Absrac. We esablish marix versions of refinemens due o Alzer ], Carwrigh and Field 4], and Mercer 5]
More informationBOX-JENKINS MODEL NOTATION. The Box-Jenkins ARMA(p,q) model is denoted by the equation. pwhile the moving average (MA) part of the model is θ1at
BOX-JENKINS MODEL NOAION he Box-Jenkins ARMA(,q) model is denoed b he equaion + + L+ + a θ a L θ a 0 q q. () he auoregressive (AR) ar of he model is + L+ while he moving average (MA) ar of he model is
More informationSeminar 4: Hotelling 2
Seminar 4: Hoelling 2 November 3, 211 1 Exercise Par 1 Iso-elasic demand A non renewable resource of a known sock S can be exraced a zero cos. Demand for he resource is of he form: D(p ) = p ε ε > A a
More informationSOME MORE APPLICATIONS OF THE HAHN-BANACH THEOREM
SOME MORE APPLICATIONS OF THE HAHN-BANACH THEOREM FRANCISCO JAVIER GARCÍA-PACHECO, DANIELE PUGLISI, AND GUSTI VAN ZYL Absrac We give a new proof of he fac ha equivalen norms on subspaces can be exended
More informationLecture 2-1 Kinematics in One Dimension Displacement, Velocity and Acceleration Everything in the world is moving. Nothing stays still.
Lecure - Kinemaics in One Dimension Displacemen, Velociy and Acceleraion Everyhing in he world is moving. Nohing says sill. Moion occurs a all scales of he universe, saring from he moion of elecrons in
More informationRC, RL and RLC circuits
Name Dae Time o Complee h m Parner Course/ Secion / Grade RC, RL and RLC circuis Inroducion In his experimen we will invesigae he behavior of circuis conaining combinaions of resisors, capaciors, and inducors.
More informationarxiv:math/ v1 [math.nt] 3 Nov 2005
arxiv:mah/0511092v1 [mah.nt] 3 Nov 2005 A NOTE ON S AND THE ZEROS OF THE RIEMANN ZETA-FUNCTION D. A. GOLDSTON AND S. M. GONEK Absrac. Le πs denoe he argumen of he Riemann zea-funcion a he poin 1 + i. Assuming
More informationThe Asymptotic Behavior of Nonoscillatory Solutions of Some Nonlinear Dynamic Equations on Time Scales
Advances in Dynamical Sysems and Applicaions. ISSN 0973-5321 Volume 1 Number 1 (2006, pp. 103 112 c Research India Publicaions hp://www.ripublicaion.com/adsa.hm The Asympoic Behavior of Nonoscillaory Soluions
More informationHeavy Tails of Discounted Aggregate Claims in the Continuous-time Renewal Model
Heavy Tails of Discouned Aggregae Claims in he Coninuous-ime Renewal Model Qihe Tang Deparmen of Saisics and Acuarial Science The Universiy of Iowa 24 Schae er Hall, Iowa Ciy, IA 52242, USA E-mail: qang@sa.uiowa.edu
More informationMonotonic Solutions of a Class of Quadratic Singular Integral Equations of Volterra type
In. J. Conemp. Mah. Sci., Vol. 2, 27, no. 2, 89-2 Monoonic Soluions of a Class of Quadraic Singular Inegral Equaions of Volerra ype Mahmoud M. El Borai Deparmen of Mahemaics, Faculy of Science, Alexandria
More informationEXERCISES FOR SECTION 1.5
1.5 Exisence and Uniqueness of Soluions 43 20. 1 v c 21. 1 v c 1 2 4 6 8 10 1 2 2 4 6 8 10 Graph of approximae soluion obained using Euler s mehod wih = 0.1. Graph of approximae soluion obained using Euler
More informationLecture 33: November 29
36-705: Inermediae Saisics Fall 2017 Lecurer: Siva Balakrishnan Lecure 33: November 29 Today we will coninue discussing he boosrap, and hen ry o undersand why i works in a simple case. In he las lecure
More informationIntroduction to Probability and Statistics Slides 4 Chapter 4
Inroducion o Probabiliy and Saisics Slides 4 Chaper 4 Ammar M. Sarhan, asarhan@mahsa.dal.ca Deparmen of Mahemaics and Saisics, Dalhousie Universiy Fall Semeser 8 Dr. Ammar Sarhan Chaper 4 Coninuous Random
More informationConvergence of the Neumann series in higher norms
Convergence of he Neumann series in higher norms Charles L. Epsein Deparmen of Mahemaics, Universiy of Pennsylvania Version 1.0 Augus 1, 003 Absrac Naural condiions on an operaor A are given so ha he Neumann
More informationCzech Republic. Ingo Schiermeyer. Germany. June 28, A generalized (i; j)-bull B i;j is a graph obtained by identifying each of some two
Claw-free and generalized bull-free graphs of large diameer are hamilonian RJ Faudree Deparmen of Mahemaical Sciences The Universiy of Memphis Memphis, TN 38152 USA e-mail rfaudree@ccmemphisedu Zdenek
More informationDevelopment of a new metrological model for measuring of the water surface evaporation Tovmach L. Tovmach Yr. Abstract Introduction
Developmen of a new merological model for measuring of he waer surface evaporaion Tovmach L. Tovmach Yr. Sae Hydrological Insiue 23 Second Line, 199053 S. Peersburg, Russian Federaion Telephone (812) 323
More informationSTRUCTURAL CHANGE IN TIME SERIES OF THE EXCHANGE RATES BETWEEN YEN-DOLLAR AND YEN-EURO IN
Inernaional Journal of Applied Economerics and Quaniaive Sudies. Vol.1-3(004) STRUCTURAL CHANGE IN TIME SERIES OF THE EXCHANGE RATES BETWEEN YEN-DOLLAR AND YEN-EURO IN 001-004 OBARA, Takashi * Absrac The
More informationInternational Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN
Inernaional Journal of Scienific & Engineering Research, Volume 4, Issue 10, Ocober-2013 900 FUZZY MEAN RESIDUAL LIFE ORDERING OF FUZZY RANDOM VARIABLES J. EARNEST LAZARUS PIRIYAKUMAR 1, A. YAMUNA 2 1.
More informationStochastic models and their distributions
Sochasic models and heir disribuions Couning cusomers Suppose ha n cusomers arrive a a grocery a imes, say T 1,, T n, each of which akes any real number in he inerval (, ) equally likely The values T 1,,
More informationComments on Window-Constrained Scheduling
Commens on Window-Consrained Scheduling Richard Wes Member, IEEE and Yuing Zhang Absrac This shor repor clarifies he behavior of DWCS wih respec o Theorem 3 in our previously published paper [1], and describes
More informationFamilies with no matchings of size s
Families wih no machings of size s Peer Franl Andrey Kupavsii Absrac Le 2, s 2 be posiive inegers. Le be an n-elemen se, n s. Subses of 2 are called families. If F ( ), hen i is called - uniform. Wha is
More informationSynthesis of Supervisors Enforcing General Linear Vector Constraints in Petri Nets
The 00 Aerican onrol onference, May -0, Anchorage, Alaska. Synhesis of Suervisors Enforcing General Linear Vecor onsrains in Peri Nes Marian V. Iordache and Panos J. Ansaklis Absrac This aer considers
More informationdi Bernardo, M. (1995). A purely adaptive controller to synchronize and control chaotic systems.
di ernardo, M. (995). A purely adapive conroller o synchronize and conrol chaoic sysems. hps://doi.org/.6/375-96(96)8-x Early version, also known as pre-prin Link o published version (if available):.6/375-96(96)8-x
More informationTechnical Report Doc ID: TR March-2013 (Last revision: 23-February-2016) On formulating quadratic functions in optimization models.
Technical Repor Doc ID: TR--203 06-March-203 (Las revision: 23-Februar-206) On formulaing quadraic funcions in opimizaion models. Auhor: Erling D. Andersen Convex quadraic consrains quie frequenl appear
More informationWEEK-3 Recitation PHYS 131. of the projectile s velocity remains constant throughout the motion, since the acceleration a x
WEEK-3 Reciaion PHYS 131 Ch. 3: FOC 1, 3, 4, 6, 14. Problems 9, 37, 41 & 71 and Ch. 4: FOC 1, 3, 5, 8. Problems 3, 5 & 16. Feb 8, 018 Ch. 3: FOC 1, 3, 4, 6, 14. 1. (a) The horizonal componen of he projecile
More information3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon
3..3 INRODUCION O DYNAMIC OPIMIZAION: DISCREE IME PROBLEMS A. he Hamilonian and Firs-Order Condiions in a Finie ime Horizon Define a new funcion, he Hamilonian funcion, H. H he change in he oal value of
More informationAsymptotic Equipartition Property - Seminar 3, part 1
Asympoic Equipariion Propery - Seminar 3, par 1 Ocober 22, 2013 Problem 1 (Calculaion of ypical se) To clarify he noion of a ypical se A (n) ε and he smalles se of high probabiliy B (n), we will calculae
More information15. Bicycle Wheel. Graph of height y (cm) above the axle against time t (s) over a 6-second interval. 15 bike wheel
15. Biccle Wheel The graph We moun a biccle wheel so ha i is free o roae in a verical plane. In fac, wha works easil is o pu an exension on one of he axles, and ge a suden o sand on one side and hold he
More informationProperties Of Solutions To A Generalized Liénard Equation With Forcing Term
Applied Mahemaics E-Noes, 8(28), 4-44 c ISSN 67-25 Available free a mirror sies of hp://www.mah.nhu.edu.w/ amen/ Properies Of Soluions To A Generalized Liénard Equaion Wih Forcing Term Allan Kroopnick
More informationDynamic Programming 11/8/2009. Weighted Interval Scheduling. Weighted Interval Scheduling. Unweighted Interval Scheduling: Review
//9 Algorihms Dynamic Programming - Weighed Ineral Scheduling Dynamic Programming Weighed ineral scheduling problem. Insance A se of n jobs. Job j sars a s j, finishes a f j, and has weigh or alue j. Two
More informationAn Invariance for (2+1)-Extension of Burgers Equation and Formulae to Obtain Solutions of KP Equation
Commun Theor Phys Beijing, China 43 2005 pp 591 596 c Inernaional Academic Publishers Vol 43, No 4, April 15, 2005 An Invariance for 2+1-Eension of Burgers Equaion Formulae o Obain Soluions of KP Equaion
More informationfakultät für informatik informatik 12 technische universität dortmund Petri Nets Peter Marwedel TU Dortmund, Informatik /11/09
2 Peri Nes Peer Marwedel TU Dormund, Informaik 2 2009//09 Grahics: Alexandra Nole, Gesine Marwedel, 2003 Models of comuaion considered in his course Communicaion/ local comuaions Undefined comonens Communicaing
More informationMATH 31B: MIDTERM 2 REVIEW. x 2 e x2 2x dx = 1. ue u du 2. x 2 e x2 e x2] + C 2. dx = x ln(x) 2 2. ln x dx = x ln x x + C. 2, or dx = 2u du.
MATH 3B: MIDTERM REVIEW JOE HUGHES. Inegraion by Pars. Evaluae 3 e. Soluion: Firs make he subsiuion u =. Then =, hence 3 e = e = ue u Now inegrae by pars o ge ue u = ue u e u + C and subsiue he definiion
More informationEE100 Lab 3 Experiment Guide: RC Circuits
I. Inroducion EE100 Lab 3 Experimen Guide: A. apaciors A capacior is a passive elecronic componen ha sores energy in he form of an elecrosaic field. The uni of capaciance is he farad (coulomb/vol). Pracical
More informationOptimality Conditions for Unconstrained Problems
62 CHAPTER 6 Opimaliy Condiions for Unconsrained Problems 1 Unconsrained Opimizaion 11 Exisence Consider he problem of minimizing he funcion f : R n R where f is coninuous on all of R n : P min f(x) x
More informationMonochromatic Infinite Sumsets
Monochromaic Infinie Sumses Imre Leader Paul A. Russell July 25, 2017 Absrac WeshowhahereisaraionalvecorspaceV suchha,whenever V is finiely coloured, here is an infinie se X whose sumse X+X is monochromaic.
More informationViscous Damping Summary Sheet No Damping Case: Damped behaviour depends on the relative size of ω o and b/2m 3 Cases: 1.
Viscous Daping: && + & + ω Viscous Daping Suary Shee No Daping Case: & + ω solve A ( ω + α ) Daped ehaviour depends on he relaive size of ω o and / 3 Cases:. Criical Daping Wee 5 Lecure solve sae BC s
More informationTHE BERNOULLI NUMBERS. t k. = lim. = lim = 1, d t B 1 = lim. 1+e t te t = lim t 0 (e t 1) 2. = lim = 1 2.
THE BERNOULLI NUMBERS The Bernoulli numbers are defined here by he exponenial generaing funcion ( e The firs one is easy o compue: (2 and (3 B 0 lim 0 e lim, 0 e ( d B lim 0 d e +e e lim 0 (e 2 lim 0 2(e
More information10. State Space Methods
. Sae Space Mehods. Inroducion Sae space modelling was briefly inroduced in chaper. Here more coverage is provided of sae space mehods before some of heir uses in conrol sysem design are covered in he
More informationLinear Cryptanalysis
Linear Crypanalysis T-79.550 Crypology Lecure 5 February 6, 008 Kaisa Nyberg Linear Crypanalysis /36 SPN A Small Example Linear Crypanalysis /36 Linear Approximaion of S-boxes Linear Crypanalysis 3/36
More informationCMU-Q Lecture 3: Search algorithms: Informed. Teacher: Gianni A. Di Caro
CMU-Q 5-38 Lecure 3: Search algorihms: Informed Teacher: Gianni A. Di Caro UNINFORMED VS. INFORMED SEARCH Sraegy How desirable is o be in a cerain inermediae sae for he sake of (effecively) reaching a
More informationThe Optimal Stopping Time for Selling an Asset When It Is Uncertain Whether the Price Process Is Increasing or Decreasing When the Horizon Is Infinite
American Journal of Operaions Research, 08, 8, 8-9 hp://wwwscirporg/journal/ajor ISSN Online: 60-8849 ISSN Prin: 60-8830 The Opimal Sopping Time for Selling an Asse When I Is Uncerain Wheher he Price Process
More informationACE 562 Fall Lecture 5: The Simple Linear Regression Model: Sampling Properties of the Least Squares Estimators. by Professor Scott H.
ACE 56 Fall 005 Lecure 5: he Simple Linear Regression Model: Sampling Properies of he Leas Squares Esimaors by Professor Sco H. Irwin Required Reading: Griffihs, Hill and Judge. "Inference in he Simple
More informationRobust estimation based on the first- and third-moment restrictions of the power transformation model
h Inernaional Congress on Modelling and Simulaion, Adelaide, Ausralia, 6 December 3 www.mssanz.org.au/modsim3 Robus esimaion based on he firs- and hird-momen resricions of he power ransformaion Nawaa,
More informationZürich. ETH Master Course: L Autonomous Mobile Robots Localization II
Roland Siegwar Margaria Chli Paul Furgale Marco Huer Marin Rufli Davide Scaramuzza ETH Maser Course: 151-0854-00L Auonomous Mobile Robos Localizaion II ACT and SEE For all do, (predicion updae / ACT),
More informationBiol. 356 Lab 8. Mortality, Recruitment, and Migration Rates
Biol. 356 Lab 8. Moraliy, Recruimen, and Migraion Raes (modified from Cox, 00, General Ecology Lab Manual, McGraw Hill) Las week we esimaed populaion size hrough several mehods. One assumpion of all hese
More informationINDEX. Transient analysis 1 Initial Conditions 1
INDEX Secion Page Transien analysis 1 Iniial Condiions 1 Please inform me of your opinion of he relaive emphasis of he review maerial by simply making commens on his page and sending i o me a: Frank Mera
More informationA NOTE ON S(t) AND THE ZEROS OF THE RIEMANN ZETA-FUNCTION
Bull. London Mah. Soc. 39 2007 482 486 C 2007 London Mahemaical Sociey doi:10.1112/blms/bdm032 A NOTE ON S AND THE ZEROS OF THE RIEMANN ZETA-FUNCTION D. A. GOLDSTON and S. M. GONEK Absrac Le πs denoe he
More informationOrientation. Connections between network coding and stochastic network theory. Outline. Bruce Hajek. Multicast with lost packets
Connecions beween nework coding and sochasic nework heory Bruce Hajek Orienaion On Thursday, Ralf Koeer discussed nework coding: coding wihin he nework Absrac: Randomly generaed coded informaion blocks
More information