A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.21.

Slides:



Advertisements
Similar presentations
A core course on Modeling kees van Overveld Week-by-week summary.
Advertisements

1 A Core Course on Modeling Contents Functional Models The 4 Categories Approach Constructing the Functional Model Input of the Functional Model: Category.
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.10.
Some Properties of SSA Mooly Sagiv. Outline Why is it called Static Single Assignment form What does it buy us? How much does it cost us? Open questions.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.24.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.17.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Modelling - Module 1 Lecture 1 Modelling - Module 1 Lecture 1 David Godfrey.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.13.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.3.
ITEC113 Algorithms and Programming Techniques
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.16.
EG 10111/10112 Introduction to Engineering Copyright © 2009 University of Notre Dame Design optimization: optimization problem and factor of safety (F.O.S.)
CSC 160 Computer Programming for Non-Majors Chapter 2: Numbers, Expressions, and Simple Programs Prof. Adam M. Wittenstein
CSE 830: Design and Theory of Algorithms
Cost Minimization An alternative approach to the decision of the firm
Chapter 4 MATLAB Programming Logical Structures Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
©Ian Sommerville 2006Software Engineering, 8th edition. Chapter 10 Slide 1 Formal Specification.
MBA 201A Section 1. Overview  Introduction  Section Agenda -Math Review -Class Concepts (briefly) -Problem Set #1 -Answer Additional Questions.
Assumption of Homoscedasticity
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.8.
TOWARDS IDENTITY ANONYMIZATION ON GRAPHS. INTRODUCTION.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.11.
Mrs. Martinez CHS MATH DEPT.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.28.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 1 Introduction to Operations Research.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.15.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.31.
Called as the Interval Scheduling Problem. A simpler version of a class of scheduling problems. – Can add weights. – Can add multiple resources – Can ask.
Nattee Niparnan. Easy & Hard Problem What is “difficulty” of problem? Difficult for computer scientist to derive algorithm for the problem? Difficult.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.26.
An Introduction to Programming and Algorithms. Course Objectives A basic understanding of engineering problem solving process. A basic understanding of.
COMPUTER PROGRAMMING. Control Structures A program is usually not limited to a linear sequence of instructions. During its process it may repeat code.
1 Conditions Logical Expressions Selection Control Structures Chapter 5.
The art of Devising Thumnail Models Kees van Overveld for Marie Curie International PhD exchange Program.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.12.
Chapter One Section Three Evaluating limits Analytically.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.19.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.32.
1 A Core Course on Modeling     The modeling process     define conceptualize conclude execute formalize formulate purpose formulate purpose identify.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.25.
Search Techniques CS480/580 Fall Introduction Trees: – Root, parent, child, sibling, leaf node, node, edge – Single path from root to any node Graphs:
Dimensional Analysis.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.12.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.10.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.9.
CSCI-256 Data Structures & Algorithm Analysis Lecture Note: Some slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved. 32.
Chapter 8: Introduction to Hypothesis Testing. Hypothesis Testing A hypothesis test is a statistical method that uses sample data to evaluate a hypothesis.
TU/e Algorithms (2IL15) – Lecture 12 1 Linear Programming.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.2.
Training on Safe Hospitals in Disasters Module 3: Action Planning for “Safe Hospitals”
Function Notation and Making Predictions Section 2.3.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.29.
TU/e Algorithms (2IL15) – Lecture 12 1 Linear Programming.
Chapter 1: Limits, Alternatives, and Choices McGraw-Hill/IrwinCopyright © 2010 by The McGraw-Hill Companies, Inc. All rights reserved.
Chapter 2 Motion in One Dimension. Kinematics Describes motion while ignoring the external agents that might have caused or modified the motion (Dynamics.
Cost-Volume-Profit Analysis
Formal Specification.
Solver & Optimization Problems
Chapter 4 MATLAB Programming
(Additional materials)
Outline of the Chapter Basic Idea Outline of Control Flow Testing
Let's Race! Typing on the Home Row
MSIS 655 Advanced Business Applications Programming
A core Course on Modeling
A core course on Modeling kees van Overveld
Decision I (if Statement)
Tools for Implementation
Tools for Implementation
Presentation transcript:

A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.21

Formalization phase: formalize relations (cont.’d)

Functional Model : a model with ‘inputs’  ‘outputs’ Examples: purpose predict (1 ‘when …’) : input = EMPTY; output = time point purpose predict (2 ‘what if …’) : input = if-condition; output = what will happen happen purpose decide : input = decision; output = consequence purpose optimize : input = independent quantity; output = target (objective, …) output = target (objective, …)

Functional Model : a model with ‘inputs’  ‘outputs’ Examples: purpose steer/control : input = perturbations; output = difference between realized output = difference between realized and desired value and desired value purpose verify : input = EMPTY; output = succeed or fail (true or false) output = succeed or fail (true or false)

The biker’s dilemma

The biker’s dilemma: riding far, get back soon, don’t get tired

s = distance (km) t = time (hour) W = work (Joule) = F w s = c  A v 2 s = c  A v 2 s …. but do we have W=f W (t,s) or s=f s (W,t) or t=f t (s,W) ? What depends on what? The biker’s dilemma: riding far, get back soon, don’t get tired?

Unclarity about ‘what depends on what’ is a main source of confusion in functional models. To-do list method should prevent spaghetti.

Elaborate each of the 3 possibilities From conceptual model to formal model: while your purpose is not satisfied: start with quantity you need for the purpose put this on the to-do list while the todo list is not empty: take a quantity from the todo list think: what does it depend on? if depends on nothing substitute constant value else give an expression if possible, use dimensional analysis propose suitable mathematical expression think about assumptions verify dimensions add newly introduced quantities to the todo list todo list is empty: evaluate your model as long as purpose is not satisfied: repeat From conceptual model to formal model: while your purpose is not satisfied: start with quantity you need for the purpose put this on the to-do list while the todo list is not empty: take a quantity from the todo list think: what does it depend on? if depends on nothing substitute constant value else give an expression if possible, use dimensional analysis propose suitable mathematical expression think about assumptions verify dimensions add newly introduced quantities to the todo list todo list is empty: evaluate your model as long as purpose is not satisfied: repeat

Simple cases: trivial cases: W minimal t minimal s maximal s = distance travelled t = duration of the tour W = performed work F w = wind force c = constant A = area  = air density

Simple cases: trivial cases: W minimal t minimal s maximal s = distance travelled t = duration of the tour W = performed work F w = wind force c = constant A = area  = air density

Simple cases: trivial cases: W minimal: s=0  stay at home t minimal: s=0  stay at home s maximal: t   s = distance travelled t = duration of the tour W = performed work F w = wind force c = constant A = area  = air density

Case 1: biking far with little effort (s should be large, W small) Quantities needed for purpose: s, W pick s from to do list: s depends on t and v Expression: s = v t pick W from to do list: W depends on F w and s Expression: W = F w s pick F w from to do list: F w depends on c, , A and v Expression: F w = c  A v 2 pick c from list  constant pick  from list  constant pick A from list  constant pick t from list  choose pick v from list  choose Interesting cases: s = distance travelled t = duration of the tour W = performed work F w = wind force c = constant A = area  = air density

Case 2: biking with little effort and brief (W should be small, t small) Interesting cases: s = distance travelled t = duration of the tour W = performed work F w = wind force c = constant A = area  = air density Quantities needed for purpose: W, t pick W from to do list: W depends on F w and s Expression: W = F w s pick F w from to do list: F w depends on c, , A and v Expression: F w = c  A v 2 pick c from list  constant pick  from list  constant pick A from list  constant pick t from list: depends on s and v Expression: t = s/v pick s from list  choose pick v from list  choose

Case 3: biking brief and far (t should be small, s large) Interesting cases: s = distance travelled t = duration of the tour W = performed work F w = wind force c = constant A = area  = air density Quantities needed for purpose: t, s pick t from to do list: t depends on v and s Expression: t=s/v pick v from list  choose pick s from list  choose (notice: W is irrelevant, and so are , A, c and F w )

Case 3: biking brief and far (t should be small, s large) Interesting cases: s = distance travelled t = duration of the tour W = performed work F w = wind force c = constant A = area  = air density Quantities needed for purpose: t, s pick t from to do list: t depends on v and s Expression: t=s/v pick v from list  choose pick s from list  choose (notice: W is irrelevant, and so are , A, c and F w )

Case 3: biking brief and far (t should be small, s large) Interesting cases: s = distance travelled t = duration of the tour W = performed work F w = wind force c = constant A = area  = air density Quantities needed for purpose: t, s pick t from to do list: t depends on v and s Expression: t=s/v pick v from list  choose pick s from list  choose (notice: W is irrelevant, and so are , A, c and F w ) alternative (if we don’t make a round trip): pick s from to do list: s depends on v and t Expression: s=v t pick v from list  choose pick t from list  choose (notice: W is irrelevant, and so are , A, c and F w )

quantities we need intermediate quantities quantities from context quantities we can choose biking far, with little effort (large s, small W) biking with little effort, and brief (small W, small t) biking brief and far (small t, large s) We need s and W; s = v t W = F w s F w = c  Av 2 c, , A t, v We need W and t; W = F w s t = s / v F w = c  Av 2 c, , A v, s We need t and s; t = s/v (nothing) (nothing) s, v Interesting cases, overview:

t v A FwFw s far, little effort W  c s v A FwFw t little effort, brief W  c v t brief, far s s

t v A FwFw s far, little effort W  c s v A FwFw t little effort, brief W  c v t brief, far s s

t v A FwFw s far, little effort W  c s v A FwFw t little effort, brief W  c v t brief, far s s

general functional model (example) quantities of category II quantities of category I quantities of category III quantities of category IV t v A FwFw s far, little effort W  c s v A FwFw t little effort, brief W  c v t brief, far s s dummy

general functional model (example) quantities of category II quantities of category I quantities of category III quantities of category IV The general Functional Model is a directed, a-cyclic graph nodes: quantities nodes: quantities arrows: dependency relations arrows: dependency relations quantities in cat.-II: only incoming arrows quantities in cat.-II: only incoming arrows quantities in cat.-I and cat.-III only outgoing arrows quantities in cat.-I and cat.-III only outgoing arrows in cat.-IV all arrows allowed in cat.-IV all arrows allowed green: cat.-I; grey: cat.-II; yellow: cat.-III; blue: cat.-IV.

general functional model (example) quantities of category II quantities of category I quantities of category III quantities of category IV Difference between cat.-I and cat.-III quantities: Cat.-III quantities are needed to evaluate the model, but cannot be determined by the modeler / designer; Cat.-III quantities are needed to evaluate the model, but cannot be determined by the modeler / designer; Example: legislature, demography, physics, economy, vendor catalogues, human conditions, … Example: legislature, demography, physics, economy, vendor catalogues, human conditions, … Challenge the demarcation between cat.-I and cat.–III for innovative design. Challenge the demarcation between cat.-I and cat.–III for innovative design.

Start the construction of the model by introducing cat.-II; Quantities that don’t depend on anything are cat.-I or cat.-III quantities; All other quantities are cat.-IV quantities. general functional model (example) quantities of category II quantities of category I quantities of category III quantities of category IV

The entire network is constructed using the scheme of chapter 4, starting with cat.-II. When the to-do list is empty, all quantities are defined in terms of cat.-I and cat.-III quantities only. general functional model (example) quantities of category II quantities of category I quantities of category III quantities of category IV

categorydepends onmeaningtypeexample I quantity that can be freely modified nothing modeler’s decisions, modifications, interventions, explorations … any physical dimensions, options, ‘tweakable’ parameters, unknowns II quantity that expresses the need (purpose) of the model I,III,IV modeler’s goals (purpose) often: ordinal (decide, optimize, steer/control, …) profit, comfort, safety, …things for interest of the stakeholder III quantity from context (not freely modifiable) nothing beyond the authonomy of the modeler any physical constants, vendor’s catalogue data, … IVauxiliary, intermediate quantity I,III,IVinternal – only needed to execute the model; values are eventually irrelevant any

categorydepends onmeaningtypeexample I quantity that can be freely modified nothing modeler’s decisions, modifications, interventions, explorations … any physical dimensions, options, ‘tweakable’ parameters, unknowns II quantity that expresses the need (purpose) of the model I,III,IV modeler’s goals (purpose) often: ordinal (decide, optimize, steer/control, …) profit, comfort, safety, …things for interest of the stakeholder III quantity from context (not freely modifiable) nothing beyond the authonomy of the modeler any physical constants, vendor’s catalogue data, … IVauxiliary, intermediate quantity I,III,IVinternal – only needed to execute the model; values are eventually irrelevant any

categorydepends onmeaningtypeexample I quantity that can be freely modified nothing modeler’s decisions, modifications, interventions, explorations … any physical dimensions, options, ‘tweakable’ parameters, unknowns II quantity that expresses the need (purpose) of the model I,III,IV modeler’s goals (purpose) often: ordinal (decide, optimize, steer/control, …) profit, comfort, safety, …things for interest of the stakeholder III quantity from context (not freely modifiable) nothing beyond the authonomy of the modeler any physical constants, vendor’s catalogue data, … IVauxiliary, intermediate quantity I,III,IVinternal – only needed to execute the model; values are eventually irrelevant any

categorydepends onmeaningtypeexample I quantity that can be freely modified nothing modeler’s decisions, modifications, interventions, explorations … any physical dimensions, options, ‘tweakable’ parameters, unknowns II quantity that expresses the need (purpose) of the model I,III,IV modeler’s goals (purpose) often: ordinal (decide, optimize, steer/control, …) profit, comfort, safety, …things for interest of the stakeholder III quantity from context (not freely modifiable) nothing beyond the authonomy of the modeler any physical constants, vendor’s catalogue data, … IVauxiliary, intermediate quantity I,III,IVinternal – only needed to execute the model; values are eventually irrelevant any

categorydepends onmeaningtypeexample I quantity that can be freely modified nothing modeler’s decisions, modifications, interventions, explorations … any physical dimensions, options, ‘tweakable’ parameters, unknowns II quantity that expresses the need (purpose) of the model I,III,IV modeler’s goals (purpose) often: ordinal (decide, optimize, steer/control, …) profit, comfort, safety, …things for interest of the stakeholder III quantity from context (not freely modifiable) nothing beyond the authonomy of the modeler any physical constants, vendor’s catalogue data, … IVauxiliary, intermediate quantity I,III,IVinternal – only needed to execute the model; values are eventually irrelevant any

purposecat.-Icat.-II predict (‘when …”)NOTHINGtime point asked for predict (‘what if …’)condition after ‘if’what is going to happen decide (e.g., design)decision quantitiesstakeholders value (profit, safety, …) steer / controlexternal perturbationdifference between desired and actual verifyNOTHINGresult of verification: true or false optimizeindependent quantityobjective quantity

purposecat.-Icat.-II predict (‘when …”)NOTHINGtime point asked for predict (‘what if …’)condition after ‘if’what is going to happen decide (e.g., design)decision quantitiesstakeholders value (profit, safety, …) steer / controlexternal perturbationdifference between desired and actual verifyNOTHINGresult of verification: true or false optimizeindependent quantityobjective quantity

purposecat.-Icat.-II predict (‘when …”)NOTHINGtime point asked for predict (‘what if …’)condition after ‘if’what is going to happen decide (e.g., design)decision quantitiesstakeholders value (profit, safety, …) steer / controlexternal perturbationdifference between desired and actual verifyNOTHINGresult of verification: true or false optimizeindependent quantityobjective quantity

purposecat.-Icat.-II predict (‘when …”)NOTHINGtime point asked for predict (‘what if …’)condition after ‘if’what is going to happen decide (e.g., design)decision quantitiesstakeholders value (profit, safety, …) steer / controlexternal perturbationdifference between desired and actual verifyNOTHINGresult of verification: true or false optimizeindependent quantityobjective quantity

purposecat.-Icat.-II predict (‘when …”)NOTHINGtime point asked for predict (‘what if …’)condition after ‘if’what is going to happen decide (e.g., design)decision quantitiesstakeholders value (profit, safety, …) steer / controlexternal perturbationdifference between desired and actual verifyNOTHINGresult of verification: true or false optimizeindependent quantityobjective quantity

purposecat.-Icat.-II predict (‘when …”)NOTHINGtime point asked for predict (‘what if …’)condition after ‘if’what is going to happen decide (e.g., design)decision quantitiesstakeholders value (profit, safety, …) steer / controlexternal perturbationdifference between desired and actual verifyNOTHINGresult of verification: true or false optimizeindependent quantityobjective quantity