Outline. Single-Player Games = Planning. Planning under incomplete information. Planning. COMP s1. Michael Thielscher, Michael Genesereth 2011
|
|
- Mavis Harrison
- 5 years ago
- Views:
Transcription
1 Plannin Outline 1 Sinle-Player Gaes = Plannin Plannin uner incoplete inforation
2 Plannin Sinle-Player Gaes 2
3 Plannin 3 A (Very) Siple Plannin Proble Pressin button a toles p. Pressin button b interchanes p an q. Initially, p an q are off. Goal: p an q are on.
4 Plannin 4 Proble Specification role(robot) Leality leal(robot,a) leal(robot,b) Upate next(p) <= oes(robot,a) true(p) oes(robot,b) true(q) next(q) <= oes(robot,a) true(q) Terination an Goal oes(robot,b) true(p) terinal <= true(p) true(q) oal(robot,100) <= true(p) true(q)
5 Plannin State Transition Syste 5 Features: Actions: p, q a, b b p, q p, q b a a a a p, q b b p, q
6 Plannin 6 Solvin Sinle-Player Gaes = Plannin Initial state {} Actions a b Goal p q Preconitions: none Effects: toles truth-value of p Preconitions: none Effects: interchanes truth-values of p an q Solution (= Plan): a, b, a
7 Plannin 7 Sinle-Player Gaes with Coplete Inforation Many sinle-player aes can be solve usin stanar search techniques introuce earlier in this course Iterative eepenin Biirectional search Special techniques Constraint solvin (suitable for Suoku, Gene Sequencin an the like) Answer set prorain (suitable for Pe Jupin, 15-Puzzle an the like) Infore search uses heuristic functions. In eneral ae playin, the rules are not known in avance an heuristics ust be constructe autoatically. More on this a little later.
8 Plannin 8 Plannin Uner Incoplete Inforation: Maze Worl a? b c Initial State: ac (robot in a, ol in c)
9 Plannin Environent Moel 9 ca a cb b ba aa ab ai i ci i = "in han" c cc c b a ac
10 Plannin Aent Actions 10,, ca a,, ba c b aa a ai i,, cb b ci cc ab c ac,,,,,, = "ove clockwise" = "rab" = "rop"
11 Plannin Aent Percepts 11,, ca a,, ba c b aa a ai i,, cb b ci cc ab c ac,,,,,, sees ol oesn't see ol
12 Plannin Initial State an Goal 12,, ca a,, ba c b aa a ai i,, cb b ci cc ab c ac,,,,,,
13 Plannin Plannin 13 Plannin is the process of finin a transition iara for our aent that causes its environent to o fro any initial state to a oal state. s1 s2 s3 s4 s5 s6 s7 Plannin can be one offline an the resultin plan/prora installe in the aent or the plannin can be one online followe by execution.
14 Plannin 14,, ca a,, ba c b State Space Plannin aa a ai i,, cb b ci cc ab c ac,,,,,,
15 Plannin 15 Incopleteness Possible sources of incopleteness: Partial knowlee of Initial state Transition iara for environent Goal Coplete Plannin Techniques uner incoplete inforation Coercion (e.. o the rab action at all locations) Conitional plan (e.. if see the ol rab it; else ove) Postponeent Techniques Delaye plannin
16 Plannin 16 Initial State Uncertainty,, ca a,, ba c b aa a ai i,, cb b ci cc ab c ac,,,,,,
17 Plannin 17 Sequential State Set Proression b rab ove b rop b ci cb cc c
18 Plannin 18 Sequential State Set Plan aa ab ac a ove ba b rab ba b ove ca ci cc c rab ca ci c ove a i rab a i ove aa ai rop aa
19 Plannin 19,, ca a,, ba c b Plan Execution aa a ai i,, cb b ci cc ab c ac,,,,,,
20 Plannin 20 Conitional State Set Proression 1 b ci cb 0 b cc c
21 Plannin 21 Conitional State Set Plan 0/ 1/ 1/ 0/ 0/
22 Plannin 22 Coparison Sequential plan possible that no plan exists plan ay contain reunant oves Conitional plan lare search space Delaye plannin irreversility probleatic As we can see fro this analysis, it is soeties esirable for an aent to o only a portion of its plannin up front, secure in the knowlee that it can o ore later as necessary. Plannin can be one offline an the resultin plan/prora execute urin play or the plannin can be one online an interleave with execution.
Lecture 4: Incomplete Information
Lecture 4: Incoplete Infortion Multiple Plyer Ges n other Ges with Incoplete Infortion Stte-Spce Serch with Multiple Plyers Minix with - -Cutoff Plnnin uner Uncertinty Generl Ge Plyin Incoplete Infortion
More informationCIS-331 Fall 2014 Exam 1 Name: Total of 109 Points Version 1
Version 1 1. (24 Points) Show the routing tables for routers A, B, C, and D. Make sure you account for traffic to the Internet. Router A Router B Router C Router D Network Next Hop Next Hop Next Hop Next
More informationToday s Outline. Motivation. Disjoint Sets. Disjoint Sets and Dynamic Equivalence Relations. Announcements. Today s Topics:
Today s Outline Disjoint Sets and Dynamic Equivalence Relations Announcements Assignment # due Thurs 0/ at pm Today s Topics: Disjoint Sets & Dynamic Equivalence CSE Data Structures and Algorithms 0//0
More informationSummary. Boolean Addition
Summary Boolean Addition In Boolean algebra, a variable is a symbol used to represent an action, a condition, or data. A single variable can only have a value of or 0. The complement represents the inverse
More informationCIS-331 Exam 2 Fall 2015 Total of 105 Points Version 1
Version 1 1. (20 Points) Given the class A network address 117.0.0.0 will be divided into multiple subnets. a. (5 Points) How many bits will be necessary to address 4,000 subnets? b. (5 Points) What is
More informationOptimal Scheduling of Dynamic Progressive Processing
Optimal Schedulin of Dynamic roressive rocessin Abdel-Illah ouaddib and Shlomo Zilberstein Abstract. roressive processin allows a system to satisfy a set of requests under time pressure by limitin the
More information$%&#!#$!!!#'((#!)*+"!!,!#*+- ) %() (. %( ) //. 0 1 ) (2.
!!"##! $%&#!#$!!!#'((#!)*+"!!,!#*+- ) %() (. %( ) //. 0 1 ) (2. / 3 /!. 4 5 5.. 0 )67 )" ) +-889:+ 5 7777777777 77777777 * )67* )" ).0; ((, ((
More informationInterleaving Execution and Planning for Nondeterministic, Partially Observable Domains
Interleaving Execution and lanning for Nondeterinistic, artially bservable Doains iergiorgio ertoli and lessandro iatti and aolo Traverso bstract. Methods that interleave planning and execution are a practical
More informationApplying Axiomatic Design Theory to the Multi-objective Optimization of Disk Brake
Applyin Aiomatic Desin Theory to the Multi-objective Optimization of Disk Brake Zhiqian Wu Xianfu Chen * Junpin Yuan School of Mechanical an Electronical Enineerin East China Jiaoton University Nanchan
More informationA wireless sensor network for visual detection and classification of intrusions
A wireless sensor network for visual detection and classification of intrusions ANDRZEJ SLUZEK 1,3, PALANIAPPAN ANNAMALAI 2, MD SAIFUL ISLAM 1 1 School of Coputer Engineering, 2 IntelliSys Centre Nanyang
More informationC E R T I F I C A T E O F C O M P L I A N C E
Issued to: SIEMENS AG LOW VOLTAGE SIEMENSSTRASSE 10 93055 REGENSBURG, GERMANY This is to certify that representative samples of Motor Controllers, Manual See following pages for list of models Have been
More informationCIS-331 Exam 2 Fall 2014 Total of 105 Points. Version 1
Version 1 1. (20 Points) Given the class A network address 119.0.0.0 will be divided into a maximum of 15,900 subnets. a. (5 Points) How many bits will be necessary to address the 15,900 subnets? b. (5
More informationcm3520 cm3525 Security Function
wwwiagisticsco c3520 c3525 Security Function Contents Contents 1 Security 11 Introduction 1-2 12 Tradearks and Registered Tradearks 1-2 13 Copliance with the ISO15408 Standard 1-2 14 Operating Precautions1-2
More informationA Novel Fast Constructive Algorithm for Neural Classifier
A Novel Fast Constructive Algorith for Neural Classifier Xudong Jiang Centre for Signal Processing, School of Electrical and Electronic Engineering Nanyang Technological University Nanyang Avenue, Singapore
More informationWAVE OPTICS. Conceptual Questions Because ym
WAVE OPTICS Conceptual Questions.. The initial light pattern is a ouble-slit interference pattern. It is centere behin the ipoint of the slits. The slight ecrease in intensity going outwar fro the ile
More informationλ-harmonious Graph Colouring Lauren DeDieu
λ-haronious Graph Colouring Lauren DeDieu June 12, 2012 ABSTRACT In 198, Hopcroft and Krishnaoorthy defined a new type of graph colouring called haronious colouring. Haronious colouring is a proper vertex
More informationNode +key : int +left : Node +right : Node. root where m is either 0..1, 0..*, or * Node +key : int +left : Node +right : Node 0..
Question 1: è12 pointsè CISC323 Midter Exa Saple Solution March 19, 2003 J. Dingel Consider the following code fragent for ipleenting binary search trees. class BinSearchTree í public Node root;... í class
More informationCompiling an Honest but Curious Protocol
6.876/18.46: Advanced Cryptography May 7, 003 Lecture 1: Copiling an Honest but Curious Protocol Scribed by: Jonathan Derryberry 1 Review In previous lectures, the notion of secure ultiparty coputing was
More informationCIS-331 Spring 2016 Exam 1 Name: Total of 109 Points Version 1
Version 1 Instructions Write your name on the exam paper. Write your name and version number on the top of the yellow paper. Answer Question 1 on the exam paper. Answer Questions 2-4 on the yellow paper.
More informationShortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm
International Journal of Engineering and Technical Research (IJETR) ISSN: 31-869 (O) 454-4698 (P), Volue-5, Issue-1, May 16 Shortest Path Deterination in a Wireless Packet Switch Network Syste in University
More informationTWIN SNAKES FOR DETERMINING SEAM LINES IN ORTHOIMAGE MOSAICKING
TWIN SNAKES FOR DETERMINING SEAM LINES IN ORTHOIMAGE MOSAICKING Martin KERSCHNER Vienna University of Technoloy, Austria Institute of Photoraetry and Reote Sensin k@ipf.tuwien.ac.at KEY WORDS: orthophoto,
More informationGraphing a Reflection Image
9- Reflections oon ore State Standards G-O.. Given a geoetric figure and a rotation, reflection, or translation, draw the transfored figure.... lso G-O.., G-O.., G-O..6 MP 1, MP 3, MP Objective To find
More information4. Specifications and Additional Information
4. Specifications and Additional Information AGX52004-1.0 8B/10B Code This section provides information about the data and control codes for Arria GX devices. Code Notation The 8B/10B data and control
More informationEffective Tracking of the Players and Ball in Indoor Soccer Games in the Presence of Occlusion
Effective Tracking of the Players and Ball in Indoor Soccer Gaes in the Presence of Occlusion Soudeh Kasiri-Bidhendi and Reza Safabakhsh Airkabir Univerisity of Technology, Tehran, Iran {kasiri, safa}@aut.ac.ir
More informationLecture 2: Game Description Language
Lecture 2: Games as State Machines A Logical (GDL) 1 Finite Games Finite Environment Game world with finitely many states One initial state and one or more terminal states Fixed finite number of players
More informationColorado School of Mines. Computer Vision. Professor William Hoff Dept of Electrical Engineering &Computer Science.
Professor Willia Hoff Dept of Electrical Engineering &Coputer Science http://inside.ines.edu/~whoff/ 1 Caera Calibration 2 Caera Calibration Needed for ost achine vision and photograetry tasks (object
More informationThe Flaw Attack to the RTS/CTS Handshake Mechanism in Cluster-based Battlefield Self-organizing Network
The Flaw Attack to the RTS/CTS Handshake Mechanis in Cluster-based Battlefield Self-organizing Network Zeao Zhao College of Counication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China National
More informationMapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues
Mapping Data in Peer-to-Peer Systes: Seantics and Algorithic Issues Anastasios Keentsietsidis Marcelo Arenas Renée J. Miller Departent of Coputer Science University of Toronto {tasos,arenas,iller}@cs.toronto.edu
More informationCS 361 Meeting 8 9/24/18
CS 36 Meeting 8 9/4/8 Announceents. Hoework 3 due Friday. Review. The closure properties of regular languages provide a way to describe regular languages by building the out of sipler regular languages
More informationClustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering
Clustering Cluster Analysis of Microarray Data 4/3/009 Copyright 009 Dan Nettleton Group obects that are siilar to one another together in a cluster. Separate obects that are dissiilar fro each other into
More information1 Extended Boolean Model
1 EXTENDED BOOLEAN MODEL It has been well-known that the Boolean odel is too inflexible, requiring skilful use of Boolean operators to obtain good results. On the other hand, the vector space odel is flexible
More informationFinite Math - J-term Homework. Section Inverse of a Square Matrix
Section.5-77, 78, 79, 80 Finite Math - J-term 017 Lecture Notes - 1/19/017 Homework Section.6-9, 1, 1, 15, 17, 18, 1, 6, 9, 3, 37, 39, 1,, 5, 6, 55 Section 5.1-9, 11, 1, 13, 1, 17, 9, 30 Section.5 - Inverse
More informationSYNERGY INSTITUTE OF ENGINEERING & TECHNOLOGY,DHENKANAL LECTURE NOTES ON DIGITAL ELECTRONICS CIRCUIT(SUBJECT CODE:PCEC4202)
Lecture No:5 Boolean Expressions and Definitions Boolean Algebra Boolean Algebra is used to analyze and simplify the digital (logic) circuits. It uses only the binary numbers i.e. 0 and 1. It is also called
More information22ND CENTURY_J1.xls Government Site Hourly Rate
Escalation rate 000 AA0 Administrative Assistant Level I 000 AA0 Administrative Assistant Level II 000 AB0 Application Engineer Level I 000 AB0 Application Engineer Level II 000 AC0 Application Programmer
More informationCommunications guide. Line Distance Protection System * F1* GE Digital Energy. Title page
Title page GE Digital Energy D90 Plus Line Distance Protection System Communications guide D90 Plus firmware revision:.9x GE publication code: 60-9070-F (GEK-3469) GE Digital Energy 650 Markland Street
More informationDesign and Implementation of Business Logic Layer Object-Oriented Design versus Relational Design
Design and Ipleentation of Business Logic Layer Object-Oriented Design versus Relational Design Ali Alharthy Faculty of Engineering and IT University of Technology, Sydney Sydney, Australia Eail: Ali.a.alharthy@student.uts.edu.au
More informationA Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network
A Bea Search Method to Solve the Proble of Assignent Cells to Switches in a Cellular Mobile Networ Cassilda Maria Ribeiro Faculdade de Engenharia de Guaratinguetá - DMA UNESP - São Paulo State University
More informationAppendix 5-1: Attachment J.1 Pricing Table -1: IMS Ceiling Loaded Rates at Contractor Site
Appendix 5-1: Attachment J.1 Pricing Table -1: IMS Ceiling Loaded Rates at Contractor Site Escalation rate 4.6% 4.6% 4.6% 4.6% 4.6% 4.6% 4.6% 4.6% 4.6% 0001 AA01 Administrative Assistant Level I $51.00
More informationAreas of Difficulty Requiring Help or Assistance in the Ejs User Interface
Areas of Difficulty Requiring Help or Assistance in the Ejs User Interface The following describes the basic Ejs UI behavior and areas needing help. It is necessary to understand a bit about the Ejs UI
More informationRelief shape inheritance and graphical editor for the landscape design
Relief shape inheritance and graphical editor for the landscape design Egor A. Yusov Vadi E. Turlapov Nizhny Novgorod State University after N. I. Lobachevsky Nizhny Novgorod Russia yusov_egor@ail.ru vadi.turlapov@cs.vk.unn.ru
More informationKnowledge Discovery Applied to Agriculture Economy Planning
Knowledge Discovery Applied to Agriculture Econoy Planning Bing-ru Yang and Shao-un Huang Inforation Engineering School University of Science and Technology, Beiing, China, 100083 Eail: bingru.yang@b.col.co.cn
More informationAnalysing Real-Time Communications: Controller Area Network (CAN) *
Analysing Real-Tie Counications: Controller Area Network (CAN) * Abstract The increasing use of counication networks in tie critical applications presents engineers with fundaental probles with the deterination
More informationInteroperability/ Conformance Test dpmr Mode 2 Repeater
Interoperability/ Conforance Test dpmr Mode 2 Repeater IOP test Mode 2 Repeater Copyright 2013 dpmr Association All Rights Reserved Version 1.0 0 Revision History Version Date Change By 0v1 16 Oct 2012
More informationCIS-331 Final Exam Spring 2015 Total of 115 Points. Version 1
Version 1 1. (25 Points) Given that a frame is formatted as follows: And given that a datagram is formatted as follows: And given that a TCP segment is formatted as follows: Assuming no options are present
More informationChapter 13, Sequence Data Mining
CSI 4352, Introduction to Data Mining Chapter 13, Sequence Data Mining Young-Rae Cho Associate Professor Department of Computer Science Baylor University Topics Single Sequence Mining Frequent sequence
More informationRS 232 PINOUTS. 1. We use RJ12 for all of our RS232 interfaces (Link-2-Modbus & Link-2-PC- Serial/RS232). The diagram below shows our pin out.
RS 232 PINOUTS 1. We use RJ12 for all of our RS232 interfaces (Link-2-Modbus & Link-2-PC- Serial/RS232). The diagram below shows our pin out. 2. A DB9 Female to RJ12 Female Serial/Terminal Modular Adaptor
More informationAnalysis of the Application current X2 Interface Handover Process in LTE Technology
CITACEE 213 ISSN: 2338-5154 Analysis of the Application current X2 Interface Handover Process in LTE Technology Uke Kurniawan Usan Departent of Electrical and Telecounication Engineering Telko University
More informationDifferent criteria of dynamic routing
Procedia Coputer Science Volue 66, 2015, Pages 166 173 YSC 2015. 4th International Young Scientists Conference on Coputational Science Different criteria of dynaic routing Kurochkin 1*, Grinberg 1 1 Kharkevich
More informationCONSTRUCTIONS Introduction Division of a Line Segment
216 MATHEMATICS CONSTRUCTIONS 11 111 Introduction In Class IX, you have done certain constructions using a straight edge (ruler) and a compass, eg, bisecting an angle, drawing the perpendicular bisector
More informationRecitation Session 6
Recitation Session 6 CSE341 Computer Organization University at Buffalo radhakri@buffalo.edu March 11, 2016 CSE341 Computer Organization Recitation Session 6 1/26 Recitation Session Outline 1 Overview
More information2.6 BOOLEAN FUNCTIONS
2.6 BOOLEAN FUNCTIONS Binary variables have two values, either 0 or 1. A Boolean function is an expression formed with binary variables, the two binary operators AND and OR, one unary operator NOT, parentheses
More informationParallax Serial LCD 2 rows x 16 characters Non-backlit (#27976) 2 rows x 16 characters Backlit (#27977) 4 rows x 20 characters Backlit (#27979)
599 Menlo Drive, Suite 100 Rocklin, California 95765, USA Office: (916) 624-8333 Fax: (916) 624-8003 General: info@parallax.com Technical: support@parallax.com Web Site: www.parallax.com Educational: www.stampsinclass.com
More informationGateway Ascii Command Protocol
Gateway Ascii Command Protocol Table Of Contents Introduction....2 Ascii Commands.....3 Messages Received From The Gateway....3 Button Down Message.....3 Button Up Message....3 Button Maintain Message....4
More informationPreprocessing I: Within Subject John Ashburner
Preprocessing I: Within Subject John Ashburner Pre-processing Overview Statistics or whatever fmri tie-series Anatoical MRI Teplate Soothed Estiate Spatial Nor Motion Correct Sooth Coregister 11 21 31
More informationQoS and Sensible Routing Decisions
QoS and Sensible Routing Decisions Erol Gelenbe Dept. of Electrical & Electronic Engineering Iperial College London SW7 2BT e.gelenbe@iperial.ac.uk Abstract Network Quality of Service (QoS) criteria of
More informationPointer Analysis. Outline. Points-to Analysis as a Graph Problem. Points-to Analysis as a Graph Problem. Points-to Analysis as a Graph Problem
Pointer Analysis,,,, Rupesh Nasre. b { } CS6843 Program Analysis IIT Madras Jan 2014 4 Outline Introduction Pointer analysis as a DFA problem Design decisions,,,, Andersen's analysis, Steensgaard's analysis
More informationFINITE STATE DESCRIPTION OF COMMUNICATION PROTOCOLS*
irnper neuvork protocols. A. Danthine. editor, 'iniversite de liege. I'->7X. F3 FINITE STATE DESCRIPTION OF COMMUNICATION PROTOCOLS* Gregor V. Bochann Departeent de Matheatiques Ecole Polytechnique Federals
More informationTEST DVD-VIDEO/ DVD-ROM For Checking DVD Players, DVD Recorders and DVD Drives TDH-940
TEST DVD-VIDEO/ DVD-ROM For Checking DVD Players, DVD Recorders and DVD Drives TDH-940 Product Introduction. Purpose of use, Features TDH-940 is a Test Disc designed for confirmation of operation of DVD
More informationThe Shortest-Path Problem : G. Dantzig. 4-Shortest Paths Problems. The Shortest-Path Problem : G. Dantzig (continued)
The Shortest-Path Problem : G. Dantzig 4-Shortest Paths Problems Bruno MARTIN, University of Nice - Sophia Antipolis mailto:bruno.martin@unice.fr http://deptinfo.unice.fr/~bmartin/mathmods Problem: Find
More informationReal Time Displacement Measurement of an image in a 2D Plane
International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882 Volue 5, Issue 3, March 2016 176 Real Tie Displaceent Measureent of an iage in a 2D Plane Abstract Prashant
More informationAN ATTRIBUTE DRIVEN APPROACH FOR IMAGE REGISTRATION USING ROAD NETWORKS
AN ATTRIBUTE DRIVEN APPROACH FOR IMAGE REGISTRATION USING ROAD NETWORKS Caixia Wang, Peggy Agouris, Anthony Stefaniis Center for Earth Observing an Space Research Departent of Earth Systes an Geoinforation
More informationA simplified approach to merging partial plane images
A siplified approach to erging partial plane iages Mária Kruláková 1 This paper introduces a ethod of iage recognition based on the gradual generating and analysis of data structure consisting of the 2D
More informationCIS-331 Final Exam Spring 2016 Total of 120 Points. Version 1
Version 1 1. (25 Points) Given that a frame is formatted as follows: And given that a datagram is formatted as follows: And given that a TCP segment is formatted as follows: Assuming no options are present
More informationLec-5-HW-1, TM basics
Lec-5-HW-1, TM basics (Problem 0)-------------------- Design a Turing Machine (TM), T_sub, that does unary decrement by one. Assume a legal, initial tape consists of a contiguous set of cells, each containing
More informationREFERENCE MATERIALS. Assignment, Display, and Input Evaluates expression and assigns the result to the variable a.
a expression Assignment, Display, and Input Evaluates expression and assigns the result to the variable a. DISPLAY (expression) Displays the value of expression, followed by a space. INPUT () Accepts a
More informationImage Processing for fmri John Ashburner. Wellcome Trust Centre for Neuroimaging, 12 Queen Square, London, UK.
Iage Processing for fmri John Ashburner Wellcoe Trust Centre for Neuroiaging, 12 Queen Square, London, UK. Contents * Preliinaries * Rigid-Body and Affine Transforations * Optiisation and Objective Functions
More informationHand Gesture Recognition for Human-Computer Interaction
Journal of Coputer Science 6 (9): 002-007, 200 ISSN 549-3636 200 Science Publications Hand Gesture Recognition for Huan-Coputer Interaction S. ohaed ansoor Rooi, R. Jyothi Priya and H. Jayalakshi Departent
More informationBOOK-IT 8.0. SIP2 implementation in the Z39.70 server
BOOK-IT 8.0 2015-07-29 Axiell Sverige AB, Box 24014, 224 21 LUND. Besöksadress: Fältspatsvägen 4, 224 78 LUND Tel 046-270 04 00, e-post: axiellsverige@axiell.com, www.axiell.se Table of contents 1 Introduction...
More informationAutomatic Graph Drawing Algorithms
Autoatic Graph Drawing Algoriths Susan Si sisuz@turing.utoronto.ca Deceber 7, 996. Ebeddings of graphs have been of interest to theoreticians for soe tie, in particular those of planar graphs and graphs
More informationThe cache is 4-way set associative, with 4-byte blocks, and 16 total lines
Sample Problem 1 Assume the following memory setup: Virtual addresses are 20 bits wide Physical addresses are 15 bits wide The page size if 1KB (2 10 bytes) The TLB is 2-way set associative, with 8 total
More informationGalois Homomorphic Fractal Approach for the Recognition of Emotion
Galois Hooorphic Fractal Approach for the Recognition of Eotion T. G. Grace Elizabeth Rani 1, G. Jayalalitha 1 Research Scholar, Bharathiar University, India, Associate Professor, Departent of Matheatics,
More informationPROGRAMMABLE LOGIC DEVICES
PROGRAMMABLE LOGIC DEVICES Programmable logic devices (PLDs) are used for designing logic circuits. PLDs can be configured by the user to perform specific functions. The different types of PLDs available
More informationL Destructive interference:
SPH3UW/SPH4UI Unit 9.3 Interference of Light in Two Diensions Page 1 of 11 Notes Physics Tool box A pair of ientical point sources operating in phase prouces a syetrical pattern of constructive an estructive
More informationHow Computers Work. Processor and Main Memory. Roger Young
How Computers Work Processor and Main Memory Roger Young Copyright 2001, Roger Stephen Young All rights reserved. No part of this book may be reproduced, stored in a retrieval system, or transmitted by
More informationTriple DES and AES 192/256 Implementation Notes
Triple DES and AES 192/256 Implementation Notes Sample Password-to-Key and KeyChange results of Triple DES and AES 192/256 implementation For InterWorking Labs customers who require detailed information
More informationSPAREPARTSCATALOG: CONNECTORS SPARE CONNECTORS KTM ART.-NR.: 3CM EN
SPAREPARTSCATALOG: CONNECTORS ART.-NR.: 3CM3208201EN CONTENT SPARE CONNECTORS AA-AN SPARE CONNECTORS AO-BC SPARE CONNECTORS BD-BQ SPARE CONNECTORS BR-CD 3 4 5 6 SPARE CONNECTORS CE-CR SPARE CONNECTORS
More informationEvaluation of the Timing Properties of Two Control Networks: CAN and PROFIBUS
Evaluation of the Tiing Properties of Two Control Networs: CAN and PROFIBUS Max Mauro Dias Santos 1, Marcelo Ricardo Steer 2 and Francisco Vasques 3 1 UnilesteMG, CEP 35170-056, Coronel Fabriciano MG Brasil.
More informationAppendix C : Logs/Events
Appendix C : Logs/Events The list of log and event, alert messages that Universal AID Utility logs to AID Log and OS Log. [Event Source, Alert Type] Source Name of Event Log (only Windows) : raidsrv Alert
More informationTHE UNIVERSITY OF AUCKLAND
THE UNIVERSITY OF AUCKLAND FIRST SEMESTER, 2002 Campus: Tamaki COMPUTER SCIENCE Intelligent Active Vision (Time allowed: TWO hours) NOTE: Attempt questions A, B, C, D, E, and F. This is an open book examination.
More informationDigital Logic Design (CEN-120) (3+1)
Digital Logic Design (CEN-120) (3+1) ASSISTANT PROFESSOR Engr. Syed Rizwan Ali, MS(CAAD)UK, PDG(CS)UK, PGD(PM)IR, BS(CE)PK HEC Certified Master Trainer (MT-FPDP) PEC Certified Professional Engineer (COM/2531)
More informationCIS-331 Fall 2013 Exam 1 Name: Total of 120 Points Version 1
Version 1 1. (24 Points) Show the routing tables for routers A, B, C, and D. Make sure you account for traffic to the Internet. NOTE: Router E should only be used for Internet traffic. Router A Router
More informationVito R. Gervasi, Adam Schneider, Joshua Rocholl the Milwaukee School of Engineering, Milwaukee, Wisconsin
GEOMETRY AND PROCEDURE FOR BENCHMARKING SFF AND HYBRID FABRICATION PROCESS RESOLUTION Vito R. Gervasi, Ada Schneider, Joshua Rocholl the Milwaukee School of Engineering, Milwaukee, Wisconsin ABSTRACT Since
More informationUninformed Search. Day 1 & 2 of Search. Russel & Norvig Chap. 3. Material in part from
Uninformed Day & 2 of Russel & Norvig Chap. 3 Material in part from http://www.cs.cmu.edu/~awm/tutorials Examples of problems? The Oak Tree Informed versus Uninformed Heuristic versus Blind A Problem a
More informationAGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM
International Journal of Software Engineering & Applications (IJSEA), Vol.6, No.5, Septeber 205 AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM Xie Yang and Cheng Wushan College of Mechanical Engineering,
More informationSPARE CONNECTORS KTM 2014
SPAREPARTSCATALOG: // ENGINE ART.-NR.: 3208201EN CONTENT CONNECTORS FOR WIRING HARNESS AA-AN CONNECTORS FOR WIRING HARNESS AO-BC CONNECTORS FOR WIRING HARNESS BD-BQ CONNECTORS FOR WIRING HARNESS BR-CD
More informationQUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS
QUERY ROUTING OPTIMIZATION IN SENSOR COMMUNICATION NETWORKS Guofei Jiang and George Cybenko Institute for Security Technology Studies and Thayer School of Engineering Dartouth College, Hanover NH 03755
More informationCassia County School District #151. Expected Performance Assessment Students will: Instructional Strategies. Performance Standards
Unit 1 Congruence, Proof, and Constructions Doain: Congruence (CO) Essential Question: How do properties of congruence help define and prove geoetric relationships? Matheatical Practices: 1. Make sense
More informationA B C ((NOT A) AND B) OR C
chapter5 pg 184 1,2,6 1 Assuming that x=1 and y=2, determine the value of each of the following Boolean expressing: (x=1) AND(y=3) (x1) Not[(x=1) AND (y=2)] Answer: False True False 2 Assume
More informationFeature Based Registration for Panoramic Image Generation
IJCSI International Journal of Coputer Science Issues, Vol. 10, Issue 6, No, Noveber 013 www.ijcsi.org 13 Feature Based Registration for Panoraic Iage Generation Kawther Abbas Sallal 1, Abdul-Mone Saleh
More informationGeneral-Purpose AC Servo MELSERVO-J2-Super AC Servo Amplifier with Built-in Program Operation Functions
General-Purpose Servo MLSRVO-J-Super Servo plifier with uilt-in Progra Operation Functions MR-JS-L Type Unveiled!! The new MR-JS-L now offers built in otion prograing to coplient the advanced features
More informationExperiment 4 Boolean Functions Implementation
Experiment 4 Boolean Functions Implementation Introduction: Generally you will find that the basic logic functions AND, OR, NAND, NOR, and NOT are not sufficient to implement complex digital logic functions.
More informationClass Overview. Introduction to Artificial Intelligence COMP 3501 / COMP Lecture 2: Search. Problem Solving Agents
Class Overview COMP 3501 / COMP 4704-4 Lecture 2: Search Prof. 1 2 Problem Solving Agents Problem Solving Agents: Assumptions Requires a goal Assume world is: Requires actions Observable What actions?
More informationOverview of Compiler. A. Introduction
CMPSC 470 Lecture 01 Topics: Overview of compiler Compiling process Structure of compiler Programming language basics Overview of Compiler A. Introduction What is compiler? What is interpreter? A very
More informationCS153: Compilers Lecture 20: Register Allocation I
CS153: Copilrs Ltur 20: Ristr Alloation I Stpn Con ttps://www.sas.arvar.u/ourss/s153 Pr-lass Puzzl Wat s t iniu nur o olors n to olor a ap o t USA? Evry stat is assin on olor Aant stats ust ivn irnt olors
More informationThe Henryk Niewodniczański INSTITUTE OF NUCLEAR PHYSICS Polish Academy of Sciences ul. Radzikowskiego 152, Kraków
The Henryk Niewodniczański INSTITUT OF NUCLAR PHYSICS Polish Acadey of Sciences ul. Radzikowskiego 152, 31-342 Kraków www.ifj.edu.pl/reports/2005.htl Kraków, October 2005 Report No. 1968/D The theroluinescence
More information2010: Compilers REVIEW: REGULAR EXPRESSIONS HOW TO USE REGULAR EXPRESSIONS
2010: Compilers Lexical Analysis: Finite State Automata Dr. Licia Capra UCL/CS REVIEW: REGULAR EXPRESSIONS a Character in A Empty string R S Alternation (either R or S) RS Concatenation (R followed by
More informationOPTIMAL TIME AND SPACE COMPLEXITY ALGORITHM FOR CONSTRUCTION OF ALL BINARY TREES FROM PRE-ORDER AND POST-ORDER TRAVERSALS
OPTIMAL TIME AND SPACE COMPLEXITY ALGORITHM FOR CONSTRUCTION OF ALL BINARY TREES FROM PRE-ORDER AND POST-ORDER TRAVERSALS ADRIAN DEACONU Transilvania University of Brasov, Roania Abstract A linear tie
More informationTheoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem
Theoretical Analysis of Local Search and Siple Evolutionary Algoriths for the Generalized Travelling Salesperson Proble Mojgan Pourhassan ojgan.pourhassan@adelaide.edu.au Optiisation and Logistics, The
More informationENGINEERS ACADEMY. 7. Given Boolean theorem. (a) A B A C B C A B A C. (b) AB AC BC AB BC. (c) AB AC BC A B A C B C.
Digital Electronics Boolean Function QUESTION BANK. The Boolean equation Y = C + C + C can be simplified to (a) (c) A (B + C) (b) AC (d) C. The Boolean equation Y = (A + B) (A + B) can be simplified to
More informationLSN 4 Boolean Algebra & Logic Simplification. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology
LSN 4 Boolean Algebra & Logic Simplification Department of Engineering Technology LSN 4 Key Terms Variable: a symbol used to represent a logic quantity Compliment: the inverse of a variable Literal: a
More information