2003 Fall SIW The Process for Coercing Simulations Sarah Waziruddin, University of Virginia David Brogan, University of Virginia Paul Reynolds, University.

Slides:



Advertisements
Similar presentations
Algorithm Analysis Input size Time I1 T1 I2 T2 …
Advertisements

TOPIC : SYNTHESIS DESIGN FLOW Module 4.3 Verilog Synthesis.
PARAMETER ESTIMATION FOR ODES USING A CROSS-ENTROPY APPROACH Wayne Enright Bo Wang University of Toronto.
A System to Generate Test Data and Symbolically Execute Programs Lori A. Clarke September 1976.
Kinematic Synthesis of Robotic Manipulators from Task Descriptions June 2003 By: Tarek Sobh, Daniel Toundykov.
Particle Swarm Optimization
Fast Algorithms For Hierarchical Range Histogram Constructions
Inpainting Assigment – Tips and Hints Outline how to design a good test plan selection of dimensions to test along selection of values for each dimension.
Lecture # 2 : Process Models
Solutions for Scheduling Assays. Why do we use laboratory automation? Improve quality control (QC) Free resources Reduce sa fety risks Automatic data.
Artificial Intelligence in Game Design Introduction to Learning.
ENGINEERING OPTIMIZATION
Resource Management of Highly Configurable Tasks April 26, 2004 Jeffery P. HansenSourav Ghosh Raj RajkumarJohn P. Lehoczky Carnegie Mellon University.
Planning under Uncertainty
MAE 552 – Heuristic Optimization Lecture 6 February 6, 2002.
Chapter 2: Algorithm Discovery and Design
Solving the Protein Threading Problem in Parallel Nocola Yanev, Rumen Andonov Indrajit Bhattacharya CMSC 838T Presentation.
Chapter 3: The Efficiency of Algorithms
1 Simple Linear Regression Chapter Introduction In this chapter we examine the relationship among interval variables via a mathematical equation.
Optimized Numerical Mapping Scheme for Filter-Based Exon Location in DNA Using a Quasi-Newton Algorithm P. Ramachandran, W.-S. Lu, and A. Antoniou Department.
Backtracking Reading Material: Chapter 13, Sections 1, 2, 4, and 5.
Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill Technology Education Copyright © 2006 by The McGraw-Hill Companies,
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
Query Planning for Searching Inter- Dependent Deep-Web Databases Fan Wang 1, Gagan Agrawal 1, Ruoming Jin 2 1 Department of Computer.
Intrusion and Anomaly Detection in Network Traffic Streams: Checking and Machine Learning Approaches ONR MURI area: High Confidence Real-Time Misuse and.
Chapter 5 Algorithm Analysis 1CSCI 3333 Data Structures.
Testing. Definition From the dictionary- the means by which the presence, quality, or genuineness of anything is determined; a means of trial. For software.
1 Hybrid methods for solving large-scale parameter estimation problems Carlos A. Quintero 1 Miguel Argáez 1 Hector Klie 2 Leticia Velázquez 1 Mary Wheeler.
CBR for Design Upmanyu Misra CSE 495. Design Research Develop tools to aid human designers Automate design tasks Better understanding of design Increase.
Process Flowsheet Generation & Design Through a Group Contribution Approach Lo ï c d ’ Anterroches CAPEC Friday Morning Seminar, Spring 2005.
Chapter 11 – Neural Networks COMP 540 4/17/2007 Derek Singer.
Numerical Methods Applications of Loops: The power of MATLAB Mathematics + Coding 1.
A Practical Process for Simulation Component Reuse Dissertation Proposal Presentation by Robert G. Bartholet 27 May 2005.
Choosing Sample Size for Knowledge Tracing Models DERRICK COETZEE.
Designing and Debugging Batch and Interactive COBOL Programs Chapter 5.
Testing Workflow In the Unified Process and Agile/Scrum processes.
1 [3] Jorge Martinez-Bauset, David Garcia-Roger, M a Jose Domenech- Benlloch and Vicent Pla, “ Maximizing the capacity of mobile cellular networks with.
Particle Filters for Shape Correspondence Presenter: Jingting Zeng.
A performance evaluation approach openModeller: A Framework for species distribution Modelling.
Scientific Writing Abstract Writing. Why ? Most important part of the paper Number of Readers ! Make people read your work. Sell your work. Make your.
Predictive Design Space Exploration Using Genetically Programmed Response Surfaces Henry Cook Department of Electrical Engineering and Computer Science.
CSIS 123A Lecture 9 Recursion Glenn Stevenson CSIS 113A MSJC.
Christoph F. Eick: Using EC to Solve Transportation Problems Transportation Problems.
© 2011 Autodesk Freely licensed for use by educational institutions. Reuse and changes require a note indicating that content has been modified from the.
2004 Fall Simulation Interoperability Workshop In Search of the Philosopher’s Stone: Simulation Composability Versus Component-Based Software Design M.
Controlling the Behavior of Swarm Systems Zachary Kurtz CMSC 601, 5/4/
Joseph Xu Soar Workshop Learning Modal Continuous Models.
November 29, 2011 Final Presentation. Team Members Troy Huguet Computer Engineer Post-Route Testing Parker Jacobs Computer Engineer Post-Route Testing.
Chapter 2-OPTIMIZATION
JigCell Nicholas A. Allen*, Kathy C. Chen**, Emery D. Conrad**, Ranjit Randhawa*, Clifford A. Shaffer*, John J. Tyson**, Layne T. Watson* and Jason W.
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
U of Minnesota DIWANS'061 Energy-Aware Scheduling with Quality of Surveillance Guarantee in Wireless Sensor Networks Jaehoon Jeong, Sarah Sharafkandi and.
Optimization in Engineering Design 1 Introduction to Non-Linear Optimization.
21/1/ Analysis - Model of real-world situation - What ? System Design - Overall architecture (sub-systems) Object Design - Refinement of Design.
Computacion Inteligente Least-Square Methods for System Identification.
1 Chapter 5 Branch-and-bound Framework and Its Applications.
© 2009 Artisan Software Tools. All rights reserved. Testing Solutions with UML/SysML Andrew Stuart, Matthew Hause.
On the Relation Between Simulation-based and SAT-based Diagnosis CMPE 58Q Giray Kömürcü Boğaziçi University.
Algorithms and Problem Solving
Regression Testing with its types
LPV: a new technique, based on linear programming, to formally prove or disprove safety properties J-L Lambert, valiosys.
HCI in the software process
Designing and Debugging Batch and Interactive COBOL Programs
Chapter 3: The Efficiency of Algorithms
HCI in the software process
Chapter 3: The Efficiency of Algorithms
دانشگاه صنعتي اميركبير
HCI in the software process
Human Computer Interaction Lecture 14 HCI in Software Process
Topology Optimization through Computer Aided Software
Presentation transcript:

2003 Fall SIW The Process for Coercing Simulations Sarah Waziruddin, University of Virginia David Brogan, University of Virginia Paul Reynolds, University of Virginia

2003 Fall SIW Motivation Facilitate the reuse process Simulation reuse is highly desirable Reuse may occur: Modify a simulation to achieve a different set of objectives Perhaps change resolutions Compose simulations to meet an arbitrary objective

2003 Fall SIW User Composability Concept of Operations CONSTRUCTION AND EVALUATION Options for Composed Models Module Repositories USER SEARCH Issue: 1)Interoperability 2)Constraints “I have a need “I have a solution!” Selected modules REQUIREMENTS CAPTURE Issue: What should these modules contain Issue: How do requirements relate to module functionality (Translate user requirements into model requirements) Ernest Page, “Observations on the Complexity of Composable Simulation” In Proceedings of Winter Simulation Conference, December 1999 in Phoenix, AZ If interoperability of selected modules is an issue, coercion offers a potential solution.

2003 Fall SIW The Goals of Coercion Increase efficiency of the reuse process Provide tools that lead to new insight about the simulated phenomenon Increase the practitioners' confidence in the model

2003 Fall SIW P: The Coercion Process P Requirements Coerced Simulation Simulation to reuse Practitioners

2003 Fall SIW An Example Bicyclist: Slower and More Accurate Model P Coerced Particle: Relatively Fast and Accurate Model Particle: Faster and Less Accurate Model Trajectory Bicyclist Particle

2003 Fall SIW P: The Coercion Process P = [m*, o*]* Some Example Sequences: m, o, m, o o, o, m, m, o, m m o

2003 Fall SIW P: The Coercion Process Explained Identify Flexible Elements Set Constraints Define Objective Function Select Optimization Technique Run Optimizer Identify Functionality to Modify Make Modification Done No Yes Successful Coercion? Run optimizer or modify? Evaluate Modify Optimize Identify Flexible Elements Set Constraints Define Objective Function Select Optimization Technique Run Optimizer Identify Functionality to Modify Make Modification Done No Yes o m Successful Coercion? Run optimizer or modify?

2003 Fall SIW O: Optimization Step Need a human in the loop for the initial tasks Utilize optimization technology to automate coercion Identify Flexible Elements Set Constraints Define Objective Function Select Optimization Technique Run Optimizer

2003 Fall SIW M: Modification Step Modify or augment the existing algorithm of the simulation Identify Functionality to Modify Make Modification

2003 Fall SIW Evaluation The practitioner determines if coerced simulation meets requirement The initial simulation’s output is encoded as a behavior: S 0  B 0 The coerced simulation’s output is encoded as a behavior: S n  B n The requirement is encoded as a behavior, B target Successful Coercion?

2003 Fall SIW Evaluation Function B target  B n An infinite B n can satisfy this relationship B target Bn B target Bn

2003 Fall SIW Paths to Coercion S0S0 S0S0.. S0S0 SnBnSnBn SnSn SnSn..

2003 Fall SIW Possible Scenarios O  O The optimizer fails to converge The optimizer gets stuck in a local minima Discontinuity, non- linear, large search space O  M When successive optimizations fails to yield successful coercion Modification may be needed to eliminate non-linearities, discontinuities, etc.

2003 Fall SIW Possible Scenarios M  O Modification may lead to discovery of new flexible elements The optimal values for the flexible elements may change due to the modification M  M Optimization is too costly/impossible

2003 Fall SIW An Example S 0 = f(x) = y = -0.25x Requirement = g(x) = y = sine(x) Define B target by specifying 16 sample points:

2003 Fall SIW An Example

2003 Fall SIW O  O  M  O  M  O First Iteration: Optimization Motivation: We want as much automation as possible Initial tasks: Identify flexible elements: The slope and y- intercept Set constraints: None Define the objective function: Choose an optimization technique: Linear regression

2003 Fall SIW O  O  M  O  M  O

2003 Fall SIW O  O  M  O  M  O Flexible elements: Slope and y-intercept have values of 0 Objective function: Value of 0 (no error) but B target has not been met Insight: Individual errors sum to 0 four have an error of zero, four have an error of, four have an error of, two have an error of one, and two have an error of negative one Next Iteration: Modify objective function

2003 Fall SIW O  O  M  O  M  O Second Iteration: Optimization Motivation: Modify objective function to leverage automation Initial tasks: Identify flexible elements: The slope and y- intercept Set constraints: None Redefine the objective function: Choose an optimization technique: Linear regression

2003 Fall SIW O  O  M  O  M  O

2003 Fall SIW O  O  M  O  M  O Flexible elements: Slope and y-intercept have values of 0 Objective function: Value of Insight: Line fragments track sine curve better than a line Next Iteration: Modify the simulation to produce line fragments

2003 Fall SIW O  O  M  O  M  O Third Iteration: Modification Functionality to modify: Produce line fragments that span a parameter space of π Fourth Iteration: Optimization Motivation: Find optimal values for flexible elements in modified algorithm Initial tasks: Same as the second iteration of optimization

2003 Fall SIW O  O  M  O  M  O Line fragments do not match sample points defined by B target Objective function: Error value decreases from previous iteration Insight: Smaller line fragments track sine curve better Next Iteration: Modify the simulation to produce twice as many line fragments

2003 Fall SIW O  O  M  O  M  O Fifth Iteration: Modification Functionality to modify: Produce line fragments that span a parameter space of π/2 Sixth Iteration: Optimization Motivation: Find optimal values for flexible elements in modified algorithm Initial tasks: Same as the second iteration of optimization

2003 Fall SIW O  O  M  O  M  O

2003 Fall SIW O  O  M  O  M  O Line fragments match sample points defined by B target Objective function: Error value is 0 Practitioner verifies results using visualization tools B target   B n ; Coercion is successful! Multiple sequences can succesfully coerce this simulation to B target

2003 Fall SIW Tools available SimEx: a tool in production to aid practitioners to coerce a simulation Includes visualization, optimization and constraint specification modules

2003 Fall SIW Ongoing Work Is there a best coercion sequence? Is there a best initial simulation? Is there a best coerced simulation? Tools: Maximize human interaction in the process Identify flexible elements Visualization tools Optimization tools

2003 Fall SIW Conclusion Coercion Formally specified a semi-automated reuse process Greater insight on simulation code Greater insight on simulated phenomenon Insight leads to greater confidence in model

2003 Fall SIW Acknowledgment Defense Modeling and Simulation Office Multi-Resolution Modeling group at the University of Virginia

2003 Fall SIW Questions ?