A Practical Process for Simulation Component Reuse Dissertation Proposal Presentation by Robert G. Bartholet 27 May 2005.

Slides:



Advertisements
Similar presentations
Introduction to Object Orientation System Analysis and Design
Advertisements

Hadi Goudarzi and Massoud Pedram
15 th International Conference on Design Theory and Methodology 2-6 September 2003, Chicago, Illinois Intelligent Agents in Design Zbigniew Skolicki Tomasz.
Early Effort Estimation of Business Data-processing Enhancements CS 689 November 30, 2000 By Kurt Detamore.
2003 Fall SIW The Process for Coercing Simulations Sarah Waziruddin, University of Virginia David Brogan, University of Virginia Paul Reynolds, University.
NP-Complete William Strickland COT4810 Spring 2008 February 7, 2008.
Heterogeneous Data Warehouse Analysis and Dimensional Integration Marius Octavian Olaru XXVI Cycle Computer Engineering and Science Advisor: Prof. Maurizio.
University of Piraeus Department of Technology Education and Digital Systems Centre for Research and Technology - Hellas(C.E.R.T.H.) Informatics and Telematics.
Sponsored by the U.S. Department of Defense © 2005 by Carnegie Mellon University 1 Pittsburgh, PA Dennis Smith, David Carney and Ed Morris DEAS.
Presented by: Thabet Kacem Spring Outline Contributions Introduction Proposed Approach Related Work Reconception of ADLs XTEAM Tool Chain Discussion.
Background information Formal verification methods based on theorem proving techniques and model­checking –to prove the absence of errors (in the formal.
Simulation Adaptation, Composition and Reuse Paul F. Reynolds, Jr David.
20081COMMA08 – Toulouse, May 2008 The Computational Complexity of Ideal Semantics I Abstract Argumentation Frameworks Paul E. Dunne Dept. Of Computer Science.
Models and Security Requirements for IDS. Overview The system and attack model Security requirements for IDS –Sensitivity –Detection Analysis methodology.
Zach Ramaekers Computer Science University of Nebraska at Omaha Advisor: Dr. Raj Dasgupta 1.
February 23, 2015CS21 Lecture 201 CS21 Decidability and Tractability Lecture 20 February 23, 2015.
Automated Analysis and Code Generation for Domain-Specific Models George Edwards Center for Systems and Software Engineering University of Southern California.
Architecture-driven Modeling and Analysis By David Garlan and Bradley Schmerl Presented by Charita Feldman.
Design Patterns for Metamodel Design Domain-Specific Modeling Workshop Portland, Oregon October 23, 2011 Hyun Cho and Jeff Gray University of Alabama Department.
Presenter : Shih-Tung Huang Tsung-Cheng Lin Kuan-Fu Kuo 2015/6/15 EICE team Model-Level Debugging of Embedded Real-Time Systems Wolfgang Haberl, Markus.
CS 425/625 Software Engineering System Models
1 A Framework for Measurement Valérie Paulus, Miguel Lopez, Gregory Seront, Simon Alexandre.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2004 Project.
Augmenting Traditional Conceptual Models to Accommodate XML Structures Stephen W. Liddle Information Systems Department Reema Al-Kamha & David W. Embley.
1 Backdoors To Typical Case Complexity Ryan Williams Carnegie Mellon University Joint work with: Carla Gomes and Bart Selman Cornell University.
Strategic Directions in Real- Time & Embedded Systems Aatash Patel 18 th September, 2001.
ARCHITECTURAL MISMATCH Heather T. Kowalski September 5, 2000.
Lecture Nine Database Planning, Design, and Administration
Architecture and Software Product Lines A software architecture represents a significant investment of time and effort, usually by senior talent. So it.
Computer Systems & Architecture Lesson Software Product Lines.
Overview of the Database Development Process
Introduction to Adaptive Digital Filters Algorithms
Ontology Development Kenneth Baclawski Northeastern University Harvard Medical School.
By Manuel C. Salas Advisor: Dr. Bernard P. Zeigler University of Arizona 2008.
Graph Coalition Structure Generation Maria Polukarov University of Southampton Joint work with Tom Voice and Nick Jennings HUJI, 25 th September 2011.
Machines with Memory Chapter 3 (Part B). Turing Machines  Introduced by Alan Turing in 1936 in his famous paper “On Computable Numbers with an Application.
G O D D A R D S P A C E F L I G H T C E N T E R 1 Global Precipitation Measurement (GPM) GV Data Exchange Protocol Mathew Schwaller GPM Formulation Project.
© Yilmaz “Agent-Directed Simulation – Course Outline” 1 Course Outline Dr. Levent Yilmaz M&SNet: Auburn M&S Laboratory Computer Science &
A Brief Introduction to GA Theory. Principles of adaptation in complex systems John Holland proposed a general principle for adaptation in complex systems:
1 A Static Analysis Approach for Automatically Generating Test Cases for Web Applications Presented by: Beverly Leung Fahim Rahman.
Copyright 2002 Prentice-Hall, Inc. Modern Systems Analysis and Design Third Edition Jeffrey A. Hoffer Joey F. George Joseph S. Valacich Chapter 20 Object-Oriented.
© 2009 IBM Corporation 1 Improving Consolidation of Virtual Machines with Risk-aware Bandwidth Oversubscription in Compute Clouds Amir Epstein Joint work.
Author: Graham Hughes, Tevfik Bultan Computer Science Department, University of California, Santa Barbara, CA 93106, USA Source: International Journal.
Model-Driven Analysis Frameworks for Embedded Systems George Edwards USC Center for Systems and Software Engineering
April 28, 2004John C. Giordano – Masters Project Presentation1 Exploring the Constraints of Human Behavior Representation A Masters Project Presentation.
An Object-Z based Metamodel for Wright Joint work with M. Maouche 2, and M. Mosteghanemi 1 Presented by M. Bettaz 1 1 MESRS/ESI Algeria 2 Philadelphia.
Week 10Complexity of Algorithms1 Hard Computational Problems Some computational problems are hard Despite a numerous attempts we do not know any efficient.
Submodule construction in logics 1 Gregor v. Bochmann, University of Ottawa Using First-Order Logic to Reason about Submodule Construction Gregor v. Bochmann.
GREGORY SILVER KUSHEL RIA BELLPADY JOHN MILLER KRYS KOCHUT WILLIAM YORK Supporting Interoperability Using the Discrete-event Modeling Ontology (DeMO)
2004 Fall Simulation Interoperability Workshop In Search of the Philosopher’s Stone: Simulation Composability Versus Component-Based Software Design M.
1 Evaluation of TEWA in a Ground Based Air Defense Environment Presenters: Basie Kok, Andries Heyns Supervisor: Prof. Jan van Vuuren.
Review of Parnas’ Criteria for Decomposing Systems into Modules Zheng Wang, Yuan Zhang Michigan State University 04/19/2002.
ARO Workshop Wendy Roll - May 2004 Topic 4: Effects of software certification on the current balance between software/system modeling, analysis and testing.
Effective Anomaly Detection with Scarce Training Data Presenter: 葉倚任 Author: W. Robertson, F. Maggi, C. Kruegel and G. Vigna NDSS
Formal Verification. Background Information Formal verification methods based on theorem proving techniques and model­checking –To prove the absence of.
Improving System Availability in Distributed Environments Sam Malek with Marija Mikic-Rakic Nels.
George Edwards Computer Science Department Center for Systems and Software Engineering University of Southern California
National Aeronautics and Space Administration Jet Propulsion Laboratory March 17, 2009 Workflow Orchestration: Conducting Science Efficiently on the Grid.
1 Ontological Foundations For SysML Henson Graves September 2010.
Technische Universität München © Prof. Dr. H. Krcmar An Ontology-based Platform to Collaboratively Manage Supply Chains Tobias Engel, Manoj Bhat, Vasudhara.
1 The XMSF Profile Overlay to the FEDEP Dr. Katherine L. Morse, SAIC Mr. Robert Lutz, JHU APL
Model-Driven Analysis Frameworks for Embedded Systems
The Extensible Tool-chain for Evaluation of Architectural Models
Introduction Artificial Intelligent.
Logical architecture refinement
Chapter 20 Object-Oriented Analysis and Design
Modeling Teams: A General Systems Theory Approach
Automated Analysis and Code Generation for Domain-Specific Models
Chenchen Xi CNC Supervisor: Prof. John R. Gurd
A Practical Process for Simulation Component Reuse
Presentation transcript:

A Practical Process for Simulation Component Reuse Dissertation Proposal Presentation by Robert G. Bartholet 27 May 2005

2 Committee Members Worthy N. Martin, Chair Paul F. Reynolds, Jr., Advisor John C. Knight David C. Brogan Harsha K. Chelliah Ernest H. Page

3 Thesis Statement Component selection, applied to reusable simulation components, can be enhanced significantly by including considerations for the utility of component adaptation, simulation specific attributes, and other features that have not been considered in traditional approaches to component selection.

4 Thesis Statement Component selection, applied to reusable simulation components, can be enhanced significantly by including considerations for the utility of component adaptation, simulation specific attributes, and other features that have not been considered in traditional approaches to component selection.

SIMULATION COMPONENT DATABASE SIMULATION COMPONENT DEVELOPERS S1S1 S2S2 SnSn... COMPONENT SELECTION TOOL IDEAL FEDERATION REQUIREMENTS THEORY BEST PRACTICES M&S Reuse in the Ideal World

6 What is Available?

7 Software Reuse SCAVENGING S/W ARCHITECTURES TRANSFORMATION VERY HIGH LEVEL LANGUAGES APPLICATION GENERATORS S/W SCHEMAS COMPONENTS Krueger, 1992

8 Related Work Metrics and Models Component Representation Selection Techniques

9 Reuse Exemplars

10 Motivation

11 Simulation Composability Component Selection (CS) r1r1 r3r3 r4r4 r2r2 r5r5 r6r6 R x1x1 x3x3 x4x4 x8x8 x2x2 x6x6 x7x7 x5x5 r8r8 r7r7 X CS: Is there a subset of X of cardinality k or less that covers R? Example instance when k = 3. CS is NP-complete. Proof: reduction from SAT (Page and Opper 1999) and MSC (Petty et al. 2003). CS can be approximated using GREEDY (Fox et al. 2004). REQUIREMENTS COMPONENTS

12 Composability Assumptions Components are immutable. There exists a master set of components from which all possible sets of requirements can be satisfied. Requirements are known a priori and do not change. Component selection in the context of simulation composability is inflexible.

13 Thesis Statement Component selection, applied to reusable simulation components, can be enhanced significantly by including considerations for the utility of component adaptation, simulation specific attributes, and other features that have not been considered in traditional approaches to component selection.

14 Applied Simulation Component Reuse (ASCR) Leverage simulation specific characteristics in component reuse Exploit adaptability of components to satisfy requirements. What have we gained? –We no longer have to assume the existence of a master set of components. –We can more flexibly react to changing requirements. –We can pre-select components based on over-arching simulation specific requirements. But… Exploiting simulation specific characteristics and adaptation changes component selection!

15 ASCR Model BEHAVIOR DETERMINATION FUNCTION BEHAVIOR MAPPING FUNCTION UTILITY FUNCTION

16 Assumptions and Notation θ: Upper bound on the number of requirements that can be satisfied by any one component. β: scaling factor which captures the change in utility encountered when a component satisfies multiple requirements u xyz : the utility of the x th component satisfying requirement y while satisfying z-1 other requirements.

17 Adapting Components to Satisfy Requirements r1r1 r2r2 r3r3 r4r4 r5r5 r6r6 r7r7 x2x2 x2x2 x2x2 r1r1 r3r3 r4r4 r2r2 r5r5 r6r6 R x1x1 x3x3 x4x4 x8x8 x2x2 x6x6 x7x7 x5x5 r7r7 X CSCS-ASCR θ=3

18 Computing Utilities r1r1 r3r3 r4r4 r2r2 r5r5 r6r6 R x1x1 x3x3 x4x4 x8x8 x2x2 x6x6 x7x7 x5x5 r7r7 X CSCS-ASCR θ=3 r1r1 r2r2 r3r3 r4r4 r5r5 r6r6 r7r7 u 211 u 212 u 213 u 241 u 243 u 242 u 253 u 252 u 251 β reduces the number of computed utilities.

19 Building a Bin View r1r1 r2r2 r3r3 r4r4 r5r5 r6r6 r7r7 R x1x1 x2x2 x3x3 x4x4 X r1r1 r2r2 r3r3 r4r4 r5r5 r6r6 r7r7 u 111 u 221 u 112 u 222 u 223 u 113 u 321 u 322 u 323 u 331 u 332 u 333 u 432 u 431 u 433 u 441 u 442 u 443 u 251 u 252 u 253 u 461 u 462 u 463 u 261 u 262 u 263 u 171 u 172 u 173 u 371 u 372 u 373 REQUIREMENTS COMPONENTS r1r1 r2r2 r3r3 r4r4 r5r5 r6r6 r7r7 x1x1 x2x2 x3x3 x3x3 x4x4 x4x4 x2x2 x4x4 x2x2 x1x1 x3x3 θ=3

20 Building a Set View u 111 u 171 u 112 u 172 u 221 u 251 u 261 u 371 u 331 u 321 u 433 u 443 u 463 u 432 u 442 u 223 u 253 u 263 u 252 u 262 u 322 u 372 u 323 u 333 u 373 u 431 u 461 u 441 u 222 u 252 u 222 u 262 u 332 u 372 u 332 u 322 u 442 u 462 u 432 C1C1 C2C2 C3C3 C4C4 C r1r1 r2r2 r3r3 r4r4 r5r5 r6r6 r7r7 u 111 u 221 u 112 u 222 u 223 u 113 u 321 u 322 u 323 u 331 u 332 u 333 u 432 u 431 u 433 u 441 u 442 u 443 u 251 u 252 u 253 u 461 u 462 u 463 u 261 u 262 u 263 u 171 u 172 u 173 u 371 u 372 u 373 Scenario for x 2

21 CS-ASCR Definition r1r1 r2r2 r3r3 r4r4 r5r5 r6r6 r7r7 R u 111 u 171 u 112 u 172 u 221 u 251 u 261 u 371 u 331 u 321 u 433 u 443 u 463 u 432 u 442 u 223 u 253 u 263 u 252 u 262 u 322 u 372 u 323 u 333 u 373 u 431 u 461 u 441 u 222 u 252 u 222 u 262 u 332 u 372 u 332 u 322 u 442 u 462 u 432 C1C1 C2C2 C3C3 C4C4 C CS-ASCR (Informal): Is there an exact cover of R, constructed by choosing no more than 1 element from each C i, with a total utility greater than k? CS-ASCR is NP-complete (Bartholet et al. submitted to ACM/IEEE WSC 2005). Proof: By reduction from X3C. Optimization problem is NP-hard.

22 Interesting Effects of θ and β θ θ = 1, CS-ASCR is in P θ = 2, complexity of CS-ASCR is open θ >= 3 but bounded, CS-ASCR is NP-complete θ is unbounded, CS-ASCR is exponential β β =1, CS-ASCR is in P

23 Generalizing the Result r1r1 r2r2 r3r3 r4r4 r5r5 r6r6 r7r7 r8r8 θ=3 x1x1 x3x3 x6x6 x6x6 x4x4 x2x2 Modified definition of θ: utility can be dependent on selection of other components. x6x6 x7x7 x6x6 CS-ASCR-X: ASCR component selection with the modified θ. Corollary: CS-ASCR-X when θ >= 3 is at least NP-complete (by reduction from X3C).

24 Leveraging Simulation Properties Stochastic sampling Time Event generation

25 Requirement 1: Model ground combat. Requirement 2: Model air combat. Requirement A: Provide up-to-date conflict adjudication data no less than once per minute. Example of Leveraging Time XX X MODEL GC1 MODEL GC2 MODEL AC1 LANCHESTER ATTRITION CALCULATED EVERY HOUR OF LOGICAL TIME STOCHASTIC ATTRITION AGGREGATED EVERY 10 MINUTES OF LOGICAL TIME STOCHASTIC ATTRITION AGGREGATED EVERY 5 MINUTES OF LOGICAL TIME LOW UTILITY HIGH UTILITY HIGH UTILITY

26 Example of Leveraging Time PRE-SELECTION MODEL AC1 MODEL GC2 TIME SCALE FACTORED INTO COMPONENT SELECTION

27 Research Areas of Focus Define the problem Define the process Characterize complexity of ASCR Component selection Sim Specific Characteristics Adaptation

28 Measures of Success Accurately formalized ASCR problem Defined a practical ASCR process Built practical methods for component selection Developed useful utility functions Analyzed complexity of critical algorithms in ASCR

29 Expected Contributions Creation of a methodology that significantly improves state of simulation component reuse and provides practical methods for component selection Improved understanding of complexity of component selection Demonstration of how simulation specific properties can be leveraged in component selection

30 Publication Efforts Bartholet, Brogan, Reynolds, Carnahan. In Search of the Philosopher's Stone: Simulation Composability Versus Component Based Software Design. Proceedings of the Fall 2004 Simulation Interoperability Workshop, Orlando, FL, September Brogan, Reynolds, Bartholet, Carnahan, Loitière. Semi-automated Simulation Transformation for DDDAS. Proceedings of the 5th International Conference on Computational Science, Atlanta, GA, May Bartholet, Reynolds, Brogan. The Computational Complexity of Component Selection in Simulation Reuse. Submitted to the ACM/IEEE 2005 Winter Simulation Conference, Orlando, FL, December Bartholet, Kuang, Son. Intelligent Decentralized Update Management in Real-Time Embedded Applications. Working Draft Completed. Submission in August 2005 to conference TBD.

31 Conclusion Component selection, applied to reusable simulation components, can be enhanced significantly by including considerations for the utility of component adaptation, simulation specific attributes, and other features that have not been considered in traditional approaches to component selection.

Discussion