Genetic Programming. Outline. Evolutionary Strategies. Evolutionary strategies Genetic programming Summary
|
|
- Phoebe Higgins
- 5 years ago
- Views:
Transcription
1 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 in Germny in the erly 1960s. Unlike genetic lgorithms, this pproch clled n evolutionry strtegy ws designed to solve engineering optimiztion prolems. In 1963 two students of the Technicl University of Berlin, Ingo Rechenerg nd Hns-Pul Schwefel, were working on the serch for the optiml shpes of odies in flow. They decided to try rndom chnges in the prmeters defining the shpe following the exmple of nturl muttion. As result, the evolution strtegy ws orn. Evolutionry strtegies were developed s n lterntive to the engineer s intuition. Unlike GAs, evolution strtegies use only muttion opertor.
2 Bsic evolution strtegies In its simplest form, termed s (11)-evolution strtegy, one prent genertes one offspring per genertion y pplying normlly distriuted muttion. The (11)-evolutionry strtegy cn e implemented s follows: Step 1: Choose the numer of prmeters N to represent the prolem, nd then determine fesile rnge for ech prmeter: x1 min, x1mx, x2 min, x2mx,..., x Nmin, xnmx Define stndrd devition for ech prmeter nd the function to e optimized. Step 2: Rndomly select n initil vlue for ech prmeter from the respective fesile rnge. The set of these prmeters will constitute the initil popultion of prent prmeters: x 1, x 2,..., x N Step 3: Clculte the solution ssocited with the prent prmeters: X = f (x 1, x 2,..., x N ) Step 4: Crete new (offspring) prmeter y dding normlly distriuted rndom vrile with men zero nd pre-selected devition to ech prent prmeter: xi xi 0, i = 1, 2,..., N Normlly distriuted muttions with men zero reflect the nturl process of evolution (smller chnges occur more frequently thn lrger ones). Step 5: Clculte the solution ssocited with the offspring prmeters: X f x1, x2,..., x N Step 6: Compre the offspring solution the prents. If the offspring solution is etter thn the prents, replce the prent popultion with the offspring popultion. Otherwise, keep the prent prmeters. Step 7: Go to Step 4, nd repet the process until stisfctory solution is reched, or specified numer of genertions is considered. d
3 An evolutionry strtegy reflects the nture of chromosome. A single gene my simultneously ffect severl chrcteristics of the living orgnism. On the other hnd, single chrcteristic of n individul my e determined y the simultneous interctions of severl genes. The nturl selection ec cts on collection o of genes, es, not on single gene in isoltion. Genetic progrmming One of the centrl prolems in computer science is how to mke computers solve prolems without eing explicitly progrmmed to do so. Genetic progrmming offers solution through the evolution of computer progrms y methods of nturl selection. In fct, genetic progrmming is n extension of the conventionl genetic lgorithm, ut the gol of genetic progrmming is not just to evolve itstring representtion of some prolem ut the computer code tht solves the prolem. Genetic progrmming n evolutionry computtion lgorithm stimulted in the 1990s y John Koz. Genetic progrmming serches the spce of possile computer progrms for progrm tht is highly fit for solving the prolem t hnd. Any computer progrm is sequence of opertions (functions) pplied to vlues (rguments), ut different progrmming lnguges my include different types of sttements nd opertions, nd hve different syntctic restrictions. Since genetic progrmming mnipultes progrms y pplying genetic opertors, progrmming lnguge should permit computer progrm to e mnipulted s dt nd the newly creted ddt to e executed s progrm. For these resons, LISP ws chosen s the min lnguge for genetic progrmming.
4 LISP structure LISP hs highly symol-oriented structure. Its sic dt structures re toms nd lists. An tom is the smllest indivisile element of the LISP syntx. The numer 21, the symol X nd the string This is string re exmples of LISP toms. A list is n oject composed of toms nd/or other lists. LISP lists re written s n ordered d collection of items inside pir of prentheses. For exmple, the list ( ( AB)C) LISP structure clls for the ppliction i of the sutrction function () to two rguments, nmely the list (A B) nd the tom C. First, LISP pplies the multipliction function () to the toms A nd B. Once the list (A B) is evluted, LISP pplies the sutrction function () to the two rguments, nd thus evlutes the entire list ( ( A B) C). Grphicl representtion of LISP S-expressions Both toms nd lists re clled symolic expressions or S-expressions. In LISP, ll dt nd ll progrms re S-expressions. This gives LISP the ility to operte on progrms s if they were dt. In other words, LISP progrms cn modify themselves or even write other LISP progrms. This remrkle property of LISP mkes it very ttrctive for genetic progrmming. Any LISP S-expression cn e depicted s rooted point-lelled tree with ordered rnches. LISP S-expression ( (A B) C) C A B
5 How do we pply genetic progrmming to prolem? Before pplying genetic progrmming to prolem, we must ccomplish hfive preprtory steps: 1. Determine the set of terminls. 2. Select the set of primitive functions. 3. Define the fitness function. 4. Decide on the prmeters for controlling the run. 5. Choose the method for designting result of the run. The Pythgoren Theorem helps us to illustrte these preprtory steps nd demonstrte the potentil of genetic progrmming. The theorem sys tht t the hypotenuse, c, of right tringle with short sides nd is given y c 2 The im of genetic progrmming is to discover progrm tht mtches this function. 2 To mesure the performnce of the s-yetundiscovered computer progrm, we will use numer of different fitness cses. The fitness cses for the Pythgoren Theorem re represented y the smples of right tringles in tle. These fitness cses re chosen t rndom over rnge of vlues of vriles nd. Side Side Hypotenuse c Side Side Hypotenuse c Step 1: Determine the set of terminls. The terminls correspond to the inputs of the computer progrm to e discovered. Our progrm tkes two inputs, nd. Step 2: Select the set of primitive functions. The functions cn e presented y stndrd rithmetic opertions, stndrd progrmming opertions, stndrd mthemticl functions, logicl lfunctions or domin-specific ifi functions. Our progrm will use four stndrd rithmetic opertions +,, nd, nd one mthemticl function.
6 Step 3: Define the fitness function. A fitness function evlutes how well prticulr computer progrm cn solve the prolem. For our prolem, the fitness of the computer progrm cn e mesured y the error etween the ctul result produced y the progrm nd the correct result given y the fitness cse. Typiclly, the error is not mesured over just one fitness cse, ut insted clculted s sum of the solute errors over numer of fitness cses. The closer this sum is to zero, the etter the computer progrm. Step 4: Decide on the prmeters for controlling the run. For controlling run, genetic progrmming uses the sme primry prmeters s those used for GAs. They include the popultion size nd the mximum numer of genertions to e run. Step 5: Choose the method for designting result of the run. It is common prctice in genetic progrmming to designte the est-so-fr generted progrm s the result of run. Once these five steps re complete, run cn e mde. The run of genetic progrmming strts with rndom genertion of n initil popultion of computer progrms. Ech progrm is composed of functions +,,, nd, nd terminls nd. Crossover in genetic progrmming: Two prentl S-expressions In the initil popultion, ll computer progrms usully hve poor fitness, ut some individuls re more fit thn others. Just s fitter chromosome is more likely to e selected for reproduction, so fitter computer progrm is more likely to survive y copying itself into the next genertion. ( ( ( ( ( ) ( ))) ) ( )) ( ( ( ( ( ) )) ) ( ( )))
7 Crossover in genetic progrmming: Two offspring S-expressions Muttion in genetic progrmming A muttion opertor cn rndomly chnge ny function or ny terminl in the LISP S-expression. Under muttion, ti function cn only e replced dy function nd terminl cn only e replced y terminl. ( ( ( ( ( ) ( ))) ) ( ( ( ) ))) ( (( ) ) ( ( ))) Muttion in genetic progrmming: Originl S-expressions Muttion in genetic progrmming: Mutted S-expressions ( ( ( ( ( ) ( ))) ) ( )) ( ( ( ( ( ) )) ) ( ( ))) ( ( ( ( ( ) ( ))) ) ( )) ( ( ( ( ( ) )) ) ( ( )))
8 In summry, genetic progrmming cretes computer progrms y executing the following steps: Step 1: Assign the mximum numer of genertions to e run nd proilities for cloning, crossover nd muttion. Note tht the sum of the proility of cloning, the proility of crossover nd the proility of muttion must e equl to one. Step 2: Generte n initil popultion p of computer progrms of size N y comining rndomly selected functions nd terminls. Step 3: Execute ech computer progrm in the popultion nd clculte its fitness with n pproprite fitness function. Designte the estso-fr individul s the result of the run. Step 4: With the ssigned proilities, select genetic opertor to perform cloning, crossover or muttion. Step 5: If the cloning opertor is chosen, select one computer progrm from the current popultion of progrms nd copy it into new popultion. If the crossover opertor is chosen, select pir of computer progrms from the current popultion, crete pir of offspring progrms nd plce them into the new popultion. If the muttion opertor is chosen, select one computer progrm from the current popultion, perform muttion nd plce the mutnt into the new popultion. Step 6: Repet Step 4 until the size of the new popultion of computer progrms ecomes equl to the size of the initil popultion, N. Step 7: Replce the current (prent) popultion with the new (offspring) popultion. Step 8: Go to Step 3 nd repet the process until the termintion criterion is stisfied.
9 Fitness history of the est S-expression F i t n e s s, % G e n e r t i o n s B e s t o f g e n e r t i o n Wht re the min dvntges of genetic progrmming compred to genetic lgorithms? Genetic progrmming pplies the sme evolutionry pproch. However, genetic progrmming is no longer reeding it strings tht represent coded solutions ut complete computer progrms tht solve prticulr prolem. The fundmentl difficulty of GAs lies in the prolem representtion, tht is, in the fixed-length coding. A poor representtion limits the power of GA, nd even worse, my led to flse solution. A fixed-length coding is rther rtificil. As it cnnot provide dynmic vriility in length, such coding often cuses considerle redundncy nd reduces the efficiency of genetic serch. In contrst, genetic progrmming uses high-level uilding locks of vrile length. Their size nd complexity cn chnge during reeding. Genetic progrmming works well llin lrge numer of different cses nd hs mny potentil pplictions.
Evolutionary Computation
Topic 9 Evolutionry Computtion Introduction, or cn evolution e intelligent? Simultion of nturl evolution Genetic lgorithms Evolution strtegies Genetic progrmming Summry Cn evolution e intelligent? Intelligence
More informationParse trees, ambiguity, and Chomsky normal form
Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs
More informationConvert the NFA into DFA
Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:
More informationI1 = 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 informationThe Minimum Label Spanning Tree Problem: Illustrating the Utility of Genetic Algorithms
The Minimum Lel Spnning Tree Prolem: Illustrting the Utility of Genetic Algorithms Yupei Xiong, Univ. of Mrylnd Bruce Golden, Univ. of Mrylnd Edwrd Wsil, Americn Univ. Presented t BAE Systems Distinguished
More informationCS103B 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 informationStudent Activity 3: Single Factor ANOVA
MATH 40 Student Activity 3: Single Fctor ANOVA Some Bsic Concepts In designed experiment, two or more tretments, or combintions of tretments, is pplied to experimentl units The number of tretments, whether
More informationContinuous Random Variables Class 5, Jeremy Orloff and Jonathan Bloom
Lerning Gols Continuous Rndom Vriles Clss 5, 8.05 Jeremy Orloff nd Jonthn Bloom. Know the definition of continuous rndom vrile. 2. Know the definition of the proility density function (pdf) nd cumultive
More informationNondeterminism and Nodeterministic Automata
Nondeterminism nd Nodeterministic Automt 61 Nondeterminism nd Nondeterministic Automt The computtionl mchine models tht we lerned in the clss re deterministic in the sense tht the next move is uniquely
More informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
More informationIntermediate 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 informationChapter 4: Techniques of Circuit Analysis. Chapter 4: Techniques of Circuit Analysis
Chpter 4: Techniques of Circuit Anlysis Terminology Node-Voltge Method Introduction Dependent Sources Specil Cses Mesh-Current Method Introduction Dependent Sources Specil Cses Comprison of Methods Source
More informationReview of Gaussian Quadrature method
Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge
More informationAdministrivia CSE 190: Reinforcement Learning: An Introduction
Administrivi CSE 190: Reinforcement Lerning: An Introduction Any emil sent to me bout the course should hve CSE 190 in the subject line! Chpter 4: Dynmic Progrmming Acknowledgment: A good number of these
More informationChapter 4 Contravariance, Covariance, and Spacetime Diagrams
Chpter 4 Contrvrince, Covrince, nd Spcetime Digrms 4. The Components of Vector in Skewed Coordintes We hve seen in Chpter 3; figure 3.9, tht in order to show inertil motion tht is consistent with the Lorentz
More informationLecture 3: Equivalence Relations
Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts
More informationSection 3.1: Exponent Properties
Section.1: Exponent Properties Ojective: Simplify expressions using the properties of exponents. Prolems with exponents cn often e simplied using few sic exponent properties. Exponents represent repeted
More informationAcceptance Sampling by Attributes
Introduction Acceptnce Smpling by Attributes Acceptnce smpling is concerned with inspection nd decision mking regrding products. Three spects of smpling re importnt: o Involves rndom smpling of n entire
More informationContinuous Random Variables
CPSC 53 Systems Modeling nd Simultion Continuous Rndom Vriles Dr. Anirn Mhnti Deprtment of Computer Science University of Clgry mhnti@cpsc.uclgry.c Definitions A rndom vrile is sid to e continuous if there
More informationDiscrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17
EECS 70 Discrete Mthemtics nd Proility Theory Spring 2013 Annt Shi Lecture 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion,
More informationBayesian 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 informationCS 301. Lecture 04 Regular Expressions. Stephen Checkoway. January 29, 2018
CS 301 Lecture 04 Regulr Expressions Stephen Checkowy Jnury 29, 2018 1 / 35 Review from lst time NFA N = (Q, Σ, δ, q 0, F ) where δ Q Σ P (Q) mps stte nd n lphet symol (or ) to set of sttes We run n NFA
More informationChapter 5 : Continuous Random Variables
STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 216 Néhémy Lim Chpter 5 : Continuous Rndom Vribles Nottions. N {, 1, 2,...}, set of nturl numbers (i.e. ll nonnegtive integers); N {1, 2,...}, set of ll
More informationLecture 2 : Propositions DRAFT
CS/Mth 240: Introduction to Discrete Mthemtics 1/20/2010 Lecture 2 : Propositions Instructor: Dieter vn Melkeeek Scrie: Dlior Zelený DRAFT Lst time we nlyzed vrious mze solving lgorithms in order to illustrte
More informationUniversity of Birmingham. 3 March 2010
1 University of Birminghm 3 Mrch 2010 2 Introduction to evolutionry computtion Evolutionry lgorithms solution representtion fitness function initil popultion genertion genetic nd selection opertors Types
More informationDiscrete Mathematics and Probability Theory Summer 2014 James Cook Note 17
CS 70 Discrete Mthemtics nd Proility Theory Summer 2014 Jmes Cook Note 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion, y tking
More informationUnit 1 Exponentials and Logarithms
HARTFIELD PRECALCULUS UNIT 1 NOTES PAGE 1 Unit 1 Eponentils nd Logrithms (2) Eponentil Functions (3) The number e (4) Logrithms (5) Specil Logrithms (7) Chnge of Bse Formul (8) Logrithmic Functions (10)
More information1B40 Practical Skills
B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need
More informationLinear Inequalities. Work Sheet 1
Work Sheet 1 Liner Inequlities Rent--Hep, cr rentl compny,chrges $ 15 per week plus $ 0.0 per mile to rent one of their crs. Suppose you re limited y how much money you cn spend for the week : You cn spend
More informationContinuous Random Variables
STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 217 Néhémy Lim Continuous Rndom Vribles Nottion. The indictor function of set S is rel-vlued function defined by : { 1 if x S 1 S (x) if x S Suppose tht
More informationAnalytically, vectors will be represented by lowercase bold-face Latin letters, e.g. a, r, q.
1.1 Vector Alger 1.1.1 Sclrs A physicl quntity which is completely descried y single rel numer is clled sclr. Physiclly, it is something which hs mgnitude, nd is completely descried y this mgnitude. Exmples
More information4.1. Probability Density Functions
STT 1 4.1-4. 4.1. Proility Density Functions Ojectives. Continuous rndom vrile - vers - discrete rndom vrile. Proility density function. Uniform distriution nd its properties. Expected vlue nd vrince of
More informationSCHOOL OF ENGINEERING & BUILT ENVIRONMENT
SCHOOL OF ENGINEERING & BUIL ENVIRONMEN MARICES FOR ENGINEERING Dr Clum Mcdonld Contents Introduction Definitions Wht is mtri? Rows nd columns of mtri Order of mtri Element of mtri Equlity of mtrices Opertions
More informationThe 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 informationGenetic Algorithms. t=0 initialise [P(t)] evaluate [P(t)] do while (not termination-condition) Lecture 9: Paradigms of Evolutionary Computing
Genetic Algorithms Genetic lgorithms (GA) re explortory serch nd optimistion methods tht re bsed on Drwinin-type survivl of the fittest strtegy with reproduction, where stronger individuls in the popultion
More informationLecture 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 informationDesigning 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 informationMath 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 information10 Vector Integral Calculus
Vector Integrl lculus Vector integrl clculus extends integrls s known from clculus to integrls over curves ("line integrls"), surfces ("surfce integrls") nd solids ("volume integrls"). These integrls hve
More informationCS415 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 informationChapter 3 Single Random Variables and Probability Distributions (Part 2)
Chpter 3 Single Rndom Vriles nd Proilit Distriutions (Prt ) Contents Wht is Rndom Vrile? Proilit Distriution Functions Cumultive Distriution Function Proilit Densit Function Common Rndom Vriles nd their
More informationCHAPTER 1 PROGRAM OF MATRICES
CHPTER PROGRM OF MTRICES -- INTRODUCTION definition of engineering is the science y which the properties of mtter nd sources of energy in nture re mde useful to mn. Thus n engineer will hve to study the
More informationNumerical Analysis: Trapezoidal and Simpson s Rule
nd Simpson s Mthemticl question we re interested in numericlly nswering How to we evlute I = f (x) dx? Clculus tells us tht if F(x) is the ntiderivtive of function f (x) on the intervl [, b], then I =
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationMinimal 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 informationKNOWLEDGE-BASED AGENTS INFERENCE
AGENTS THAT REASON LOGICALLY KNOWLEDGE-BASED AGENTS Two components: knowledge bse, nd n inference engine. Declrtive pproch to building n gent. We tell it wht it needs to know, nd It cn sk itself wht to
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=
More informationCS 330 Formal Methods and Models
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2017 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 2 1. Prove ((( p q) q) p) is tutology () (3pts) y truth tle. p q p q
More informationReinforcement 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 informationVyacheslav Telnin. Search for New Numbers.
Vycheslv Telnin Serch for New Numbers. 1 CHAPTER I 2 I.1 Introduction. In 1984, in the first issue for tht yer of the Science nd Life mgzine, I red the rticle "Non-Stndrd Anlysis" by V. Uspensky, in which
More informationCombinational Logic. Precedence. Quick Quiz 25/9/12. Schematics à Boolean Expression. 3 Representations of Logic Functions. Dr. Hayden So.
5/9/ Comintionl Logic ENGG05 st Semester, 0 Dr. Hyden So Representtions of Logic Functions Recll tht ny complex logic function cn e expressed in wys: Truth Tle, Boolen Expression, Schemtics Only Truth
More informationChapter 6 Continuous Random Variables and Distributions
Chpter 6 Continuous Rndom Vriles nd Distriutions Mny economic nd usiness mesures such s sles investment consumption nd cost cn hve the continuous numericl vlues so tht they cn not e represented y discrete
More informationBoolean algebra.
http://en.wikipedi.org/wiki/elementry_boolen_lger Boolen lger www.tudorgir.com Computer science is not out computers, it is out computtion nd informtion. computtion informtion computer informtion Turing
More informationInterpreting Integrals and the Fundamental Theorem
Interpreting Integrls nd the Fundmentl Theorem Tody, we go further in interpreting the mening of the definite integrl. Using Units to Aid Interprettion We lredy know tht if f(t) is the rte of chnge of
More informationImproper 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 informationContinuous Random Variable X:
Continuous Rndom Vrile : The continuous rndom vrile hs its vlues in n intervl, nd it hs proility distriution unction or proility density unction p.d. stisies:, 0 & d Which does men tht the totl re under
More informationThe steps of the hypothesis test
ttisticl Methods I (EXT 7005) Pge 78 Mosquito species Time of dy A B C Mid morning 0.0088 5.4900 5.5000 Mid Afternoon.3400 0.0300 0.8700 Dusk 0.600 5.400 3.000 The Chi squre test sttistic is the sum of
More informationGoals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite
Unit #8 : The Integrl Gols: Determine how to clculte the re described by function. Define the definite integrl. Eplore the reltionship between the definite integrl nd re. Eplore wys to estimte the definite
More informationFor the percentage of full time students at RCC the symbols would be:
Mth 17/171 Chpter 7- ypothesis Testing with One Smple This chpter is s simple s the previous one, except it is more interesting In this chpter we will test clims concerning the sme prmeters tht we worked
More informationP 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0)
1 Tylor polynomils In Section 3.5, we discussed how to pproximte function f(x) round point in terms of its first derivtive f (x) evluted t, tht is using the liner pproximtion f() + f ()(x ). We clled this
More informationSection 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 informationFinite Automata. Informatics 2A: Lecture 3. John Longley. 22 September School of Informatics University of Edinburgh
Lnguges nd Automt Finite Automt Informtics 2A: Lecture 3 John Longley School of Informtics University of Edinburgh jrl@inf.ed.c.uk 22 September 2017 1 / 30 Lnguges nd Automt 1 Lnguges nd Automt Wht is
More informationStrong Bisimulation. Overview. References. Actions Labeled transition system Transition semantics Simulation Bisimulation
Strong Bisimultion Overview Actions Lbeled trnsition system Trnsition semntics Simultion Bisimultion References Robin Milner, Communiction nd Concurrency Robin Milner, Communicting nd Mobil Systems 32
More informationSection 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 informationexpression simply by forming an OR of the ANDs of all input variables for which the output is
2.4 Logic Minimiztion nd Krnugh Mps As we found ove, given truth tle, it is lwys possile to write down correct logic expression simply y forming n OR of the ANDs of ll input vriles for which the output
More informationPolynomials and Division Theory
Higher Checklist (Unit ) Higher Checklist (Unit ) Polynomils nd Division Theory Skill Achieved? Know tht polynomil (expression) is of the form: n x + n x n + n x n + + n x + x + 0 where the i R re the
More informationTorsion in Groups of Integral Triangles
Advnces in Pure Mthemtics, 01,, 116-10 http://dxdoiorg/1046/pm011015 Pulished Online Jnury 01 (http://wwwscirporg/journl/pm) Torsion in Groups of Integrl Tringles Will Murry Deprtment of Mthemtics nd Sttistics,
More informationLearning Goals. Relational Query Languages. Formal Relational Query Languages. Formal Query Languages: Relational Algebra and Relational Calculus
Forml Query Lnguges: Reltionl Alger nd Reltionl Clculus Chpter 4 Lerning Gols Given dtse ( set of tles ) you will e le to express dtse query in Reltionl Alger (RA), involving the sic opertors (selection,
More informationHomework Solution - Set 5 Due: Friday 10/03/08
CE 96 Introduction to the Theory of Computtion ll 2008 Homework olution - et 5 Due: ridy 10/0/08 1. Textook, Pge 86, Exercise 1.21. () 1 2 Add new strt stte nd finl stte. Mke originl finl stte non-finl.
More informationLinear Systems with Constant Coefficients
Liner Systems with Constnt Coefficients 4-3-05 Here is system of n differentil equtions in n unknowns: x x + + n x n, x x + + n x n, x n n x + + nn x n This is constnt coefficient liner homogeneous system
More informationThe 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 information1 ELEMENTARY ALGEBRA and GEOMETRY READINESS DIAGNOSTIC TEST PRACTICE
ELEMENTARY ALGEBRA nd GEOMETRY READINESS DIAGNOSTIC TEST PRACTICE Directions: Study the exmples, work the prolems, then check your nswers t the end of ech topic. If you don t get the nswer given, check
More information1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.
York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech
More informationMATH 573 FINAL EXAM. May 30, 2007
MATH 573 FINAL EXAM My 30, 007 NAME: Solutions 1. This exm is due Wednesdy, June 6 efore the 1:30 pm. After 1:30 pm I will NOT ccept the exm.. This exm hs 1 pges including this cover. There re 10 prolems.
More information1 Nondeterministic Finite Automata
1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you
More information19 Optimal behavior: Game theory
Intro. to Artificil Intelligence: Dle Schuurmns, Relu Ptrscu 1 19 Optiml behvior: Gme theory Adversril stte dynmics hve to ccount for worst cse Compute policy π : S A tht mximizes minimum rewrd Let S (,
More informationMath 1B, lecture 4: Error bounds for numerical methods
Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the
More informationWe 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 informationScanner. Specifying patterns. Specifying patterns. Operations on languages. A scanner must recognize the units of syntax Some parts are easy:
Scnner Specifying ptterns source code tokens scnner prser IR A scnner must recognize the units of syntx Some prts re esy: errors mps chrcters into tokens the sic unit of syntx x = x + y; ecomes
More informationLecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.
Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one
More informationPrerequisites CHAPTER P
CHAPTER P Prerequisites P. Rel Numers P.2 Crtesin Coordinte System P.3 Liner Equtions nd Inequlities P.4 Lines in the Plne P.5 Solving Equtions Grphiclly, Numericlly, nd Algericlly P.6 Comple Numers P.7
More informationLecture 3: Curves in Calculus. Table of contents
Mth 348 Fll 7 Lecture 3: Curves in Clculus Disclimer. As we hve textook, this lecture note is for guidnce nd supplement only. It should not e relied on when prepring for exms. In this lecture we set up
More informationClosure Properties of Regular Languages
Closure Properties of Regulr Lnguges Regulr lnguges re closed under mny set opertions. Let L 1 nd L 2 e regulr lnguges. (1) L 1 L 2 (the union) is regulr. (2) L 1 L 2 (the conctention) is regulr. (3) L
More informationCS 330 Formal Methods and Models Dana Richards, George Mason University, Spring 2016 Quiz Solutions
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2016 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 9 1. (4pts) ((p q) (q r)) (p r), prove tutology using truth tles. p
More informationECO 317 Economics of Uncertainty Fall Term 2007 Notes for lectures 4. Stochastic Dominance
Generl structure ECO 37 Economics of Uncertinty Fll Term 007 Notes for lectures 4. Stochstic Dominnce Here we suppose tht the consequences re welth mounts denoted by W, which cn tke on ny vlue between
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct
More informationBases for Vector Spaces
Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything
More informationMath Lecture 23
Mth 8 - Lecture 3 Dyln Zwick Fll 3 In our lst lecture we delt with solutions to the system: x = Ax where A is n n n mtrix with n distinct eigenvlues. As promised, tody we will del with the question of
More information4 7x =250; 5 3x =500; Read section 3.3, 3.4 Announcements: Bell Ringer: Use your calculator to solve
Dte: 3/14/13 Objective: SWBAT pply properties of exponentil functions nd will pply properties of rithms. Bell Ringer: Use your clcultor to solve 4 7x =250; 5 3x =500; HW Requests: Properties of Log Equtions
More informationIntroduction to Electrical & Electronic Engineering ENGG1203
Introduction to Electricl & Electronic Engineering ENGG23 2 nd Semester, 27-8 Dr. Hden Kwok-H So Deprtment of Electricl nd Electronic Engineering Astrction DIGITAL LOGIC 2 Digitl Astrction n Astrct ll
More information5.1 How do we Measure Distance Traveled given Velocity? Student Notes
. How do we Mesure Distnce Trveled given Velocity? Student Notes EX ) The tle contins velocities of moving cr in ft/sec for time t in seconds: time (sec) 3 velocity (ft/sec) 3 A) Lel the x-xis & y-xis
More informationMonte Carlo method in solving numerical integration and differential equation
Monte Crlo method in solving numericl integrtion nd differentil eqution Ye Jin Chemistry Deprtment Duke University yj66@duke.edu Abstrct: Monte Crlo method is commonly used in rel physics problem. The
More informationCS 188: Artificial Intelligence Spring 2007
CS 188: Artificil Intelligence Spring 2007 Lecture 3: Queue-Bsed Serch 1/23/2007 Srini Nrynn UC Berkeley Mny slides over the course dpted from Dn Klein, Sturt Russell or Andrew Moore Announcements Assignment
More informationOverview HC9. Parsing: Top-Down & LL(1) Context-Free Grammars (1) Introduction. CFGs (3) Context-Free Grammars (2) Vertalerbouw HC 9: Ch.
Overview H9 Vertlerouw H 9: Prsing: op-down & LL(1) do 3 mei 2001 56 heo Ruys h. 8 - Prsing 8.1 ontext-free Grmmrs 8.2 op-down Prsing 8.3 LL(1) Grmmrs See lso [ho, Sethi & Ullmn 1986] for more thorough
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
More informationNFAs and Regular Expressions. NFA-ε, continued. Recall. Last class: Today: Fun:
CMPU 240 Lnguge Theory nd Computtion Spring 2019 NFAs nd Regulr Expressions Lst clss: Introduced nondeterministic finite utomt with -trnsitions Tody: Prove n NFA- is no more powerful thn n NFA Introduce
More informationMore on automata. Michael George. March 24 April 7, 2014
More on utomt Michel George Mrch 24 April 7, 2014 1 Automt constructions Now tht we hve forml model of mchine, it is useful to mke some generl constructions. 1.1 DFA Union / Product construction Suppose
More informationDesigning Information Devices and Systems I Spring 2018 Homework 7
EECS 16A Designing Informtion Devices nd Systems I Spring 2018 omework 7 This homework is due Mrch 12, 2018, t 23:59. Self-grdes re due Mrch 15, 2018, t 23:59. Sumission Formt Your homework sumission should
More informationFormal languages, automata, and theory of computation
Mälrdlen University TEN1 DVA337 2015 School of Innovtion, Design nd Engineering Forml lnguges, utomt, nd theory of computtion Thursdy, Novemer 5, 14:10-18:30 Techer: Dniel Hedin, phone 021-107052 The exm
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties
More information