Coding Along Hermite Polynomials for Gaussian Noise Channels

Size: px
Start display at page:

Download "Coding Along Hermite Polynomials for Gaussian Noise Channels"

Transcription

1 Coding Along Hermite olynomials for Gaussian Noise Channels Emmanuel A. Abbe IG, EFL Lausanne, 1015 CH Lizhong Zheng LIDS, MIT Cambridge, MA Abstract This aer shows that the caacity achieving inut distribution for a fading Gaussian broadcast channel is not Gaussian in general. The construction of non-gaussian distributions that strictly outerform Gaussian ones, for certain characterized fading distributions, is rovided. The ability of analyzing non-gaussian inut distributions with closed form exressions is made ossible in a local setting. It is shown that there exists a secific coordinate system, based on Hermite olynomials, which arametrizes Gaussian neighborhoods and which is articularly suitable to study the entroic oerators encountered with Gaussian noise. I. INTODUCTION Let a memoryless additive white Gaussian noise AWGN) channel be described by Y = X + Z, where Z N 0, v) is indeendent of X. If the inut is subject to an average ower constraint given by EX, the inut distribution maximizing the mutual information is Gaussian. This is due to the fact that under second moment constraint, the Gaussian distribution maximizes the entroy, hence max X:EX = hx + Z) N 0, ). 1) On the other hand, for an additive noise channel, if we use a Gaussian inut distribution, i.e., X N 0, ), among noises with bounded second moment, the noise minimizing the mutual information is again Gaussian. This can be shown by using the entroy ower inequality EI), which reduces in this setting to and imlies min hx + Z) N 0, v) ) Z: hz)= 1 log πev min Z:EZ =v hx + Z) hz) N 0, v). 3) Hence, in the single-user setting, Gaussian inuts are the best inuts to fight Gaussian noise and Gaussian noise is the worst noise to face with Gaussian inuts. This rovides a game equilibrium between user and nature, as defined in [3],. 63. With these results, many roblems in information theory dealing with Gaussian noise can be solved. However, in the networ information theory setting, two interesting new henomena mae the search for the otimal codes more comlex. First, the interference. With the interference, a frustration henomena aears. Assuming Gaussian additive noise for each user, if the users treat interference as noise, the game equilibrium described reviously rovides now a conflicting situation: for inuts that are Gaussian distributed, we also have the worst ind of interference Gaussian distributed). Should interference not be treated as noise, or should non-gaussian ensembles be considered? These are still oen questions. Another interesting difference between the single user and networ setting concerns the fading. In a single user setting, for an AWGN channel with a coherent fading, 1) allows to show that the Gaussian inut distribution achieves the caacity no matter what the fading distribution is). Just lie for the case with no fading. In a Gaussian broadcast channel BC), 1) and 3) allow to show that Gaussian inuts are again caacity achieving. But if we consider a fading Gaussian BC, with a coherent fading reserving the degradedness roerty), there are no nown results using 1) and 3) which allow to rove that the Gaussian inuts are caacity achieving. Either we are missing theorems to rove this assertion or it is simly wrong. In this aer, we show that this assertion is wrong. Even for the following simle structure of coherent Fading Gaussian BC, where Y i = HX + Z i, i = 1, with Z 1 N 0, v 1 ), Z N 0, v ), v 1 < v and H is arbitrarily distributed but is the same for both users; the inut distributions achieving the caacity region boundaries are unnown. Since this is a degraded BC, the caacity region is given by all rate airs IX; Y 1 U, H), IU; Y H)) with U X Y 1, Y ). The otimal inut distributions, i.e., the distributions of U, X) achieving the caacity region boundary, are given by the following otimization, where µ, max IX; Y 1 U, H) + µiu; Y H). 4) U,X): U X Y 1,Y ) EX Note that the objective function in the above maximization is hy 1 U, H) hz 1 ) + µhy H) µhy U, H). Now, each term in the above is individually maximized by a Gaussian distribution, but these terms are combined with different signs, so there is a cometitive situation and the maximizer is not obvious. When µ 1, one can show that Gaussian distributions are otimal. Also, if H is comactly suorted, and if v is small enough as to mae the suort of

2 H and 1/vH non overlaing, the otimal inut distribution is Gaussian cf. [5]). However, in general the otimal distributions is unnown. Note that a similar cometitive situation occurs for the interference channel. Let the inuts be X 1 and X, the interference coefficients a and b, and the noise Z 1 and Z indeendent standard Gaussian). The following exression IX 1 ; X 1 + ax + Z 1 ) + IX ; X + bx 1 + Z ) = hx 1 + ax + Z 1 ) hax + Z 1 ) + hx + bx 1 + Z ) hbx 1 + Z ), is a lower bound to the sum-caacity, which is tight by considering X 1 and X of arbitrary bloc length n. Now, Gaussian distributions are maximizing each entroy term in the above, hence, since they aear with different signs, there is a cometitive situation. Would we then refer to tae X 1 and X Gaussian, very non-gaussian or slightly non- Gaussian? Although these questions are not formally defined, the dilemma osed by them can still be understood. II. OBLEM STATEMENT We will use the fading Gaussian BC roblem as a motivation for our more general goal. For this secific roblem, we want to now if/when the distribution of U, X) maximizing 4) is Gaussian or not. Our more general goal is to understand better the roblem osed by the cometitive situations described in the Introduction. For this urose, we formulate a mathematical roblem in the next section. III. LOCAL GEOMETY AND HEMITE COODINATES Let g denote the Gaussian density with zero mean and variance. We start by changing the notation and rewrite 1) and 3) as otimizations over the inut distributions, i.e. max hf g v) = g 5) f: m f)= min hf g v) hf) = g 6) f: m f)= where the functions f are density functions on, i.e., ositive integrable functions integrating to 1, and having a well-defined entroy and second moment m f) = x fx)dx. We now consider the local analysis. We define densities of the form f ε x) = g x)1 + εlx)), x, 7) where L : satisfies inf Lx) > 8) x Lx)g x)dx = 0. 9) Hence, with these two constraints, f ε is a valid density for ε sufficiently small. It is a erturbed Gaussian density, in a direction L. Observe that, m f ε ) = iff M L) = x Lx)g x)dx = 0. 10) We are now interested in analyzing how these erturbations affects the outut through an AWGN channel. Note that, if the inut is a Gaussian g erturbed in the direction L, the outut is a Gaussian erturbed in the direction gl) gv, since f ε g v = 1 + ε gl) gv ). Convention: g L g v refers to g L) g v, i.e., the multilicative oerator recedes the convolution one. For simlicity, let us assume in the following that the function L is a olynomial satisfying 8), 9). Lemma 1: We have Df ε g ) = 1 ε L g + oε ) Df ε g v g g v ) = 1 ε g L g v + oε ), where L g = L x)g x)dx. Moreover, note that for any density f, if its first and second moments are m 1 f) = a and m f) = + a, we have hf) = hg a, ) Df g a, ). 11) Hence, the extremal entroic results of 5) and 6) are locally exressed as min g L g v g L: M L)=0 = 0 1) max g L g v g L: M L)=0 L g = 0, 13) where 0 denotes here the zero function. If 1) is obvious, 13) requires a chec which will be done in section V. Now, if we want to mae headway on the cometitive situations resented in the introduction, we need more refined results than the ones above. Let us define the following maing, Γ +) : L L g ) g L g v L ), 14) where L g ) denotes the sace of real functions having a finite g norm. This linear maing gives, for a given erturbed direction L of a Gaussian inut g, the resulting erturbed direction of the outut through additive Gaussian noise g v. The norm of each direction in their resective saces, i.e., L g ) and L ), gives how far from the Gaussian distribution these erturbations are. Note that if L satisfies 8)-9), so does Γ +) L for the measure. The result in 13) worst noise case) tells us that this maing is a contraction, but for our goal, what would be helful is a sectral analysis of this oerator, to allow more quantitative results than the extreme-case results of 1) and 13). In order to do so, one can exress Γ +) as an oerator defined and valued in the same sace, namely L with the Lebesgue measure λ, which is done by inserting the Gaussian measure in the oerator ument. We then roceed to a singular function/value analysis. Formally, let K = L g, which gives K λ = L g, and let g K g v Λ : K L λ; ) L λ; ) 15) g

3 which gives Γ +) L g = ΛK λ. We want to find the singular functions of Λ, i.e., denoting by Λ t the adjoint oerator of Λ, we want to find the eigenfunctions K of Λ t Λ. A. General esult IV. ESULTS The following roosition gives the singular functions and values of the oerator Λ defined in revious section. roosition 1: holds for each airs Λ t ΛK = γk, K 0 K, γ) { g H [], + v ) )} 0, where H [] x) = 1! H x/ ) and H x) = 1) e x / d dx e x /, 0, x. The olynomials H [] are the normalized Hermite olynomials for a Gaussian distribution having variance ) and g H [] are called the Hermite functions. For any > 0, {H [] } 0 is an orthonormal basis of L g ), this can be found in [4]. One can chec that H 1, resectively H erturb a Gaussian distribution into another Gaussian distribution, with a different first moment, resectively second moment. For 3, the H erturbations are not modifying the first two moments and are moving away from Gaussian distributions. Since H [] 0 = 1, the orthogonality roerty imlies that H [] satisfies 9) for any > 0. However, it is formally only for even values of that 10) is verified although we will see in section V that essentially any can be considered in our roblems). The following result contains the roerty of Hermite olynomials mostly used in our roblems, and exresses roosition 1 with the Gaussian measures. roosition : Γ +) H [] = g H [] g v = + v )/ H [], 16) Γ ) H [] = H [] g v = + v )/ H []. 17) Last roosition imlies roosition 1, since Γ ) Γ +) L = γl Λ t ΛK = γk for K = L g. Comment: these roerties of Hermite olynomials and Gaussian measures are liely to be already nown, in a different context or with different notations. However, what is articularly interesting here, are not only these roerties by themselves, but mainly the fact that they are recisely emerging from our information theoretic setting and are helful to solve our roblems. In words, we just saw that H is an eigenfunction of the inut/outut erturbation oerator Γ +), in the sense ) / [] H. Hence, over an additive that Γ +) H [] = Gaussian noise channel g v, if we erturb the inut g in the direction H [] by an amount ε, we will erturb the outut ) / in the direction H [] by an amount ε. Such a erturbation in H imlies that the outut entroy is reduced comared to not erturbing) by B. Fading Gaussian Broadcast esult ) ε if 3). roosition 3: Let Y i = HX + Z i, i = 1,, with X such that EX, Z 1 N 0, v), 0 < v < 1 and Z N 0, 1). There exists fading distributions and values of v for which the caacity achieving inut distribution is non-gaussian. More recisely, let U be any auxiliary random variable, with U X Y 1, Y ). Then, there exists, v, a distribution of H and µ such that U, X) IX; Y 1 U, H) + µiu; Y H) 18) is maximized by a non jointly Gaussian distribution. In the roof, we find a counter-examle to Gaussian being otimal for H binary and of course other counter-examles can be found). In order to defeat Gaussian codes, we construct codes using the Hermite coordinates. The roof also gives conditions on the fading distribution and the noise variance v for which these codes are strictly imroving on Gaussian ones. V. OOFS We start by reviewing the roof of 13), as it brings interesting facts. We then rove the main result. roof of 13): We assume first that we insist on constraining f ε to have zero mean and variance exactly. Using the Hermite basis, we exress L as L = 3 α H [] L must have such an exansion, since it must have a finite L g ) norm, to mae sense of the original exressions). Using 16), we can then exress 13) as ) α α 19) + v 3 3 which is clearly negative. Hence, we have roved that g L g v L g 0) and 13) is maximized by taing L = 0. Note that we can get tighter bounds than the one in revious inequality, indeed the tightest, holding for H 3, is given by g L g v + v L g 1) this clearly holds if written as a series lie in 19)). Hence, locally the contraction roerty can be tightened, and locally, we have stronger EI s, or worst noise case. Namely, if ν, we have min hf g v) νhf) = g ) f: m 1f)=0,m f)=

4 ) and if ν < 3, g is outerformed by non-gaussian distributions. Now, if we consider the constraint m f), which in articular, allows now to have m 1 f) > 0 and m f) =, we get that if ν, min hf g v) νhf) = g 3) f: m f) and if ν <, g is outerformed by g δ for some δ > 0. It would then be interesting to study if these tighter results hold in a greater generality than for the local setting. roof of roosition : We refer to 18) as the mu-rate. Let us first consider Gaussian codes, i.e., when U, X) is jointly Gaussian, and see what mu-rate they can achieve. Without loss of generality, we can assume that X = U + V, with U and V indeendent and Gaussian, with resective variance Q and satisfying = Q +. Then, 18) becomes 1 H E log1 + v ) + µ1 1 + H E log 1 + H. 4) Now, we ic a µ and loo for the otimal ower that should be allocated to V in order to maximize the above exression. We are interested in cases for which the otimal is not at the boundary but at an extremum of 4), and if the maxima is unique, the otimal is found by the first derivative chec, which gives E H v+h = µe H 1+H. Since we will loo for µ, v, with > 0, revious condition can be written as E H v + H = µe H 1 + H. 5) We now chec if we can imrove on 4) by moving away from the otimal jointly Gaussian U, X). There are several ways to erturb U, X), we consider here a first examle. We ee U and V indeendent, but erturb them away from Gaussian s in the following way: Uε u) = g Q u)1 + εh [Q] 3 u) + δh 4 )) 6) Vε v) = g v)1 εh [] 3 v) δh 4)) 7) with ε, δ > 0 small enough. Note that these are valid density functions and that they reserve the first two moments of U and V. The reason why we add δh 4, is to ensure that 10) is satisfied, but we will see that for our urose, this can essentially be neglected. Then, using Lemma, the new distribution of X is given by X x) = g x)1 + ε Q H [ ] 3 ε Q [ ] H 3 ) + fδ) ) 4 H [ ] 4 + ) 4 H [ ] 4 ), which where fδ) = δg x)ε tends to zero when δ tends to zero. Now, by icing =, we have X x) = g x) + fδ). 8) Hence, by taing δ arbitrarily small, the distribution of X is arbitrarily close to the Gaussian distribution with variance. We now want to evaluate how these Hermite erturbations erform, given that we want to maximize 18), i.e., hy 1 U, H) hz 1 ) + µhy H) µhy U, H). 9) We wonder if, by moving away from Gaussians, the gain achieved for the term hy U, H) is higher than the loss suffered from the other terms. With the Hermite structure described in revious section, we are able to recisely measure this and we get hy 1 U = u, H = h) h = hg hu,v+h 1 ε v + h H [hu,v+h ] 3 )) = 1 ) log πev + h ) ε h 3 v + h + oε ) + oδ) hy U = u, H = h) = 1 log πe1 + h ) ε and because of 8) h 1 + h + oε ) + oδ) hy H = h) = 1 log πe1 + h ) + oε ) + oδ). Therefore, collecting all terms, we find that for U ε and V ε defined in 6) and 7), exression 9) reduces to ) I G ε H 3 ) E v + H + µ ε H 3 E 1 + H + oε ) + oδ0) where I G is equal to 4) which is the mu-rate obtained with Gaussian inuts). Hence, if for some distribution of H and some v, we have that ) H ) H µe 1 + H E v + H > 0, 31) when = 3 and is otimal for µ, we can tae ε and δ small enough in order to mae 30) strictly ler than I G. We have shown how, if verified, inequality 31) leads to counter-examles of the Gaussian otimality, but with similar exansions, we would also get counter-examles if the following inequality holds for any ower instead of 3, as long as 3. Let us summarize what we obtained: Let be otimal for µ, which means that 5) holds if there is only one maxima not at the boarder). Then, non-gaussian codes along Hermite s strictly outerforms Gaussian codes, if, for some 3, 31) holds. If the maxima is unique, this becomes where ET v) ET v) < ET 1) ET 1) T v) = H v + H. So we want the Jensen ga of T v) for the ower to be small enough comared to the Jensen ga of T 1).

5 such as when U and V are indeendent with U Gaussian and V non-gaussian along Hermite s. In this case, we get a different condition than 31), which is stronger in general for fixed values of the arameters, but which can still be verified, maing V non-gaussian strictly better than Gaussian. Fig. 1. Gaussian mu-rate, i.e., exression 4), lotted as a function of for µ = 5/4, v = 1/4, = and H binary {1; 10}. Maxima at = Fig.. LHS of 31) as a function of, for µ = 5/4, v = 1/4, = 8 and H binary {1; 10}, ositive at = We now give an examle of fading distribution for which the above conditions can be verified. Let H be binary, taing values 1 and 10 with robability half and let v = 1/4. Let µ = 5/4, then for any values of, the maximizer of 4) is at = , cf. Figure 1, which corresonds in this case to the unique value of for which 5) is satisfied. Hence if is ler than this value of, there is a corresonding fading BC for which the best Gaussian code slits the ower on U and V with = to achieve the best murate with µ = 5/4. To fit the counter-examles with the choice of Hermite erturbations made reviously, we ic =. Finally, for these values of µ and, 31) can be verified for = 8, cf. Figure, and the corresonding Hermite code along H 8 ) strictly outerforms any Gaussian codes. Note that we can consider other non-gaussian encoders, VI. DISCUSSION We have introduced the use of encoders drawn from non- Gaussian distributions along Hermite olynomials. If the erformance of non-gaussian inuts is usually hard to analyze, we showed how the neighborhoods of Gaussian inuts can be analytically analyzed by use of the Hermite coordinates. This allowed us to use nuanced version of the usual extremal entroic results, and in articular, to show that Gaussian inuts are in general not otimal for degraded fading Gaussian BC, although they might still be otimal for many fading distributions. The Hermite technique rovides not only otential counter-examles to otimality of Gaussian inuts but it also gives insight on roblems for which a cometitive situations does not imly the obvious otimality of Gaussian inuts. For examle, in the considered roblem, the Hermite technique gives a condition on what ind of fading distribution and degradedness values of v) non-gaussian inuts must be used. It also tells us how, locally, the otimal encoder is defined. In this aer, we considered fading BC s, but many other cometitive situations can be tacled with this tool, articularly, since a multi-letter generalization of the current technique can be carried out to aear). Finally, in a different context, local results could be lifted to corresonding global results in [1]. There, the localization is made with resect to the channels and not the inut distribution, yet, it would be interesting to comare the local with the global behavior for the current roblem too. A wor in rogress aims to relace the local neighborhood with a global one, consisting of all sub-gaussian distributions. ACKNOWLEDGMENT The authors would lie to than Tie Liu and Shlomo Shamai for ointing out roblems relevant to the alication of the roosed technic, as well as Daniel Strooc for discussions on Hermite olynomials. For the first author, this wor has artially been done under a ostdoctoral fellowshi at LIDS, MIT. EFEENCES [1] E. Abbe and L. Zheng, Linear universal decoding: a local to global geometric aroach, Submitted IEEE Trans. Inform. Theory, 008. [] T. M. Cover, Comments on broadcast channel, IEEE Trans. on Inform. Theory vol. 44, n. 6, , Oct [3] T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons, New Yor, NY, [4] D. W. Strooc, A Concise Introduction to the Theory of Integration, Third Edition, Birhäuser, [5] D. Tuninetti and S. Shamai, On two-user fading Gaussian broadcast channels with erfect channel state information at the receivers, Int. Sym. on Inform. Theory ISIT), 003.

A Coordinate System for Gaussian Networks

A Coordinate System for Gaussian Networks A Coordinate System for Gaussian Networs The MIT Faculty has made this article oenly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Abbe, Emmanuel,

More information

Improved Capacity Bounds for the Binary Energy Harvesting Channel

Improved Capacity Bounds for the Binary Energy Harvesting Channel Imroved Caacity Bounds for the Binary Energy Harvesting Channel Kaya Tutuncuoglu 1, Omur Ozel 2, Aylin Yener 1, and Sennur Ulukus 2 1 Deartment of Electrical Engineering, The Pennsylvania State University,

More information

ECE 534 Information Theory - Midterm 2

ECE 534 Information Theory - Midterm 2 ECE 534 Information Theory - Midterm Nov.4, 009. 3:30-4:45 in LH03. You will be given the full class time: 75 minutes. Use it wisely! Many of the roblems have short answers; try to find shortcuts. You

More information

Convex Optimization methods for Computing Channel Capacity

Convex Optimization methods for Computing Channel Capacity Convex Otimization methods for Comuting Channel Caacity Abhishek Sinha Laboratory for Information and Decision Systems (LIDS), MIT sinhaa@mit.edu May 15, 2014 We consider a classical comutational roblem

More information

On Code Design for Simultaneous Energy and Information Transfer

On Code Design for Simultaneous Energy and Information Transfer On Code Design for Simultaneous Energy and Information Transfer Anshoo Tandon Electrical and Comuter Engineering National University of Singaore Email: anshoo@nus.edu.sg Mehul Motani Electrical and Comuter

More information

Uniformly best wavenumber approximations by spatial central difference operators: An initial investigation

Uniformly best wavenumber approximations by spatial central difference operators: An initial investigation Uniformly best wavenumber aroximations by satial central difference oerators: An initial investigation Vitor Linders and Jan Nordström Abstract A characterisation theorem for best uniform wavenumber aroximations

More information

4. Score normalization technical details We now discuss the technical details of the score normalization method.

4. Score normalization technical details We now discuss the technical details of the score normalization method. SMT SCORING SYSTEM This document describes the scoring system for the Stanford Math Tournament We begin by giving an overview of the changes to scoring and a non-technical descrition of the scoring rules

More information

Finite Mixture EFA in Mplus

Finite Mixture EFA in Mplus Finite Mixture EFA in Mlus November 16, 2007 In this document we describe the Mixture EFA model estimated in Mlus. Four tyes of deendent variables are ossible in this model: normally distributed, ordered

More information

Elementary Analysis in Q p

Elementary Analysis in Q p Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some

More information

On the capacity of the general trapdoor channel with feedback

On the capacity of the general trapdoor channel with feedback On the caacity of the general tradoor channel with feedback Jui Wu and Achilleas Anastasooulos Electrical Engineering and Comuter Science Deartment University of Michigan Ann Arbor, MI, 48109-1 email:

More information

Some Results on the Generalized Gaussian Distribution

Some Results on the Generalized Gaussian Distribution Some Results on the Generalized Gaussian Distribution Alex Dytso, Ronit Bustin, H. Vincent Poor, Daniela Tuninetti 3, Natasha Devroye 3, and Shlomo Shamai (Shitz) Abstract The aer considers information-theoretic

More information

Radial Basis Function Networks: Algorithms

Radial Basis Function Networks: Algorithms Radial Basis Function Networks: Algorithms Introduction to Neural Networks : Lecture 13 John A. Bullinaria, 2004 1. The RBF Maing 2. The RBF Network Architecture 3. Comutational Power of RBF Networks 4.

More information

Improving on the Cutset Bound via a Geometric Analysis of Typical Sets

Improving on the Cutset Bound via a Geometric Analysis of Typical Sets Imroving on the Cutset Bound via a Geometric Analysis of Tyical Sets Ayfer Özgür Stanford University CUHK, May 28, 2016 Joint work with Xiugang Wu (Stanford). Ayfer Özgür (Stanford) March 16 1 / 33 Gaussian

More information

Some Unitary Space Time Codes From Sphere Packing Theory With Optimal Diversity Product of Code Size

Some Unitary Space Time Codes From Sphere Packing Theory With Optimal Diversity Product of Code Size IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 5, NO., DECEMBER 4 336 Some Unitary Sace Time Codes From Shere Packing Theory With Otimal Diversity Product of Code Size Haiquan Wang, Genyuan Wang, and Xiang-Gen

More information

Inequalities for the L 1 Deviation of the Empirical Distribution

Inequalities for the L 1 Deviation of the Empirical Distribution Inequalities for the L 1 Deviation of the Emirical Distribution Tsachy Weissman, Erik Ordentlich, Gadiel Seroussi, Sergio Verdu, Marcelo J. Weinberger June 13, 2003 Abstract We derive bounds on the robability

More information

Improved Bounds on Bell Numbers and on Moments of Sums of Random Variables

Improved Bounds on Bell Numbers and on Moments of Sums of Random Variables Imroved Bounds on Bell Numbers and on Moments of Sums of Random Variables Daniel Berend Tamir Tassa Abstract We rovide bounds for moments of sums of sequences of indeendent random variables. Concentrating

More information

The inverse Goldbach problem

The inverse Goldbach problem 1 The inverse Goldbach roblem by Christian Elsholtz Submission Setember 7, 2000 (this version includes galley corrections). Aeared in Mathematika 2001. Abstract We imrove the uer and lower bounds of the

More information

VARIANTS OF ENTROPY POWER INEQUALITY

VARIANTS OF ENTROPY POWER INEQUALITY VARIANTS OF ENTROPY POWER INEQUALITY Sergey G. Bobkov and Arnaud Marsiglietti Abstract An extension of the entroy ower inequality to the form N α r (X + Y ) N α r (X) + N α r (Y ) with arbitrary indeendent

More information

LDPC codes for the Cascaded BSC-BAWGN channel

LDPC codes for the Cascaded BSC-BAWGN channel LDPC codes for the Cascaded BSC-BAWGN channel Aravind R. Iyengar, Paul H. Siegel, and Jack K. Wolf University of California, San Diego 9500 Gilman Dr. La Jolla CA 9093 email:aravind,siegel,jwolf@ucsd.edu

More information

Approximating min-max k-clustering

Approximating min-max k-clustering Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost

More information

On Z p -norms of random vectors

On Z p -norms of random vectors On Z -norms of random vectors Rafa l Lata la Abstract To any n-dimensional random vector X we may associate its L -centroid body Z X and the corresonding norm. We formulate a conjecture concerning the

More information

Training sequence optimization for frequency selective channels with MAP equalization

Training sequence optimization for frequency selective channels with MAP equalization 532 ISCCSP 2008, Malta, 12-14 March 2008 raining sequence otimization for frequency selective channels with MAP equalization Imed Hadj Kacem, Noura Sellami Laboratoire LEI ENIS, Route Sokra km 35 BP 3038

More information

Convolutional Codes. Lecture 13. Figure 93: Encoder for rate 1/2 constraint length 3 convolutional code.

Convolutional Codes. Lecture 13. Figure 93: Encoder for rate 1/2 constraint length 3 convolutional code. Convolutional Codes Goals Lecture Be able to encode using a convolutional code Be able to decode a convolutional code received over a binary symmetric channel or an additive white Gaussian channel Convolutional

More information

LINEAR SYSTEMS WITH POLYNOMIAL UNCERTAINTY STRUCTURE: STABILITY MARGINS AND CONTROL

LINEAR SYSTEMS WITH POLYNOMIAL UNCERTAINTY STRUCTURE: STABILITY MARGINS AND CONTROL LINEAR SYSTEMS WITH POLYNOMIAL UNCERTAINTY STRUCTURE: STABILITY MARGINS AND CONTROL Mohammad Bozorg Deatment of Mechanical Engineering University of Yazd P. O. Box 89195-741 Yazd Iran Fax: +98-351-750110

More information

Interactive Hypothesis Testing Against Independence

Interactive Hypothesis Testing Against Independence 013 IEEE International Symosium on Information Theory Interactive Hyothesis Testing Against Indeendence Yu Xiang and Young-Han Kim Deartment of Electrical and Comuter Engineering University of California,

More information

1 Extremum Estimators

1 Extremum Estimators FINC 9311-21 Financial Econometrics Handout Jialin Yu 1 Extremum Estimators Let θ 0 be a vector of k 1 unknown arameters. Extremum estimators: estimators obtained by maximizing or minimizing some objective

More information

On the Secrecy Capacity of the Z-Interference Channel

On the Secrecy Capacity of the Z-Interference Channel On the Secrecy Capacity of the Z-Interference Channel Ronit Bustin Tel Aviv University Email: ronitbustin@post.tau.ac.il Mojtaba Vaezi Princeton University Email: mvaezi@princeton.edu Rafael F. Schaefer

More information

Sharp gradient estimate and spectral rigidity for p-laplacian

Sharp gradient estimate and spectral rigidity for p-laplacian Shar gradient estimate and sectral rigidity for -Lalacian Chiung-Jue Anna Sung and Jiaing Wang To aear in ath. Research Letters. Abstract We derive a shar gradient estimate for ositive eigenfunctions of

More information

Introduction to MVC. least common denominator of all non-identical-zero minors of all order of G(s). Example: The minor of order 2: 1 2 ( s 1)

Introduction to MVC. least common denominator of all non-identical-zero minors of all order of G(s). Example: The minor of order 2: 1 2 ( s 1) Introduction to MVC Definition---Proerness and strictly roerness A system G(s) is roer if all its elements { gij ( s)} are roer, and strictly roer if all its elements are strictly roer. Definition---Causal

More information

Robustness of classifiers to uniform l p and Gaussian noise Supplementary material

Robustness of classifiers to uniform l p and Gaussian noise Supplementary material Robustness of classifiers to uniform l and Gaussian noise Sulementary material Jean-Yves Franceschi Ecole Normale Suérieure de Lyon LIP UMR 5668 Omar Fawzi Ecole Normale Suérieure de Lyon LIP UMR 5668

More information

Homework Set #3 Rates definitions, Channel Coding, Source-Channel coding

Homework Set #3 Rates definitions, Channel Coding, Source-Channel coding Homework Set # Rates definitions, Channel Coding, Source-Channel coding. Rates (a) Channels coding Rate: Assuming you are sending 4 different messages using usages of a channel. What is the rate (in bits

More information

The Graph Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule

The Graph Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule The Grah Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule STEFAN D. BRUDA Deartment of Comuter Science Bisho s University Lennoxville, Quebec J1M 1Z7 CANADA bruda@cs.ubishos.ca

More information

arxiv:cond-mat/ v2 25 Sep 2002

arxiv:cond-mat/ v2 25 Sep 2002 Energy fluctuations at the multicritical oint in two-dimensional sin glasses arxiv:cond-mat/0207694 v2 25 Se 2002 1. Introduction Hidetoshi Nishimori, Cyril Falvo and Yukiyasu Ozeki Deartment of Physics,

More information

A Social Welfare Optimal Sequential Allocation Procedure

A Social Welfare Optimal Sequential Allocation Procedure A Social Welfare Otimal Sequential Allocation Procedure Thomas Kalinowsi Universität Rostoc, Germany Nina Narodytsa and Toby Walsh NICTA and UNSW, Australia May 2, 201 Abstract We consider a simle sequential

More information

Towards understanding the Lorenz curve using the Uniform distribution. Chris J. Stephens. Newcastle City Council, Newcastle upon Tyne, UK

Towards understanding the Lorenz curve using the Uniform distribution. Chris J. Stephens. Newcastle City Council, Newcastle upon Tyne, UK Towards understanding the Lorenz curve using the Uniform distribution Chris J. Stehens Newcastle City Council, Newcastle uon Tyne, UK (For the Gini-Lorenz Conference, University of Siena, Italy, May 2005)

More information

Quantitative estimates of propagation of chaos for stochastic systems with W 1, kernels

Quantitative estimates of propagation of chaos for stochastic systems with W 1, kernels oname manuscrit o. will be inserted by the editor) Quantitative estimates of roagation of chaos for stochastic systems with W, kernels Pierre-Emmanuel Jabin Zhenfu Wang Received: date / Acceted: date Abstract

More information

HetNets: what tools for analysis?

HetNets: what tools for analysis? HetNets: what tools for analysis? Daniela Tuninetti (Ph.D.) Email: danielat@uic.edu Motivation Seven Ways that HetNets are a Cellular Paradigm Shift, by J. Andrews, IEEE Communications Magazine, March

More information

Location of solutions for quasi-linear elliptic equations with general gradient dependence

Location of solutions for quasi-linear elliptic equations with general gradient dependence Electronic Journal of Qualitative Theory of Differential Equations 217, No. 87, 1 1; htts://doi.org/1.14232/ejqtde.217.1.87 www.math.u-szeged.hu/ejqtde/ Location of solutions for quasi-linear ellitic equations

More information

A Note on Massless Quantum Free Scalar Fields. with Negative Energy Density

A Note on Massless Quantum Free Scalar Fields. with Negative Energy Density Adv. Studies Theor. Phys., Vol. 7, 13, no. 1, 549 554 HIKARI Ltd, www.m-hikari.com A Note on Massless Quantum Free Scalar Fields with Negative Energy Density M. A. Grado-Caffaro and M. Grado-Caffaro Scientific

More information

2-D Analysis for Iterative Learning Controller for Discrete-Time Systems With Variable Initial Conditions Yong FANG 1, and Tommy W. S.

2-D Analysis for Iterative Learning Controller for Discrete-Time Systems With Variable Initial Conditions Yong FANG 1, and Tommy W. S. -D Analysis for Iterative Learning Controller for Discrete-ime Systems With Variable Initial Conditions Yong FANG, and ommy W. S. Chow Abstract In this aer, an iterative learning controller alying to linear

More information

Topic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar

Topic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar 15-859(M): Randomized Algorithms Lecturer: Anuam Guta Toic: Lower Bounds on Randomized Algorithms Date: Setember 22, 2004 Scribe: Srinath Sridhar 4.1 Introduction In this lecture, we will first consider

More information

Combining Logistic Regression with Kriging for Mapping the Risk of Occurrence of Unexploded Ordnance (UXO)

Combining Logistic Regression with Kriging for Mapping the Risk of Occurrence of Unexploded Ordnance (UXO) Combining Logistic Regression with Kriging for Maing the Risk of Occurrence of Unexloded Ordnance (UXO) H. Saito (), P. Goovaerts (), S. A. McKenna (2) Environmental and Water Resources Engineering, Deartment

More information

Distributed K-means over Compressed Binary Data

Distributed K-means over Compressed Binary Data 1 Distributed K-means over Comressed Binary Data Elsa DUPRAZ Telecom Bretagne; UMR CNRS 6285 Lab-STICC, Brest, France arxiv:1701.03403v1 [cs.it] 12 Jan 2017 Abstract We consider a networ of binary-valued

More information

Applications to stochastic PDE

Applications to stochastic PDE 15 Alications to stochastic PE In this final lecture we resent some alications of the theory develoed in this course to stochastic artial differential equations. We concentrate on two secific examles:

More information

Asymptotically Optimal Simulation Allocation under Dependent Sampling

Asymptotically Optimal Simulation Allocation under Dependent Sampling Asymtotically Otimal Simulation Allocation under Deendent Samling Xiaoing Xiong The Robert H. Smith School of Business, University of Maryland, College Park, MD 20742-1815, USA, xiaoingx@yahoo.com Sandee

More information

Uniform Law on the Unit Sphere of a Banach Space

Uniform Law on the Unit Sphere of a Banach Space Uniform Law on the Unit Shere of a Banach Sace by Bernard Beauzamy Société de Calcul Mathématique SA Faubourg Saint Honoré 75008 Paris France Setember 008 Abstract We investigate the construction of a

More information

Notes on duality in second order and -order cone otimization E. D. Andersen Λ, C. Roos y, and T. Terlaky z Aril 6, 000 Abstract Recently, the so-calle

Notes on duality in second order and -order cone otimization E. D. Andersen Λ, C. Roos y, and T. Terlaky z Aril 6, 000 Abstract Recently, the so-calle McMaster University Advanced Otimization Laboratory Title: Notes on duality in second order and -order cone otimization Author: Erling D. Andersen, Cornelis Roos and Tamás Terlaky AdvOl-Reort No. 000/8

More information

A Note on Guaranteed Sparse Recovery via l 1 -Minimization

A Note on Guaranteed Sparse Recovery via l 1 -Minimization A Note on Guaranteed Sarse Recovery via l -Minimization Simon Foucart, Université Pierre et Marie Curie Abstract It is roved that every s-sarse vector x C N can be recovered from the measurement vector

More information

SCHUR S LEMMA AND BEST CONSTANTS IN WEIGHTED NORM INEQUALITIES. Gord Sinnamon The University of Western Ontario. December 27, 2003

SCHUR S LEMMA AND BEST CONSTANTS IN WEIGHTED NORM INEQUALITIES. Gord Sinnamon The University of Western Ontario. December 27, 2003 SCHUR S LEMMA AND BEST CONSTANTS IN WEIGHTED NORM INEQUALITIES Gord Sinnamon The University of Western Ontario December 27, 23 Abstract. Strong forms of Schur s Lemma and its converse are roved for mas

More information

THE 2D CASE OF THE BOURGAIN-DEMETER-GUTH ARGUMENT

THE 2D CASE OF THE BOURGAIN-DEMETER-GUTH ARGUMENT THE 2D CASE OF THE BOURGAIN-DEMETER-GUTH ARGUMENT ZANE LI Let e(z) := e 2πiz and for g : [0, ] C and J [0, ], define the extension oerator E J g(x) := g(t)e(tx + t 2 x 2 ) dt. J For a ositive weight ν

More information

Model checking, verification of CTL. One must verify or expel... doubts, and convert them into the certainty of YES [Thomas Carlyle]

Model checking, verification of CTL. One must verify or expel... doubts, and convert them into the certainty of YES [Thomas Carlyle] Chater 5 Model checking, verification of CTL One must verify or exel... doubts, and convert them into the certainty of YES or NO. [Thomas Carlyle] 5. The verification setting Page 66 We introduce linear

More information

k- price auctions and Combination-auctions

k- price auctions and Combination-auctions k- rice auctions and Combination-auctions Martin Mihelich Yan Shu Walnut Algorithms March 6, 219 arxiv:181.3494v3 [q-fin.mf] 5 Mar 219 Abstract We rovide for the first time an exact analytical solution

More information

On Isoperimetric Functions of Probability Measures Having Log-Concave Densities with Respect to the Standard Normal Law

On Isoperimetric Functions of Probability Measures Having Log-Concave Densities with Respect to the Standard Normal Law On Isoerimetric Functions of Probability Measures Having Log-Concave Densities with Resect to the Standard Normal Law Sergey G. Bobkov Abstract Isoerimetric inequalities are discussed for one-dimensional

More information

MATH 2710: NOTES FOR ANALYSIS

MATH 2710: NOTES FOR ANALYSIS MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite

More information

On a class of Rellich inequalities

On a class of Rellich inequalities On a class of Rellich inequalities G. Barbatis A. Tertikas Dedicated to Professor E.B. Davies on the occasion of his 60th birthday Abstract We rove Rellich and imroved Rellich inequalities that involve

More information

Positive Definite Uncertain Homogeneous Matrix Polynomials: Analysis and Application

Positive Definite Uncertain Homogeneous Matrix Polynomials: Analysis and Application BULGARIA ACADEMY OF SCIECES CYBEREICS AD IFORMAIO ECHOLOGIES Volume 9 o 3 Sofia 009 Positive Definite Uncertain Homogeneous Matrix Polynomials: Analysis and Alication Svetoslav Savov Institute of Information

More information

s v 0 q 0 v 1 q 1 v 2 (q 2) v 3 q 3 v 4

s v 0 q 0 v 1 q 1 v 2 (q 2) v 3 q 3 v 4 Discrete Adative Transmission for Fading Channels Lang Lin Λ, Roy D. Yates, Predrag Sasojevic WINLAB, Rutgers University 7 Brett Rd., NJ- fllin, ryates, sasojevg@winlab.rutgers.edu Abstract In this work

More information

EE 508 Lecture 13. Statistical Characterization of Filter Characteristics

EE 508 Lecture 13. Statistical Characterization of Filter Characteristics EE 508 Lecture 3 Statistical Characterization of Filter Characteristics Comonents used to build filters are not recisely redictable L C Temerature Variations Manufacturing Variations Aging Model variations

More information

New Information Measures for the Generalized Normal Distribution

New Information Measures for the Generalized Normal Distribution Information,, 3-7; doi:.339/info3 OPEN ACCESS information ISSN 75-7 www.mdi.com/journal/information Article New Information Measures for the Generalized Normal Distribution Christos P. Kitsos * and Thomas

More information

MATH 361: NUMBER THEORY EIGHTH LECTURE

MATH 361: NUMBER THEORY EIGHTH LECTURE MATH 361: NUMBER THEORY EIGHTH LECTURE 1. Quadratic Recirocity: Introduction Quadratic recirocity is the first result of modern number theory. Lagrange conjectured it in the late 1700 s, but it was first

More information

Numerical Linear Algebra

Numerical Linear Algebra Numerical Linear Algebra Numerous alications in statistics, articularly in the fitting of linear models. Notation and conventions: Elements of a matrix A are denoted by a ij, where i indexes the rows and

More information

Probability Estimates for Multi-class Classification by Pairwise Coupling

Probability Estimates for Multi-class Classification by Pairwise Coupling Probability Estimates for Multi-class Classification by Pairwise Couling Ting-Fan Wu Chih-Jen Lin Deartment of Comuter Science National Taiwan University Taiei 06, Taiwan Ruby C. Weng Deartment of Statistics

More information

Research Article An iterative Algorithm for Hemicontractive Mappings in Banach Spaces

Research Article An iterative Algorithm for Hemicontractive Mappings in Banach Spaces Abstract and Alied Analysis Volume 2012, Article ID 264103, 11 ages doi:10.1155/2012/264103 Research Article An iterative Algorithm for Hemicontractive Maings in Banach Saces Youli Yu, 1 Zhitao Wu, 2 and

More information

Infinite Number of Twin Primes

Infinite Number of Twin Primes dvances in Pure Mathematics, 06, 6, 95-97 htt://wwwscirorg/journal/am ISSN Online: 60-08 ISSN Print: 60-068 Infinite Number of Twin Primes S N Baibeov, Durmagambetov LN Gumilyov Eurasian National University,

More information

Feedback-error control

Feedback-error control Chater 4 Feedback-error control 4.1 Introduction This chater exlains the feedback-error (FBE) control scheme originally described by Kawato [, 87, 8]. FBE is a widely used neural network based controller

More information

RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES

RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES AARON ZWIEBACH Abstract. In this aer we will analyze research that has been recently done in the field of discrete

More information

IMPROVED BOUNDS IN THE SCALED ENFLO TYPE INEQUALITY FOR BANACH SPACES

IMPROVED BOUNDS IN THE SCALED ENFLO TYPE INEQUALITY FOR BANACH SPACES IMPROVED BOUNDS IN THE SCALED ENFLO TYPE INEQUALITY FOR BANACH SPACES OHAD GILADI AND ASSAF NAOR Abstract. It is shown that if (, ) is a Banach sace with Rademacher tye 1 then for every n N there exists

More information

HAUSDORFF MEASURE OF p-cantor SETS

HAUSDORFF MEASURE OF p-cantor SETS Real Analysis Exchange Vol. 302), 2004/2005,. 20 C. Cabrelli, U. Molter, Deartamento de Matemática, Facultad de Cs. Exactas y Naturales, Universidad de Buenos Aires and CONICET, Pabellón I - Ciudad Universitaria,

More information

Haar type and Carleson Constants

Haar type and Carleson Constants ariv:0902.955v [math.fa] Feb 2009 Haar tye and Carleson Constants Stefan Geiss October 30, 208 Abstract Paul F.. Müller For a collection E of dyadic intervals, a Banach sace, and,2] we assume the uer l

More information

Formal Modeling in Cognitive Science Lecture 29: Noisy Channel Model and Applications;

Formal Modeling in Cognitive Science Lecture 29: Noisy Channel Model and Applications; Formal Modeling in Cognitive Science Lecture 9: and ; ; Frank Keller School of Informatics University of Edinburgh keller@inf.ed.ac.uk Proerties of 3 March, 6 Frank Keller Formal Modeling in Cognitive

More information

A construction of bent functions from plateaued functions

A construction of bent functions from plateaued functions A construction of bent functions from lateaued functions Ayça Çeşmelioğlu, Wilfried Meidl Sabancı University, MDBF, Orhanlı, 34956 Tuzla, İstanbul, Turkey. Abstract In this resentation, a technique for

More information

LEIBNIZ SEMINORMS IN PROBABILITY SPACES

LEIBNIZ SEMINORMS IN PROBABILITY SPACES LEIBNIZ SEMINORMS IN PROBABILITY SPACES ÁDÁM BESENYEI AND ZOLTÁN LÉKA Abstract. In this aer we study the (strong) Leibniz roerty of centered moments of bounded random variables. We shall answer a question

More information

Lecture 21: Quantum Communication

Lecture 21: Quantum Communication CS 880: Quantum Information Processing 0/6/00 Lecture : Quantum Communication Instructor: Dieter van Melkebeek Scribe: Mark Wellons Last lecture, we introduced the EPR airs which we will use in this lecture

More information

On a Markov Game with Incomplete Information

On a Markov Game with Incomplete Information On a Markov Game with Incomlete Information Johannes Hörner, Dinah Rosenberg y, Eilon Solan z and Nicolas Vieille x{ January 24, 26 Abstract We consider an examle of a Markov game with lack of information

More information

Complex Analysis Homework 1

Complex Analysis Homework 1 Comlex Analysis Homework 1 Steve Clanton Sarah Crimi January 27, 2009 Problem Claim. If two integers can be exressed as the sum of two squares, then so can their roduct. Proof. Call the two squares that

More information

Economics 101. Lecture 7 - Monopoly and Oligopoly

Economics 101. Lecture 7 - Monopoly and Oligopoly Economics 0 Lecture 7 - Monooly and Oligooly Production Equilibrium After having exlored Walrasian equilibria with roduction in the Robinson Crusoe economy, we will now ste in to a more general setting.

More information

A New Perspective on Learning Linear Separators with Large L q L p Margins

A New Perspective on Learning Linear Separators with Large L q L p Margins A New Persective on Learning Linear Searators with Large L q L Margins Maria-Florina Balcan Georgia Institute of Technology Christoher Berlind Georgia Institute of Technology Abstract We give theoretical

More information

t 0 Xt sup X t p c p inf t 0

t 0 Xt sup X t p c p inf t 0 SHARP MAXIMAL L -ESTIMATES FOR MARTINGALES RODRIGO BAÑUELOS AND ADAM OSȨKOWSKI ABSTRACT. Let X be a suermartingale starting from 0 which has only nonnegative jums. For each 0 < < we determine the best

More information

Amin, Osama; Abediseid, Walid; Alouini, Mohamed-Slim. Institute of Electrical and Electronics Engineers (IEEE)

Amin, Osama; Abediseid, Walid; Alouini, Mohamed-Slim. Institute of Electrical and Electronics Engineers (IEEE) KAUST Reository Outage erformance of cognitive radio systems with Imroer Gaussian signaling Item tye Authors Erint version DOI Publisher Journal Rights Conference Paer Amin Osama; Abediseid Walid; Alouini

More information

ON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS

ON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS #A13 INTEGERS 14 (014) ON THE LEAST SIGNIFICANT ADIC DIGITS OF CERTAIN LUCAS NUMBERS Tamás Lengyel Deartment of Mathematics, Occidental College, Los Angeles, California lengyel@oxy.edu Received: 6/13/13,

More information

1 Riesz Potential and Enbeddings Theorems

1 Riesz Potential and Enbeddings Theorems Riesz Potential and Enbeddings Theorems Given 0 < < and a function u L loc R, the Riesz otential of u is defined by u y I u x := R x y dy, x R We begin by finding an exonent such that I u L R c u L R for

More information

An Introduction to Information Theory: Notes

An Introduction to Information Theory: Notes An Introduction to Information Theory: Notes Jon Shlens jonshlens@ucsd.edu 03 February 003 Preliminaries. Goals. Define basic set-u of information theory. Derive why entroy is the measure of information

More information

Uniform Sample Generations from Contractive Block Toeplitz Matrices

Uniform Sample Generations from Contractive Block Toeplitz Matrices IEEE TRASACTIOS O AUTOMATIC COTROL, VOL 5, O 9, SEPTEMBER 6 559 Uniform Samle Generations from Contractive Bloc Toelitz Matrices Tong Zhou and Chao Feng Abstract This note deals with generating a series

More information

Additive results for the generalized Drazin inverse in a Banach algebra

Additive results for the generalized Drazin inverse in a Banach algebra Additive results for the generalized Drazin inverse in a Banach algebra Dragana S. Cvetković-Ilić Dragan S. Djordjević and Yimin Wei* Abstract In this aer we investigate additive roerties of the generalized

More information

Sets of Real Numbers

Sets of Real Numbers Chater 4 Sets of Real Numbers 4. The Integers Z and their Proerties In our revious discussions about sets and functions the set of integers Z served as a key examle. Its ubiquitousness comes from the fact

More information

Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various Families of R n Norms and Some Open Problems

Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various Families of R n Norms and Some Open Problems Int. J. Oen Problems Comt. Math., Vol. 3, No. 2, June 2010 ISSN 1998-6262; Coyright c ICSRS Publication, 2010 www.i-csrs.org Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various

More information

For q 0; 1; : : : ; `? 1, we have m 0; 1; : : : ; q? 1. The set fh j(x) : j 0; 1; ; : : : ; `? 1g forms a basis for the tness functions dened on the i

For q 0; 1; : : : ; `? 1, we have m 0; 1; : : : ; q? 1. The set fh j(x) : j 0; 1; ; : : : ; `? 1g forms a basis for the tness functions dened on the i Comuting with Haar Functions Sami Khuri Deartment of Mathematics and Comuter Science San Jose State University One Washington Square San Jose, CA 9519-0103, USA khuri@juiter.sjsu.edu Fax: (40)94-500 Keywords:

More information

EE/Stats 376A: Information theory Winter Lecture 5 Jan 24. Lecturer: David Tse Scribe: Michael X, Nima H, Geng Z, Anton J, Vivek B.

EE/Stats 376A: Information theory Winter Lecture 5 Jan 24. Lecturer: David Tse Scribe: Michael X, Nima H, Geng Z, Anton J, Vivek B. EE/Stats 376A: Information theory Winter 207 Lecture 5 Jan 24 Lecturer: David Tse Scribe: Michael X, Nima H, Geng Z, Anton J, Vivek B. 5. Outline Markov chains and stationary distributions Prefix codes

More information

An Analysis of Reliable Classifiers through ROC Isometrics

An Analysis of Reliable Classifiers through ROC Isometrics An Analysis of Reliable Classifiers through ROC Isometrics Stijn Vanderlooy s.vanderlooy@cs.unimaas.nl Ida G. Srinkhuizen-Kuyer kuyer@cs.unimaas.nl Evgueni N. Smirnov smirnov@cs.unimaas.nl MICC-IKAT, Universiteit

More information

Almost 4000 years ago, Babylonians had discovered the following approximation to. x 2 dy 2 =1, (5.0.2)

Almost 4000 years ago, Babylonians had discovered the following approximation to. x 2 dy 2 =1, (5.0.2) Chater 5 Pell s Equation One of the earliest issues graled with in number theory is the fact that geometric quantities are often not rational. For instance, if we take a right triangle with two side lengths

More information

On Wald-Type Optimal Stopping for Brownian Motion

On Wald-Type Optimal Stopping for Brownian Motion J Al Probab Vol 34, No 1, 1997, (66-73) Prerint Ser No 1, 1994, Math Inst Aarhus On Wald-Tye Otimal Stoing for Brownian Motion S RAVRSN and PSKIR The solution is resented to all otimal stoing roblems of

More information

Multi-Operation Multi-Machine Scheduling

Multi-Operation Multi-Machine Scheduling Multi-Oeration Multi-Machine Scheduling Weizhen Mao he College of William and Mary, Williamsburg VA 3185, USA Abstract. In the multi-oeration scheduling that arises in industrial engineering, each job

More information

GOOD MODELS FOR CUBIC SURFACES. 1. Introduction

GOOD MODELS FOR CUBIC SURFACES. 1. Introduction GOOD MODELS FOR CUBIC SURFACES ANDREAS-STEPHAN ELSENHANS Abstract. This article describes an algorithm for finding a model of a hyersurface with small coefficients. It is shown that the aroach works in

More information

HENSEL S LEMMA KEITH CONRAD

HENSEL S LEMMA KEITH CONRAD HENSEL S LEMMA KEITH CONRAD 1. Introduction In the -adic integers, congruences are aroximations: for a and b in Z, a b mod n is the same as a b 1/ n. Turning information modulo one ower of into similar

More information

Estimation of the large covariance matrix with two-step monotone missing data

Estimation of the large covariance matrix with two-step monotone missing data Estimation of the large covariance matrix with two-ste monotone missing data Masashi Hyodo, Nobumichi Shutoh 2, Takashi Seo, and Tatjana Pavlenko 3 Deartment of Mathematical Information Science, Tokyo

More information

x(n) x(n) H (f) y(n) Z -1 Z -1 x(n) ^

x(n) x(n) H (f) y(n) Z -1 Z -1 x(n) ^ SOE FUNDAENTAL POPETIES OF SE FILTE BANKS. Kvanc hcak, Pierre oulin, Kannan amchandran University of Illinois at Urbana-Chamaign Beckman Institute and ECE Deartment 405 N. athews Ave., Urbana, IL 680 Email:

More information

Equivalence of Wilson actions

Equivalence of Wilson actions Prog. Theor. Ex. Phys. 05, 03B0 7 ages DOI: 0.093/te/tv30 Equivalence of Wilson actions Physics Deartment, Kobe University, Kobe 657-850, Jaan E-mail: hsonoda@kobe-u.ac.j Received June 6, 05; Revised August

More information

AN OPTIMAL CONTROL CHART FOR NON-NORMAL PROCESSES

AN OPTIMAL CONTROL CHART FOR NON-NORMAL PROCESSES AN OPTIMAL CONTROL CHART FOR NON-NORMAL PROCESSES Emmanuel Duclos, Maurice Pillet To cite this version: Emmanuel Duclos, Maurice Pillet. AN OPTIMAL CONTROL CHART FOR NON-NORMAL PRO- CESSES. st IFAC Worsho

More information

Information collection on a graph

Information collection on a graph Information collection on a grah Ilya O. Ryzhov Warren Powell February 10, 2010 Abstract We derive a knowledge gradient olicy for an otimal learning roblem on a grah, in which we use sequential measurements

More information

arxiv: v1 [physics.data-an] 26 Oct 2012

arxiv: v1 [physics.data-an] 26 Oct 2012 Constraints on Yield Parameters in Extended Maximum Likelihood Fits Till Moritz Karbach a, Maximilian Schlu b a TU Dortmund, Germany, moritz.karbach@cern.ch b TU Dortmund, Germany, maximilian.schlu@cern.ch

More information