Termination analysis of floating-point programs using parameterizable rational approximations
|
|
- Dulcie Robbins
- 6 years ago
- Views:
Transcription
1 Terminatin analysis f flating-pint prgrams using parameterizable ratinal apprximatins Fnenantsa Maurica Université de La Réunin LIM France fnenantsa.maurica@ gmail.cm Frédéric Mesnard Université de La Réunin LIM France frederic.mesnard@univreunin.fr Étienne Payet Université de La Réunin LIM France etienne.payet@univreunin.fr ABSTRACT Analysis f flating-pint prgrams is a tpic that received an increasing attentin the past few years. Hwever, nly very few wrks have been dne regarding their terminatin analysis. We address that prblem in this paper. We present a technique that takes advantage f the already existing wrks n terminatin analysis f ratinal prgrams. Our apprach cnsists in translating the flating-pint prgrams int ratinal nes by means f sund apprximatins. We apprximate the flating-pint expressins using piecewise linear functins. Our apprximatin differs frm the already existing nes in the sense that it can be as precise as needed. CCS Cncepts Sftware its engineering Frmal methds; Sftware verificatin; Keywrds Terminatin analysis, Flating-pint arithmetic, Linearizatin 1. INTRODUCTION Terminatin analysis f prgrams is a ht research tpic that has already prduced many techniques. Sme f the mst innvative nes are the synthesis f linear ranking functins fr simple lps [15], the generalizatin t eventual linear functins [1], the plyranking [6], Chen s algrithm [7]. Unfrtunately, nne f these techniques can be used fr the terminatin analysis f flating-pint prgrams since flating-pint cmputatins are highly nn-linear due t the runding errrs. T ur knwledge, there is nly very limited wrk n that tpic. [16] extends the adrnments-based ACM apprach. [8] reduces the terminatin prblem t a secndrder satisfiability prblem. This paper develps a new technique that helps addressing that lack f wrk. Its main advantage is that, thrugh the use f an innvative ratinal apprximatin, it transpses the terminatin analysis f flating-pint lps int terminatin analysis f ratinal lps, which is already very well cvered in the literature. The rest f the paper is rganized as fllws. First, we quickly intrduce the basics f flating-pint arithmetic in Sectin 2. Then, we give the details f ur ratinal apprximatin in Sectin 3. We end by presenting its applicatin t terminatin analysis in Sectin FLOATING-POINT ARITHMETIC A real number x R is apprximated in machine by a flating-pint number ˆx F. The IEEE-754 stard defines the flating-pint arithmetic. A flating-pint number is represented by the triplet (s, m, e) such that: ˆx = ( 1) s β e m where s {0, 1 is the sign, β {2, 10 is the radix, e [e min, e max] is the expnent, the fractinal number m = m 0.m 1m 2...m p 1 is the signific is written in p digits where p is called precisin. We call machine epsiln ɛ the distance between 1 the flating-pint number fllwing 1. We call unit in the last place, r ulp, f ˆx the value the least significant digit represents: ulp(ˆx) = ɛ β e. If ˆx is such that ˆx β e min, ˆx is called a nrmal number. Otherwise, ˆx is called a subnrmal number. We call s min the smallest psitive subnrmal, n min the smallest psitive nrmal n max the biggest psitive nrmal. IEEE-754 requires flating-pint arithmetic peratins t be crrectly runded. That is t say, giving a runding mde, a real arithmetic peratin, its flating-pint equivalent 2 flating-pint numbers ˆx 1, ˆx 2, the fllwing hlds: ˆx 1 ˆx 2 = (ˆx 1 ˆx 2). Apart frm the frmat f the representatin the runding mdes, IEEE-754 als defines special numbers exceptin hling. Hwever, fr simplicity, we will nly cnsider the runding t nearest ties t even. Mrever, we will
2 cnsider that there is n special value in ur representatin that n exceptin will ccur in ur cmputatins, ntably n verflw. As illustrative example, cnsider the extremely simple type myflat presented in Figure 1 where β = 10, p = 2, e min = 0, e max = 1. s min step : 0.1 subnrmals ɛ n min step : nrmals step : 1 n max Figure 1: A persnalized flating-pint type, myflat. Symmetry t the rigin fr the negatives. A mre cmplete intrductin t flating-pint cmputatins can be fund in [10]. 3. RATIONAL APPROXIMATION The cmmn methd fr apprximating ˆx is t use the abslute errr the relative errr. We recall the definitin f the abslute errr A (x) = x ˆx the relative errr R(x) = x ˆx, mre details can be fund in [11, Sectin x 2.1]. The linear expressins f these errrs vary accrding t the range f the flating-pint numbers that are studied, resulting in piecewise linear apprximatins. T ur knwledge, literature mainly apprximates by distinguishing the range f the nrmals frm the range f the subnrmals. Such is the case fr example f [4, 5] where the abslute errr is used fr the subnrmals the relative errr fr the nrmals. Smetimes a mix f the tw errrs is used, resulting in a single apprximatin fr bth the subnrmals the nrmals, like in [2, 14]. Thugh these apprximatins are crrect, they may be t imprecise t be f use. Thus, mre precise apprximatins are needed. Hwever, the ptimal bund fr the abslute errr has lng been knwn the ptimal bund fr the relative errr has very recently been prved in [12]. Hence, the traditinal apprximatins cited abve cannt be refined anymre. The nvelty f ur apprximatin is threefld. Firstly, it can be as precise as needed, until the equivalence between the flating-pint expressin its apprximatin is reached. Secndly, it unifies the different types f current linear apprximatins (apprximatin by abslute errr, by relative errr, by cmbinatin f bth) under a single framewrk in which they are classified hierarchically. Thirdly, it gives anther prf fr the ptimality f the errr bund f flatingpint rundings. 3.1 Apprximatin f ˆx with parameterizable precisin 99 Fr easily understing ur idea, let us study the apprximatin f a real x by ˆx = (x) fr the particular case f the type myflat when the runding t nearest ties t even is used. The runding functin is exactly defined as fllws: : R F myflat < x < x < x < 97.5 x (x) = ˆx = x < x < 98.5 The key pint is t ntice that is already a piecewise linear functin, a piecewise cnstant functin actually. As such, is nt different frm the apprximatins by abslute/relative errr which are als piecewise linear functins. Thus, in the same way we can apprximate flating-pint arithmetic peratins using the abslute/relative errr apprximatins, we can als apprximate using the exact definitin f the runding functin, which will lead t the equivalence between the initial expressin its apprximatin. Hwever, the number f pieces used in the exact definitin equals the number N f the flating-pint pssible values, N = 2 β p 1 (e max e min + 2) 1 fr ur case, which is a ridiculusly big number. Hence, even if it may be f interest theretically, the exact definitin is hardly useful practically. Here cmes the idea f linear apprximatin with parameterizable precisin. It can be easily understd that n piecewise linear functin with a number f pieces fewer than N can exactly define ˆx. Apprximatins are used instead. Reducing the number f pieces will strictly reduce the precisin f the apprximatin while increasing the number f pieces will strictly increase it. The prblem f apprximating ptimally ˆx using linear functins defined in k pieces frmally cnsists f finding the upper apprximatin functin µ k the lwer apprximatin functin ν k such that: minimize( X (µ k(x) ˆx)dx) µ k (x) = {a i x + b i, x X i k 1 i k ˆx µ k (x) minimize( X (ˆx ν k(x))dx) ν k (x) = {c i x + d i, x X i k 1 i k ν k (x) ˆx where X = [ n max, n max] {X k a partitin f k elements f X that is t be fund. Optimal means that if we measure the precisin f an apprximatin with the surface between the upper lwer apprximatin functins, then n apprximatin with greater precisin can be fund fr the given number f pieces. Failing at finding a general slutin fr (1) (2), we cnsider a simplified versin f the prblem in which the partitining is already knwn. We will nw give the slutins f that simplified versin. Thugh the ptimality f ur partitining has yet t be prved, the prperty f increasing (1) (2)
3 It is interesting t ntice that the prf fr the ptimal bund fr the relative errr recently given in [12] can be retrieved by slving the simplified versin f (1): minimize( n max n min (µ(x) ˆx)dx) µ(x) = a x + b µ(x) ˆx x n min (a) 1 piece (c) 3 pieces (b) 2 pieces Figure 2: Cmmn piecewise linear apprximatins f ˆx precisin until the equivalence is preserved. Fr brevity, we nly present the slutins fr the simplified versin f (1), that is t say the value f the upper apprximatin functin µ k. We hpe that the simplified versin is clear enugh s that the reader is able t slve it by himself/herself. Fr k = 1, 2, 3 we respectively use the partitining: {X 1 = {[ n max, n max] {X 2 = {[ n max, 0[, [0, n max] {X 3 = {[ n max, n min[, [ n min, n min], ]n min, n max] We respectively find the upper linear apprximatin functin: µ 2(x) = µ 1(x) = x + A, x [ n max, n max] { x (1 + R n ) + As x [0, n max] x (1 Rn) + As x [ n max, 0[ x (1 + Rn) µ 3(x) = x + As x (1 Rn) x ]n min, n max] x [ n min, n min] x [ n max, n min[ where A = ɛ βemax, A 2 s = ɛ βe min, R 2 n = ɛ. 2+ɛ These are the cmmn apprximatins, as used in [2, 4, 5, 14] as illustrated in Figure 2(a), 2(b) 2(c). k = 1 is the cmmn apprximatin by abslute errr. k = 2 is the cmmn mixed use f the abslute errr the relative errr. k = 3 is the cmmn use f the relative errr fr the nrmals the abslute errr fr the subnrmals. which will give µ(x) = x (1 + δ), δ =, after which the 2+ɛ identificatin f δ as Rn easily fllws. This result shws hw far reaching ur apprach wuld be. Using ur frmalizatin, we culd prve the ptimality f the cmmn linear apprximatins classified them in rder f increasing precisin. We can as well call them the 1-piece, 2-pieces 3-pieces linear apprximatins. Nw we will present apprximatins with higher precisin. When k 4, we start frm the apprximatin fr k = 3, at each increase f k, we cnsecutively apprximate the flating-pint numbers with same ulp in decreasing rder f ulp. In ther wrds, we grup by ulp frm the edge t the center. Flating-pint numbers ˆx I = [ˆx m, ˆx M ] with same ulp have a unique ptimal linear upper apprximatin which is x + A I where A I = ulp(ˆx) 2. Fr example, fr the apprximatin with 4 pieces, we start frm the apprximatin with 3 pieces. Then fr the new set, we have the chice between a grup f psitive flating-pint numbers a grup f negative flating-pint numbers. We decide t take the psitive ne. This is illustrated in Figure 3(a). Fr the apprximatin with 5 pieces, we start frm the apprximatin with 4 pieces. Then fr the new set, we have nly a single chice, which is the previus grup f negative flating-pint numbers. This is illustrated in Figure 3(b). We repeat the same prcess fr k 6 until k is such that all flating-pint numbers with same ulp are ptimally apprximated, as illustrated in Figure 3(c). Starting frm there, fr the apprximatins with higher number f pieces, at each increase f k, we cnsecutively define each flating-pint number exactly in decreasing rder f ulp, in ther wrds frm the edge t the center again. The equivalence between ˆx its apprximatin is reached when k = N. It is wrth mentining that apprximating by gruping the the flating-pint numbers with same ulp in decreasing rder f ulp is just ne pssible strategy. Depending n the applicatin n the cncrete flating-pint cnstants used in the prgram, it culd be beneficial fr example t tighten the apprximatin with increasing rder f ulp r in particular arund the ccurring cnstants. We just presented piecewise linear apprximatins which are mre precise than the cmmn piecewise linear apprximatins by increasing the number f pieces. We will nw see hw t use these apprximatins f ˆx t linearize arithmetic expressins. 3.2 Linearizatin f arithmetic flating-pint expressins ɛ
4 (a) Frm 3 t 4 pieces. The new set is in dashed line. Same as fr 3 pieces fr the negatives. (b) Frm 4 t 5 pieces. The new set is in dashed line. Same as fr 4 pieces fr the psitives. Generally, nce such apprximatin by ratinal expressins is btained, the linearizatin is cnsidered dne even if, strictly speaking, it is nt since nn-linear terms, like prduct f tw variables, may still appear in the ratinal expressin. In thse cases, the nn-linear terms have t be linearized by techniques like [13]. Fr example, giving tw ratinal variables x [x m, x M ] y [y m, y M ], their prduct z = x y will be apprximated by the linear cnstraints: z x my y mx + x my m 0 z + x my + y M x x my M 0 z + x M y + y mx x M y m 0 z x M y y M x + x my M 0 We will nw present a cncrete applicatin f ur technique thrugh the terminatin analysis f lps using flatingpint numbers as variables. (c) All gruped by ulp. Symmetry t the rigin fr the negatives. Figure 3: Piecewise linear apprximatins f ˆx with higher precisin Flating-pint arithmetic peratins are nn-linear. Linearizing a flating-pint arithmetic expressin cnsists f translating the expressin int a ratinal linear expressin by means f sund apprximatins. Knwing an apprximatin f ˆx such that ν k (x) ˆx µ k (x) using the prperty f crrectly runded peratins, the apprximatin f a flating-pint arithmetic peratin is straightfrward: fr a given arithmetic peratin, we have ν k (y z) y z µ k (y z). When linearizing an arithmetic expressin with multiple peratins, we use intermediate variables t decmpse the expressin int elementary arithmetic peratins with respect t their precedence. Fr example, the fllwing expressin r = x+ y z x is decmpsed int: r = t 2 x t 2 = x+ t 1 t 1 = y z Then, it nly remains t apprximate each elementary peratin using the previusly presented piecewise linear apprximatins, with the desired precisin. The abve example will give us: ν k (t 2 x) r µ k (t 2 x) ν k (x + t 1) t 2 µ k (x + t 1) ν k (y z) t 1 µ k (y z) 4. APPLICATION TO TERMINATION AN- ALYSIS OF FLOATING-POINT LOOPS Our apprach fr analyzing terminatin f lps invlving flating-pint arithmetic cnsists in translating them int ratinal lps, then applying the already existing terminatin analysis techniques t the btained translatin. As we suppse that n verflw ccurs, the result f the analysis is nly valid fr the initial ranges f the variables that d nt lead t verflw. Abstract interpretatin-based tls, like Fluctuat [9], r frmal methd-based tls, like Gappa [3], already exist fr the determinatin f thse ranges. The nn-ccurrence f verflw is an infrmatin that we can use t enrich the cnstraints f ur apprximatins since fr every arithmetic flating-pint peratin : n max x y n max. Hwever, fr the sake f readability, we will mit these additinal cnstraints. Each flating-pint expressin is then apprximated by ratinal nes using the technique presented in the previus sectin. Expressins in guard cnditins are hled using intermediate variables. We will nw cncretely see hw t prceed thrugh the analysis f the lp alp presented in Figure 4, in which the variables x y are f type myflat. In ur ntatin, the primed variables refer t the value f their unprimed equivalent at the end f ne iteratin. while(x * y >= 0 & y >= -6) { x := x - 0.6; y := y ; Figure 4: A flating-pint lp, alp alp terminates fr every initial value f x y. Indeed, fr any initial value x 0, y 0 f x, y: (i) x is always strictly decreasing, (ii) y is strictly increasing at each iteratin until reaching 10 if 6 y 0 < 10 r y stays unchanged if y 0 10.
5 (i) (ii) imply that if the lp runs lng enugh, x will becme negative while y will becme psitive in which case the cnditin x y 0 will be unsatisfied. Ntice that y 1 = y is different frm y 2 = y due t the runding errrs. Fr example, fr y = 20, y 1 = 20 while y 2 =. We will nw shw hw t analyze alp using ur apprach. We start by decmpsing all the arithmetic expressins int a successin f elementary peratins. If cmplex expressins are encuntered in the guard cnditin, they are put inside intermediate variables s that they can be decmpsed nrmally. This is illustrated in Figure 5. c0 := x * y; while(c0 >= 0 & y >= -6) { x := x - 0.6; y := y ; c0 := x * y ; (a) Treatment f the guard cnditin c0 := x * y; while(c0 >= 0 & y >= -6) { x := x - 0.6; t0 := y + 0.3; y := t ; c0 := x * y ; (b) Decmpsitin int a successin f elementary peratins Figure 5: Preliminary peratins befre translatin Then, each peratin is apprximated by piecewise linear functins with the desired precisin as presented in the previus sectin. We will nw shw that the cmmn apprximatins the 1-piece, the 2-pieces the 3-pieces linear apprximatins in ur terminlgy are nt precise enugh t prve the terminatin f alp while the 4-pieces ne is. Using the 1-piece linear apprximatin, r = y z is apprximated by ν 1(y z) r µ 1(y z) such that µ 1(x) = x + 0.5, 99 x 99 ν 1(x) = x 0.5, 99 x 99. Applying that apprximatin n the transfrmed prgram in Figure 5(b), we will get the ratinal apprximatin f alp in Figure 6 which uses the nn-deterministic assignments <=: :<=. x*y <=: c0 :<= x*y + 0.5; while(c0 >= 0 & y >= -6) { x <=: x :=< x - 0.1; y <=: t0 :<= y + 0.8; t0-0.2 <=: y :<= t ; x *y <=: c0 :<= x *y + 0.5; Figure 6: Ratinal apprximatin f alp using the 1-piece linear apprximatin The 1-piece linear apprximatin is precise enugh t capture the decreasing f x as the btained upper bund f x is strictly less than x. Hwever, it is t lse t capture the increasing t a psitive number f y. Indeed, the btained lwer bund f t0 is less than r equal t y that f y is less than r equal t t0. Thus, with this apprximatin, y may decrease r may stay cnstant during all executins f the lp. If the initial values f x y are negative numbers y stays cnstant, the lp will run infinitely. As there are cases where the translated lp may terminate r may nt, we cannt decide the terminatin f alp. Using the 2-pieces linear apprximatin, r = y z is apprximated by ν 2(y z) r µ 2(y z) such that: µ 2(x) = ν 2(x) = { { x x [0, 99] x x [ 99, 0[ x 0.05 x [0, 99] x 0.05 x [ 99, 0[ Thus, the instructin x := x - 0.6; is translated as in Figure 7. if (x >=0) { 20*(x - 0.6)/ <=: x <=: 22*(x - 0.6)/ ; else { 22*(x - 0.6)/ <=: x <=: 20*(x - 0.6)/ ; Figure 7: Ratinal apprximatin f x := x - 0.6; using the 2-pieces linear apprximatin The ther instructins are translated in a similar way. We easily verify that the 2-pieces linear apprximatin is precise enugh t capture the increasing t a psitive number f y as the btained lwer bund f y is strictly greater than y fr 6 y 0. Hwever, it is t lse t capture the decreasing f x fr any initial value x 0 f x. Indeed, fr x 0 14, the btained upper bund f x is greater than r equal t x. Thus, with this apprximatin, x may increase r may stay cnstant during all executins f the lp. If x 0 14 y 0 0, the lp will run infinitely. As there are cases where the translated lp may terminate r may nt, we cannt decide the terminatin f alp. The same reasning applies fr the 3-pieces linear apprximatin which is als precise enugh t capture the increasing t a psitive number f y but nt the decreasing f x. Using the 4-pieces linear apprximatin, r = y z is apprximated by ν 4(y z) r µ 4(y z) such that: x x [10, 99] 22 x x ]1, 10[ µ 4(x) = x x [ 1, 1] x x [ 99, 1[ 20 x 0.5 x [10, 99] 20 x x ]1, 10[ ν 4(x) = x 0.05 x [ 1, 1] x x [ 99, 1[ 22
6 Thus, the instructin x := x - 0.6; is translated as in Figure 8. if (x >= 10) { x <=: x :=< x - 0.1; else if (1 <= x & x <= 10) { 20*(x - 0.6)/ <=: x <=: 22*(x - 0.6)/; else if (-1 <= x & x <= 1) { x <=: x :<= x ; else { 22*(x - 0.6)/ <=: x <=: 20*(x - 0.6)/; Figure 8: Ratinal apprximatin f x := x - 0.6; using the 4-pieces linear apprximatin The ther instructins are translated in a similar way. Nw, the apprximatin is precise enugh t capture bth the decreasing f x the increasing t a psitive number f y. Indeed, the btained upper bund f x is strictly less than x the btained lwer bund f y is strictly greater than y fr any 6 y 0. As the translated lp terminates fr any initial value f x y, s des alp. 5. CONCLUSION We have presented a new technique fr analyzing terminatin f flating-pint lps by translating them int ratinal nes using sund apprximatins. T achieve that, we use piecewise linear functins. The nvelty lies in the quality f the apprximatins which are ptimal fr the chsen partitining can be as precise as needed by increasing r decreasing the number f pieces. That is the ntin f what we call piecewise linear apprximatin with parameterizable precisin. Unlike the few ther existing techniques fr terminatin analysis f flating-pint lps, urs benefits frm the very well cvered terminatin analysis f ratinal linear lps. T sme extent, the presented technique can be als applied t prgrams that perate n bth flating-pint variables n ther kind f data such as integers, arrays mre generally heap-based data-structures. T ur knwledge, such a cmbined analysis has nt yet been prpsed fr prgram terminatin. Our wrk can be extended in many interesting ways. We can guide the partitining by the ranges f the variables in the expressin t apprximate. Thse ranges can be retrieved by abstract interpretatin-based techniques fr example. We can als use apprximatins with different precisin fr each expressin t apprximate instead f using a unique apprximatin fr all the expressins. The ntin f apprximatin with parameterizable precisin can be easily used in ther tpics invlving flating-pint arithmetic. We ntably think abut the tpic f cnstraint slving ver flating-pint numbers which als uses ratinal apprximatins. Indeed, the mre precise the apprximatins are, the mre efficient the filtering prcess will be. 6. REFERENCES [1] R. Bagnara F. Mesnard. Eventual linear ranking functins. In Principles Practice f Declarative Prgramming, [2] M. S. Belaid, C. Michel, M. Rueher. Bsting lcal cnsistency algrithms ver flating-pint numbers. In Principles Practice f Cnstraint Prgramming [3] S. Bld, J.-C. Filliâtre, G. Melquind. Cmbining Cq Gappa fr certifying flating-pint prgrams. In Intelligent Cmputer Mathematics [4] S. Bld T. M. T. Nguyen. Hardware-independent prfs f numerical prgrams. In NASA Frmal Methds, [5] S. Bld T. M. T. Nguyen. Prfs f numerical prgrams when the cmpiler ptimizes. Innvatins in Systems Sftware Engineering, [6] A. R. Bradley, Z. Manna, H. B. Sipma. The plyranking principle. In Autmata, Languages Prgramming [7] H. Y. Chen, S. Flur, S. Mukhpadhyay. Terminatin prfs fr linear simple lps. In Static Analysis [8] C. David, D. Krening, M. Lewis. Unrestricted terminatin nn-terminatin arguments fr bit-vectr prgrams. In Eurpean Sympsium n Prgramming [9] D. Delmas, E. Gubault, S. Putt, J. Suyris, K. Tekkal, F. Védrine. Twards an industrial use f Fluctuat n safety-critical avinics sftware. In Frmal Methds fr Industrial Critical Systems [10] D. Gldberg. What every cmputer scientist shuld knw abut flating-pint arithmetic. ACM Cmputing Surveys, [11] N. J. Higham. Accuracy Stability f Numerical Algrithms. Sciety fr Industrial Applied Mathematics, [12] C.-P. Jeannerd S. M. Rump. On relative errrs f flating-pint peratins: ptimal bunds applicatins. Preprint, [13] G. P. McCrmick. Cmputability f glbal slutins t factrable nncnvex prgrams: Part I Cnvex underestimating prblems. Mathematical Prgramming, [14] A. Miné. Relatinal abstract dmains fr the detectin f flating-pint run-time errrs. In Eurpean Sympsium n Prgramming [15] A. Pdelski A. Rybalchenk. A cmplete methd fr the synthesis f linear ranking functins. In Verificatin, mdel checking, abstract interpretatin, [16] A. Serebrenik D. De Schreye. Terminatin f flating-pint cmputatins. Jurnal f Autmated Reasning, 2005.
Dataflow Analysis and Abstract Interpretation
Dataflw Analysis and Abstract Interpretatin Cmputer Science and Artificial Intelligence Labratry MIT Nvember 9, 2015 Recap Last time we develped frm first principles an algrithm t derive invariants. Key
More informationComputational modeling techniques
Cmputatinal mdeling techniques Lecture 4: Mdel checing fr ODE mdels In Petre Department f IT, Åb Aademi http://www.users.ab.fi/ipetre/cmpmd/ Cntent Stichimetric matrix Calculating the mass cnservatin relatins
More informationCS 477/677 Analysis of Algorithms Fall 2007 Dr. George Bebis Course Project Due Date: 11/29/2007
CS 477/677 Analysis f Algrithms Fall 2007 Dr. Gerge Bebis Curse Prject Due Date: 11/29/2007 Part1: Cmparisn f Srting Algrithms (70% f the prject grade) The bjective f the first part f the assignment is
More informationB. Definition of an exponential
Expnents and Lgarithms Chapter IV - Expnents and Lgarithms A. Intrductin Starting with additin and defining the ntatins fr subtractin, multiplicatin and divisin, we discvered negative numbers and fractins.
More informationCOMP 551 Applied Machine Learning Lecture 11: Support Vector Machines
COMP 551 Applied Machine Learning Lecture 11: Supprt Vectr Machines Instructr: (jpineau@cs.mcgill.ca) Class web page: www.cs.mcgill.ca/~jpineau/cmp551 Unless therwise nted, all material psted fr this curse
More informationBootstrap Method > # Purpose: understand how bootstrap method works > obs=c(11.96, 5.03, 67.40, 16.07, 31.50, 7.73, 11.10, 22.38) > n=length(obs) >
Btstrap Methd > # Purpse: understand hw btstrap methd wrks > bs=c(11.96, 5.03, 67.40, 16.07, 31.50, 7.73, 11.10, 22.38) > n=length(bs) > mean(bs) [1] 21.64625 > # estimate f lambda > lambda = 1/mean(bs);
More informationDetermining the Accuracy of Modal Parameter Estimation Methods
Determining the Accuracy f Mdal Parameter Estimatin Methds by Michael Lee Ph.D., P.E. & Mar Richardsn Ph.D. Structural Measurement Systems Milpitas, CA Abstract The mst cmmn type f mdal testing system
More informationChapter 3: Cluster Analysis
Chapter 3: Cluster Analysis } 3.1 Basic Cncepts f Clustering 3.1.1 Cluster Analysis 3.1. Clustering Categries } 3. Partitining Methds 3..1 The principle 3.. K-Means Methd 3..3 K-Medids Methd 3..4 CLARA
More informationCHAPTER 3 INEQUALITIES. Copyright -The Institute of Chartered Accountants of India
CHAPTER 3 INEQUALITIES Cpyright -The Institute f Chartered Accuntants f India INEQUALITIES LEARNING OBJECTIVES One f the widely used decisin making prblems, nwadays, is t decide n the ptimal mix f scarce
More informationKinetic Model Completeness
5.68J/10.652J Spring 2003 Lecture Ntes Tuesday April 15, 2003 Kinetic Mdel Cmpleteness We say a chemical kinetic mdel is cmplete fr a particular reactin cnditin when it cntains all the species and reactins
More informationLyapunov Stability Stability of Equilibrium Points
Lyapunv Stability Stability f Equilibrium Pints 1. Stability f Equilibrium Pints - Definitins In this sectin we cnsider n-th rder nnlinear time varying cntinuus time (C) systems f the frm x = f ( t, x),
More informationDifferentiation Applications 1: Related Rates
Differentiatin Applicatins 1: Related Rates 151 Differentiatin Applicatins 1: Related Rates Mdel 1: Sliding Ladder 10 ladder y 10 ladder 10 ladder A 10 ft ladder is leaning against a wall when the bttm
More informationWe can see from the graph above that the intersection is, i.e., [ ).
MTH 111 Cllege Algebra Lecture Ntes July 2, 2014 Functin Arithmetic: With nt t much difficulty, we ntice that inputs f functins are numbers, and utputs f functins are numbers. S whatever we can d with
More informationPreparation work for A2 Mathematics [2017]
Preparatin wrk fr A2 Mathematics [2017] The wrk studied in Y12 after the return frm study leave is frm the Cre 3 mdule f the A2 Mathematics curse. This wrk will nly be reviewed during Year 13, it will
More informationMedium Scale Integrated (MSI) devices [Sections 2.9 and 2.10]
EECS 270, Winter 2017, Lecture 3 Page 1 f 6 Medium Scale Integrated (MSI) devices [Sectins 2.9 and 2.10] As we ve seen, it s smetimes nt reasnable t d all the design wrk at the gate-level smetimes we just
More informationThe standards are taught in the following sequence.
B L U E V A L L E Y D I S T R I C T C U R R I C U L U M MATHEMATICS Third Grade In grade 3, instructinal time shuld fcus n fur critical areas: (1) develping understanding f multiplicatin and divisin and
More informationSUPPLEMENTARY MATERIAL GaGa: a simple and flexible hierarchical model for microarray data analysis
SUPPLEMENTARY MATERIAL GaGa: a simple and flexible hierarchical mdel fr micrarray data analysis David Rssell Department f Bistatistics M.D. Andersn Cancer Center, Hustn, TX 77030, USA rsselldavid@gmail.cm
More information[COLLEGE ALGEBRA EXAM I REVIEW TOPICS] ( u s e t h i s t o m a k e s u r e y o u a r e r e a d y )
(Abut the final) [COLLEGE ALGEBRA EXAM I REVIEW TOPICS] ( u s e t h i s t m a k e s u r e y u a r e r e a d y ) The department writes the final exam s I dn't really knw what's n it and I can't very well
More informationPattern Recognition 2014 Support Vector Machines
Pattern Recgnitin 2014 Supprt Vectr Machines Ad Feelders Universiteit Utrecht Ad Feelders ( Universiteit Utrecht ) Pattern Recgnitin 1 / 55 Overview 1 Separable Case 2 Kernel Functins 3 Allwing Errrs (Sft
More informationHomology groups of disks with holes
Hmlgy grups f disks with hles THEOREM. Let p 1,, p k } be a sequence f distinct pints in the interir unit disk D n where n 2, and suppse that fr all j the sets E j Int D n are clsed, pairwise disjint subdisks.
More informationBuilding to Transformations on Coordinate Axis Grade 5: Geometry Graph points on the coordinate plane to solve real-world and mathematical problems.
Building t Transfrmatins n Crdinate Axis Grade 5: Gemetry Graph pints n the crdinate plane t slve real-wrld and mathematical prblems. 5.G.1. Use a pair f perpendicular number lines, called axes, t define
More informationA New Evaluation Measure. J. Joiner and L. Werner. The problems of evaluation and the needed criteria of evaluation
III-l III. A New Evaluatin Measure J. Jiner and L. Werner Abstract The prblems f evaluatin and the needed criteria f evaluatin measures in the SMART system f infrmatin retrieval are reviewed and discussed.
More informationMODULE 1. e x + c. [You can t separate a demominator, but you can divide a single denominator into each numerator term] a + b a(a + b)+1 = a + b
. REVIEW OF SOME BASIC ALGEBRA MODULE () Slving Equatins Yu shuld be able t slve fr x: a + b = c a d + e x + c and get x = e(ba +) b(c a) d(ba +) c Cmmn mistakes and strategies:. a b + c a b + a c, but
More informationAdmissibility Conditions and Asymptotic Behavior of Strongly Regular Graphs
Admissibility Cnditins and Asympttic Behavir f Strngly Regular Graphs VASCO MOÇO MANO Department f Mathematics University f Prt Oprt PORTUGAL vascmcman@gmailcm LUÍS ANTÓNIO DE ALMEIDA VIEIRA Department
More information5 th grade Common Core Standards
5 th grade Cmmn Cre Standards In Grade 5, instructinal time shuld fcus n three critical areas: (1) develping fluency with additin and subtractin f fractins, and develping understanding f the multiplicatin
More information1996 Engineering Systems Design and Analysis Conference, Montpellier, France, July 1-4, 1996, Vol. 7, pp
THE POWER AND LIMIT OF NEURAL NETWORKS T. Y. Lin Department f Mathematics and Cmputer Science San Jse State University San Jse, Califrnia 959-003 tylin@cs.ssu.edu and Bereley Initiative in Sft Cmputing*
More informationRevision: August 19, E Main Suite D Pullman, WA (509) Voice and Fax
.7.4: Direct frequency dmain circuit analysis Revisin: August 9, 00 5 E Main Suite D Pullman, WA 9963 (509) 334 6306 ice and Fax Overview n chapter.7., we determined the steadystate respnse f electrical
More informationChapter Summary. Mathematical Induction Strong Induction Recursive Definitions Structural Induction Recursive Algorithms
Chapter 5 1 Chapter Summary Mathematical Inductin Strng Inductin Recursive Definitins Structural Inductin Recursive Algrithms Sectin 5.1 3 Sectin Summary Mathematical Inductin Examples f Prf by Mathematical
More informationThis section is primarily focused on tools to aid us in finding roots/zeros/ -intercepts of polynomials. Essentially, our focus turns to solving.
Sectin 3.2: Many f yu WILL need t watch the crrespnding vides fr this sectin n MyOpenMath! This sectin is primarily fcused n tls t aid us in finding rts/zers/ -intercepts f plynmials. Essentially, ur fcus
More informationThermodynamics Partial Outline of Topics
Thermdynamics Partial Outline f Tpics I. The secnd law f thermdynamics addresses the issue f spntaneity and invlves a functin called entrpy (S): If a prcess is spntaneus, then Suniverse > 0 (2 nd Law!)
More information, which yields. where z1. and z2
The Gaussian r Nrmal PDF, Page 1 The Gaussian r Nrmal Prbability Density Functin Authr: Jhn M Cimbala, Penn State University Latest revisin: 11 September 13 The Gaussian r Nrmal Prbability Density Functin
More informationCOMP 551 Applied Machine Learning Lecture 9: Support Vector Machines (cont d)
COMP 551 Applied Machine Learning Lecture 9: Supprt Vectr Machines (cnt d) Instructr: Herke van Hf (herke.vanhf@mail.mcgill.ca) Slides mstly by: Class web page: www.cs.mcgill.ca/~hvanh2/cmp551 Unless therwise
More informationIntroduction to Models and Properties
Intrductin t Mdels and Prperties Cmputer Science and Artificial Intelligence Labratry MIT Armand Slar-Lezama Nv 23, 2015 Nvember 23, 2015 1 Recap Prperties Prperties f variables Prperties at prgram pints
More informationCurriculum Development Overview Unit Planning for 8 th Grade Mathematics MA10-GR.8-S.1-GLE.1 MA10-GR.8-S.4-GLE.2
Unit Title It s All Greek t Me Length f Unit 5 weeks Fcusing Lens(es) Cnnectins Standards and Grade Level Expectatins Addressed in this Unit MA10-GR.8-S.1-GLE.1 MA10-GR.8-S.4-GLE.2 Inquiry Questins (Engaging-
More informationMath Foundations 10 Work Plan
Math Fundatins 10 Wrk Plan Units / Tpics 10.1 Demnstrate understanding f factrs f whle numbers by: Prime factrs Greatest Cmmn Factrs (GCF) Least Cmmn Multiple (LCM) Principal square rt Cube rt Time Frame
More informationLead/Lag Compensator Frequency Domain Properties and Design Methods
Lectures 6 and 7 Lead/Lag Cmpensatr Frequency Dmain Prperties and Design Methds Definitin Cnsider the cmpensatr (ie cntrller Fr, it is called a lag cmpensatr s K Fr s, it is called a lead cmpensatr Ntatin
More informationTrigonometric Ratios Unit 5 Tentative TEST date
1 U n i t 5 11U Date: Name: Trignmetric Ratis Unit 5 Tentative TEST date Big idea/learning Gals In this unit yu will extend yur knwledge f SOH CAH TOA t wrk with btuse and reflex angles. This extensin
More informationT Algorithmic methods for data mining. Slide set 6: dimensionality reduction
T-61.5060 Algrithmic methds fr data mining Slide set 6: dimensinality reductin reading assignment LRU bk: 11.1 11.3 PCA tutrial in mycurses (ptinal) ptinal: An Elementary Prf f a Therem f Jhnsn and Lindenstrauss,
More informationCHAPTER 2 Algebraic Expressions and Fundamental Operations
CHAPTER Algebraic Expressins and Fundamental Operatins OBJECTIVES: 1. Algebraic Expressins. Terms. Degree. Gruping 5. Additin 6. Subtractin 7. Multiplicatin 8. Divisin Algebraic Expressin An algebraic
More informationThe blessing of dimensionality for kernel methods
fr kernel methds Building classifiers in high dimensinal space Pierre Dupnt Pierre.Dupnt@ucluvain.be Classifiers define decisin surfaces in sme feature space where the data is either initially represented
More informationSPH3U1 Lesson 06 Kinematics
PROJECTILE MOTION LEARNING GOALS Students will: Describe the mtin f an bject thrwn at arbitrary angles thrugh the air. Describe the hrizntal and vertical mtins f a prjectile. Slve prjectile mtin prblems.
More informationAdmin. MDP Search Trees. Optimal Quantities. Reinforcement Learning
Admin Reinfrcement Learning Cntent adapted frm Berkeley CS188 MDP Search Trees Each MDP state prjects an expectimax-like search tree Optimal Quantities The value (utility) f a state s: V*(s) = expected
More informationROUNDING ERRORS IN BEAM-TRACKING CALCULATIONS
Particle Acceleratrs, 1986, Vl. 19, pp. 99-105 0031-2460/86/1904-0099/$15.00/0 1986 Grdn and Breach, Science Publishers, S.A. Printed in the United States f America ROUNDING ERRORS IN BEAM-TRACKING CALCULATIONS
More informationFloating Point Method for Solving Transportation. Problems with Additional Constraints
Internatinal Mathematical Frum, Vl. 6, 20, n. 40, 983-992 Flating Pint Methd fr Slving Transprtatin Prblems with Additinal Cnstraints P. Pandian and D. Anuradha Department f Mathematics, Schl f Advanced
More informationMODULE FOUR. This module addresses functions. SC Academic Elementary Algebra Standards:
MODULE FOUR This mdule addresses functins SC Academic Standards: EA-3.1 Classify a relatinship as being either a functin r nt a functin when given data as a table, set f rdered pairs, r graph. EA-3.2 Use
More informationSubject description processes
Subject representatin 6.1.2. Subject descriptin prcesses Overview Fur majr prcesses r areas f practice fr representing subjects are classificatin, subject catalging, indexing, and abstracting. The prcesses
More informationREADING STATECHART DIAGRAMS
READING STATECHART DIAGRAMS Figure 4.48 A Statechart diagram with events The diagram in Figure 4.48 shws all states that the bject plane can be in during the curse f its life. Furthermre, it shws the pssible
More informationA solution of certain Diophantine problems
A slutin f certain Diphantine prblems Authr L. Euler* E7 Nvi Cmmentarii academiae scientiarum Petrplitanae 0, 1776, pp. 8-58 Opera Omnia: Series 1, Vlume 3, pp. 05-17 Reprinted in Cmmentat. arithm. 1,
More informationENG2410 Digital Design Arithmetic Circuits
ENG24 Digital Design Arithmetic Circuits Fall 27 S. Areibi Schl f Engineering University f Guelph Recall: Arithmetic -- additin Binary additin is similar t decimal arithmetic N carries + + Remember: +
More informationWRITING THE REPORT. Organizing the report. Title Page. Table of Contents
WRITING THE REPORT Organizing the reprt Mst reprts shuld be rganized in the fllwing manner. Smetime there is a valid reasn t include extra chapters in within the bdy f the reprt. 1. Title page 2. Executive
More informationNUMBERS, MATHEMATICS AND EQUATIONS
AUSTRALIAN CURRICULUM PHYSICS GETTING STARTED WITH PHYSICS NUMBERS, MATHEMATICS AND EQUATIONS An integral part t the understanding f ur physical wrld is the use f mathematical mdels which can be used t
More informationRevisiting the Socrates Example
Sectin 1.6 Sectin Summary Valid Arguments Inference Rules fr Prpsitinal Lgic Using Rules f Inference t Build Arguments Rules f Inference fr Quantified Statements Building Arguments fr Quantified Statements
More informationDetermining Optimum Path in Synthesis of Organic Compounds using Branch and Bound Algorithm
Determining Optimum Path in Synthesis f Organic Cmpunds using Branch and Bund Algrithm Diastuti Utami 13514071 Prgram Studi Teknik Infrmatika Seklah Teknik Elektr dan Infrmatika Institut Teknlgi Bandung,
More informationKeysight Technologies Understanding the Kramers-Kronig Relation Using A Pictorial Proof
Keysight Technlgies Understanding the Kramers-Krnig Relatin Using A Pictrial Prf By Clin Warwick, Signal Integrity Prduct Manager, Keysight EEsf EDA White Paper Intrductin In principle, applicatin f the
More informationFive Whys How To Do It Better
Five Whys Definitin. As explained in the previus article, we define rt cause as simply the uncvering f hw the current prblem came int being. Fr a simple causal chain, it is the entire chain. Fr a cmplex
More informationthe results to larger systems due to prop'erties of the projection algorithm. First, the number of hidden nodes must
M.E. Aggune, M.J. Dambrg, M.A. El-Sharkawi, R.J. Marks II and L.E. Atlas, "Dynamic and static security assessment f pwer systems using artificial neural netwrks", Prceedings f the NSF Wrkshp n Applicatins
More informationPreparation work for A2 Mathematics [2018]
Preparatin wrk fr A Mathematics [018] The wrk studied in Y1 will frm the fundatins n which will build upn in Year 13. It will nly be reviewed during Year 13, it will nt be retaught. This is t allw time
More informationCONSTRUCTING STATECHART DIAGRAMS
CONSTRUCTING STATECHART DIAGRAMS The fllwing checklist shws the necessary steps fr cnstructing the statechart diagrams f a class. Subsequently, we will explain the individual steps further. Checklist 4.6
More informationDomains: Operations and Algebraic Thinking Clusters: Clusters outlined in bold should drive the learning for this period of instruction.
Weeks 6-10 September/Octber/Nvember envisinmath2.0 Tpics 3-4 Critical Area(s): Multiplicatin and Divisin FOCUS fr Grade 3 Majr Wrk 70% f time Supprting Wrk 20% f time Additinal Wrk 10% f time 3.OA.A.1-2-3-4
More informationHow do scientists measure trees? What is DBH?
Hw d scientists measure trees? What is DBH? Purpse Students develp an understanding f tree size and hw scientists measure trees. Students bserve and measure tree ckies and explre the relatinship between
More informationMathematics Methods Units 1 and 2
Mathematics Methds Units 1 and 2 Mathematics Methds is an ATAR curse which fcuses n the use f calculus and statistical analysis. The study f calculus prvides a basis fr understanding rates f change in
More informationA Correlation of. to the. South Carolina Academic Standards for Mathematics Precalculus
A Crrelatin f Suth Carlina Academic Standards fr Mathematics Precalculus INTRODUCTION This dcument demnstrates hw Precalculus (Blitzer), 4 th Editin 010, meets the indicatrs f the. Crrelatin page references
More informationMATHEMATICS SYLLABUS SECONDARY 5th YEAR
Eurpean Schls Office f the Secretary-General Pedaggical Develpment Unit Ref. : 011-01-D-8-en- Orig. : EN MATHEMATICS SYLLABUS SECONDARY 5th YEAR 6 perid/week curse APPROVED BY THE JOINT TEACHING COMMITTEE
More informationDead-beat controller design
J. Hetthéssy, A. Barta, R. Bars: Dead beat cntrller design Nvember, 4 Dead-beat cntrller design In sampled data cntrl systems the cntrller is realised by an intelligent device, typically by a PLC (Prgrammable
More informationRangely RE 4 Curriculum Development 5 th Grade Mathematics
Unit Title Dctr We Still Need t Operate... Length f Unit 12 weeks Fcusing Lens(es) Inquiry Questins (Engaging Debatable): Structure Systems Standards and Grade Level Expectatins Addressed in this Unit
More informationLecture 7: Damped and Driven Oscillations
Lecture 7: Damped and Driven Oscillatins Last time, we fund fr underdamped scillatrs: βt x t = e A1 + A csω1t + i A1 A sinω1t A 1 and A are cmplex numbers, but ur answer must be real Implies that A 1 and
More informationCMSC 425: Lecture 9 Basics of Skeletal Animation and Kinematics
CMSC 425: Lecture 9 Basics f Skeletal Animatin and Kinematics Reading: Chapt f Gregr, Game Engine Architecture. The material n kinematics is a simplificatin f similar cncepts develped in the field f rbtics,
More informationinitially lcated away frm the data set never win the cmpetitin, resulting in a nnptimal nal cdebk, [2] [3] [4] and [5]. Khnen's Self Organizing Featur
Cdewrd Distributin fr Frequency Sensitive Cmpetitive Learning with One Dimensinal Input Data Aristides S. Galanpuls and Stanley C. Ahalt Department f Electrical Engineering The Ohi State University Abstract
More informationLeast Squares Optimal Filtering with Multirate Observations
Prc. 36th Asilmar Cnf. n Signals, Systems, and Cmputers, Pacific Grve, CA, Nvember 2002 Least Squares Optimal Filtering with Multirate Observatins Charles W. herrien and Anthny H. Hawes Department f Electrical
More informationIAML: Support Vector Machines
1 / 22 IAML: Supprt Vectr Machines Charles Suttn and Victr Lavrenk Schl f Infrmatics Semester 1 2 / 22 Outline Separating hyperplane with maimum margin Nn-separable training data Epanding the input int
More informationEric Klein and Ning Sa
Week 12. Statistical Appraches t Netwrks: p1 and p* Wasserman and Faust Chapter 15: Statistical Analysis f Single Relatinal Netwrks There are fur tasks in psitinal analysis: 1) Define Equivalence 2) Measure
More informationMath Foundations 20 Work Plan
Math Fundatins 20 Wrk Plan Units / Tpics 20.8 Demnstrate understanding f systems f linear inequalities in tw variables. Time Frame December 1-3 weeks 6-10 Majr Learning Indicatrs Identify situatins relevant
More informationPhysics 2010 Motion with Constant Acceleration Experiment 1
. Physics 00 Mtin with Cnstant Acceleratin Experiment In this lab, we will study the mtin f a glider as it accelerates dwnhill n a tilted air track. The glider is supprted ver the air track by a cushin
More informationLesson Plan. Recode: They will do a graphic organizer to sequence the steps of scientific method.
Lessn Plan Reach: Ask the students if they ever ppped a bag f micrwave ppcrn and nticed hw many kernels were unppped at the bttm f the bag which made yu wnder if ther brands pp better than the ne yu are
More informationYou need to be able to define the following terms and answer basic questions about them:
CS440/ECE448 Sectin Q Fall 2017 Midterm Review Yu need t be able t define the fllwing terms and answer basic questins abut them: Intr t AI, agents and envirnments Pssible definitins f AI, prs and cns f
More informationALE 21. Gibbs Free Energy. At what temperature does the spontaneity of a reaction change?
Name Chem 163 Sectin: Team Number: ALE 21. Gibbs Free Energy (Reference: 20.3 Silberberg 5 th editin) At what temperature des the spntaneity f a reactin change? The Mdel: The Definitin f Free Energy S
More informationLim f (x) e. Find the largest possible domain and its discontinuity points. Why is it discontinuous at those points (if any)?
THESE ARE SAMPLE QUESTIONS FOR EACH OF THE STUDENT LEARNING OUTCOMES (SLO) SET FOR THIS COURSE. SLO 1: Understand and use the cncept f the limit f a functin i. Use prperties f limits and ther techniques,
More informationPublic Key Cryptography. Tim van der Horst & Kent Seamons
Public Key Cryptgraphy Tim van der Hrst & Kent Seamns Last Updated: Oct 5, 2017 Asymmetric Encryptin Why Public Key Crypt is Cl Has a linear slutin t the key distributin prblem Symmetric crypt has an expnential
More informationEnhancing Performance of MLP/RBF Neural Classifiers via an Multivariate Data Distribution Scheme
Enhancing Perfrmance f / Neural Classifiers via an Multivariate Data Distributin Scheme Halis Altun, Gökhan Gelen Nigde University, Electrical and Electrnics Engineering Department Nigde, Turkey haltun@nigde.edu.tr
More informationFunction notation & composite functions Factoring Dividing polynomials Remainder theorem & factor property
Functin ntatin & cmpsite functins Factring Dividing plynmials Remainder therem & factr prperty Can d s by gruping r by: Always lk fr a cmmn factr first 2 numbers that ADD t give yu middle term and MULTIPLY
More informationEmphases in Common Core Standards for Mathematical Content Kindergarten High School
Emphases in Cmmn Cre Standards fr Mathematical Cntent Kindergarten High Schl Cntent Emphases by Cluster March 12, 2012 Describes cntent emphases in the standards at the cluster level fr each grade. These
More informationWhat is Statistical Learning?
What is Statistical Learning? Sales 5 10 15 20 25 Sales 5 10 15 20 25 Sales 5 10 15 20 25 0 50 100 200 300 TV 0 10 20 30 40 50 Radi 0 20 40 60 80 100 Newspaper Shwn are Sales vs TV, Radi and Newspaper,
More informationCompetency Statements for Wm. E. Hay Mathematics for grades 7 through 12:
Cmpetency Statements fr Wm. E. Hay Mathematics fr grades 7 thrugh 12: Upn cmpletin f grade 12 a student will have develped a cmbinatin f sme/all f the fllwing cmpetencies depending upn the stream f math
More informationCHAPTER 4 DIAGNOSTICS FOR INFLUENTIAL OBSERVATIONS
CHAPTER 4 DIAGNOSTICS FOR INFLUENTIAL OBSERVATIONS 1 Influential bservatins are bservatins whse presence in the data can have a distrting effect n the parameter estimates and pssibly the entire analysis,
More informationYEAR 6 (PART A) Textbook 6A schema
YEAR 6 (PART A) Textbk 6A schema Chapter 1 Numbers t 10 Millin Lessn 1 Reading and Writing Numbers t 10 Millin T create and identify numbers t 10 000 000; t write in numerals and wrds numbers t 10 000
More informationSection 5.8 Notes Page Exponential Growth and Decay Models; Newton s Law
Sectin 5.8 Ntes Page 1 5.8 Expnential Grwth and Decay Mdels; Newtn s Law There are many applicatins t expnential functins that we will fcus n in this sectin. First let s lk at the expnential mdel. Expnential
More informationNUROP CONGRESS PAPER CHINESE PINYIN TO CHINESE CHARACTER CONVERSION
NUROP Chinese Pinyin T Chinese Character Cnversin NUROP CONGRESS PAPER CHINESE PINYIN TO CHINESE CHARACTER CONVERSION CHIA LI SHI 1 AND LUA KIM TENG 2 Schl f Cmputing, Natinal University f Singapre 3 Science
More informationLecture 6: Phase Space and Damped Oscillations
Lecture 6: Phase Space and Damped Oscillatins Oscillatins in Multiple Dimensins The preius discussin was fine fr scillatin in a single dimensin In general, thugh, we want t deal with the situatin where:
More informationFall 2013 Physics 172 Recitation 3 Momentum and Springs
Fall 03 Physics 7 Recitatin 3 Mmentum and Springs Purpse: The purpse f this recitatin is t give yu experience wrking with mmentum and the mmentum update frmula. Readings: Chapter.3-.5 Learning Objectives:.3.
More informationArea of Learning: Mathematics Foundations of Mathematics and Pre-calculus 10
Area f Learning: Mathematics Fundatins f Mathematics and Pre-calculus 10 Big Ideas Elabratins Algebra allws us t generalize relatinships thrugh abstract thinking. generalize: The meanings f, and cnnectins
More informationENSC Discrete Time Systems. Project Outline. Semester
ENSC 49 - iscrete Time Systems Prject Outline Semester 006-1. Objectives The gal f the prject is t design a channel fading simulatr. Upn successful cmpletin f the prject, yu will reinfrce yur understanding
More informationDocument for ENES5 meeting
HARMONISATION OF EXPOSURE SCENARIO SHORT TITLES Dcument fr ENES5 meeting Paper jintly prepared by ECHA Cefic DUCC ESCOM ES Shrt Titles Grup 13 Nvember 2013 OBJECTIVES FOR ENES5 The bjective f this dcument
More informationPipetting 101 Developed by BSU CityLab
Discver the Micrbes Within: The Wlbachia Prject Pipetting 101 Develped by BSU CityLab Clr Cmparisns Pipetting Exercise #1 STUDENT OBJECTIVES Students will be able t: Chse the crrect size micrpipette fr
More informationSections 15.1 to 15.12, 16.1 and 16.2 of the textbook (Robbins-Miller) cover the materials required for this topic.
Tpic : AC Fundamentals, Sinusidal Wavefrm, and Phasrs Sectins 5. t 5., 6. and 6. f the textbk (Rbbins-Miller) cver the materials required fr this tpic.. Wavefrms in electrical systems are current r vltage
More informationECEN 4872/5827 Lecture Notes
ECEN 4872/5827 Lecture Ntes Lecture #5 Objectives fr lecture #5: 1. Analysis f precisin current reference 2. Appraches fr evaluating tlerances 3. Temperature Cefficients evaluatin technique 4. Fundamentals
More informationGraduate AI Lecture 16: Planning 2. Teachers: Martial Hebert Ariel Procaccia (this time)
Graduate AI Lecture 16: Planning 2 Teachers: Martial Hebert Ariel Prcaccia (this time) Reminder State is a cnjunctin f cnditins, e.g., at(truck 1,Shadyside) at(truck 2,Oakland) States are transfrmed via
More informationComputational modeling techniques
Cmputatinal mdeling techniques Lecture 2: Mdeling change. In Petre Department f IT, Åb Akademi http://users.ab.fi/ipetre/cmpmd/ Cntent f the lecture Basic paradigm f mdeling change Examples Linear dynamical
More informationAn Introduction to Complex Numbers - A Complex Solution to a Simple Problem ( If i didn t exist, it would be necessary invent me.
An Intrductin t Cmple Numbers - A Cmple Slutin t a Simple Prblem ( If i didn t eist, it wuld be necessary invent me. ) Our Prblem. The rules fr multiplying real numbers tell us that the prduct f tw negative
More informationMODULAR DECOMPOSITION OF THE NOR-TSUM MULTIPLE-VALUED PLA
MODUAR DECOMPOSITION OF THE NOR-TSUM MUTIPE-AUED PA T. KAGANOA, N. IPNITSKAYA, G. HOOWINSKI k Belarusian State University f Infrmatics and Radielectrnics, abratry f Image Prcessing and Pattern Recgnitin.
More information3.4 Shrinkage Methods Prostate Cancer Data Example (Continued) Ridge Regression
3.3.4 Prstate Cancer Data Example (Cntinued) 3.4 Shrinkage Methds 61 Table 3.3 shws the cefficients frm a number f different selectin and shrinkage methds. They are best-subset selectin using an all-subsets
More information