Supplementary Figure 1. Numeric simulation results under a high level of background noise. Relative

Size: px
Start display at page:

Download "Supplementary Figure 1. Numeric simulation results under a high level of background noise. Relative"

Transcription

1 Suppleentary Inforation Suppleentary Figure. Nueric siulation results under a high level of bacground noise. Relative variance of lifetie estiators, var( ˆ ) /, noralised by the average nuber of photons, EN, is plotted as a function of T/τ for different lifetie fitting algoriths. The bacground noise included in the siulation was 0 ties higher than that used to obtain Figure a. Note that the LE-NF ethod failed to provide robust calculation in this case, which is explained in the rear about LE-NF in Suppleentary Note 5.

2 Suppleentary Figure. Spectral inforation about the LRET dyes. The eission spectru of Eu(TTFA) 3 and the excitation spectru of the hexafluorophosphate salt of cationic couarin show the required overlap for energy transfer.

3 Suppleentary Table. DNA sequences used in the deonstration of ultiplexed detection. Capture Probe Target Probe Nae DNA Sequence(5 to 3 )* odification(5 ) Control TTT GGG TTC CTC CAG ATT GAG GTC TTC HIV TTT GGG GTC ATG TTA TTC CAA ATA TCT EV TTT GGG ATA CTG TTC TCC AAC ATT TAC Aino odifier C HBV TTT GGG ATC ATC CAT ATA ACT GAA AGC HPV-6 TTT GGG AAT GCT AGT GCT TAT GCA GCA HIV AGA AGA TAT TTG GAA TAA CAT GAC EV GGA GTA AAT GTT GGA GAA CAG TAT HBV TTG GCT TTC AGT TAT ATG GAT GAT Biotin HPV-6 ATT TGC TGC ATA AGC ACT AGC ATT * Nucleobases ared in italic are copleentary sequences.

4 Definition of sybols used in the following Suppleentary Notes. β Luinescence decay rate; also as β i t Tie; t 0 N(t) Rando variable as the nuber of events occurring by tie t; also as N (t), N (t) and N (t) t N n τ T P λ λ(t) λ T n T * End tie for each detection channels; 0 < t < t Rando variable as the nuber of events occurred in the th detection channel Observed outcoes for the nuber of events occurred in the th detection channel Total nuber of detection channels Luinescence lifetie; also as τ i Width of every detection channel Probability, depending on the context Intensity (rate) of a hoogeneous Poisson process Intensity (rate) function of a nonhoogeneous Poisson process; also as λ (t) Paraeter for the Poisson distribution of N Rando variable as the elapsed tie between the (n )th and the nth event Rando variable as the waiting tie for a next photon to be eitted N 0 Nuber of eitters on the excited state at t = 0 A Intensity of the luinescence decay; A = N 0 β; also as A i B Intensity of the bacground noise as a hoogeneous Poisson process CRLB Craér Rao Lower Bound L Lielihood function I Fisher inforation atrix J Jacobian atrix for variable substitution x, S Substitutive variables for β and A; x = βt, S = A/β; also as x i and S i N C f(,t) N R Observed outcoe for the total nuber of photons in all channels Coponent in the CRLB related to the detection configuration of and T Rando variable of the total nuber of photons in all channels; N = N(T) Substitutive variable for B; R = BT I * Kullbac-Leibler iniu discriination inforation; also as I j * p,j * τ j γ j Q D, D, D 3 U, V b b i Y X z, z ^ Probability for the jth decay pattern that a photon is collected in the th channel; also for p,j Candidate lifetie value in the jth decay pattern used in the LE-PR algorith Candidate bacground level in the jth decay pattern used in the LE-PR algorith The greatest positive integer satisfying 3Q Partial suation used in the RLD algorith Successive integration (suation) used in the SI algorith Paraeter vector to be solved in the overdeterined equation used in the SI algorith Eleents in b Coefficient vector in the overdeterined equation used in the SI algorith Coefficient atrix in the overdeterined equation used in the SI algorith Auxiliary variables used in the SI algorith for dual-exponential decays Estiator of the paraeter under the caret

5 Suppleentary Note The proble to be solved for lifetie coputation. We consider a syste of a nuber of independent eitters that are all excited at t 0 = 0, and assue that each of the has an identical rate β [s - ] to produce a single photon. Let N(t) represent the total nuber of events i.e. eitted photons that occur by tie t. {N(t), t 0} is a stochastic process influenced by β, and possibly by soe bacground noise as well. For any increental tie series t > 0 ( =,, ), N(t ) are rando variables; so are the nubers of photons in adjacent tie intervals, N = N(t ) N(t - ). In reality, we can only easure the nubers of photons, n ( =,, ), in tie intervals of (0, t ], (t, t ],, (t -, t ], respectively; these intervals are referred to as detection channels used to onitor our syste. We are assuing these channels have equal width T, hence t = T ( = 0,,, ); while T is the entire length of the detection window. We wish to use these observed values to estiate the rate paraeter β, (the reciprocal of the lifetie τ, as shown below). The objectives of this wor are to deterine: ) How the rate paraeter β affects the rando variables N ; ) The best ethod of utilising n to estiate β and thus τ, in ters of accuracy, speed and robustness; 3) The effect of detection configuration, i.e. the selection of T and, upon the above two aspects. Objective () is addressed in Suppleentary Note 4 when discussing the lielihood function. Objective () and (3) are addressed in the ain text.

6 Suppleentary Note Bacground nowledge about the Poisson process. A Poisson process is a counting process {N(t), t 0} of independent events where two events cannot occur siultaneously. In an infinitesial tie interval of (t, t + dt], the probability of a single event is proportional to an intensity λ(t) ties the interval, dp P{ N( t dt) N( t) } ( t) dt (Suppleentary Equation ) If λ(t) λ is a constant, the Poisson process is referred to as hoogeneous. Otherwise, in ore general cases where the intensity λ(t) is a function of tie, the Poisson process is referred to as nonhoogeneous. The following leas about Poisson Process can be found in coon textboos on stochastic processes (e.g. Stochastic Processes, and Introduction to Probability odels, both by S.. Ross). Lea (the Poisson property): For Poisson processes, no atter whether hoogeneous or nonhoogeneous, one of their unique properties is that the rando variables N are independently Poisson distributed with paraeters λ, respectively, denoted as N ~ Po(λ ), so that n e P( N n) n! T ( ) T () t dt (Suppleentary Equation ) In addition, the total nuber of events in all channels, N( T ) N T variable, N(T) ~ Po ( t) dt 0 Poisson-distributed rando variable is equal to its paraeter, therefore, is also Poisson distributed as a rando, and independent with all N. Note that the expected value of a E N,,..., E N( T ) ( t) dt 0 T (Suppleentary Equation 3) Lea (the eoryless property): Let us denote the tie of the first event by T, and the elapsed tie between the (n )th and the nth event by T n for n >. Another unique property, associated with the independent increents of Poisson processes, is that the ties between each pair of consecutive events, T n, are independent rando variables. In particular, for hoogeneous Poisson process with a constant intensity λ, T n have identical exponential distribution with paraeter λ, denoted as T n ~ Exp(λ), i.i.d. for any positive integer n.

7 Their probability density function is d t p( t) P( Tn t) e, t 0 (Suppleentary Equation 4) dt Note that the expected value of an exponential-distributed rando variable is equal to the reciprocal of its paraeter, therefore ET n (Suppleentary Equation 5) Lea 3 (the additivity property): If {N (t), t 0} and {N (t), t 0} are independent Poisson processes, with respective intensity functions λ (t) and λ (t), {N (t) = N (t) + N (t), t 0} is also a Poisson process with intensity function λ (t) + λ (t). It is obvious that the su Poisson process is hoogeneous if only both Poisson processes are hoogeneous; otherwise it is nonhoogeneous.

8 Suppleentary Note 3 The Poisson process behind fluorescence/luinescence. Here we suarise the atheatical odel of fluorescence/luinescence intensity in our syste under exaination. Step : In quantu echanics it states that β is related to the probability per unit tie that a photon will be eitted, so that dp dt (Suppleentary Equation 6) wherein dp is the differential probability that a photon will be eitted in the infinitesial tie interval dt. (This approach ensures that the nuber of photons actually observed ust be a nonnegative integer). By coparing Suppleentary Equation 6 with Suppleentary Equation, it is apparent that the counting process of eitted photons in this case is a hoogeneous Poisson process, with a constant intensity equals to the decay rate β, as it is well nown. According to Lea, the waiting tie T * for the next photon to be eitted is an exponentially-distributed rando variable satisfying Suppleentary Equation 4, so that t dp( T t) e dt (Suppleentary Equation 7) wherein dp(t) is the differential probability for a next photon to be eitted in the infinitesial interval dt. Note that by using Suppleentary Equation 5, the expected value of T * is given by ET (Suppleentary Equation 8) This indicates the reciprocal of the decay rate reflects the average tie for a photon to be eitted. Thus, this average tie is called the lifetie of the excited state, as denoted by τ. Step : Now let us consider the case that ultiple (N 0 ) eitters exist at excited state. The ties for each of the to eit a photon are rando variables, and these are independently distributed with the identical exponential distribution. Therefore, the probability per unit tie that a photon will be eitted is not only proportional to the decay rate β, but also proportional to the nuber of eitters reaining in the excited state at that tie, which is N 0 e -βt. Thus, if we let A = N 0 β,

9 t t dp N0e dt Ae dt (Suppleentary Equation 9) By coparing Suppleentary Equation 9 with Suppleentary Equation, it is clear that the counting process of luinescence eission with ultiple eitters at the beginning can be regarded as a nonhoogeneous Poisson process, with its intensity function given by () t Ae t (Suppleentary Equation 0) Step 3: In general, this atheatical odel is appropriate not only for onoexponential decays, but also for ultiexponential decays, as well as either with or without bacground noise (which can be treated as an independent hoogeneous Poisson process with a constant intensity B), according to Lea 3. In such case, the intensity function of the nonhoogeneous Poisson process changes to i () t Ae t i B (Suppleentary Equation ) i

10 Suppleentary Note 4 The Craér Rao Lower Bound for lifetie estiators. Principle: The Craér Rao inequality of the estiation theory states that, the lowest possible variance of any unbiased estiators (i.e. rules to calculate estiates for unnown paraeters), called Craér Rao Lower Bound or CRLB in short, is given by the inverse of the Fisher inforation atrix (ref. Fundaentals of Statistical Signal Processing: Estiation Theory, by S.. Kay). We will calculate this CRLB in our odel of onoexponential decay without bacground, as described by Suppleentary Equation 0, where the unnown paraeters are τ ( /β) and A. The lielihood function of τ and A, given the observed nubers of photons in the detection channels n ( =,, ), is equal to the probability of those observed outcoes given those paraeter values, that is L(, A n, n,, n ) P( N n, N n,, N n, A) (Suppleentary Equation ) The Fisher inforation atrix is given by ln L(, A) L(, A) A I (, A) (Suppleentary Equation 3) L(, A) L(, A) A A The Craér Rao inequality states that any unbiased estiators ˆ and  ust satisfy ˆ ˆ cov(, A) I (, A) (Suppleentary Equation 4) In the case if variable substitution is conducted, and if the Jacobian atrix for variable substitution is given by x S J, A( xs, ) (Suppleentary Equation 5) A A x S we get cov( ˆ, Aˆ ) J ( x, S) I ( x, S) J ( x, S) (Suppleentary Equation 6) T, A, A where the Fisher inforation atrix is a function of x and S,

11 ln L ln L x xs I ( xs, ) (Suppleentary Equation 7) ln L ln L xs S Calculation: Assuing our onoexponential decays and the detection configuration described in Suppleentary Note, it is apparent based on Lea that N ~ Po(λ ), with λ derived by using Suppleentary Equation and 0, n e P( N n) n! A e T ( e T ) (Suppleentary Equation 8) Lea also states the independency of N, so that the joint probability function is given by P( N n, N n,, N n) e (Suppleentary Equation 9) n! n By using Suppleentary Equation, the log lielihood function is given by ln L ln P( n, n,, n ) C n ln ln( n!) x x N ln[ S( e )] x n S( e ) ln( n!) (Suppleentary Equation 0) where x = βt, S = A/β; and N C n is the total nuber of collected photons, as an observed outcoe for the rando variable N(T). According to Lea, Suppleentary Equation 3 and 0, N(T) ~ Po S( e x ), thus E N( T ) S( e x ) (Suppleentary Equation ) Taing partial derivatives for Suppleentary Equation 0, we have

12 x ln L e NC n x Se x e ln L N S S ln L N x C x e C x ln L e xs ln L N S S C x e ( e ) x x S e x (Suppleentary Equation ) Substituting Suppleentary Equation into Suppleentary Equation 7, the Fisher inforation atrix (as a function in x and S) can be derived as x x e ( e ) x x S S e e x ( e ) I ( xs, ) (Suppleentary Equation 3) x x e e S The Jacobian atrix for the variable substitution is T 0 (, ) x J, A xs (Suppleentary Equation 4) S x T T Substituting Suppleentary Equation 3 and 4 into Suppleentary Equation 6, we obtain x T e x T S 0 e ˆ ( ˆ x S x T cov, A) x x x x e ( e ) x S x x e ( e ) x x e x e S S e 0 x ( e ) T T ( e ) T (Suppleentary Equation 5) Thus, the variance for any lifetie estiators ˆ (which is equal to the first eleent in the covariance atrix), is liited by ˆ T var( ˆ ) cov ( ˆ, A), (Suppleentary Equation 6) 4 x x Sx e ( e ) x x ( e ) e In other words, the Craér Rao Lower Bound (CRLB) for lifetie (τ) is T CRLB( ) Sx 4 x x e ( e ) x x ( e ) e (Suppleentary Equation 7)

13 Suppleentary Equation 7 can be rewritten with the help of Suppleentary Equation to better reflect the contributing factors to the CRLB, CRLB( ) (, ) E N( T ) f T (Suppleentary Equation 8) wherein CRLB( ) f (, T ) E N( T ) T / T / T e e T / T / ( e ) ( e ) (Suppleentary Equation 9) Note: For siplicity purpose, the rando variable of the total nuber of collected photons is expressed by N, instead of N(T), in the ain text, as well as in the following sections. Rear: The Objective () proposed in Suppleentary Note, which is to deterine how the decay rate β affects the observed outcoes of the rando variables of N, is achieved by the derivation of Suppleentary Equation 9 and 0. The CRLB obtained in Suppleentary Equation 7 9 is applicable to the case without bacground noise. It provides a valuable reference when coparing the accuracy of different lifetie fitting algoriths, since no algorith can achieve a better variance than the CRLB. If a bacground noise baseline is considered in the odel, no close for can be derived for the CRLB. However, fitting algoriths can still be copared to deterine which one is the ost accurate.

14 Suppleentary Note 5 Brief descriptions of the four lifetie fitting algoriths. The detection configuration reains the sae as described in Suppleentary Note. The coputation forulae for each fitting algorith are given for the case of onoexponential decay with bacground noise (for SI, the coputation forula for the case of dual-exponential decay with bacground noise is also derived in Suppleentary Note 6). The rate function of the Poisson process for the onoexponential decay with bacground noise is: t () t Ae B (Suppleentary Equation 30) Thus, for =,,, N ~ Po(λ ), and x x Se ( e ) R EN (Suppleentary Equation 3) where x = βt, S = A/β, R = BT Algorith A. Nonlinear Fitting based on axiu Lielihood Estiation (LE-NF) Due to the introduction of bacground noise, by using Suppleentary Equation 3, the log lielihood function in Suppleentary Equation 0 becoes: ln L( x, S, R) n ln ln( n!) x x x n ln[ Se ( e ) R] S( e ) R ln( n!) (Suppleentary Equation 3) The axiu lielihood estiation requires us to find estiators ˆx, Ŝ and ˆR, so that the log lielihood (lnl) is axiised; in this case the lifetie estiator is thus ˆ T / xˆ. In general, no close-for forula exists for ˆx, therefore it requires solving a nonlinear optiisation proble. This can be realised by a range of nuerical algoriths, such as the Nelder-ead siplex algorith used in our siulation (by finsearch function in ATLAB), or other iterative ethods. Note that the last ter in Suppleentary Equation 3 is constant for a recorded decay curve, and thus can be oitted during coputation. Rear: LE-NF provides supree accuracy even for noisy decay curves if the fluctuations are caused by the nature of Poisson process with wea signals (i.e. shot noise). However, when the noise is fro external

15 bacground (e.g. dar counts), once the signal-to-bacground ratio is insufficient, the accuracy of LE-NF ay be ipaired due to iproper selection of initial values as well as constraint conditions for nonlinear fitting algoriths, which ay find local axia instead of global axia, or, soeties, ay siply fail to converge (refer to Suppleentary Figure ). Algorith B. Pattern Recognition based on axiu Lielihood Estiation (LE-PR) LE-PR is an approach to iprove the robustness of LE, by proposing a discrete set of possible patterns and seeing the pattern with axiu lielihood (the one that loos ost siilar) to the observed data. To achieve this, it requires easuring the extent of siilarity between a proposed pattern and the observed data curve. Siple easureents such as cross correlation could be used; however, the optiised easureent fro a statistic point of view is the Kullbac-Leibler iniu discriination inforation: I j n (Suppleentary Equation 33) nln Np, j in which p,j ( =,, ) is the series of probability for the jth decay pattern that a photon is collected in the th channel, provided it is observed (i.e. p, j ). The observed data has the axiu lielihood of being the jth decay pattern if its iniu discriination inforation I j gives the sallest value of all I *. The values of p,j can be calculated fro a pair of decay paraeters (τ j *, γ j ) for a given detection configuration, in which γ j reflects the aount of bacground noise. If the bacground is excluded, it can be derived that p e ( ) T / j T / j, j T / j e e (Suppleentary Equation 34) When the bacground is considered, we obtain: p ( ) p / (Suppleentary Equation 35), j j, j j Note that the sus (upon ) of p,j as well as p, j are noralised to unity. The candidate patterns are typically selected with a sequence of τ j * (with several levels of γ j ), so that they cover a range where we expect our lifetie to be. In our siulation, τ j * were set as,,, 400 μs; γ j were set

16 as 0, 0.0,, 0.0 for Figure a and up to 0.30 for Suppleentary Figure. Rear: Copared with LE-NF, LE-PR guarantees a robust coputation at slightly reduced precision, depending on the nubers of decay patterns for calculating the iniu discriination inforation. However, the coplexity of LE-PR is quite substantial if high precision is required, especially if it is applied to fit ultiexponential decays, since every extra paraeter introduces one additional diension for the atrix of decay patterns. Algorith C. Rapid Lifetie Deterination (RLD) This ethod inherently taes advantage of a high level of data binning (regardless of the binning pretreatent described in the ain text), so that the lifetie coputation is extreely siple and fast. It partitions the photon counts in different detection channels into three parts: Q Q Q 3Q Q Qx EN S Se RQ E E Qx Qx N Se Se RQ Qx 3Qx N Se Se RQ (Suppleentary Equation 36) in which Q is the greatest positive integer satisfying 3Q. When using the observed n ( =,, 3Q) to substitute for the expected values of the rando variables, we have a lifetie estiator QT ˆ D D ln D D 3 (Suppleentary Equation 37) in which Q Q 3Q. D n, D n, D n 3 Q Q Rear: RLD is probably the fastest and siplest lifetie fitting algorith. However, it is evident that RLD ay provide inaccurate results, depending on the length of the detection window. On one hand, if the window is too short, D D will be siilar to D 3 D, so that the ajor denoinator is approaching zero, causing significant errors in the lifetie estiates. On the other hand, if the window is too long, another denoinator D 3 D approaches zero, also leading to incorrect results. In extree cases when the rando fluctuations of the decay curve are large, physically ipossible results of negative lifeties (exponential growth, if D 3 D greater

17 than D D ) ay be obtained, or the estiator ay have no solution (if either D 3 D or D D becoes negative). Although other odified forulae ay be utilised (ref. S.P. Chan, et al., Analytical Cheistry 73 (8): ), in general RLD is not sufficiently accurate and robust. oreover, it is not flexible enough for decoding lifeties in a large dynaic range, since the length of the detection window has to be altered accordingly in order to optiise the precision for calculating different lifeties. Algorith D. ethod of Successive Integration (SI) For the SI ethod, first consider the total nuber of photons in the first channels. Based on Suppleentary Equation 3, we have: x EN S Se R (Suppleentary Equation 38) On the other hand, Suppleentary Equation 3 also gives Se x EN R x e Substituting Suppleentary Equation 39 into Suppleentary Equation 38 gives (Suppleentary Equation 39) EN R EN S R (Suppleentary Equation 40) x e or alternatively, x x x E N ( e ) E N R( e ) S( e ) R (Suppleentary Equation 4) The observed n ( =,, ) are now used to substitute for the expected values of the rando variables. The ensuing set ( equations) of Suppleentary Equation 4 gives: n U b n U b b3 n U (Suppleentary Equation 4) where U x x x n, b e, b R( e ), b3 S( e ) R. Suppleentary Equation 4 is an overdeterined equation which has the atrix for of Y = Xb. It has an approxiate solution (in the sense of least squares) given by:

18 ˆ ( ) T - T b X X X Y (Suppleentary Equation 43) Hence, the lifetie estiator via the SI is given by ˆ T / ln( b ˆ ). Rear: The nae of Successive Integration coes fro its initial description in 993 by K. Tittelbach-Helrich, in which integration was used for analog wavefors of exponential decays. However, although atheatically rigorous, integration is generally replaced by suation in ost cases, since discrete (sapled) wavefors are typically obtained in reality.

19 Suppleentary Note 6. SI algorith for ultiexponential decays The SI forulae can be generalised to fit ultiexponential decays. As an exaple we now consider a dual-exponential decay with bacground noise. Its rate function of Poisson process is () t Ae A e B (Suppleentary Equation 44) t t Suppleentary Equation 3 now becoes E N S e ( e ) S e ( e ) R (Suppleentary Equation 45) x x x x in which x T, x T, S A /, S A /, R BT. Therefore, l l EN S S e S S e R x x x x e e ( ) x x EN S S S S R e e (Suppleentary Equation 46) Siilarly, we can use the observed n ( =,, ) to substitute for the expected values of the rando variables. Let U n, V x x I, z e and z e. This gives: l l ( ) n zzv ( z z) U zzr ( S S) zz R( z z) zs zs R (Suppleentary Equation 47) or, in the atrix for, n V U b b n V U 3 b3 b 4 n V U ( ) / b5 (Suppleentary Equation 48) Liewise, this overdeterined equation Suppleentary Equation 48 has an approxiate solution ˆb in the sense of least squares. Here, ẑ and ẑ as the two roots of the equation ˆ ˆ 0. Hence, the lifetie z bz b estiates fro the SI is given by ˆ T / ln( zˆ ) and ˆ T / ln( zˆ ). By applying the above integration (suation) in a recursive way thus called Successive Integration one can fit a ultiexponential decay with the nuber of paraeters (including the lifeties, the aplitudes, and the bacground) up to the nuber of detection channels, which is the degree of freedo of the overdeterined syste.

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

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics

ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents

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

An Improved Particle Filter with Applications in Ballistic Target Tracking

An Improved Particle Filter with Applications in Ballistic Target Tracking Sensors & ransducers Vol. 72 Issue 6 June 204 pp. 96-20 Sensors & ransducers 204 by IFSA Publishing S. L. http://www.sensorsportal.co An Iproved Particle Filter with Applications in Ballistic arget racing

More information

Poisson processes and their properties

Poisson processes and their properties Poisson processes and their properties Poisson processes. collection {N(t) : t [, )} of rando variable indexed by tie t is called a continuous-tie stochastic process, Furtherore, we call N(t) a Poisson

More information

Figure 1: Equivalent electric (RC) circuit of a neurons membrane

Figure 1: Equivalent electric (RC) circuit of a neurons membrane Exercise: Leaky integrate and fire odel of neural spike generation This exercise investigates a siplified odel of how neurons spike in response to current inputs, one of the ost fundaental properties of

More information

Practical Bioinformatics

Practical Bioinformatics 5/2/2017 Dictionaries d i c t i o n a r y = { A : T, T : A, G : C, C : G } d i c t i o n a r y [ G ] d i c t i o n a r y [ N ] = N d i c t i o n a r y. h a s k e y ( C ) Dictionaries g e n e t i c C o

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

Support recovery in compressed sensing: An estimation theoretic approach

Support recovery in compressed sensing: An estimation theoretic approach Support recovery in copressed sensing: An estiation theoretic approach Ain Karbasi, Ali Horati, Soheil Mohajer, Martin Vetterli School of Coputer and Counication Sciences École Polytechnique Fédérale de

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

Statistical Logic Cell Delay Analysis Using a Current-based Model

Statistical Logic Cell Delay Analysis Using a Current-based Model Statistical Logic Cell Delay Analysis Using a Current-based Model Hanif Fatei Shahin Nazarian Massoud Pedra Dept. of EE-Systes, University of Southern California, Los Angeles, CA 90089 {fatei, shahin,

More information

Chapter 2 General Properties of Radiation Detectors

Chapter 2 General Properties of Radiation Detectors Med Phys 4RA3, 4RB3/6R3 Radioisotopes and Radiation Methodology -1 Chapter General Properties of Radiation Detectors Ionizing radiation is ost coonly detected by the charge created when radiation interacts

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

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

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

Improving Ground Based Telescope Focus through Joint Parameter Estimation. Maj J. Chris Zingarelli USAF AFIT/ENG

Improving Ground Based Telescope Focus through Joint Parameter Estimation. Maj J. Chris Zingarelli USAF AFIT/ENG Iproving Ground Based Telescope Focus through Joint Paraeter Estiation Maj J Chris Zingarelli USAF AFIT/ENG Lt Col Travis Blake DARPA/TTO - Space Systes Dr Stephen Cain USAF AFIT/ENG Abstract-- Space Surveillance

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

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

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

Ph 20.3 Numerical Solution of Ordinary Differential Equations

Ph 20.3 Numerical Solution of Ordinary Differential Equations Ph 20.3 Nuerical Solution of Ordinary Differential Equations Due: Week 5 -v20170314- This Assignent So far, your assignents have tried to failiarize you with the hardware and software in the Physics Coputing

More information

Randomized Recovery for Boolean Compressed Sensing

Randomized Recovery for Boolean Compressed Sensing Randoized Recovery for Boolean Copressed Sensing Mitra Fatei and Martin Vetterli Laboratory of Audiovisual Counication École Polytechnique Fédéral de Lausanne (EPFL) Eail: {itra.fatei, artin.vetterli}@epfl.ch

More information

STOPPING SIMULATED PATHS EARLY

STOPPING SIMULATED PATHS EARLY Proceedings of the 2 Winter Siulation Conference B.A.Peters,J.S.Sith,D.J.Medeiros,andM.W.Rohrer,eds. STOPPING SIMULATED PATHS EARLY Paul Glasseran Graduate School of Business Colubia University New Yor,

More information

EE5900 Spring Lecture 4 IC interconnect modeling methods Zhuo Feng

EE5900 Spring Lecture 4 IC interconnect modeling methods Zhuo Feng EE59 Spring Parallel LSI AD Algoriths Lecture I interconnect odeling ethods Zhuo Feng. Z. Feng MTU EE59 So far we ve considered only tie doain analyses We ll soon see that it is soeties preferable to odel

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

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

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon

Model Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential

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

Bootstrapping Dependent Data

Bootstrapping Dependent Data Bootstrapping Dependent Data One of the key issues confronting bootstrap resapling approxiations is how to deal with dependent data. Consider a sequence fx t g n t= of dependent rando variables. Clearly

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 Lessons 7 14 Dec 2016 Outline Artificial Neural networks Notation...2 1. Introduction...3... 3 The Artificial

More information

ma x = -bv x + F rod.

ma x = -bv x + F rod. Notes on Dynaical Systes Dynaics is the study of change. The priary ingredients of a dynaical syste are its state and its rule of change (also soeties called the dynaic). Dynaical systes can be continuous

More information

Interactive Markov Models of Evolutionary Algorithms

Interactive Markov Models of Evolutionary Algorithms Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary

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

Ştefan ŞTEFĂNESCU * is the minimum global value for the function h (x)

Ştefan ŞTEFĂNESCU * is the minimum global value for the function h (x) 7Applying Nelder Mead s Optiization Algorith APPLYING NELDER MEAD S OPTIMIZATION ALGORITHM FOR MULTIPLE GLOBAL MINIMA Abstract Ştefan ŞTEFĂNESCU * The iterative deterinistic optiization ethod could not

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

Kinematics and dynamics, a computational approach

Kinematics and dynamics, a computational approach Kineatics and dynaics, a coputational approach We begin the discussion of nuerical approaches to echanics with the definition for the velocity r r ( t t) r ( t) v( t) li li or r( t t) r( t) v( t) t for

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

Force and dynamics with a spring, analytic approach

Force and dynamics with a spring, analytic approach Force and dynaics with a spring, analytic approach It ay strie you as strange that the first force we will discuss will be that of a spring. It is not one of the four Universal forces and we don t use

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

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

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

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths

More information

Ch 12: Variations on Backpropagation

Ch 12: Variations on Backpropagation Ch 2: Variations on Backpropagation The basic backpropagation algorith is too slow for ost practical applications. It ay take days or weeks of coputer tie. We deonstrate why the backpropagation algorith

More information

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE

MSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE Proceeding of the ASME 9 International Manufacturing Science and Engineering Conference MSEC9 October 4-7, 9, West Lafayette, Indiana, USA MSEC9-8466 MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL

More information

Extension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels

Extension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels Extension of CSRSM for the Paraetric Study of the Face Stability of Pressurized Tunnels Guilhe Mollon 1, Daniel Dias 2, and Abdul-Haid Soubra 3, M.ASCE 1 LGCIE, INSA Lyon, Université de Lyon, Doaine scientifique

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 2017 Lessons 7 20 Dec 2017 Outline Artificial Neural networks Notation...2 Introduction...3 Key Equations... 3 Artificial

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

Multiscale Entropy Analysis: A New Method to Detect Determinism in a Time. Series. A. Sarkar and P. Barat. Variable Energy Cyclotron Centre

Multiscale Entropy Analysis: A New Method to Detect Determinism in a Time. Series. A. Sarkar and P. Barat. Variable Energy Cyclotron Centre Multiscale Entropy Analysis: A New Method to Detect Deterinis in a Tie Series A. Sarkar and P. Barat Variable Energy Cyclotron Centre /AF Bidhan Nagar, Kolkata 700064, India PACS nubers: 05.45.Tp, 89.75.-k,

More information

Study on Markov Alternative Renewal Reward. Process for VLSI Cell Partitioning

Study on Markov Alternative Renewal Reward. Process for VLSI Cell Partitioning Int. Journal of Math. Analysis, Vol. 7, 2013, no. 40, 1949-1960 HIKARI Ltd, www.-hikari.co http://dx.doi.org/10.12988/ia.2013.36142 Study on Markov Alternative Renewal Reward Process for VLSI Cell Partitioning

More information

AUTOMATIC DETECTION OF RWIS SENSOR MALFUNCTIONS (PHASE II) Northland Advanced Transportation Systems Research Laboratories Project B: Fiscal Year 2006

AUTOMATIC DETECTION OF RWIS SENSOR MALFUNCTIONS (PHASE II) Northland Advanced Transportation Systems Research Laboratories Project B: Fiscal Year 2006 AUTOMATIC DETECTION OF RWIS SENSOR MALFUNCTIONS (PHASE II) FINAL REPORT Northland Advanced Transportation Systes Research Laboratories Project B: Fiscal Year 2006 Carolyn J. Crouch Donald B. Crouch Richard

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

Numerical Studies of a Nonlinear Heat Equation with Square Root Reaction Term

Numerical Studies of a Nonlinear Heat Equation with Square Root Reaction Term Nuerical Studies of a Nonlinear Heat Equation with Square Root Reaction Ter Ron Bucire, 1 Karl McMurtry, 1 Ronald E. Micens 2 1 Matheatics Departent, Occidental College, Los Angeles, California 90041 2

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

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

THE KALMAN FILTER: A LOOK BEHIND THE SCENE

THE KALMAN FILTER: A LOOK BEHIND THE SCENE HE KALMA FILER: A LOOK BEHID HE SCEE R.E. Deain School of Matheatical and Geospatial Sciences, RMI University eail: rod.deain@rit.edu.au Presented at the Victorian Regional Survey Conference, Mildura,

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

e-companion ONLY AVAILABLE IN ELECTRONIC FORM

e-companion ONLY AVAILABLE IN ELECTRONIC FORM OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer

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

ESE 523 Information Theory

ESE 523 Information Theory ESE 53 Inforation Theory Joseph A. O Sullivan Sauel C. Sachs Professor Electrical and Systes Engineering Washington University 11 Urbauer Hall 10E Green Hall 314-935-4173 (Lynda Marha Answers) jao@wustl.edu

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

On the block maxima method in extreme value theory

On the block maxima method in extreme value theory On the bloc axiethod in extree value theory Ana Ferreira ISA, Univ Tecn Lisboa, Tapada da Ajuda 349-7 Lisboa, Portugal CEAUL, FCUL, Bloco C6 - Piso 4 Capo Grande, 749-6 Lisboa, Portugal anafh@isa.utl.pt

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

A method to determine relative stroke detection efficiencies from multiplicity distributions

A method to determine relative stroke detection efficiencies from multiplicity distributions A ethod to deterine relative stroke detection eiciencies ro ultiplicity distributions Schulz W. and Cuins K. 2. Austrian Lightning Detection and Inoration Syste (ALDIS), Kahlenberger Str.2A, 90 Vienna,

More information

PAC-Bayes Analysis Of Maximum Entropy Learning

PAC-Bayes Analysis Of Maximum Entropy Learning PAC-Bayes Analysis Of Maxiu Entropy Learning John Shawe-Taylor and David R. Hardoon Centre for Coputational Statistics and Machine Learning Departent of Coputer Science University College London, UK, WC1E

More information

Some Perspective. Forces and Newton s Laws

Some Perspective. Forces and Newton s Laws Soe Perspective The language of Kineatics provides us with an efficient ethod for describing the otion of aterial objects, and we ll continue to ake refineents to it as we introduce additional types of

More information

DETECTION OF NONLINEARITY IN VIBRATIONAL SYSTEMS USING THE SECOND TIME DERIVATIVE OF ABSOLUTE ACCELERATION

DETECTION OF NONLINEARITY IN VIBRATIONAL SYSTEMS USING THE SECOND TIME DERIVATIVE OF ABSOLUTE ACCELERATION DETECTION OF NONLINEARITY IN VIBRATIONAL SYSTEMS USING THE SECOND TIME DERIVATIVE OF ABSOLUTE ACCELERATION Masaki WAKUI 1 and Jun IYAMA and Tsuyoshi KOYAMA 3 ABSTRACT This paper shows a criteria to detect

More information

A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words)

A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine. (1900 words) 1 A Self-Organizing Model for Logical Regression Jerry Farlow 1 University of Maine (1900 words) Contact: Jerry Farlow Dept of Matheatics Univeristy of Maine Orono, ME 04469 Tel (07) 866-3540 Eail: farlow@ath.uaine.edu

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

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies OPERATIONS RESEARCH Vol. 52, No. 5, Septeber October 2004, pp. 795 803 issn 0030-364X eissn 1526-5463 04 5205 0795 infors doi 10.1287/opre.1040.0130 2004 INFORMS TECHNICAL NOTE Lost-Sales Probles with

More information

Identical Maximum Likelihood State Estimation Based on Incremental Finite Mixture Model in PHD Filter

Identical Maximum Likelihood State Estimation Based on Incremental Finite Mixture Model in PHD Filter Identical Maxiu Lielihood State Estiation Based on Increental Finite Mixture Model in PHD Filter Gang Wu Eail: xjtuwugang@gail.co Jing Liu Eail: elelj20080730@ail.xjtu.edu.cn Chongzhao Han Eail: czhan@ail.xjtu.edu.cn

More information

COS 424: Interacting with Data. Written Exercises

COS 424: Interacting with Data. Written Exercises COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well

More information

Computable Shell Decomposition Bounds

Computable Shell Decomposition Bounds Coputable Shell Decoposition Bounds John Langford TTI-Chicago jcl@cs.cu.edu David McAllester TTI-Chicago dac@autoreason.co Editor: Leslie Pack Kaelbling and David Cohn Abstract Haussler, Kearns, Seung

More information

Pattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition

Pattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lesson 1 4 October 2017 Outline Learning and Evaluation for Pattern Recognition Notation...2 1. The Pattern Recognition

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

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

A Note on the Applied Use of MDL Approximations

A Note on the Applied Use of MDL Approximations A Note on the Applied Use of MDL Approxiations Daniel J. Navarro Departent of Psychology Ohio State University Abstract An applied proble is discussed in which two nested psychological odels of retention

More information

Least Squares Fitting of Data

Least Squares Fitting of Data Least Squares Fitting of Data David Eberly, Geoetric Tools, Redond WA 98052 https://www.geoetrictools.co/ This work is licensed under the Creative Coons Attribution 4.0 International License. To view a

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

SPECTRUM sensing is a core concept of cognitive radio

SPECTRUM sensing is a core concept of cognitive radio World Acadey of Science, Engineering and Technology International Journal of Electronics and Counication Engineering Vol:6, o:2, 202 Efficient Detection Using Sequential Probability Ratio Test in Mobile

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

Use of PSO in Parameter Estimation of Robot Dynamics; Part One: No Need for Parameterization

Use of PSO in Parameter Estimation of Robot Dynamics; Part One: No Need for Parameterization Use of PSO in Paraeter Estiation of Robot Dynaics; Part One: No Need for Paraeterization Hossein Jahandideh, Mehrzad Navar Abstract Offline procedures for estiating paraeters of robot dynaics are practically

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

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization

Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering

More information

ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD

ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Matheatical Sciences 04,, p. 7 5 ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD M a t h e a t i c s Yu. A. HAKOPIAN, R. Z. HOVHANNISYAN

More information

High throughput near infrared screening discovers DNA-templated silver clusters with peak fluorescence beyond 950 nm

High throughput near infrared screening discovers DNA-templated silver clusters with peak fluorescence beyond 950 nm Electronic Supplementary Material (ESI) for Nanoscale. This journal is The Royal Society of Chemistry 2018 High throughput near infrared screening discovers DNA-templated silver clusters with peak fluorescence

More information

A Poisson process reparameterisation for Bayesian inference for extremes

A Poisson process reparameterisation for Bayesian inference for extremes A Poisson process reparaeterisation for Bayesian inference for extrees Paul Sharkey and Jonathan A. Tawn Eail: p.sharkey1@lancs.ac.uk, j.tawn@lancs.ac.uk STOR-i Centre for Doctoral Training, Departent

More information

Chapter 2: Introduction to Damping in Free and Forced Vibrations

Chapter 2: Introduction to Damping in Free and Forced Vibrations Chapter 2: Introduction to Daping in Free and Forced Vibrations This chapter ainly deals with the effect of daping in two conditions like free and forced excitation of echanical systes. Daping plays an

More information

Sharp Time Data Tradeoffs for Linear Inverse Problems

Sharp Time Data Tradeoffs for Linear Inverse Problems Sharp Tie Data Tradeoffs for Linear Inverse Probles Saet Oyak Benjain Recht Mahdi Soltanolkotabi January 016 Abstract In this paper we characterize sharp tie-data tradeoffs for optiization probles used

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

Estimating Parameters for a Gaussian pdf

Estimating Parameters for a Gaussian pdf Pattern Recognition and achine Learning Jaes L. Crowley ENSIAG 3 IS First Seester 00/0 Lesson 5 7 Noveber 00 Contents Estiating Paraeters for a Gaussian pdf Notation... The Pattern Recognition Proble...3

More information

Data-Driven Imaging in Anisotropic Media

Data-Driven Imaging in Anisotropic Media 18 th World Conference on Non destructive Testing, 16- April 1, Durban, South Africa Data-Driven Iaging in Anisotropic Media Arno VOLKER 1 and Alan HUNTER 1 TNO Stieltjesweg 1, 6 AD, Delft, The Netherlands

More information

Testing equality of variances for multiple univariate normal populations

Testing equality of variances for multiple univariate normal populations University of Wollongong Research Online Centre for Statistical & Survey Methodology Working Paper Series Faculty of Engineering and Inforation Sciences 0 esting equality of variances for ultiple univariate

More information

Estimation of the Mean of the Exponential Distribution Using Maximum Ranked Set Sampling with Unequal Samples

Estimation of the Mean of the Exponential Distribution Using Maximum Ranked Set Sampling with Unequal Samples Open Journal of Statistics, 4, 4, 64-649 Published Online Septeber 4 in SciRes http//wwwscirporg/ournal/os http//ddoiorg/436/os4486 Estiation of the Mean of the Eponential Distribution Using Maiu Ranked

More information

Inspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information

Inspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information Cite as: Straub D. (2014). Value of inforation analysis with structural reliability ethods. Structural Safety, 49: 75-86. Value of Inforation Analysis with Structural Reliability Methods Daniel Straub

More information

An Adaptive UKF Algorithm for the State and Parameter Estimations of a Mobile Robot

An Adaptive UKF Algorithm for the State and Parameter Estimations of a Mobile Robot Vol. 34, No. 1 ACTA AUTOMATICA SINICA January, 2008 An Adaptive UKF Algorith for the State and Paraeter Estiations of a Mobile Robot SONG Qi 1, 2 HAN Jian-Da 1 Abstract For iproving the estiation accuracy

More information

Intelligent Systems: Reasoning and Recognition. Artificial Neural Networks

Intelligent Systems: Reasoning and Recognition. Artificial Neural Networks Intelligent Systes: Reasoning and Recognition Jaes L. Crowley MOSIG M1 Winter Seester 2018 Lesson 7 1 March 2018 Outline Artificial Neural Networks Notation...2 Introduction...3 Key Equations... 3 Artificial

More information

Saddle Points in Random Matrices: Analysis of Knuth Search Algorithms

Saddle Points in Random Matrices: Analysis of Knuth Search Algorithms Saddle Points in Rando Matrices: Analysis of Knuth Search Algoriths Micha Hofri Philippe Jacquet Dept. of Coputer Science INRIA, Doaine de Voluceau - Rice University Rocquencourt - B.P. 05 Houston TX 77005

More information

13 Harmonic oscillator revisited: Dirac s approach and introduction to Second Quantization

13 Harmonic oscillator revisited: Dirac s approach and introduction to Second Quantization 3 Haronic oscillator revisited: Dirac s approach and introduction to Second Quantization. Dirac cae up with a ore elegant way to solve the haronic oscillator proble. We will now study this approach. The

More information

Hybrid System Identification: An SDP Approach

Hybrid System Identification: An SDP Approach 49th IEEE Conference on Decision and Control Deceber 15-17, 2010 Hilton Atlanta Hotel, Atlanta, GA, USA Hybrid Syste Identification: An SDP Approach C Feng, C M Lagoa, N Ozay and M Sznaier Abstract The

More information

Analysis of Impulsive Natural Phenomena through Finite Difference Methods A MATLAB Computational Project-Based Learning

Analysis of Impulsive Natural Phenomena through Finite Difference Methods A MATLAB Computational Project-Based Learning Analysis of Ipulsive Natural Phenoena through Finite Difference Methods A MATLAB Coputational Project-Based Learning Nicholas Kuia, Christopher Chariah, Mechatronics Engineering, Vaughn College of Aeronautics

More information

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES

Proc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Proc. of the IEEE/OES Seventh Working Conference on Current Measureent Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Belinda Lipa Codar Ocean Sensors 15 La Sandra Way, Portola Valley, CA 98 blipa@pogo.co

More information