TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS. Yannick DEVILLE

Size: px
Start display at page:

Download "TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS. Yannick DEVILLE"

Transcription

1 TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS Yannick DEVILLE Université Paul Sabatier Laboratoire Acoustique, Métrologie, Instrumentation Bât. 3RB2, 8 Route e Narbonne, 362 Toulouse Ceex, FRANCE yeville@cict.fr ABSTRACT In this paper, we propose two versions of a correlation-base blin source separation (BSS) metho. hereas its basic version operates in the time omain, its extene form is base on the timefrequency (TF) representations of the observe signals an thus applies to much more general conitions. The latter approach consists in ientifying the columns of the (permute scale) mixing matrix in TF areas where this metho etects that a single source occurs. Both the etection an ientification stages of this approach use local correlation parameters of the TF transforms of the observe signals. This BSS metho, calle TIFCORR (for TIme- CORRelation-base BSS), is shown to yiel very accurate separation for linear instantaneous mixtures of real speech signals (output SNR s are above 6 B).. INTRODUCTION Blin source separation (BSS) methos aim at restoring a set of unknown source signals from a set of observe signals which are mixtures of these source signals []-[2]. Most of the approaches that have been evelope to this en are base on Inepenent Component Analysis (ICA). They assume the sources to be ranom stationary statistically inepenent signals, an they recombine the available observe signals so as to obtain statistically inepenent output signals. The latter signals are then equal to the sources, up to some ineterminacies an uner some conitions (especially, at most one source may be Gaussian for such methos to be applicable if no aitional constraints are set on the sources). hereas many ICA methos have been propose in the last 5 years, a few other concepts for BSS have also been consiere. Especially, several investigations base on time-frequency (TF) analysis have been reporte [3]-[]. Two main classes emerge from these TF-BSS methos. The first one is still significantly relate to classical BSS approaches, as it consists of TF aaptations of previously evelope joint-iagonalization methos, with subsequent moifications [3]-[5]. The other class inclues several methos base on the ratio of the TF transforms of the observe signals [6]-[]. Some of these methos require the sources to have no overlap in the TF omain [6]-[8]. On the contrary, only slight ifferences in the TF representations of the sources are requeste by the methos that we propose in []-[]. It shoul be note that, unlike ICA-base BSS methos, TFbase BSS approaches are intrinsically well-suite to non-stationary signals an set no restrictions on the gaussianity of the sources. They are therefore e.g. especially attractive for speech signals. This paper mainly introuces a TF-BSS approach base on a ifferent type of parameter than in the previously reporte TF- BSS methos, i.e. on the local correlation of the observe signals in the TF omain. Before escribing it, we present a purely temporal version of this approach. This aims at first introucing the propose concept in a simpler framework, but also yiels an aitional temporal BSS metho. The latter metho only applies to more restrictive conitions than its subsequent TF extension, as shown below. The remainer of this paper is therefore organize as follows. e efine the propose temporal BSS metho in Section 2 an then introuce its TF extension in Section 3. In Section 4, we escribe tests performe with artificial mixtures of real speech sources. Conclusions are rawn from this investigation in Section 5 an more specific topics are aresse in the Appenix. 2. PROPOSED TEMPORAL APPROACH 2.. Assumptions an efinitions In this section, evote to the propose statistical temporal BSS approach, we assume that unknown, ranom, possibly complexvalue, source signals are mixe in a linear instantaneous way, thus proviing a set of observe signals. This reas in matrix form: () where! " $#&% an ' ( )+*,.-( $#&% an where the matrix consists of all possibly complex-value mixing coefficients /, which is enote 2 / # below. e now introuce the only assumptions that we make in this section with respect to the sources an mixing stage, an the associate efinitions. Definition : a source is sai to occur alone in a time area if the variance of only this source is not equal to zero in this time area. The consiere time area may be restricte to a single time from a theoretical point of view, as we use a statistical approach in this section. However, in practice, all signal means are estimate over time winows an the consiere time area then consists of such a winow. This efinition correspons to the theoretical point of view. From a practical point of view, this means that the ranges of values taken by all other sources are negligible with respect to those of the source that occurs alone.

2 " " " " L L a L Definition 2: a source is sai to be visible in the time omain if there exist as least one time area where it occurs alone. Assumption : i) each source is visible in the time omain an ii) there exist no time areas where the variances of all sources are equal to zero. It shoul be note that the consiere sources are therefore non-stationary 2. Assumption 2: the sources are mutually uncorrelate. Note that we o not require the complete inepenence of the sources, as the approach introuce below only uses their seconorer statistics. Assumption 3: the number of observations is equal to the number of sources. The matrix is then a square matrix. Assumption 4: i) is invertible an ii) none of its elements is equal to zero. For the sake of simplicity, the notations an introuce above irectly refer to the centere version of the signals in this section (whereas they correspon to the original, possibly non-centere, signals in Section 3) Problem statement an solution BSS woul ieally consist in eriving an estimate 3 then etermine the vector of, so as to (2) 3 6 (3) Each component 4 of the vector 4 woul then be equal to the source signal having the same inex, i.e. to (up to estimation errors). It is well known however that this can only be achieve up to two types of ineterminacies, which resp. concern the scale factors an orer with which the source signals appear in the output vector 4. e etail this phenomenon hereafter, as we will use this iscussion in the BSS metho propose below. Any of the mixe signals corresponing to the matrix form () reas exlicitly: 8 ;: / <>=?, (4) However, it may also be expresse in a ifferent way, by applying two transforms to it. The first one consists in changing the orer in which the terms (resp. associate to the sources ; " ) appear in the sum in (4). This is achieve by applying a ) to the inices A in this sum. The above mixe signal then reas:? /.B CED F CED ;F <(>=G;, (5) : The secon transform consists in normalizing the scales of the contributions of each source signal CD ;F with respect to the contribution of this signal in the first mixe signal 3. The latter contribu- 2 More precisely, they are long-term non-stationary, but they shoul be short-term stationary in practice in orer to make it possible to estimate the above-mentione signal means over short time winows. 3 The same principle may of course may applie to any other mixe signal instea. tion is equal to / B CED F CED ;F, so that we express as:? / HBCED F ;: / BCED F / B CD ;F CD ;F <I=? ;, (6) e therefore introuce the notations: J K / BCD ;F CED F (7) M /.BCD ;F / BCD ;F (8) where J L are the permute scale source signals an are the corresponing permute scale mixing coefficients. Eq. (6) then reas:? or in matrix form: : N J <>=?! () OP J () with J QR J J" $# % an OSR #. e thus get back to the initial mixture expression (), except that the mixe signals are now expresse with respect to the permute scale source signals J. The iscussion at the beginning of this subsection may then be reinterprete as follows: assume that we succee in eriving an estimate O 3 of O. Then, by computing the output vector 4 J K O 3 6 ( () OT6 3 4 OP JH (2) all components J of this vector are resp. equal to J (up to estimation errors), i.e. to the contributions of the (possibly) permute sources in the first mixe signal. The two BSS approaches propose in this paper precisely aim at estimating this matrix B, then proviing the corresponing vector 4 J of separate source signals. In the framework of this section, we propose a metho which takes avantage of the above Assumption -i, i.e. of the fact that there exist time areas where each source occurs alone. Such areas shoul first be etecte, so as to operate insie them. As all observe signals are proportional in any such area, an appealing approach for etecting these areas consists in checking the cross-correlation coefficients UVX VY between the observe signals ( an, efine as: ( ]_^ ` UVX)VY Z\[ ZP[ b ] ^ ` ZP[ ) ] ^ ` (3) where ZP[ c` stans for expectation. More precisely, we show in the Appenix that a necessary an sufficient conition for a source to occur alone at time is: U VX V Y >= e\< SfPgh<8ghQ (4) Now consier such an area where a single source occurs, say i. The observe signals (4) then become restricte to:?j/e i i <>=?, (5) Again using correlation parameters associate to these observe signals then makes it possible to ientify part of the matrix O. More precisely, when (5) is met, ZP[ ]_^ ` ZP[ ( ] ^ ` / i / i <kfl ;, (6)

3 s s The set of values thus obtaine for all observations inexe by < ientifies one of the columns of O, as shown by (8) (which also inicates that the first row of O consists of ). By repeately performing such a column ientification for time areas associate to all sources, we eventually ientify the overall matrix O, which completes the propose approach. The overall structure of the BSS metho thus introuce may be summarize as follows. This approach consists of 3 stages, i.e:. The etection stage consists in etecting the time areas where a single source occurs. This is achieve by fining the times is very close (or practical time winows) where UVX VY to for all < SfPgm<8gn. 2. The ientification stage consists in ientifying the columns of O. This is achieve by successively consiering each of the single-source areas etecte in the first stage as follows. The correlation parameters on the left-han sie of (6) yiel a column of O. This column is kept only if its istance with respect to all previously ientifie columns is above a user-efine threshol, showing that the consiere time area oes not contain the same source as the previous ones. The ientification proceure ens when the number of columns of O thus kept becomes equal to the number of sources (this is guarantee to occur because all sources are assume to be visible in the consiere ata) The combination stage consists in recombining the mixe signals accoring to (), in orer to obtain the extracte source signals. 3. TIME-FREQUENCY EXTENSION OF THE PROPOSED APPROACH 3.. Motivations an basic principles The approach that we introuce in the previous section has the avantage of being simple. It may be consiere to be of limite practical applicability however, because it assumes all sources to occur alone in associate time areas, which is a restrictive conition. But it opens the way to a much more powerful metho if we now think in terms of the time-frequency (TF) istributions of the signals, instea of their plain time istributions consiere up to this point. Inee, the TF counterpart of the above approach may be briefly efine as follows: assume that each source occurs alone in a TF area, then it may be expecte from the above presentation that corresponing columns of O may be ientifie in such areas, thus allowing one to eventually perform BSS. The remainer of this section presents this approach in a more formal way. It shoul be stresse again that the TF version of the propose approach that we will thus introuce has a much broaer scope of application that its above temporal version. This is ue to the fact that it only requests each source to occur alone in a small boune TF area, which is a much less restrictive conition that having it alone in a time area, i.e. at all frequencies for that time area. For instance, mixtures of continuous speech signals meet the assumptions consiere here, because most of the energy of these signals is concentrate in a few boune time-varying frequency regions, corresponing to formants. 4 A possibly more robust version of this approach consists in keeping the ientifie columns corresponing to all available single-source areas, an then clustering them, so as to eventually erive each column of o as an average of all its ientifie occurences. It shoul also be note that the consiere time-frequency tools, which are presente in Subsection 3.2, are originally efine in a eterministic framework. This paper uses them in such a framework an concerns two cases i.e: i) either the consiere original sources are eterministic or ii) they are ranom processes, but in the latter case only a single realization of these processes is consiere (this is what is actually available in practice). The following iscussion then concerns this single, eterministic, realization an the tools an properties that we use only require such a realization frequency tools Many TF representations have been propose over the last fifty years an are e.g. presente in [2]-[3]. e here use the shorttime Fourier transform (STFT), esp. because it yiels low computional loa thanks to FFT algorithms an it oes not introuce interference terms, thus keeping the linear instantaneous mixing structure when applie to the consiere observe signals. The STFT of a signal p is obtaine by first multiplying the signal p J by a shifte winowing function q+^ Jr, centere at time. This yiels the winowe signal p J )q ^ J r. This signal epens on two time variables, i.e. the selecte time where the local spectrum of p J is analyze an the running time J. The STFT of p( is then efine as the Fourier transform of the above winowe signal, i.e: ]t, kumv_w p ]J )q ^ ]J r )x6!yz { ]J} (7) 6 w ;$tq is then the contribution of the consiere signal p in the TF area corresponing to the short time winow associate with an to the angular frequency t Assumptions an efinitions The same assumptions an efinitions as in Subsection 2. are consiere hereafter, except that i) we eventually use a eterministic framework, as explaine above, an ii) the temporal concepts use in Subsection 2. are here replace by their TF counterparts, i.e: Definition -TF: a source is sai to occur alone in a TF area if only this source is such that its centere TF transform is not equal to zero everywhere in this TF area. Definition 2-TF: a source is sai to be visible in the TF omain if there exist as least one TF area where it occurs alone. Assumption -TF: i) each source is visible in the TF omain an ii) there exist no TF areas where the centere TF transforms of all sources are equal to zero everywhere. More precisely, each value of a TF transform correspons to a single TF point, associate to a single angular frequency t an to a complete time winow efine by the selecte analysis time an consiere finite-length winowing function q ^ ), as shown in Subsection 3.2. The BSS metho that we propose below then uses means associate to these TF transforms, compute over analysis zones which consist of ajacent TF points. An analysis zone may have any shape in the TF omain. e here focus on the case when it forms a temporal line, i.e. when all its points correspon to the same frequency t an to ajacent (half-overlapping) time winows. The latter winows resp. correspon to a iscrete set of ~ time positions $, with =? ~. This set is enote as hereafter. Each analysis zone is then specifie in terms of the couple ƒ]t,, which completely efines the part of the TF omain associate to this analysis zone.

4 Y Š Š The propose BSS metho then uses the following parameters, associate to the above-efine analysis zones. For any signal, whose TF transform is enote T ;]t,, the mean of its TF transform over the consiere analysis zone is: T $tq? = ~ˆ T $ ]t, (8) : Similarly, for any couple of signals an, whose TF transforms are enote ]t, an ;]t,, the cross-correlation of the (centere versions of the) TF transforms of these signals over the consiere analysis zone is measure either by Š,!Œ ƒ]t, = ~Ž b ]t, r b $tq $# :+ ]t, r ƒ)t, $# ^ () or by the corresponing TF local cross-correlation coefficient: Œ ƒ]t, a Š Š Œ $tq ƒ)t, Š Œ! Œ ƒ]t, (2) The source uncorrelation assumption of Section 2 is then replace by: Assumption 2-TF: over each analysis zone $tq, the (centere) TF transforms of the sources are uncorrelate, i.e: Š, ] ƒ]t, (ep< ma Propose approach As we progressively introuce most require concepts in the previous sections an subsections, the resulting propose TF-BSS metho may now be irectly presente, as the TF aaptation of the overall temporal approach that we escribe at the en of Section 2. It therefore consists of the same 3 stages as the latter approach, aapte to the TF context however, an therefore precee by a pre-processing stage, i.e:. The pre-processing stage consists in eriving the STFT transforms ]t, of the mixe signals, accoring to (7). 2. The etection stage is base on the following property, shown in the Appenix: a necessary an sufficient conition for a source to occur alone in the TF analysis zone ƒ]t,, is: VX VY ƒ]t, >= ep< RfPgm<?gn, (2) In this stage, we therefore etect the analysis zones where a single source occurs by checking in which zones VX VY )t, is very close to for all < SfPgm<Ggh. 3. In the ientification stage, we then ientify the columns of O in single-source analysis zones. This is base on the same approach as in the temporal BSS metho, except that the parameter in (6) is here replace by 5 : VY}VX ƒ]t, VX VX $tq (22) which is equal to / in X/ i when only source i occurs in the consiere TF analysis zone. 5 In the ientification stage, the non-centere version of the crosscorrelation parameters Gš š œgžhÿ( may be use instea an is simpler. 4. In the combination stage, we eventually recombine the mixe signals accoring to (), in orer to obtain the extracte source signals. It shoul be note that the overall structure of this approach has some similarities with the TF approach that we propose in []- []. However, these two approaches use completely ifferent etection an ientification parameters. As the etection an ientification stages of any such approach are inepenent one from the other, we may also erive mixe approaches by using the etection metho of one of the two approaches resp. propose in this paper an in []-[]. an the ientification stage of the other approach. 4. TEST RESULTS e now present tests performe with two artificial linear instantaneous mixtures of two real speech signals, sample at 225 Hz. The mixing matrix is set to:.. (23) The corresponing matrix O is therefore equal to.. or.. (24) epening whether it correspons to a non-permute or permute version of the source signals. The consiere sources signals are shown in Fig.. Although the TF transforms of these source signals have significant ifferences (see Fig. 2 an 3), the TF transforms of the resulting mixe signals are quite similar (see Fig. 4 an 5), ue to the consiere har mixing conitions. Nevertheless, the TF BSS metho propose in this paper succees in separating these signals with a high accuracy, as will now be shown. As an example, the propose approach has been applie with 256 samples per STFT winow an 8 such winows per analysis zone. The estimate matrix O 3 thus obtaine is equal to...8. (25) which is extremely close to the first expression in (24). Consequently, the estimate output signals are almost equal to the (scale an non-permute) sources, as confirme by Fig. 6. More precisely, the Signal/Noise Ratios (SNR s) obtaine for these two estimate sources are resp. equal to 68. an 6.2 B, while the SNR s in the observe mixe signals are equal to 3.6 an B. This clearly emonstrates the high separation capability of the propose approach. 5. CONCLUSION In this paper, we introuce two versions of a correlation-base BSS approach. hereas its first version operates in the time omain, its secon version is base on TF analysis an thus applies to much more general conitions. The latter approach, calle TIFCORR for TIme- CORRelation-base BSS, consists in ientifying the columns of the (permute scale) mixing matrix in TF areas where this metho etects that a single source occurs. e experimentally showe that it yiels very goo performance

5 for linear instantaneous mixtures of real speech sources. Our future investigations will first consist in a more etaile characterization of the experimental performance of the two approaches that we propose in this paper. e will also compare, both from the theoretical an experimental points of view, the TIFCORR metho to the TF ratio-base approach that we introuce in []- [], which has the same structure by uses completely ifferent parameters, as explaine in Section 3. e will also aim at extening the approach propose in this paper to convolutive mixtures. 6. REFERENCES [] A. Hyvarinen, J. Karhunen, E. Oja, Inepenent Component Analysis, iley, New York, 2. [2] J.-F. Caroso, Blin signal separation: statistical principles, Proceeings of the IEEE, vol. 86, no., pp , Oct. 8. [3] A. Belouchrani, M.G. Amin, Blin source separation using time-frequency istributions: algorithm an asymptotic performance, Proc. ICASSP 7, pp , Munich, Germany, April 2-24, 7. [4] A. Belouchrani, M.G. Amin, Blin source separation base on time-frequency signal representations, IEEE Transactions on Signal Processing, vol. 46, no., pp , Nov. 8. [5] A. Holobar, C. Févotte, C. Doncarli, D. Zazula, Single autoterms selection for blin source separation in timefrequency plane, Proc. EUSIPCO 22, Toulouse, France, Sept 3-6, 22. [6] A. Jourjine, S. Rickar, O. Yilmaz, Blin separation of isjoint orthogonal signals: emixing N sources from 2 mixtures, Proc. ICASSP 2, vol. 5, pp , Istanbul, Turkey, June 5-, 2. [7] R. Balan, J. Rosca, Statistical properties of STFT ratios for two channel systems an applications to blin source separation, Proc.ICA 2, Helsinki, Finlan, June 8-22, 2. [8] S. Rickar, R. Balan, J. Rosca, Real-time time-frequency base blin source separation, Proc.ICA 2, pp , San Diego, California, Dec. -3, 2. [] F. Abrar, Y. Deville, P. hite, A new source separation approach base on time-frequency analysis for instantaneous mixtures, Proc. ECM2S 2, pp , Toulouse, France, May 3 - June, 2. [] F. Abrar, Y. Deville, P. hite, From blin source separation to blin source cancellation in the uneretermine case: a new approach base on time-frequency analysis, Proc. ICA 2, pp , San Diego, California, Dec. -3, 2. [] L. Giulieri, N. Thirion-Moreau, P.-Y. Arquès, Blin sources separation using bilinear an quaratic time-frequency representations, Proc. ICA 2, pp , San Diego, California, Dec. -3, 2. [2] F. Hlawatsch, G.F. Boureaux-Bartels, Linear an quaratic time-frequency signal representations, IEEE Signal Processing Magazine, pp. 2-67, April 2. [3] L. Cohen, -frequency istributions - a review, Proceeings of the IEEE, vol. 77, no. 7, pp. 4-8, July 8. A. APPENDIX e here show the valiity of the etection criteria (4) an (2) resp. use in the temporal an TF versions of the propose BSS approach. In the frame of the temporal version of this approach escribe in Section 2, by using the corresponing assumptions it may be shown that, for the mixe signals efine in (4), the cross-correlation coefficient efine in (3) may be expresse as: UVX VY?'!, (26) an resp. stan for the inner a -imensional vector is equal to /, with:? ZP[! ^ ` (27) where the notations prouct an vector norm, an where the A -th component of each Applying Schwarz inequality to (26) then shows that UVX VY g = e\< =gh<8ghq (28) with equality if an only if an are epenent. Let us now analyze this conition at a given time, epening. Due on the values of the source parameters baª«=n to Assumption -ii, at least one of the values is not equal to zero. If only one is not equal to zero, then all vectors are clearly epenent, so that equality hols for all of them in (28) an therefore the etection conition (4) is fulfille. The only case that remains to be consiere is then the situation when at least two values an i are not equal to zero. It may then be shown that if b an were epenent for all < f g < g, then the columns with inices A an ± of the mixing matrix woul be epenent, which is not true ue to Assumption 4-i. Therefore, in the consiere case, at least one pair of vectors } b oes not consist of epenent vectors, so that U VX V Y = an the etection conition (4) is not fulfille. As an overall result, this conition is fulfille if an only if exactly one of the values is not equal to zero at the consiere time, i.e. if only one source occurs at that time. Now, as for the TF version of this approach escribe in Section 3, by using the corresponing assumptions it may be shown that, for the mixe signals efine in (4), the cross-correlation coefficient over an analysis zone efine in (2) may again be expresse accoring to the right-han sie of (26) except that the vectors in (26) here epen on the consiere analysis zone ƒ]t,, an with the same notations except that is replace by ƒ]t,? Š, ƒ)t, (2) with Š ] $ ƒ]t, efine accoring to (). This leas to the same iscussion as above, except that the consiere time is replace by the consiere analysis zone $tq. This eventually yiels the etection criterion (2).

6 2 value of source 2 8 value of source sample inex x sample inex x 4 Fig.. Sample values of both sources Fig. 4. -frequency transform of first mixe signal Fig. 2. -frequency transform of first source. Fig. 5. -frequency transform of secon mixe signal. 2 8 value of output sample inex x Fig. 3. -frequency transform of secon source. value of output sample inex x 4 Fig. 6. Sample values of both estimate source signals.

Temporal and time-frequency correlation-based blind source separation methods. Part I : Determined and underdetermined linear instantaneous mixtures

Temporal and time-frequency correlation-based blind source separation methods. Part I : Determined and underdetermined linear instantaneous mixtures Temporal and time-frequency correlation-based blind source separation methods. Part I : Determined and underdetermined linear instantaneous mixtures Yannick Deville, Matthieu Puigt To cite this version:

More information

Survey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013

Survey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013 Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing

More information

Time-of-Arrival Estimation in Non-Line-Of-Sight Environments

Time-of-Arrival Estimation in Non-Line-Of-Sight Environments 2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor

More information

u!i = a T u = 0. Then S satisfies

u!i = a T u = 0. Then S satisfies Deterministic Conitions for Subspace Ientifiability from Incomplete Sampling Daniel L Pimentel-Alarcón, Nigel Boston, Robert D Nowak University of Wisconsin-Maison Abstract Consier an r-imensional subspace

More information

A NONLINEAR SOURCE SEPARATION APPROACH FOR THE NICOLSKY-EISENMAN MODEL

A NONLINEAR SOURCE SEPARATION APPROACH FOR THE NICOLSKY-EISENMAN MODEL 6th European Signal Processing Conference EUSIPCO 28, Lausanne, Switzerlan, August 25-29, 28, copyright by EURASIP A NONLINEAR SOURCE SEPARATION APPROACH FOR THE NICOLSKY-EISENMAN MODEL Leonaro Tomazeli

More information

Conservation Laws. Chapter Conservation of Energy

Conservation Laws. Chapter Conservation of Energy 20 Chapter 3 Conservation Laws In orer to check the physical consistency of the above set of equations governing Maxwell-Lorentz electroynamics [(2.10) an (2.12) or (1.65) an (1.68)], we examine the action

More information

Least-Squares Regression on Sparse Spaces

Least-Squares Regression on Sparse Spaces Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction

More information

SYNCHRONOUS SEQUENTIAL CIRCUITS

SYNCHRONOUS SEQUENTIAL CIRCUITS CHAPTER SYNCHRONOUS SEUENTIAL CIRCUITS Registers an counters, two very common synchronous sequential circuits, are introuce in this chapter. Register is a igital circuit for storing information. Contents

More information

Schrödinger s equation.

Schrödinger s equation. Physics 342 Lecture 5 Schröinger s Equation Lecture 5 Physics 342 Quantum Mechanics I Wenesay, February 3r, 2010 Toay we iscuss Schröinger s equation an show that it supports the basic interpretation of

More information

Diagonalization of Matrices Dr. E. Jacobs

Diagonalization of Matrices Dr. E. Jacobs Diagonalization of Matrices Dr. E. Jacobs One of the very interesting lessons in this course is how certain algebraic techniques can be use to solve ifferential equations. The purpose of these notes is

More information

Convergence of Random Walks

Convergence of Random Walks Chapter 16 Convergence of Ranom Walks This lecture examines the convergence of ranom walks to the Wiener process. This is very important both physically an statistically, an illustrates the utility of

More information

Generalization of the persistent random walk to dimensions greater than 1

Generalization of the persistent random walk to dimensions greater than 1 PHYSICAL REVIEW E VOLUME 58, NUMBER 6 DECEMBER 1998 Generalization of the persistent ranom walk to imensions greater than 1 Marián Boguñá, Josep M. Porrà, an Jaume Masoliver Departament e Física Fonamental,

More information

Concentration of Measure Inequalities for Compressive Toeplitz Matrices with Applications to Detection and System Identification

Concentration of Measure Inequalities for Compressive Toeplitz Matrices with Applications to Detection and System Identification Concentration of Measure Inequalities for Compressive Toeplitz Matrices with Applications to Detection an System Ientification Borhan M Sananaji, Tyrone L Vincent, an Michael B Wakin Abstract In this paper,

More information

Lower Bounds for the Smoothed Number of Pareto optimal Solutions

Lower Bounds for the Smoothed Number of Pareto optimal Solutions Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.

More information

Introduction to Markov Processes

Introduction to Markov Processes Introuction to Markov Processes Connexions moule m44014 Zzis law Gustav) Meglicki, Jr Office of the VP for Information Technology Iniana University RCS: Section-2.tex,v 1.24 2012/12/21 18:03:08 gustav

More information

arxiv:hep-th/ v1 3 Feb 1993

arxiv:hep-th/ v1 3 Feb 1993 NBI-HE-9-89 PAR LPTHE 9-49 FTUAM 9-44 November 99 Matrix moel calculations beyon the spherical limit arxiv:hep-th/93004v 3 Feb 993 J. Ambjørn The Niels Bohr Institute Blegamsvej 7, DK-00 Copenhagen Ø,

More information

Capacity Analysis of MIMO Systems with Unknown Channel State Information

Capacity Analysis of MIMO Systems with Unknown Channel State Information Capacity Analysis of MIMO Systems with Unknown Channel State Information Jun Zheng an Bhaskar D. Rao Dept. of Electrical an Computer Engineering University of California at San Diego e-mail: juzheng@ucs.eu,

More information

The derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x)

The derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x) Y. D. Chong (2016) MH2801: Complex Methos for the Sciences 1. Derivatives The erivative of a function f(x) is another function, efine in terms of a limiting expression: f (x) f (x) lim x δx 0 f(x + δx)

More information

FREQUENCY ESTIMATION BASED ON ADJACENT DFT BINS

FREQUENCY ESTIMATION BASED ON ADJACENT DFT BINS FREQUENCY ESTIMATION BASED ON ADJACENT DFT BINS Michaël Betser, Patrice Collen, France Telecom R&D 3551 Cesson-Sévigné, France first.name@francetelecom.com Gaël Richar. Telecom Paris 75634 Paris, France

More information

Space-time Linear Dispersion Using Coordinate Interleaving

Space-time Linear Dispersion Using Coordinate Interleaving Space-time Linear Dispersion Using Coorinate Interleaving Jinsong Wu an Steven D Blostein Department of Electrical an Computer Engineering Queen s University, Kingston, Ontario, Canaa, K7L3N6 Email: wujs@ieeeorg

More information

Robust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k

Robust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine

More information

Optimization of Geometries by Energy Minimization

Optimization of Geometries by Energy Minimization Optimization of Geometries by Energy Minimization by Tracy P. Hamilton Department of Chemistry University of Alabama at Birmingham Birmingham, AL 3594-140 hamilton@uab.eu Copyright Tracy P. Hamilton, 1997.

More information

Linear First-Order Equations

Linear First-Order Equations 5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)

More information

Computing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions

Computing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5

More information

Lectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs

Lectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent

More information

Applications of the Wronskian to ordinary linear differential equations

Applications of the Wronskian to ordinary linear differential equations Physics 116C Fall 2011 Applications of the Wronskian to orinary linear ifferential equations Consier a of n continuous functions y i (x) [i = 1,2,3,...,n], each of which is ifferentiable at least n times.

More information

The total derivative. Chapter Lagrangian and Eulerian approaches

The total derivative. Chapter Lagrangian and Eulerian approaches Chapter 5 The total erivative 51 Lagrangian an Eulerian approaches The representation of a flui through scalar or vector fiels means that each physical quantity uner consieration is escribe as a function

More information

Hyperbolic Moment Equations Using Quadrature-Based Projection Methods

Hyperbolic Moment Equations Using Quadrature-Based Projection Methods Hyperbolic Moment Equations Using Quarature-Base Projection Methos J. Koellermeier an M. Torrilhon Department of Mathematics, RWTH Aachen University, Aachen, Germany Abstract. Kinetic equations like the

More information

Optimal Variable-Structure Control Tracking of Spacecraft Maneuvers

Optimal Variable-Structure Control Tracking of Spacecraft Maneuvers Optimal Variable-Structure Control racking of Spacecraft Maneuvers John L. Crassiis 1 Srinivas R. Vaali F. Lanis Markley 3 Introuction In recent years, much effort has been evote to the close-loop esign

More information

Lecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012

Lecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012 CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration

More information

Improving Estimation Accuracy in Nonrandomized Response Questioning Methods by Multiple Answers

Improving Estimation Accuracy in Nonrandomized Response Questioning Methods by Multiple Answers International Journal of Statistics an Probability; Vol 6, No 5; September 207 ISSN 927-7032 E-ISSN 927-7040 Publishe by Canaian Center of Science an Eucation Improving Estimation Accuracy in Nonranomize

More information

On combinatorial approaches to compressed sensing

On combinatorial approaches to compressed sensing On combinatorial approaches to compresse sensing Abolreza Abolhosseini Moghaam an Hayer Raha Department of Electrical an Computer Engineering, Michigan State University, East Lansing, MI, U.S. Emails:{abolhos,raha}@msu.eu

More information

An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback

An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback Journal of Machine Learning Research 8 07) - Submitte /6; Publishe 5/7 An Optimal Algorithm for Banit an Zero-Orer Convex Optimization with wo-point Feeback Oha Shamir Department of Computer Science an

More information

II. First variation of functionals

II. First variation of functionals II. First variation of functionals The erivative of a function being zero is a necessary conition for the etremum of that function in orinary calculus. Let us now tackle the question of the equivalent

More information

Code_Aster. Detection of the singularities and computation of a card of size of elements

Code_Aster. Detection of the singularities and computation of a card of size of elements Titre : Détection es singularités et calcul une carte [...] Date : 0/0/0 Page : /6 Responsable : Josselin DLMAS Clé : R4.0.04 Révision : 9755 Detection of the singularities an computation of a car of size

More information

Strength Analysis of CFRP Composite Material Considering Multiple Fracture Modes

Strength Analysis of CFRP Composite Material Considering Multiple Fracture Modes 5--XXXX Strength Analysis of CFRP Composite Material Consiering Multiple Fracture Moes Author, co-author (Do NOT enter this information. It will be pulle from participant tab in MyTechZone) Affiliation

More information

Math Notes on differentials, the Chain Rule, gradients, directional derivative, and normal vectors

Math Notes on differentials, the Chain Rule, gradients, directional derivative, and normal vectors Math 18.02 Notes on ifferentials, the Chain Rule, graients, irectional erivative, an normal vectors Tangent plane an linear approximation We efine the partial erivatives of f( xy, ) as follows: f f( x+

More information

Balancing Expected and Worst-Case Utility in Contracting Models with Asymmetric Information and Pooling

Balancing Expected and Worst-Case Utility in Contracting Models with Asymmetric Information and Pooling Balancing Expecte an Worst-Case Utility in Contracting Moels with Asymmetric Information an Pooling R.B.O. erkkamp & W. van en Heuvel & A.P.M. Wagelmans Econometric Institute Report EI2018-01 9th January

More information

3.7 Implicit Differentiation -- A Brief Introduction -- Student Notes

3.7 Implicit Differentiation -- A Brief Introduction -- Student Notes Fin these erivatives of these functions: y.7 Implicit Differentiation -- A Brief Introuction -- Stuent Notes tan y sin tan = sin y e = e = Write the inverses of these functions: y tan y sin How woul we

More information

Local Linear ICA for Mutual Information Estimation in Feature Selection

Local Linear ICA for Mutual Information Estimation in Feature Selection Local Linear ICA for Mutual Information Estimation in Feature Selection Tian Lan, Deniz Erogmus Department of Biomeical Engineering, OGI, Oregon Health & Science University, Portlan, Oregon, USA E-mail:

More information

Monte Carlo Methods with Reduced Error

Monte Carlo Methods with Reduced Error Monte Carlo Methos with Reuce Error As has been shown, the probable error in Monte Carlo algorithms when no information about the smoothness of the function is use is Dξ r N = c N. It is important for

More information

Calculus and optimization

Calculus and optimization Calculus an optimization These notes essentially correspon to mathematical appenix 2 in the text. 1 Functions of a single variable Now that we have e ne functions we turn our attention to calculus. A function

More information

Relative Entropy and Score Function: New Information Estimation Relationships through Arbitrary Additive Perturbation

Relative Entropy and Score Function: New Information Estimation Relationships through Arbitrary Additive Perturbation Relative Entropy an Score Function: New Information Estimation Relationships through Arbitrary Aitive Perturbation Dongning Guo Department of Electrical Engineering & Computer Science Northwestern University

More information

Separation of Variables

Separation of Variables Physics 342 Lecture 1 Separation of Variables Lecture 1 Physics 342 Quantum Mechanics I Monay, January 25th, 2010 There are three basic mathematical tools we nee, an then we can begin working on the physical

More information

Table of Common Derivatives By David Abraham

Table of Common Derivatives By David Abraham Prouct an Quotient Rules: Table of Common Derivatives By Davi Abraham [ f ( g( ] = [ f ( ] g( + f ( [ g( ] f ( = g( [ f ( ] g( g( f ( [ g( ] Trigonometric Functions: sin( = cos( cos( = sin( tan( = sec

More information

3 The variational formulation of elliptic PDEs

3 The variational formulation of elliptic PDEs Chapter 3 The variational formulation of elliptic PDEs We now begin the theoretical stuy of elliptic partial ifferential equations an bounary value problems. We will focus on one approach, which is calle

More information

Image Denoising Using Spatial Adaptive Thresholding

Image Denoising Using Spatial Adaptive Thresholding International Journal of Engineering Technology, Management an Applie Sciences Image Denoising Using Spatial Aaptive Thresholing Raneesh Mishra M. Tech Stuent, Department of Electronics & Communication,

More information

Laplacian Cooperative Attitude Control of Multiple Rigid Bodies

Laplacian Cooperative Attitude Control of Multiple Rigid Bodies Laplacian Cooperative Attitue Control of Multiple Rigi Boies Dimos V. Dimarogonas, Panagiotis Tsiotras an Kostas J. Kyriakopoulos Abstract Motivate by the fact that linear controllers can stabilize the

More information

Quantum Mechanics in Three Dimensions

Quantum Mechanics in Three Dimensions Physics 342 Lecture 20 Quantum Mechanics in Three Dimensions Lecture 20 Physics 342 Quantum Mechanics I Monay, March 24th, 2008 We begin our spherical solutions with the simplest possible case zero potential.

More information

'HVLJQ &RQVLGHUDWLRQ LQ 0DWHULDO 6HOHFWLRQ 'HVLJQ 6HQVLWLYLW\,1752'8&7,21

'HVLJQ &RQVLGHUDWLRQ LQ 0DWHULDO 6HOHFWLRQ 'HVLJQ 6HQVLWLYLW\,1752'8&7,21 Large amping in a structural material may be either esirable or unesirable, epening on the engineering application at han. For example, amping is a esirable property to the esigner concerne with limiting

More information

Switching Time Optimization in Discretized Hybrid Dynamical Systems

Switching Time Optimization in Discretized Hybrid Dynamical Systems Switching Time Optimization in Discretize Hybri Dynamical Systems Kathrin Flaßkamp, To Murphey, an Sina Ober-Blöbaum Abstract Switching time optimization (STO) arises in systems that have a finite set

More information

Influence of weight initialization on multilayer perceptron performance

Influence of weight initialization on multilayer perceptron performance Influence of weight initialization on multilayer perceptron performance M. Karouia (1,2) T. Denœux (1) R. Lengellé (1) (1) Université e Compiègne U.R.A. CNRS 817 Heuiasyc BP 649 - F-66 Compiègne ceex -

More information

On conditional moments of high-dimensional random vectors given lower-dimensional projections

On conditional moments of high-dimensional random vectors given lower-dimensional projections Submitte to the Bernoulli arxiv:1405.2183v2 [math.st] 6 Sep 2016 On conitional moments of high-imensional ranom vectors given lower-imensional projections LUKAS STEINBERGER an HANNES LEEB Department of

More information

Lyapunov Functions. V. J. Venkataramanan and Xiaojun Lin. Center for Wireless Systems and Applications. School of Electrical and Computer Engineering,

Lyapunov Functions. V. J. Venkataramanan and Xiaojun Lin. Center for Wireless Systems and Applications. School of Electrical and Computer Engineering, On the Queue-Overflow Probability of Wireless Systems : A New Approach Combining Large Deviations with Lyapunov Functions V. J. Venkataramanan an Xiaojun Lin Center for Wireless Systems an Applications

More information

On the number of isolated eigenvalues of a pair of particles in a quantum wire

On the number of isolated eigenvalues of a pair of particles in a quantum wire On the number of isolate eigenvalues of a pair of particles in a quantum wire arxiv:1812.11804v1 [math-ph] 31 Dec 2018 Joachim Kerner 1 Department of Mathematics an Computer Science FernUniversität in

More information

Analytic Scaling Formulas for Crossed Laser Acceleration in Vacuum

Analytic Scaling Formulas for Crossed Laser Acceleration in Vacuum October 6, 4 ARDB Note Analytic Scaling Formulas for Crosse Laser Acceleration in Vacuum Robert J. Noble Stanfor Linear Accelerator Center, Stanfor University 575 San Hill Roa, Menlo Park, California 945

More information

Error Floors in LDPC Codes: Fast Simulation, Bounds and Hardware Emulation

Error Floors in LDPC Codes: Fast Simulation, Bounds and Hardware Emulation Error Floors in LDPC Coes: Fast Simulation, Bouns an Harware Emulation Pamela Lee, Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Borivoje Nikolic, an Martin J. Wainwright EECS Department University of

More information

Multi-View Clustering via Canonical Correlation Analysis

Multi-View Clustering via Canonical Correlation Analysis Kamalika Chauhuri ITA, UC San Diego, 9500 Gilman Drive, La Jolla, CA Sham M. Kakae Karen Livescu Karthik Sriharan Toyota Technological Institute at Chicago, 6045 S. Kenwoo Ave., Chicago, IL kamalika@soe.ucs.eu

More information

Chapter 6: Energy-Momentum Tensors

Chapter 6: Energy-Momentum Tensors 49 Chapter 6: Energy-Momentum Tensors This chapter outlines the general theory of energy an momentum conservation in terms of energy-momentum tensors, then applies these ieas to the case of Bohm's moel.

More information

A simple model for the small-strain behaviour of soils

A simple model for the small-strain behaviour of soils A simple moel for the small-strain behaviour of soils José Jorge Naer Department of Structural an Geotechnical ngineering, Polytechnic School, University of São Paulo 05508-900, São Paulo, Brazil, e-mail:

More information

LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION

LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische

More information

Euler equations for multiple integrals

Euler equations for multiple integrals Euler equations for multiple integrals January 22, 2013 Contents 1 Reminer of multivariable calculus 2 1.1 Vector ifferentiation......................... 2 1.2 Matrix ifferentiation........................

More information

One-dimensional I test and direction vector I test with array references by induction variable

One-dimensional I test and direction vector I test with array references by induction variable Int. J. High Performance Computing an Networking, Vol. 3, No. 4, 2005 219 One-imensional I test an irection vector I test with array references by inuction variable Minyi Guo School of Computer Science

More information

Implicit Differentiation

Implicit Differentiation Implicit Differentiation Thus far, the functions we have been concerne with have been efine explicitly. A function is efine explicitly if the output is given irectly in terms of the input. For instance,

More information

inflow outflow Part I. Regular tasks for MAE598/494 Task 1

inflow outflow Part I. Regular tasks for MAE598/494 Task 1 MAE 494/598, Fall 2016 Project #1 (Regular tasks = 20 points) Har copy of report is ue at the start of class on the ue ate. The rules on collaboration will be release separately. Please always follow the

More information

Linear and quadratic approximation

Linear and quadratic approximation Linear an quaratic approximation November 11, 2013 Definition: Suppose f is a function that is ifferentiable on an interval I containing the point a. The linear approximation to f at a is the linear function

More information

Leaving Randomness to Nature: d-dimensional Product Codes through the lens of Generalized-LDPC codes

Leaving Randomness to Nature: d-dimensional Product Codes through the lens of Generalized-LDPC codes Leaving Ranomness to Nature: -Dimensional Prouct Coes through the lens of Generalize-LDPC coes Tavor Baharav, Kannan Ramchanran Dept. of Electrical Engineering an Computer Sciences, U.C. Berkeley {tavorb,

More information

Optimal CDMA Signatures: A Finite-Step Approach

Optimal CDMA Signatures: A Finite-Step Approach Optimal CDMA Signatures: A Finite-Step Approach Joel A. Tropp Inst. for Comp. Engr. an Sci. (ICES) 1 University Station C000 Austin, TX 7871 jtropp@ices.utexas.eu Inerjit. S. Dhillon Dept. of Comp. Sci.

More information

Topic 7: Convergence of Random Variables

Topic 7: Convergence of Random Variables Topic 7: Convergence of Ranom Variables Course 003, 2016 Page 0 The Inference Problem So far, our starting point has been a given probability space (S, F, P). We now look at how to generate information

More information

On colour-blind distinguishing colour pallets in regular graphs

On colour-blind distinguishing colour pallets in regular graphs J Comb Optim (2014 28:348 357 DOI 10.1007/s10878-012-9556-x On colour-blin istinguishing colour pallets in regular graphs Jakub Przybyło Publishe online: 25 October 2012 The Author(s 2012. This article

More information

A Novel Decoupled Iterative Method for Deep-Submicron MOSFET RF Circuit Simulation

A Novel Decoupled Iterative Method for Deep-Submicron MOSFET RF Circuit Simulation A Novel ecouple Iterative Metho for eep-submicron MOSFET RF Circuit Simulation CHUAN-SHENG WANG an YIMING LI epartment of Mathematics, National Tsing Hua University, National Nano evice Laboratories, an

More information

Quantum mechanical approaches to the virial

Quantum mechanical approaches to the virial Quantum mechanical approaches to the virial S.LeBohec Department of Physics an Astronomy, University of Utah, Salt Lae City, UT 84112, USA Date: June 30 th 2015 In this note, we approach the virial from

More information

1 dx. where is a large constant, i.e., 1, (7.6) and Px is of the order of unity. Indeed, if px is given by (7.5), the inequality (7.

1 dx. where is a large constant, i.e., 1, (7.6) and Px is of the order of unity. Indeed, if px is given by (7.5), the inequality (7. Lectures Nine an Ten The WKB Approximation The WKB metho is a powerful tool to obtain solutions for many physical problems It is generally applicable to problems of wave propagation in which the frequency

More information

Ramsey numbers of some bipartite graphs versus complete graphs

Ramsey numbers of some bipartite graphs versus complete graphs Ramsey numbers of some bipartite graphs versus complete graphs Tao Jiang, Michael Salerno Miami University, Oxfor, OH 45056, USA Abstract. The Ramsey number r(h, K n ) is the smallest positive integer

More information

Multi-View Clustering via Canonical Correlation Analysis

Multi-View Clustering via Canonical Correlation Analysis Keywors: multi-view learning, clustering, canonical correlation analysis Abstract Clustering ata in high-imensions is believe to be a har problem in general. A number of efficient clustering algorithms

More information

Multi-View Clustering via Canonical Correlation Analysis

Multi-View Clustering via Canonical Correlation Analysis Technical Report TTI-TR-2008-5 Multi-View Clustering via Canonical Correlation Analysis Kamalika Chauhuri UC San Diego Sham M. Kakae Toyota Technological Institute at Chicago ABSTRACT Clustering ata in

More information

An Analytical Expression of the Probability of Error for Relaying with Decode-and-forward

An Analytical Expression of the Probability of Error for Relaying with Decode-and-forward An Analytical Expression of the Probability of Error for Relaying with Decoe-an-forwar Alexanre Graell i Amat an Ingmar Lan Department of Electronics, Institut TELECOM-TELECOM Bretagne, Brest, France Email:

More information

UNIFYING PCA AND MULTISCALE APPROACHES TO FAULT DETECTION AND ISOLATION

UNIFYING PCA AND MULTISCALE APPROACHES TO FAULT DETECTION AND ISOLATION UNIFYING AND MULISCALE APPROACHES O FAUL DEECION AND ISOLAION Seongkyu Yoon an John F. MacGregor Dept. Chemical Engineering, McMaster University, Hamilton Ontario Canaa L8S 4L7 yoons@mcmaster.ca macgreg@mcmaster.ca

More information

. Using a multinomial model gives us the following equation for P d. , with respect to same length term sequences.

. Using a multinomial model gives us the following equation for P d. , with respect to same length term sequences. S 63 Lecture 8 2/2/26 Lecturer Lillian Lee Scribes Peter Babinski, Davi Lin Basic Language Moeling Approach I. Special ase of LM-base Approach a. Recap of Formulas an Terms b. Fixing θ? c. About that Multinomial

More information

Qubit channels that achieve capacity with two states

Qubit channels that achieve capacity with two states Qubit channels that achieve capacity with two states Dominic W. Berry Department of Physics, The University of Queenslan, Brisbane, Queenslan 4072, Australia Receive 22 December 2004; publishe 22 March

More information

Thermal conductivity of graded composites: Numerical simulations and an effective medium approximation

Thermal conductivity of graded composites: Numerical simulations and an effective medium approximation JOURNAL OF MATERIALS SCIENCE 34 (999)5497 5503 Thermal conuctivity of grae composites: Numerical simulations an an effective meium approximation P. M. HUI Department of Physics, The Chinese University

More information

IPA Derivatives for Make-to-Stock Production-Inventory Systems With Backorders Under the (R,r) Policy

IPA Derivatives for Make-to-Stock Production-Inventory Systems With Backorders Under the (R,r) Policy IPA Derivatives for Make-to-Stock Prouction-Inventory Systems With Backorers Uner the (Rr) Policy Yihong Fan a Benamin Melame b Yao Zhao c Yorai Wari Abstract This paper aresses Infinitesimal Perturbation

More information

Lecture 2 Lagrangian formulation of classical mechanics Mechanics

Lecture 2 Lagrangian formulation of classical mechanics Mechanics Lecture Lagrangian formulation of classical mechanics 70.00 Mechanics Principle of stationary action MATH-GA To specify a motion uniquely in classical mechanics, it suffices to give, at some time t 0,

More information

Tractability results for weighted Banach spaces of smooth functions

Tractability results for weighted Banach spaces of smooth functions Tractability results for weighte Banach spaces of smooth functions Markus Weimar Mathematisches Institut, Universität Jena Ernst-Abbe-Platz 2, 07740 Jena, Germany email: markus.weimar@uni-jena.e March

More information

Multi-View Clustering via Canonical Correlation Analysis

Multi-View Clustering via Canonical Correlation Analysis Kamalika Chauhuri ITA, UC San Diego, 9500 Gilman Drive, La Jolla, CA Sham M. Kakae Karen Livescu Karthik Sriharan Toyota Technological Institute at Chicago, 6045 S. Kenwoo Ave., Chicago, IL kamalika@soe.ucs.eu

More information

THE VAN KAMPEN EXPANSION FOR LINKED DUFFING LINEAR OSCILLATORS EXCITED BY COLORED NOISE

THE VAN KAMPEN EXPANSION FOR LINKED DUFFING LINEAR OSCILLATORS EXCITED BY COLORED NOISE Journal of Soun an Vibration (1996) 191(3), 397 414 THE VAN KAMPEN EXPANSION FOR LINKED DUFFING LINEAR OSCILLATORS EXCITED BY COLORED NOISE E. M. WEINSTEIN Galaxy Scientific Corporation, 2500 English Creek

More information

Sparse Reconstruction of Systems of Ordinary Differential Equations

Sparse Reconstruction of Systems of Ordinary Differential Equations Sparse Reconstruction of Systems of Orinary Differential Equations Manuel Mai a, Mark D. Shattuck b,c, Corey S. O Hern c,a,,e, a Department of Physics, Yale University, New Haven, Connecticut 06520, USA

More information

Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs

Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs Ashish Goel Michael Kapralov Sanjeev Khanna Abstract We consier the well-stuie problem of fining a perfect matching in -regular bipartite

More information

Integration Review. May 11, 2013

Integration Review. May 11, 2013 Integration Review May 11, 2013 Goals: Review the funamental theorem of calculus. Review u-substitution. Review integration by parts. Do lots of integration eamples. 1 Funamental Theorem of Calculus In

More information

Necessary and Sufficient Conditions for Sketched Subspace Clustering

Necessary and Sufficient Conditions for Sketched Subspace Clustering Necessary an Sufficient Conitions for Sketche Subspace Clustering Daniel Pimentel-Alarcón, Laura Balzano 2, Robert Nowak University of Wisconsin-Maison, 2 University of Michigan-Ann Arbor Abstract This

More information

BEYOND THE CONSTRUCTION OF OPTIMAL SWITCHING SURFACES FOR AUTONOMOUS HYBRID SYSTEMS. Mauro Boccadoro Magnus Egerstedt Paolo Valigi Yorai Wardi

BEYOND THE CONSTRUCTION OF OPTIMAL SWITCHING SURFACES FOR AUTONOMOUS HYBRID SYSTEMS. Mauro Boccadoro Magnus Egerstedt Paolo Valigi Yorai Wardi BEYOND THE CONSTRUCTION OF OPTIMAL SWITCHING SURFACES FOR AUTONOMOUS HYBRID SYSTEMS Mauro Boccaoro Magnus Egerstet Paolo Valigi Yorai Wari {boccaoro,valigi}@iei.unipg.it Dipartimento i Ingegneria Elettronica

More information

Systems & Control Letters

Systems & Control Letters Systems & ontrol Letters ( ) ontents lists available at ScienceDirect Systems & ontrol Letters journal homepage: www.elsevier.com/locate/sysconle A converse to the eterministic separation principle Jochen

More information

All s Well That Ends Well: Supplementary Proofs

All s Well That Ends Well: Supplementary Proofs All s Well That Ens Well: Guarantee Resolution of Simultaneous Rigi Boy Impact 1:1 All s Well That Ens Well: Supplementary Proofs This ocument complements the paper All s Well That Ens Well: Guarantee

More information

Nonlinear Schrödinger equation with a white-noise potential: Phase-space approach to spread and singularity

Nonlinear Schrödinger equation with a white-noise potential: Phase-space approach to spread and singularity Physica D 212 (2005) 195 204 www.elsevier.com/locate/phys Nonlinear Schröinger equation with a white-noise potential: Phase-space approach to sprea an singularity Albert C. Fannjiang Department of Mathematics,

More information

arxiv: v1 [physics.flu-dyn] 8 May 2014

arxiv: v1 [physics.flu-dyn] 8 May 2014 Energetics of a flui uner the Boussinesq approximation arxiv:1405.1921v1 [physics.flu-yn] 8 May 2014 Kiyoshi Maruyama Department of Earth an Ocean Sciences, National Defense Acaemy, Yokosuka, Kanagawa

More information

Code_Aster. Detection of the singularities and calculation of a map of size of elements

Code_Aster. Detection of the singularities and calculation of a map of size of elements Titre : Détection es singularités et calcul une carte [...] Date : 0/0/0 Page : /6 Responsable : DLMAS Josselin Clé : R4.0.04 Révision : Detection of the singularities an calculation of a map of size of

More information

arxiv: v1 [hep-lat] 19 Nov 2013

arxiv: v1 [hep-lat] 19 Nov 2013 HU-EP-13/69 SFB/CPP-13-98 DESY 13-225 Applicability of Quasi-Monte Carlo for lattice systems arxiv:1311.4726v1 [hep-lat] 19 ov 2013, a,b Tobias Hartung, c Karl Jansen, b Hernan Leovey, Anreas Griewank

More information

Estimation of the Maximum Domination Value in Multi-Dimensional Data Sets

Estimation of the Maximum Domination Value in Multi-Dimensional Data Sets Proceeings of the 4th East-European Conference on Avances in Databases an Information Systems ADBIS) 200 Estimation of the Maximum Domination Value in Multi-Dimensional Data Sets Eleftherios Tiakas, Apostolos.

More information

The Press-Schechter mass function

The Press-Schechter mass function The Press-Schechter mass function To state the obvious: It is important to relate our theories to what we can observe. We have looke at linear perturbation theory, an we have consiere a simple moel for

More information

arxiv:physics/ v2 [physics.ed-ph] 23 Sep 2003

arxiv:physics/ v2 [physics.ed-ph] 23 Sep 2003 Mass reistribution in variable mass systems Célia A. e Sousa an Vítor H. Rorigues Departamento e Física a Universiae e Coimbra, P-3004-516 Coimbra, Portugal arxiv:physics/0211075v2 [physics.e-ph] 23 Sep

More information