Advanced Algorithms and Models for Computational Biology -- a machine learning approach. Some important dates in history (billions of years ago)

Size: px
Start display at page:

Download "Advanced Algorithms and Models for Computational Biology -- a machine learning approach. Some important dates in history (billions of years ago)"

Transcription

1 Advanced Algorithm and Model for Computational Biology -- a machine learning approach Molecular Evolution: nucleotide ubtitution model Eric Xing Lecture 20, April 3, 2006 Reading: DTW book, Chap 12 DEKM book, Chap 8 Some important date in hitory (billion of year ago) Origin of the univere 15 ±4 Formation of the olar ytem 4.6 Firt elf-replicating ytem 3.5 ±0.5 Prokaryotic-eukaryotic divergence 1.8 ±0.3 Plant-animal divergence 1.0 Invertebrate-vertebrate divergence 0.5 Mammalian radiation beginning 0.1 (86 CSH Doolittle et al.) 1

2 The three kingdom Two important early obervation Different protein evolve at different rate, and thi eem more or le independent of the hot organim, including it generation time. It i neceary to adjut the oberved percent difference between two homologou protein to get a ditance more or le linearly related to the time ince their common ancetor. ( Later we offer a rational bai for doing thi.) A triking early verion of thee obervation i next. 2

3 Rate of macromolecular evolution Corrected amino acid change per 100 reidue 220 Mammal Fibrinopeptide 1.1 MY 4 Bird/Reptile Mammal/ Reptile Reptile/Fih Carp/Lamprey 200 abcde f g h i Pliocene Miocene Oligocene Eocene Cretaceou V ertebrate/ Inect Hemoglobin 5.8 MY Evolution of the globin Cytochrome c 20.0 MY Paleocene Juraic Triaic Permian Carboniferou Devonian Silurian Ordovician Cambrian j Algonkian Huronian Million of year ince divergence 1 Separation of ancetor of plant and animal After Dickeron (1971) How doe equence variation arie? Mutation: (a) Inherent: DNA replication error are not alway corrected. (b) External: expoure to chemical and radiation. Selection: Deleteriou mutation are removed quickly. Neutral and rarely, advantageou mutation, are tolerated and tick around. Fixation: It take time for a new variant to be etablihed (having a table frequency) in a population. 3

4 Modeling DNA bae ubtitution Standard aumption (ometime weakened) Site independence. Site homogeneity. Markovian: given current bae, future ubtitution independent of pat. Temporal homogeneity: tationary Markov chain. Strictly peaking, only applicable to region undergoing little election. Some terminology In evolution, homology (here of protein), mean imilarity due to common ancetry. A common mode of protein evolution i by duplication. Depending on the relation between duplication and peciation date, we have two different type of homologou protein. Looely, Orthologue: the ame gene in different organim; common ancetry goe back to a peciation event. Paralogue: different gene in the ame organim; common ancetry goe back to a gene duplication. Lateral gene tranfer give another form of homology. 4

5 Speciation v. duplication Beta-globin (orthologue) BG-human M V H L T P E E K S A V T A L W G K V N V D E V G G E A L G R L L V V Y P W T Q BG-macaque N... T BG-bovine - - M.. A... A.... F.... K BG-platypu -... S G G N I N. L BG-chicken... W. A... Q L I. G A. C. A... A... I BG-hark -.. W S E V. L H E I. T T. K S I D K H S L. A K.. A. M F I..... T BG-human R F F E S F G D L S T P D A V M G N P K V K A H G K K V L G A F S D G L A H L D BG-macaque S N... BG-bovine A.... N D S.. N. M K... BG-platypu.... A..... S A G A... T S. G. A. K N.. BG-chicken... A... N.. S. T. I L... M. R T S. G. A V K N.. BG-hark. Y. G N L K E F T A C S Y G E. A... T.. L G V A V T.. G BG-human N L K G T F A T L S E L H C D K L H V D P E N F R L L G N V L V C V L A H H F G BG-macaque Q K BG-bovine D A K V... R N.. BG-platypu D K N R..... I V... R.. S BG-chicken. I. N.. S Q D I. I I... A.. S BG-hark D V. S Q. T D.. K K. A E E.... V. S. K.. A K C F. V E. G I L L K BG-human K E F T P P V Q A A Y Q K V V A G V A N A L A H K Y H BG-macaque..... Q BG-bovine..... V L.. D F R.. BG-platypu. D. S. E.... W.. L. S... H.. G.... BG-chicken. D... E C... W.. L. R V.. H... R... BG-hark D K. A. Q T.. I W E. Y F G V. V D. I S K E... mean ame a reference equence - mean deletion 5

6 Beta-globin: uncorrected pairwie ditance DISTANCES between protein equence (calculated over: 1 to 147) Below diagonal: oberved number of difference Above diagonal: number of difference per 100 amino acid hum mac bov pla chi ha hum mac bov pla chi ha Beta-globin: corrected pairwie ditance DISTANCES between protein equence (calculated over: 1 to 147) Below diagonal: oberved number of difference Above diagonal: number of difference per 100 amino acid Correction method: Juke-Cantor hum mac bov pla chi ha hum mac bov pla chi ha

7 Human globin (paralogue) alpha-human beta-human delta-human epilon-human gamma-human myo-human - V L S P A D K T N V K A A W G K V G A H A G E Y G A E A L E R M F L S F P T T V H. T. E E. S A. T. L N V D. V. G... G. L L V V Y. W. V H. T. E E.. A. N. L N V D A V. G... G. L L V V Y. W. V H F T A E E. A A. T S L. S. M - - N V E. A. G... G. L L V V Y. W. G H F T E E.. A T I T S L N V E D A. G. T. G. L L V V Y. W. - G.. D G E W Q L. L N V.... E. D I P G H. Q. V. I. L. K G H. E alpha-human beta-human delta-human epilon-human gamma-human myo-human K T Y F P H F - D L S H G S A Q V K G H G K K V A D A L T N A V A H V Q R F. E S. G... T P D. V M G N P K.. A..... L G. F S D G L.. L Q R F. E S. G... S P D. V M G N P K.. A..... L G. F S D G L.. L Q R F. D S. G N.. S P.. I L G N P K.. A..... L T S F G D. I K N M Q R F. D S. G N.. S A.. I M G N P K.. A..... L T S. G D. I K. L L E K. D K. K H. K S E D E M K A S E D L. K.. A T. L T.. G G I L K K K alpha-human beta-human delta-human epilon-human gamma-human myo-human D D M P N A L S A L S D L H A H K L R V D P V N F K L L S H C L L V T L A A H L. N L K G T F A T.. E.. C D.. H... E.. R.. G N V. V C V.. H. F. N L K G T F. Q.. E.. C D.. H... E.. R.. G N V. V C V.. R N F. N L K P. F A K.. E.. C D.. H... E..... G N V M V I I.. T. F.. L K G T F A Q.. E.. C D.. H... E..... G N V. V T V.. I. F G H H E A E I K P. A Q S.. T. H K I P V K Y L E F I. E. I I Q V. Q S K H alpha-human beta-human delta-human epilon-human gamma-human myo-human P A E F T P A V H A S L D K F L A S V S T V L T S K Y R G K.... P. Q. A Y Q. V V. G. A N A. A H.. H G K.... Q M Q. A Y Q. V V. G. A N A. A H.. H G K.... E. Q. A W Q. L V S A. A I A. A H.. H G K.... E. Q.. W Q. M V T A. A S A. S. R. H G D. G A D A Q G A M N. A. E L F R K D M A. N. K E L G F Q G Human globin: corrected pairwie ditance DISTANCES between protein equence (calculated over 1 to 141) Below diagonal: oberved number of difference Above diagonal: etimated number of ubtitution per 100 amino acid Correction method: Juke-Cantor alpha beta delta epil gamma myo alpha beta delta epil gamma myo

8 Correcting ditance between DNA and protein equence Why it i neceary to adjut oberved percent difference to get a ditance meaure which cale linearly with time? Thi i becaue we can have multiple and back ubtitution at a given poition along a lineage. All of the correction method (with name like Juke-Cantor, 2- parameter Kimura, etc) are jutified by imple probabilitic argument involving Markov chain whoe bai i worth matering. The ame molecular evolutionary model can be ued in coring equence alignment. Markov chain State pace = {A,C,G,T}. p(i,j) = pr(next tate S j current tate S i ) Markov aumption: p(next tate S j current tate S i & any configuration of tate before thi) = p(i,j) Only the preent tate, not previou tate, affect the prob of moving to next tate. 8

9 The multiplication rule pr(tate after next i S k current tate i S i ) = j pr(tate after next i S k, next tate i S j current tate i S i ) [addition rule] = j pr(next tate i S j current tate i S i ) x pr(tate after next i S k current tate i S i, next tate i S j ) = j p i,j x p j,k [multiplication rule] [Markov aumption] = (i,k)-element of P 2, where P=(p i,j ). More generally, pr(tate t tep from now i S k current tate i S i ) = i,k element of P t Continuou-time verion For any (, t): Let p ij (t) = pr(s j at time t+ S i at time ) denote the tationary (time-homogeneou) tranition probabilitie. Let P(t) = (p ij (t)) denote the matrix of p ij (t). Then for any (t, u): P(t+u) = P(t) P(u). It follow that P(t) = exp(qt), where Q = P (0) (the derivative of P(t) at t = 0 ). Q i called the infiniteimal matrix (tranition rate matrix) of P(t), and atifie P (t) = QP(t) = P(t)Q. Important approximation: when t i mall, P(t) I + Qt. 9

10 Interpretation of Q Roughly, q ij i the rate of tranition of i to j, while q ii = Σ j i q ij, o each row um i 0 (Why?). Now we have the hort-time approximation: p ( t + h) = q h o( h) i j ij + pi = j ( t + h) = 1 + qiih + o( h) where p ij (t+h) i the probability of tranitioning from i at time t to j at time t+h Now conider the Chapman-Kolmogorov relation: (auming we have a continuou-time Markov chain, and let p j (t) = pr(s j at time t)) i.e., h 1 p ( t + h) = = j i pr ( S at t ) pr ( S at t + h S at t ) = p ( t ) ( 1 + q h) + j i i pr ( S at t, S at t + h) jj i i p ( t ) hq i i j ( pj ( t + h) pj ( t )) = pj ( t ) qjj + pi ( t ) qij, which become: i j j j ij P = QP a h 0. Probabilitic model for DNA change Orc: Elf: Dwarf: Hobbit: Human: ACAGTGACGCCCCAAACGT ACAGTGACGCTACAAACGT CCTGTGACGTAACAAACGA CCTGTGACGTAGCAAACGA CCTGTGACGTAGCAAACGA 10

11 The Juke-Cantor model (1969) Subtitution rate: -µ µ/3 -µ A G µ/3 µ/3 µ/3 µ/3 -µ C µ/3 T -µ the implet ymmetrical model for DNA evolution Tranition probabilitie under the Juke-Cantor model IID aumption: All ite change independently All ite have the ame tochatic proce working at them Equiprobablity aumption: Make up a fictional kind of event, uch that when it happen the ite change to one of the 4 bae choen at random equiprobably Equilibrium condition: No matter how many of thee fictional event occur, provided it i not zero, the chance of ending up at a particular bae i 1/4. Solving differentially equation ytem P = QP 11

12 Tranition probabilitie under the Juke-Cantor model (cont.) Prob tranition matrix: A C G T A r(t) (t) (t) (t) P(t) = C (t) r(t) (t) (t) G (t) (t) r(t) (t) T (t) (t) (t) r(t) Where we can derive: r ( t ) = 4 t ( 1 + 3e ) µ t ( 1 e ) 1 3 µ 4 ( t ) = Homework! 4 Juke-Cantor (cont.) Fraction of ite difference difference per ite time 12

13 Kimura' K2P model (1980) Subtitution rate: --2β A G --2β β β β β --2β C T --2β which allow for different rate of tranition and tranverion. Tranition (rate ) are much more likely than tranverion (rate β). Kimura (cont.) Prob tranition matrix: r(t) (t) u(t) (t) P(t) = (t) r(t) (t) u(t) u(t) (t) r(t) (t) (t) u(t) (t) r(t) Where (t) = ¼ (1 e -4βt ) u(t) = ¼ (1 + e -4βt e -2(+β)t ) r(t) = 1 2(t) u(t) By proper choice of and one can achieve the overall rate of change and T=Tn ratio R you want (warning: terminological tangle). 13

14 Kimura (cont.) Tranition, tranverion expected under different R: Other commonly ued model Two model that pecify the equilibrium bae frequencie (you provide the frequencie A; C; G; T and they are et up to have an equilibrium which achieve them), and alo let you control the tranition/tranverion ratio: The Haegawa-Kihino-Yano (1985) model: 14

15 Other commonly ued model The F84 model (Felentein) where π R = π A + π G and π Y = π C + π T (The equilibrium frequencie of purine and pyrimidine) The general time-reverible model It maintain "detailed balance" o that the probability of tarting at (ay) A and ending at (ay) T in evolution i the ame a the probability of tarting at T and ending at A: A C G T A C G T (t) πc (t) βπg (t) γπ π (t) (t) δπ A G (t) επ βπ (t) (t) δπ A C (t) νπ γπ (t) (t) επ (t) νπ A C G T T T And there i of coure the general 12-parameter model which ha arbitrary rate for each of the 12 poible change (from each of the 4 nucleotide to each of the 3 other). (Neither of thee ha formula for the tranition probabilitie, but thoe can be done numerically.) 15

16 Relation between model Adjuting evolutionary ditance uing bae-ubtitution model 16

17 The Juke-Cantor model -3 Common ancetor of human and orang Q = t time unit r Human (now) P = r r r Conider e.g. the 2nd poition in a-globin2 Alu1. r = (1+3e 4t )/4, = (1 e 4t )/4. Definition of PAM Let P(t) = exp(qt). Then the A,G element of P(t) i pr(g now A then) = (1 e 4t)/4. Same for all pair of different nucleotide. Overall rate of change k = 3t. PAM = accepted point mutation When k =.01, decribed a 1 PAM Put t =.01/3 = 1/300. Then the reulting P = P(1/300) i called the PAM(1) matrix. Why ue PAM? 17

18 Evolutionary time, PAM Since equence evolve at different rate, it i convenient to recale time o that 1 PAM of evolutionary time correpond to 1% expected ubtitution. For Juke-Cantor, k = 3t i the expected number of ubtitution in [0,t], o i a ditance. (Show thi.) Set 3t = 1/100, or t = 1/300, o 1 PAM = 1/300 year. Ditance adjutment For a pair of equence, k = 3t i the deired metric, but not obervable. Intead, pr(different) i oberved. So we ue a model to convert pr(different) to k. Thi i completely analogou to the converion of θ = pr(recombination) to genetic (map) ditance (= expected number of croover) uing the Haldane map function θ = 1/2 (1 e -2d ), auming the no-interference (Poion) model. 18

19 Toward Juke-Cantor adjutment E.g., 2nd poition in a-globin Alu 1 common ancetor Aume that the common ancetor ha A, G, C or T with probability 1/4. G orang C human Then the chance of the nt differing p = 3/4 (1 e 8t ) = 3/4 (1 e 4k/3 ), ince k =2 3t 3/4 t Juke-Cantor adjutment If we uppoe all nucleotide poition behave identically and independently, and n differ out of n, we can invert thi, obtaining ) 3 4 k = log 1 n / n 4 3 Thi i the corrected or adjuted fraction of difference (under thi imple model). 100 to get PAM The analogou imple model for amino acid equence ha 100 for PAM. ) k = log 1 n / n

20 Illutration 1. Human and bovine beta-globin are aligned with no deletion at 145 out of 147 ite. They differ at 23 of thee ite. Thu n /n = 23/145, and the corrected ditance uing the Juke- Cantor formula i (natural log) 19/20 log(1 20/19 23/145) = The human and gorilla equence are aligned without gap acro all 300 bp, and differ at 14 ite. Thu n /n = 14/300, and the corrected ditance uing the Juke-Cantor formula i 3/4 log(1 4/3 14/300) = Correpondence between oberved a.a. difference and the evolutionary ditance (Dayhoff et al., 1978) Oberved Percent Difference Evolutionary Ditance in PAM

21 Scoring matrice for alignment How coring matrice work 134 LQQGELDLVMTSDILPRSELHYSPMFDFEVRLVLAPDHPLASKTQITPEDLASETLLI 137 LDSNSVDLVLMGVPPRNVEVEAEAFMDNPLVVIAPPDHPLAGERAISLARLAEETFVM C 9 D:D = +6 S -1 4 T P A G D:R = -2 N D E Q H R K M BLOSUM62 I L V F Y W C S T P A G N D E Q H R K M I L V F Y W From Henikoff

22 Statitical motivation for alignment core Alignment: AGCTGATCA... AACCGGTTA... Hypothee: H = homologou (indep. ite, Juke-Cantor) R = random (indep. ite, equal freq.) pr( data H ) = pr(aa H )pr(ga H )pr(cc H )... a d 3 = ( 1 p) p,where a = # agreement, d = #diagreement, p = ( 1 e 4 pr( data R ) = pr(aa R )pr(ga R )pr(cc R )... 1 a 3 = ( ) ( ) 4 4 d pr( data H ) 1 p p log{ } = a log + d log = a σ + d ( µ ). pr( data R ) 1 / 4 3/ 4 Since p<3/4, σ = log((1-p)/(1/4))>0, while -µ= log(p/(3/4))<0. Thu the alignment core = a σ + d (-µ), where the match core σ > 0, and the mimatch penalty i -µ < 0. 8t ). Large and mall evolutionary ditance Recall that p = (3/4)(1-e -8t ), σ = log((1-p)/(1/4)), -µ = log(p/(3/4)). Now note that if t 0, then p 6t, and 1-p 1, and o σ log4, while -µ log8t i large and negative. That i, we ee a big difference in the two value of σ and µ for mall ditance. Converely, if t i large, p = (3/4)(1-ε), hence p/(3/4) = 1- ε, giving µ = -log(1- ε) ε, while 1-p = (1+3ε)/4, (1-p)/(1/4) = 1+3ε, and o σ = log(1+3ε) 3ε. Thu the core are about 3 (for a match) to 1 (for a mimatch) for large ditance. Thi make ene, a mimatche will on average be about 3 time more frequent than matche. the matrix which perform bet will be the matrix that reflect the evolutionary eparation of the equence being aligned. 22

23 What about multiple alignment Phylogenetic method: a tree, with branch length, and the data at a ingle ite. t 7 t 5 t 8 t 6 t 2 t 1 t 3 t 4 ACAGTGACGCCCCAAACGT ACAGTGACGCTACAAACGT CCTGTGACGTAACAAACGA CCTGTGACGTAGCAAACGA CCTGTGACGTAGCAAACGA See next lecture for how to compute likelihood under thi hypothei Acknowledgment Terry Speed: for ome of the lide modified from hi lecture at UC Berkeley Phil Green and Joe Felentein: for ome of the lide modified from hi lecture at Univ. of Wahington 23

Molecular Evolution and Comparative Genomics

Molecular Evolution and Comparative Genomics Molecular Evolution and Comparative Genomics --- the phylogenetic HMM model 10-810, CMB lecture 5---Eric Xing Some important dates in history (billions of years ago) Origin of the universe 15 ±4 Formation

More information

Chapter 2: Sequence Alignment

Chapter 2: Sequence Alignment Chapter 2: Sequence lignment 2.2 Scoring Matrices Prof. Yechiam Yemini (YY) Computer Science Department Columbia University COMS4761-2007 Overview PM: scoring based on evolutionary statistics Elementary

More information

A statistical analysis of the Evolutionary Trace method. Heidi Spratt

A statistical analysis of the Evolutionary Trace method. Heidi Spratt 1 A tatitical analyi of the Evolutionary Trace method Heidi Spratt 2 Content Lit of Illutration iii 1 Introduction 1 Evolution of Protein 1.1 Protein 3 1.2 Multiple Sequence Alignment 4 1.3 Model of Protein

More information

Bogoliubov Transformation in Classical Mechanics

Bogoliubov Transformation in Classical Mechanics Bogoliubov Tranformation in Claical Mechanic Canonical Tranformation Suppoe we have a et of complex canonical variable, {a j }, and would like to conider another et of variable, {b }, b b ({a j }). How

More information

Lecture 24. Phylogeny methods, part 4 (Models of DNA and protein change) p.1/22

Lecture 24. Phylogeny methods, part 4 (Models of DNA and protein change) p.1/22 Lecture 24. Phylogeny methods, part 4 (Models of DNA and protein change) Joe Felsenstein Department of Genome Sciences and Department of Biology Lecture 24. Phylogeny methods, part 4 (Models of DNA and

More information

Lecture 27. Phylogeny methods, part 4 (Models of DNA and protein change) p.1/26

Lecture 27. Phylogeny methods, part 4 (Models of DNA and protein change) p.1/26 Lecture 27. Phylogeny methods, part 4 (Models of DNA and protein change) Joe Felsenstein Department of Genome Sciences and Department of Biology Lecture 27. Phylogeny methods, part 4 (Models of DNA and

More information

CHAPTER 8 OBSERVER BASED REDUCED ORDER CONTROLLER DESIGN FOR LARGE SCALE LINEAR DISCRETE-TIME CONTROL SYSTEMS

CHAPTER 8 OBSERVER BASED REDUCED ORDER CONTROLLER DESIGN FOR LARGE SCALE LINEAR DISCRETE-TIME CONTROL SYSTEMS CHAPTER 8 OBSERVER BASED REDUCED ORDER CONTROLLER DESIGN FOR LARGE SCALE LINEAR DISCRETE-TIME CONTROL SYSTEMS 8.1 INTRODUCTION 8.2 REDUCED ORDER MODEL DESIGN FOR LINEAR DISCRETE-TIME CONTROL SYSTEMS 8.3

More information

Sequence Analysis 17: lecture 5. Substitution matrices Multiple sequence alignment

Sequence Analysis 17: lecture 5. Substitution matrices Multiple sequence alignment Sequence Analysis 17: lecture 5 Substitution matrices Multiple sequence alignment Substitution matrices Used to score aligned positions, usually of amino acids. Expressed as the log-likelihood ratio of

More information

RELIABILITY OF REPAIRABLE k out of n: F SYSTEM HAVING DISCRETE REPAIR AND FAILURE TIMES DISTRIBUTIONS

RELIABILITY OF REPAIRABLE k out of n: F SYSTEM HAVING DISCRETE REPAIR AND FAILURE TIMES DISTRIBUTIONS www.arpapre.com/volume/vol29iue1/ijrras_29_1_01.pdf RELIABILITY OF REPAIRABLE k out of n: F SYSTEM HAVING DISCRETE REPAIR AND FAILURE TIMES DISTRIBUTIONS Sevcan Demir Atalay 1,* & Özge Elmataş Gültekin

More information

Social Studies 201 Notes for March 18, 2005

Social Studies 201 Notes for March 18, 2005 1 Social Studie 201 Note for March 18, 2005 Etimation of a mean, mall ample ize Section 8.4, p. 501. When a reearcher ha only a mall ample ize available, the central limit theorem doe not apply to the

More information

Multiple Sequence Alignment. Progressive Alignment Iterative Pairwise Guide Tree ClustalW Co-linearity Multiple Sequence Alignment Editors

Multiple Sequence Alignment. Progressive Alignment Iterative Pairwise Guide Tree ClustalW Co-linearity Multiple Sequence Alignment Editors Yverdon Le Bain Introduction to Bioinformatic Introduction to Bioinformatic ami Khuri Department of Computer cience an Joé tate Univerity an Joé, California, UA khuri@c.ju.edu www.c.ju.edu/faculty/khuri

More information

into a discrete time function. Recall that the table of Laplace/z-transforms is constructed by (i) selecting to get

into a discrete time function. Recall that the table of Laplace/z-transforms is constructed by (i) selecting to get Lecture 25 Introduction to Some Matlab c2d Code in Relation to Sampled Sytem here are many way to convert a continuou time function, { h( t) ; t [0, )} into a dicrete time function { h ( k) ; k {0,,, }}

More information

Massachusetts Institute of Technology Computational Evolutionary Biology, Fall, 2005 Notes for November 7: Molecular evolution

Massachusetts Institute of Technology Computational Evolutionary Biology, Fall, 2005 Notes for November 7: Molecular evolution Massachusetts Institute of Technology 6.877 Computational Evolutionary Biology, Fall, 2005 Notes for November 7: Molecular evolution 1. Rates of amino acid replacement The initial motivation for the neutral

More information

Lecture 4: Evolutionary Models and Substitution Matrices (PAM and BLOSUM)

Lecture 4: Evolutionary Models and Substitution Matrices (PAM and BLOSUM) Bioinformatics II Probability and Statistics Universität Zürich and ETH Zürich Spring Semester 2009 Lecture 4: Evolutionary Models and Substitution Matrices (PAM and BLOSUM) Dr Fraser Daly adapted from

More information

Suggested Answers To Exercises. estimates variability in a sampling distribution of random means. About 68% of means fall

Suggested Answers To Exercises. estimates variability in a sampling distribution of random means. About 68% of means fall Beyond Significance Teting ( nd Edition), Rex B. Kline Suggeted Anwer To Exercie Chapter. The tatitic meaure variability among core at the cae level. In a normal ditribution, about 68% of the core fall

More information

Lecture 10 Filtering: Applied Concepts

Lecture 10 Filtering: Applied Concepts Lecture Filtering: Applied Concept In the previou two lecture, you have learned about finite-impule-repone (FIR) and infinite-impule-repone (IIR) filter. In thee lecture, we introduced the concept of filtering

More information

Lecture 4. Models of DNA and protein change. Likelihood methods

Lecture 4. Models of DNA and protein change. Likelihood methods Lecture 4. Models of DNA and protein change. Likelihood methods Joe Felsenstein Department of Genome Sciences and Department of Biology Lecture 4. Models of DNA and protein change. Likelihood methods p.1/36

More information

Comparing Means: t-tests for Two Independent Samples

Comparing Means: t-tests for Two Independent Samples Comparing ean: t-tet for Two Independent Sample Independent-eaure Deign t-tet for Two Independent Sample Allow reearcher to evaluate the mean difference between two population uing data from two eparate

More information

Lecture 7: Testing Distributions

Lecture 7: Testing Distributions CSE 5: Sublinear (and Streaming) Algorithm Spring 014 Lecture 7: Teting Ditribution April 1, 014 Lecturer: Paul Beame Scribe: Paul Beame 1 Teting Uniformity of Ditribution We return today to property teting

More information

Understanding relationship between homologous sequences

Understanding relationship between homologous sequences Molecular Evolution Molecular Evolution How and when were genes and proteins created? How old is a gene? How can we calculate the age of a gene? How did the gene evolve to the present form? What selective

More information

Social Studies 201 Notes for November 14, 2003

Social Studies 201 Notes for November 14, 2003 1 Social Studie 201 Note for November 14, 2003 Etimation of a mean, mall ample ize Section 8.4, p. 501. When a reearcher ha only a mall ample ize available, the central limit theorem doe not apply to the

More information

Lecture 4: Evolutionary models and substitution matrices (PAM and BLOSUM).

Lecture 4: Evolutionary models and substitution matrices (PAM and BLOSUM). 1 Bioinformatics: In-depth PROBABILITY & STATISTICS Spring Semester 2011 University of Zürich and ETH Zürich Lecture 4: Evolutionary models and substitution matrices (PAM and BLOSUM). Dr. Stefanie Muff

More information

Problem Set 8 Solutions

Problem Set 8 Solutions Deign and Analyi of Algorithm April 29, 2015 Maachuett Intitute of Technology 6.046J/18.410J Prof. Erik Demaine, Srini Devada, and Nancy Lynch Problem Set 8 Solution Problem Set 8 Solution Thi problem

More information

7.2 INVERSE TRANSFORMS AND TRANSFORMS OF DERIVATIVES 281

7.2 INVERSE TRANSFORMS AND TRANSFORMS OF DERIVATIVES 281 72 INVERSE TRANSFORMS AND TRANSFORMS OF DERIVATIVES 28 and i 2 Show how Euler formula (page 33) can then be ued to deduce the reult a ( a) 2 b 2 {e at co bt} {e at in bt} b ( a) 2 b 2 5 Under what condition

More information

7.36/7.91 recitation CB Lecture #4

7.36/7.91 recitation CB Lecture #4 7.36/7.91 recitation 2-19-2014 CB Lecture #4 1 Announcements / Reminders Homework: - PS#1 due Feb. 20th at noon. - Late policy: ½ credit if received within 24 hrs of due date, otherwise no credit - Answer

More information

Molecular Evolution and Phylogenetic Tree Reconstruction

Molecular Evolution and Phylogenetic Tree Reconstruction 1 4 Molecular Evolution and Phylogenetic Tree Reconstruction 3 2 5 1 4 2 3 5 Orthology, Paralogy, Inparalogs, Outparalogs Phylogenetic Trees Nodes: species Edges: time of independent evolution Edge length

More information

Digital Control System

Digital Control System Digital Control Sytem - A D D A Micro ADC DAC Proceor Correction Element Proce Clock Meaurement A: Analog D: Digital Continuou Controller and Digital Control Rt - c Plant yt Continuou Controller Digital

More information

Fermi Distribution Function. n(e) T = 0 T > 0 E F

Fermi Distribution Function. n(e) T = 0 T > 0 E F LECTURE 3 Maxwell{Boltzmann, Fermi, and Boe Statitic Suppoe we have a ga of N identical point particle in a box ofvolume V. When we ay \ga", we mean that the particle are not interacting with one another.

More information

Feedback Control Systems (FCS)

Feedback Control Systems (FCS) Feedback Control Sytem (FCS) Lecture19-20 Routh-Herwitz Stability Criterion Dr. Imtiaz Huain email: imtiaz.huain@faculty.muet.edu.pk URL :http://imtiazhuainkalwar.weebly.com/ Stability of Higher Order

More information

CHAPTER 6. Estimation

CHAPTER 6. Estimation CHAPTER 6 Etimation Definition. Statitical inference i the procedure by which we reach a concluion about a population on the bai of information contained in a ample drawn from that population. Definition.

More information

Codes Correcting Two Deletions

Codes Correcting Two Deletions 1 Code Correcting Two Deletion Ryan Gabry and Frederic Sala Spawar Sytem Center Univerity of California, Lo Angele ryan.gabry@navy.mil fredala@ucla.edu Abtract In thi work, we invetigate the problem of

More information

SOME RESULTS ON INFINITE POWER TOWERS

SOME RESULTS ON INFINITE POWER TOWERS NNTDM 16 2010) 3, 18-24 SOME RESULTS ON INFINITE POWER TOWERS Mladen Vailev - Miana 5, V. Hugo Str., Sofia 1124, Bulgaria E-mail:miana@abv.bg Abtract To my friend Kratyu Gumnerov In the paper the infinite

More information

University of Washington Department of Chemistry Chemistry 453 Winter Quarter 2015

University of Washington Department of Chemistry Chemistry 453 Winter Quarter 2015 Lecture 8. 1/3/15 Univerity of Wahington Department of Chemitry Chemitry 453 Winter Quarter 015 A. Statitic of Conformational Equilibria in Protein It i known from experiment that ome protein, DA, and

More information

2 States of a System. 2.1 States / Configurations 2.2 Probabilities of States. 2.3 Counting States 2.4 Entropy of an ideal gas

2 States of a System. 2.1 States / Configurations 2.2 Probabilities of States. 2.3 Counting States 2.4 Entropy of an ideal gas 2 State of a Sytem Motly chap 1 and 2 of Kittel &Kroemer 2.1 State / Configuration 2.2 Probabilitie of State Fundamental aumption Entropy 2.3 Counting State 2.4 Entropy of an ideal ga Phyic 112 (S2012)

More information

1 Bertrand duopoly with incomplete information

1 Bertrand duopoly with incomplete information Game Theory Solution to Problem Set 5 1 Bertrand duopoly ith incomplete information The game i de ned by I = f1; g ; et of player A i = [0; 1) T i = fb L ; b H g, ith p(b L ) = u i (b i ; p i ; p j ) =

More information

What lies between Δx E, which represents the steam valve, and ΔP M, which is the mechanical power into the synchronous machine?

What lies between Δx E, which represents the steam valve, and ΔP M, which is the mechanical power into the synchronous machine? A 2.0 Introduction In the lat et of note, we developed a model of the peed governing mechanim, which i given below: xˆ K ( Pˆ ˆ) E () In thee note, we want to extend thi model o that it relate the actual

More information

Quantifying sequence similarity

Quantifying sequence similarity Quantifying sequence similarity Bas E. Dutilh Systems Biology: Bioinformatic Data Analysis Utrecht University, February 16 th 2016 After this lecture, you can define homology, similarity, and identity

More information

Physics 741 Graduate Quantum Mechanics 1 Solutions to Final Exam, Fall 2014

Physics 741 Graduate Quantum Mechanics 1 Solutions to Final Exam, Fall 2014 Phyic 7 Graduate Quantum Mechanic Solution to inal Eam all 0 Each quetion i worth 5 point with point for each part marked eparately Some poibly ueful formula appear at the end of the tet In four dimenion

More information

An Inequality for Nonnegative Matrices and the Inverse Eigenvalue Problem

An Inequality for Nonnegative Matrices and the Inverse Eigenvalue Problem An Inequality for Nonnegative Matrice and the Invere Eigenvalue Problem Robert Ream Program in Mathematical Science The Univerity of Texa at Dalla Box 83688, Richardon, Texa 7583-688 Abtract We preent

More information

Lecture 21. The Lovasz splitting-off lemma Topics in Combinatorial Optimization April 29th, 2004

Lecture 21. The Lovasz splitting-off lemma Topics in Combinatorial Optimization April 29th, 2004 18.997 Topic in Combinatorial Optimization April 29th, 2004 Lecture 21 Lecturer: Michel X. Goeman Scribe: Mohammad Mahdian 1 The Lovaz plitting-off lemma Lovaz plitting-off lemma tate the following. Theorem

More information

USPAS Course on Recirculated and Energy Recovered Linear Accelerators

USPAS Course on Recirculated and Energy Recovered Linear Accelerators USPAS Coure on Recirculated and Energy Recovered Linear Accelerator G. A. Krafft and L. Merminga Jefferon Lab I. Bazarov Cornell Lecture 6 7 March 005 Lecture Outline. Invariant Ellipe Generated by a Unimodular

More information

μ + = σ = D 4 σ = D 3 σ = σ = All units in parts (a) and (b) are in V. (1) x chart: Center = μ = 0.75 UCL =

μ + = σ = D 4 σ = D 3 σ = σ = All units in parts (a) and (b) are in V. (1) x chart: Center = μ = 0.75 UCL = Our online Tutor are available 4*7 to provide Help with Proce control ytem Homework/Aignment or a long term Graduate/Undergraduate Proce control ytem Project. Our Tutor being experienced and proficient

More information

ONLINE APPENDIX: TESTABLE IMPLICATIONS OF TRANSLATION INVARIANCE AND HOMOTHETICITY: VARIATIONAL, MAXMIN, CARA AND CRRA PREFERENCES

ONLINE APPENDIX: TESTABLE IMPLICATIONS OF TRANSLATION INVARIANCE AND HOMOTHETICITY: VARIATIONAL, MAXMIN, CARA AND CRRA PREFERENCES ONLINE APPENDIX: TESTABLE IMPLICATIONS OF TRANSLATION INVARIANCE AND HOMOTHETICITY: VARIATIONAL, MAXMIN, CARA AND CRRA PREFERENCES CHRISTOPHER P. CHAMBERS, FEDERICO ECHENIQUE, AND KOTA SAITO In thi online

More information

Sampling and the Discrete Fourier Transform

Sampling and the Discrete Fourier Transform Sampling and the Dicrete Fourier Tranform Sampling Method Sampling i mot commonly done with two device, the ample-and-hold (S/H) and the analog-to-digital-converter (ADC) The S/H acquire a CT ignal at

More information

Theoretical Population Biology

Theoretical Population Biology Theoretical Population Biology 8 () 3 Content lit available at ScienceDirect Theoretical Population Biology journal homepage: www.elevier.com/locate/tpb On the ize ditribution of private microatellite

More information

Pulsed Magnet Crimping

Pulsed Magnet Crimping Puled Magnet Crimping Fred Niell 4/5/00 1 Magnetic Crimping Magnetoforming i a metal fabrication technique that ha been in ue for everal decade. A large capacitor bank i ued to tore energy that i ued to

More information

Factor Analysis with Poisson Output

Factor Analysis with Poisson Output Factor Analyi with Poion Output Gopal Santhanam Byron Yu Krihna V. Shenoy, Department of Electrical Engineering, Neurocience Program Stanford Univerity Stanford, CA 94305, USA {gopal,byronyu,henoy}@tanford.edu

More information

Online supplementary information

Online supplementary information Electronic Supplementary Material (ESI) for Soft Matter. Thi journal i The Royal Society of Chemitry 15 Online upplementary information Governing Equation For the vicou flow, we aume that the liquid thickne

More information

Reinforcement Learning

Reinforcement Learning Reinforcement Learning Yihay Manour Google Inc. & Tel-Aviv Univerity Outline Goal of Reinforcement Learning Mathematical Model (MDP) Planning Learning Current Reearch iue 2 Goal of Reinforcement Learning

More information

Maximum Likelihood Tree Estimation. Carrie Tribble IB Feb 2018

Maximum Likelihood Tree Estimation. Carrie Tribble IB Feb 2018 Maximum Likelihood Tree Estimation Carrie Tribble IB 200 9 Feb 2018 Outline 1. Tree building process under maximum likelihood 2. Key differences between maximum likelihood and parsimony 3. Some fancy extras

More information

Sara C. Madeira. Universidade da Beira Interior. (Thanks to Ana Teresa Freitas, IST for useful resources on this subject)

Sara C. Madeira. Universidade da Beira Interior. (Thanks to Ana Teresa Freitas, IST for useful resources on this subject) Bioinformática Sequence Alignment Pairwise Sequence Alignment Universidade da Beira Interior (Thanks to Ana Teresa Freitas, IST for useful resources on this subject) 1 16/3/29 & 23/3/29 27/4/29 Outline

More information

Gain and Phase Margins Based Delay Dependent Stability Analysis of Two- Area LFC System with Communication Delays

Gain and Phase Margins Based Delay Dependent Stability Analysis of Two- Area LFC System with Communication Delays Gain and Phae Margin Baed Delay Dependent Stability Analyi of Two- Area LFC Sytem with Communication Delay Şahin Sönmez and Saffet Ayaun Department of Electrical Engineering, Niğde Ömer Halidemir Univerity,

More information

METHODS FOR DETERMINING PHYLOGENY. In Chapter 11, we discovered that classifying organisms into groups was, and still is, a difficult task.

METHODS FOR DETERMINING PHYLOGENY. In Chapter 11, we discovered that classifying organisms into groups was, and still is, a difficult task. Chapter 12 (Strikberger) Molecular Phylogenies and Evolution METHODS FOR DETERMINING PHYLOGENY In Chapter 11, we discovered that classifying organisms into groups was, and still is, a difficult task. Modern

More information

Lecture 4. Models of DNA and protein change. Likelihood methods

Lecture 4. Models of DNA and protein change. Likelihood methods Lecture 4. Models of DNA and protein change. Likelihood methods Joe Felsenstein Department of Genome Sciences and Department of Biology Lecture 4. Models of DNA and protein change. Likelihood methods p.1/39

More information

Clustering Methods without Given Number of Clusters

Clustering Methods without Given Number of Clusters Clutering Method without Given Number of Cluter Peng Xu, Fei Liu Introduction A we now, mean method i a very effective algorithm of clutering. It mot powerful feature i the calability and implicity. However,

More information

EE Control Systems LECTURE 14

EE Control Systems LECTURE 14 Updated: Tueday, March 3, 999 EE 434 - Control Sytem LECTURE 4 Copyright FL Lewi 999 All right reerved ROOT LOCUS DESIGN TECHNIQUE Suppoe the cloed-loop tranfer function depend on a deign parameter k We

More information

p. (The electron is a point particle with radius r = 0.)

p. (The electron is a point particle with radius r = 0.) - pin ½ Recall that in the H-atom olution, we howed that the fact that the wavefunction Ψ(r) i ingle-valued require that the angular momentum quantum nbr be integer: l = 0,,.. However, operator algebra

More information

Stochastic Perishable Inventory Control in a Service Facility System Maintaining Inventory for Service: Semi Markov Decision Problem

Stochastic Perishable Inventory Control in a Service Facility System Maintaining Inventory for Service: Semi Markov Decision Problem Stochatic Perihable Inventory Control in a Service Facility Sytem Maintaining Inventory for Service: Semi Markov Deciion Problem R.Mugeh 1,S.Krihnakumar 2, and C.Elango 3 1 mugehrengawamy@gmail.com 2 krihmathew@gmail.com

More information

Week 3 Statistics for bioinformatics and escience

Week 3 Statistics for bioinformatics and escience Week 3 Statitic for bioinformatic and escience Line Skotte 28. november 2008 2.9.3-4) In thi eercie we conider microrna data from Human and Moue. The data et repreent 685 independent realiation of the

More information

New bounds for Morse clusters

New bounds for Morse clusters New bound for More cluter Tamá Vinkó Advanced Concept Team, European Space Agency, ESTEC Keplerlaan 1, 2201 AZ Noordwijk, The Netherland Tama.Vinko@ea.int and Arnold Neumaier Fakultät für Mathematik, Univerität

More information

Design spacecraft external surfaces to ensure 95 percent probability of no mission-critical failures from particle impact.

Design spacecraft external surfaces to ensure 95 percent probability of no mission-critical failures from particle impact. PREFERRED RELIABILITY PAGE 1 OF 6 PRACTICES METEOROIDS & SPACE DEBRIS Practice: Deign pacecraft external urface to enure 95 percent probability of no miion-critical failure from particle impact. Benefit:

More information

Lecture Notes: Markov chains

Lecture Notes: Markov chains Computational Genomics and Molecular Biology, Fall 5 Lecture Notes: Markov chains Dannie Durand At the beginning of the semester, we introduced two simple scoring functions for pairwise alignments: a similarity

More information

Advanced Digital Signal Processing. Stationary/nonstationary signals. Time-Frequency Analysis... Some nonstationary signals. Time-Frequency Analysis

Advanced Digital Signal Processing. Stationary/nonstationary signals. Time-Frequency Analysis... Some nonstationary signals. Time-Frequency Analysis Advanced Digital ignal Proceing Prof. Nizamettin AYDIN naydin@yildiz.edu.tr Time-Frequency Analyi http://www.yildiz.edu.tr/~naydin 2 tationary/nontationary ignal Time-Frequency Analyi Fourier Tranform

More information

Bioinformatics. Scoring Matrices. David Gilbert Bioinformatics Research Centre

Bioinformatics. Scoring Matrices. David Gilbert Bioinformatics Research Centre Bioinformatics Scoring Matrices David Gilbert Bioinformatics Research Centre www.brc.dcs.gla.ac.uk Department of Computing Science, University of Glasgow Learning Objectives To explain the requirement

More information

Hyperbolic Partial Differential Equations

Hyperbolic Partial Differential Equations Hyperbolic Partial Differential Equation Evolution equation aociated with irreverible phyical procee like diffuion heat conduction lead to parabolic partial differential equation. When the equation i a

More information

The Hassenpflug Matrix Tensor Notation

The Hassenpflug Matrix Tensor Notation The Haenpflug Matrix Tenor Notation D.N.J. El Dept of Mech Mechatron Eng Univ of Stellenboch, South Africa e-mail: dnjel@un.ac.za 2009/09/01 Abtract Thi i a ample document to illutrate the typeetting of

More information

Overflow from last lecture: Ewald construction and Brillouin zones Structure factor

Overflow from last lecture: Ewald construction and Brillouin zones Structure factor Lecture 5: Overflow from lat lecture: Ewald contruction and Brillouin zone Structure factor Review Conider direct lattice defined by vector R = u 1 a 1 + u 2 a 2 + u 3 a 3 where u 1, u 2, u 3 are integer

More information

Lectures on Markov models in life and sickness insurance.

Lectures on Markov models in life and sickness insurance. Lecture on Markov model in life and ickne inurance. ANDERS MARTIN-LÖF Stockholm Univerity, Sweden September 14, 24 1 Introduction In thee lecture we will define a general theoretical framework for decribing

More information

NONISOTHERMAL OPERATION OF IDEAL REACTORS Plug Flow Reactor

NONISOTHERMAL OPERATION OF IDEAL REACTORS Plug Flow Reactor NONISOTHERMAL OPERATION OF IDEAL REACTORS Plug Flow Reactor T o T T o T F o, Q o F T m,q m T m T m T mo Aumption: 1. Homogeneou Sytem 2. Single Reaction 3. Steady State Two type of problem: 1. Given deired

More information

Jul 4, 2005 turbo_code_primer Revision 0.0. Turbo Code Primer

Jul 4, 2005 turbo_code_primer Revision 0.0. Turbo Code Primer Jul 4, 5 turbo_code_primer Reviion. Turbo Code Primer. Introduction Thi document give a quick tutorial on MAP baed turbo coder. Section develop the background theory. Section work through a imple numerical

More information

Jump condition at the boundary between a porous catalyst and a homogeneous fluid

Jump condition at the boundary between a porous catalyst and a homogeneous fluid From the SelectedWork of Francico J. Valde-Parada 2005 Jump condition at the boundary between a porou catalyt and a homogeneou fluid Francico J. Valde-Parada J. Alberto Ochoa-Tapia Available at: http://work.bepre.com/francico_j_valde_parada/12/

More information

Learning Multiplicative Interactions

Learning Multiplicative Interactions CSC2535 2011 Lecture 6a Learning Multiplicative Interaction Geoffrey Hinton Two different meaning of multiplicative If we take two denity model and multiply together their probability ditribution at each

More information

Biochemistry 324 Bioinformatics. Pairwise sequence alignment

Biochemistry 324 Bioinformatics. Pairwise sequence alignment Biochemistry 324 Bioinformatics Pairwise sequence alignment How do we compare genes/proteins? When we have sequenced a genome, we try and identify the function of unknown genes by finding a similar gene

More information

Question 1 Equivalent Circuits

Question 1 Equivalent Circuits MAE 40 inear ircuit Fall 2007 Final Intruction ) Thi exam i open book You may ue whatever written material you chooe, including your cla note and textbook You may ue a hand calculator with no communication

More information

Convex Hulls of Curves Sam Burton

Convex Hulls of Curves Sam Burton Convex Hull of Curve Sam Burton 1 Introduction Thi paper will primarily be concerned with determining the face of convex hull of curve of the form C = {(t, t a, t b ) t [ 1, 1]}, a < b N in R 3. We hall

More information

A CATEGORICAL CONSTRUCTION OF MINIMAL MODEL

A CATEGORICAL CONSTRUCTION OF MINIMAL MODEL A ATEGORIAL ONSTRUTION OF MINIMAL MODEL A. Behera, S. B. houdhury M. Routaray Department of Mathematic National Intitute of Technology ROURKELA - 769008 (India) abehera@nitrkl.ac.in 512ma6009@nitrkl.ac.in

More information

Design By Emulation (Indirect Method)

Design By Emulation (Indirect Method) Deign By Emulation (Indirect Method he baic trategy here i, that Given a continuou tranfer function, it i required to find the bet dicrete equivalent uch that the ignal produced by paing an input ignal

More information

Online Appendix for Managerial Attention and Worker Performance by Marina Halac and Andrea Prat

Online Appendix for Managerial Attention and Worker Performance by Marina Halac and Andrea Prat Online Appendix for Managerial Attention and Worker Performance by Marina Halac and Andrea Prat Thi Online Appendix contain the proof of our reult for the undicounted limit dicued in Section 2 of the paper,

More information

Combining allele frequency uncertainty and population substructure corrections in forensic DNA calculations

Combining allele frequency uncertainty and population substructure corrections in forensic DNA calculations Combining allele frequency uncertainty and population ubtructure correction in forenic DNA calculation arxiv:1509.08361v2 [tat.ap] 6 Oct 2015 Robert Cowell Faculty of Actuarial Science and Inurance Ca

More information

Chapter 4. The Laplace Transform Method

Chapter 4. The Laplace Transform Method Chapter 4. The Laplace Tranform Method The Laplace Tranform i a tranformation, meaning that it change a function into a new function. Actually, it i a linear tranformation, becaue it convert a linear combination

More information

Proof of Bernhard Riemann s Functional Equation using Gamma Function

Proof of Bernhard Riemann s Functional Equation using Gamma Function Journal of Mathematic and Statitic 4 (3): 8-85, 8 ISS 549-3644 8 Science Publication Proof of Bernhard Riemann Functional Equation uing Gamma Function Mbaïtiga Zacharie Department of Media Information

More information

TRANSITION PROBABILITY MATRIX OF BRIDGE MEMBERS DAMAGE RATING

TRANSITION PROBABILITY MATRIX OF BRIDGE MEMBERS DAMAGE RATING TRANSITION PROBABILITY MATRIX OF BRIDGE MEMBERS DAMAGE RATING Hirohi Sato and Ryoji Hagiwara 2 Abtract Bridge member damage characteritic were tudied uing the inpection record. Damage can be claified into

More information

Maximum Likelihood Until recently the newest method. Popularized by Joseph Felsenstein, Seattle, Washington.

Maximum Likelihood Until recently the newest method. Popularized by Joseph Felsenstein, Seattle, Washington. Maximum Likelihood This presentation is based almost entirely on Peter G. Fosters - "The Idiot s Guide to the Zen of Likelihood in a Nutshell in Seven Days for Dummies, Unleashed. http://www.bioinf.org/molsys/data/idiots.pdf

More information

Primitive Digraphs with the Largest Scrambling Index

Primitive Digraphs with the Largest Scrambling Index Primitive Digraph with the Larget Scrambling Index Mahmud Akelbek, Steve Kirkl 1 Department of Mathematic Statitic, Univerity of Regina, Regina, Sakatchewan, Canada S4S 0A Abtract The crambling index of

More information

Singular perturbation theory

Singular perturbation theory Singular perturbation theory Marc R. Rouel June 21, 2004 1 Introduction When we apply the teady-tate approximation (SSA) in chemical kinetic, we typically argue that ome of the intermediate are highly

More information

Performance Measures for BSkSP-3 with BMChSP-1 as a reference plan

Performance Measures for BSkSP-3 with BMChSP-1 as a reference plan International Journal of Advanced Scientific and Technical Reearch Iue 7 volume 4 July-Aug 2017 Available online on http://www.rpublication.com/ijt/index.html ISSN 2249-9954 Performance Meaure for BSkSP-3

More information

Equivalent Strain in Simple Shear Deformations

Equivalent Strain in Simple Shear Deformations Equivalent Strain in Simple Shear Deformation Yan Beygelzimer Donetk Intitute of Phyic and Engineering The National Academy of Science of Ukraine Abtract We how that imple hear and pure hear form two group

More information

Diffusion Processes. Chapter What is a Diffusion Process?

Diffusion Processes. Chapter What is a Diffusion Process? Chapter 2 Diffuion Procee 2.1 What i a Diffuion Proce? When we want to model a tochatic proce in continuou time it i almot impoible to pecify in ome reaonable manner a conitent et of finite dimenional

More information

Beta Burr XII OR Five Parameter Beta Lomax Distribution: Remarks and Characterizations

Beta Burr XII OR Five Parameter Beta Lomax Distribution: Remarks and Characterizations Marquette Univerity e-publication@marquette Mathematic, Statitic and Computer Science Faculty Reearch and Publication Mathematic, Statitic and Computer Science, Department of 6-1-2014 Beta Burr XII OR

More information

The continuous time random walk (CTRW) was introduced by Montroll and Weiss 1.

The continuous time random walk (CTRW) was introduced by Montroll and Weiss 1. 1 I. CONTINUOUS TIME RANDOM WALK The continuou time random walk (CTRW) wa introduced by Montroll and Wei 1. Unlike dicrete time random walk treated o far, in the CTRW the number of jump n made by the walker

More information

Solving Differential Equations by the Laplace Transform and by Numerical Methods

Solving Differential Equations by the Laplace Transform and by Numerical Methods 36CH_PHCalter_TechMath_95099 3//007 :8 PM Page Solving Differential Equation by the Laplace Tranform and by Numerical Method OBJECTIVES When you have completed thi chapter, you hould be able to: Find the

More information

NOTE: The items d) and e) of Question 4 gave you bonus marks.

NOTE: The items d) and e) of Question 4 gave you bonus marks. MAE 40 Linear ircuit Summer 2007 Final Solution NOTE: The item d) and e) of Quetion 4 gave you bonu mark. Quetion [Equivalent irciut] [4 mark] Find the equivalent impedance between terminal A and B in

More information

Lecture 4. Chapter 11 Nise. Controller Design via Frequency Response. G. Hovland 2004

Lecture 4. Chapter 11 Nise. Controller Design via Frequency Response. G. Hovland 2004 METR4200 Advanced Control Lecture 4 Chapter Nie Controller Deign via Frequency Repone G. Hovland 2004 Deign Goal Tranient repone via imple gain adjutment Cacade compenator to improve teady-tate error Cacade

More information

c n b n 0. c k 0 x b n < 1 b k b n = 0. } of integers between 0 and b 1 such that x = b k. b k c k c k

c n b n 0. c k 0 x b n < 1 b k b n = 0. } of integers between 0 and b 1 such that x = b k. b k c k c k 1. Exitence Let x (0, 1). Define c k inductively. Suppoe c 1,..., c k 1 are already defined. We let c k be the leat integer uch that x k An eay proof by induction give that and for all k. Therefore c n

More information

Tree of Life iological Sequence nalysis Chapter http://tolweb.org/tree/ Phylogenetic Prediction ll organisms on Earth have a common ancestor. ll species are related. The relationship is called a phylogeny

More information

Euler-Bernoulli Beams

Euler-Bernoulli Beams Euler-Bernoulli Beam The Euler-Bernoulli beam theory wa etablihed around 750 with contribution from Leonard Euler and Daniel Bernoulli. Bernoulli provided an expreion for the train energy in beam bending,

More information

One Class of Splitting Iterative Schemes

One Class of Splitting Iterative Schemes One Cla of Splitting Iterative Scheme v Ciegi and V. Pakalnytė Vilniu Gedimina Technical Univerity Saulėtekio al. 11, 2054, Vilniu, Lithuania rc@fm.vtu.lt Abtract. Thi paper deal with the tability analyi

More information

March 18, 2014 Academic Year 2013/14

March 18, 2014 Academic Year 2013/14 POLITONG - SHANGHAI BASIC AUTOMATIC CONTROL Exam grade March 8, 4 Academic Year 3/4 NAME (Pinyin/Italian)... STUDENT ID Ue only thee page (including the back) for anwer. Do not ue additional heet. Ue of

More information

Bio 1B Lecture Outline (please print and bring along) Fall, 2007

Bio 1B Lecture Outline (please print and bring along) Fall, 2007 Bio 1B Lecture Outline (please print and bring along) Fall, 2007 B.D. Mishler, Dept. of Integrative Biology 2-6810, bmishler@berkeley.edu Evolution lecture #5 -- Molecular genetics and molecular evolution

More information

Secretary problems with competing employers

Secretary problems with competing employers Secretary problem with competing employer Nicole Immorlica 1, Robert Kleinberg 2, and Mohammad Mahdian 1 1 Microoft Reearch, One Microoft Way, Redmond, WA. {nickle,mahdian}@microoft.com 2 UC Berkeley Computer

More information