On the Sliding-Window Representation in Digital Signal Processing

Size: px
Start display at page:

Download "On the Sliding-Window Representation in Digital Signal Processing"

Transcription

1 868 IEEE TRANSACTIONS ON ACOUSTICS, SPEECH, SIGNAL AND PROCESSING, VOL. ASSP-33, Nb. 4, AUGUST 1985 On the Sliding-Window Representation in Digital Signal Processing MARTIN J. BASTIAANS Abstract-The short-tie Fourier transfor of a discrete-tie signal, which is the Fourier transfor of a windowed version of the signal, is interpreted as a sliding-window spectru. This sliding-window spectru is a function of two variables: a discrete tie index, which represents the position of the window, and a continuous frequency variable. It is shown that the signal can be reconstructed fro the sapled sliding-window spectru, i.e., fro the values at the points of a certain tie-frequency lattice. This sapling lattice is rectangular, and the rectangular cells occupy an area of 27r in the tie-frequency doain. It is shown that an elegant way to represent the signal directly in ters of the saple values of the sliding-window spectru, is in the for of Gabor s signal representation. Therefore, a reciprocal window is introduced, and it is shown how the window and the reciprocal window are related. Gabor s signal representation then expands the signal in ters of properly shifted and odulated versions of the reciprocal window, and the expansion coefficients are just the values of the sapled sliding-window spectru. S INTRODUCTION HORT-TIME Fourier analysis [l] of discrete-tie signals is of considerable interest in a nuber of signalprocessing applications. In order to study spectral properties of speech signals, for instance, the concept of a short-tie Fourier transfor of the signal is very convenient [ 11, [2]. Such a short-tie Fourier transfor is usually constructed by first ultiplying the signal by a window function that is slided to a certain position, and then Fourier transforing the windowed signal. Therefore, we like to consider the short-tie Fourier transfor as a sliding-window representation of the signal. There are other interpretations, of the short-tie Fourier transfor, including a well-knowpfilter bank interpretation [ 11. However, for the purpose of this paper, we find the slidingwindow interpretation to be the ost appropriate, and, to ephasize this, we shall call the short-tie Fourier transfor the sliding-window spectru of the signal. The sliding-window representation of a signal, which is a signal description in tie and frequency siultaneously, is coplete in the sense that the signal can be reconstructed fro its sliding-window spectru [ 11. However, to reconstruct the signal, we need not know the entire slidingwindow spectru. In this paper we show that it suffices to know the values of the sliding-window spectru only at the points of a certain rectangdar lattice in the tie-frequency doain, and we describe how the signal Manuscript received January 17, 1984; revised January 2, The author is with the Technische Hogeschool Eindhoven, Afdeling der Elektrotechniek, Postbus 513, 5600 MB Eindhoven, The Netherlands. can be expressed directly in ters of the values of this sapled sliding-window spectru. This will lead us in a natural way to Gabor s representation [3] of a signal as a superposition of properly shifted and odulated versions of a function that is related to the window. We show a way to deterine this function fro the knowledge of the window, and we elucidate this with soe siple exaples of window functions. SLIDING-WINDOW REPRESENTATION OF DISCRETE-TIME SIGNALS -, - 1, 0, 1, - * a) denote a one-di- Let x(n) (n + =. ensional discrete-tie signal and let w(n) represent a window sequence; the signal and the window ay take coplex values and they need not have a finite extent. We ultiply the signal by a shifted and coplex conjugated version of the window and take the Fourier transfor of the product, thus constructing the function [cf. [l],(6.1)] 03 f(~!, n) = C i(> w*( - n) exp [-j~!]. (1) /85/ $ IEEE Unlike (6.1) in [l], (1) uses a coplex conjugated version of the window; oreover, the window has not been tiereversed. The only reason for doing this is to get ore elegant forulas in the reainder of the paper. We shall callf(q, n) the sliding-window spectru [cf. [4], Section 4.11 of the discrete-tie signal; it is clearly a function of two variables: the tie index n, which is discrete and represents the position of the window, and the frequency variable L!, which is continuous. Of course, as in the case of noral Fourier transfors of discrete-tie signals, the sliding-window spectru f(q, n) is periodic in L! with period 2n. Two choices of window sequences are of special interest. If w(n) vanishes for n # 0, then f(0, n) is proportional to the signal x(n); the sliding-window spectru thus reduces to a pure tie representation of the signal. If, on the other hand, w(n) does not depend on n, thenf(q, 0) is proportional to the Fourier transfor of x(n); the sliding-window spectru then reduces to a pure frequency representation of the signal. In general, however, the sliding-window spectru is an interediate signal description between the pure tie and the pure frequency representation. We can reconstruct the signal x(n) fro its sliding-win- dow spectru f(q, n) in the usual way [cf. [l], (6.6)] by inverse Fourier transforing and taking = n, which

2 BASTIAANS: SLIDING-WINDOW REPRESENTATION 869 yields the inversion forula in which j2= dq * represents integration over one period 2s; of course, the rather ild requireent that w(0) be nonzero should be satisfied. There exists another way of reconstructing the signal fro its sliding-window spectru, viz. by eans of the,inversion forula [cf. [5],(2) and [6],( )l x() = n= -- Iw(n>I 03 cls dq 2n=- 2~ 2n f(q, n) w( - n) exp UQ], (3) which represents the signal as a linear cobination of shifted and odulated versions of the window. However, this linear cobination is not' unique [cf. [6], Section ; indeed, there are any kernels@, n), periodic in Q with period 27r, that satisfy the relationship 1 x() = 'i dq 2n=-co 2~ 2a Iw(n)l n=- (4) - p(fl, n) w( - n) exp ufl]. The representation (3), i.e., choosing the kernel p(q, n) in (4) equal to the sliding-window spectruf(q, n), is the best possible one in the sense that for this choice the L2- nor of p(q, n) takes its iniu value. To see this, we ultiply both sides of (3) and (4) by x*(), su up over all, and conclude fro the equivalence of the right-hand sides of the resulting equations that f (Q, n) and p(q, n) - f(q, n) are orthogonal in the sense 5 -!- 1 dfl {p(q, n) - f(q, n)) f*(q, n) = 0; n=-a 2~ 2a hence, the relationship = -!-. dq - If(fl, n)i2 n=- 21r 2* holds. It will be clear that the L2-nor of p(q, n), i.e., the left-hand side of (6), takes its iniu value if we choose the kernel p(q, n) equal to the sliding-window spectru f(q, n). We can reconstruct the signal fro its sliding-window spectru via the inversion forulas (2) or (3). However, in order to reconstruct the signal, we need not know the entire sliding-window spectru; it suffices to know its values at the points of a certain lattice in the fl-n doain. This will be shown in the next section. SIGNAL RECONSTRUCTION FROM ITS SAMPLED SLLDING-WINDOW SPECTRUM Let N be a positive integer, let the sliding-window spectruf(q, n) be known at the points {Q = k(27r/n), n = N) (k, = - *, -1, 0, 1, * * e), and let the values at these points be denoted by&,; hence, n=- Of course, the array of coefficientsh is periodic in'k with period N. Note that the sapling lattice ($2 = k(27r/n), n = N) is rectangular, and that the rectangular cells occupy an area of 27r in the tie-frequency doain. We shall now deonstrate how the signal can be found when weknow the values fk of the sapled sliding-window spectru (cf. [4, Section 4.21). We first define the functionf(n, w) by a Fourier series with coefficients fk, f(n, w) = =- k=(n) fk exp [-j(wn - k- N n where represents suation over one period N. Note that the functionf(n, w) is periodic in n and w, with periods Nand 27rlN, respectively. The'inverse relationship has the for wn - k N Furtherore, we define the function Z(n, w) by 2(n, w) = 00 = -w x(n f N) exp [-jwn]. (10) Note that the function X(n, w) is periodic in w, with period 2alN, and quasi-periodic in n, with quasi-period N: (8) X(n + N, w) = Z(n, w) exp IjwN]. (1 1 ) Equation (10) provides a eans of representing a one-diensional discrete-tie signal x(n) by a two-diensional tie-frequency function a(n, w) on a rectangle withjinite area 27r. The inverse relationship has the for n(n + N) = - do * Z(n, w) exp UwN]. (12) It will be clear that the variable n in (12) can be restricted

3 870 TRANSACTIONS IEEE ON ACOUSTICS. SPEECH, AND SIGNAL PROCESSING, VOL. ASSP-33, NO. 4, AUGUST 1985 to an interval of length N, with taking on all integer values. With the help of the functions f(n, w), X(n, w) and a siilar w) associated with the window w(n), (7) can be rewritten as f(n, w) = NX(n, w). (13) In fact, we have now solved the proble of reconstructing the signal fro its sapled sliding-window spectru: 1) fro the saple values fk we deterine the function f(n, w) via (8); 2) fro the window w (n) we derive the associated w) by (10); 3) under the assuption that division w) is allowed, the function X(n, w) can be found with the help of (13); and 4) finally, the signal follows fro X(n, w) by eans of the inversion forula (12). A sipler reconstruction ethod will be derived in the next section. Probles ay arise in the case w) has zeros. In that case hoogeneous solutions h"(n, w) ay occur, for which the relation Nh"(n, w) = 0 (14) holds. Equation (14),whichis siilar to (13) with f(n, w) = 0, can be transfored into the relation which is siilar to (7) with fk = 0. Equation (15) shows that the sliding-window spectru of a hoogeneous solution h(n) vanishes at the sapling points (Q = k(2~/n), n = N f. We conclude that the existence of hoogeneous solutions akes the reconstruction of the signal fro its sapled sliding-window spectru nonunique: if x(n) is a possible reconstruction, then x(n) + h(n) is a possible reconstruction, too. RECONSTRUCTION VIA GABOR'S SIGNAL REPRESENTATION In the previous section we showed a way to reconstruct the signal fro its sapled sliding-window spectru; in this section we shall elaborate this a little further, and show a different way of signal reconstruction [cf. [4], Section We therefore introduce a reciprocal window sequence g(n), say, which is defined via its associated function g(n, w) by Ng(n, w) = 1. (16) On substituting fro (16) into (13) we get w, w) = f@, w)g(n, w), (17) which relationship can be transfored into =--Qi k=(n) by expressing f(n, w) in ters of fk via (8), expressing g(n, w) in ters of g(n) via (lo), and using the inversion relationship (12). Note the strong reseblance between (18) and the inversion forula (3). Equation (18), which expresses the signal as a cobination of properly shifted and odulated versions of the reciprocal window, is in the for of Gabor's signal representation [cf. [3], (1.29)]. Gabor's signal representation thus provides a way to express the signal directly in ters of the saple values of the sliding-window spectru. Equation (16) can be transfored into n= - g(n) w*(n - N) exp [-jkzn] 2T = 1 for k==o 0 elsewhere. (19) Fro (19) we conclude that the discrete set of shifted and odulated versions of the window, w(n - N) exp [jk(2n/n) n], and the corresponding set of versions of the reciprocal window, g(n - N) exp [jk(2a/n) n], are, in a certain sense, biorthonoral. Gabor's signal representation ay be nonunique in the case that g(n, w) has zeros. In that case functions Z(n, w) ay occur, for which the relation 2(n, w) g(n, w) = 0 (20) holds. Equation (20), which is siilar to (17) with T(n, w) = 0, can be transfored into the relation which is siilar to (18) with x(n) = 0. Equation (21) shows that certain arrays of nonzero coefficients in Gabor's signal representation ay yield a zero result. We conclude that Gabor's signal representation ay be nonunique: if the array of coefficients fk yields the signal x(n), then fk + zk yields the sae signal. It is easy to forulate Parseval's energy theore which follows directly fro (10) or (12). When we apply Parseval's energy theore to the reciprocal window g(n) and substitute fro (16), we get the relationship N c lg()i2 = c - = - n=<n) 2T Fro (23) we conclude that in the case w) has zeros, the reciprocal window ay not be quadratically suable. This consequence of the occurrence of zeros

4 BASTIAANS: SLIDING-WINDOW REPRESENTATION 871 w) is even worse than the fact that hoogeneous solutions ay be present; it ay cause a very bad convergence of Gabor s signal representation. We conclude this section with an. interpolation forula that enables us to express the sliding-window spectru f(q, n) directly in ters of its saple valuesfk. On substituting fro (18) into (l), we get indeed the relationship T - exp [ -jqn], (24) where we have introduced the interpolation jknction rn -. q(q, n) = g() w*( - n) exp [-jq], (25) =-a which is, in fact, the sliding-window spectru of the reciprocal window. SPECIAL CASES: MAXIMUM AND MINIMUM OVERLAP The cases of axiu and iniu overlap deserve special attention. Maxiu overlap occurs for N = 1: in that case there is axiu overlap between the window w (n) and its direct neighbors w (n N). In the axiuoverlap case, the forulas of the previous two sections can be siplified. Without loosing any inforation, we can take k = 0 in (7), (15), (18), (19), and (21), and take = 0 in (81,(91, (lo), (111,(121,(131, (W, (W, (1% (20), (22), and (23). Equation (7), for instance, then reduces to a siple correlation, h = x(n) w*(n - >, (26) n= -a and so do (15) and (19); note that, oreover, the coefficients fo becoe real when the signal x(n) and the window w (n) are real. Equation (18), on the other hand, reduces to a siple convolution, x(n> = f~g(n - ), (27) =- and so does (21). Furtherore, (8) and (9) then constitute EXAMPLES a noral Fourier transfor pair, and so do (10) and (12). Note that if in the axiu-overlap case the window w (n) To elucidate the concepts of this paper, we consider two vanishes for n # 0, then (7) or (26) tell us that the array siple exaples of window sequences, and deterine the of coefficientsfo is proportional to the signal x@), as can corresponding reciprocal window sequences for different be expected. values of the shifting distance N. Our first exaple is the Miniu overlap occurs when the window has afinite three-point, syetrical window [see Fig. ](a)] extent and the shifting distance N is chosen equal to this finite extent. In that case the forulas of the previous two sections again siplify drastically, and the relationship between the window w (n) and the reciprocal window g(n) takes the siple for If elsewhere; inside the extent of w(n) (29) lo outside the extent of w(n). I (b) 2 see Eq. (32) (dl Fig. 1. Sketches of (a) a three-point, syetrical window w(n), and its corresponding reciprocal window g(n) in the case of (b) axiu overlap, (c) iniu overlap, and (d) partial overlap. It will be clear that inside its finite extent,.the window w(n) should take nonzero values. Note that if in the iniu-overlap case the window is unifor inside its finite extent, and if the signal x(n) vanishes outside the extent of the window, then (7) tells us that the array of coefficients fko is proportional to the discrete Fourier transfor of the signal, as can be expected. note that for a = 0.16, we are dealing with a three-point Haing window. For the axiu-civerlap case (N = l), we find..

5 872 IEEE TRANSACTIONS ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOL. ASSP-33, NO. 4, AUGUST 1985 *(O, 0) = 1 + a cos w, (30) and, hence, the reciprocal window [see Fig. I(b)] g(n) takes the for For the iniu-overlap case (N = 3) the reciprocal window becoes [see Fig. l(c)] - for n = 0 (b) Fig. 2. Sketches of (a) a one-sided, exponential window w(n), and (b) its corresponding reciprocal window g(n). for n = +1 0 elsewhere. For the case of partial overlap (N = 2) we find a \ *(I, w> = - (1 + exp ~2wl), (33) Our second exaple is the one-sided, exponential window [see Fig. 2(a)] exp [an] for n I 0 (a > 0) w(n) = (39) (0 for n > 0. In the interval -(N - 1) 5 n 5 0, the associated function N(n, w) takes the for 2 (34) 1 N(n, w) = exp [an] 1 - exp [-(a - jw)n] (40) (2g(O, w) = 1 and the function Ng(n, w) in this interval thus reads 2 1 2f(l, w) = - a 1 + exp [-j2w] (35) Ng(n, w) = exp [-an] (1 - exp [-(a + jw)n]). (41) and the reciprocal window now takes the for [see Fig. 1(d)l for = 0 for # 0 The reciprocal window g(n) now takes the for [see Fig. 2(b) 1;- exp [-an] for -(N - 1) I n 5 0 (36) Note that in the case of partial overlap, the function N(n, w)haszerosforw = a/2 + (r=, -1,0, 1, * e), and hence a hoogeneous solution h(n) arises. Its associated function &, w) is given by 240, w) = 0 QD 2q1, 0) = Rh c 6 w PR, (37) r= -CQ ( ; ) where 6( -) represents the Dirac delta function. The hoogeneous solution h(n) thus takes the for h(2) = 0 h(2 + 1) = (-1) h. (38) \O elsewhere. (42) We use this exaple to show the possible nonuniqueness of Gabor s signal representation. In the liiting case CY = 0, the function g(n, w) has zeros for w = r(2a/n) (r =..., - 1, 0, 1, e), and an array of coefficients Zk arises whose associated function Z(n, w) in the interval 0 I n 5 N - 1, say, is given by The array Zk,,, thus takes the for and yields a zero result when substituted in Gabor s signal representation. CONCLUSION In this paper we have studied the short-tie Fourier transfor of a discrete-tie signal, or, as we prefer to call

6 BASTIAANS: SLIDING-WINDOW REPRESENTATION 873 it, the sliding-window spectru. Thisliding-window spectru is a function of two variables: a discrete tie index, which represents the position of the window, and a continuous frequency variable. We have shown that the signal can be reconstructed fro the sliding-window spectru, when we know its values at the points of a certain tie-frequency lattice. This lattice is rectangular, and the rectangular cells occopy an area of 27r; hence, the coarser the sapling in tie, the finer the sapling in frequency, and vice versa. The ost elegant for to represent the signal in ters of the saple values of the sliding-window spectru, is by eans of Gabor s signal representation. We therefore had to introduce a reciprocal window, and we have shown how the window and the reciprocal window are related. Gabor s signal representation then expresses the signal as a superposition of properly shifted and odulated versions of the reciprocal window. REFERENCES [3] D. Gabor, Theory of counication, J. insf. Elec. Eng., vol. 93, part 111, pp , [4] M. J. Bastiaans, Signal description by eans of a local frequency spectru, in Transforations in Optical Signal Processing, W. T. Rhodes et al. Eds. Bellingha: Society of Photo-Optical Instruentation Engineers, Proc. SPIE, vol. 373, pp , [SI C. W. Helstro, An expansion of a signal in Gaussian eleentary signals, ieee Trans. Infor. Theory, vol. IT-12, pp , [6] N. G. de Brujin, A theory of generalized functions, with applications to Wigner distribution and Weyl correspondence, Nieuw Archiefvoor Wiskunde vol. 21, no. 3, pp , Martin J. Bastiaans was born in Helond, The Netherlands, in He received the M.Sc. degree in electrical engineering and the Ph.D. degree in technical sciences fro Eindhoven University of Technology, Eindhoven, The Netherlands, in 1969 and 1983, respectively. Since 1969 he has been an Assistant/Associate Professor with the Departent of Electrical Engineering, Eindhoven University of Technology, where he teaches electrical network theory. His research includes a syste-theoretical approach of all kinds of probles that arise in Fourier optics, such as partial coherence, coputer holography, iage processing and optical coputing; his current interest is in describing signals by eans of a local frequency spectru. Dr. Bastiaans is a eber of the Institute of Electrical and Electronics [l] L. R. Rabiner and R. W. Schafer, Digital Processing of Speech Signals. Englewood Cliffs, NJ: Prentice-Hall, 1978, chap. 6. [2] A. V. Oppenhei, Digital processing of speech, in Applications of Digital Signal Processing, A. V. Oppenhei,.. Ed. Englewood Cliffs, NJ: Prentke-Hall, 1978,-chap. 3. Engineers and of the Optical Society of Aerica.

Fourier Series Summary (From Salivahanan et al, 2002)

Fourier Series Summary (From Salivahanan et al, 2002) Fourier Series Suary (Fro Salivahanan et al, ) A periodic continuous signal f(t), - < t

More information

a a a a a a a m a b a b

a a a a a a a m a b a b Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice

More information

Pattern Recognition and Machine Learning. Artificial Neural networks

Pattern Recognition and Machine Learning. Artificial Neural networks Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2016/2017 Lessons 9 11 Jan 2017 Outline Artificial Neural networks Notation...2 Convolutional Neural Networks...3

More information

Chapter 6 1-D Continuous Groups

Chapter 6 1-D Continuous Groups Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:

More information

Generalized Sampling Theorem for Bandpass Signals

Generalized Sampling Theorem for Bandpass Signals Hindawi Publishing Corporation EURASIP Journal on Applied Signal Processing Volue 26, Article ID 59587, Pages 6 DOI 55/ASP/26/59587 Generalized Sapling Theore for Bandpass Signals Ales Prokes Departent

More information

THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT

THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT PETER BORWEIN AND KWOK-KWONG STEPHEN CHOI Abstract. Let n be any integer and ( n ) X F n : a i z i : a i, ± i be the set of all polynoials of height and

More information

Feature Extraction Techniques

Feature Extraction Techniques Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that

More information

Multi-Scale/Multi-Resolution: Wavelet Transform

Multi-Scale/Multi-Resolution: Wavelet Transform Multi-Scale/Multi-Resolution: Wavelet Transfor Proble with Fourier Fourier analysis -- breaks down a signal into constituent sinusoids of different frequencies. A serious drawback in transforing to the

More information

Curious Bounds for Floor Function Sums

Curious Bounds for Floor Function Sums 1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International

More information

Lectures 8 & 9: The Z-transform.

Lectures 8 & 9: The Z-transform. Lectures 8 & 9: The Z-transfor. 1. Definitions. The Z-transfor is defined as a function series (a series in which each ter is a function of one or ore variables: Z[] where is a C valued function f : N

More information

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all

2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either

More information

Non-Parametric Non-Line-of-Sight Identification 1

Non-Parametric Non-Line-of-Sight Identification 1 Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,

More information

In this chapter, we consider several graph-theoretic and probabilistic models

In this chapter, we consider several graph-theoretic and probabilistic models THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions

More information

Probability Distributions

Probability Distributions Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples

More information

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval Unifor Approxiation and Bernstein Polynoials with Coefficients in the Unit Interval Weiang Qian and Marc D. Riedel Electrical and Coputer Engineering, University of Minnesota 200 Union St. S.E. Minneapolis,

More information

Fast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials

Fast Montgomery-like Square Root Computation over GF(2 m ) for All Trinomials Fast Montgoery-like Square Root Coputation over GF( ) for All Trinoials Yin Li a, Yu Zhang a, a Departent of Coputer Science and Technology, Xinyang Noral University, Henan, P.R.China Abstract This letter

More information

DERIVING PROPER UNIFORM PRIORS FOR REGRESSION COEFFICIENTS

DERIVING PROPER UNIFORM PRIORS FOR REGRESSION COEFFICIENTS DERIVING PROPER UNIFORM PRIORS FOR REGRESSION COEFFICIENTS N. van Erp and P. van Gelder Structural Hydraulic and Probabilistic Design, TU Delft Delft, The Netherlands Abstract. In probles of odel coparison

More information

IN modern society that various systems have become more

IN modern society that various systems have become more Developent of Reliability Function in -Coponent Standby Redundant Syste with Priority Based on Maxiu Entropy Principle Ryosuke Hirata, Ikuo Arizono, Ryosuke Toohiro, Satoshi Oigawa, and Yasuhiko Takeoto

More information

1 Bounding the Margin

1 Bounding the Margin COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost

More information

Measuring orbital angular momentum superpositions of light by mode transformation

Measuring orbital angular momentum superpositions of light by mode transformation CHAPTER 7 Measuring orbital angular oentu superpositions of light by ode transforation In chapter 6 we reported on a ethod for easuring orbital angular oentu (OAM) states of light based on the transforation

More information

A New Algorithm for Reactive Electric Power Measurement

A New Algorithm for Reactive Electric Power Measurement A. Abiyev, GAU J. Soc. & Appl. Sci., 2(4), 7-25, 27 A ew Algorith for Reactive Electric Power Measureent Adalet Abiyev Girne Aerican University, Departernt of Electrical Electronics Engineering, Mersin,

More information

The Weierstrass Approximation Theorem

The Weierstrass Approximation Theorem 36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined

More information

1. INTRODUCTION AND RESULTS

1. INTRODUCTION AND RESULTS SOME IDENTITIES INVOLVING THE FIBONACCI NUMBERS AND LUCAS NUMBERS Wenpeng Zhang Research Center for Basic Science, Xi an Jiaotong University Xi an Shaanxi, People s Republic of China (Subitted August 00

More information

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines

Intelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes

More information

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal

More information

Symbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm

Symbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm Acta Polytechnica Hungarica Vol., No., 04 Sybolic Analysis as Universal Tool for Deriving Properties of Non-linear Algoriths Case study of EM Algorith Vladiir Mladenović, Miroslav Lutovac, Dana Porrat

More information

Finite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields

Finite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields Finite fields I talked in class about the field with two eleents F 2 = {, } and we ve used it in various eaples and hoework probles. In these notes I will introduce ore finite fields F p = {,,...,p } for

More information

A Bernstein-Markov Theorem for Normed Spaces

A Bernstein-Markov Theorem for Normed Spaces A Bernstein-Markov Theore for Nored Spaces Lawrence A. Harris Departent of Matheatics, University of Kentucky Lexington, Kentucky 40506-0027 Abstract Let X and Y be real nored linear spaces and let φ :

More information

On Constant Power Water-filling

On Constant Power Water-filling On Constant Power Water-filling Wei Yu and John M. Cioffi Electrical Engineering Departent Stanford University, Stanford, CA94305, U.S.A. eails: {weiyu,cioffi}@stanford.edu Abstract This paper derives

More information

δ 12. We find a highly accurate analytic description of the functions δ 11 ( δ 0, n)

δ 12. We find a highly accurate analytic description of the functions δ 11 ( δ 0, n) Coplete-return spectru for a generalied Rosen-Zener two-state ter-crossing odel T.A. Shahverdyan, D.S. Mogilevtsev, V.M. Red kov, and A.M Ishkhanyan 3 Moscow Institute of Physics and Technology, 47 Dolgoprudni,

More information

About the definition of parameters and regimes of active two-port networks with variable loads on the basis of projective geometry

About the definition of parameters and regimes of active two-port networks with variable loads on the basis of projective geometry About the definition of paraeters and regies of active two-port networks with variable loads on the basis of projective geoetry PENN ALEXANDR nstitute of Electronic Engineering and Nanotechnologies "D

More information

Qualitative Modelling of Time Series Using Self-Organizing Maps: Application to Animal Science

Qualitative Modelling of Time Series Using Self-Organizing Maps: Application to Animal Science Proceedings of the 6th WSEAS International Conference on Applied Coputer Science, Tenerife, Canary Islands, Spain, Deceber 16-18, 2006 183 Qualitative Modelling of Tie Series Using Self-Organizing Maps:

More information

Physics 139B Solutions to Homework Set 3 Fall 2009

Physics 139B Solutions to Homework Set 3 Fall 2009 Physics 139B Solutions to Hoework Set 3 Fall 009 1. Consider a particle of ass attached to a rigid assless rod of fixed length R whose other end is fixed at the origin. The rod is free to rotate about

More information

BEE604 Digital Signal Processing

BEE604 Digital Signal Processing BEE64 Digital Signal Processing Copiled by, Mrs.S.Sherine Assistant Professor Departent of EEE BIHER. COTETS Sapling Discrete Tie Fourier Transfor Properties of DTFT Discrete Fourier Transfor Inverse Discrete

More information

On the Mixed Discretization of the Time Domain Magnetic Field Integral Equation

On the Mixed Discretization of the Time Domain Magnetic Field Integral Equation On the Mixed Discretization of the Tie Doain Magnetic Field Integral Equation H. A. Ülkü 1 I. Bogaert K. Cools 3 F. P. Andriulli 4 H. Bağ 1 Abstract Tie doain agnetic field integral equation (MFIE) is

More information

A Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair

A Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving

More information

A Quantum Observable for the Graph Isomorphism Problem

A Quantum Observable for the Graph Isomorphism Problem A Quantu Observable for the Graph Isoorphis Proble Mark Ettinger Los Alaos National Laboratory Peter Høyer BRICS Abstract Suppose we are given two graphs on n vertices. We define an observable in the Hilbert

More information

Kernel Methods and Support Vector Machines

Kernel Methods and Support Vector Machines Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic

More information

On Conditions for Linearity of Optimal Estimation

On Conditions for Linearity of Optimal Estimation On Conditions for Linearity of Optial Estiation Erah Akyol, Kuar Viswanatha and Kenneth Rose {eakyol, kuar, rose}@ece.ucsb.edu Departent of Electrical and Coputer Engineering University of California at

More information

Time-of-flight Identification of Ions in CESR and ERL

Time-of-flight Identification of Ions in CESR and ERL Tie-of-flight Identification of Ions in CESR and ERL Eric Edwards Departent of Physics, University of Alabaa, Tuscaloosa, AL, 35486 (Dated: August 8, 2008) The accuulation of ion densities in the bea pipe

More information

&& && F( u)! "{ f (x)} = f (x)e # j 2$ u x. f (x)! " #1. F(u,v) = f (x, y) e. f (x, y) = 2D Fourier Transform. Fourier Transform - review.

&& && F( u)! { f (x)} = f (x)e # j 2$ u x. f (x)!  #1. F(u,v) = f (x, y) e. f (x, y) = 2D Fourier Transform. Fourier Transform - review. 2D Fourier Transfor 2-D DFT & Properties 2D Fourier Transfor 1 Fourier Transfor - review 1-D: 2-D: F( u)! "{ f (x)} = f (x)e # j 2$ u x % & #% dx f (x)! " #1 { F(u) } = F(u)e j 2$ u x du F(u,v) = f (x,

More information

Generalized eigenfunctions and a Borel Theorem on the Sierpinski Gasket.

Generalized eigenfunctions and a Borel Theorem on the Sierpinski Gasket. Generalized eigenfunctions and a Borel Theore on the Sierpinski Gasket. Kasso A. Okoudjou, Luke G. Rogers, and Robert S. Strichartz May 26, 2006 1 Introduction There is a well developed theory (see [5,

More information

Determination of Active and Reactive Power in Multi-Phase Systems through Analytical Signals Associated Current and Voltage Signals

Determination of Active and Reactive Power in Multi-Phase Systems through Analytical Signals Associated Current and Voltage Signals 56 ACA ELECROEHNICA Deterination of Active and Reactive Power in ulti-phase Systes through Analytical Signals Associated Current and Voltage Signals Gheorghe ODORAN, Oana UNEAN and Anca BUZURA Suary -

More information

Structured Illumination Super-Resolution Imaging Achieved by Two Steps based on the Modulation of Background Light Field

Structured Illumination Super-Resolution Imaging Achieved by Two Steps based on the Modulation of Background Light Field 017 nd International Seinar on Applied Physics, Optoelectronics and Photonics (APOP 017) ISBN: 978-1-60595-5-3 Structured Illuination Super-Resolution Iaging Achieved by Two Steps based on the Modulation

More information

Efficient Filter Banks And Interpolators

Efficient Filter Banks And Interpolators Efficient Filter Banks And Interpolators A. G. DEMPSTER AND N. P. MURPHY Departent of Electronic Systes University of Westinster 115 New Cavendish St, London W1M 8JS United Kingdo Abstract: - Graphical

More information

Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Time-Varying Jamming Links

Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Time-Varying Jamming Links Vulnerability of MRD-Code-Based Universal Secure Error-Correcting Network Codes under Tie-Varying Jaing Links Jun Kurihara KDDI R&D Laboratories, Inc 2 5 Ohara, Fujiino, Saitaa, 356 8502 Japan Eail: kurihara@kddilabsjp

More information

Random Process Review

Random Process Review Rando Process Review Consider a rando process t, and take k saples. For siplicity, we will set k. However it should ean any nuber of saples. t () t x t, t, t We have a rando vector t, t, t. If we find

More information

LATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS.

LATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS. i LATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS. C. A. CHURCH, Jr. and H. W. GOULD, W. Virginia University, Morgantown, W. V a. In this paper we give

More information

Linear recurrences and asymptotic behavior of exponential sums of symmetric boolean functions

Linear recurrences and asymptotic behavior of exponential sums of symmetric boolean functions Linear recurrences and asyptotic behavior of exponential sus of syetric boolean functions Francis N. Castro Departent of Matheatics University of Puerto Rico, San Juan, PR 00931 francis.castro@upr.edu

More information

Physics 215 Winter The Density Matrix

Physics 215 Winter The Density Matrix Physics 215 Winter 2018 The Density Matrix The quantu space of states is a Hilbert space H. Any state vector ψ H is a pure state. Since any linear cobination of eleents of H are also an eleent of H, it

More information

Characterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone

Characterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone Characterization of the Line Coplexity of Cellular Autoata Generated by Polynoial Transition Rules Bertrand Stone Abstract Cellular autoata are discrete dynaical systes which consist of changing patterns

More information

Principal Components Analysis

Principal Components Analysis Principal Coponents Analysis Cheng Li, Bingyu Wang Noveber 3, 204 What s PCA Principal coponent analysis (PCA) is a statistical procedure that uses an orthogonal transforation to convert a set of observations

More information

Research Article Some Formulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynomials

Research Article Some Formulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynomials Discrete Dynaics in Nature and Society Volue 202, Article ID 927953, pages doi:055/202/927953 Research Article Soe Forulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynoials Yuan He and

More information

General Properties of Radiation Detectors Supplements

General Properties of Radiation Detectors Supplements Phys. 649: Nuclear Techniques Physics Departent Yarouk University Chapter 4: General Properties of Radiation Detectors Suppleents Dr. Nidal M. Ershaidat Overview Phys. 649: Nuclear Techniques Physics Departent

More information

A DISCRETE ZAK TRANSFORM. Christopher Heil. The MITRE Corporation McLean, Virginia Technical Report MTR-89W00128.

A DISCRETE ZAK TRANSFORM. Christopher Heil. The MITRE Corporation McLean, Virginia Technical Report MTR-89W00128. A DISCRETE ZAK TRANSFORM Christopher Heil The MITRE Corporation McLean, Virginia 22102 Technical Report MTR-89W00128 August 1989 Abstract. A discrete version of the Zak transfor is defined and used to

More information

Generalized Queries on Probabilistic Context-Free Grammars

Generalized Queries on Probabilistic Context-Free Grammars IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 20, NO. 1, JANUARY 1998 1 Generalized Queries on Probabilistic Context-Free Graars David V. Pynadath and Michael P. Wellan Abstract

More information

NUMERICAL MODELLING OF THE TYRE/ROAD CONTACT

NUMERICAL MODELLING OF THE TYRE/ROAD CONTACT NUMERICAL MODELLING OF THE TYRE/ROAD CONTACT PACS REFERENCE: 43.5.LJ Krister Larsson Departent of Applied Acoustics Chalers University of Technology SE-412 96 Sweden Tel: +46 ()31 772 22 Fax: +46 ()31

More information

MA304 Differential Geometry

MA304 Differential Geometry MA304 Differential Geoetry Hoework 4 solutions Spring 018 6% of the final ark 1. The paraeterised curve αt = t cosh t for t R is called the catenary. Find the curvature of αt. Solution. Fro hoework question

More information

An Approximate Model for the Theoretical Prediction of the Velocity Increase in the Intermediate Ballistics Period

An Approximate Model for the Theoretical Prediction of the Velocity Increase in the Intermediate Ballistics Period An Approxiate Model for the Theoretical Prediction of the Velocity... 77 Central European Journal of Energetic Materials, 205, 2(), 77-88 ISSN 2353-843 An Approxiate Model for the Theoretical Prediction

More information

TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES

TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES S. E. Ahed, R. J. Tokins and A. I. Volodin Departent of Matheatics and Statistics University of Regina Regina,

More information

Detection and Estimation Theory

Detection and Estimation Theory ESE 54 Detection and Estiation Theory Joseph A. O Sullivan Sauel C. Sachs Professor Electronic Systes and Signals Research Laboratory Electrical and Systes Engineering Washington University 11 Urbauer

More information

UNCERTAINTIES IN THE APPLICATION OF ATMOSPHERIC AND ALTITUDE CORRECTIONS AS RECOMMENDED IN IEC STANDARDS

UNCERTAINTIES IN THE APPLICATION OF ATMOSPHERIC AND ALTITUDE CORRECTIONS AS RECOMMENDED IN IEC STANDARDS Paper Published on the16th International Syposiu on High Voltage Engineering, Cape Town, South Africa, 2009 UNCERTAINTIES IN THE APPLICATION OF ATMOSPHERIC AND ALTITUDE CORRECTIONS AS RECOMMENDED IN IEC

More information

Using a De-Convolution Window for Operating Modal Analysis

Using a De-Convolution Window for Operating Modal Analysis Using a De-Convolution Window for Operating Modal Analysis Brian Schwarz Vibrant Technology, Inc. Scotts Valley, CA Mark Richardson Vibrant Technology, Inc. Scotts Valley, CA Abstract Operating Modal Analysis

More information

A note on the multiplication of sparse matrices

A note on the multiplication of sparse matrices Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani

More information

Block designs and statistics

Block designs and statistics Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent

More information

On the summations involving Wigner rotation matrix elements

On the summations involving Wigner rotation matrix elements Journal of Matheatical Cheistry 24 (1998 123 132 123 On the suations involving Wigner rotation atrix eleents Shan-Tao Lai a, Pancracio Palting b, Ying-Nan Chiu b and Harris J. Silverstone c a Vitreous

More information

OBJECTIVES INTRODUCTION

OBJECTIVES INTRODUCTION M7 Chapter 3 Section 1 OBJECTIVES Suarize data using easures of central tendency, such as the ean, edian, ode, and idrange. Describe data using the easures of variation, such as the range, variance, and

More information

Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes

Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes Explicit solution of the polynoial least-squares approxiation proble on Chebyshev extrea nodes Alfredo Eisinberg, Giuseppe Fedele Dipartiento di Elettronica Inforatica e Sisteistica, Università degli Studi

More information

A note on the realignment criterion

A note on the realignment criterion A note on the realignent criterion Chi-Kwong Li 1, Yiu-Tung Poon and Nung-Sing Sze 3 1 Departent of Matheatics, College of Willia & Mary, Williasburg, VA 3185, USA Departent of Matheatics, Iowa State University,

More information

Using EM To Estimate A Probablity Density With A Mixture Of Gaussians

Using EM To Estimate A Probablity Density With A Mixture Of Gaussians Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points

More information

DESIGN OF MECHANICAL SYSTEMS HAVING MAXIMALLY FLAT RESPONSE AT LOW FREQUENCIES

DESIGN OF MECHANICAL SYSTEMS HAVING MAXIMALLY FLAT RESPONSE AT LOW FREQUENCIES DESIGN OF MECHANICAL SYSTEMS HAVING MAXIMALLY FLAT RESPONSE AT LOW FREQUENCIES V.Raachran, Ravi P.Raachran C.S.Gargour Departent of Electrical Coputer Engineering, Concordia University, Montreal, QC, CANADA,

More information

The Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Parameters

The Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Parameters journal of ultivariate analysis 58, 96106 (1996) article no. 0041 The Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Paraeters H. S. Steyn

More information

The Transactional Nature of Quantum Information

The Transactional Nature of Quantum Information The Transactional Nature of Quantu Inforation Subhash Kak Departent of Coputer Science Oklahoa State University Stillwater, OK 7478 ABSTRACT Inforation, in its counications sense, is a transactional property.

More information

A remark on a success rate model for DPA and CPA

A remark on a success rate model for DPA and CPA A reark on a success rate odel for DPA and CPA A. Wieers, BSI Version 0.5 andreas.wieers@bsi.bund.de Septeber 5, 2018 Abstract The success rate is the ost coon evaluation etric for easuring the perforance

More information

The Euler-Maclaurin Formula and Sums of Powers

The Euler-Maclaurin Formula and Sums of Powers DRAFT VOL 79, NO 1, FEBRUARY 26 1 The Euler-Maclaurin Forula and Sus of Powers Michael Z Spivey University of Puget Sound Tacoa, WA 98416 spivey@upsedu Matheaticians have long been intrigued by the su

More information

The Methods of Solution for Constrained Nonlinear Programming

The Methods of Solution for Constrained Nonlinear Programming Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 01-06 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.co The Methods of Solution for Constrained

More information

Polygonal Designs: Existence and Construction

Polygonal Designs: Existence and Construction Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G

More information

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay

More information

Automated Frequency Domain Decomposition for Operational Modal Analysis

Automated Frequency Domain Decomposition for Operational Modal Analysis Autoated Frequency Doain Decoposition for Operational Modal Analysis Rune Brincker Departent of Civil Engineering, University of Aalborg, Sohngaardsholsvej 57, DK-9000 Aalborg, Denark Palle Andersen Structural

More information

Convolutional Codes. Lecture Notes 8: Trellis Codes. Example: K=3,M=2, rate 1/2 code. Figure 95: Convolutional Encoder

Convolutional Codes. Lecture Notes 8: Trellis Codes. Example: K=3,M=2, rate 1/2 code. Figure 95: Convolutional Encoder Convolutional Codes Lecture Notes 8: Trellis Codes In this lecture we discuss construction of signals via a trellis. That is, signals are constructed by labeling the branches of an infinite trellis with

More information

1 Proof of learning bounds

1 Proof of learning bounds COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #4 Scribe: Akshay Mittal February 13, 2013 1 Proof of learning bounds For intuition of the following theore, suppose there exists a

More information

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation

On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation journal of coplexity 6, 459473 (2000) doi:0.006jco.2000.0544, available online at http:www.idealibrary.co on On the Counication Coplexity of Lipschitzian Optiization for the Coordinated Model of Coputation

More information

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis

E0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds

More information

Lecture 9 November 23, 2015

Lecture 9 November 23, 2015 CSC244: Discrepancy Theory in Coputer Science Fall 25 Aleksandar Nikolov Lecture 9 Noveber 23, 25 Scribe: Nick Spooner Properties of γ 2 Recall that γ 2 (A) is defined for A R n as follows: γ 2 (A) = in{r(u)

More information

New upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany.

New upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany. New upper bound for the B-spline basis condition nuber II. A proof of de Boor's 2 -conjecture K. Scherer Institut fur Angewandte Matheati, Universitat Bonn, 535 Bonn, Gerany and A. Yu. Shadrin Coputing

More information

Hee = ~ dxdy\jj+ (x) 'IJ+ (y) u (x- y) \jj (y) \jj (x), V, = ~ dx 'IJ+ (x) \jj (x) V (x), Hii = Z 2 ~ dx dy cp+ (x) cp+ (y) u (x- y) cp (y) cp (x),

Hee = ~ dxdy\jj+ (x) 'IJ+ (y) u (x- y) \jj (y) \jj (x), V, = ~ dx 'IJ+ (x) \jj (x) V (x), Hii = Z 2 ~ dx dy cp+ (x) cp+ (y) u (x- y) cp (y) cp (x), SOVIET PHYSICS JETP VOLUME 14, NUMBER 4 APRIL, 1962 SHIFT OF ATOMIC ENERGY LEVELS IN A PLASMA L. E. PARGAMANIK Khar'kov State University Subitted to JETP editor February 16, 1961; resubitted June 19, 1961

More information

16 Independence Definitions Potential Pitfall Alternative Formulation. mcs-ftl 2010/9/8 0:40 page 431 #437

16 Independence Definitions Potential Pitfall Alternative Formulation. mcs-ftl 2010/9/8 0:40 page 431 #437 cs-ftl 010/9/8 0:40 page 431 #437 16 Independence 16.1 efinitions Suppose that we flip two fair coins siultaneously on opposite sides of a roo. Intuitively, the way one coin lands does not affect the way

More information

Q ESTIMATION WITHIN A FORMATION PROGRAM q_estimation

Q ESTIMATION WITHIN A FORMATION PROGRAM q_estimation Foration Attributes Progra q_estiation Q ESTIMATION WITHIN A FOMATION POGAM q_estiation Estiating Q between stratal slices Progra q_estiation estiate seisic attenuation (1/Q) on coplex stratal slices using

More information

Mechanics Physics 151

Mechanics Physics 151 Mechanics Physics 5 Lecture Oscillations (Chapter 6) What We Did Last Tie Analyzed the otion of a heavy top Reduced into -diensional proble of θ Qualitative behavior Precession + nutation Initial condition

More information

Antenna Saturation Effects on MIMO Capacity

Antenna Saturation Effects on MIMO Capacity Antenna Saturation Effects on MIMO Capacity T S Pollock, T D Abhayapala, and R A Kennedy National ICT Australia Research School of Inforation Sciences and Engineering The Australian National University,

More information

Closed-form evaluations of Fibonacci Lucas reciprocal sums with three factors

Closed-form evaluations of Fibonacci Lucas reciprocal sums with three factors Notes on Nuber Theory Discrete Matheatics Print ISSN 30-32 Online ISSN 2367-827 Vol. 23 207 No. 2 04 6 Closed-for evaluations of Fibonacci Lucas reciprocal sus with three factors Robert Frontczak Lesbank

More information

Four-vector, Dirac spinor representation and Lorentz Transformations

Four-vector, Dirac spinor representation and Lorentz Transformations Available online at www.pelagiaresearchlibrary.co Advances in Applied Science Research, 2012, 3 (2):749-756 Four-vector, Dirac spinor representation and Lorentz Transforations S. B. Khasare 1, J. N. Rateke

More information

Sampling How Big a Sample?

Sampling How Big a Sample? C. G. G. Aitken, 1 Ph.D. Sapling How Big a Saple? REFERENCE: Aitken CGG. Sapling how big a saple? J Forensic Sci 1999;44(4):750 760. ABSTRACT: It is thought that, in a consignent of discrete units, a certain

More information

PHY 171. Lecture 14. (February 16, 2012)

PHY 171. Lecture 14. (February 16, 2012) PHY 171 Lecture 14 (February 16, 212) In the last lecture, we looked at a quantitative connection between acroscopic and icroscopic quantities by deriving an expression for pressure based on the assuptions

More information

arxiv: v1 [math.nt] 14 Sep 2014

arxiv: v1 [math.nt] 14 Sep 2014 ROTATION REMAINDERS P. JAMESON GRABER, WASHINGTON AND LEE UNIVERSITY 08 arxiv:1409.411v1 [ath.nt] 14 Sep 014 Abstract. We study properties of an array of nubers, called the triangle, in which each row

More information

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes

Graphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes Graphical Models in Local, Asyetric Multi-Agent Markov Decision Processes Ditri Dolgov and Edund Durfee Departent of Electrical Engineering and Coputer Science University of Michigan Ann Arbor, MI 48109

More information

Tail Estimation of the Spectral Density under Fixed-Domain Asymptotics

Tail Estimation of the Spectral Density under Fixed-Domain Asymptotics Tail Estiation of the Spectral Density under Fixed-Doain Asyptotics Wei-Ying Wu, Chae Young Li and Yiin Xiao Wei-Ying Wu, Departent of Statistics & Probability Michigan State University, East Lansing,

More information

Hyperbolic Horn Helical Mass Spectrometer (3HMS) James G. Hagerman Hagerman Technology LLC & Pacific Environmental Technologies April 2005

Hyperbolic Horn Helical Mass Spectrometer (3HMS) James G. Hagerman Hagerman Technology LLC & Pacific Environmental Technologies April 2005 Hyperbolic Horn Helical Mass Spectroeter (3HMS) Jaes G Hageran Hageran Technology LLC & Pacific Environental Technologies April 5 ABSTRACT This paper describes a new type of ass filter based on the REFIMS

More information

arxiv: v1 [cs.ds] 3 Feb 2014

arxiv: v1 [cs.ds] 3 Feb 2014 arxiv:40.043v [cs.ds] 3 Feb 04 A Bound on the Expected Optiality of Rando Feasible Solutions to Cobinatorial Optiization Probles Evan A. Sultani The Johns Hopins University APL evan@sultani.co http://www.sultani.co/

More information

Optical Properties of Plasmas of High-Z Elements

Optical Properties of Plasmas of High-Z Elements Forschungszentru Karlsruhe Techni und Uwelt Wissenschaftlishe Berichte FZK Optical Properties of Plasas of High-Z Eleents V.Tolach 1, G.Miloshevsy 1, H.Würz Project Kernfusion 1 Heat and Mass Transfer

More information