Steiner Tree Problems with Side Constraints Using Constraint Programming
|
|
- Peregrine Dennis
- 5 years ago
- Views:
Transcription
1 Steiner Tree Problems with Side Constraints Using Constraint Programming AAAI 2016 Diego de Uña, Graeme Gange, Peter Schachte and Peter J. Stuckey February 14, 2016 University of Melbourne CIS Department
2 Table of Contents 1. Background Example of a Steiner Tree Problem The Steiner Tree Problem Constraint Programming 2. Steiner Tree Propagator Steiner Tree Propagator Some of the main ideas: Treeness Some of the main ideas: Lower bounds Diego de Uña STP with Side Constraints Using CP AAAI
3 Background
4 Example of a Steiner Tree Problem Given an electrical network, connect a given subset of the nodes with minimum cost. a b c d e f g h i j k l m Fig. 1: Base solution. All weights are 1 (solid) or (dashed). Cost 10 Diego de Uña STP with Side Constraints Using CP AAAI
5 Example of a Steiner Tree Problem Given an electrical network, connect a given subset of the nodes with minimum cost. Side constraint: for each pair of nodes there need two be 2 edge-disjoint alternative paths. b f j a c d g h k l e i m Fig. 1: Problem with side constraint between b and g Diego de Uña STP with Side Constraints Using CP AAAI
6 Example of a Steiner Tree Problem Given an electrical network, connect a given subset of the nodes with minimum cost. Side constraint: for each pair of nodes there need two be 2 edge-disjoint alternative paths. b f j a c d g h k l e i m Fig. 1: Solution (solid lines): all pairs of black nodes have at least two edge-disjoint alternative routes. Cost 17 Diego de Uña STP with Side Constraints Using CP AAAI
7 The Steiner Tree Problem Definition: Given a weighted graph G and a set M of mandatory nodes (aka terminals). Find a tree T of minimum weight s.t. all the nodes in M are in T. Proved NP-complete by Karp. Generalization of MST. Useful for: Electrical networks (Agrawal et al., 15). VLSI design (Hwang et al., 12). Phylogenetics (Winter, 187). Broadcasting (quality) (Karpinski et al., 2003).... c.f. The Steiner Tree Problem (book, (Hwang et al., 12)). Diego de Uña STP with Side Constraints Using CP AAAI
8 The STP is never pure State of the art in the pure STP achieved by (Polzin et al., 2001). Reductions remove edges that are useless. In the real world: STP is never alone. Examples: Find STP such that... Maximum/minimum degree on the nodes. Mandatory nodes must be leafs. Capacity constraint. Connectivity constraints. Diameter constrained. Geometric constraints.... anything you can imagine. and all combined! Diego de Uña STP with Side Constraints Using CP AAAI
9 Constraint Programming High-level programming paradigm: Programmer becomes a modeller. Uses a solver to solve his model. Versatile and reusable code. Fast, low memory usage. Our choice: Modelling language: MiniZinc (Nethercote et al., 2007). Solver: Chuffed (Chu, 2011). Fig. 2: Example of MiniZinc code Diego de Uña STP with Side Constraints Using CP AAAI 2016
10 Constraint Programming Solver (Schulte et al., 2008) A CP solver works by interleaving search and propagation. Search: try all possible values for all variables. = Too slow! Propagation: filter the possible values of variables to not try too many options. = Reduce the search space Example of propagation a {2, 3, 4}, b {1, 2, 3} such that a + 2b 4 a b Search: try a = 2 Propagation: a b b {1, 2, 3} Propagation: a + 2b 4 b {1, 3} Propagators DO NOT solve the problem, just filter domains. LCG: Propagators can generate explanations/clauses. Diego de Uña STP with Side Constraints Using CP AAAI
11 Steiner Tree Propagator
12 Steiner Tree Propagator Graphs in CP: Boolean variables for edges and nodes. If true part of the solution The global constraint steiner tree({n n V }, {e e E}, adj, ends, ws, w) }{{}}{{} the graph variable the graph Ensures that the solution is a tree (checks failure and propagates). Ensures the solution has cost w. Diego de Uña STP with Side Constraints Using CP AAAI
13 Some of the main ideas: Treeness mandatory undecided forbidden reachable: run DFS to detect unreachable nodes. Explain: run DFS from unreachable node find the border. e 5 e 6 e 7 n o fail e 1 n e 2 b c e 6 e 5 g e 7 e 8 d f e 3 o e 4 Fig. 3: Explaining reachability Diego de Uña STP with Side Constraints Using CP AAAI
14 Some of the main ideas: Treeness articulations: bridges and articulations must be in the solution. Explain: During Tarjan s algorithm record mandatory nodes. Run DFS s to find forbidden edges. c h d c h e 4 e 5 e c e 6 b c e 4 e 3 mandatory undecided forbidden a e 2 e 6 e 3 e 5 n b c e 1 e e 4 e 10 d g e h e 7 e 8 f Fig. 3: Explaining articulations and bridges Diego de Uña STP with Side Constraints Using CP AAAI
15 Some of the main ideas: Treeness cycle: prevent and detect cycles by maintaining a UF. Explain: fancy UF remembers connections (no path compression) can retrieve entire paths. e 4 e 5 e 2 e 4 e 5 e 3 e 1 mandatory undecided forbidden e 4 a c e 5 e 3 e 2 b n e 1 Fig. 3: Cycle prevention Diego de Uña STP with Side Constraints Using CP AAAI
16 Some of the main ideas: Lower bounds If the lower bound is higher than w, we can stop the search here. Shortest path based LB (Splb): 1) Contract 2) Connect mandatory pairs by shortest paths Explain: all mandatory edges + all forbidden edges that used to be in a shortest path Fig. 4: Contraction LB(G ) = 1 spc G (u) 2 u M Diego de Uña STP with Side Constraints Using CP AAAI
17 Some of the main ideas: Lower bounds If the lower bound is higher than w, we can stop the search here. LP based lower bound (Lplb): Solve pure STP by LP, row generation (Aneja, 180). Explain: any edge with non-zero reduced cost. W Fig. 4: Cut formulation of the STP minimize ws[e] bool(e) such that: e E W, bool(e) 1 e δ(w ) Diego de Uña STP with Side Constraints Using CP AAAI
18 Some results Conflicts Nodes Propagations Time B Splb (2) Lplb (2) Lplb (n.l) (2) Sp+Lplb (2) Nolb (2) NoProp (3) Choco (10) Table 1: Results for the GoSST. Conflicts Nodes Propagations Time B Splb Lplb Lplb (n.l) (1*) Sp+Lplb Nolb NoProp (8) Choco (3) Table 2: Results for the TSTP. Diego de Uña STP with Side Constraints Using CP AAAI
19 Some results Conflicts Nodes Propagations Time B Splb (2) Lplb (2) Lplb (n.l) (2) Sp+Lplb (2) Nolb (2) NoProp (3) Choco (10) Table 1: Results for the GoSST. Conflicts Nodes Propagations Time B05 Lplb B05 Lplb (n.l) hours Table 2: LCG can save a lot of search! Diego de Uña STP with Side Constraints Using CP AAAI
20 Some (more) results Conflicts Nodes Propagations Time ES10FST ES20FST B Splb Lplb Lplb (n.l.) Sp+Lplb Nolb NoProp (4) Choco Splb (2) Lplb Lplb (n.l) Sp+Lplb Nolb (2) NoProp (11) Choco (3) Splb (2) Lplb Lplb (n.l) (1) Sp+Lplb Nolb (2) NoProp (11) Choco (5) Table 3: Results for the pure Steiner Tree problem. Diego de Uña STP with Side Constraints Using CP AAAI
21 Conclusion Contributions: First CP approach to the problem. Tree propagator with explanations. New fast lower bounding technique based on shortest paths, with explanations. Use of LP formulation as lower bound, added explanations. Diego de Uña STP with Side Constraints Using CP AAAI
22 Thank you for your attention. Questions? Diego de Uña STP with Side Constraints Using CP AAAI
23 Proof of Splb (just in case) In a Steiner Tree, there is a path such that contains 2 terminals and only one node of degree 3 or more. Removing such path from the tree yields a tree. Do: Find 2 mandatory nodes such that they are connected by one such path. Remove that path. Repeat until no pairs are left. The cost of those paths can only be to the cost of the tree. Shortest paths are even cheaper than those paths. Because we count some paths twice, we divide by 2. Diego de Uña STP with Side Constraints Using CP AAAI
Overview on kidney exchange programs
Overview on kidney exchange programs Ana Viana et al ana.viana@inesctec.pt 11 March 2016 Outline Kidney failure: some figures. The past: deceased and living donor transplants. The present: Kidney exchange
More informationMore Examples and Applications on AVL Tree
CSCI2100 Tutorial 11 Jianwen Zhao Department of Computer Science and Engineering The Chinese University of Hong Kong Adapted from the slides of the previous offerings of the course Recall in lectures we
More informationA Bayesian Approach to Tackling Hard Computational Challenges
A Bayesian Approach to Tackling Hard Computational Challenges Eric Horvitz Microsoft Research Joint work with: Y. Ruan, C. Gomes, H. Kautz, B. Selman, D. Chickering MS Research University of Washington
More informationGRAPHS, ALGORITHMS, AND OPTIMIZATION
DISCRETE MATHEMATICS AND ITS APPLICATIONS Series Editor KENNETH H. ROSEN GRAPHS, ALGORITHMS, AND OPTIMIZATION WILLIAM KOCAY DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF MANITOBA DONALD L KREHER DEPARTMENT
More informationSteiner Minimal Trees
Steiner Minimal Trees Nonconvex Optimization and Its Applications Volume 23 Managing Editors: Panos Pardalos University of Florida, U.S.A. Reiner Horst University of Trier, Germany Advisory Board: Ding-Zhu
More informationConnectivity in a Bipolar Fuzzy Graph and its Complement
Annals of Pure and Applied Mathematics Vol. 15, No. 1, 2017, 89-95 ISSN: 2279-087X (P), 2279-0888(online) Published on 11 December 2017 www.researchmathsci.org DOI: http://dx.doi.org/10.22457/apam.v15n1a8
More informationA Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis
A Guide to Algorithm Design: Paradigms, Methods, and Complexity Analysis Anne Benoit, Yves Robert, Frédéric Vivien To cite this version: Anne Benoit, Yves Robert, Frédéric Vivien. A Guide to Algorithm
More informationMaximum Likelihood ofevolutionary Trees is Hard p.1
Maximum Likelihood of Evolutionary Trees is Hard Benny Chor School of Computer Science Tel-Aviv University Joint work with Tamir Tuller Maximum Likelihood ofevolutionary Trees is Hard p.1 Challenging Basic
More informationAn Experimental Analysis of Anytime Algorithms for Bayesian Network Structure Learning. Colin Lee and Peter van Beek University of Waterloo
An Experimental Analysis of Anytime Algorithms for Bayesian Network Structure Learning Colin Lee and Peter van Beek University of Waterloo Bayesian networks Probabilistic, directed, acyclic graphical model:
More informationCS 4365: Artificial Intelligence Recap. Vibhav Gogate
CS 4365: Artificial Intelligence Recap Vibhav Gogate Exam Topics Search BFS, DFS, UCS, A* (tree and graph) Completeness and Optimality Heuristics: admissibility and consistency CSPs Constraint graphs,
More informationLeman Akoglu Hanghang Tong Jilles Vreeken. Polo Chau Nikolaj Tatti Christos Faloutsos SIAM International Conference on Data Mining (SDM 2013)
Leman Akoglu Hanghang Tong Jilles Vreeken Polo Chau Nikolaj Tatti Christos Faloutsos 2013 SIAM International Conference on Data Mining (SDM 2013) What can we say about this list of authors? Use relational
More informationComparing Different Cycle Bases for a Laplacian Solver
Comparing Different Cycle Bases for a Laplacian Solver Kevin Deweese 1 Erik Boman 2 John Gilbert 1 1 Department of Computer Science University of California, Santa Barbara 2 Scalable Algorithms Department
More informationPART - A 1. Define Artificial Intelligence formulated by Haugeland. The exciting new effort to make computers think machines with minds in the full and literal sense. 2. Define Artificial Intelligence
More informationGrade 6 Math Circles Winter February 6/7 Number Theory - Solutions Warm-up! What is special about the following groups of numbers?
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Grade 6 Math Circles Winter 2018 - February 6/7 Number Theory - Solutions Warm-up! What is special about the following groups of numbers? Centre for Education
More informationCausal Knowledge Modeling for Traditional Chinese Medicine using OWL 2
Causal Knowledge Modeling for Traditional Chinese Medicine using OWL 2 Peiqin Gu College of Computer Science, Zhejiang University, P.R.China gupeiqin@zju.edu.cn Abstract. Unlike Western Medicine, those
More informationAutomated Conflict Detection Between Medical Care Pathways
Automated Conflict Detection Between Medical Care Pathways Philip Weber, Bosco Filho, Mark Lee, Ian Litchfield, Ruth Backman University of Birmingham, UK School of Computer Science Institute of Applied
More informationPROCEDURAL APPROACH TO MITIGATING CONCURRENTLY APPLIED CLINICAL PRACTICE GUIDELINES
PROCEDURAL APPROACH TO MITIGATING CONCURRENTLY APPLIED CLINICAL PRACTICE GUIDELINES Martin Michalowski 2, Szymon Wilk 3, Wojtek Michalowski 1, Xing Tan 1, Di Lin 4, Ken Farion 5, Subhra Mohapatra 3 MET
More informationUSING STATCRUNCH TO CONSTRUCT CONFIDENCE INTERVALS and CALCULATE SAMPLE SIZE
USING STATCRUNCH TO CONSTRUCT CONFIDENCE INTERVALS and CALCULATE SAMPLE SIZE Using StatCrunch for confidence intervals (CI s) is super easy. As you can see in the assignments, I cover 9.2 before 9.1 because
More informationIntroduction and Historical Background. August 22, 2007
1 Cognitive Bases of Behavior Introduction and Historical Background August 22, 2007 2 Cognitive Psychology Concerned with full range of psychological processes from sensation to knowledge representation
More informationAn Exact Algorithm for Side-Chain Placement in Protein Design
S. Canzar 1 N. C. Toussaint 2 G. W. Klau 1 An Exact Algorithm for Side-Chain Placement in Protein Design 1 Centrum Wiskunde & Informatica, Amsterdam, The Netherlands 2 University of Tübingen, Center for
More informationTackling Random Blind Spots with Strategy-Driven Stimulus Generation
Tackling Random Blind Spots with Strategy-Driven Stimulus Generation Matthew Ballance Mentor Graphics Corporation Design Verification Technology Division Wilsonville, Oregon matt_ballance@mentor.com Abstract
More informationWhat is AI? The science of making machines that:
What is AI? The science of making machines that: Think like humans Think rationally Act like humans Act rationally Thinking Like Humans? The cognitive science approach: 1960s ``cognitive revolution'':
More informationData mining for Obstructive Sleep Apnea Detection. 18 October 2017 Konstantinos Nikolaidis
Data mining for Obstructive Sleep Apnea Detection 18 October 2017 Konstantinos Nikolaidis Introduction: What is Obstructive Sleep Apnea? Obstructive Sleep Apnea (OSA) is a relatively common sleep disorder
More informationKidney Exchange Problem
Kidney Exchange Problem Chengwu Shen (Class of 2019, Applied Mathematics, Computer Science Minor) cshen04@email.wm.edu Abstract The demand of kidney transplants on the waiting list in US keeps increasing
More informationVolume conversions revision
Volume conversions revision Name: Remember: 1km = 1 000m 1m = 100cm 1m = 1 000mm 1cm = 10mm Answer the following questions: 1. How many millimetres are there in: a. 1cm =... mm b. 3cm =... mm c. 7cm =...
More informationSome Connectivity Concepts in Bipolar Fuzzy Graphs
Annals of Pure and Applied Mathematics Vol. 7, No. 2, 2014, 98-108 ISSN: 2279-087X (P), 2279-0888(online) Published on 30 September 2014 www.researchmathsci.org Annals of Some Connectivity Concepts in
More informationAgents and State Spaces. CSCI 446: Artificial Intelligence
Agents and State Spaces CSCI 446: Artificial Intelligence Overview Agents and environments Rationality Agent types Specifying the task environment Performance measure Environment Actuators Sensors Search
More informationResearch Methods II, Spring Term Logic of repeated measures designs
Research Methods II, Spring Term 2003 1 Logic of repeated measures designs Imagine you want to test the effect of drinking Fosters on the time it takes to respond to a light turning red. The independent
More informationNODE CONNECTIVITY AND CONDITIONAL DENSITY D. White and F. Harary. Definitions of Cohesive Sets in Social Networks
NODE CONNECTIVITY AND CONDITIONAL DENSITY D. White and F. Harary Definitions of Cohesive Sets in Social Networks The connectivity K (G) kappa of a connected graph G is the minimum number of nodes needed
More informationTumor cut segmentation for Blemish Cells Detection in Human Brain Based on Cellular Automata
Tumor cut segmentation for Blemish Cells Detection in Human Brain Based on Cellular Automata D.Mohanapriya 1 Department of Electronics and Communication Engineering, EBET Group of Institutions, Kangayam,
More informationSolving problems by searching
Solving problems by searching Chapter 3 14 Jan 2004 CS 3243 - Blind Search 1 Outline Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms 14 Jan 2004 CS 3243
More informationTemporal preprocessing of fmri data
Temporal preprocessing of fmri data Blaise Frederick, Ph.D. McLean Hospital Brain Imaging Center Scope fmri data contains temporal noise and acquisition artifacts that complicate the interpretation of
More informationA Constraint-based Approach to Medical Guidelines and Protocols
A Constraint-based Approach to Medical Guidelines and Protocols Arjen Hommersom 1, Perry Groot 1, Peter Lucas 1 Mar Marcos 2, and Begoña Martínez-Salvador 2 1 University of Nijmegen {arjenh, perry, peterl}@cs.ru.nl
More informationSide-Chain Positioning CMSC 423
Side-Chain Positioning CMSC 423 Protein Structure Backbone Protein Structure Backbone Side-chains Side-chain Positioning Given: - amino acid sequence - position of backbone in space Find best 3D positions
More informationA Comparison of Collaborative Filtering Methods for Medication Reconciliation
A Comparison of Collaborative Filtering Methods for Medication Reconciliation Huanian Zheng, Rema Padman, Daniel B. Neill The H. John Heinz III College, Carnegie Mellon University, Pittsburgh, PA, 15213,
More informationInductive Reasoning. Induction, Analogy, Metaphor & Blending. Abduction Schema. Abduction or Specific Induction
Inductive Reasoning Induction, Analogy, Metaphor & Blending How observations and beliefs support other beliefs In some ways, opposite of deductive reasoning P Q Q Therefore: P is more likely Inherently
More informationChoice of Temporal Logic Specifications. Narayanan Sundaram EE219C Lecture
Choice of Temporal Logic Specifications Narayanan Sundaram EE219C Lecture 1 CTL Vs LTL The Final Showdown 2 Why should we choose one over the other? Expressiveness Clarity/Intuitiveness Algorithmic Complexity
More informationNatural Scene Statistics and Perception. W.S. Geisler
Natural Scene Statistics and Perception W.S. Geisler Some Important Visual Tasks Identification of objects and materials Navigation through the environment Estimation of motion trajectories and speeds
More informationGrade 6 Math Circles Winter February 6/7 Number Theory
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 6 Math Circles Winter 2018 - February 6/7 Number Theory Warm-up! What is special about the following
More informationChapter 2. Knowledge Representation: Reasoning, Issues, and Acquisition. Teaching Notes
Chapter 2 Knowledge Representation: Reasoning, Issues, and Acquisition Teaching Notes This chapter explains how knowledge is represented in artificial intelligence. The topic may be launched by introducing
More informationArtificial Intelligence For Homeopathic Remedy Selection
Artificial Intelligence For Homeopathic Remedy Selection A. R. Pawar, amrut.pawar@yahoo.co.in, S. N. Kini, snkini@gmail.com, M. R. More mangeshmore88@gmail.com Department of Computer Science and Engineering,
More informationNumber of grams of fat x 9 calories per gram = Total number of calories from fat
Health professionals believe that the average American diet contains too much fat. Although there is no Recommended Daily Allowance for fat, it is recommended that fat intake be limited to 30% of the total
More informationOverview of the Scientific Process
The purposes of this lab exercise are to: Overview of the Scientific Process 1. Introduce you to the LabPro3 system, one of the tools we will use in future lab exercises, and which you may choose to use
More informationCohesion. Relational and Group. -0- Copyright 2006 Steve Borgatti. All rights reserved.
Cohesion Relational and Group Copyright 26 Steve Borgatti. All rights reserved. Relational vs Group Relational or dyadic cohesion refers to pairwise social closeness Network cohesion refers to the cohesion
More informationA parallel algorithm for optimal job shop scheduling of semi-constrained details processing on multiple machines
INSTITUTE OF INFORMATION AND COMMUNICATION TECHNOLOGIES BULGARIAN ACADEMY OF SCIENCE A parallel algorithm for optimal job shop scheduling of semi-constrained details processing on multiple machines Daniela
More informationCOMP 516 Research Methods in Computer Science. COMP 516 Research Methods in Computer Science. Research Process Models: Sequential (1)
COMP 516 Research Methods in Computer Science Dominik Wojtczak Department of Computer Science University of Liverpool COMP 516 Research Methods in Computer Science Lecture 9: Research Process Models Dominik
More informationHIV testing as the bridge between awareness and acceptance of PrEP among MSM
PA_3 #08 HIV testing as the bridge between awareness and acceptance of PrEP among MSM Tsz Ho Kwan, BSc, MIET PhD Candidate in Public Health 1 June 2017 Content Background HIV epidemiology in Hong Kong
More informationAnalyzing Spammers Social Networks for Fun and Profit
Chao Yang Robert Harkreader Jialong Zhang Seungwon Shin Guofei Gu Texas A&M University Analyzing Spammers Social Networks for Fun and Profit A Case Study of Cyber Criminal Ecosystem on Twitter Presentation:
More informationA formal model of obfuscation and negotiation for location privacy
A formal model of obfuscation and negotiation for location privacy Matt Duckham and Lars Kulik University of Melbourne Victoria 3010, Australia Pervasive 2005: Matt Duckham and Lars Kulik May 10, 2005
More informationPlan Recognition through Goal Graph Analysis
Plan Recognition through Goal Graph Analysis Jun Hong 1 Abstract. We present a novel approach to plan recognition based on a two-stage paradigm of graph construction and analysis. First, a graph structure
More informationNumber of grams of fat x 9 calories per gram = Total number of calories from fat
Health professionals believe that the average American diet contains too much fat. Although there is no recommended daily allowance for fat, it is recommended that fat intake be limited to 30% of the total
More informationAgents and State Spaces. CSCI 446: Ar*ficial Intelligence Keith Vertanen
Agents and State Spaces CSCI 446: Ar*ficial Intelligence Keith Vertanen Overview Agents and environments Ra*onality Agent types Specifying the task environment Performance measure Environment Actuators
More informationBayes Linear Statistics. Theory and Methods
Bayes Linear Statistics Theory and Methods Michael Goldstein and David Wooff Durham University, UK BICENTENNI AL BICENTENNIAL Contents r Preface xvii 1 The Bayes linear approach 1 1.1 Combining beliefs
More informationBelow are the 2018 end of year targets for Year 1-6 students to achieve a satisfactory grade (C Grade) for Science.
End of Year Targets for Science 2018 Dear Parents and Carers, Below are the 2018 end of year targets for Year 1-6 students to achieve a satisfactory grade (C Grade) for Science. End of Year Targets for
More informationA Cooperative Multiagent Architecture for Turkish Sign Tutors
A Cooperative Multiagent Architecture for Turkish Sign Tutors İlker Yıldırım Department of Computer Engineering Boğaziçi University Bebek, 34342, Istanbul, Turkey ilker.yildirim@boun.edu.tr 1 Introduction
More informationERA: Architectures for Inference
ERA: Architectures for Inference Dan Hammerstrom Electrical And Computer Engineering 7/28/09 1 Intelligent Computing In spite of the transistor bounty of Moore s law, there is a large class of problems
More informationIntro, Graph and Search
GAI Questions Intro 1. How would you describe AI (generally), to not us? 2. Game AI is really about The I of I. Which is what? Supporting the P E which is all about making the game more enjoyable Doing
More informationHoare Logic and Model Checking. LTL and CTL: a perspective. Learning outcomes. Model Checking Lecture 12: Loose ends
Learning outcomes Hoare Logic and Model Checking Model Checking Lecture 12: Loose ends Dominic Mulligan Based on previous slides by Alan Mycroft and Mike Gordon Programming, Logic, and Semantics Group
More informationChapter 6. Results. 6.1 Introduction
Chapter 6 Results 6.1 Introduction This chapter presents results of both optimization and characterization approaches. In the optimization case, we report results of an experimental study done with persons.
More informationModule 28 - Estimating a Population Mean (1 of 3)
Module 28 - Estimating a Population Mean (1 of 3) In "Estimating a Population Mean," we focus on how to use a sample mean to estimate a population mean. This is the type of thinking we did in Modules 7
More informationMyth One: The Scientific Method
Myths About Science Myth One: The Scientific Method Perhaps the most commonly held myth about the nature of science is that there is a universal scientific method, with a common series of steps that
More informationMedical Cyber-Physical Systems
Medical Cyber-Physical Systems Electrophysiology basics Lecture 10 Principles of Modeling for Cyber-Physical Systems Instructor: Madhur Behl Many thanks to: Zhihao Jiang, Houssam Abbas, and Rahul Mangharam,
More informationLaith Abu Shekha. Omar Sami. Ebaa Alzayadneh
24 Laith Abu Shekha Omar Sami Ebaa Alzayadneh Signal Transduction Please note that it s very important to refer to the slides. Introduction: Through these five lectures, we should know the basics of signal
More informationIntroduction Journal of Applied Information Science and Technology, 7:1, (2014)
Problem Solving and Decision Making: Consideration of Individual Differences in Computer Programming Skills Using Myers Briggs Type Indicator (MBTI) and Chidamber and Kemerer Java Metrics (CKJM) Ezekiel
More informationPlan Recognition through Goal Graph Analysis
Plan Recognition through Goal Graph Analysis Jun Hong 1 Abstract. We present a novel approach to plan recognition based on a two-stage paradigm of graph construction and analysis. First, a graph structure
More informationContinuous/Discrete Non Parametric Bayesian Belief Nets with UNICORN and UNINET
Continuous/Discrete Non Parametric Bayesian Belief Nets with UNICORN and UNINET R.M. Cooke 1, D. Kurowicka, A. M. Hanea, O. Morales, D. A. Ababei Department of Mathematics Delft University of Technology
More informationNature of Science and Scientific Method Guided Notes
Anything present in the environment, around the world, living, non-living everything is included in science. Science can be knowledge, science can be a fun, it can be a fact, a discovery, a law, a solved
More informationApplication of Tree Structures of Fuzzy Classifier to Diabetes Disease Diagnosis
, pp.143-147 http://dx.doi.org/10.14257/astl.2017.143.30 Application of Tree Structures of Fuzzy Classifier to Diabetes Disease Diagnosis Chang-Wook Han Department of Electrical Engineering, Dong-Eui University,
More informationMAC Sleep Mode Control Considering Downlink Traffic Pattern and Mobility
1 MAC Sleep Mode Control Considering Downlink Traffic Pattern and Mobility Neung-Hyung Lee and Saewoong Bahk School of Electrical Engineering & Computer Science, Seoul National University, Seoul Korea
More information19th AWCBR (Australian Winter Conference on Brain Research), 2001, Queenstown, AU
19th AWCBR (Australian Winter Conference on Brain Research), 21, Queenstown, AU https://www.otago.ac.nz/awcbr/proceedings/otago394614.pdf Do local modification rules allow efficient learning about distributed
More informationGraph Algorithms Introduction to Data Structures. Ananda Gunawardena 8/2/2011 1
Graph Algorithms 15-121 Introduction to Data Structures Ananda Gunawardena 8/2/2011 1 In this lecture.. Main idea is finding the Shortest Path between two points in a Graph We will look at Graphs with
More informationEpisode 7. Modeling Network Traffic using Game Theory. Baochun Li Department of Electrical and Computer Engineering University of Toronto
Episode 7. Modeling Network Traffic using Game Theory aochun Li epartment of Electrical and Computer Engineering University of Toronto Networks, Crowds, and Markets, Chapter 8 Objective in this episode
More informationPredicting Breast Cancer Survivability Rates
Predicting Breast Cancer Survivability Rates For data collected from Saudi Arabia Registries Ghofran Othoum 1 and Wadee Al-Halabi 2 1 Computer Science, Effat University, Jeddah, Saudi Arabia 2 Computer
More informationTesting the Accuracy of ECG Captured by Cronovo through Comparison of ECG Recording to a Standard 12-Lead ECG Recording Device
Testing the Accuracy of ECG Captured by through Comparison of ECG Recording to a Standard 12-Lead ECG Recording Device Data Analysis a) R-wave Comparison: The mean and standard deviation of R-wave amplitudes
More informationEinführung in Agda. Peter Thiemann. Albert-Ludwigs-Universität Freiburg. University of Freiburg, Germany
Einführung in Agda https://tinyurl.com/bobkonf17-agda Albert-Ludwigs-Universität Freiburg Peter Thiemann University of Freiburg, Germany thiemann@informatik.uni-freiburg.de 23 Feb 2018 Programs that work
More informationEfficient Feature Extraction and Classification Methods in Neural Interfaces
Using a simple decision tree model, we introduce efficient hardware architectures to predict abnormal neurological states in various disorders. Efficient Feature Extraction and Classification Methods in
More informationKnowledge Based Systems
Knowledge Based Systems Human Expert A human expert is a specialist for a specific differentiated application field who creates solutions to customer problems in this respective field and supports them
More informationYear 2 Science Curriculum
WORKING SCIENTIFICALLY L.O. TBAT ask simple questions L.O. TBAT observe closely, using simple equipment L.O.TBAT perform simple tests. L.O. TBAT identify and classify L.O. TBAT use observations and ideas
More informationGST: Step by step Build Diary page
GST: At A Glance The home page has a brief overview of the GST app. Navigate through the app using either the buttons on the left side of the screen, or the forward/back arrows at the bottom right. There
More informationFrom: AAAI-82 Proceedings. Copyright 1982, AAAI ( All rights reserved.
From: AAAI-82 Proceedings. Copyright 1982, AAAI (www.aaai.org). All rights reserved. THE ROLE OF EXPERIENCE IN DEVELOPNENT OF EXPERTISE Janet L. Kolodner School of Information and Computer Science Georgia
More informationTowards Learning to Ignore Irrelevant State Variables
Towards Learning to Ignore Irrelevant State Variables Nicholas K. Jong and Peter Stone Department of Computer Sciences University of Texas at Austin Austin, Texas 78712 {nkj,pstone}@cs.utexas.edu Abstract
More informationA Dynamic Neural Network Model of Sensorimotor Transformations in the Leech
Communicated by Richard Andersen 1 A Dynamic Neural Network Model of Sensorimotor Transformations in the Leech Shawn R. Lockery Yan Fang Terrence J. Sejnowski Computational Neurobiological Laboratory,
More informationSelective Motor Control Assessment of the Lower Extremity in Patients with Spastic Cerebral Palsy
Overview Selective Motor Control Assessment of the Lower Extremity in Patients with Spastic Cerebral Palsy Marcia Greenberg MS, PT* Loretta Staudt MS, PT* Eileen Fowler PT, PhD Selective Motor Control
More information15.053x. OpenSolver (http://opensolver.org/)
15.053x OpenSolver (http://opensolver.org/) 1 Table of Contents Introduction to OpenSolver slides 3-4 Example 1: Diet Problem, Set-Up slides 5-11 Example 1: Diet Problem, Dialog Box slides 12-17 Example
More informationBlending Psychometrics with Bayesian Inference Networks: Measuring Hundreds of Latent Variables Simultaneously
Blending Psychometrics with Bayesian Inference Networks: Measuring Hundreds of Latent Variables Simultaneously Jonathan Templin Department of Educational Psychology Achievement and Assessment Institute
More informationLecture 6. Perceptual and Motor Schemas
CS564 - Brain Theory and Artificial Intelligence Lecture 6. Perceptual and Motor Reading Assignments: TMB2:* Sections 2.1, 2.2, 5.1 and 5.2. HBTNN: Schema Theory (Arbib) [Also required] Distributed Artificial
More informationCHAPTER 6 HUMAN BEHAVIOR UNDERSTANDING MODEL
127 CHAPTER 6 HUMAN BEHAVIOR UNDERSTANDING MODEL 6.1 INTRODUCTION Analyzing the human behavior in video sequences is an active field of research for the past few years. The vital applications of this field
More informationIncreased tortuosity of pulmonary arteries in patients with pulmonary hypertension in the arteries
M. PIENN et al.: TORTUOSITY OF PULMONARY ARTERIES AND VEINS IN PH 1 Increased tortuosity of pulmonary arteries in patients with pulmonary hypertension in the arteries Michael Pienn 1,2,*, michael.pienn@lvr.lbg.ac.at
More informationEnhance micro-blogging recommendations of posts with an homophily-based graph
Enhance micro-blogging recommendations of posts with an homophily-based graph Quentin Grossetti 1,2 Supervised by Cédric du Mouza 2, Camelia Constantin 1 and Nicolas Travers 2 1 LIP6 - Université Pierre
More informationNeuro-Inspired Statistical. Rensselaer Polytechnic Institute National Science Foundation
Neuro-Inspired Statistical Pi Prior Model lfor Robust Visual Inference Qiang Ji Rensselaer Polytechnic Institute National Science Foundation 1 Status of Computer Vision CV has been an active area for over
More informationBangor University Laboratory Exercise 1, June 2008
Laboratory Exercise, June 2008 Classroom Exercise A forest land owner measures the outside bark diameters at.30 m above ground (called diameter at breast height or dbh) and total tree height from ground
More informationFeature Stamping SURFACE WATER MODELING SYSTEM. 1 Introduction. 2 Opening a Background Image
SURFACE WATER MODELING SYSTEM Feature Stamping 1 Introduction In this lesson you will learn how to use conceptual modeling techniques to create numerical models that incorporate flow control structures
More informationCHAPTER 5 WAVELET BASED DETECTION OF VENTRICULAR ARRHYTHMIAS WITH NEURAL NETWORK CLASSIFIER
57 CHAPTER 5 WAVELET BASED DETECTION OF VENTRICULAR ARRHYTHMIAS WITH NEURAL NETWORK CLASSIFIER 5.1 INTRODUCTION The cardiac disorders which are life threatening are the ventricular arrhythmias such as
More informationConstruction of Theoretical Model for Antiterrorism: From Reflexive Game Theory Viewpoint
1 Construction of Theoretical Model for Antiterrorism: From Reflexive Game Theory Viewpoint Vladimir Lefebvre, PhD University of California, Irvine Kofi Nyamekye, PhD Integrated Activity-Based Simulation
More informationThe Dynamics of Two Cognitive Heuristics for Coordination on Networks
IEEE International Conference on Social Computing / IEEE International Conference on Privacy, Security, Risk and Trust The Dynamics of Two Cognitive Heuristics for Coordination on Networks Iyad Rahwan
More informationTowards Desynchronization of Multi-hop Topologies
Towards Desynchronization of Multi-hop Topologies Julius Degesys and Radhika Nagpal School of Engineering and Applied Sciences, Harvard University E-mail: {degesys,rad}@eecs.harvard.edu Abstract In this
More informationModeling Sentiment with Ridge Regression
Modeling Sentiment with Ridge Regression Luke Segars 2/20/2012 The goal of this project was to generate a linear sentiment model for classifying Amazon book reviews according to their star rank. More generally,
More informationFoundations of Natural Language Processing Lecture 13 Heads, Dependency parsing
Foundations of Natural Language Processing Lecture 13 Heads, Dependency parsing Alex Lascarides (slides from Alex Lascarides, Henry Thompson, Nathan Schneider and Sharon Goldwater) 6 March 2018 Alex Lascarides
More informationFoundations of AI. 10. Knowledge Representation: Modeling with Logic. Concepts, Actions, Time, & All the Rest
Foundations of AI 10. Knowledge Representation: Modeling with Logic Concepts, Actions, Time, & All the Rest Wolfram Burgard, Andreas Karwath, Bernhard Nebel, and Martin Riedmiller 10/1 Contents Knowledge
More information