Structure des petits réseaux

Size: px
Start display at page:

Download "Structure des petits réseaux"

Transcription

1 Structure des petits réseux génétiques et évolution in silico Pul Frnçois (thèse) Hervé Rouult (thèse) Lortoire de Physique Sttistique, NRS & ENS, Pris. IHP, jnvier 06.

2 Genetic networks. Dynmics in cell: istility, oscilltions (circdin,...) Sptil ptterns (. elegns, somites,...) oordinted evolution of severl genes/proteins. Design of synthetic modules.

3 synthetic genetic switch Two genes nd tht inhiit ech other. Two stle stedy sttes : [] high with [] low, nd [] high with [] low. Switching cn e induced y n IPTG or temperture pulse. Grdner et l, Nture 403: (2000) istility requires dimeriztions (or other interctions).

4 synthetic genetic ring oscilltor P L lc01 lci lite tetr lite Lc I Tet R λp R λl P L tet01 λl lite The oscilltion is sed on three genes tht repress ech other in circle ( rock-scissor-pper ). M. Elowitz nd S. Leiler, Nture 403: (2000)

5 Wht re the designs tht chieve given function? n one smple them nd dd desired constrints (roustness,...)? Esyness of cretion, evolvility,...? lueprints of useful networks.

6 n overrepresented motif in trnscriptionl networks X Y Z The feedforwrd loop is overrepresented in the trnscriptionl networks of E. oli nd S. erevisie (Milo et l., Science 298: (2002)). Function: persistence detector?

7 Proposl : design y selection in silico. The inverse of the sttisticl pproch: from the desired tsk to the network. To design modules performing given tsks (e.g. switches nd oscilltors), without imposing priori ny structure to the network, one evolves collection of virtul cells. P. Frnçois nd V. Hkim, PNS, (2004).

8 One computer cell consists in

9 One computer cell consists in - collection of genes - nd ssocited proteins First implementtion: trnscription nd trnsltion condensed in one single step. mrn re included in the present version.

10 One computer cell consists in - collection of genes - nd ssocited proteins First implementtion: trnscription nd trnsltion condensed in one single step. mrn re included in the present version. - trnscriptionl regultions - post-trnscriptionl regultions.

11 Representtion orresponding equtions d dt [] = τ [] δ [] d dt [] =θ[ : ] γ[][] d dt [ : ]=γ[][] θ[ : ] d dt [] = τ []τ [ : ]

12 The evolution in silico. c ells c c

13 The evolution in silico. oncentrtion Temps oncentrtion Temps Integrtion of ODEs oncentrtion oncentrtion Temps Temps

14 The evolution in silico. c Selection c c

15 The evolution in silico. c Elimintion c

16 The evolution in silico. c c Dupliction c c

17 The evolution in silico. c c c c Muttions

18 Possile muttions The modifiction of kinetic constnt in n existing rection or the ddition of new trnscriptionl regultion new post-trnscriptionl regultion new gene The process is iterted over severl genertions.

19 Fitness function for oscilltors [] 2 1 t Two concentrtions re fixed 1 nd 2. ODEs re integrted For t = T/2,3T/2,5T/2... fitness is given y the integrl ( 1 ) 2. For t = T,2T,3T... fitness is given y the integrl ( 2 ) 2.

20 Fitness evolution oncentrtion oncentrtion oncentrtion Genertion 49 Genertion 99 Genertion 199 Genertion 249 Genertion time Finl Stte time Score Genertions

21 The oscillting network c

22 purely iochemicl oscilltor

23 creted istle switch Very different from two genes with reciprocl inhiition

24 creted istle switch

25 creted istle switch

26 core genetic circuit: the Mixed Feedck Loop loop comining trnscriptionl nd post-trnscriptionl interction (i.e. protein-protein interction) is t the core of severl of these networks. This Mixed Feedck Loop hs now een found to e over-represented in S. erevisie nd E.oli (Yeger-Lotem et l, PNS 2004).

27 Mthemticl nlysis of the MFL X δ ρ g δ γ ρf g X δ β δr ρ α θ X X g ρ istility high low Oscilltions ρ 1 Reduced prmeters: ρ 0 = βρ f /(ρ δ r ),ρ 1 = βρ /(ρ δ r ) smll prmeter: δ r / ρ γ ( P. Frnçois nd V. Hkim, PRE (2005)

28 omprison with rel networks First switch: lctose operon, with llolctose inding to lc repressor. llolc llolc perm llolc llolc R βgl perm R R r lc lc R Proposed in 1961 y Monod nd Jco (sed on Lc operon) s n lterntive to reciprocl inhiition (Delrück, 1949)!

29 omprison with rel networks Second switch: developpement of competence in.sutilis, omk ctivtes itself nd is repressed y Mec. omk Mec lp Mec lp omk mec omk comk omk comk

30 Endogeneous oscilltor : the circdin clock ircdin ctivities of whole nimls nd single cells Liu et l, ell (1997)

31 The core structure of circdin clocks Froehlich et l, PNS (2003) Orgnism ctivtors Repressors Neurospor rss W-1, W-2 FRQ Drosophil dlk PER, TIM Mmmls LOK, ML PER, RY The creted networks re working exmples without delys or high Hill coefficients motivtion for new models of the circdin rhythms [for Neurospor, P. Frnçois iophys. J. 88, 2369 (2005)].

32 The lgorithm finds known (with complete description) nd originl designs. n importnt lesson: The post-trnscriptionl interctions ply crucil role: the function of the networks cnnot e understood t ll y focusing only on the trnscriptionl regultions (protein sequestrtion in complex ppers to e prticulrly importnt mechnism). Work in progress/perspectives nlysis of specific fetures of some genetic networks (e.g. temperture compenstion). lueprint for new synthetic networks. Evolution of rel genetic networks. Sptil ptterns, morphogenesis.

33 Somites Y. Sg, Nt. Rev. Gen. (2001)

34 Somitogénèse et oscilltions (ooke & Zeemn (1976) Plmeirim et l (1997)) Y. Sg, Nt. Rev. Gen. (2001)

35 Segmenttion s n oscillting/istle trnsition?

36 The End (for tody). Thnk you!

37 Temperture compenstion Selection of ctivtion energies for temperture compenstion: 10 o K increse : T : 300 o K 310 o K the kinetic constnts increse > 30%, period chnge < 3% [] Time

38 Fitness function for the switches The desired two stle sttes re chosen ( 1, 1 ) nd ( 2, 2 ). ODEs re integrted, the fitness is given y the integrl ( 1 ) 2 ( 1 ) 2. Pulse of protein ODEs re integrted, the fitness is given y the integrl ( 2 ) 2 ( 2 ) 2.

39 Trnscriptionl regultions

40 Post-trnscriptionl regultions *

41 Trnscriptionl switches

42 second type of switch

43 second type of switch

44 second type of switch

45 Toggle switch : mthemticl nlysis d dt = α 0 ν δ d dt = β 0 µ δ ν µ must e strictly higher thn 1 to hve istility, which requires t lest four (nd not two ) elementry rections. [herry nd dler, J. Theor. iol. (2000)]

Rates of chemical reactions

Rates of chemical reactions Rtes of chemicl rections Mesuring rtes of chemicl rections Experimentl mesuring progress of the rection Monitoring pressure in the rection involving gses 2 NO( g) 4 NO ( g) + O ( g) 2 5 2 2 n(1 α) 2αn

More information

Introduction to Electronic Circuits. DC Circuit Analysis: Transient Response of RC Circuits

Introduction to Electronic Circuits. DC Circuit Analysis: Transient Response of RC Circuits Introduction to Electronic ircuits D ircuit Anlysis: Trnsient esponse of ircuits Up until this point, we hve een looking t the Stedy Stte response of D circuits. StedyStte implies tht nothing hs chnged

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

Definite integral. Mathematics FRDIS MENDELU

Definite integral. Mathematics FRDIS MENDELU Definite integrl Mthemtics FRDIS MENDELU Simon Fišnrová Brno 1 Motivtion - re under curve Suppose, for simplicity, tht y = f(x) is nonnegtive nd continuous function defined on [, b]. Wht is the re of the

More information

Improper Integrals, and Differential Equations

Improper Integrals, and Differential Equations Improper Integrls, nd Differentil Equtions October 22, 204 5.3 Improper Integrls Previously, we discussed how integrls correspond to res. More specificlly, we sid tht for function f(x), the region creted

More information

Definite integral. Mathematics FRDIS MENDELU. Simona Fišnarová (Mendel University) Definite integral MENDELU 1 / 30

Definite integral. Mathematics FRDIS MENDELU. Simona Fišnarová (Mendel University) Definite integral MENDELU 1 / 30 Definite integrl Mthemtics FRDIS MENDELU Simon Fišnrová (Mendel University) Definite integrl MENDELU / Motivtion - re under curve Suppose, for simplicity, tht y = f(x) is nonnegtive nd continuous function

More information

Chapter 11. Sequence and Series

Chapter 11. Sequence and Series Chpter 11 Sequence nd Series Lesson 11-1 Mthemticl Ptterns Sequence A sequence is n ordered list of numbers clled terms. Exmple Pge 591, #2 Describe ech pttern formed. Find the next three terms 4,8,16,32,64,...

More information

CS415 Compilers. Lexical Analysis and. These slides are based on slides copyrighted by Keith Cooper, Ken Kennedy & Linda Torczon at Rice University

CS415 Compilers. Lexical Analysis and. These slides are based on slides copyrighted by Keith Cooper, Ken Kennedy & Linda Torczon at Rice University CS415 Compilers Lexicl Anlysis nd These slides re sed on slides copyrighted y Keith Cooper, Ken Kennedy & Lind Torczon t Rice University First Progrmming Project Instruction Scheduling Project hs een posted

More information

Minimal DFA. minimal DFA for L starting from any other

Minimal DFA. minimal DFA for L starting from any other Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA

More information

We will see what is meant by standard form very shortly

We will see what is meant by standard form very shortly THEOREM: For fesible liner progrm in its stndrd form, the optimum vlue of the objective over its nonempty fesible region is () either unbounded or (b) is chievble t lest t one extreme point of the fesible

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

Jim Lambers MAT 169 Fall Semester Lecture 4 Notes

Jim Lambers MAT 169 Fall Semester Lecture 4 Notes Jim Lmbers MAT 169 Fll Semester 2009-10 Lecture 4 Notes These notes correspond to Section 8.2 in the text. Series Wht is Series? An infinte series, usully referred to simply s series, is n sum of ll of

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

Module 2: Rate Law & Stoichiomtery (Chapter 3, Fogler)

Module 2: Rate Law & Stoichiomtery (Chapter 3, Fogler) CHE 309: Chemicl Rection Engineering Lecture-8 Module 2: Rte Lw & Stoichiomtery (Chpter 3, Fogler) Topics to be covered in tody s lecture Thermodynmics nd Kinetics Rection rtes for reversible rections

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

u( t) + K 2 ( ) = 1 t > 0 Analyzing Damped Oscillations Problem (Meador, example 2-18, pp 44-48): Determine the equation of the following graph.

u( t) + K 2 ( ) = 1 t > 0 Analyzing Damped Oscillations Problem (Meador, example 2-18, pp 44-48): Determine the equation of the following graph. nlyzing Dmped Oscilltions Prolem (Medor, exmple 2-18, pp 44-48): Determine the eqution of the following grph. The eqution is ssumed to e of the following form f ( t) = K 1 u( t) + K 2 e!"t sin (#t + $

More information

State space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies

State space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response

More information

Topics Covered AP Calculus AB

Topics Covered AP Calculus AB Topics Covered AP Clculus AB ) Elementry Functions ) Properties of Functions i) A function f is defined s set of ll ordered pirs (, y), such tht for ech element, there corresponds ectly one element y.

More information

Hybrid Control and Switched Systems. Lecture #2 How to describe a hybrid system? Formal models for hybrid system

Hybrid Control and Switched Systems. Lecture #2 How to describe a hybrid system? Formal models for hybrid system Hyrid Control nd Switched Systems Lecture #2 How to descrie hyrid system? Forml models for hyrid system João P. Hespnh University of Cliforni t Snt Brr Summry. Forml models for hyrid systems: Finite utomt

More information

Refined interfaces for compositional verification

Refined interfaces for compositional verification Refined interfces for compositionl verifiction Frédéric Lng INRI Rhône-lpes http://www.inrilpes.fr/vsy Motivtion Enumertive verifiction of concurrent systems Prllel composition of synchronous processes

More information

Chapter 2 Finite Automata

Chapter 2 Finite Automata Chpter 2 Finite Automt 28 2.1 Introduction Finite utomt: first model of the notion of effective procedure. (They lso hve mny other pplictions). The concept of finite utomton cn e derived y exmining wht

More information

A sequence is a list of numbers in a specific order. A series is a sum of the terms of a sequence.

A sequence is a list of numbers in a specific order. A series is a sum of the terms of a sequence. Core Module Revision Sheet The C exm is hour 30 minutes long nd is in two sections. Section A (36 mrks) 8 0 short questions worth no more thn 5 mrks ech. Section B (36 mrks) 3 questions worth mrks ech.

More information

Lecture 20: Numerical Integration III

Lecture 20: Numerical Integration III cs4: introduction to numericl nlysis /8/0 Lecture 0: Numericl Integrtion III Instructor: Professor Amos Ron Scribes: Mrk Cowlishw, Yunpeng Li, Nthnel Fillmore For the lst few lectures we hve discussed

More information

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION doi:3/nture5 Δp y Pr ric ol rb in * e c mrna fold chnge reltive to wild type in NHCl medi < / >6 Supplementl Figure. Glol nd pyrimidine-relted gene expression in ΔpyrI crb* strin.. Fold chnges of RNA trnscripts

More information

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

CS S-12 Turing Machine Modifications 1. When we added a stack to NFA to get a PDA, we increased computational power

CS S-12 Turing Machine Modifications 1. When we added a stack to NFA to get a PDA, we increased computational power CS411-2015S-12 Turing Mchine Modifictions 1 12-0: Extending Turing Mchines When we dded stck to NFA to get PDA, we incresed computtionl power Cn we do the sme thing for Turing Mchines? Tht is, cn we dd

More information

Fault Modeling. EE5375 ADD II Prof. MacDonald

Fault Modeling. EE5375 ADD II Prof. MacDonald Fult Modeling EE5375 ADD II Prof. McDonld Stuck At Fult Models l Modeling of physicl defects (fults) simplify to logicl fult l stuck high or low represents mny physicl defects esy to simulte technology

More information

Jack Simons, Henry Eyring Scientist and Professor Chemistry Department University of Utah

Jack Simons, Henry Eyring Scientist and Professor Chemistry Department University of Utah 1. Born-Oppenheimer pprox.- energy surfces 2. Men-field (Hrtree-Fock) theory- orbitls 3. Pros nd cons of HF- RHF, UHF 4. Beyond HF- why? 5. First, one usully does HF-how? 6. Bsis sets nd nottions 7. MPn,

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

Hidden Markov Models

Hidden Markov Models Hidden Mrkov Models Huptseminr Mchine Lerning 18.11.2003 Referent: Nikols Dörfler 1 Overview Mrkov Models Hidden Mrkov Models Types of Hidden Mrkov Models Applictions using HMMs Three centrl problems:

More information

63. Representation of functions as power series Consider a power series. ( 1) n x 2n for all 1 < x < 1

63. Representation of functions as power series Consider a power series. ( 1) n x 2n for all 1 < x < 1 3 9. SEQUENCES AND SERIES 63. Representtion of functions s power series Consider power series x 2 + x 4 x 6 + x 8 + = ( ) n x 2n It is geometric series with q = x 2 nd therefore it converges for ll q =

More information

Driving Cycle Construction of City Road for Hybrid Bus Based on Markov Process Deng Pan1, a, Fengchun Sun1,b*, Hongwen He1, c, Jiankun Peng1, d

Driving Cycle Construction of City Road for Hybrid Bus Based on Markov Process Deng Pan1, a, Fengchun Sun1,b*, Hongwen He1, c, Jiankun Peng1, d Interntionl Industril Informtics nd Computer Engineering Conference (IIICEC 15) Driving Cycle Construction of City Rod for Hybrid Bus Bsed on Mrkov Process Deng Pn1,, Fengchun Sun1,b*, Hongwen He1, c,

More information

Safety Controller Synthesis for Switched Systems using Multiscale Symbolic Models

Safety Controller Synthesis for Switched Systems using Multiscale Symbolic Models Sfety Controller Synthesis for Switched Systems using Multiscle Symolic Models Antoine Girrd Lortoire des Signux et Systèmes Gif sur Yvette, Frnce Workshop on switching dynmics & verifiction Pris, Jnury

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

Matrix Solution to Linear Equations and Markov Chains

Matrix Solution to Linear Equations and Markov Chains Trding Systems nd Methods, Fifth Edition By Perry J. Kufmn Copyright 2005, 2013 by Perry J. Kufmn APPENDIX 2 Mtrix Solution to Liner Equtions nd Mrkov Chins DIRECT SOLUTION AND CONVERGENCE METHOD Before

More information

CHAPTER 20: Second Law of Thermodynamics

CHAPTER 20: Second Law of Thermodynamics CHAER 0: Second Lw of hermodynmics Responses to Questions 3. kg of liquid iron will hve greter entropy, since it is less ordered thn solid iron nd its molecules hve more therml motion. In ddition, het

More information

Lecture 6: Diffusion and Reaction kinetics

Lecture 6: Diffusion and Reaction kinetics Lecture 6: Diffusion nd Rection kinetics 1-1-1 Lecture pln: diffusion thermodynmic forces evolution of concentrtion distribution rection rtes nd methods to determine them rection mechnism in terms of the

More information

LECTURE 14. Dr. Teresa D. Golden University of North Texas Department of Chemistry

LECTURE 14. Dr. Teresa D. Golden University of North Texas Department of Chemistry LECTURE 14 Dr. Teres D. Golden University of North Texs Deprtment of Chemistry Quntittive Methods A. Quntittive Phse Anlysis Qulittive D phses by comprison with stndrd ptterns. Estimte of proportions of

More information

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS. THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem

More information

Energy Bands Energy Bands and Band Gap. Phys463.nb Phenomenon

Energy Bands Energy Bands and Band Gap. Phys463.nb Phenomenon Phys463.nb 49 7 Energy Bnds Ref: textbook, Chpter 7 Q: Why re there insultors nd conductors? Q: Wht will hppen when n electron moves in crystl? In the previous chpter, we discussed free electron gses,

More information

The Regulated and Riemann Integrals

The Regulated and Riemann Integrals Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue

More information

CSCI 340: Computational Models. Kleene s Theorem. Department of Computer Science

CSCI 340: Computational Models. Kleene s Theorem. Department of Computer Science CSCI 340: Computtionl Models Kleene s Theorem Chpter 7 Deprtment of Computer Science Unifiction In 1954, Kleene presented (nd proved) theorem which (in our version) sttes tht if lnguge cn e defined y ny

More information

New Expansion and Infinite Series

New Expansion and Infinite Series Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University

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

Acid-Base Equilibria

Acid-Base Equilibria Tdeusz Górecki Ionic Equiliri Acid-Bse Equiliri Brønsted-Lory: n cid is proton, se is. Acid Bse ( 3 PO 4, O), ( N 4 ) nd ( PO - 4 ) cn ll ehve s cids. Exmple: 4 N N3 Sustnces hich cn ehve oth s cids nd

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

z TRANSFORMS z Transform Basics z Transform Basics Transfer Functions Back to the Time Domain Transfer Function and Stability

z TRANSFORMS z Transform Basics z Transform Basics Transfer Functions Back to the Time Domain Transfer Function and Stability TRASFORS Trnsform Bsics Trnsfer Functions Bck to the Time Domin Trnsfer Function nd Stility DSP-G 6. Trnsform Bsics The definition of the trnsform for digitl signl is: -n X x[ n is complex vrile The trnsform

More information

11.1 Finite Automata. CS125 Lecture 11 Fall Motivation: TMs without a tape: maybe we can at least fully understand such a simple model?

11.1 Finite Automata. CS125 Lecture 11 Fall Motivation: TMs without a tape: maybe we can at least fully understand such a simple model? CS125 Lecture 11 Fll 2016 11.1 Finite Automt Motivtion: TMs without tpe: mybe we cn t lest fully understnd such simple model? Algorithms (e.g. string mtching) Computing with very limited memory Forml verifiction

More information

THE INTERVAL LATTICE BOLTZMANN METHOD FOR TRANSIENT HEAT TRANSFER IN A SILICON THIN FILM

THE INTERVAL LATTICE BOLTZMANN METHOD FOR TRANSIENT HEAT TRANSFER IN A SILICON THIN FILM ROMAI J., v.9, no.2(2013), 173 179 THE INTERVAL LATTICE BOLTZMANN METHOD FOR TRANSIENT HEAT TRANSFER IN A SILICON THIN FILM Alicj Piseck-Belkhyt, Ann Korczk Institute of Computtionl Mechnics nd Engineering,

More information

Global Types for Dynamic Checking of Protocol Conformance of Multi-Agent Systems

Global Types for Dynamic Checking of Protocol Conformance of Multi-Agent Systems Globl Types for Dynmic Checking of Protocol Conformnce of Multi-Agent Systems (Extended Abstrct) Dvide Ancon, Mtteo Brbieri, nd Vivin Mscrdi DIBRIS, University of Genov, Itly emil: dvide@disi.unige.it,

More information

Lecture 08: Feb. 08, 2019

Lecture 08: Feb. 08, 2019 4CS4-6:Theory of Computtion(Closure on Reg. Lngs., regex to NDFA, DFA to regex) Prof. K.R. Chowdhry Lecture 08: Fe. 08, 2019 : Professor of CS Disclimer: These notes hve not een sujected to the usul scrutiny

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

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

A Critical Path Problem Using Intuitionistic. Trapezoidal Fuzzy Number

A Critical Path Problem Using Intuitionistic. Trapezoidal Fuzzy Number pplied Mthemticl Sciences, Vol. 8, 0, no. 5, 555-56 HIKRI Ltd, www.m-hikri.com http://dx.doi.org/0.988/ms.0.9 Criticl Pth Prolem Using Intuitionistic Trpezoidl Fuzzy Numer P. Jygowri Deprtment of Mthemtics

More information

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER LANGUAGES AND COMPUTATION ANSWERS

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER LANGUAGES AND COMPUTATION ANSWERS The University of Nottinghm SCHOOL OF COMPUTER SCIENCE LEVEL 2 MODULE, SPRING SEMESTER 2016 2017 LNGUGES ND COMPUTTION NSWERS Time llowed TWO hours Cndidtes my complete the front cover of their nswer ook

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

5.7 Improper Integrals

5.7 Improper Integrals 458 pplictions of definite integrls 5.7 Improper Integrls In Section 5.4, we computed the work required to lift pylod of mss m from the surfce of moon of mss nd rdius R to height H bove the surfce of the

More information

Module 6: LINEAR TRANSFORMATIONS

Module 6: LINEAR TRANSFORMATIONS Module 6: LINEAR TRANSFORMATIONS. Trnsformtions nd mtrices Trnsformtions re generliztions of functions. A vector x in some set S n is mpped into m nother vector y T( x). A trnsformtion is liner if, for

More information

DATA Search I 魏忠钰. 复旦大学大数据学院 School of Data Science, Fudan University. March 7 th, 2018

DATA Search I 魏忠钰. 复旦大学大数据学院 School of Data Science, Fudan University. March 7 th, 2018 DATA620006 魏忠钰 Serch I Mrch 7 th, 2018 Outline Serch Problems Uninformed Serch Depth-First Serch Bredth-First Serch Uniform-Cost Serch Rel world tsk - Pc-mn Serch problems A serch problem consists of:

More information

Research Article Moment Inequalities and Complete Moment Convergence

Research Article Moment Inequalities and Complete Moment Convergence Hindwi Publishing Corportion Journl of Inequlities nd Applictions Volume 2009, Article ID 271265, 14 pges doi:10.1155/2009/271265 Reserch Article Moment Inequlities nd Complete Moment Convergence Soo Hk

More information

Chapter 5 Plan-Space Planning

Chapter 5 Plan-Space Planning Lecture slides for Automted Plnning: Theory nd Prctice Chpter 5 Pln-Spce Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Stte-Spce Plnning Motivtion g 1 1 g 4 4 s 0 g 5 5 g 2

More information

Regular expressions, Finite Automata, transition graphs are all the same!!

Regular expressions, Finite Automata, transition graphs are all the same!! CSI 3104 /Winter 2011: Introduction to Forml Lnguges Chpter 7: Kleene s Theorem Chpter 7: Kleene s Theorem Regulr expressions, Finite Automt, trnsition grphs re ll the sme!! Dr. Neji Zgui CSI3104-W11 1

More information

Improper Integrals. Type I Improper Integrals How do we evaluate an integral such as

Improper Integrals. Type I Improper Integrals How do we evaluate an integral such as Improper Integrls Two different types of integrls cn qulify s improper. The first type of improper integrl (which we will refer to s Type I) involves evluting n integrl over n infinite region. In the grph

More information

Predict Global Earth Temperature using Linier Regression

Predict Global Earth Temperature using Linier Regression Predict Globl Erth Temperture using Linier Regression Edwin Swndi Sijbt (23516012) Progrm Studi Mgister Informtik Sekolh Teknik Elektro dn Informtik ITB Jl. Gnesh 10 Bndung 40132, Indonesi 23516012@std.stei.itb.c.id

More information

Supplementary Material for Wave-pinning and cell polarity from a bistable reaction-diffusion system

Supplementary Material for Wave-pinning and cell polarity from a bistable reaction-diffusion system Supplementry Mteril for Wve-pinning nd cell polrity from bistble rection-diffusion system Yoichiro Mori, Alendr Jilkine nd Leh Edelstein-Keshet Model Comprisons We concentrte here the three systems to

More information

Section 6.1 INTRO to LAPLACE TRANSFORMS

Section 6.1 INTRO to LAPLACE TRANSFORMS Section 6. INTRO to LAPLACE TRANSFORMS Key terms: Improper Integrl; diverge, converge A A f(t)dt lim f(t)dt Piecewise Continuous Function; jump discontinuity Function of Exponentil Order Lplce Trnsform

More information

University of Washington Department of Chemistry Chemistry 453 Winter Quarter 2010 Homework Assignment 4; Due at 5p.m. on 2/01/10

University of Washington Department of Chemistry Chemistry 453 Winter Quarter 2010 Homework Assignment 4; Due at 5p.m. on 2/01/10 University of Wshington Deprtment of Chemistry Chemistry 45 Winter Qurter Homework Assignment 4; Due t 5p.m. on // We lerned tht the Hmiltonin for the quntized hrmonic oscilltor is ˆ d κ H. You cn obtin

More information

CSCI 340: Computational Models. Transition Graphs. Department of Computer Science

CSCI 340: Computational Models. Transition Graphs. Department of Computer Science CSCI 340: Computtionl Models Trnsition Grphs Chpter 6 Deprtment of Computer Science Relxing Restrints on Inputs We cn uild n FA tht ccepts only the word! 5 sttes ecuse n FA cn only process one letter t

More information

Terminal Velocity and Raindrop Growth

Terminal Velocity and Raindrop Growth Terminl Velocity nd Rindrop Growth Terminl velocity for rindrop represents blnce in which weight mss times grvity is equl to drg force. F 3 π3 ρ L g in which is drop rdius, g is grvittionl ccelertion,

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

8. Complex Numbers. We can combine the real numbers with this new imaginary number to form the complex numbers.

8. Complex Numbers. We can combine the real numbers with this new imaginary number to form the complex numbers. 8. Complex Numers The rel numer system is dequte for solving mny mthemticl prolems. But it is necessry to extend the rel numer system to solve numer of importnt prolems. Complex numers do not chnge the

More information

A Symbolic Approach to Control via Approximate Bisimulations

A Symbolic Approach to Control via Approximate Bisimulations A Symolic Approch to Control vi Approximte Bisimultions Antoine Girrd Lortoire Jen Kuntzmnn, Université Joseph Fourier Grenole, Frnce Interntionl Symposium on Innovtive Mthemticl Modelling Tokyo, Jpn,

More information

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION VOLUME: ARTICLE NUMBER: 3 In the formt provided y the uthors nd unedited. Developmentl constrints shpe the evolution of the nemtode mid-developmentl trnsition Hrel Zlts nd Iti Yni,3 Fculty of Biology,

More information

13: Diffusion in 2 Energy Groups

13: Diffusion in 2 Energy Groups 3: Diffusion in Energy Groups B. Rouben McMster University Course EP 4D3/6D3 Nucler Rector Anlysis (Rector Physics) 5 Sept.-Dec. 5 September Contents We study the diffusion eqution in two energy groups

More information

Taylor Polynomial Inequalities

Taylor Polynomial Inequalities Tylor Polynomil Inequlities Ben Glin September 17, 24 Abstrct There re instnces where we my wish to pproximte the vlue of complicted function round given point by constructing simpler function such s polynomil

More information

NUMERICAL INTEGRATION

NUMERICAL INTEGRATION NUMERICAL INTEGRATION How do we evlute I = f (x) dx By the fundmentl theorem of clculus, if F (x) is n ntiderivtive of f (x), then I = f (x) dx = F (x) b = F (b) F () However, in prctice most integrls

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

A recursive construction of efficiently decodable list-disjunct matrices

A recursive construction of efficiently decodable list-disjunct matrices CSE 709: Compressed Sensing nd Group Testing. Prt I Lecturers: Hung Q. Ngo nd Atri Rudr SUNY t Bufflo, Fll 2011 Lst updte: October 13, 2011 A recursive construction of efficiently decodble list-disjunct

More information

3.2.2 Kinetics. Maxwell Boltzmann distribution. 128 minutes. 128 marks. Page 1 of 12

3.2.2 Kinetics. Maxwell Boltzmann distribution. 128 minutes. 128 marks. Page 1 of 12 3.. Kinetics Mxwell Boltzmnn distribution 8 minutes 8 mrks Pge of M. () M On the energy xis E mp t the mximum of the originl pek M The limits for the horizontl position of E mp re defined s bove the word

More information

Gold s algorithm. Acknowledgements. Why would this be true? Gold's Algorithm. 1 Key ideas. Strings as states

Gold s algorithm. Acknowledgements. Why would this be true? Gold's Algorithm. 1 Key ideas. Strings as states Acknowledgements Gold s lgorithm Lurent Miclet, Jose Oncin nd Tim Otes for previous versions of these slides. Rfel Crrsco, Pco Cscuert, Rémi Eyrud, Philippe Ezequel, Henning Fernu, Thierry Murgue, Frnck

More information

Fundamental Theorem of Calculus

Fundamental Theorem of Calculus Fundmentl Theorem of Clculus Recll tht if f is nonnegtive nd continuous on [, ], then the re under its grph etween nd is the definite integrl A= f() d Now, for in the intervl [, ], let A() e the re under

More information

4. Calculus of Variations

4. Calculus of Variations 4. Clculus of Vritions Introduction - Typicl Problems The clculus of vritions generlises the theory of mxim nd minim. Exmple (): Shortest distnce between two points. On given surfce (e.g. plne), nd the

More information

Safety Controller Synthesis for Switched Systems using Multiscale Symbolic Models

Safety Controller Synthesis for Switched Systems using Multiscale Symbolic Models Sfety Controller Synthesis for Switched Systems using Multiscle Symolic Models Antoine Girrd Lortoire des Signux et Systèmes Gif sur Yvette, Frnce Séminire du LAAS Toulouse, 29 Juin, 2016 A. Girrd (L2S-CNRS)

More information

Recursively Enumerable and Recursive. Languages

Recursively Enumerable and Recursive. Languages Recursively Enumerble nd Recursive nguges 1 Recll Definition (clss 19.pdf) Definition 10.4, inz, 6 th, pge 279 et S be set of strings. An enumertion procedure for Turing Mchine tht genertes ll strings

More information

Final Exam - Review MATH Spring 2017

Final Exam - Review MATH Spring 2017 Finl Exm - Review MATH 5 - Spring 7 Chpter, 3, nd Sections 5.-5.5, 5.7 Finl Exm: Tuesdy 5/9, :3-7:pm The following is list of importnt concepts from the sections which were not covered by Midterm Exm or.

More information

Summarizing Remarks λ λ λ. : equilibrium geometry

Summarizing Remarks λ λ λ. : equilibrium geometry 112 Summrizing Remrks... 112 Summrizing Remrks The theory underlying chemicl processes, in prticulr chemicl equilibrium is mture science. The bsis of the edifice is Quntum Mechnics! For prticulr volume

More information

u t = k 2 u x 2 (1) a n sin nπx sin 2 L e k(nπ/l) t f(x) = sin nπx f(x) sin nπx dx (6) 2 L f(x 0 ) sin nπx 0 2 L sin nπx 0 nπx

u t = k 2 u x 2 (1) a n sin nπx sin 2 L e k(nπ/l) t f(x) = sin nπx f(x) sin nπx dx (6) 2 L f(x 0 ) sin nπx 0 2 L sin nπx 0 nπx Chpter 9: Green s functions for time-independent problems Introductory emples One-dimensionl het eqution Consider the one-dimensionl het eqution with boundry conditions nd initil condition We lredy know

More information

f(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral

f(x) dx, If one of these two conditions is not met, we call the integral improper. Our usual definition for the value for the definite integral Improper Integrls Every time tht we hve evluted definite integrl such s f(x) dx, we hve mde two implicit ssumptions bout the integrl:. The intervl [, b] is finite, nd. f(x) is continuous on [, b]. If one

More information

MATH , Calculus 2, Fall 2018

MATH , Calculus 2, Fall 2018 MATH 36-2, 36-3 Clculus 2, Fll 28 The FUNdmentl Theorem of Clculus Sections 5.4 nd 5.5 This worksheet focuses on the most importnt theorem in clculus. In fct, the Fundmentl Theorem of Clculus (FTC is rgubly

More information

Module 11.4: nag quad util Numerical Integration Utilities. Contents

Module 11.4: nag quad util Numerical Integration Utilities. Contents Qudrture Module Contents Module 11.4: ng qud util Numericl Integrtion Utilities ng qud util provides utility procedures for computtion involving integrtion of functions, e.g., the computtion of the weights

More information

Remarks to the H-mode workshop paper

Remarks to the H-mode workshop paper 2 nd ITPA Confinement Dtbse nd Modeling Topicl Group Meeting, Mrch 11-14, 2002, Princeton Remrks to the H-mode workshop pper The development of two-term model for the confinement in ELMy H-modes using

More information

UNIVERSITY OF MALTA DEPARTMENT OF CHEMISTRY. CH237 - Chemical Thermodynamics and Kinetics. Tutorial Sheet VIII

UNIVERSITY OF MALTA DEPARTMENT OF CHEMISTRY. CH237 - Chemical Thermodynamics and Kinetics. Tutorial Sheet VIII UNIVERSITY OF MALTA DEPARTMENT OF CHEMISTRY CH237 - Chemicl Thermodynmics nd Kinetics Tutoril Sheet VIII 1 () (i) The rte of the rection A + 2B 3C + D ws reported s 1.0 mol L -1 s -1. Stte the rtes of

More information

Global Session Types for Dynamic Checking of Protocol Conformance of Multi-Agent Systems

Global Session Types for Dynamic Checking of Protocol Conformance of Multi-Agent Systems Globl Session Types for Dynmic Checking of Protocol Conformnce of Multi-Agent Systems (Extended Abstrct) Dvide Ancon, Mtteo Brbieri, nd Vivin Mscrdi DIBRIS, University of Genov, Itly emil: dvide@disi.unige.it,

More information

Preview 11/1/2017. Greedy Algorithms. Coin Change. Coin Change. Coin Change. Coin Change. Greedy algorithms. Greedy Algorithms

Preview 11/1/2017. Greedy Algorithms. Coin Change. Coin Change. Coin Change. Coin Change. Greedy algorithms. Greedy Algorithms Preview Greed Algorithms Greed Algorithms Coin Chnge Huffmn Code Greed lgorithms end to e simple nd strightforwrd. Are often used to solve optimiztion prolems. Alws mke the choice tht looks est t the moment,

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

The Thermodynamics of Aqueous Electrolyte Solutions

The Thermodynamics of Aqueous Electrolyte Solutions 18 The Thermodynmics of Aqueous Electrolyte Solutions As discussed in Chpter 10, when slt is dissolved in wter or in other pproprite solvent, the molecules dissocite into ions. In queous solutions, strong

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

Songklanakarin Journal of Science and Technology SJST R1 Thongchan. A Modified Hyperbolic Secant Distribution

Songklanakarin Journal of Science and Technology SJST R1 Thongchan. A Modified Hyperbolic Secant Distribution A Modified Hyperbolic Secnt Distribution Journl: Songklnkrin Journl of Science nd Technology Mnuscript ID SJST-0-0.R Mnuscript Type: Originl Article Dte Submitted by the Author: 0-Mr-0 Complete List of

More information

Improper Integrals. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics

Improper Integrals. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics Improper Integrls MATH 2, Clculus II J. Robert Buchnn Deprtment of Mthemtics Spring 28 Definite Integrls Theorem (Fundmentl Theorem of Clculus (Prt I)) If f is continuous on [, b] then b f (x) dx = [F(x)]

More information

PHYS 601 HW3 Solution

PHYS 601 HW3 Solution 3.1 Norl force using Lgrnge ultiplier Using the center of the hoop s origin, we will describe the position of the prticle with conventionl polr coordintes. The Lgrngin is therefore L = 1 2 ṙ2 + 1 2 r2

More information