Optimization for Atlas Reactive Engine Dunam Kim, Hokyu Kang, Yangbae Park.

Slides:



Advertisements
Similar presentations
Introduction to Hypothesis Testing
Advertisements

Markov Decision Process
Query Optimization of Frequent Itemset Mining on Multiple Databases Mining on Multiple Databases David Fuhry Department of Computer Science Kent State.
1 A Self-Tuning Configurable Cache Ann Gordon-Ross and Frank Vahid* Department of Computer Science and Engineering University of California, Riverside.
Movement-Assisted Sensor Deployment Author : Guiling Wang, Guohong Cao, Tom La Porta Presenter : Young-Hwan Kim.
Introduction to Summary Statistics
Importance Sampling. What is Importance Sampling ? A simulation technique Used when we are interested in rare events Examples: Bit Error Rate on a channel,
1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Transport Protocols.
Representing Data Elements Gayatri Gopalakrishnan.
KI Kunstmatige Intelligentie / RuG Markov Decision Processes AIMA, Chapter 17.
SUMS OF RANDOM VARIABLES Changfei Chen. Sums of Random Variables Let be a sequence of random variables, and let be their sum:
1 Patron Queuing System Team Gong Archit Agarwal Thanh Nguyen Adnan Salam.
The If/Else Statement, Boolean Flags, and Menus Page 180
Mathematics.
Elec471 Embedded Computer Systems Chapter 4, Probability and Statistics By Prof. Tim Johnson, PE Wentworth Institute of Technology Boston, MA Theory and.
Determining the Significance of Item Order In Randomized Problem Sets Zachary A. Pardos, Neil T. Heffernan Worcester Polytechnic Institute Department of.
©2003/04 Alessandro Bogliolo Background Information theory Probability theory Algorithms.
ECE 8053 Introduction to Computer Arithmetic (Website: Course & Text Content: Part 1: Number Representation.
6.1 What is Statistics? Definition: Statistics – science of collecting, analyzing, and interpreting data in such a way that the conclusions can be objectively.
Computer Science: A Structured Programming Approach Using C1 Objectives ❏ To be able to use the bitwise logical operators in programs ❏ To be able to use.
Lesson 7 - R Review of Random Variables. Objectives Define what is meant by a random variable Define a discrete random variable Define a continuous random.
Demo. Overview Overall the project has two main goals: 1) Develop a method to use sensor data to determine behavior probability. 2) Use the behavior probability.
Database Management 9. course. Execution of queries.
Poisson Probability Distributions
REVISED CONTEXTUAL LRT FOR VOICE ACTIVITY DETECTION Javier Ram’ırez, Jos’e C. Segura and J.M. G’orriz Dept. of Signal Theory Networking and Communications.
Topic 7 - Hypothesis tests based on a single sample Sampling distribution of the sample mean - pages Basics of hypothesis testing -
Ch 6 Introduction to Formal Statistical Inference
Approximate Dynamic Programming Methods for Resource Constrained Sensor Management John W. Fisher III, Jason L. Williams and Alan S. Willsky MIT CSAIL.
Tracking Irregularly Moving Objects based on Alert-enabling Sensor Model in Sensor Networks 1 Chao-Chun Chen & 2 Yu-Chi Chung Dept. of Information Management.
Testing Hypothesis That Data Fit a Given Probability Distribution Problem: We have a sample of size n. Determine if the data fits a probability distribution.
Software Engineering Laboratory, Department of Computer Science, Graduate School of Information Science and Technology, Osaka University July 21, 2008WODA.
VARIABLES, CONSTANTS, OPERATORS ANS EXPRESSION
Sample Size Determination Text, Section 3-7, pg. 101 FAQ in designed experiments (what’s the number of replicates to run?) Answer depends on lots of things;
Section 3.2 Notes Conditional Probability. Conditional probability is the probability of an event occurring, given that another event has already occurred.
Engineering Statistics Chapter 2 Special Variables 2B Poisson Distribution.
Project II Rule Optimizer for the Atlas Reactivity Engine CNT Dr. Sumi Helal Computer & Information Science & Engineering Department University.
Dr. Sudharman K. Jayaweera and Amila Kariyapperuma ECE Department University of New Mexico Ankur Sharma Department of ECE Indian Institute of Technology,
Exploiting Cache-Timing in AES: Attacks and Countermeasures Ivo Pooters March 17, 2008 Seminar Information Security Technology.
3/2003 Rev 1 I.2.12 – slide 1 of 18 Part I Review of Fundamentals Module 2Basic Physics and Mathematics Used in Radiation Protection Session 12Statistics.
Learning and Acting with Bayes Nets Chapter 20.. Page 2 === A Network and a Training Data.
1 Source Coding and Compression Dr.-Ing. Khaled Shawky Hassan Room: C3-222, ext: 1204, Lecture 7 (W5)
1 An infrastructure for context-awareness based on first order logic 송지수 ISI LAB.
Chapter 5 Probability Distributions 5-1 Overview 5-2 Random Variables 5-3 Binomial Probability Distributions 5-4 Mean, Variance and Standard Deviation.
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets Adam Kirsch, Michael Mitzenmacher, Havard University Andrea.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
Chapter ?? 7 Statistical Issues in Research Planning and Evaluation C H A P T E R.
Module 9.4 Random Numbers from Various Distributions -MC requires the use of unbiased random numbers.
1 Along & across algorithm for routing events and queries in wireless sensor networks Tat Wing Chim Department of Electrical and Electronic Engineering.
Establishing baselines Detecting a Trend What to do following a Trend How to re-baseline Life Cycle of a Trend.
1 Chapter 1: Basic Concepts Assembly Language for Intel-Based Computers, 4th edition Kip R. Irvine 9/6/2003.
Optimizing Sensor Data Acquisition for Energy-Efficient Smartphone-based Continuous Event Processing By Archan Misra (School of Information Systems, Singapore.
INTRODUCTION TO PROBLEM SOLVING
Introduction to Wireless Sensor Networks
P-values.
Introduction to Summary Statistics
Blaze - An IoT Analytics Engine
Chapter 4 – Part 3.
Chapter 14 Bitwise Operators Objectives
Properties of Random Numbers
Discrete Event Simulation - 4
Project II Rule Optimizer for the Atlas Reactivity Engine CNT
2-1 Inductive Reasoning.
A Self-Tuning Configurable Cache
This presentation will probably involve audience discussion, which will create action items. Use PowerPoint to keep track of these action items during.
Statistics 1: Introduction to Probability and Statistics
COnDITIONAL Probability
Hanford Performance Indicator Forum
Query Processing.
Path Oram An Extremely Simple Oblivious RAM Protocol
Lecture 42 Section 14.3 Mon, Nov 19, 2007
Presentation transcript:

Optimization for Atlas Reactive Engine Dunam Kim, Hokyu Kang, Yangbae Park

Table of Contents

Introduction The problems of the basic RE –PUSH only –Too much energy consumption Our objectives –To reduce accessing sensors –To fix minor bugs of the basic RE

Evaluation Shortcut Finding optimized execution plan of pulling events Steps –Enumerate all possible query-evaluation plans All possible sequences of evaluation of atomic events(terminal events) Equivalent Rules –Compute the cost for the plans Probability of each events –Pick up the plan having the minimum cost

Evaluation Shortcut (cont’d) Probability Model –P(event1) = # Occurrence / # Observation –P(~event1) = 1 - P(event1) –P(event1 ∧ event2) = P(event1) * P(event2) Example –P(S1(0,100)) * 1 + P(~S1(0,100)) * P(~S2(0,50)) * 2 + P(~S1(0,100)) * P(S2(0,50)) * 3 –[S1,S2,S3], [S1,S2,S3] –[S2,S1,S3],[S2,S3,S1] –[S3,S1,S2],[S3,S2,S1]

Evaluation Shortcut (cont’d) Formal Representation of Cost Calculation –n size of atomic events in forms of S(Number) or S[Number, Number]. n is 3 in the previous example. –Integer x truth value for each sensing event x = 011 for [S1(0,100) = FALSE, S2(0,50) = TRUE, S3(0,50) = TRUE] –M(x) minimum number of evaluation for the case x, x = 100 for [S1(0,100) = TRUE, S2(0,50) = FALSE, S3(0,50) = FALSE] –Pi probability that ith sensing event is true. For [S1(0,100), S2(0,50), S3(0,50)], P2 = P(S2(0,50)) –B(x, i) ith bit value of integer x B(x, i) = (x >> (n-i)) bitwise & 1 –Expected number of evaluation of sensing event is

Cache System Atlas Client (Reactive Engine) History Manager Cache Manager Database

Cache System (cont’d) Data History Manager –Stores all received data on the database MySQL + JDBC Driver –Provides statistical functions The number of reports in certain period Average time interval Range Standard Deviation Probability of event

Cache System (cont’d) Cache Manager –Tracks each sensor’s stability Timestamps Values –Controls PUSH/PULL mode of a sensor Additive Increase Multiplicative Decrease algorithm –Updates out-of-date caches

Cache System (cont’d)