Changes for page Available Topics

Last modified by Niklas Rentz on 2025/03/13 09:21
<
From version < 50.1 >
edited by uru
on 2015/04/29 13:35
To version < 51.1 >
edited by uru
on 2015/04/29 13:40
>
Change comment: There is no comment for this version

Summary

Details

Page properties
Content
... ... @@ -27,23 +27,24 @@
27 27  * **Tight Packing of Connected Components** (Bachelor)
28 28  Different connected components of a graph are often laid out separately and combined again afterwards. This combination step often produces too much whitespace. Research relevant 2D packing literature and implement a better solution.
29 29  {{jira columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1262"}}KIPRA-1262{{/jira}}\\
30 -* **{{jira columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1031"}}KIPRA-1031{{/jira}}Integrate KIML with JGraph** (Bachelor)
31 -Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.\\
32 -* **{{jira showSummary="true" columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1214"}}KIPRA-1214{{/jira}}Improved Edge Label Placement** (Bachelor)
33 -Our layout algorithm already supports the placement of edge labels. However, there's still room for improvement...
34 -* **Layering Algorithms** (Bachelor, Master)
30 +* **{{jira columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1031"}}KIPRA-1031{{/jira}}Layering Algorithms** (Bachelor, Master)
35 35  Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout. The focus of the algorithm could the consideration of the number of edge crossings, a given aspect ratio, or overall compactness.
36 -* **Orthogonal "Edge Bundling"** (Bachelor, Master)
37 -Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm.
32 +* **Combining Forces and Layers** (Master)**
33 +**Design and implement a layout algorithm that combines the force-based and the layer-based approaches. The first three phases of the layer-based approach shall be replaced by a node distribution computed with a force-based approach.\\
38 38  * **Node Placement With a Focus on Compactness** (Master)
39 39  Node placement algorithms often try to draw as many edges as straight lines as possible. However, that usually results in less compact diagrams. The focus of this topic would be to devise or adapt a node placement algorithm that tries to strike a balance between straightness and compactness.
40 -* **Compound Graph Layout** (Master)
41 -Design and implement new concepts for computing layer-based layouts of compound graphs. The main focus shall be on //maintainability//: ensuring that the implementation can be kept working over the years. The main area to be considered here is the crossing minimization phase.
42 42  * **Force Based Drawing with Port Constraints** (Master)
43 43  Develop methods for integrating port constraints in force-based drawing approaches. The resulting node placement shall be evaluated using an edge router such as [[libavoid>>url:http://www.adaptagrams.org/||shape="rect"]] on the model library of [[Ptolemy>>url:http://ptolemy.eecs.berkeley.edu/||shape="rect"]].
44 -* **Combining Forces and Layers** (Master)**
45 -**Design and implement a layout algorithm that combines the force-based and the layer-based approaches. The first three phases of the layer-based approach shall be replaced by a node distribution computed with a force-based approach.
46 46  \\
39 +* **Compound Graph Layout** (Master)
40 +Design and implement new concepts for computing layer-based layouts of compound graphs. The main focus shall be on //maintainability//: ensuring that the implementation can be kept working over the years. The main area to be considered here is the crossing minimization phase.
41 +* **Orthogonal "Edge Bundling"** (Bachelor, Master)
42 +Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm.
43 +\\
44 +* **Integrate KIML with JGraph** (Bachelor)
45 +Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.
46 +{{jira showSummary="true" columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1214"}}KIPRA-1214{{/jira}}
47 +\\
47 47  
48 48  = Modeling Pragmatics =
49 49  
... ... @@ -112,7 +112,6 @@
112 112  Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.
113 113  * **Curing Schizophrenia in SCCharts **(Master)
114 114  Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
115 -\\
116 116  
117 117  = PRETSY / PRETSY2 =
118 118  
... ... @@ -126,14 +126,9 @@
126 126  
127 127  * **Real-time extensions for SCCharts** (Bachelor/Master)
128 128  Make the timing instructions //delay_until// und //exception_on_expire// of the [[FlexPRET>>url:http://rtsys.informatik.uni-kiel.de/confluence/Multithreaded/Multicore execution of SCCharts Evaluate possibilities to preserve parallelism in SCCharts, implement mapping for (fine grained) multithreading and multicore based on the FlexPRET||shape="rect"]] processor available in SCCharts.
129 -\\
130 130  
131 -= (% style="color: rgb(0,0,0);" %) (%%) =
132 -
133 133  = Model-based Design =
134 134  
135 -= (% style="color: rgb(0,0,0);" %) (%%) =
136 -
137 137  **Betreuung**: Christian Motika
138 138  
139 139  Heute haben sich eine ganze Reihe von Modellierungssprachen durchgesetzt, die grafische Modelle verwenden. Dazu zählen beispielsweise die [[Unified Modeling Language (UML) >>url:http://de.wikipedia.org/wiki/UML||shape="rect" class="external-link"]]oder die Werkzeugketten [[Simulink/Stateflow von Mathworks >>url:http://de.wikipedia.org/wiki/Simulink||shape="rect" class="external-link"]]und [[SCADE von Esterel-Technologies>>url:http://en.wikipedia.org/wiki/SCADE||shape="rect" class="external-link"]]. Letztere werden insbesondere auch im Entwurf eingebetteter und sicherheitskritischer Systeme (z.B. in Fahr- und Flugzeugen) eingesetzt.
... ... @@ -145,10 +145,6 @@
145 145  
146 146  Im Rahmen dieses Projektes gibt es Raum für zahlreiche Arbeiten mit übersichtlichem Umfang, die einen schönen (aber in sich abgeschlossenen) Beitrag zur Verbesserung der Handhabbarkeit vom modellbasierten Entwurf leisten können. Für konkrete Themen schauen Sie in das KIELER Wiki oder sprechen Sie einen der Betreuer bitte direkt an.
147 147  
148 -= (% style="color: rgb(0,0,0);" %) (%%) =
149 -
150 -
151 -
152 152  = (% style="color: rgb(0,0,0);" %)Miscellaneous Topics(%%) =
153 153  
154 154  **Advisors:** to be determined.
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -10752006
1 +10752007
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/10752006/Topics for Student Theses
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/10752007/Topics for Student Theses

Navigation

Quick Links

KIELER on GitHub
RTSYS Homepage