System Design and Complexity
After Lecture Learning Questions to the Lecture System Design and Complexity by Prof. Schweitzer, ETH Zürich, fall 2016.
After Lecture Learning Questions to the Lecture System Design and Complexity by Prof. Schweitzer, ETH Zürich, fall 2016.
Kartei Details
| Karten | 88 |
|---|---|
| Sprache | English |
| Kategorie | Technik |
| Stufe | Universität |
| Erstellt / Aktualisiert | 11.12.2016 / 15.12.2016 |
| Lizenzierung | Kein Urheberrechtsschutz (CC0) |
| Weblink |
https://card2brain.ch/box/20161211_system_design_and_complexity
|
| Einbinden |
<iframe src="https://card2brain.ch/box/20161211_system_design_and_complexity/embed" width="780" height="150" scrolling="no" frameborder="0"></iframe>
|
Distinguish well defined from ill defined problems.
Well defined problem: defined problem space, known algorithm, information given, goal specified.
Ill defined problem: undefined problem space, uncertainty about information and Goals.
Distinguish simple from complex problems.
Simple problem: = trivial problem; few, weakly or uncorrelated criteria, perfect Solution.
Complex problem: = nontrivial problem; many, strongly correlated optimization Criteria, frustrated system with several (non optimal) solutions.
Describe the TSP. How does it differ from the cubic equation example and from the airport example? Why is it still a well defined problem?
Difference to cubic eq.: procedure for solution is unclear BUT also well defined due to given information and specified goal.
Difference to airport: airport has unclear goals/information (undefined problem space)TSP (travelling salesman problem) = well-defined, non-trivial
Thinking about frustrated problems, what does it mean that there is no ’perfect solution’? Why can’t we know that we have found the perfect one?
Not all solutions can be determined within a finite time. Many criteria are strongly Interdependent and influence the solution. As not all solutions can be investigated. One probably doesn’t find the perfect one, or at least one doesn’t know if one did.
Explain the PSC for the TSP problem. Why is this an iterative procedure based on successive refinement
1: what is the problem? Define cost function;
2: what is the solution? Evolutionary Optimization;
3: select solution. Best solution is known, Improving by random deviations
What is the origin of complexity? Why can’t we get rid of it?
Complexity is given, can’t be simplified. Complexity stems from the different criteria Which are interlinked
Recall the problem solving cycle. Why are the three parts weighted of equal importance (w.r.t. time allocation)?
Setting the objective, search for solution, selection of solutions The steps are prerequisites of the following step, proper preparation helps (Roli: maybe it not only helps but is crucial?) for following tasks
Think about the distinction between “inner system” and “environment”. Should we enlarge the former, to allow for more solutions?
Inner system: part of the system which is affected by the problem and its possible solutions. Environment: contains system. Inner system can be enlarged (size can be corrected due to the effect of the solution)
