View
214
Download
1
Embed Size (px)
Citation preview
COURSE “SYSTEM DESIGN: STRUCTURAL APPROACH” DETC2006-99547
Inst. for Information Transmission ProblemsRussian Academy of Sciences, Moscow 127994, Russia
Email: [email protected]
Mark Sh. LEVINhttp: //www.iitp.ru/mslevin/
The 18th DTM, Sept. 10-13, 2006, Philadelphia, Pennsylvania, USA
Recent course “Design of Systems: structural approach”, Moscow Inst. of Physics & Technology (State Univ.),
since Sept. 2004 http: //www.iitp.ru/mslevin/SYSD.HTM
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 schemes7.Examples of student’s projects 8.Conclusion
ABOUT STUDENTS in MIPT
Special Selection Process: to select the best students
1.Educational background from schools2.Ability to Mathematics, Physics3.Creativity4.Background in IT (all components)5.Ability to learn6.Ability to plan7.Motivations (& interests in applied domains)
Recent course in MIPT: place of course
Mathematics
Physics
IT
T03 year
Real-WorldScience & Engineering
6 year
CHANGE OF
STYLE
STYLES:FROM: Learning (analogues)TO: Creation in Research&Engineering
MY FACULTY (now)
SoftwareHardwareVLSI designRadio PhysicsInformation systemsCommunication systemsManagement systemsOrganizational systemsSpace systems
MODELING & DESIGN: Multidisciplinary systems (& processes)
Faculty of Cybernetics & Radio Engineering(over 100 students: each year)
APPLIED DOMAINS:
DECISION CYCLE
Appliedproblem(s)
Math. Model(s)
Solvingscheme//
algorithms
Programs/procedures
Solving process(e.g., computing
DECISION
DESIGNED SYSTEMS
REQUIREMENTS:OBJECTIVES, CRITERIA
STANDARDS
SYSTEMS:1.PRODUCTS / PRODUCT FAMILIES
2.PROCESSES
Structure of course
I.BASIC SYSTEMS ISSUES1.1.Systems engineering (life cycle engineering)1.2.Structural models (graphs, networks, binary relations)II.SYSTEM ANALYSIS & DECISION MAKING2.1.Principles of systems analysis 2.2.Methods for rankingIII. COMBINATORIAL OPTIMIZATION & OPTIMIZATION3.1.Basic problems (e.g., knapsack, TSP, scheduling, routing,graph coloring)3.2.Complexity issues of combinatorial problems3.3.Optimization (convex programming, Mixed Int. Progr.)IV.DESIGN FRAMEWORKS (series, hierarchy, cascade-like)V.MORPHOLOGICAL DESIGN APPROACHESVI.ADDITIONAL SYSTEM ISSUES(maintenance, system testing, requirements engineering)
TECHNOLOGICAL SYSTEMS PROBLEMS: design, improvement/upgrade, multistage design, revelation of bottlenecks, evaluation, modeling of evolution/development
Recent course in MIPT: 3-layer hierarchy
LAYER 3:Methods & Models
Optimi-zation
Decisionmaking
Combinatorialoptimization
AI
LAYER 1:Applied complex systems
Hierarchical Systems (modular multi-level
approach)A B
Y
C
S=A*B*C*D
VU X
*Graphs*Networks*Binary relations
LAYER 2:Design frameworks Solving schemes
Composite solving schemes(solving engineering/technology )
Recent course in MIPT: 3-layer hierarchy
LAYER 3:Methods & Models
LAYER 1:Applied complex systems
LAYER 2:Design frameworks Solving schemes
Recent course in MIPT: 3-layer hierarchy
LAYER 3:Methods & Models
LAYER 1:Applied complex systems
LAYER 2:Design frameworks Solving schemes
Towards Optimization Models & Solving Approaches
BASIC MODELS FOR LABORATORY WORKS:1.Multicriteria decision making (ranking, 3 methods)2.Knapsack problem3.Multiple choice problem4.Clustering5.Proximity to an ideal decision6.Evaluation of a hierarchical modular system7.Combinatorial morphological synthesis8.Assignment / allocation problem9.TSP10.By choice
APPROACHES AND MODELS IN LECTURE MATERIALS:1.Continuous optimization2.Multidisciplinary optimization3.Mixed integer mathematical programming4.Parameter Space Investigation (PSI) approach5.Combinatorial optimization models, basic algorithm types, heuristics, and complexity issues
Allocation problem
Allocation (assignment, matching, location):
MAPPING
BIPARTITE GRAPH
1
2
3
4
5
6
7
8
a
b
c
d
e
f
g
h
Positions(locations, sites)
Set of elements(e.g., personnel, facilities)
Allocation problem: applied examples for elements & positions
1.Boys -- Girls (marriage problem)
2.Workers -- Work positions
3.Facilities --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.
Evolution chart of allocation-like problems
Basic assignment problem
Quadratic assignment
problem
PLUS: distance matrix for positions
Generalized assignment
problem
PLUS: resource (s) for positions
Generalized quadraticassignment problem
Multicriteriaquadratic assignment
problem
Multicriteriageneralized assignment
problem
Multicriteria generalized Quadratic assignment problem
Multicriteria assignment problem
PLUS: multicriteriadescription
PLUS: distance matrix for position
PLUS: resource (s) for positions
PLUS: multicriteriadescription
1
2
3
4
a
b
c
d
e
f
g
h
Segments of market
PRODUCTS
EXAMPLE 1: Clustering, Assignment, Multiple Choice Problem
CUSTOMERS
2
Groupsof products
Marketing strategies
X
X
X
S=X*Y*Z
Y
Z=P*Q*U*V
Z1=P2*Q3*U1*V5
Z2=P1*Q2*U3*V1Y1
Y2
Y3
A B
A1
A2
A3
B1
B2
B3
B4
C1
C2
C3
C4
C5
D=I*J
I1
I2
I3
J1
J2
J3
J4
P1
P2
P3
Q1
Q2
Q3
Q4
U1
U2
U3
V1
V2
V3
V4
V5
V6
C
X=A*B*C*D
P Q U V
X1=A1*B2*C4*D3
X2=A3*B4*C2*D1
D1=I1*J1
D2=I1*J2
D3=I3*J4
S1=X2*Y3*Z2
S2=X1*Y2*Z1
JI
EXAMPLE 2: Hierarchical Design
EXAMPLE 4: Evolution as Generations of software DSS COMBI (lectures)
System 0S0 = T
TechniquesT
T1
System 1S1 = T * U
TechniquesT
T2
T1
T3
U
L1
Userinterface
System 2S2 = T *U(L)*Y
TechniquesT
T2
T1
T3
U=L
L1
Userinterface
LanguageL
Y1
Tool for synthesisof solving strategy
Y
System 3S3 = T *U(L*G)*Y*E*H
TechniquesT
T2
T1
T3
L1
User inter-face U=L*G
LanguageL
Y1
Tool for synthesisof solving strategy
Y
G1
E1
Library ofexamples
E
H1
Hyper-text
H
L2
System 4S4 = T *U(L*G)*E*H
TechniquesT
T2
T1
T3
User inter-face U=L*G
LanguageL
E1
Library ofexamples
E
H1
Hyper-text
H
L2 G2
G
G
Graphics
Graphics
EXAMPLE 4: Evolution as Generations of software DSS COMBI (lectures)
System 0
T0
System 1
System 2
System 3 System 4
Improvement
EXAMPLE 4: Evolution as Generations of software DSS COMBI (lectures)
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
CONCLUSION
1.Collection of student’s materials
2.Organization of student’s homepages with results
3.Preparation of student’s results: presentations, papers
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)