Models Flashcards

(60 cards)

1
Q

How are models built?

A

▪ Models are built by:
− Removing elements that are irrelevant – relevance depends on what you want to accomplish
− Abstraction of elements
− Defining relevant relations between those elements

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Abstraction - Definition

A

An abstraction is an abstract idea or term. Abstract refers to something that is disassociated from any specific instance.
▪ Abstraction can be interpreted as forming an equivalence class

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Equivalence class - Definition

A

An equivalence class is a set for which an equivalence relation holds between every pair of elements.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the equivalence class related to the question “What does it do (to something)?” called?

A

A function

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Function - Definition

A

(1) A function describes the behavior of a system, often expressed as the action upon something (e.g. an object or a user) as an input-output relationship. It is the answer to the question “What does the system do (to sth.)?“

(2) A function is a task or purpose of a system, often expressed as the desired action upon something (e.g. an object or a user) as input-output relationship. It is the answer to the question “What is the system supposed to do to sth.?“

Definition (1) is of the type realized behavior. Definition (2) is of the type requirement / desired behavior.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is a function model and what is its purpose?

A

Functions of a technical system and their relationships can be modeled in a function model. Function models are abstract representations of requirements on products and/or first concept ideas.

Purpose:
▪ Solution-neutral description of a product to be designed – by abstracting from the concrete problem.
▪ Look for alternative solutions / improvement of an existing solution – by abstracting from the existing solution.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is the right situation to use Flow-Oriented Function Modelling?

A

▪ Early stages of product development process
▪ Development of a product that acts on another object, e.g., by processing, transporting, …

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is the input for Flow-Oriented Function Modelling?

A

▪ Design goal
▪ Requirements

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is the output for Flow-Oriented Function Modelling?

A

▪ Model of important functions that are necessary to reach the design goal
▪ Arrangement of modules and interfaces

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is the procedure for Flow-Oriented Function Modelling?

A
  1. Decide what flow to model (e.g., energy, material and / or information)
  2. Define the startingand end state (*)
  3. Define connecting functions
  4. Define the statesin between (*)
  5. Review
  6. Label: explain all the symbols you have used. Cluster / identify modules.

(*) may be omitted if obvious

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What are the three types of elements in Relation-Oriented Function Modelling?

A

(1) Function of type task (FT): use imperative
(2) Function of type behaviour (FB): may be useful or harmful or neutral, use descriptive language
(3) Harmful function (HF): functions of type behavior that you clearly do not want, use descriptive language

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What are the four types of relations in Relation-Oriented Function Modelling?

A

(1) was introduced for
(2) was introduced to prevent
(1) causes or may cause
(2) prevents or may prevent

„was introduced for“ does not mean that this is the only way to produce a desired behavior. In this sense, the originating FT is not necessary or required.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is the input for Relation-Oriented Function Modelling?

A

▪Design goal / requirements / problem formulation
▪Optional: existing function models or product structure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is the output for Relation-Oriented Function Modelling?

A

▪Model or relevant functions to be implemented to reach design goal (useful/harmful)
▪Arrangement of modules and interfaces

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is the right situation to use Relation-Oriented Function Modelling?

A

▪Structuring a design problem
▪First steps of solution generation
▪Restructuring and abstracting from an existing solution

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is the procedure for Relation-Oriented Function Modelling?

A

(1) Define important useful and/or harmful functions.
(2) Extend upstream to identify the means to realize or prevent functions
(3) Extend downstream to identify consequences of functions
(4) repeat for each new function until no reasonable extension possible
▪ Follow the compatibility rules, e.g., a HF cannot be introduced for an FT

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

What are some questions for upstream extension in Relation-Oriented Function Modelling? Name 2.

A
  1. Only FT: What function would help to satisfy or enable this function?
  2. Only for HF: What function could prevent this function?
  3. Only for FB/HF: What function causes or may cause this function?
  4. Only for FB/HF: What function prevents or may prevent this function?
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

What are some questions for downstream extension in Relation-Oriented Function Modelling? Name 2.

A
  1. Only FT: What function could be enabled?
  2. Only FT: What harmful function could be prevented by this function?
  3. All functions: What may be the effect of this function?
  4. All functions: what function would be prevented by this function?
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

What is the difference between Flow-oriented function models and Relation-oriented function models?

A

Flow-oriented function models
▪ Focus on processes
▪ Limited use for problem analysis
Relation-oriented function models
▪ Focus on conditions of success and consequences
▪ More useful for problem analysis
▪ Hidden assumptions may prevent alternative solutions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Graph - Definiton

A

A graph is a set of elements (or vertices, nodes) with relations (or edges, arcs) between pairs of these elements
▪ There are directed and undirected graphs
▪ The direction of edges is sometimes expressed by vertical positioning (hierarchy) and not shown on edges

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Tree - Definition

A

A tree is a graph in which any two vertices are connected by exactly one path.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Polyhierarchy - Definition

A

A polyhierarchy can be represented by a directed graph without cycles along directed edges.
▪ In other words, elements may be connected to more than one element on the level above.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

Matrix - Definition

A

A matrix is a rectangular array of expressions arranged in rows and columns.
▪ Every graph can be converted into a matrix by assigning each node one row and one column. The matrix itself represents the relations between nodes.
▪ For directed graphs, we use the convention: input is in rows, output in columns.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

What are some examples for possible types of elements? Name 3.

A

▪ Design variables, attributes
▪ Functions
▪ Requirements
▪ Parts of the product / components
▪ States
▪ Tasks / process steps
▪ Individuals / groups / stakeholders

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
What are the possible types of relations?
Undirected ▪ To express connectedness ▪ For example: spatial, communication Directed ▪ To express dependency, hierarchy, order, … ▪ For example − Necessary / sufficient / INUS condition − Contains (for decomposition) − Flow of material / energy / signals − Temporal order ▪ Dependency is an ambiguous term.
26
What is the input for a Design Structure Matrix?
▪Elements such as components, roles, stakeholders, process steps, … ▪Relations between the elements related, e.g., to dependency, hierarchy, connectedness, … ▪Optional: a graph
27
What is the output for a Design Structure Matrix?
▪Matrix with elements and relations →input for further analysis (clustering, sequencing) ▪Visualization of system connectivity including type (and optionally intensity) of interaction
28
What is the right situation to use a Design Structure Matrix?
▪Presence of manyinteracting or connected elements, related to a product, organization, or process ▪Preparation for further analysis steps: clustering / sequencing
29
What is the procedure for a Design Structure Matrix?
1. Identify and group relevant elements, possibly by decomposing the system. Use as row and column labels. 2. Document the relations, possibly add weighting factor. You can skip the first two steps if you have already a graph as an input and start here: 3. Analyze: Identify patterns and their implications for system behavior (e.g. related to density, distribution, …). 4. Improve: Most DSM applications result not only in a better understanding of the system, but also in the improvement of the system through further analysis (see: clustering or sequencing)
30
What types of Design Structure Matrix (DSM) exist?
Undirected DSMs (static) and Directed DSMs (temporal)
31
What is a Domain Mapping Matrix (DMM)?
A DMM is an inter-domain matrix which represents the link between elements from two different domains.
32
What is the input for a Domain Mapping Matrix?
▪Elements from different domains (e.g. components functions, persons-components, persons-topics) ▪Relations between the elements ▪Optional: a graph
33
What is the output for a Domain Mapping Matrix?
▪DMM = tool for mapping in DSM analysis
34
What is the right situation to use a Domain Mapping Matrix?
▪Presence of manyinteracting or connected elements from two different domains, e.g., product-related and actor-related ▪Preparation for further analysis steps: clustering / sequencing
35
What is the procedure for a Domain Mapping Matrix?
1. Identify and group relevant elements, possibly by decomposing the system. Use elements from domain 1 and 2 as row and column labels. 2. Identify: Document the relations, possibly add weighting factor.You can skip the first two steps if you already have a graph as an input and start here: 3. Apply to further analysis: -multiply with DSMs -extract DSMs from it
36
What is Clustering for DSMs and when is it used?
▪ The objective of clustering analysis is to organize many elements with pair-wise relationships/dependencies into groups with a small number of relationships/dependencies between separate groups. ▪ This can be done by moving rows and the associated columns simultaneously. ▪ Clustering may be used for modularization of complex products →product family design. ▪ Clustering may be used for grouping people. ▪ DSMs with high connectivity often require algorithmic support.
37
What is the input for clustering?
▪ Unstructured, static DSM ▪ Clustering goal (e.g. numberof clusters, size of clusters, or constraint on relations outside a cluster)
38
What is the output for clustering?
▪ Clusters
39
What is the right situation to use clustering?
▪ Presence of overwhelmingly many elements with undirected relations (e.g. components or team members)
40
What is the procedure of clustering?
1.Get an overviewand build intuition. 2. Isolate extreme elements, i.e., elements that have: -connections to almost every other element (highly connected elements) -almost no connection to other elements by moving them into the upper left or lower right corner and leave them out of further consideration. 3.Clusterremaining elements into chunks: find elements which have similar entries and move them together by switching columns and rows simultaneously 4.Markclusters with a rectangle for better visualization. All entries which are not included in the cluster cause interactions between clusters. 5.The aim is to minimize interactions between clusters →Repeatfrom step 3 if necessary
41
What is the basic DSM structure for sequencing?
The DSM lists all constituent elements and the corresponding information flow, interactions and dependency patterns of a process architecture. -Input into columns (from rows), feedback below diagonal
42
What is sequencing?
▪ Sequencing is the reordering of rows and columns of a DSM with the objective of arranging all existing dependencies on the upper side or at least as close as possible to the diagonal. ▪ Sequencing produces smaller feedback loops → process steps are closer to each other. ▪ A triangular matrix on the top, i.e. all dependencies on the upper side of the diagonal, represents a process without any feedback. ▪ If there are no feedback loops, sequencing will produce a triangular matrix.
43
What is the right situation to use sequencing?
▪ Process planning ▪ Presence of processes with −Large feedback loops −Many feedback loops
44
What is the input for sequencing?
▪Unstructured, temporal DSM Matrix
45
What is the output for sequencing?
▪ Feedback loops ▪ Process with minimized feedback loops.
46
What is the procedure for sequencing?
1.Get an overviewand build intuition. 2. Identify elements which do not depend on information of other elements (no entries in column) and move them to the upper left corner 3. Identify elements which do not influence elements (no entries in rows) and move them to the lower right corner (in Excel this can be done by pressing shiftwhile moving). If there are no remaining elements in DSM after steps 1 and 2, the matrix is completely sequenced, otherwise the remaining elements contain information feedbacks (at least one). 4.Decrease the size of feedback loops by switching elements with entries far away from the diagonal in order to move entries closer to the diagonal.This results in isolated and smaller feedback loops. Note: Process tasks which have entries on both sides of the diagonal are circular dependencies. They cannot be removed, but only isolated and reduced
47
What are the main differences between a functional organization and a project organization? Name 3.
Grouping principle Functional organization: By expertise, competence, and experience Project organization: By product, product function, or development goal Typical view Functional organization: Deep specialization; discipline-centric perspective Project organization: Integrated product perspective; cross-functional balance Decision speed Functional organization: Slower due to coordination across multiple expert groups Project organization: Faster because decisions are made closer to the product Knowledge reuse Functional organization: High reuse of domain knowledge and standards Project organization: Reuse limited Accountability Functional organization: Distributed across specialist groups Project organization: Clear product responsibility within the team
48
What is a matrix organization?
▪ A matrix organization is a hybrid structure where individuals have organizational links to both, projects and (organizational) functions at the same time. →Combines strengths of both, functional and project view ▪ Individuals typically have several supervisors. →Requires more management and administration
49
What are some engineering roles in product development of complex products?
-Product (function) designer: Responsible for customer-relevant attributes of product -Component designer: Responsible for component attributes -Architect: Responsible for system attributes, essential for product architecture -Project manager: Responsible for meeting the project goals
50
What is product architecture?
Product architecture is a scheme by which functional elements of the product are arranged into physical chunks and by which the chunks interact with each other
51
What is an Attribute Dependency Graph (ADG)?
▪ Consists of elements (nodes) that represent attributes (= properties), here A, B, C. Ideally, attributes are objectively measurable, i.e., two different observers obtain the same value. ▪ Has relations (edges) that represent dependency in a particular sense: − Values for C can only exist, when values for A & B exist: attributes A & B are measurable before attribute C. − Values of attributes A & B determine the value of C by the laws of physics (rather than by some decision maker) →The value of C is a physical consequence of the values of A & B. − Example: A and B are attributes of separate components 1 & 2. Only after joining components 1 & 2, the attribute of system attribute C emerges, i.e., C can be measured. ▪ Should contain all attributes that (1) may change value during design or use of the product and (2) are helpful to formulate INUS conditions → building plan for requirement derivation. ▪ Must not contain requirements! ▪ Which attributes are treated as QoIs and DVs depends on the scope.
52
What different types of influence are there in an Attribute Dependency Graph (ADG)?
-direct influence when there is no other attribute in between -indirect influence when there is an intermediate attribute
53
What can be some special dependencies in an Attribute Dependency Graph (ADG)?
▪ Ambiguous dependencies: between quantities that are related by an equation that does not express a requirement, without obvious / relevant order of occurrence → choose quantity of interest according to practical aspects ▪ Dependencies between potentials / capacities
54
What is the difference between Quality Function Deployment (QFD) and Attribute Dependency Graph (ADG)?
Quality Function Deployment (QFD) has a two-level view − Easier to create, visualize and communicate − May or may not include all relevant information Attribute Dependency Graph (ADG) has a multiple level view − Resolves dependencies in detail − More modelling effort
55
What is the input for Attribute Dependency Graphs (ADG)?
▪Scope of analysis expressed by (1) requirements and/or quantities of interests and/or (2) design variables involved. ▪Rough qualitative understanding of dependencies
56
What is the output for Attribute Dependency Graphs (ADG)?
▪Dependency structure of attributes ▪Building plan for requirement development ▪Candidates of causes of a problem
57
What is the right situation to use Attribute Dependency Graphs (ADG)?
▪Presence of many attributes and dependencies ▪Need to structure a problem and decompose it into sub-problems ▪Organize interfaces between several disciplines ▪Preparation for requirement formulation
58
What is the procedure for Attribute Dependency Graphs (ADG)?
1. Forget all requirements, needs, intentions and purpose (however, include the associated attributes) 2. List all attributes that may be of relevance (QoIs, DVs, intermediate attributes) 3. Order attributes by dependency = order of emergence of properties. Assume view to assemble or build a product by choosing arbitrary values (to ensure that you do not use requirements) and observe how properties emerge by assigning values to attributes. 4. Check direct influence: Is it possible to change C by changing B without changing A? If YES: there is a direct influence. 5. Do you improve clarity by adding intermediate attributes?
59
What is a risk of the functional organization?
Risk of silo thinking and sub-optimization within specialties
60
What is a risk of the project organization?
Risk of inconsistent methods or standards across products