Automated Modeling of Stochastic Reactions with Large Measurement Time-Gaps

Size: px
Start display at page:

Download "Automated Modeling of Stochastic Reactions with Large Measurement Time-Gaps"

Transcription

1 Automted Modeling of Stochstic Rections with Lrge Mesurement Time-Gps Michel Schmidt Computtionl Synthesis L Cornell University Ithc, NY mds47@cornell.edu Hod Lipson Computtionl Synthesis L Cornell University Ithc, NY hod.lipson@cornell.edu ABSTRACT Mny systems, prticulrly in iology nd chemistry, involve the interction of discrete quntities, such s individul elements or molecules. When the totl numer of elements in the system is low, the impct of individul rections ecomes non-negligile nd modeling requires the simultion of exct sequences of rections. In this pper, we introduce n lgorithm tht cn infer n exct stochstic rection model sed on sprse mesurements of n evolving system of discrete quntities. The lgorithm is sed on simulting cndidte model to mximize the likelihood of the dt. When the likelihood is too smll to provide serch grdient, the lgorithm uses the distnce of the dt to the model's estimted distriution. Results show tht this method infers stochstic models relily with oth short time gps etween mesurements of the system, nd long time gps where the system stte hs evolved qulittively fr etween ech mesurement. Furthermore, the proposed metric outperforms optimizing on likelihood or distnce components lone. Trits mesured on the serch novelty, ge, nd lot suggest tht this lgorithm scles well to incresingly complex systems. Ctegories nd Suject Descriptors I.6.5 [Simultion nd Modeling]: Model Development Modeling methodologies. Generl Terms Algorithms, Design, Performnce. Keywords Stochstic modeling, stochstic simultion. 1. INTRODUCTION Stochstic systems pervde nerly ll res of science, from quntum properties of tomic prticles, to chemicl rections in chemicl th, to fluctutions in popultions or ecosystems. All stochstic systems re t lest prtilly rndom, mking them difficult to model dynmiclly or deterministiclly. Insted, Permission to mke digitl or hrd copies of ll or prt of this work for personl or clssroom use is grnted without fee provided tht copies re not mde or distriuted for profit or commercil dvntge nd tht copies er this notice nd the full cittion on the first pge. To copy otherwise, or repulish, to post on servers or to redistriute to lists, requires prior specific permission nd/or fee. GECCO 11, July 12 16, 2011, Dulin, Irelnd. Copyright 2011 ACM /11/07...$ Monte Crlo methods re often employed to simulte nd nlyze their ehvior. A prticulrly importnt Monte Crlo method ws developed y Dn Gillespie in 1977 in order to model chemicl rections kinetics [1]. The Gillespie lgorithm performs n exct nd sttisticlly-correct simultion of stochstic system sed on set of discrete chemicl rections, rection coefficients, nd initil conditions. The Gillespie lgorithm hs een used extensively in systems iology, nd lso similr domins. Trditionlly, the set of rections tht model stochstic system must e developed nd theorized mnully y experts. In this pper we introduce n evolutionry lgorithm tht utomticlly hypothesizes out the rections nd rection rtes tking plce in system simply y nlyzing rw experimentl dt, even with lrge time gps etween oservtions (see Figure 1). The proposed method serches over spce of rections in order to find the mximum likelihood model tht grees with the experimentl oservtions. The key chllenge to serching over stochstic models is the computtionl cost of estimting likelihood vlues from model nd mintining serch grdient. Except for only the most trivil systems, the proility density of set of stochstic rections cnnot e solved over time. Insted, the model cn e simulted (or smpled) repetedly. However, efficient smpling methods fil over lrge time spns [2], mking it difficult to estimte distriution tils. The proposed method overcomes this difficulty y using twocomponent optimiztion metric. The metric ttempts to mximize the log-likelihood of the dt given cndidte model. However, if the likelihood is too smll to provide grdient for the serch, the criterion chnges to the distnce of ech dt point to the estimted proility density of the cndidte model. In effect, this distnce component llows even extremely inccurte models to improve despite hving zero likelihood. Once models get close enough to the dt, where their likelihoods cn e estimted ccurtely through smpling, the metric switches to mximize the likelihood. This metric lso reduces the computtionl complexity, s the ccurcy of estimting the tils of distriutions is less importnt. The lgorithm cn therey use fewer smples (fewer simultions of cndidte model) nd still estimte useful likelihood grdient. 2. BACKGROUND Here we introduce importnt concepts in stochstic simultion lgorithms, density estimtion, nd evolutionry lgorithms. 307

2 1500 Periodic Smples of Stochstic System Mximum Likelihood Stochstic Model x 10 2 x y x + y y y 10 ø x Figure 1. Overview of the modeling prolem. A stochstic system evolves n exct ehvior over time shown in lue. Periodiclly, the stte of system cn e mesured (shown in red dots), smple of the exct time evolution of the system. The tsk is to infer mximum likelihood stochstic model (right) for this system from these periodic mesurements. Actul dt nd solution shown. 2.1 Stochstic Simultion Algorithms The exct stochstic simultion lgorithm ws first developed in [3] nd lter pplied to chemicl kinetics in [1]. The method mkes few ssumptions out the system except tht the environment is well mixed. The sic lgorithm involves two steps: (1) smpling time dely until the next rection occurs, nd (2) smpling mong possile rections which occurs. Ech of these smples re dependent on the numer of molecules in the current stte. When there re lrge numer of molecules, the time until the next rection cn e extremely smll. The counts of ech species lso influences which rection is more likely to occur. The system is simulted y repetedly pplying rections nd incrementing time y the smpled time mount, resulting in rndom wlk, time-series trjectory. See [1] for more detils. The exct simultion of the Gillespie lgorithm ecomes criticlly importnt when the numer of molecules is sufficiently smll. In this cse, single rections cn significntly impct rection propensities nd future sttes (e.g. reching terminting stte). When the numer of molecules is exceedingly lrge, the system dynmics re pproximtely deterministic ecuse lrge numers of rections tend to verge out rndom fluctutions. The exctness of the Gillespie lgorithm does come t computtion cost, nd severl methods hve een proposed to improve its performnce, while still preserving exctness where necessry. For our simultions, we use the modified Poisson tu-leping procedure tht ensures tht t most one criticl rection occurs per lep [4]. The tu-leping speeds up the stochstic simultion y estimting the numer of rections occurring during time period tu. The vlue of tu is chosen such tht the chnge in rection propensities during tu is ritrrily smll. When the tu lep is not lrge enough to provide useful speed up, the lgorithm defults to n exct simultion. 2.2 Kernel Density Estimtion In order to clculte the likelihood of the dt given cndidte model, we need to estimte the proility density of the model t ech dt point. There re mny wys to estimte proility densities. A simple method is to use histogrm. The histogrm divides ll smples (in our cse counts of molecules fter simulting model) into numer of ins. The density is then the in frequency divided y the in width. Severl methods exist for choosing optiml in widths nd positions [5]. A mjor drwck to inned histogrms however is tht they re loclly flt everywhere. In other words, they hve no locl grdient tht is menle to optimiztion. An lterntive to histogrm, nd the method used in our experiments, is kernel density estimtion [6, 7]. Kernel density estimtion is non-prmetric method to estimte proility density functions. It sums series of kernel functions tht re centered on ech smple. We used Gussin kernel function, mening ech smple contriuted Gussin density round its smple vlue. Choosing uniform kernel for exmple would produce result similr to inned histogrm. The Gussin kernel produces density estimtes, useful for optimizing, however we still need to specify ndwidth. The ndwidth is nlogous to the in width in inned histogrm. Vrile kernel ndwidth selection is the technique of selecting different ndwidth for ech smple [8]. Vrile ndwidths llow the kernels to e nrrow in high density regions, cpturing high detils of the distriution, nd wide in less certin lowdensity res. 308

3 Rections: 1,1 x 1 + 1,2 x 2 c 1,1 x 1 + 1,2 x 2 Encoding: m 1,1 2,1,1 1,2 2,2 c 2,1 x 1 + 2,2 x 2 2,1 x 1 + 2,2 x 2 m,2 1, n 2, n m, n c c c 1 1 m m 1,1 2,1,1 1,2 2,2 m,2 1, n 2, n m, n integers integers Figure 2. The encoding of solution representing stochstic model of discrete rections. A series of chemicl rections (top) re represented y corresponding integer coefficients nd rel vlued rte constnts for ech rection (ottom). rels In our experiments, we used the squre-root lw [9] for selecting the ndwidths per smple. This technique requires n initil estimte of the density here, we used n ordinry histogrm with optimize ins chosen y minimizing the men integrted squred error (MISE) [5]. The finl result is smooth continuous estimte of the proility density tht cptures oth shrp nd diffuse fetures in the distriution. 3. ALGORITHM The proposed method for inferring mximum likelihood stochstic model uses n evolutionry lgorithm to serch for sets of rection chnnels nd rtes to mtch the dt. In this section, we descrie the evolutionry encoding of cndidte models in the serch, nd the fitness function. 3.1 Encoding The stochstic model consists of series of rections. Ech rection specifies n integer numer for the inputs, n integer numer for the outputs, nd rel vlued numer for the rection rte. If rection does not use n input, its input vlue is 0; likewise for outputs. We use fixed, mximum numer of rections for our experiments. Cndidte models cn opt to use fewer rections thn the mximum y setting the rection rte to 0, or setting the inputs nd outputs to 0. Figure 2 summrizes our encoding for stochstic model. It consists of mtrix of integer vlued input coefficients for ech rection, vector of rel vlued coefficients for ech rection, nd mtrix of integer vlued output coefficients for ech rection. A rndom encoding is produced y filling ech mtrix with rndom integers, normlly distriuted with zero men nd stndrd devition of 1, nd filling the rection vector with rndom positive rel vlues, normlly distriuted with zero men nd stndrd devition of 1. The muttion opertor works y rndomizing ech individul element with fixed point muttion proility. The crossover opertion recomines two prent encodings to form new offspring. We use rndom single point crossover on the rections for exmple, copying the first n rections (inputs, outputs, nd rte) from the first prent, nd the remining from the second prent. The complexity of the encoding is defined s the sum of ll integer vlued rection coefficients on oth inputs nd outputs of the rections. 3.2 Likelihood Estimte Our gol is to find mximum likelihood model. We cnnot estimted the likelihood of model explicitly, however, we cn estimte the likelihood of seeing the experimentl dt given specific model. This gives mesure of how well prticulr model grees with the dt. In other words, we re trying to mximize the following expression: Likelihood P( xi n i 1 M m) Here, n is the numer of dt points (mesurements of system stte), x i is prticulr dt point, m is prticulr model, nd P is the proility density of the model m t dt point i. Rther thn working directly with proilities, it is numericlly more stle to work with the log of proilities, or the Log- Likelihood: Log Likelihood n i1 log P( x i M m) 309

4 Figure 3. Compring cndidte model with the experimentl dt. The left pne shows the hypotheticl exct ehvior of system in lue, nd two known mesurements of the system t red dots. The cndidte model is simulted multiple times, strting from the first mesurement for t seconds, in order to estimte proility distriution of the model (right). The stte of the second mesurement is then compred with this distriution to evlute the qulity of the model to reproduce the mesurement. To evlute the likelihood, we need to estimte the vlue of P(x i M = m). We do this y smpling the model m tht is, simulting the model over the time spn from the previous dt i 1 point to the current dt point i. Figure 3 visulizes the simultion process. The cndidte model is simulted, using the previous stte, until the time reches the current stte. Ech simultion is then dded to kernel density estimtor, descried ove, to estimte the proility density P. The log of the density is then summed for ech stte x of the system to the cumultive log-likelihood vlue. 3.3 Fitness Function Ultimtely we wnt to mximize the likelihood of cndidte model, ut since we cn only pproximte the density function, most rndom models will tend to hve zero likelihood nd no grdient to optimize on ecuse we cnnot ccurtely estimte the tils of the proility density function. Our solution to this prolem is to use two-component fitness metric. The two components re: 1. The log-likelihood s usul, nd 2. The distnce of the dt point to the medin vlue of the estimted distriution When model hs ner zero likelihood (e.g. lower thn epsilon = 10-6 in our experiments) we sutrct the distnce of the dt point to the medin vlue of the distriution. Otherwise, the fitness is equl to the log-likelihood. This fitness metric is summrized in Figure 3. By dding the log-likelihood component to the distnce component, the fitness function remins monotoniclly incresing for improving models. This llows initilly poor rndom models to move their distriutions close enough to the dt points such tht their density estimtions cn e used to mximize the likelihood. 4. EXPERIMENTS We perform proof of concept experiments on the sic Lotk- Volterr model [10, 11]. The trget rections for this system re shown elow: x x y y x 2y 0 The Lotk-Volterr rections model predtor-prey system. In the first rection, prey (represented y x) grow exponentilly. In the second rection, prey my meet predtors (represented y y), cusing prey to die nd predtors to increse in numer. Finlly in the lst rection, predtor cn die out. We generted dt sets of 10 pirs of mesurements of the Lotk- Volterr system. Ech pir consists of rndom initil condition, followed y mesurement fter simulting for fixed time durtion. In our experiments, we compre two types of dt sets, those with short time gps, where mesurements re mde in short succession (time steps of 0.002), nd long time gps (time steps of 0.1) where the stte of the system chnges drmticlly etween mesurements. An exmple of the long time gps dt set is shown in Figure 3 (left), where ech green rrow is pir of mesurements. 310

5 In the evolutionry lgorithm we use popultion size of 30, crossover proility of 50%, nd muttion proility of 15%. We llow mximum of 3 rections in ech model. In estimting model density for dt point, we smple 100 independent simultions. We trck vrious sttistics of the est solution throughout ech tril, including fitness on trining nd test dt sets. We terminte ll tril runs fter 300 itertions (genertions) of the evolutionry lgorithm. We repeted multiple trils of the evolutionry lgorithm using three different fitness metrics: 1. Log-likelihood only 2. Medin distnce only 3. The proposed distnce nd Log-likelihood metric Therefore, we will e le to evlute strengths or weknesses of ech component in the proposed metric. Figure 4. The serch performnce of the three compred fitness metrics. The top pnes show performnce when dt points pper in rpid succession with short gps in time. The ottom pnes show performnce when there re long gps of time etween dt points. The left pnes show the likelihood score of the est model during the serch. The right pnes show the percent of runs tht identified the exct solution for the mount of computtionl effort. Error rs indicte the stndrd error. 311

6 5. RESULTS The first results is tht the evolutionry lgorithm is le to find the mximum likelihood model for ll three compred fitness metrics. For the short time gp dt set, Figure 4 (top) shows tht ll three metrics rech pproximtely 90% convergence to the exct known model. Both the likelihood nd hyrid metrics perform 100% convergence fter 100 genertions. In terms of computtion time, ech genertion took pproximtely 1 minute. Most computtion cost lies in simulting vrious cndidte models to estimte their proility densities for ech dt point. On the dt set with lrge time gps, Figure 4 (ottom) shows greter differentition etween the three metrics. The twocomponent metric reches the highest likelihood models nd convergence, followed y the likelihood only metric. The distnce metric only performs the worst. Interestingly, when the time gps re short, the performnce of the two-component metric nd likelihood metric re only pproximtely similr. This indictes tht on short time gps, the proility density of rndom cndidte models is more likely to provided useful serch grdient, ecuse dt points re close to their initil conditions. Here, there is no enefit to using the extr distnce component in the fitness metric. However, the distnce metric ppers to e crucil when the dt set hs lrge time gps (Figure 4). Here, the two-component metric out performs the other metrics. Also interesting is tht the distnce metric lone performs very poorly. This metric llows models to get their distriutions centered on the dt, ut does not optimize the likelihood mking it indequte on its own. In Figure 5 we compre the reltionship etween the loglikelihood score nd the distnce metric. We cn see tht the distnce is correlted with the log-likelihood, ut imperfect. There is lrge vrince verticlly in the log-likelihood for fixed distnce, indicting tht log-likelihood metric is inccurte or t lest unstle t the tils of the model proility distriution. Finlly, we collected vrious trits of the est solution for ech lgorithm during ech serch, shown in Figure 6. The first oservtion is tht the genotypic ge [12] of the est solution (mesured in genertions) is roughly equl to the totl genertions on verge. This indictes tht the evolutionry serch is not eing trpped y locl optim, otherwise the est solutions would pper younger s younger solutions would replce solutions in locl optim. Interestingly, the distnce metric lgorithm tended to hve the highest ges, suggesting tht it voided locl optim most, perhps y identifying n ttrcting region for the glol optim most relily. The novelty of the est solution over time, shown in Figure 6, shows tht the popultions re initilly very diverse efore converging onto optim. But no cler difference etween the compred metrics is pprent. Novelty [13] is defined s the verge distnce summed over the rection coefficients of cndidte solution to nerest neighors in the current popultion. In terms of lot [14], the lgorithm strts off with low lot rtion fter rndom initiliztion. The lot tends to increse quickly, nd then fll towrd rtio of 1 (no lot) s the est solution converges to the trget (Figure 6). The distnce only Figure 5. The reltionships etween the distnce metric of model nd its corresponding likelihood given the experimentl dt. Ech point in the plot is rndom cndidte model during the likelihood serch. 312

7 Figure 6. Trits of the est model over time during the evolutionry serch. The top left plot shows the genotypic ge of the est solution (the numer of genertions ny prt of the solution existed in the popultion). The top right shows the novelty of the est solution (how different it is from the rest of the popultion). The ottom pne shows the lot of the est solution (rtio its complexity with the trget solution complexity). Error rs indicte the stndrd error. metric tended to rech higher lot, which my e reflection tht it ws less likely to converge to the trget. One finl oservtion is tht for these trits in Figure 6, there ppers to e very little difference etween the likelihood metric nd the two-component metric. The key difference is only in the overll performnce (Figure 4). This suggests tht the role of the distnce component is to help models move towrd the dt so tht the likelihood component cn e used, nd does not impct other spects of the popultion or evolutionry lgorithm. 6. CONCLUSIONS In this pper we introduced n utomted lgorithm for identifying stochstic rection models. The proposed method used n evolutionry lgorithm to identify mximum likelihood set of rections nd rection coefficients. Insted of only optimizing likelihood, the proposed lgorithm used two-component fitness metric tht optimized the distnce of cndidte model's distriution from the dt point when the likelihood ws too smll to provide n ccurte serch grdient. The experiments indicte tht the likelihood metric lone performs well on dt with short time gps in dt set. However, when the dt set contined lrge time gps, where the stte of the system evolved fr from the locl ehvior the two-component fitness metric performed est, finding the exct trget solution fster nd more relily. Oservtions on the ge, novelty, nd lot of the est solution indicte tht the lgorithm voids locl optim, nd could scle well with incresing complexity systems. 313

8 7. ACKNOWLEDGMENTS This work ws supported in prt y NIH NIDA grnt RC2 DA028981, NSF CDI Grnt ECCS , nd DTRA grnt HDTRA The content of this pper is solely the responsiility of the uthors nd does not necessrily represent the officil views of the sponsoring orgniztions. 8. REFERENCES [1] D. T. Gillespie, "Exct Stochstic Simultion of Coupled Chemicl Rections," The Journl of Physicl Chemistry, vol. 81, pp , [2] D. T. Gillespie, "Stochstic simultion of chemicl kinetics," Annu Rev Phys Chem, vol. 58, pp , [3] J. L. Doo, "Mrkoff chins--denumerle cse " Trns. Amer. Mth. Soc., vol. 58, pp , [4] Y. Co, D. T. Gillespie, nd L. R. Petzold, "Avoiding negtive popultions in explicit Poisson tu-leping," J Chem Phys, vol. 123, p , Aug [5] S. Hideki nd S. Shigeru, "A Method for Selecting the Bin Size of Time Histogrm," Neurl Comput., vol. 19, pp , [6] M. Rosenltt, "Remrks on some nonprmetric estimtes of density function," Ann. Mth. Sttist., vol. 27, pp , [7] E. Przen, "On Estimtion of Proility Density Function nd Mode," The Annls of Mthemticl Sttistics, vol. 33, pp , [8] G. Terrell nd D. Scott, "Vrile kernel density estimtion," The Annls of Sttistics, vol. 20, pp , [9] I. S. Armson, "On ndwidth vrition in kernel estimtes-- squre root lw," Ann. Sttist., vol. 10, pp , [10] A. J. Lotk, Elements of physicl iology. Bltimore: Willims & Wilkins Co., [11] V. Volterr, "Vrizioni e fluttuzioni del numero d'individui in specie nimli conviventi," Mem. R. Accd. Nz. dei Lincei, vol. 2, [12] G. S. Horny, "ALPS: the ge-lyered popultion structure for reducing the prolem of premture convergence," in GECCO 2006: Proceedings of the 8th nnul conference on Genetic nd evolutionry computtion. vol. 1, ACM SIGEVO (formerly ISGEC), 2006, pp [13] J. Lehmn nd K. O. Stnley, "Andoning Ojectives: Evolution through the Serch for Novelty Alone," Evol Comput, p. 24, Sep [14] W. Bnzhf nd W. B. Lngdon, "Some considertions on the reson for lot," in Genetic Progrmming nd Evolvle Mchines. vol. 3, 2002, pp

Bayesian Networks: Approximate Inference

Bayesian Networks: Approximate Inference pproches to inference yesin Networks: pproximte Inference xct inference Vrillimintion Join tree lgorithm pproximte inference Simplify the structure of the network to mkxct inferencfficient (vritionl methods,

More information

Genetic Programming. Outline. Evolutionary Strategies. Evolutionary strategies Genetic programming Summary

Genetic Programming. Outline. Evolutionary Strategies. Evolutionary strategies Genetic programming Summary Outline Genetic Progrmming Evolutionry strtegies Genetic progrmming Summry Bsed on the mteril provided y Professor Michel Negnevitsky Evolutionry Strtegies An pproch simulting nturl evolution ws proposed

More information

Monte Carlo method in solving numerical integration and differential equation

Monte Carlo method in solving numerical integration and differential equation Monte Crlo method in solving numericl integrtion nd differentil eqution Ye Jin Chemistry Deprtment Duke University yj66@duke.edu Abstrct: Monte Crlo method is commonly used in rel physics problem. The

More information

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17 EECS 70 Discrete Mthemtics nd Proility Theory Spring 2013 Annt Shi Lecture 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion,

More information

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17 CS 70 Discrete Mthemtics nd Proility Theory Summer 2014 Jmes Cook Note 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion, y tking

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

The Minimum Label Spanning Tree Problem: Illustrating the Utility of Genetic Algorithms

The Minimum Label Spanning Tree Problem: Illustrating the Utility of Genetic Algorithms The Minimum Lel Spnning Tree Prolem: Illustrting the Utility of Genetic Algorithms Yupei Xiong, Univ. of Mrylnd Bruce Golden, Univ. of Mrylnd Edwrd Wsil, Americn Univ. Presented t BAE Systems Distinguished

More information

Convert the NFA into DFA

Convert the NFA into DFA Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:

More information

SUMMER KNOWHOW STUDY AND LEARNING CENTRE

SUMMER KNOWHOW STUDY AND LEARNING CENTRE SUMMER KNOWHOW STUDY AND LEARNING CENTRE Indices & Logrithms 2 Contents Indices.2 Frctionl Indices.4 Logrithms 6 Exponentil equtions. Simplifying Surds 13 Opertions on Surds..16 Scientific Nottion..18

More information

Math 1B, lecture 4: Error bounds for numerical methods

Math 1B, lecture 4: Error bounds for numerical methods Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the

More information

Derivations for maximum likelihood estimation of particle size distribution using in situ video imaging

Derivations for maximum likelihood estimation of particle size distribution using in situ video imaging 2 TWMCC Texs-Wisconsin Modeling nd Control Consortium 1 Technicl report numer 27-1 Derivtions for mximum likelihood estimtion of prticle size distriution using in situ video imging Pul A. Lrsen nd Jmes

More information

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4 Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one

More information

Tests for the Ratio of Two Poisson Rates

Tests for the Ratio of Two Poisson Rates Chpter 437 Tests for the Rtio of Two Poisson Rtes Introduction The Poisson probbility lw gives the probbility distribution of the number of events occurring in specified intervl of time or spce. The Poisson

More information

1B40 Practical Skills

1B40 Practical Skills B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need

More information

4.1. Probability Density Functions

4.1. Probability Density Functions STT 1 4.1-4. 4.1. Proility Density Functions Ojectives. Continuous rndom vrile - vers - discrete rndom vrile. Proility density function. Uniform distriution nd its properties. Expected vlue nd vrince of

More information

CS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata

CS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata CS103B ndout 18 Winter 2007 Ferury 28, 2007 Finite Automt Initil text y Mggie Johnson. Introduction Severl childrens gmes fit the following description: Pieces re set up on plying ord; dice re thrown or

More information

4.4 Areas, Integrals and Antiderivatives

4.4 Areas, Integrals and Antiderivatives . res, integrls nd ntiderivtives 333. Ares, Integrls nd Antiderivtives This section explores properties of functions defined s res nd exmines some connections mong res, integrls nd ntiderivtives. In order

More information

CS667 Lecture 6: Monte Carlo Integration 02/10/05

CS667 Lecture 6: Monte Carlo Integration 02/10/05 CS667 Lecture 6: Monte Crlo Integrtion 02/10/05 Venkt Krishnrj Lecturer: Steve Mrschner 1 Ide The min ide of Monte Crlo Integrtion is tht we cn estimte the vlue of n integrl by looking t lrge number of

More information

Review of Calculus, cont d

Review of Calculus, cont d Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some

More information

Suppose we want to find the area under the parabola and above the x axis, between the lines x = 2 and x = -2.

Suppose we want to find the area under the parabola and above the x axis, between the lines x = 2 and x = -2. Mth 43 Section 6. Section 6.: Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot

More information

Acceptance Sampling by Attributes

Acceptance Sampling by Attributes Introduction Acceptnce Smpling by Attributes Acceptnce smpling is concerned with inspection nd decision mking regrding products. Three spects of smpling re importnt: o Involves rndom smpling of n entire

More information

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn

More information

12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2014

12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2014 CS125 Lecture 12 Fll 2014 12.1 Nondeterminism The ide of nondeterministic computtions is to llow our lgorithms to mke guesses, nd only require tht they ccept when the guesses re correct. For exmple, simple

More information

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions

More information

Section 6.1 Definite Integral

Section 6.1 Definite Integral Section 6.1 Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot e determined

More information

Review of Gaussian Quadrature method

Review of Gaussian Quadrature method Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge

More information

Homework Solution - Set 5 Due: Friday 10/03/08

Homework Solution - Set 5 Due: Friday 10/03/08 CE 96 Introduction to the Theory of Computtion ll 2008 Homework olution - et 5 Due: ridy 10/0/08 1. Textook, Pge 86, Exercise 1.21. () 1 2 Add new strt stte nd finl stte. Mke originl finl stte non-finl.

More information

Math 8 Winter 2015 Applications of Integration

Math 8 Winter 2015 Applications of Integration Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl

More information

Nondeterminism and Nodeterministic Automata

Nondeterminism and Nodeterministic Automata Nondeterminism nd Nodeterministic Automt 61 Nondeterminism nd Nondeterministic Automt The computtionl mchine models tht we lerned in the clss re deterministic in the sense tht the next move is uniquely

More information

Bases for Vector Spaces

Bases for Vector Spaces Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything

More information

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3 2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is

More information

List all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1.

List all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1. Mth Anlysis CP WS 4.X- Section 4.-4.4 Review Complete ech question without the use of grphing clcultor.. Compre the mening of the words: roots, zeros nd fctors.. Determine whether - is root of 0. Show

More information

A likelihood-ratio test for identifying probabilistic deterministic real-time automata from positive data

A likelihood-ratio test for identifying probabilistic deterministic real-time automata from positive data A likelihood-rtio test for identifying proilistic deterministic rel-time utomt from positive dt Sicco Verwer 1, Mthijs de Weerdt 2, nd Cees Witteveen 2 1 Eindhoven University of Technology 2 Delft University

More information

12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2016

12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2016 CS125 Lecture 12 Fll 2016 12.1 Nondeterminism The ide of nondeterministic computtions is to llow our lgorithms to mke guesses, nd only require tht they ccept when the guesses re correct. For exmple, simple

More information

1 Nondeterministic Finite Automata

1 Nondeterministic Finite Automata 1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you

More information

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite Unit #8 : The Integrl Gols: Determine how to clculte the re described by function. Define the definite integrl. Eplore the reltionship between the definite integrl nd re. Eplore wys to estimte the definite

More information

The steps of the hypothesis test

The steps of the hypothesis test ttisticl Methods I (EXT 7005) Pge 78 Mosquito species Time of dy A B C Mid morning 0.0088 5.4900 5.5000 Mid Afternoon.3400 0.0300 0.8700 Dusk 0.600 5.400 3.000 The Chi squre test sttistic is the sum of

More information

7.1 Integral as Net Change and 7.2 Areas in the Plane Calculus

7.1 Integral as Net Change and 7.2 Areas in the Plane Calculus 7.1 Integrl s Net Chnge nd 7. Ares in the Plne Clculus 7.1 INTEGRAL AS NET CHANGE Notecrds from 7.1: Displcement vs Totl Distnce, Integrl s Net Chnge We hve lredy seen how the position of n oject cn e

More information

Session 13

Session 13 780.20 Session 3 (lst revised: Februry 25, 202) 3 3. 780.20 Session 3. Follow-ups to Session 2 Histogrms of Uniform Rndom Number Distributions. Here is typicl figure you might get when histogrmming uniform

More information

C/CS/Phys C191 Bell Inequalities, No Cloning, Teleportation 9/13/07 Fall 2007 Lecture 6

C/CS/Phys C191 Bell Inequalities, No Cloning, Teleportation 9/13/07 Fall 2007 Lecture 6 C/CS/Phys C9 Bell Inequlities, o Cloning, Teleporttion 9/3/7 Fll 7 Lecture 6 Redings Benenti, Csti, nd Strini: o Cloning Ch.4. Teleporttion Ch. 4.5 Bell inequlities See lecture notes from H. Muchi, Cltech,

More information

Section 4: Integration ECO4112F 2011

Section 4: Integration ECO4112F 2011 Reding: Ching Chpter Section : Integrtion ECOF Note: These notes do not fully cover the mteril in Ching, ut re ment to supplement your reding in Ching. Thus fr the optimistion you hve covered hs een sttic

More information

Review of Probability Distributions. CS1538: Introduction to Simulations

Review of Probability Distributions. CS1538: Introduction to Simulations Review of Proility Distriutions CS1538: Introduction to Simultions Some Well-Known Proility Distriutions Bernoulli Binomil Geometric Negtive Binomil Poisson Uniform Exponentil Gmm Erlng Gussin/Norml Relevnce

More information

Interpreting Integrals and the Fundamental Theorem

Interpreting Integrals and the Fundamental Theorem Interpreting Integrls nd the Fundmentl Theorem Tody, we go further in interpreting the mening of the definite integrl. Using Units to Aid Interprettion We lredy know tht if f(t) is the rte of chnge of

More information

NUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by.

NUMERICAL INTEGRATION. The inverse process to differentiation in calculus is integration. Mathematically, integration is represented by. NUMERICAL INTEGRATION 1 Introduction The inverse process to differentition in clculus is integrtion. Mthemticlly, integrtion is represented by f(x) dx which stnds for the integrl of the function f(x) with

More information

LAMEPS Limited area ensemble forecasting in Norway, using targeted EPS

LAMEPS Limited area ensemble forecasting in Norway, using targeted EPS Limited re ensemle forecsting in Norwy, using trgeted Mrit H. Jensen, Inger-Lise Frogner* nd Ole Vignes, Norwegin Meteorologicl Institute, (*held the presenttion) At the Norwegin Meteorologicl Institute

More information

Math 270A: Numerical Linear Algebra

Math 270A: Numerical Linear Algebra Mth 70A: Numericl Liner Algebr Instructor: Michel Holst Fll Qurter 014 Homework Assignment #3 Due Give to TA t lest few dys before finl if you wnt feedbck. Exercise 3.1. (The Bsic Liner Method for Liner

More information

Entanglement Purification

Entanglement Purification Lecture Note Entnglement Purifiction Jin-Wei Pn 6.5. Introduction( Both long distnce quntum teleporttion or glol quntum key distriution need to distriute certin supply of pirs of prticles in mximlly entngled

More information

MA123, Chapter 10: Formulas for integrals: integrals, antiderivatives, and the Fundamental Theorem of Calculus (pp.

MA123, Chapter 10: Formulas for integrals: integrals, antiderivatives, and the Fundamental Theorem of Calculus (pp. MA123, Chpter 1: Formuls for integrls: integrls, ntiderivtives, nd the Fundmentl Theorem of Clculus (pp. 27-233, Gootmn) Chpter Gols: Assignments: Understnd the sttement of the Fundmentl Theorem of Clculus.

More information

Evolutionary Computation

Evolutionary Computation Topic 9 Evolutionry Computtion Introduction, or cn evolution e intelligent? Simultion of nturl evolution Genetic lgorithms Evolution strtegies Genetic progrmming Summry Cn evolution e intelligent? Intelligence

More information

Chapter 9: Inferences based on Two samples: Confidence intervals and tests of hypotheses

Chapter 9: Inferences based on Two samples: Confidence intervals and tests of hypotheses Chpter 9: Inferences bsed on Two smples: Confidence intervls nd tests of hypotheses 9.1 The trget prmeter : difference between two popultion mens : difference between two popultion proportions : rtio of

More information

Continuous Random Variables Class 5, Jeremy Orloff and Jonathan Bloom

Continuous Random Variables Class 5, Jeremy Orloff and Jonathan Bloom Lerning Gols Continuous Rndom Vriles Clss 5, 8.05 Jeremy Orloff nd Jonthn Bloom. Know the definition of continuous rndom vrile. 2. Know the definition of the proility density function (pdf) nd cumultive

More information

Model Reduction of Finite State Machines by Contraction

Model Reduction of Finite State Machines by Contraction Model Reduction of Finite Stte Mchines y Contrction Alessndro Giu Dip. di Ingegneri Elettric ed Elettronic, Università di Cgliri, Pizz d Armi, 09123 Cgliri, Itly Phone: +39-070-675-5892 Fx: +39-070-675-5900

More information

1 Online Learning and Regret Minimization

1 Online Learning and Regret Minimization 2.997 Decision-Mking in Lrge-Scle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in

More information

LECTURE NOTE #12 PROF. ALAN YUILLE

LECTURE NOTE #12 PROF. ALAN YUILLE LECTURE NOTE #12 PROF. ALAN YUILLE 1. Clustering, K-mens, nd EM Tsk: set of unlbeled dt D = {x 1,..., x n } Decompose into clsses w 1,..., w M where M is unknown. Lern clss models p(x w)) Discovery of

More information

Non-Linear & Logistic Regression

Non-Linear & Logistic Regression Non-Liner & Logistic Regression If the sttistics re boring, then you've got the wrong numbers. Edwrd R. Tufte (Sttistics Professor, Yle University) Regression Anlyses When do we use these? PART 1: find

More information

CS 188: Artificial Intelligence Fall Announcements

CS 188: Artificial Intelligence Fall Announcements CS 188: Artificil Intelligence Fll 2009 Lecture 20: Prticle Filtering 11/5/2009 Dn Klein UC Berkeley Announcements Written 3 out: due 10/12 Project 4 out: due 10/19 Written 4 proly xed, Project 5 moving

More information

Parse trees, ambiguity, and Chomsky normal form

Parse trees, ambiguity, and Chomsky normal form Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs

More information

Linear Inequalities. Work Sheet 1

Linear Inequalities. Work Sheet 1 Work Sheet 1 Liner Inequlities Rent--Hep, cr rentl compny,chrges $ 15 per week plus $ 0.0 per mile to rent one of their crs. Suppose you re limited y how much money you cn spend for the week : You cn spend

More information

CS 330 Formal Methods and Models Dana Richards, George Mason University, Spring 2016 Quiz Solutions

CS 330 Formal Methods and Models Dana Richards, George Mason University, Spring 2016 Quiz Solutions CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2016 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 9 1. (4pts) ((p q) (q r)) (p r), prove tutology using truth tles. p

More information

2.4 Linear Inequalities and Interval Notation

2.4 Linear Inequalities and Interval Notation .4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or

More information

1 ELEMENTARY ALGEBRA and GEOMETRY READINESS DIAGNOSTIC TEST PRACTICE

1 ELEMENTARY ALGEBRA and GEOMETRY READINESS DIAGNOSTIC TEST PRACTICE ELEMENTARY ALGEBRA nd GEOMETRY READINESS DIAGNOSTIC TEST PRACTICE Directions: Study the exmples, work the prolems, then check your nswers t the end of ech topic. If you don t get the nswer given, check

More information

CS 188: Artificial Intelligence Spring 2007

CS 188: Artificial Intelligence Spring 2007 CS 188: Artificil Intelligence Spring 2007 Lecture 3: Queue-Bsed Serch 1/23/2007 Srini Nrynn UC Berkeley Mny slides over the course dpted from Dn Klein, Sturt Russell or Andrew Moore Announcements Assignment

More information

Hamiltonian Cycle in Complete Multipartite Graphs

Hamiltonian Cycle in Complete Multipartite Graphs Annls of Pure nd Applied Mthemtics Vol 13, No 2, 2017, 223-228 ISSN: 2279-087X (P), 2279-0888(online) Pulished on 18 April 2017 wwwreserchmthsciorg DOI: http://dxdoiorg/1022457/pmv13n28 Annls of Hmiltonin

More information

Continuous Random Variables

Continuous Random Variables STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 217 Néhémy Lim Continuous Rndom Vribles Nottion. The indictor function of set S is rel-vlued function defined by : { 1 if x S 1 S (x) if x S Suppose tht

More information

Lecture 2: January 27

Lecture 2: January 27 CS 684: Algorithmic Gme Theory Spring 217 Lecturer: Év Trdos Lecture 2: Jnury 27 Scrie: Alert Julius Liu 2.1 Logistics Scrie notes must e sumitted within 24 hours of the corresponding lecture for full

More information

Population bottleneck : dramatic reduction of population size followed by rapid expansion,

Population bottleneck : dramatic reduction of population size followed by rapid expansion, Selection We hve defined nucleotide diversity denoted by π s the proportion of nucleotides tht differ between two rndomly chosen sequences. We hve shown tht E[π] = θ = 4 e µ where µ cn be estimted directly.

More information

Designing finite automata II

Designing finite automata II Designing finite utomt II Prolem: Design DFA A such tht L(A) consists of ll strings of nd which re of length 3n, for n = 0, 1, 2, (1) Determine wht to rememer out the input string Assign stte to ech of

More information

MATHS NOTES. SUBJECT: Maths LEVEL: Higher TEACHER: Aidan Roantree. The Institute of Education Topics Covered: Powers and Logs

MATHS NOTES. SUBJECT: Maths LEVEL: Higher TEACHER: Aidan Roantree. The Institute of Education Topics Covered: Powers and Logs MATHS NOTES The Institute of Eduction 06 SUBJECT: Mths LEVEL: Higher TEACHER: Aidn Rontree Topics Covered: Powers nd Logs About Aidn: Aidn is our senior Mths techer t the Institute, where he hs been teching

More information

Reinforcement learning II

Reinforcement learning II CS 1675 Introduction to Mchine Lerning Lecture 26 Reinforcement lerning II Milos Huskrecht milos@cs.pitt.edu 5329 Sennott Squre Reinforcement lerning Bsics: Input x Lerner Output Reinforcement r Critic

More information

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O 1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the

More information

Sudden death testing versus traditional censored life testing. A Monte-Carlo study

Sudden death testing versus traditional censored life testing. A Monte-Carlo study Control nd Cyernetics vol. 6 (7) No. Sudden deth testing versus trditionl censored life testing. A Monte-Crlo study y Ryszrd Motyk Pomernin Pedgogicl Acdemy, Chir of Computer Science nd Sttistics Arciszewskiego,

More information

FORM FIVE ADDITIONAL MATHEMATIC NOTE. ar 3 = (1) ar 5 = = (2) (2) (1) a = T 8 = 81

FORM FIVE ADDITIONAL MATHEMATIC NOTE. ar 3 = (1) ar 5 = = (2) (2) (1) a = T 8 = 81 FORM FIVE ADDITIONAL MATHEMATIC NOTE CHAPTER : PROGRESSION Arithmetic Progression T n = + (n ) d S n = n [ + (n )d] = n [ + Tn ] S = T = T = S S Emple : The th term of n A.P. is 86 nd the sum of the first

More information

Lecture 2 : Propositions DRAFT

Lecture 2 : Propositions DRAFT CS/Mth 240: Introduction to Discrete Mthemtics 1/20/2010 Lecture 2 : Propositions Instructor: Dieter vn Melkeeek Scrie: Dlior Zelený DRAFT Lst time we nlyzed vrious mze solving lgorithms in order to illustrte

More information

MIXED MODELS (Sections ) I) In the unrestricted model, interactions are treated as in the random effects model:

MIXED MODELS (Sections ) I) In the unrestricted model, interactions are treated as in the random effects model: 1 2 MIXED MODELS (Sections 17.7 17.8) Exmple: Suppose tht in the fiber breking strength exmple, the four mchines used were the only ones of interest, but the interest ws over wide rnge of opertors, nd

More information

First Midterm Examination

First Midterm Examination Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does

More information

Chapter 2. Random Variables and Probability Distributions

Chapter 2. Random Variables and Probability Distributions Rndom Vriles nd Proilit Distriutions- 6 Chpter. Rndom Vriles nd Proilit Distriutions.. Introduction In the previous chpter, we introduced common topics of proilit. In this chpter, we trnslte those concepts

More information

Overview of Calculus I

Overview of Calculus I Overview of Clculus I Prof. Jim Swift Northern Arizon University There re three key concepts in clculus: The limit, the derivtive, nd the integrl. You need to understnd the definitions of these three things,

More information

Diverse modes of eco-evolutionary dynamics in communities of antibiotic-producing microorganisms

Diverse modes of eco-evolutionary dynamics in communities of antibiotic-producing microorganisms In the formt provided y the uthors nd unedited. ULEMENTAY INFOMATION VOLUME: 1 ATICLE NUMBE: 0189 iverse modes of eco-evolutionry dynmics in communities of ntiiotic-producing microorgnisms Klin Vetsigin

More information

APPENDIX. Precalculus Review D.1. Real Numbers and the Real Number Line

APPENDIX. Precalculus Review D.1. Real Numbers and the Real Number Line APPENDIX D Preclculus Review APPENDIX D.1 Rel Numers n the Rel Numer Line Rel Numers n the Rel Numer Line Orer n Inequlities Asolute Vlue n Distnce Rel Numers n the Rel Numer Line Rel numers cn e represente

More information

QUADRATURE is an old-fashioned word that refers to

QUADRATURE is an old-fashioned word that refers to World Acdemy of Science Engineering nd Technology Interntionl Journl of Mthemticl nd Computtionl Sciences Vol:5 No:7 011 A New Qudrture Rule Derived from Spline Interpoltion with Error Anlysis Hdi Tghvfrd

More information

Chapters 4 & 5 Integrals & Applications

Chapters 4 & 5 Integrals & Applications Contents Chpters 4 & 5 Integrls & Applictions Motivtion to Chpters 4 & 5 2 Chpter 4 3 Ares nd Distnces 3. VIDEO - Ares Under Functions............................................ 3.2 VIDEO - Applictions

More information

Lecture 3 Gaussian Probability Distribution

Lecture 3 Gaussian Probability Distribution Introduction Lecture 3 Gussin Probbility Distribution Gussin probbility distribution is perhps the most used distribution in ll of science. lso clled bell shped curve or norml distribution Unlike the binomil

More information

Fig. 1. Open-Loop and Closed-Loop Systems with Plant Variations

Fig. 1. Open-Loop and Closed-Loop Systems with Plant Variations ME 3600 Control ystems Chrcteristics of Open-Loop nd Closed-Loop ystems Importnt Control ystem Chrcteristics o ensitivity of system response to prmetric vritions cn be reduced o rnsient nd stedy-stte responses

More information

Scanner. Specifying patterns. Specifying patterns. Operations on languages. A scanner must recognize the units of syntax Some parts are easy:

Scanner. Specifying patterns. Specifying patterns. Operations on languages. A scanner must recognize the units of syntax Some parts are easy: Scnner Specifying ptterns source code tokens scnner prser IR A scnner must recognize the units of syntx Some prts re esy: errors mps chrcters into tokens the sic unit of syntx x = x + y; ecomes

More information

Chapter 6 Continuous Random Variables and Distributions

Chapter 6 Continuous Random Variables and Distributions Chpter 6 Continuous Rndom Vriles nd Distriutions Mny economic nd usiness mesures such s sles investment consumption nd cost cn hve the continuous numericl vlues so tht they cn not e represented y discrete

More information

We partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b.

We partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b. Mth 255 - Vector lculus II Notes 4.2 Pth nd Line Integrls We begin with discussion of pth integrls (the book clls them sclr line integrls). We will do this for function of two vribles, but these ides cn

More information

Continuous Random Variables

Continuous Random Variables CPSC 53 Systems Modeling nd Simultion Continuous Rndom Vriles Dr. Anirn Mhnti Deprtment of Computer Science University of Clgry mhnti@cpsc.uclgry.c Definitions A rndom vrile is sid to e continuous if there

More information

5.1 How do we Measure Distance Traveled given Velocity? Student Notes

5.1 How do we Measure Distance Traveled given Velocity? Student Notes . How do we Mesure Distnce Trveled given Velocity? Student Notes EX ) The tle contins velocities of moving cr in ft/sec for time t in seconds: time (sec) 3 velocity (ft/sec) 3 A) Lel the x-xis & y-xis

More information

Satellite Retrieval Data Assimilation

Satellite Retrieval Data Assimilation tellite etrievl Dt Assimiltion odgers C. D. Inverse Methods for Atmospheric ounding: Theor nd Prctice World cientific Pu. Co. Hckensck N.J. 2000 Chpter 3 nd Chpter 8 Dve uhl Artist depiction of NAA terr

More information

Homework Assignment 3 Solution Set

Homework Assignment 3 Solution Set Homework Assignment 3 Solution Set PHYCS 44 6 Ferury, 4 Prolem 1 (Griffiths.5(c The potentil due to ny continuous chrge distriution is the sum of the contriutions from ech infinitesiml chrge in the distriution.

More information

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)

More information

Continuous Random Variable X:

Continuous Random Variable X: Continuous Rndom Vrile : The continuous rndom vrile hs its vlues in n intervl, nd it hs proility distriution unction or proility density unction p.d. stisies:, 0 & d Which does men tht the totl re under

More information

Chapter 0. What is the Lebesgue integral about?

Chapter 0. What is the Lebesgue integral about? Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous

More information

Quantum Nonlocality Pt. 2: No-Signaling and Local Hidden Variables May 1, / 16

Quantum Nonlocality Pt. 2: No-Signaling and Local Hidden Variables May 1, / 16 Quntum Nonloclity Pt. 2: No-Signling nd Locl Hidden Vriles My 1, 2018 Quntum Nonloclity Pt. 2: No-Signling nd Locl Hidden Vriles My 1, 2018 1 / 16 Non-Signling Boxes The primry lesson from lst lecture

More information

Designing Information Devices and Systems I Discussion 8B

Designing Information Devices and Systems I Discussion 8B Lst Updted: 2018-10-17 19:40 1 EECS 16A Fll 2018 Designing Informtion Devices nd Systems I Discussion 8B 1. Why Bother With Thévenin Anywy? () Find Thévenin eqiuvlent for the circuit shown elow. 2kΩ 5V

More information

Lecture 21: Order statistics

Lecture 21: Order statistics Lecture : Order sttistics Suppose we hve N mesurements of sclr, x i =, N Tke ll mesurements nd sort them into scending order x x x 3 x N Define the mesured running integrl S N (x) = 0 for x < x = i/n for

More information

Scientific notation is a way of expressing really big numbers or really small numbers.

Scientific notation is a way of expressing really big numbers or really small numbers. Scientific Nottion (Stndrd form) Scientific nottion is wy of expressing relly big numbers or relly smll numbers. It is most often used in scientific clcultions where the nlysis must be very precise. Scientific

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=

More information

An Improved Selection of GEP Based on CPCSC-DSC Approach

An Improved Selection of GEP Based on CPCSC-DSC Approach An Improved Selection of GEP Bsed on CPCSC-DSC Approch Li Wu 1,, Yonghong Yu 2, nd Zhou Zhou 2, c 1 School of Finnce nd Pulic Mngement, Anhui University of Finnce & Economics, Bengu 233030, Chin; 2 School

More information

Recitation 3: More Applications of the Derivative

Recitation 3: More Applications of the Derivative Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech

More information