COURSE - PowerPoint PPT Presentation

About This Presentation
Title:

COURSE

Description:

The 18th DTM, Sept. 10-13, 2006, Philadelphia, Pennsylvania, USA ... 3. Belkin A.R., Levin M.Sh., Decision Making: Combinatorial Models of Information Approximation, ... – PowerPoint PPT presentation

Number of Views:28
Avg rating:3.0/5.0
Slides: 26
Provided by: Mar5616
Category:
Tags: course | belkin

less

Transcript and Presenter's Notes

Title: COURSE


1
COURSE SYSTEM DESIGN STRUCTURAL APPROACH
DETC2006-99547
Mark Sh. LEVIN http //www.iitp.ru/mslevin/
Recent course Design of Systems structural
approach, Moscow Inst. of Physics Technology
(State Univ.), since Sept. 2004 http
//www.iitp.ru/mslevin/SYSD.HTM
Inst. for Information Transmission
Problems Russian Academy of Sciences, Moscow
127994, Russia Email mslevin_at_acm.org
The 18th DTM, Sept. 10-13, 2006, Philadelphia,
Pennsylvania, USA
2
PLAN
1.About Moscow Inst. of Physics Technology
2.Decision cycle
3.Structure of the course

4.Three-layer hierarchy
5.Example allocation problem
(problem family) 6.Four illustrative examples
for complex schemes 7.Examples of students
projects 8.Conclusion


3
ABOUT STUDENTS in MIPT
Special Selection Process to select the best
students 1.Educational background from
schools 2.Ability to Mathematics,
Physics 3.Creativity 4.Background in IT (all
components) 5.Ability to learn 6.Ability to
plan 7.Motivations ( interests in applied
domains)
4
Recent course in MIPT place of course
3 year
6 year
T
0
Mathematics
Real-World Science Engineering
Physics
CHANGE OF STYLE
IT
STYLES FROM Learning (analogues) TO Creation
in ResearchEngineering
5
MY FACULTY (now)
Faculty of Cybernetics Radio
Engineering (over 100 students each year)
APPLIED DOMAINS
Software Hardware VLSI design Radio
Physics Information systems Communication
systems Management systems Organizational
systems Space systems
MODELING DESIGN Multidisciplinary systems (
processes)
6
DECISION CYCLE
Solving scheme// algorithms
Math. Model(s)
Applied problem(s)
Programs/ procedures
Solving process (e.g., computing
DECISION
7
DESIGNED SYSTEMS
STANDARDS
REQUIREMENTS OBJECTIVES, CRITERIA
SYSTEMS 1.PRODUCTS / PRODUCT FAMILIES 2.PROCESSES
8
Structure of course
I.BASIC SYSTEMS ISSUES 1.1.Systems engineering
(life cycle engineering) 1.2.Structural models
(graphs, networks, binary relations) II.SYSTEM
ANALYSIS DECISION MAKING 2.1.Principles of
systems analysis 2.2.Methods for ranking III.
COMBINATORIAL OPTIMIZATION OPTIMIZATION 3.1.Basi
c problems (e.g., knapsack, TSP, scheduling,
routing, graph coloring) 3.2.Complexity issues of
combinatorial problems 3.3.Optimization (convex
programming, Mixed Int. Progr.) IV.DESIGN
FRAMEWORKS (series, hierarchy, cascade-like) V.MOR
PHOLOGICAL DESIGN APPROACHES VI.ADDITIONAL SYSTEM
ISSUES (maintenance, system testing, requirements
engineering) TECHNOLOGICAL SYSTEMS PROBLEMS
design, improvement/upgrade, multistage design,
revelation of bottlenecks, evaluation, modeling
of evolution/development
9
Recent course in MIPT 3-layer hierarchy
SABCD
LAYER 1 Applied complex systems
Graphs Networks Binary relations
Hierarchical Systems (modular multi-level approac
h)
B
A
C
Y
V
U
X
LAYER 2 Design frameworks Solving schemes
Composite solving schemes (solving
engineering/technology )
LAYER 3 Methods Models
Optimi- zation
Decision making
Combinatorial optimization
AI
10
Recent course in MIPT 3-layer hierarchy
LAYER 1 Applied complex systems
LAYER 2 Design frameworks Solving schemes
LAYER 3 Methods Models
11
Recent course in MIPT 3-layer hierarchy
LAYER 1 Applied complex systems
LAYER 2 Design frameworks Solving schemes
LAYER 3 Methods Models
12
Towards Optimization Models Solving Approaches
BASIC MODELS FOR LABORATORY WORKS 1.Multicriteri
a decision making (ranking, 3 methods) 2.Knapsack
problem 3.Multiple choice problem 4.Clustering 5.P
roximity to an ideal decision 6.Evaluation of a
hierarchical modular system 7.Combinatorial
morphological synthesis 8.Assignment / allocation
problem 9.TSP 10.By choice
APPROACHES AND MODELS IN LECTURE
MATERIALS 1.Continuous optimization 2.Multidiscip
linary optimization 3.Mixed integer mathematical
programming 4.Parameter Space Investigation (PSI)
approach 5.Combinatorial optimization models,
basic algorithm types, heuristics, and
complexity issues
13
Allocation problem
Allocation (assignment, matching, location)
a
Set of elements (e.g., personnel, facilities)
b
1
Positions (locations, sites)
MAPPING
2
c
3
d
4
e
5
f
6
7
g
8
h
BIPARTITE GRAPH
14
Allocation problem applied examples for elements
positions
1.Boys -- Girls (marriage
problem) 2.Workers -- Work positions 3.Facilitie
s --Positions in manufacturing system (facility
layout) 4.Tasks --
Processors in multiprocessor system
5.Anti-rockets --Targets in defense
systems 6.Files -- Databases in
distributed information systems Etc.
15
Evolution chart of allocation-like problems
PLUS multicriteria description
Basic assignment problem
PLUS distance matrix for positions
PLUS resource (s) for positions
Multicriteria assignment problem
Generalized assignment problem
PLUS distance matrix for position
PLUS resource (s) for positions
Quadratic assignment problem
PLUS multicriteria description
Multicriteria quadratic assignment problem
Multicriteria generalized assignment problem
Generalized quadratic assignment problem
Multicriteria generalized Quadratic assignment
problem
16
EXAMPLE 1 Clustering, Assignment, Multiple
Choice Problem
CUSTOMERS
a
PRODUCTS
b
X
1
Segments of market
c
2
2
d
e
X
3
f
X
4
g
Groups of products
h
Marketing strategies
17
EXAMPLE 2 Hierarchical Design
SXYZ
S1X2Y3Z2 S2X1Y2Z1
XABCD
ZPQUV
X1A1B2C4D3 X2A3B4C2D1
Y
Z1P2Q3U1V5 Z2P1Q2U3V1
Y1 Y2 Y3
V
Q
U
DIJ
P
A
B
C
D1I1J1 D2I1J2 D3I3J4
C1 C2 C3 C4 C5
A1 A2 A3
B1 B2 B3 B4
P1 P2 P3
V1 V2 V3 V4 V5 V6
Q1 Q2 Q3 Q4
U1 U2 U3
J
I
I1 I2 I3
J1 J2 J3 J4
18
EXAMPLE 3 Multistage design (lectures)
Trajectory
. . .
. . .
. . .
Stage 1
Stage 3
Stage 2
T
0
19
EXAMPLE 4 Evolution as Generations of software
DSS COMBI (lectures)
System 0
System 1
S0 T
S1 T U
User interface
Techniques
Techniques
U
T
T
T1
T1
L1
T2
T3
System 2
S2 T U(L)Y
Tool for synthesis of solving strategy
User interface
Techniques
UL
T
Y
Language
L
T1
Y1
T2
L1
T3
20
EXAMPLE 4 Evolution as Generations of software
DSS COMBI (lectures)
System 3
S3 T U(LG)YEH
User inter- face ULG
Tool for synthesis of solving strategy
Library of examples
Hyper- text
Techniques
T
Y
Language
E
H
L
Graphics
T1
Y1
G
E1
H1
T2
L1
G1
T3
L2
System 4
S4 T U(LG)EH
User inter- face ULG
Library of examples
Hyper- text
Techniques
T
Language
E
H
Graphics
L
T1
E1
H1
G
T2
T3
L2
G2
21
EXAMPLE 4 Evolution as Generations of software
DSS COMBI (lectures)
Improvement
System 3
System 4
System 2
System 1
System 0


T
0
22
STUDENT PROJECTS (RESULTS OF LAB. WORKS examples)
1.Software for signal simulation (software)
2.Computer class (educational
multidisciplinary environment)
3.Plan of body building (sport)
4.Musical project (art)
5.Allocation of
communication devices
(configuration of communication facilities)
6.Plan of system testing
(probing for communication)
7.Organization of sport
event (sport) 8.Control
system for computer memory
9.Multicriteria analysis of computer protocols
10.Car

23
CONCLUSION
1.Collection of students materials
2.Organization of students homepages
with results 3.Preparation of
students results presentations,
papers
24
Thats All
  Gr8 Thanks!
25
MY BASIC BOOKS ( my articles)
1.Levin M.Sh., Composite Systems Decisions.
Springer, 2006.2. Levin M.Sh., Combinatorial
Engineering of Decomposable Systems,
Kluwer, 1998. 3. Belkin A.R., Levin M.Sh.,
Decision Making Combinatorial Models of
Information Approximation, Nauka Publishing House
(Russian Academy of Sciences), Moscow, 1990 (in
Russian)4. Levin M.Sh., Application of
Combinatorial Models in Computer-Aided
Systems. VNIITEMR, Moscow, 1986 (in Russian)
Write a Comment
User Comments (0)
About PowerShow.com