Outline. Theory-based Bayesian framework for property induction Causal structure induction
|
|
- Frederick Lambert
- 5 years ago
- Views:
Transcription
1 Outline Theory-sed Byesin frmework for property indution Cusl struture indution Constrint-sed (ottom-up) lerning Theory-sed Byesin lerning
2 The origins of usl knowledge Question: how do people relily ome to true eliefs out the usl struture of their world? Answer must speify: Prior usl knowledge Cusl inferene proedure
3 Desriptive: Multiple gols Prior knowledge must e psyhologilly relisti. Inferene proedure must generte the sme eliefs tht people do, given the sme input. Explntory: Prior knowledge must e pproximtely orret. Inferene proedure (onstrined y prior knowledge) must e relile.
4 Anlogy with vision (Perl, Cheng, Gopnik et l.) Externl world struture Vision (inverse grphis) Grphis Oserved imges
5 The fundmentl prolem Hidden usl struture: A B Cusl indution Oserved dt: C E D Cusl struture uses oservtions Cse A B C D E
6 Under-onstrined prolems In oth visul pereption nd usl indution, mny world strutures ould hve produed the sme dt. Imge removed due to opyright onsidertions. Plese see: Freemn, WT. "The Generi Viewpoint Assumption in Frmework for Visul Pereption." Nture 368 (7 April 1994): Imge Possile world strutures
7 Under-onstrined prolems In oth visul pereption nd usl indution, mny world strutures ould hve produed the sme dt. A B A B P ( A, B ) z P ( A ) P ( B ) X X A B A B A B Correltion Possile world strutures
8 Questions in visul pereption How is the externl world represented? 3-D models 2-D views Intermedite: 2 1/2-D sketh, lyers, intrinsi imges, et. Wht kind of knowledge does the mind hve out the world? truture of ojets Physis of surfes ttistis of senes How does inferene work? Bottom-up, modulr, ontext-free Top-down, flexile, ontext-sensitive
9 Questions in usl indution How is the externl world represented? Assoitions Cusl strutures Intermedite: Cusl strength prmeters Wht kind of knowledge does the mind hve out the world? Constrints on usl struture (e.g., usl order) Fithfulness (oserved independene reltions re rel) Cusl mehnisms How does inferene work? Bottom-up: onstrint-sed (dt mining) pproh Top-down: theory-sed Byesin pproh
10 ome voulry Cusl struture peifies nothing out usl mehnisms or Wht uses wht. prmeteriztions. A B A B C D vs. C D E E
11 ome voulry Cusl struture Wht uses wht. Cusl mehnism How uses influene effets. C X D C D E E
12 ome voulry Cusl struture Wht uses wht. Cusl mehnism How uses influene effets. C X D C D E E
13 ome voulry Cusl struture Wht uses wht. Cusl mehnism How uses influene effets. C X D C D E E E f ( C, D )
14 ome voulry Cusl struture Wht uses wht. Cusl mehnism How uses influene effets. C X D C D E E E f ( C, D, İ) İ ~ Gussin(µ, ı)
15 ome voulry Cusl struture Wht uses wht. Cusl mehnism How uses influene effets. Knowledge out usl strutures nd mehnisms n e represented t different sles of detil. Astrt ( light ) mehnism knowledge will e prtiulrly importnt: e.g., - deterministi, qusi-deterministi, semi-deterministi or stohsti? - strong or wek? - genertive or preventive influene? - independent of or intertive with other uses?
16 ome voulry Cusl struture Wht uses wht. Cusl mehnism How uses influene effets. Prmeteriztion Form of P(effet uses), e.g. noisy-or Cusl strengths (prmeters) Reltive ontriutions of different uses given prtiulr mehnism or prmeteriztion.
17 Approhes to struture lerning Constrint-sed lerning (Perl, Glymour, Gopnik): Assume struture is unknown, no knowledge of prmeteriztion or prmeters Byesin lerning (Hekermn, Friedmn/Koller): Assume struture is unknown, ritrry prmeteriztion. Theory-sed Byesin inferene (T & G): Assume struture is prtilly unknown, prmeteriztion is known ut prmeters my not e. Prior knowledge out struture nd prmeteriztion depends on domin theories (derived from ontology nd mehnisms).
18 Approhes to struture lerning Constrint-sed lerning (Perl, Glymour, Gopnik): Assume struture is unknown, no knowledge of prmeteriztion or prmeters Byesin lerning (Hekermn, Friedmn/Koller): Assume struture is unknown, ritrry prmeteriztion. Theory-sed Byesin inferene (T & G): Assume struture is prtilly unknown, prmeteriztion is known ut prmeters my not e. Prior knowledge out struture nd prmeteriztion depends on domin theories (derived from ontology nd mehnisms).
19 Cusl inferene in siene tndrd question: is X diret use of? tndrd empiril methodologies in mny domins: Psyhology Mediine Epidemiology Eonomis Biology Constrint-sed inferene ttempts to formlize this methodology.
20 Constrint-sed lerning Cusl grph: A B C D Fithfulness ssumption E Proility distriution: P ( A, B, C, D, E ) P ( V prents [ V ]) V { A, B, C, D, E } Cusl Mrkov ssumption P ( A, B, C, D, E ) P ( A ) P ( B ) P ( C A, B ) P ( D B ) P ( E C,D )
21 Definition of use Under the usl Mrkov priniple, A is diret use of B implies tht when ll other potentilly relevnt vriles re held onstnt, the proility of B depends upon the presene or sene of A. Under the fithfulness ssumption, (in)dependene nd onditionl (in)dependene reltions in the oserved dt imply onstrints on the hidden usl struture (see piture).
22 Exmple Wht is the usl struture relting smoking (), yellow teeth (), nd lung ner ()? Epidemiologil Dt: Ptient moking? ellow teeth? ung Cner? 1 yes yes yes 2 yes yes no 3 yes no yes 4 no no no 5 yes yes yes 6 yes no no 7 yes no yes 8 no no no....
23 Full Common Effet Common Cuse Chin One link Empty
24 Inferene proess A hypothesis:
25 Inferene proess A hypothesis: Wht evidene would support this hypothesis? Would tht evidene e onsistent with ny other hypothesis?
26 Exmple Wht is the usl struture relting smoking (), yellow teeth (), nd lung ner ()? Expeted simple orreltions: smoking, yellow teeth: yes smoking, lung ner: yes yellow teeth, lung ner: yes Expeted prtil (onditionl) orreltions: smoking, yellow teeth lung ner: yes smoking, lung ner yellow teeth: yes yellow teeth, lung ner smoking: no
27 Exmple Wht is the usl struture relting smoking (), yellow teeth (), nd lung ner ()? Expeted simple orreltions: smoking, yellow teeth: yes smoking, lung ner: yes yellow teeth, lung ner: yes Under fithfulness, two vriles tht re orrelted must shre ommon nestor. In this exmple, eh pir of nodes must shre ommon nestor.
28 Common Effet Chin Common Cuse n Ch Full One link Empty
29 Glol semntis Joint proility distriution ftorizes into produt of lol onditionl proilities: n P ( V 1,, V n ) P ( V i prents [V i ]) i 1 Burglry Erthquke Alrm JohnClls MryClls P ( B, E, A, J, M ) P ( B ) P ( E ) P ( A B, E ) P ( J A ) P (M A )
30 ol semntis Glol ftoriztion is equivlent to set of onstrints on pirwise reltionships etween vriles. Mrkov property : Eh node is onditionlly independent of its non-desendnts given its prents. U 1 U m Z 1j X Z nj 1 n Imge y MIT OCW.
31 ol semntis Glol ftoriztion is equivlent to set of onstrints on pirwise reltionships etween vriles. Eh node is onditionlly independent of ll others given its Mrkov lnket : prents, hildren, hildren s prents. U 1 U m Z 1j X Z nj 1 n Imge y MIT OCW.
32 Exmple Wht is the usl struture relting smoking, yellow teeth, nd lung ner? Expeted prtil (onditionl) orreltions: smoking, yellow teeth lung ner: yes smoking, lung ner yellow teeth: yes yellow teeth, lung ner smoking: no Under fithfulness: If two vriles nd re onditionlly independent given, then nd must not e in eh other s Mrkov lnket, nd must e in the Mrkov lnket of oth.
33 Common Effet Chin Common Cuse n Ch Full One link Empty
34 Empty Full Common Effet Chin Common Cuse Cn we distinguish etween the remining strutures? One link
35 The limits of onstrint-sed inferene Mrkov equivlene lss: A set of usl grphs tht nnot e distinguished sed on (in)dependene reltions. With two vriles, there re three possile usl grphs nd two equivlene lsses:
36 The limits of onstrint-sed inferene Mrkov equivlene lss: A set of usl grphs tht nnot e distinguished sed on (in)dependene reltions. With two vriles, there re three possile usl grphs nd two equivlene lsses: A nd B not independent. A nd B independent.
37 Full Common Effet Common Cuse Chin One link Empty
38 Full Common Effet One link Chin n Ch Common Cuse Empty
39 Additionl soures of onstrint Prior knowledge out usl struture Temporl order Domin-speifi onstrints Interventions Exogenously lmp one or more vriles to some known vlue, nd oserve other vriles over series of ses.
40 Interventions Exmple: Fore smple of sujets to smoke. Idel interventions lok ll other diret uses of the mnipulted vrile:
41 Interventions Exmple: Fore smple of sujets to smoke, nd nother smple to not smoke. Idel interventions lok ll other diret uses of the mnipulted vrile: I I I
42 Interventions Exmple: Fore smple of sujets to smoke, nd nother smple to not smoke. Non-idel interventions simply dd n extr use tht is under the lerner s ontrol: I I I
43 Advntges of the onstrint- Dedutive Domin-generl sed pproh No essentil role for domin knowledge: Knowledge of possile usl strutures not needed. Knowledge of possile usl mehnisms not used.
44 Disdvntges of the onstrint- Dedutive Domin-generl sed pproh No essentil role for domin knowledge: Knowledge of possile usl strutures not needed. Knowledge of possile usl mehnisms not used. Requires lrge smple sizes to mke relile inferenes.
45 Exmple Wht is the usl struture relting smoking, yellow teeth, nd lung ner? Epidemiologil Dt: Ptient moking? ellow teeth? ung Cner? 1 yes yes yes 2 yes yes no 3 yes no yes 4 no no no 5 yes yes yes 6 yes no no 7 yes no yes 8 no no no....
46 Computing (in)dependene tndrd methods sed on F 2 test: V=0 V=1 U=0 U=1 d 2 Ȥ 2 ( d )( u d u ) ( )( d )( )( d ) signifintly > 0: not independent not signifintly > 0: independent
47 Computing (in)dependene Are smoking nd yellow teeth independent? =0 =1 =0 2 0 =1 3 3 F2 = 1.6, p = 0.21
48 Computing (in)dependene Are smoking nd lung ner independent? =0 =1 =0 2 0 =1 2 4 F2 = 2.67, p = 0.10
49 Computing (in)dependene Are lung ner nd yellow teeth onditionlly independent given smoking? =1 =0 =1 =0 =0 =1 =0 1 2 =0 2 0 =1 1 2 =1 0 0 F2 = 0, p = 1.0 F 2 = undefined
50 Disdvntges of the onstrint- Dedutive Domin-generl sed pproh No essentil role for domin knowledge: Knowledge of possile usl strutures not needed. Knowledge of possile usl mehnisms not used. Requires lrge smple sizes to mke relile inferenes.
51 The Bliket detetor Imge removed due to opyright onsidertions. Plese see: Gopnik, A., nd D. M. oel. "Deteting Blikets: How oung Children use Informtion out Novel Cusl Powers in Ctegoriztion nd Indution." Child Development 71 (2000):
52 Imge removed due to opyright onsidertions. Plese see: Gopnik, A., nd D. M. oel. "Deteting Blikets: How oung Children use Informtion out Novel Cusl Powers in Ctegoriztion nd Indution." Child Development 71 (2000):
53 The Bliket detetor Cn we explin these inferenes using onstrint-sed lerning? Wht other explntions n we ome up with?
Learning Partially Observable Markov Models from First Passage Times
Lerning Prtilly Oservle Mrkov s from First Pssge s Jérôme Cllut nd Pierre Dupont Europen Conferene on Mhine Lerning (ECML) 8 Septemer 7 Outline. FPT in models nd sequenes. Prtilly Oservle Mrkov s (POMMs).
More informationA Differential Approach to Inference in Bayesian Networks
Dierentil pproh to Inerene in Byesin Networks esented y Ynn Shen shenyn@mi.pitt.edu Outline Introdution Oeriew o lgorithms or inerene in Byesin networks (BN) oposed new pproh How to represent BN s multi-rite
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 informationProject 6: Minigoals Towards Simplifying and Rewriting Expressions
MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy
More informationLecture Notes No. 10
2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite
More informationReview Topic 14: Relationships between two numerical variables
Review Topi 14: Reltionships etween two numeril vriles Multiple hoie 1. Whih of the following stterplots est demonstrtes line of est fit? A B C D E 2. The regression line eqution for the following grph
More informationChapter 4 State-Space Planning
Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different
More informationAbstraction of Nondeterministic Automata Rong Su
Astrtion of Nondeterministi Automt Rong Su My 6, 2010 TU/e Mehnil Engineering, Systems Engineering Group 1 Outline Motivtion Automton Astrtion Relevnt Properties Conlusions My 6, 2010 TU/e Mehnil Engineering,
More informationUniversity of Sioux Falls. MAT204/205 Calculus I/II
University of Sioux Flls MAT204/205 Clulus I/II Conepts ddressed: Clulus Textook: Thoms Clulus, 11 th ed., Weir, Hss, Giordno 1. Use stndrd differentition nd integrtion tehniques. Differentition tehniques
More informationSpacetime and the Quantum World Questions Fall 2010
Spetime nd the Quntum World Questions Fll 2010 1. Cliker Questions from Clss: (1) In toss of two die, wht is the proility tht the sum of the outomes is 6? () P (x 1 + x 2 = 6) = 1 36 - out 3% () P (x 1
More informationLinear Algebra Introduction
Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +
More information6.5 Improper integrals
Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =
More information1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.
1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the
More informationSystem Validation (IN4387) November 2, 2012, 14:00-17:00
System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise
More informationArrow s Impossibility Theorem
Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties
More informationIntroduction to Graphical Models
Introution to Grhil Moels Kenji Fukumizu The Institute of Sttistil Mthemtis Comuttionl Methoology in Sttistil Inferene II Introution n Review 2 Grhil Moels Rough Sketh Grhil moels Grh: G V E V: the set
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 informationTIME AND STATE IN DISTRIBUTED SYSTEMS
Distriuted Systems Fö 5-1 Distriuted Systems Fö 5-2 TIME ND STTE IN DISTRIUTED SYSTEMS 1. Time in Distriuted Systems Time in Distriuted Systems euse eh mhine in distriuted system hs its own lok there is
More information8 THREE PHASE A.C. CIRCUITS
8 THREE PHSE.. IRUITS The signls in hpter 7 were sinusoidl lternting voltges nd urrents of the so-lled single se type. n emf of suh type n e esily generted y rotting single loop of ondutor (or single winding),
More informationAlpha Algorithm: A Process Discovery Algorithm
Proess Mining: Dt Siene in Ation Alph Algorithm: A Proess Disovery Algorithm prof.dr.ir. Wil vn der Alst www.proessmining.org Proess disovery = Ply-In Ply-In event log proess model Ply-Out Reply proess
More informationAlpha Algorithm: Limitations
Proess Mining: Dt Siene in Ation Alph Algorithm: Limittions prof.dr.ir. Wil vn der Alst www.proessmining.org Let L e n event log over T. α(l) is defined s follows. 1. T L = { t T σ L t σ}, 2. T I = { t
More informationRandom subgroups of a free group
Rndom sugroups of free group Frédérique Bssino LIPN - Lortoire d Informtique de Pris Nord, Université Pris 13 - CNRS Joint work with Armndo Mrtino, Cyril Nicud, Enric Ventur et Pscl Weil LIX My, 2015 Introduction
More informationThe area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O
1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the
More informationANALYSIS AND MODELLING OF RAINFALL EVENTS
Proeedings of the 14 th Interntionl Conferene on Environmentl Siene nd Tehnology Athens, Greee, 3-5 Septemer 215 ANALYSIS AND MODELLING OF RAINFALL EVENTS IOANNIDIS K., KARAGRIGORIOU A. nd LEKKAS D.F.
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 informationArrow s Impossibility Theorem
Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep
More informationCS 347 Parallel and Distributed Data Processing
CS 347 Prllel nd Distriuted Dt Proessing Spring 06 Network Prtitions Susets of nodes m e isolted or nodes m e slow in responding Notes 8: Network Prtitions CS 347 Notes 8 Network Prtitions Cuses ired network
More informationLecture 6: Coding theory
Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those
More informationdx dt dy = G(t, x, y), dt where the functions are defined on I Ω, and are locally Lipschitz w.r.t. variable (x, y) Ω.
Chpter 8 Stility theory We discuss properties of solutions of first order two dimensionl system, nd stility theory for specil clss of liner systems. We denote the independent vrile y t in plce of x, nd
More informationSTRUCTURE OF CONCURRENCY Ryszard Janicki. Department of Computing and Software McMaster University Hamilton, ON, L8S 4K1 Canada
STRUCTURE OF CONCURRENCY Ryszrd Jnicki Deprtment of Computing nd Softwre McMster University Hmilton, ON, L8S 4K1 Cnd jnicki@mcmster.c 1 Introduction Wht is concurrency? How it cn e modelled? Wht re the
More informationThe University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS
The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their
More informationarxiv: v1 [hep-ph] 11 Sep 2018
Neutrino spetrum in SU3 l SU3 E guged lepton flvor model rxiv:1809.03677v1 [hep-ph] 11 Sep 018 W Sreethwong 1, W Treesukrt 1 nd P Uttyrt 1 Shool of Physis, Surnree University of Tehnology, Nkhon Rthsim
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 informationDiscrete Structures Lecture 11
Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.
More informationQuantum Nonlocality Pt. 2: No-Signaling and Local Hidden Variables May 1, / 16
Quntum Nonloclity Pt. 2: No-Signling nd Locl Hidden Vriles My 1, 2018 Quntum Nonloclity Pt. 2: No-Signling nd Locl Hidden Vriles My 1, 2018 1 / 16 Non-Signling Boxes The primry lesson from lst lecture
More informationCS 310 (sec 20) - Winter Final Exam (solutions) SOLUTIONS
CS 310 (sec 20) - Winter 2003 - Finl Exm (solutions) SOLUTIONS 1. (Logic) Use truth tles to prove the following logicl equivlences: () p q (p p) (q q) () p q (p q) (p q) () p q p q p p q q (q q) (p p)
More informationCHENG Chun Chor Litwin The Hong Kong Institute of Education
PE-hing Mi terntionl onferene IV: novtion of Mthemtis Tehing nd Lerning through Lesson Study- onnetion etween ssessment nd Sujet Mtter HENG hun hor Litwin The Hong Kong stitute of Edution Report on using
More informationDorf, R.C., Wan, Z. T- Equivalent Networks The Electrical Engineering Handbook Ed. Richard C. Dorf Boca Raton: CRC Press LLC, 2000
orf, R.C., Wn,. T- Equivlent Networks The Eletril Engineering Hndook Ed. Rihrd C. orf Bo Rton: CRC Press LLC, 000 9 T P Equivlent Networks hen Wn University of Cliforni, vis Rihrd C. orf University of
More information378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.
378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),
More informationTable of Content. c 1 / 5
Tehnil Informtion - t nd t Temperture for Controlger 03-2018 en Tble of Content Introdution....................................................................... 2 Definitions for t nd t..............................................................
More informationGeneralization of 2-Corner Frequency Source Models Used in SMSIM
Generliztion o 2-Corner Frequeny Soure Models Used in SMSIM Dvid M. Boore 26 Mrh 213, orreted Figure 1 nd 2 legends on 5 April 213, dditionl smll orretions on 29 My 213 Mny o the soure spetr models ville
More informationBehavior Composition in the Presence of Failure
Behvior Composition in the Presene of Filure Sestin Srdin RMIT University, Melourne, Austrli Fio Ptrizi & Giuseppe De Giomo Spienz Univ. Rom, Itly KR 08, Sept. 2008, Sydney Austrli Introdution There re
More informationDiscrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α
Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw
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 informationA Non-parametric Approach in Testing Higher Order Interactions
A Non-prmetri Approh in Testing igher Order Intertions G. Bkeerthn Deprtment of Mthemtis, Fulty of Siene Estern University, Chenkldy, Sri Lnk nd S. Smit Deprtment of Crop Siene, Fulty of Agriulture University
More informationSection 1.3 Triangles
Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior
More informationAlgorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:
Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer
More informationNON-DETERMINISTIC FSA
Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is
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 informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationImplication Graphs and Logic Testing
Implition Grphs n Logi Testing Vishwni D. Agrwl Jmes J. Dnher Professor Dept. of ECE, Auurn University Auurn, AL 36849 vgrwl@eng.uurn.eu www.eng.uurn.eu/~vgrwl Joint reserh with: K. K. Dve, ATI Reserh,
More information6.3.2 Spectroscopy. N Goalby chemrevise.org 1 NO 2 CH 3. CH 3 C a. NMR spectroscopy. Different types of NMR
6.. Spetrosopy NMR spetrosopy Different types of NMR NMR spetrosopy involves intertion of mterils with the lowenergy rdiowve region of the eletromgneti spetrum NMR spetrosopy is the sme tehnology s tht
More informationNondeterministic Automata vs Deterministic Automata
Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n
More informationTechnische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution
Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:
More informationUnit #9 : Definite Integral Properties; Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More information6.3.2 Spectroscopy. N Goalby chemrevise.org 1 NO 2 H 3 CH3 C. NMR spectroscopy. Different types of NMR
6.. Spetrosopy NMR spetrosopy Different types of NMR NMR spetrosopy involves intertion of mterils with the lowenergy rdiowve region of the eletromgneti spetrum NMR spetrosopy is the sme tehnology s tht
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 informationCS 188: Artificial Intelligence Fall Announcements
CS 188: Artificil Intelligence Fll 2009 Lecture 20: Prticle Filtering 11/5/2009 Dn Klein UC Berkeley Announcements Written 3 out: due 10/12 Project 4 out: due 10/19 Written 4 proly xed, Project 5 moving
More informationSolutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!
Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:
More informationSemantic Analysis. CSCI 3136 Principles of Programming Languages. Faculty of Computer Science Dalhousie University. Winter Reading: Chapter 4
Semnti nlysis SI 16 Priniples of Progrmming Lnguges Fulty of omputer Siene Dlhousie University Winter 2012 Reding: hpter 4 Motivtion Soure progrm (hrter strem) Snner (lexil nlysis) Front end Prse tree
More informationPart I: Study the theorem statement.
Nme 1 Nme 2 Nme 3 A STUDY OF PYTHAGORAS THEOREM Instrutions: Together in groups of 2 or 3, fill out the following worksheet. You my lift nswers from the reding, or nswer on your own. Turn in one pket for
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 informationSymmetrical Components 1
Symmetril Components. Introdution These notes should e red together with Setion. of your text. When performing stedy-stte nlysis of high voltge trnsmission systems, we mke use of the per-phse equivlent
More informationExercise 3 Logic Control
Exerise 3 Logi Control OBJECTIVE The ojetive of this exerise is giving n introdution to pplition of Logi Control System (LCS). Tody, LCS is implemented through Progrmmle Logi Controller (PLC) whih is lled
More informationCS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6
CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized
More informationy1 y2 DEMUX a b x1 x2 x3 x4 NETWORK s1 s2 z1 z2
BOOLEAN METHODS Giovnni De Miheli Stnford University Boolen methods Exploit Boolen properties. { Don't re onditions. Minimiztion of the lol funtions. Slower lgorithms, etter qulity results. Externl don't
More informationStructure learning in human causal induction
Structure lerning in humn cusl induction Joshu B. Tenenbum & Thoms L. Griffiths Deprtment of Psychology Stnford University, Stnford, CA 94305 jbt,gruffydd psych.stnford.edu Abstrct We use grphicl models
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 informationMA123, Chapter 10: Formulas for integrals: integrals, antiderivatives, and the Fundamental Theorem of Calculus (pp.
MA123, Chpter 1: Formuls for integrls: integrls, ntiderivtives, nd the Fundmentl Theorem of Clculus (pp. 27-233, Gootmn) Chpter Gols: Assignments: Understnd the sttement of the Fundmentl Theorem of Clculus.
More informationAnalysis of Temporal Interactions with Link Streams and Stream Graphs
Anlysis of Temporl Intertions with n Strem Grphs, Tiphine Vir, Clémene Mgnien http:// ltpy@ LIP6 CNRS n Soronne Université Pris, Frne 1/23 intertions over time 0 2 4 6 8,,, n for 10 time units time 2/23
More informationList all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1.
Mth Anlysis CP WS 4.X- Section 4.-4.4 Review Complete ech question without the use of grphing clcultor.. Compre the mening of the words: roots, zeros nd fctors.. Determine whether - is root of 0. Show
More informationStatistical models for record linkage
Sttistil models for reord linge Trining ourse on reord linge Mro Fortini Istt fortini@istt.it Estimtion prolems Prmeters estimtion for reord linge Use of dt from prior studies Use of urrent smples (leril
More informationEigenvectors and Eigenvalues
MTB 050 1 ORIGIN 1 Eigenvets n Eigenvlues This wksheet esries the lger use to lulte "prinipl" "hrteristi" iretions lle Eigenvets n the "prinipl" "hrteristi" vlues lle Eigenvlues ssoite with these iretions.
More informationLogic Synthesis and Verification
Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 2010 Reding: Logi Synthesis in Nutshell Setion 2 most
More informationCS 275 Automata and Formal Language Theory
CS 275 utomt nd Forml Lnguge Theory Course Notes Prt II: The Recognition Prolem (II) Chpter II.5.: Properties of Context Free Grmmrs (14) nton Setzer (Bsed on ook drft y J. V. Tucker nd K. Stephenson)
More informationResources. Introduction: Binding. Resource Types. Resource Sharing. The type of a resource denotes its ability to perform different operations
Introduction: Binding Prt of 4-lecture introduction Scheduling Resource inding Are nd performnce estimtion Control unit synthesis This lecture covers Resources nd resource types Resource shring nd inding
More informationActivities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions
MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd
More informationKENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS CLASS - XII MATHEMATICS (Relations and Functions & Binary Operations)
KENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS 6-7 CLASS - XII MATHEMATICS (Reltions nd Funtions & Binry Opertions) For Slow Lerners: - A Reltion is sid to e Reflexive if.. every A
More informationCMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014
CMPSCI 250: Introduction to Computtion Lecture #31: Wht DFA s Cn nd Cn t Do Dvid Mix Brrington 9 April 2014 Wht DFA s Cn nd Cn t Do Deterministic Finite Automt Forml Definition of DFA s Exmples of DFA
More informationAT100 - Introductory Algebra. Section 2.7: Inequalities. x a. x a. x < a
Section 2.7: Inequlities In this section, we will Determine if given vlue is solution to n inequlity Solve given inequlity or compound inequlity; give the solution in intervl nottion nd the solution 2.7
More informationUnfoldings of Networks of Timed Automata
Unfolings of Networks of Time Automt Frnk Cssez Thoms Chtin Clue Jr Ptrii Bouyer Serge H Pierre-Alin Reynier Rennes, Deemer 3, 2008 Unfolings [MMilln 93] First efine for Petri nets Then extene to other
More informationNondeterministic Finite Automata
Nondeterministi Finite utomt The Power of Guessing Tuesdy, Otoer 4, 2 Reding: Sipser.2 (first prt); Stoughton 3.3 3.5 S235 Lnguges nd utomt eprtment of omputer Siene Wellesley ollege Finite utomton (F)
More informationLecture 2: January 27
CS 684: Algorithmic Gme Theory Spring 217 Lecturer: Év Trdos Lecture 2: Jnury 27 Scrie: Alert Julius Liu 2.1 Logistics Scrie notes must e sumitted within 24 hours of the corresponding lecture for full
More informationCS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)
CS 373, Spring 29. Solutions to Mock midterm (sed on first midterm in CS 273, Fll 28.) Prolem : Short nswer (8 points) The nswers to these prolems should e short nd not complicted. () If n NF M ccepts
More informationMaintaining Mathematical Proficiency
Nme Dte hpter 9 Mintining Mthemtil Profiieny Simplify the epression. 1. 500. 189 3. 5 4. 4 3 5. 11 5 6. 8 Solve the proportion. 9 3 14 7. = 8. = 9. 1 7 5 4 = 4 10. 0 6 = 11. 7 4 10 = 1. 5 9 15 3 = 5 +
More informationContinuous Joint Distributions Chris Piech CS109, Stanford University
Continuous Joint Distriutions Chris Piech CS09, Stnford University CS09 Flow Tody Discrete Joint Distriutions: Generl Cse Multinomil: A prmetric Discrete Joint Cont. Joint Distriutions: Generl Cse Lerning
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 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 informationMain topics for the First Midterm
Min topics for the First Midterm The Midterm will cover Section 1.8, Chpters 2-3, Sections 4.1-4.8, nd Sections 5.1-5.3 (essentilly ll of the mteril covered in clss). Be sure to know the results of the
More informationUnit 4. Combinational Circuits
Unit 4. Comintionl Ciruits Digitl Eletroni Ciruits (Ciruitos Eletrónios Digitles) E.T.S.I. Informáti Universidd de Sevill 5/10/2012 Jorge Jun 2010, 2011, 2012 You re free to opy, distriute
More informationComparing Alternative Methods for Inference in Multiply Sectioned Bayesian Networks
From: FLAIRS-02 Proeedings. Copyright 2002, AAAI (www.i.org). All rights reserved. Compring Alterntive Methods for Inferene in Multiply Setioned Byesin Networks Y. Xing Dept. Computing & Informtion Siene
More information10. AREAS BETWEEN CURVES
. AREAS BETWEEN CURVES.. Ares etween curves So res ove the x-xis re positive nd res elow re negtive, right? Wrong! We lied! Well, when you first lern out integrtion it s convenient fiction tht s true in
More informationMotion illusions as optimal percepts
Motion illusions s optiml perepts Yir Weiss 1, Eero P. Simonelli 2 nd Edwrd H. Adelson 3 1 Shool of Computer Siene nd Engineering, Herew University of Jeruslem, Givt Rm Cmpus, Jeruslem 9194, Isrel 2 Howrd
More informationThomas Whitham Sixth Form
Thoms Whithm Sith Form Pure Mthemtics Unit C Alger Trigonometry Geometry Clculus Vectors Trigonometry Compound ngle formule sin sin cos cos Pge A B sin Acos B cos Asin B A B sin Acos B cos Asin B A B cos
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 informationFactorising FACTORISING.
Ftorising FACTORISING www.mthletis.om.u Ftorising FACTORISING Ftorising is the opposite of expning. It is the proess of putting expressions into rkets rther thn expning them out. In this setion you will
More informationPolynomials. Polynomials. Curriculum Ready ACMNA:
Polynomils Polynomils Curriulum Redy ACMNA: 66 www.mthletis.om Polynomils POLYNOMIALS A polynomil is mthemtil expression with one vrile whose powers re neither negtive nor frtions. The power in eh expression
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 informationChapter 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 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 information