1 Dynamic Scan Scheduling Specification Bruno Dutertre System Design Laboratory SRI International

Slides:



Advertisements
Similar presentations
Modeling of Data. Basic Bayes theorem Bayes theorem relates the conditional probabilities of two events A, and B: A might be a hypothesis and B might.
Advertisements

Axxom: What happened so far. Basic case study  lacquer production scheduling  3 recipes for lacquers,  specifying processing steps,  resources used.
Mining Compressed Frequent- Pattern Sets Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng Department of Computer Science University of Illinois at Urbana-Champaign.
Learning Trajectory Patterns by Clustering: Comparative Evaluation Group D.
Fast Algorithms For Hierarchical Range Histogram Constructions
CmpE 104 SOFTWARE STATISTICAL TOOLS & METHODS MEASURING & ESTIMATING SOFTWARE SIZE AND RESOURCE & SCHEDULE ESTIMATING.
Acoustic design by simulated annealing algorithm
Budapest May 27, 2008 Unifying mixed linear models and the MASH algorithm for breakpoint detection and correction Anders Grimvall, Sackmone Sirisack, Agne.
A system Performance Model Instructor: Dr. Yanqing Zhang Presented by: Rajapaksage Jayampthi S.
Gossip Scheduling for Periodic Streams in Ad-hoc WSNs Ercan Ucan, Nathanael Thompson, Indranil Gupta Department of Computer Science University of Illinois.
Resource Management for Real-Time Environments Instructor: Dr. Subra Ganesan Presented by: Pooja Mehta Date: 10/16/06.
Resource Management of Highly Configurable Tasks April 26, 2004 Jeffery P. HansenSourav Ghosh Raj RajkumarJohn P. Lehoczky Carnegie Mellon University.
May 31, 2009 Industrial Engineering Research Conference Slide 1 Scheduling Radar Warning Receivers (RWRs) Scott R. Schultz Mercer University / Mercer.
Presenter: David Fleeman { D. Juedes, F. Drews, L. Welch and D. Fleeman Center for Intelligent, Distributed & Dependable.
Spie98-1 Evolutionary Algorithms, Simulated Annealing, and Tabu Search: A Comparative Study H. Youssef, S. M. Sait, H. Adiche
Pattern Recognition and Machine Learning
HMM-BASED PATTERN DETECTION. Outline  Markov Process  Hidden Markov Models Elements Basic Problems Evaluation Optimization Training Implementation 2-D.
Audit Sampling for Tests of Controls and Substantive Tests of Transactions Chapter 15.
A Heuristic Bidding Strategy for Multiple Heterogeneous Auctions Patricia Anthony & Nicholas R. Jennings Dept. of Electronics and Computer Science University.
Paper Title Your Name CMSC 838 Presentation. CMSC 838T – Presentation Motivation u Problem paper is trying to solve  Characteristics of problem  … u.
Video summarization by video structure analysis and graph optimization M. Phil 2 nd Term Presentation Lu Shi Dec 5, 2003.
Development of Empirical Models From Process Data
Location Systems for Ubiquitous Computing Jeffrey Hightower and Gaetano Borriello.
Similar Sequence Similar Function Charles Yan Spring 2006.
Kalman Filtering Jur van den Berg. Kalman Filtering (Optimal) estimation of the (hidden) state of a linear dynamic process of which we obtain noisy (partial)
Protein Sequence Comparison Patrice Koehl
Statistical Analysis of Systematic Errors and Small Signals Reinhard Schwienhorst University of Minnesota 10/26/99.
1 Assessment of Imprecise Reliability Using Efficient Probabilistic Reanalysis Farizal Efstratios Nikolaidis SAE 2007 World Congress.
Marsis Ground Processing Overview and Data Analysis Approach M. Cartacci, A. Cicchetti, R. Noschese, S. Giuppi Madrid
Face Alignment Using Cascaded Boosted Regression Active Shape Models
Operations Research Models
Chapter 7 Estimation: Single Population
Particle Filtering in Network Tomography
WALES, Ltd. System Level Radar Search Optimization - 1/20 MAY 2010 UNCLASSIFIED SYSTEM LEVEL RADAR SEARCH OPTIMIZATION SYSTEM LEVEL RADAR SEARCH OPTIMIZATION.
Da Yan, Zhou Zhao and Wilfred Ng The Hong Kong University of Science and Technology.
Sequence analysis: Macromolecular motif recognition Sylvia Nagl.
Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and David H.C. Du Dept. of.
© 2010 AT&T Intellectual Property. All rights reserved. AT&T, the AT&T logo and all other AT&T marks contained herein are trademarks of AT&T Intellectual.
Various topics Petter Mostad Overview Epidemiology Study types / data types Econometrics Time series data More about sampling –Estimation.
Timed Test Cases Generation Based on MSC-2000 Test Purposes Abdeslam En-Nouaary and Gang Liu Department of Electrical and Computer Engineering Concordia.
Digital Image Processing Lecture 18: Segmentation: Thresholding & Region-Based Prof. Charlene Tsai.
MURI: Integrated Fusion, Performance Prediction, and Sensor Management for Automatic Target Exploitation 1 Dynamic Sensor Resource Management for ATE MURI.
Energy-Efficient Signal Processing and Communication Algorithms for Scalable Distributed Fusion.
HMMs for alignments & Sequence pattern discovery I519 Introduction to Bioinformatics.
December 9, 2014Computer Vision Lecture 23: Motion Analysis 1 Now we will talk about… Motion Analysis.
1 Distribution Statement “A” (Approved for Public Release, Distribution Unlimited)5/15/2012 Advanced Radio Frequency Mapping (RadioMap) Dr. John Chapin.
Resource Mapping and Scheduling for Heterogeneous Network Processor Systems Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinha, Arunabha Sen and Andrea.
August 27, 2012 ETM 607 Slide 1 ETM 607 Application of Monte Carlo Simulation: Scheduling Radar Warning Receivers (RWRs) Scott R. Schultz Mercer University.
A Passive Approach to Sensor Network Localization Rahul Biswas and Sebastian Thrun International Conference on Intelligent Robots and Systems 2004 Presented.
Research © 2008 Yahoo! Generating Succinct Titles for Web URLs Kunal Punera joint work with Deepayan Chakrabarti and Ravi Kumar Yahoo! Research.
On Coding for Real-Time Streaming under Packet Erasures Derek Leong *#, Asma Qureshi *, and Tracey Ho * * California Institute of Technology, Pasadena,
 Present by 陳群元.  Introduction  Previous work  Predicting motion patterns  Spatio-temporal transition distribution  Discerning pedestrians  Experimental.
Learning and Acting with Bayes Nets Chapter 20.. Page 2 === A Network and a Training Data.
Basic Machine Learning: Clustering CS 315 – Web Search and Data Mining 1.
Background 2 Outline 3 Scopus publications 4 Goal and a signal model 5Harmonic signal parameters estimation.
Nonlinear differential equation model for quantification of transcriptional regulation applied to microarray data of Saccharomyces cerevisiae Vu, T. T.,
U of Minnesota DIWANS'061 Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and.
1 On the Channel Capacity of Wireless Fading Channels C. D. Charalambous and S. Z. Denic School of Information Technology and Engineering, University of.
Measure of System Effectiveness Missile Defense System By Alfred Terris UNCL:ASSIFIED1.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
Discovering Musical Patterns through Perceptive Heuristics By Oliver Lartillot Presentation by Ananda Jacobs.
PDEVS Protocol Performance Prediction using Activity Patterns with Finite Probabilistic DEVS DEMO L. Capocchi, J.F. Santucci, B.P. Zeigler University of.
©2012 Prentice Hall Business Publishing, Auditing 14/e, Arens/Elder/Beasley Audit Sampling for Tests of Controls and Substantive Tests of Transactions.
Implementing Interval Algebra to Schedule Mechanically Scanned Multistatic Radars Richard W Focke (CSIR & UCT) Leon O Wabeke (CSIR) J Pieter de Villiers.
Tailoring the ESS Reliability and Availability needs to satisfy the users Enric Bargalló WAO October 27, 2014.
DISPLACED PHASE CENTER ANTENNA SAR IMAGING BASED ON COMPRESSED SENSING Yueguan Lin 1,2,3, Bingchen Zhang 1,2, Wen Hong 1,2 and Yirong Wu 1,2 1 National.
RE-Tree: An Efficient Index Structure for Regular Expressions
Scheduling Radar Warning Receivers (RWRs)
Dr. Arslan Ornek MATHEMATICAL MODELS
Optimization under Uncertainty
Presentation transcript:

1 Dynamic Scan Scheduling Specification Bruno Dutertre System Design Laboratory SRI International

2 Dynamic Scan Scheduler EW Receiver Signal & Data Processing Schedule Construction Assessment Performance Requirements Detected Pulses Detected Emitters External Parameters Assessment function: determines when rescheduling is required specifies requirements for the new schedule Schedule-construction function: generates a schedule that meets the requirements under real-time constraints Scan Schedule

3 DSS Specification Objective: Determine requirements for the schedule- construction function (on a single platform) Key Issues: Schedule representation Metrics for expressing performance requirements and measuring schedule performance

4 Schedule Representation Strongly periodic schedules: Defined by pairs dwell time/revisit time for each frequency band Feasibility results show that this is too restrictive Pattern-based schedules: Defined by a basic pattern repeated periodically The pattern describes a finite list of successive dwell intervals Pattern Dwell interval

5 Performance Metrics Two emitter types: Search and track radars produce successive illuminations (rotating beams) Missile radars continuously illuminate their target In both cases, detection and tracking require intercepting a minimal number M of pulses in a single dwell Good performance requires a high probability of intercepting M or more pulses in dwell intervals

6 Periodic-Illumination Emitters First Metric: Coverage The probability of intercepting at least M pulses from a single illumination: , m : emitter parameters L, n, A: parameters derived from the schedule pattern This gives an estimate of how well the schedule does at detecting an illumination from an emitter not already detected

7 Extensions of Coverage The previous metric can be generalized to Coverage with respect to successive illuminations (probability of detecting an emitter after a few illuminations) Relative coverage: estimate of how good the schedule is for tracking already detected emitters (uses information about the likely time of occurrence of future illuminations) Probabilistic coverage: to deal with emitters whose characteristics are not known with exactitude, but with some probability distribution All these metrics can be computed from the schedule pattern

8 Metric for Continuous Emitters Requirements for continuous emitters: A good schedule must minimize detection delays Associated metric: Expected delay between the activation of the emitter and the interception of at least M pulses in a single dwell:  : pulse repetition interval of the emitter L, n, : parameters derived from the schedule pattern

9 Global Performance Constraints We can partition emitters in two classes: Emitters already detected (that need to be tracked) Emitters likely to be present (that need to be searched for) This gives three sets of constraints on the scan schedule: Tracking constraints: maximize the relative coverage for each tracked emitter Searching constraints for continuous emitters: minimize the expected detection delay for each probable emitter Searching constraints for periodic emitters: maximize coverage for each probable emitter

10 Conclusion New results: Analysis of scan-schedule performance Metrics for evaluation of pattern-based schedules Requirements for a schedule-construction algorithm Future work: Algorithm development and experimentation Extension to the multi-platform case