Graduate AI Lecture 16: Planning 2. Teachers: Martial Hebert Ariel Procaccia (this time)
|
|
- Camron Austin
- 6 years ago
- Views:
Transcription
1 Graduate AI Lecture 16: Planning 2 Teachers: Martial Hebert Ariel Prcaccia (this time)
2 Reminder State is a cnjunctin f cnditins, e.g., at(truck 1,Shadyside) at(truck 2,Oakland) States are transfrmed via peratrs that have the frm Precnditins Effects (pstcnditins) 2
3 Reminder Pre is a cnjunctin f psitive and negative cnditins that must be satisfied t apply the peratin Effect is a cnjunctin f psitive and negative cnditins that becme true when the peratin is applied We are given the initial state We are als given the gals, a cnjunctin f psitive and negative cnditins 3
4 Planning as search Search frm initial state t gal Can use standard search techniques, including heuristic search At(P 1,A) At(P 2,A) Fly(P 1,A,B) Fly(P 2,A,B) At(P 1,B) At(P 2,A) At(P 1,A) At(P 2,B) 4
5 Ptential bstacles Example: inefficient search Operatin Buy(isbn) with n precnditins and effect Own(isbn) fr each f the 10 billin ISBN numbers Uninfrmed search must enumerate all ptins Example: large state space 10 airprts, each has 5 planes and 20 pieces f carg Gal: mve the carg at airprt A t B Search graph up t the depth f the bvius slutin can have > ndes Frm 1961 t 1998 frward search was cnsidered t inefficient t be practical 5
6 Backward search Searching backward frm gal t initial state Can help in the examples Hard t cme up with heuristics mdern systems use frward search with killer heuristics 6
7 Heuristics fr planning Define a relaxed prblem that is easier t slve and gives an admissible heuristic Tw general appraches: add edges t the search graph r grup multiples ndes tgether 7
8 Ignre precnditins Heuristic drps all precnditins frm peratins Any gal cnditin can be achieves in ne step Cmplicatins: 1. Sme peratins achieve multiple gals 2. Sme peratins und the effects f thers Ignre 2 but nt 1: remve precnditins and all effects except gal cnditins Cunt min number f peratins s.t. the unin f their effects cntains gals 8
9 Set cver This is exactly the set cver prblem Prblem is NP-hard Hard t apprximate t a factr better than lgn Apprximatin is inadmissible g 5 g 1 g 3 g 2 g 4 g 6 9
10 Ignre precnditins Pssible t ignre specific precnditins Sliding blck puzzle; On(t,s 1 ) Blank(s 2 ) Adjacent(s 1,s 2 ) On(t,s 2 ) Blank(s 1 ) On(t,s 1 ) Blank(s 2 ) Remving Blank(s 2 ) Adjacent(s 1,s 2 ) gives... #misplaced tiles heuristic Remving Blank(s 2 ) gives... Manhattan distance heuristic Can derive dmain-specific heuristics Example state Gal state 10
11 Ignre delete lists Assume that gals and precnditins cntain nly psitive literals Can rewrite if nt Remve delete lists frm all peratins Make mntnic prgress twards gals Still NP-hard t find a slutin (prved in lecture 15, slide 19) Why desn t this fllw frm NP-hardness f set cver? Hill-climbing wrks well 11
12 Hill climbing Hffman, JAIR
13 State abstractin Relaxed prblem is still an expensive way t cmpute a heuristic if there are many states Cnsider air carg prblem with 10 airprts, 50 planes, 200 pieces f carg #states = (50+10) 200 > Assume all packages are in 5 airprts, packages in airprt have the same destinatin 5 planes and 5 packages #states = 10 5 (5+10) 5 <
14 Planning graphs Leveled graph: vertices rganized int levels, with edges nly between levels Tw types f vertices n alternating levels: Cnditins Operatins Tw types f edges: Precnditin: cnditin t peratin Effect: peratin t cnditin 14
15 Generic planning graph Cnditin Precnditin Operatin Effect Slide based n Brafman which in turn is based n Ambite, Blyth, and Weld 15
16 Graph cnstructin S 0 cntains cnditins that hld in initial state Add peratin t level O i if its precnditins appear in level S i Add cnditin t level S i if it is the effect f an peratin in level O i-1 (n-p actin als pssible) Idea: S i cntains all cnditins that culd hld at time i; O i cntains all peratins that culd have their precnditins satisfied at time i Can ptimistically estimate hw many steps it takes t reach a gal 16
17 Mutual exclusin Tw peratins r cnditins are mutually exclusive (mutex) if n valid plan can cntain bth A bit mre frmally: Tw peratins are mutex if their precnditins r effects are mutex Tw cnditins are mutex if ne is the negatin f the ther, r all actins that achieve them are mutex Even mre frmally... 17
18 Mutex cases Incnsistent effects (tw ps): ne peratin negates the effect f the ther Interference (tw ps): an effect f ne peratin negates precnditin f ther Incnsistent Effects Interference Slide based n Brafman which in turn is based n Ambite, Blyth, and Weld 18
19 Mutex cases Cmpeting needs (tw ps): a precnditin f ne peratin is mutex with a precnditin f the ther Incnsistent supprt (tw cnditins): every pssible pair f peratins that achieve bth cnditins is mutex Cmpeting Needs Incnsistent Supprt Slide based n Brafman which in turn is based n Ambite, Blyth, and Weld 19
20 Dinner date example Initial state: garbage cleanhands quiet Gals: dinner present garbage Actins: Ck: cleanhands dinner Wrap: quiet present Carry: nne garbage cleanhands Dlly: nne garbage quiet What s the plan? Slide based n Brafman which in turn is based n Ambite, Blyth, and Weld 20
21 Dinner date example garb cleanhands Carry Dlly garb garb cleanhands Interference quiet Ck Wrap cleanhands quiet quiet dinner present Incnsistent supprt Slide based n Brafman which in turn is based n Ambite, Blyth, and Weld 21
22 Dinner date example garb Carry Dlly garb garb Carry Dlly garb garb cleanhands cleanhands cleanhands Ck cleanhands cleanhands Ck quiet quiet quiet Wrap Wrap quiet quiet dinner dinner present present Slide based n Brafman which in turn is based n Ambite, Blyth, and Weld 22
23 Observatin 1 p O 1 p p O 1 p p O 2 q q q q r r r Cnditins mntnically increase (always carried frward by n-ps) Slide based n Brafman which in turn is based n Ambite, Blyth, and Weld 23
24 Observatin 2 p O 1 p p O 1 p p O 2 q q q q r r r Operatins mntnically increase Slide based n Brafman which in turn is based n Ambite, Blyth, and Weld 24
25 Observatin 3 p p O 1 q q r r Prpsitin mutex relatinships mntnically decrease Slide based n Brafman which in turn is based n Ambite, Blyth, and Weld 25
26 Observatin 4 Operatin mutexes mntnically decrease Incnsistent effects and interference are prperties f the peratins themselves hld at every level Cmpeting needs: prpsitin mutexes are mntnically decreasing T be frmal, need t d a duble inductin n prpsitin and peratin mutexes 26
27 Leveling ff As a crllary f the bservatins, we see that the planning graph levels ff Prf: Cnsecutive levels becme identical Upper bund n #peratins and #cnditins Lwer bund f 0 n #mutexes 27
28 Heuristics frm graphs Level cst f gal g = level where g first appears T estimate the cst f all gals: Max level: max level cst f any gal (admissible?) Level sum: sum f level csts (admissible?) Set level: level at which all gals appear withut any pair being mutex (admissible?) 28
29 The Graphplan algrithm 1. Grw the planning graph until all gals are reachable and nt mutex (If planning graph levels ff first, fail) 2. Call EXTRACT-SOLUTION n current planning graph 3. If nne fund, add a level t the planning graph and try again Slide based n Brafman which in turn is based n Ambite, Blyth, and Weld 29
30 Extract-Slutin Search where each state crrespnds t a level and a set f unsatisfied gals Initial state is the last level f the planning graph, alng with the gals f the planning prblem Actins available at level S i are t select any cnflict-free subset f peratins in A i-1 whse effects cver the gals in the state Resulting state has level S i-1 and its gals are the precnditins fr selected actins Gal is t reach a state at level S 0 30
31 Extract-Slutin illustrated Slide based n Brafman which in turn is based n Ambite, Blyth, and Weld 31
32 Graphplan guarantees The size f the t-level planning graph and the time t create it are plynmial in t, #peratins, #cnditins Graphplan returns a plan if ne exists, and returns failure if ne des nt exists 32
Dataflow Analysis and Abstract Interpretation
Dataflw Analysis and Abstract Interpretatin Cmputer Science and Artificial Intelligence Labratry MIT Nvember 9, 2015 Recap Last time we develped frm first principles an algrithm t derive invariants. Key
More informationRevisiting the Socrates Example
Sectin 1.6 Sectin Summary Valid Arguments Inference Rules fr Prpsitinal Lgic Using Rules f Inference t Build Arguments Rules f Inference fr Quantified Statements Building Arguments fr Quantified Statements
More informationMultiple Source Multiple. using Network Coding
Multiple Surce Multiple Destinatin Tplgy Inference using Netwrk Cding Pegah Sattari EECS, UC Irvine Jint wrk with Athina Markpulu, at UCI, Christina Fraguli, at EPFL, Lausanne Outline Netwrk Tmgraphy Gal,
More informationChapter Summary. Mathematical Induction Strong Induction Recursive Definitions Structural Induction Recursive Algorithms
Chapter 5 1 Chapter Summary Mathematical Inductin Strng Inductin Recursive Definitins Structural Inductin Recursive Algrithms Sectin 5.1 3 Sectin Summary Mathematical Inductin Examples f Prf by Mathematical
More informationA proposition is a statement that can be either true (T) or false (F), (but not both).
400 lecture nte #1 [Ch 2, 3] Lgic and Prfs 1.1 Prpsitins (Prpsitinal Lgic) A prpsitin is a statement that can be either true (T) r false (F), (but nt bth). "The earth is flat." -- F "March has 31 days."
More informationYou need to be able to define the following terms and answer basic questions about them:
CS440/ECE448 Sectin Q Fall 2017 Midterm Review Yu need t be able t define the fllwing terms and answer basic questins abut them: Intr t AI, agents and envirnments Pssible definitins f AI, prs and cns f
More informationAdministrativia. Assignment 1 due thursday 9/23/2004 BEFORE midnight. Midterm exam 10/07/2003 in class. CS 460, Sessions 8-9 1
Administrativia Assignment 1 due thursday 9/23/2004 BEFORE midnight Midterm eam 10/07/2003 in class CS 460, Sessins 8-9 1 Last time: search strategies Uninfrmed: Use nly infrmatin available in the prblem
More informationHomology groups of disks with holes
Hmlgy grups f disks with hles THEOREM. Let p 1,, p k } be a sequence f distinct pints in the interir unit disk D n where n 2, and suppse that fr all j the sets E j Int D n are clsed, pairwise disjint subdisks.
More informationCMU-Q Lecture 5: Classical Planning Factored Representations STRIPS. Teacher: Gianni A. Di Caro
CMU-Q 15-381 Lecture 5: Classical Planning Factored Representations STRIPS Teacher: Gianni A. Di Caro AUTOMATED PLANNING: FACTORED STATE REPRESENTATIONS 2 PLANNING, FOR (MORE) COMPLEX WORLDS Searching
More informationDetermining Optimum Path in Synthesis of Organic Compounds using Branch and Bound Algorithm
Determining Optimum Path in Synthesis f Organic Cmpunds using Branch and Bund Algrithm Diastuti Utami 13514071 Prgram Studi Teknik Infrmatika Seklah Teknik Elektr dan Infrmatika Institut Teknlgi Bandung,
More informationDepartment of Electrical Engineering, University of Waterloo. Introduction
Sectin 4: Sequential Circuits Majr Tpics Types f sequential circuits Flip-flps Analysis f clcked sequential circuits Mre and Mealy machines Design f clcked sequential circuits State transitin design methd
More informationREADING STATECHART DIAGRAMS
READING STATECHART DIAGRAMS Figure 4.48 A Statechart diagram with events The diagram in Figure 4.48 shws all states that the bject plane can be in during the curse f its life. Furthermre, it shws the pssible
More informationPipetting 101 Developed by BSU CityLab
Discver the Micrbes Within: The Wlbachia Prject Pipetting 101 Develped by BSU CityLab Clr Cmparisns Pipetting Exercise #1 STUDENT OBJECTIVES Students will be able t: Chse the crrect size micrpipette fr
More informationSupport-Vector Machines
Supprt-Vectr Machines Intrductin Supprt vectr machine is a linear machine with sme very nice prperties. Haykin chapter 6. See Alpaydin chapter 13 fr similar cntent. Nte: Part f this lecture drew material
More informationCHAPTER 4 DIAGNOSTICS FOR INFLUENTIAL OBSERVATIONS
CHAPTER 4 DIAGNOSTICS FOR INFLUENTIAL OBSERVATIONS 1 Influential bservatins are bservatins whse presence in the data can have a distrting effect n the parameter estimates and pssibly the entire analysis,
More informationLesson Plan. Recode: They will do a graphic organizer to sequence the steps of scientific method.
Lessn Plan Reach: Ask the students if they ever ppped a bag f micrwave ppcrn and nticed hw many kernels were unppped at the bttm f the bag which made yu wnder if ther brands pp better than the ne yu are
More information1996 Engineering Systems Design and Analysis Conference, Montpellier, France, July 1-4, 1996, Vol. 7, pp
THE POWER AND LIMIT OF NEURAL NETWORKS T. Y. Lin Department f Mathematics and Cmputer Science San Jse State University San Jse, Califrnia 959-003 tylin@cs.ssu.edu and Bereley Initiative in Sft Cmputing*
More informationTuring Machines. Human-aware Robotics. 2017/10/17 & 19 Chapter 3.2 & 3.3 in Sipser Ø Announcement:
Turing Machines Human-aware Rbtics 2017/10/17 & 19 Chapter 3.2 & 3.3 in Sipser Ø Annuncement: q q q q Slides fr this lecture are here: http://www.public.asu.edu/~yzhan442/teaching/cse355/lectures/tm-ii.pdf
More informationPattern Recognition 2014 Support Vector Machines
Pattern Recgnitin 2014 Supprt Vectr Machines Ad Feelders Universiteit Utrecht Ad Feelders ( Universiteit Utrecht ) Pattern Recgnitin 1 / 55 Overview 1 Separable Case 2 Kernel Functins 3 Allwing Errrs (Sft
More informationFive Whys How To Do It Better
Five Whys Definitin. As explained in the previus article, we define rt cause as simply the uncvering f hw the current prblem came int being. Fr a simple causal chain, it is the entire chain. Fr a cmplex
More informationCS 477/677 Analysis of Algorithms Fall 2007 Dr. George Bebis Course Project Due Date: 11/29/2007
CS 477/677 Analysis f Algrithms Fall 2007 Dr. Gerge Bebis Curse Prject Due Date: 11/29/2007 Part1: Cmparisn f Srting Algrithms (70% f the prject grade) The bjective f the first part f the assignment is
More informationLecture 02 CSE 40547/60547 Computing at the Nanoscale
PN Junctin Ntes: Lecture 02 CSE 40547/60547 Cmputing at the Nanscale Letʼs start with a (very) shrt review f semi-cnducting materials: - N-type material: Obtained by adding impurity with 5 valence elements
More informationWe can see from the graph above that the intersection is, i.e., [ ).
MTH 111 Cllege Algebra Lecture Ntes July 2, 2014 Functin Arithmetic: With nt t much difficulty, we ntice that inputs f functins are numbers, and utputs f functins are numbers. S whatever we can d with
More informationCAUSAL INFERENCE. Technical Track Session I. Phillippe Leite. The World Bank
CAUSAL INFERENCE Technical Track Sessin I Phillippe Leite The Wrld Bank These slides were develped by Christel Vermeersch and mdified by Phillippe Leite fr the purpse f this wrkshp Plicy questins are causal
More informationNOTE ON APPELL POLYNOMIALS
NOTE ON APPELL POLYNOMIALS I. M. SHEFFER An interesting characterizatin f Appell plynmials by means f a Stieltjes integral has recently been given by Thrne. 1 We prpse t give a secnd such representatin,
More informationA crash course in Galois theory
A crash curse in Galis thery First versin 0.1 14. september 2013 klkken 14:50 In these ntes K dentes a field. Embeddings Assume that is a field and that : K! and embedding. If K L is an extensin, we say
More informationPublic Key Cryptography. Tim van der Horst & Kent Seamons
Public Key Cryptgraphy Tim van der Hrst & Kent Seamns Last Updated: Oct 5, 2017 Asymmetric Encryptin Why Public Key Crypt is Cl Has a linear slutin t the key distributin prblem Symmetric crypt has an expnential
More informationName: Period: Date: ATOMIC STRUCTURE NOTES ADVANCED CHEMISTRY
Name: Perid: Date: ATOMIC STRUCTURE NOTES ADVANCED CHEMISTRY Directins: This packet will serve as yur ntes fr this chapter. Fllw alng with the PwerPint presentatin and fill in the missing infrmatin. Imprtant
More informationAdmissibility Conditions and Asymptotic Behavior of Strongly Regular Graphs
Admissibility Cnditins and Asympttic Behavir f Strngly Regular Graphs VASCO MOÇO MANO Department f Mathematics University f Prt Oprt PORTUGAL vascmcman@gmailcm LUÍS ANTÓNIO DE ALMEIDA VIEIRA Department
More informationSPH3U1 Lesson 06 Kinematics
PROJECTILE MOTION LEARNING GOALS Students will: Describe the mtin f an bject thrwn at arbitrary angles thrugh the air. Describe the hrizntal and vertical mtins f a prjectile. Slve prjectile mtin prblems.
More informationFall 2013 Physics 172 Recitation 3 Momentum and Springs
Fall 03 Physics 7 Recitatin 3 Mmentum and Springs Purpse: The purpse f this recitatin is t give yu experience wrking with mmentum and the mmentum update frmula. Readings: Chapter.3-.5 Learning Objectives:.3.
More informationCOMP 551 Applied Machine Learning Lecture 11: Support Vector Machines
COMP 551 Applied Machine Learning Lecture 11: Supprt Vectr Machines Instructr: (jpineau@cs.mcgill.ca) Class web page: www.cs.mcgill.ca/~jpineau/cmp551 Unless therwise nted, all material psted fr this curse
More informationx x
Mdeling the Dynamics f Life: Calculus and Prbability fr Life Scientists Frederick R. Adler cfrederick R. Adler, Department f Mathematics and Department f Bilgy, University f Utah, Salt Lake City, Utah
More informationCONSTRUCTING STATECHART DIAGRAMS
CONSTRUCTING STATECHART DIAGRAMS The fllwing checklist shws the necessary steps fr cnstructing the statechart diagrams f a class. Subsequently, we will explain the individual steps further. Checklist 4.6
More informationDifferentiation Applications 1: Related Rates
Differentiatin Applicatins 1: Related Rates 151 Differentiatin Applicatins 1: Related Rates Mdel 1: Sliding Ladder 10 ladder y 10 ladder 10 ladder A 10 ft ladder is leaning against a wall when the bttm
More informationDead-beat controller design
J. Hetthéssy, A. Barta, R. Bars: Dead beat cntrller design Nvember, 4 Dead-beat cntrller design In sampled data cntrl systems the cntrller is realised by an intelligent device, typically by a PLC (Prgrammable
More informationAIP Logic Chapter 4 Notes
AIP Lgic Chapter 4 Ntes Sectin 4.1 Sectin 4.2 Sectin 4.3 Sectin 4.4 Sectin 4.5 Sectin 4.6 Sectin 4.7 4.1 The Cmpnents f Categrical Prpsitins There are fur types f categrical prpsitins. Prpsitin Letter
More informationIAML: Support Vector Machines
1 / 22 IAML: Supprt Vectr Machines Charles Suttn and Victr Lavrenk Schl f Infrmatics Semester 1 2 / 22 Outline Separating hyperplane with maimum margin Nn-separable training data Epanding the input int
More informationLecture 7: Damped and Driven Oscillations
Lecture 7: Damped and Driven Oscillatins Last time, we fund fr underdamped scillatrs: βt x t = e A1 + A csω1t + i A1 A sinω1t A 1 and A are cmplex numbers, but ur answer must be real Implies that A 1 and
More informationCMU Noncooperative games 3: Price of anarchy. Teacher: Ariel Procaccia
CMU 15-896 Nncperative games 3: Price f anarchy Teacher: Ariel Prcaccia Back t prisn The nly Nash equilibrium in Prisner s dilemma is bad; but hw bad is it? Objective functin: scial cst = sum f csts NE
More informationAdmin. MDP Search Trees. Optimal Quantities. Reinforcement Learning
Admin Reinfrcement Learning Cntent adapted frm Berkeley CS188 MDP Search Trees Each MDP state prjects an expectimax-like search tree Optimal Quantities The value (utility) f a state s: V*(s) = expected
More informationCOMP 551 Applied Machine Learning Lecture 9: Support Vector Machines (cont d)
COMP 551 Applied Machine Learning Lecture 9: Supprt Vectr Machines (cnt d) Instructr: Herke van Hf (herke.vanhf@mail.mcgill.ca) Slides mstly by: Class web page: www.cs.mcgill.ca/~hvanh2/cmp551 Unless therwise
More informationChapter 3: Cluster Analysis
Chapter 3: Cluster Analysis } 3.1 Basic Cncepts f Clustering 3.1.1 Cluster Analysis 3.1. Clustering Categries } 3. Partitining Methds 3..1 The principle 3.. K-Means Methd 3..3 K-Medids Methd 3..4 CLARA
More informationMedium Scale Integrated (MSI) devices [Sections 2.9 and 2.10]
EECS 270, Winter 2017, Lecture 3 Page 1 f 6 Medium Scale Integrated (MSI) devices [Sectins 2.9 and 2.10] As we ve seen, it s smetimes nt reasnable t d all the design wrk at the gate-level smetimes we just
More informationThis section is primarily focused on tools to aid us in finding roots/zeros/ -intercepts of polynomials. Essentially, our focus turns to solving.
Sectin 3.2: Many f yu WILL need t watch the crrespnding vides fr this sectin n MyOpenMath! This sectin is primarily fcused n tls t aid us in finding rts/zers/ -intercepts f plynmials. Essentially, ur fcus
More informationThermodynamics and Equilibrium
Thermdynamics and Equilibrium Thermdynamics Thermdynamics is the study f the relatinship between heat and ther frms f energy in a chemical r physical prcess. We intrduced the thermdynamic prperty f enthalpy,
More informationWhen a substance heats up (absorbs heat) it is an endothermic reaction with a (+)q
Chemistry Ntes Lecture 15 [st] 3/6/09 IMPORTANT NOTES: -( We finished using the lecture slides frm lecture 14) -In class the challenge prblem was passed ut, it is due Tuesday at :00 P.M. SHARP, :01 is
More informationMath 105: Review for Exam I - Solutions
1. Let f(x) = 3 + x + 5. Math 105: Review fr Exam I - Slutins (a) What is the natural dmain f f? [ 5, ), which means all reals greater than r equal t 5 (b) What is the range f f? [3, ), which means all
More informationComprehensive Exam Guidelines Department of Chemical and Biomolecular Engineering, Ohio University
Cmprehensive Exam Guidelines Department f Chemical and Bimlecular Engineering, Ohi University Purpse In the Cmprehensive Exam, the student prepares an ral and a written research prpsal. The Cmprehensive
More informationENG2410 Digital Design Sequential Circuits: Part A
ENG2410 Digital Design Sequential Circuits: Part A Fall 2017 S. Areibi Schl f Engineering University f Guelph Week #6 Tpics Sequential Circuit Definitins Latches Flip-Flps Delays in Sequential Circuits
More informationCHAPTER 3 INEQUALITIES. Copyright -The Institute of Chartered Accountants of India
CHAPTER 3 INEQUALITIES Cpyright -The Institute f Chartered Accuntants f India INEQUALITIES LEARNING OBJECTIVES One f the widely used decisin making prblems, nwadays, is t decide n the ptimal mix f scarce
More information(2) Even if such a value of k was possible, the neutrons multiply
CHANGE OF REACTOR Nuclear Thery - Curse 227 POWER WTH REACTVTY CHANGE n this lessn, we will cnsider hw neutrn density, neutrn flux and reactr pwer change when the multiplicatin factr, k, r the reactivity,
More informationPhysics 2010 Motion with Constant Acceleration Experiment 1
. Physics 00 Mtin with Cnstant Acceleratin Experiment In this lab, we will study the mtin f a glider as it accelerates dwnhill n a tilted air track. The glider is supprted ver the air track by a cushin
More informationDistributions, spatial statistics and a Bayesian perspective
Distributins, spatial statistics and a Bayesian perspective Dug Nychka Natinal Center fr Atmspheric Research Distributins and densities Cnditinal distributins and Bayes Thm Bivariate nrmal Spatial statistics
More informationClassical Planning Chapter 10. Mausam (Based on slides of Dan Weld, Marie desjardins)
Classical Planning Chapter 10 Mausam (ased on slides of Dan Weld, Marie desjardins) Given Planning a logical description of the world states, a logical description of a set of possible actions, a logical
More informationBootstrap Method > # Purpose: understand how bootstrap method works > obs=c(11.96, 5.03, 67.40, 16.07, 31.50, 7.73, 11.10, 22.38) > n=length(obs) >
Btstrap Methd > # Purpse: understand hw btstrap methd wrks > bs=c(11.96, 5.03, 67.40, 16.07, 31.50, 7.73, 11.10, 22.38) > n=length(bs) > mean(bs) [1] 21.64625 > # estimate f lambda > lambda = 1/mean(bs);
More informationHiding in plain sight
Hiding in plain sight Principles f stegangraphy CS349 Cryptgraphy Department f Cmputer Science Wellesley Cllege The prisners prblem Stegangraphy 1-2 1 Secret writing Lemn juice is very nearly clear s it
More informationLHS Mathematics Department Honors Pre-Calculus Final Exam 2002 Answers
LHS Mathematics Department Hnrs Pre-alculus Final Eam nswers Part Shrt Prblems The table at the right gives the ppulatin f Massachusetts ver the past several decades Using an epnential mdel, predict the
More informationModelling of Clock Behaviour. Don Percival. Applied Physics Laboratory University of Washington Seattle, Washington, USA
Mdelling f Clck Behaviur Dn Percival Applied Physics Labratry University f Washingtn Seattle, Washingtn, USA verheads and paper fr talk available at http://faculty.washingtn.edu/dbp/talks.html 1 Overview
More informationFloating Point Method for Solving Transportation. Problems with Additional Constraints
Internatinal Mathematical Frum, Vl. 6, 20, n. 40, 983-992 Flating Pint Methd fr Slving Transprtatin Prblems with Additinal Cnstraints P. Pandian and D. Anuradha Department f Mathematics, Schl f Advanced
More informationA Simple Set of Test Matrices for Eigenvalue Programs*
Simple Set f Test Matrices fr Eigenvalue Prgrams* By C. W. Gear** bstract. Sets f simple matrices f rder N are given, tgether with all f their eigenvalues and right eigenvectrs, and simple rules fr generating
More informationMath Foundations 20 Work Plan
Math Fundatins 20 Wrk Plan Units / Tpics 20.8 Demnstrate understanding f systems f linear inequalities in tw variables. Time Frame December 1-3 weeks 6-10 Majr Learning Indicatrs Identify situatins relevant
More informationLecture 13: Markov Chain Monte Carlo. Gibbs sampling
Lecture 13: Markv hain Mnte arl Gibbs sampling Gibbs sampling Markv chains 1 Recall: Apprximate inference using samples Main idea: we generate samples frm ur Bayes net, then cmpute prbabilities using (weighted)
More informationMath Foundations 10 Work Plan
Math Fundatins 10 Wrk Plan Units / Tpics 10.1 Demnstrate understanding f factrs f whle numbers by: Prime factrs Greatest Cmmn Factrs (GCF) Least Cmmn Multiple (LCM) Principal square rt Cube rt Time Frame
More informationCESAR Science Case The differential rotation of the Sun and its Chromosphere. Introduction. Material that is necessary during the laboratory
Teacher s guide CESAR Science Case The differential rtatin f the Sun and its Chrmsphere Material that is necessary during the labratry CESAR Astrnmical wrd list CESAR Bklet CESAR Frmula sheet CESAR Student
More informationLecture 5: Equilibrium and Oscillations
Lecture 5: Equilibrium and Oscillatins Energy and Mtin Last time, we fund that fr a system with energy cnserved, v = ± E U m ( ) ( ) One result we see immediately is that there is n slutin fr velcity if
More informationThe standards are taught in the following sequence.
B L U E V A L L E Y D I S T R I C T C U R R I C U L U M MATHEMATICS Third Grade In grade 3, instructinal time shuld fcus n fur critical areas: (1) develping understanding f multiplicatin and divisin and
More informationReview Problems 3. Four FIR Filter Types
Review Prblems 3 Fur FIR Filter Types Fur types f FIR linear phase digital filters have cefficients h(n fr 0 n M. They are defined as fllws: Type I: h(n = h(m-n and M even. Type II: h(n = h(m-n and M dd.
More informationReinforcement Learning" CMPSCI 383 Nov 29, 2011!
Reinfrcement Learning" CMPSCI 383 Nv 29, 2011! 1 Tdayʼs lecture" Review f Chapter 17: Making Cmple Decisins! Sequential decisin prblems! The mtivatin and advantages f reinfrcement learning.! Passive learning!
More informationKinetic Model Completeness
5.68J/10.652J Spring 2003 Lecture Ntes Tuesday April 15, 2003 Kinetic Mdel Cmpleteness We say a chemical kinetic mdel is cmplete fr a particular reactin cnditin when it cntains all the species and reactins
More informationTrigonometric Ratios Unit 5 Tentative TEST date
1 U n i t 5 11U Date: Name: Trignmetric Ratis Unit 5 Tentative TEST date Big idea/learning Gals In this unit yu will extend yur knwledge f SOH CAH TOA t wrk with btuse and reflex angles. This extensin
More informationMath 0310 Final Exam Review Problems
Math 0310 Final Exam Review Prblems Slve the fllwing equatins. 1. 4dd + 2 = 6 2. 2 3 h 5 = 7 3. 2 + (18 xx) + 2(xx 1) = 4(xx + 2) 8 4. 1 4 yy 3 4 = 1 2 yy + 1 5. 5.74aa + 9.28 = 2.24aa 5.42 Slve the fllwing
More information13. PO TREATMENT OF DEPT (DISTORTIONLESS ENHANCEMENT POLARIZATION TRANSFER)
94 Prduct Operatr Treatment 3. PO TREATMENT OF DEPT (DISTORTIONLESS ENHANCEMENT POLARIZATION TRANSFER) DEPT is a ne-dimensinal sequence used as a tl fr unambiguus identificatin f the CH, CH, and CH 3 peaks
More informationSticiGui Chapter 4: Measures of Location and Spread Philip Stark (2013)
SticiGui Chapter 4: Measures f Lcatin and Spread Philip Stark (2013) Summarizing data can help us understand them, especially when the number f data is large. This chapter presents several ways t summarize
More informationChapters 29 and 35 Thermochemistry and Chemical Thermodynamics
Chapters 9 and 35 Thermchemistry and Chemical Thermdynamics 1 Cpyright (c) 011 by Michael A. Janusa, PhD. All rights reserved. Thermchemistry Thermchemistry is the study f the energy effects that accmpany
More informationEngineering Decision Methods
GSOE9210 vicj@cse.unsw.edu.au www.cse.unsw.edu.au/~gs9210 Maximin and minimax regret 1 2 Indifference; equal preference 3 Graphing decisin prblems 4 Dminance The Maximin principle Maximin and minimax Regret
More informationMATHEMATICS SYLLABUS SECONDARY 5th YEAR
Eurpean Schls Office f the Secretary-General Pedaggical Develpment Unit Ref. : 011-01-D-8-en- Orig. : EN MATHEMATICS SYLLABUS SECONDARY 5th YEAR 6 perid/week curse APPROVED BY THE JOINT TEACHING COMMITTEE
More informationA PLETHORA OF MULTI-PULSED SOLUTIONS FOR A BOUSSINESQ SYSTEM. Department of Mathematics, Penn State University University Park, PA16802, USA.
A PLETHORA OF MULTI-PULSED SOLUTIONS FOR A BOUSSINESQ SYSTEM MIN CHEN Department f Mathematics, Penn State University University Park, PA68, USA. Abstract. This paper studies traveling-wave slutins f the
More informationENGI 4430 Parametric Vector Functions Page 2-01
ENGI 4430 Parametric Vectr Functins Page -01. Parametric Vectr Functins (cntinued) Any nn-zer vectr r can be decmpsed int its magnitude r and its directin: r rrˆ, where r r 0 Tangent Vectr: dx dy dz dr
More informationSection 6-2: Simplex Method: Maximization with Problem Constraints of the Form ~
Sectin 6-2: Simplex Methd: Maximizatin with Prblem Cnstraints f the Frm ~ Nte: This methd was develped by Gerge B. Dantzig in 1947 while n assignment t the U.S. Department f the Air Frce. Definitin: Standard
More informationUnit 1 Equations and Inequalities
Unit 1 Equatins and Inequalities Number f Days: 29 9/5/17 10/13/17 Unit Gals Stage 1 Unit Descriptin: Students extend their understanding f slving linear equatins in ne variable t slving equatins with
More informationDepartment of Economics, University of California, Davis Ecn 200C Micro Theory Professor Giacomo Bonanno. Insurance Markets
Department f Ecnmics, University f alifrnia, Davis Ecn 200 Micr Thery Prfessr Giacm Bnann Insurance Markets nsider an individual wh has an initial wealth f. ith sme prbability p he faces a lss f x (0
More informationFINITE BOOLEAN ALGEBRA. 1. Deconstructing Boolean algebras with atoms. Let B = <B,,,,,0,1> be a Boolean algebra and c B.
FINITE BOOLEAN ALGEBRA 1. Decnstructing Blean algebras with atms. Let B = be a Blean algebra and c B. The ideal generated by c, (c], is: (c] = {b B: b c} The filter generated by c, [c), is:
More informationk-nearest Neighbor How to choose k Average of k points more reliable when: Large k: noise in attributes +o o noise in class labels
Mtivating Example Memry-Based Learning Instance-Based Learning K-earest eighbr Inductive Assumptin Similar inputs map t similar utputs If nt true => learning is impssible If true => learning reduces t
More informationAP Statistics Notes Unit Two: The Normal Distributions
AP Statistics Ntes Unit Tw: The Nrmal Distributins Syllabus Objectives: 1.5 The student will summarize distributins f data measuring the psitin using quartiles, percentiles, and standardized scres (z-scres).
More information3. Classify the following Numbers (Counting (natural), Whole, Integers, Rational, Irrational)
After yu cmplete each cncept give yurself a rating 1. 15 5 2 (5 3) 2. 2 4-8 (2 5) 3. Classify the fllwing Numbers (Cunting (natural), Whle, Integers, Ratinal, Irratinal) a. 7 b. 2 3 c. 2 4. Are negative
More informationPhysical Layer: Outline
18-: Intrductin t Telecmmunicatin Netwrks Lectures : Physical Layer Peter Steenkiste Spring 01 www.cs.cmu.edu/~prs/nets-ece Physical Layer: Outline Digital Representatin f Infrmatin Characterizatin f Cmmunicatin
More informationUnit 2 Expressions, Equations, and Inequalities Math 7
Unit 2 Expressins, Equatins, and Inequalities Math 7 Number f Days: 24 10/23/17 12/1/17 Unit Gals Stage 1 Unit Descriptin: Students cnslidate and expand previus wrk with generating equivalent expressins
More informationTrigonometry, 8th ed; Lial, Hornsby, Schneider
Trignmetry, 8th ed; Lial, Hrnsby, Schneider Trignmetry Final Exam Review: Chapters 7, 8, 9 Nte: A prtin f Exam will cver Chapters 1 6, s be sure yu rewrk prblems frm the first and secnd exams and frm the
More informationPhys. 344 Ch 7 Lecture 8 Fri., April. 10 th,
Phys. 344 Ch 7 Lecture 8 Fri., April. 0 th, 009 Fri. 4/0 8. Ising Mdel f Ferrmagnets HW30 66, 74 Mn. 4/3 Review Sat. 4/8 3pm Exam 3 HW Mnday: Review fr est 3. See n-line practice test lecture-prep is t
More informationCHAPTER Read Chapter 17, sections 1,2,3. End of Chapter problems: 25
CHAPTER 17 1. Read Chapter 17, sectins 1,2,3. End f Chapter prblems: 25 2. Suppse yu are playing a game that uses tw dice. If yu cunt the dts n the dice, yu culd have anywhere frm 2 t 12. The ways f prducing
More informationSUPPLEMENTARY MATERIAL GaGa: a simple and flexible hierarchical model for microarray data analysis
SUPPLEMENTARY MATERIAL GaGa: a simple and flexible hierarchical mdel fr micrarray data analysis David Rssell Department f Bistatistics M.D. Andersn Cancer Center, Hustn, TX 77030, USA rsselldavid@gmail.cm
More informationNAME: Prof. Ruiz. 1. [5 points] What is the difference between simple random sampling and stratified random sampling?
CS4445 ata Mining and Kwledge iscery in atabases. B Term 2014 Exam 1 Nember 24, 2014 Prf. Carlina Ruiz epartment f Cmputer Science Wrcester Plytechnic Institute NAME: Prf. Ruiz Prblem I: Prblem II: Prblem
More informationInternal vs. external validity. External validity. This section is based on Stock and Watson s Chapter 9.
Sectin 7 Mdel Assessment This sectin is based n Stck and Watsn s Chapter 9. Internal vs. external validity Internal validity refers t whether the analysis is valid fr the ppulatin and sample being studied.
More informationCN700 Additive Models and Trees Chapter 9: Hastie et al. (2001)
CN700 Additive Mdels and Trees Chapter 9: Hastie et al. (2001) Madhusudana Shashanka Department f Cgnitive and Neural Systems Bstn University CN700 - Additive Mdels and Trees March 02, 2004 p.1/34 Overview
More informationPreparation work for A2 Mathematics [2018]
Preparatin wrk fr A Mathematics [018] The wrk studied in Y1 will frm the fundatins n which will build upn in Year 13. It will nly be reviewed during Year 13, it will nt be retaught. This is t allw time
More informationCS453 Intro and PA1 1
Plan fr day Ambiguus Grammars Disambiguating ambiguus grammars Predictive parsing IR and OLLOW sets Predictive Parsing table C453 Lecture p-dwn Predictive Parsers 1 Ambiguus Grammars Ambiguus grammar:
More informationECEN 4872/5827 Lecture Notes
ECEN 4872/5827 Lecture Ntes Lecture #5 Objectives fr lecture #5: 1. Analysis f precisin current reference 2. Appraches fr evaluating tlerances 3. Temperature Cefficients evaluatin technique 4. Fundamentals
More informationB. Definition of an exponential
Expnents and Lgarithms Chapter IV - Expnents and Lgarithms A. Intrductin Starting with additin and defining the ntatins fr subtractin, multiplicatin and divisin, we discvered negative numbers and fractins.
More informationThe blessing of dimensionality for kernel methods
fr kernel methds Building classifiers in high dimensinal space Pierre Dupnt Pierre.Dupnt@ucluvain.be Classifiers define decisin surfaces in sme feature space where the data is either initially represented
More information