A NOTE ON BLOCK SEQUENCES IN HILBERT SPACES. S. K. Kaushik, Ghanshyam Singh and Virender University of Delhi and M.L.S.
|
|
- Elfreda Collins
- 7 years ago
- Views:
Transcription
1 GLASNIK MATEMATIČKI Vol. 43(63)(2008), A NOTE ON BLOCK SEQUENCES IN HILBERT SPACES S. K. Kaushik, Ghashyam Sigh ad Vireder Uiversity of Delhi ad M.L.S. Uiversity, Idia Abstract. Block sequeces with respect to frames i Hilbert spaces have bee defied. Examples have bee provided to show that a block sequece with respect to a give frame may ot eve be a Bessel sequece. Also, a ecessary ad sufficiet coditio uder which a block sequece with respect to a frame is a frame has bee give. Further, applicatios of block sequeces to obtai Fusio frames ad Fusio frame systems have bee give. Fially, a problem has bee posed ad observed that a affirmative aswer to this problem gives a affirmative aswer to the Feichtiger Cojecture. 1. Itroductio I 1952, Duffi ad Schaeffer [13] itroduced frames for Hilbert spaces. It took more tha 30 years to realize the importace of frames. But, after the ladmark paper of Daubechies, Grossma ad Meyer [12], i 1986, the theory of frame bega to be more widely studied. For a itroductio to frames, oe may refer to [3, 10, 11, 14, 15, 16]. Casazza [4], ad Beedetto ad Fickus [2] have studied frames i fiite dimesioal spaces which attracted more attetio due to their use i sigal ad image processig. For sigal recostructio without phase iformatio, oe may refer to [1]. Frames, ow a days, are mai tools for use i sigal ad image processig, data compressio, samplig theory, optics, filter baks, sigal detectio, time frequecy aalysis etc. A umber of ew applicatios have emerged which caot be modeled aturally by oe sigle frame system. I such cases, the data assiged to oe sigle frame system becomes too large to be hadled umerically. So, it would be beeficial to split large frame system ito a set of much smaller systems 2000 Mathematics Subject Classificatio. 42C15, 42A38. Key words ad phrases. Frame, Bessel sequece, block sequece. 387
2 388 S. K. KAUSHIK, G. SINGH AND VIRENDER ad to process the data locally withi each subsystem effectively. Thus, a distributed frame theory for a set of local frame systems is required. I this directio, a theory based o Fusio frames was developed i [6, 8, 9, 18] which provides a framework to deal with these applicatios ad to derive efficiet ad robust algorithms. Aother well kow requiremet i the frame theory is to decompose a bouded frame ito fiite uio of Riesz basic sequeces. This is kow as Feichtiger cojecture ad is coected to the famous Kadiso-Siger cojecture [17]. It was show i [5] that Kadiso-Siger cojecture implies Feichtiger cojecture. For more results regardig the Feichtiger cojecture, oe may refer to [5, 7]. I the preset paper, we defie block sequeces is Hilbert spaces ad give examples to show that a block sequece with respect to a give frame eed ot be a frame (frame sequece). Also, a ecessary ad sufficiet coditio uder which a block sequece with respect to a give frame is a frame has bee give. Further, we discuss applicatios of block sequeces to obtai fusio frames ad fusio frame systems. Fially, we pose a problem ad observe that a affirmative aswer to this problem gives a affirmative aswer to the Feichtiger cojecture. 2. Prelimiaries Throughout the paper, H will deote a ifiite dimesioal Hilbert space, { k } a ifiite icreasig sequece i N, [x ] the closed liear spa of {x }, for ay set D, O(D) will deote the cardiality of D. Defiitio 2.1. A sequece {x } H is called a frame for H if there exist costats A, B > 0 such that (2.1) A x 2 N x, x 2 B x 2, x H. The positive costats A ad B, respectively, are called lower ad upper frame bouds of the frame {x }. The iequality (2.1) is called the frame iequality. The frame {x } H is called tight if it is possible to choose A, B satisfyig iequality (2.1) with A = B ad is called ormalized tight if A = B = 1. The frame {x } H is called exact if removal of ay arbitrary x reders the collectio {x } o loger a frame for H. A sequece {x } H is called a Bessel sequece if it satisfies upper frame iequality i (2.1). A sequece {x } H is said to be a frame sequece for H if {x } is a frame for [x ].
3 A NOTE ON BLOCK SEQUENCES IN HILBERT SPACES Mai Results Defiitio 3.1. A sequece {y } i a Hilbert space H is said to be a block sequece with respect to a sequece {x } i H if it is of the form (3.1) y = α i x i 0, N, i D where D s are fiite subsets of N with D D m = φ, m, ad α i s are ay scalars. N D = N The followig observatios arise aturally i wake of the block sequeces with respect to frames. Observatios. (I) A block sequece with respect to a frame i a Hilbert space may or may ot be a frame for H. Ideed: (a) Let {x } be ay frame for H, the for scalars α i = 1, i N ad D = {}, N, {y } (as give i (3.1)) is a frame for H. (b) Let {x } be a sequece of orthoormal uit vectors i H. The {x } is a frame for H. Take α i = 1, i N ad D 1 = {1, 2, 3}; D = {2 + }, for all 2. The the block sequece {y } is a frame sequece for H but it is ot a frame for H. (II) A block sequece with respect to a frame i H may ot eve be a frame sequece for H. Ideed, let {e } be the sequece of orthoormal uit vectors i H ad {x } i H be defied by x 1 = e 1 ; x 2 = x 2+1 = e +1, for all 1. The {x } is a frame for H. Take α i = 1, i N ad D 1 = {1}; D = {2 2, 2 1}, for all 2. The the block sequece {y } is ot a frame sequece for H. However, [y ] = H. (III) A block sequece with respect to a sequece i H which is ot eve a frame for H may be a frame for H. Ideed, let {e } be a sequece of orthoormal uit vectors i H. Defie {x } i H by x = e, N. The {x } is ot a frame for H. Take α =, N ad D = {}, N. The the block sequece {y } with respect to {x } is a frame for H. (IV) A block sequece {y } with respect to a frame {x } i H with if y > δ, for all N, for some δ > 0, may fail to esure that {y } is a frame sequece for H (see Observatio (II)). (V) A block sequece {y } with respect to a frame {x } with [y ] = [x ] may also fail to esure that {y } is a frame sequece for H. Ideed, let {x } be the sequece of orthoormal uit vectors i H. Take α i = 1 i,
4 390 S. K. KAUSHIK, G. SINGH AND VIRENDER i N ad D = {}, N. The [y ] = [x ]. But {y } is ot a frame sequece for H. I view of the above observatios, oe may ask for sufficiet coditios uder which a block sequece with respect to a frame is a Bessel sequece (frame) for H. We prove the followig result i this directio. Theorem 3.2. Let {x } be a frame for H ad {y } be a block sequece with respect to {x }. The {y } is a frame for H if α i <, sup{o(d ) : N} < ad if α i 2 i D i,j D α i ᾱ j > 0. Further, if {x } is exact, the {y } is also exact. Proof. Let 0 < A B < be costats such that sup 1 i< A x 2 x, x 2 B x 2, x H. Now y, x 2 = α i x i, x i D sup α i 2 1 i< 2 K 0 ( i D x, x 2 (where K 0 = sup{k : k = O(D ), cardiality of D }) K 0 sup 1 i< α i 2 B x 2, x H. Therefore, {x } is a Bessel sequece for H with boud K 0 Agai y, x 2 ), sup 1 i< α i 2 B = B 0. = 2 α i x i, x i D = α i 2 x i, x 2 + α i ᾱ j x i, x x, x j i D i,j D α i 2 x i, x 2 x, x 2 α i ᾱ j. i D i D i,j D
5 A NOTE ON BLOCK SEQUENCES IN HILBERT SPACES 391 Therefore where A 0 = aa ad a = if y, x 2 A 0 x 2, i D α i 2 i,j D x E α i ᾱ j. Hece {y } is a frame for H with bouds A 0 ad B 0. Further, if {y } is ot exact, the, for some m N y m = j m β j y j, where β j 0 for some j m. This gives α i x i = β j α k x k, i D m j m k D j where α i0 0 for some i 0 D m. Therefore, for some c 0, i 0, we may write x i0 = =i 0 c x. Hece {x } is ot exact. Remark 3.3. (i) The coditio sup{o(d ) : N} < ca ot be dropped { as if we cosider H = l 2 with} orthoormal basis {e } ad let 1 D = ( 1) + k : k = 1, 2,...,, N. Clearly D D m = φ 2 for m ad D = N. Also ote that sup{o(d ) : N}. N Let {y } be a block sequece defied by the relatio y = i D α i e i, where α i = 1 for all i N. The, for x = 3/2 e i i H, x < 2, but x, y 2 does i D ot coverge ad hece {y } is ot a Bessel sequece, so ca ot be a frame for H. (ii) I Theorem 3.2, the coditio that if α i ᾱ j > 0 i D α i 2 i,j D is ot ecessary (see the details of Observatio I(b)). Also, we ca ot drop this coditio as the block sequece {y } i Observatio (V) is
6 392 S. K. KAUSHIK, G. SINGH AND VIRENDER ot a frame ad i this case if α i 2 i D i,j D α i ᾱ j 0 (iii) The coditio that sup 1 < α < is ot ecessary. Ideed, let {e } is a sequece of orthoormal uit vectors ad {x } is defied as x 2 1 = e ad x 2 = e, N. The the block sequece {y } defied by y = x x 2, N is also a frame for H, but sup α i. We ow give a ecessary ad sufficiet coditio uder which a block sequece with respect to a frame is a frame. Theorem 3.4. Let {x } be a frame for H ad {y } be a block sequece with respect to {x }. Let T : l 2 (N) l 2 (N) be a bouded liear operator such that T({ x, x }) = { y, x }, x H. The {y } is also a frame for H if ad oly if there exists a λ > 0 such that { y, x } λ { x, x }, x H. Proof. Let 0 < A B < be such that (3.2) A x 2 x, x 2 B x 2, x H. The y, x 2 = { y, x } 2 λ 2 A x 2, x H. Also y, x 2 = { y, x } 2 = T({ x, x }) 2 T 2 B x 2, x H. Hece {y } is frame for H with bouds λ 2 A ad T 2 B. Coversely, let {y } is a frame for H with bouds A y ad B y. The, for ay x H, we have A y x 2 y, x 2 B y x 2, x H. Therefore, by (3.2) A y x, x 2 A y x 2 B y, x 2, x H.
7 A NOTE ON BLOCK SEQUENCES IN HILBERT SPACES 393 Put A y B = λ2. The λ > 0 such that { y, x } λ { x, x }, x H. Applicatios Let {x } be a frame for H ad let V = [x i ] i D, N. The {V } is a sequece of subspaces of H such that V = H. Therefore, each x H ca be expressed as (3.3) x = y i, i=1 where y i V i, i N. The represetatio i (3.3) may ot be uique. Note that, for each N, {x i } i D is a frame for the subspace V. Defie v : H V by v (x) = α i x i V, N, x H. i D The oe ca fid costats 0 < A B < such that A x 2 v i (x) 2 B x 2, x H. i=1 Therefore (V, v ) N is a Fusio frame for H ad (V, v, {x i } i D ) is a Fusio frame system for H (Fusio frames ad Fusio frame systems were itroduced ad studied recetly by Casazza ad Kutyiok ad others i [6, 8, 9, 18]). If {x } is exact frame for H, the there exists a sequece of fiite subsets {D } of N (e.g. take D = {}, N) with D = N such that H = N V, where V = [x i ] i D. N Also, {f } be the sequece of uit vectors i H. Defie a sequece {g } i H by g = 1 f, N. Let k = k 1 + (k 1), k N ad 0 = 1. The { k } is a ifiite icreasig sequece i N. Now defie {h } i H by h 1 = g 1, h k = h k +1 = h k +2 = = h k+1 1 = g k, k 2. The {h } is a tight o-exact frame for H. Takig D k = { k, k + 1,..., k+1 1}, k N ad V k = [h i ] i Dk, k N, we get H = N V. I view of the above discussio, it is atural to raise the followig problem.
8 394 S. K. KAUSHIK, G. SINGH AND VIRENDER Problem 3.1. Is it always possible to have a sequece of fiite subsets {D } of N with D = N such that H = V, where V = [x i ] i D ad N {x } is a bouded frame for H? Remark 3.5. A affirmative aswer to this problem solves the Feichtiger cojecture i affirmative. Ideed, let {D } N be a sequece of fiite subsets of N with D = N such that H = V, where V = [x i ] i D. N N Defie G i = {x } Di ad for each j N, choose {y j i } i N such that y j i = jth elemet of G i. The for each j, {y j i } is a Riesz basic sequece for H ad {x } = {y j i }. j Ackowledgemets. The authors thak the referees for thoroughly readig the paper ad for providig valuable commets ad useful suggestios for the improvemet of the paper. The research of first author is partially supported by the UGC (Idia) (Letter No.F.6-1(52)/2007 (MRP/Sc/NRCB)) ad the research of third author is supported by the CSIR (Idia) (vide letter No. 09/172(0053)/2006- EMR-I dated ). Refereces [1] R. Bala, P. G. Casazza ad D. Edidi, O sigal recostructio without phase, Appl. Comput. Harmo. Aal. 20 (2006), [2] J. J. Beedetto ad M. Fickus, Fiite ormalized tight frames, Frames, Adv. Comput. Math. 18 (2003), [3] P. G. Casazza, The art of frame theory, Taiwaese J. Math. 4 (2000), [4] P. G. Casazza, Custom buildig fiite frames, i: Wavelets, frames ad operator theory, 61-86, Cotemp. Math. 345, Amer. Math. Soc., Providece, RI, [5] P. G. Casazza, O. Chirstese, A. Lider ad R. Vershyi, Frames ad Feichtiger Cojecture, Proc. Amer. Math. Soc. 133 (2005), [6] P. G. Casazza ad G. Kutyiok, Robustess of fusio frames uder erasures of subspaces ad of local frame vectors, Radom trasforms, geometry, ad wavelets (New Orleas, LA, 2006), Cotemp. Math., Amer. Math. Soc., Providece, RI (to appear). [7] P. G. Casazza, G. Kutyiok, D. Speegle ad J. C. Tremai, A decompositio theorem for frames ad the Feichtiger cojucture, Proc. Amer. Math. Soc. 136 (2008), [8] P. G. Casazza, G. Kutyiok ad S. Li, Fusio frames ad distributed processig, Appl. Comput. Harmo. Aal. 25 (2008), [9] P. G. Casazza, G. Kutyiok, S. Li ad C. J. Rozell, Modelig sesor etworks with fusio frames. Wavelets XII (Sa Diego, CA, 2007), 67011M M-11, SPIE Proc. 6701, SPIE, Belligham, WA, [10] O. Christese, A Itroductio to Frames ad Riesz Bases, Birkhäuser Bosto, Ic., Bosto, MA, [11] O. Christese, Liear combiatios of frames ad frame packets, Z. Aal. Aweduge 20 (2001), [12] I. Daubechies, A. Grossma ad Y. Meyer, Pailess o-orthogoal expasios, J. Math. Phys. 27 (1986),
9 A NOTE ON BLOCK SEQUENCES IN HILBERT SPACES 395 [13] R. J. Duffi ad A. C. Schaeffer, A class of oharmoic Fourier series, Tras. Amer. Math. Soc. 72 (1952), [14] S. J. Favier ad R. A. Zalik, O the stability of frames ad Riesz bases, Appl. Comput. Harmo. Aal. 2 (1995), [15] D. Gabor, Theory of commuicatios, J. IEE (Lodo) 93 (1946), [16] C. Heil ad D. Walut, Cotiuous ad discrete wavelet trasform, SIAM Rev. 31 (1989), [17] R. V. Kadiso ad I. M. Siger, Extesios of pure states, Amer. J. Math. 81 (1959), [18] G. Kutyiok, A. Pezeshki, A. R. Calderbak ad T. Liu, Robust dimesio reductio, fusio frames, ad Grassmaia packigs, preprit. S. K. Kaushik Departmet of Mathematics Kirori Mal College, Uiversity of Delhi Delhi Idia shikk2003@yahoo.co.i G. Sigh Departmet of Mathematics ad Statistics, Uiversity College of Sciece, M.L.S. Uiversity, Udaipur (Rajastha) Idia Ghashyamsrathore@yahoo.co.i Vireder Departmet of Mathematics ad Statistics, Uiversity College of Sciece, M.L.S. Uiversity, Udaipur (Rajastha) Idia vireder57@yahoo.com Received: Revised: &
On the L p -conjecture for locally compact groups
Arch. Math. 89 (2007), 237 242 c 2007 Birkhäuser Verlag Basel/Switzerlad 0003/889X/030237-6, ublished olie 2007-08-0 DOI 0.007/s0003-007-993-x Archiv der Mathematik O the L -cojecture for locally comact
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 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 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 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 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 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 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 informationLecture 5: Span, linear independence, bases, and dimension
Lecture 5: Spa, liear idepedece, bases, ad dimesio Travis Schedler Thurs, Sep 23, 2010 (versio: 9/21 9:55 PM) 1 Motivatio Motivatio To uderstad what it meas that R has dimesio oe, R 2 dimesio 2, etc.;
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 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 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 informationTHIN SEQUENCES AND THE GRAM MATRIX PAMELA GORKIN, JOHN E. MCCARTHY, SANDRA POTT, AND BRETT D. WICK
THIN SEQUENCES AND THE GRAM MATRIX PAMELA GORKIN, JOHN E MCCARTHY, SANDRA POTT, AND BRETT D WICK Abstract We provide a ew proof of Volberg s Theorem characterizig thi iterpolatig sequeces as those for
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 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 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 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 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 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 informationCME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8
CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 8 GENE H GOLUB 1 Positive Defiite Matrices A matrix A is positive defiite if x Ax > 0 for all ozero x A positive defiite matrix has real ad positive
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 informationON AN INTEGRAL OPERATOR WHICH PRESERVE THE UNIVALENCE
Proceedigs of the Iteratioal Coferece o Theory ad Applicatios of Mathematics ad Iformatics ICTAMI 3, Alba Iulia ON AN INTEGRAL OPERATOR WHICH PRESERVE THE UNIVALENCE by Maria E Gageoea ad Silvia Moldoveau
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 informationOn Formula to Compute Primes. and the n th Prime
Applied Mathematical cieces, Vol., 0, o., 35-35 O Formula to Compute Primes ad the th Prime Issam Kaddoura Lebaese Iteratioal Uiversity Faculty of Arts ad cieces, Lebao issam.kaddoura@liu.edu.lb amih Abdul-Nabi
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 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 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 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 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 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 informationOur aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series
8 Fourier Series Our aim is to show that uder reasoable assumptios a give -periodic fuctio f ca be represeted as coverget series f(x) = a + (a cos x + b si x). (8.) By defiitio, the covergece of the series
More informationEkkehart Schlicht: Economic Surplus and Derived Demand
Ekkehart Schlicht: Ecoomic Surplus ad Derived Demad Muich Discussio Paper No. 2006-17 Departmet of Ecoomics Uiversity of Muich Volkswirtschaftliche Fakultät Ludwig-Maximilias-Uiversität Müche Olie at http://epub.ub.ui-mueche.de/940/
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 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 informationNormal Distribution.
Normal Distributio www.icrf.l Normal distributio I probability theory, the ormal or Gaussia distributio, is a cotiuous probability distributio that is ofte used as a first approimatio to describe realvalued
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 information4.3. The Integral and Comparison Tests
4.3. THE INTEGRAL AND COMPARISON TESTS 9 4.3. The Itegral ad Compariso Tests 4.3.. The Itegral Test. Suppose f is a cotiuous, positive, decreasig fuctio o [, ), ad let a = f(). The the covergece or divergece
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 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 informationHow To Solve The Homewor Problem Beautifully
Egieerig 33 eautiful Homewor et 3 of 7 Kuszmar roblem.5.5 large departmet store sells sport shirts i three sizes small, medium, ad large, three patters plaid, prit, ad stripe, ad two sleeve legths log
More informationON THE DENSE TRAJECTORY OF LASOTA EQUATION
UNIVERSITATIS IAGELLONICAE ACTA MATHEMATICA, FASCICULUS XLIII 2005 ON THE DENSE TRAJECTORY OF LASOTA EQUATION by Atoi Leo Dawidowicz ad Najemedi Haribash Abstract. I preseted paper the dese trajectory
More informationLECTURE 13: Cross-validation
LECTURE 3: Cross-validatio Resampli methods Cross Validatio Bootstrap Bias ad variace estimatio with the Bootstrap Three-way data partitioi Itroductio to Patter Aalysis Ricardo Gutierrez-Osua Texas A&M
More informationThe analysis of the Cournot oligopoly model considering the subjective motive in the strategy selection
The aalysis of the Courot oligopoly model cosiderig the subjective motive i the strategy selectio Shigehito Furuyama Teruhisa Nakai Departmet of Systems Maagemet Egieerig Faculty of Egieerig Kasai Uiversity
More information3 Basic Definitions of Probability Theory
3 Basic Defiitios of Probability Theory 3defprob.tex: Feb 10, 2003 Classical probability Frequecy probability axiomatic probability Historical developemet: Classical Frequecy Axiomatic The Axiomatic defiitio
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 informationChapter 5: Inner Product Spaces
Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples
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 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 informationPlug-in martingales for testing exchangeability on-line
Plug-i martigales for testig exchageability o-lie Valetia Fedorova, Alex Gammerma, Ilia Nouretdiov, ad Vladimir Vovk Computer Learig Research Cetre Royal Holloway, Uiversity of Lodo, UK {valetia,ilia,alex,vovk}@cs.rhul.ac.uk
More information5 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 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 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 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 information1 The Gaussian channel
ECE 77 Lecture 0 The Gaussia chael Objective: I this lecture we will lear about commuicatio over a chael of practical iterest, i which the trasmitted sigal is subjected to additive white Gaussia oise.
More informationA note on the boundary behavior for a modified Green function in the upper-half space
Zhag ad Pisarev Boudary Value Problems (015) 015:114 DOI 10.1186/s13661-015-0363-z RESEARCH Ope Access A ote o the boudary behavior for a modified Gree fuctio i the upper-half space Yulia Zhag1 ad Valery
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 informationVladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT
Keywords: project maagemet, resource allocatio, etwork plaig Vladimir N Burkov, Dmitri A Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT The paper deals with the problems of resource allocatio betwee
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 informationA Note on Sums of Greatest (Least) Prime Factors
It. J. Cotemp. Math. Scieces, Vol. 8, 203, o. 9, 423-432 HIKARI Ltd, www.m-hikari.com A Note o Sums of Greatest (Least Prime Factors Rafael Jakimczuk Divisio Matemática, Uiversidad Nacioal de Luá Bueos
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 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 information3. Greatest Common Divisor - Least Common Multiple
3 Greatest Commo Divisor - Least Commo Multiple Defiitio 31: The greatest commo divisor of two atural umbers a ad b is the largest atural umber c which divides both a ad b We deote the greatest commo gcd
More informationMajor Coefficients Recovery: a Compressed Data Gathering Scheme for Wireless Sensor Network
This full text paper was peer reviewed at the directio of IEEE Commuicatios Society subject matter experts for publicatio i the IEEE Globecom proceedigs. Major Coefficiets Recovery: a Compressed Data Gatherig
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 informationSampling Distribution And Central Limit Theorem
() Samplig Distributio & Cetral Limit Samplig Distributio Ad Cetral Limit Samplig distributio of the sample mea If we sample a umber of samples (say k samples where k is very large umber) each of size,
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 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 informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis
Ruig Time ( 3.) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
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 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 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 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 informationMulti-server Optimal Bandwidth Monitoring for QoS based Multimedia Delivery Anup Basu, Irene Cheng and Yinzhe Yu
Multi-server Optimal Badwidth Moitorig for QoS based Multimedia Delivery Aup Basu, Iree Cheg ad Yizhe Yu Departmet of Computig Sciece U. of Alberta Architecture Applicatio Layer Request receptio -coectio
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 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 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 informationFIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix
FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. Powers of a matrix We begi with a propositio which illustrates the usefuless of the diagoalizatio. Recall that a square matrix A is diogaalizable if
More informationClass Meeting # 16: The Fourier Transform on R n
MATH 18.152 COUSE NOTES - CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,
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 informationA RANDOM PERMUTATION MODEL ARISING IN CHEMISTRY
J. Appl. Prob. 45, 060 070 2008 Prited i Eglad Applied Probability Trust 2008 A RANDOM PERMUTATION MODEL ARISING IN CHEMISTRY MARK BROWN, The City College of New York EROL A. PEKÖZ, Bosto Uiversity SHELDON
More informationChatpun Khamyat Department of Industrial Engineering, Kasetsart University, Bangkok, Thailand ocpky@hotmail.com
SOLVING THE OIL DELIVERY TRUCKS ROUTING PROBLEM WITH MODIFY MULTI-TRAVELING SALESMAN PROBLEM APPROACH CASE STUDY: THE SME'S OIL LOGISTIC COMPANY IN BANGKOK THAILAND Chatpu Khamyat Departmet of Idustrial
More informationDescriptive Statistics
Descriptive Statistics We leared to describe data sets graphically. We ca also describe a data set umerically. Measures of Locatio Defiitio The sample mea is the arithmetic average of values. We deote
More informationOutput Analysis (2, Chapters 10 &11 Law)
B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should
More informationDomain 1 - Describe Cisco VoIP Implementations
Maual ONT (642-8) 1-800-418-6789 Domai 1 - Describe Cisco VoIP Implemetatios Advatages of VoIP Over Traditioal Switches Voice over IP etworks have may advatages over traditioal circuit switched voice etworks.
More informationDegree of Approximation of Continuous Functions by (E, q) (C, δ) Means
Ge. Math. Notes, Vol. 11, No. 2, August 2012, pp. 12-19 ISSN 2219-7184; Copyright ICSRS Publicatio, 2012 www.i-csrs.org Available free olie at http://www.gema.i Degree of Approximatio of Cotiuous Fuctios
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 informationExample 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).
BEGINNING ALGEBRA Roots ad Radicals (revised summer, 00 Olso) Packet to Supplemet the Curret Textbook - Part Review of Square Roots & Irratioals (This portio ca be ay time before Part ad should mostly
More informationUniversity of California, Los Angeles Department of Statistics. Distributions related to the normal distribution
Uiversity of Califoria, Los Ageles Departmet of Statistics Statistics 100B Istructor: Nicolas Christou Three importat distributios: Distributios related to the ormal distributio Chi-square (χ ) distributio.
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 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 informationStudy on the application of the software phase-locked loop in tracking and filtering of pulse signal
Advaced Sciece ad Techology Letters, pp.31-35 http://dx.doi.org/10.14257/astl.2014.78.06 Study o the applicatio of the software phase-locked loop i trackig ad filterig of pulse sigal Sog Wei Xia 1 (College
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 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 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 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 informationTrackless online algorithms for the server problem
Iformatio Processig Letters 74 (2000) 73 79 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
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 informationRamsey-type theorems with forbidden subgraphs
Ramsey-type theorems with forbidde subgraphs Noga Alo Jáos Pach József Solymosi Abstract A graph is called H-free if it cotais o iduced copy of H. We discuss the followig questio raised by Erdős ad Hajal.
More informationUC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006
Exam format UC Bereley Departmet of Electrical Egieerig ad Computer Sciece EE 6: Probablity ad Radom Processes Solutios 9 Sprig 006 The secod midterm will be held o Wedesday May 7; CHECK the fial exam
More information