Summary

• Page properties (2 modified, 0 added, 0 removed)
• Objects (1 modified, 0 added, 0 removed)
  • Confluence.Code.ConfluencePageClass[0]

Details

Page properties

Author

...	...	@@ -1,1 +1,1 @@
1		-XWiki.nbw
	1	+XWiki.uru

Content

...	...	@@ -27,27 +27,23 @@
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}}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}}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)
31	31	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.
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.
	36	+* **Orthogonal "Edge Bundling"** (Bachelor, Master)
	37	+Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm.
34	34	* **Node Placement With a Focus on Compactness** (Master)
35	35	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.
36	36	* **Force Based Drawing with Port Constraints** (Master)
37	37	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"]].
38		-* **Interactive constraint creation and application in automatic layout **(Bachelor/Master)
39		-Evaluate options how to create constraints on the layout like "Node x should be placed at position y" and how to implement this in the current layout algorithms.
	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.
40	40	\\
41		-* **Compound Graph Layout** (Master)
42		-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.
43		-* **Orthogonal "Edge Bundling"** (Bachelor, Master)
44		-Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm.
45		-\\
46		-* **Integrate KIML with JGraph** (Bachelor)
47		-Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.\\
48		-* **{{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}}Improve and Assess KLay Layered's JUnit Test Environment**
49		-We maintain a variety of JUnit tests to assure our layout algorithm works properly. The environment to execute these tests grew over time and requires a face-lift. The task is to evaluate existing testing frameworks of other projects, find a clean and efficient way to specify and maintain our tests, and update the current implementation.
50		-\\
51	51
52	52	= Modeling Pragmatics =
53	53
...	...	@@ -116,6 +116,7 @@
116	116	Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.
117	117	* **Curing Schizophrenia in SCCharts **(Master)
118	118	Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
	115	+\\
119	119
120	120	= PRETSY / PRETSY2 =
121	121
...	...	@@ -129,11 +129,16 @@
129	129
130	130	* **Real-time extensions for SCCharts** (Bachelor/Master)
131	131	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	+\\
132	132
	131	+= (% style="color: rgb(0,0,0);" %) (%%) =
	132	+
133	133	= Model-based Design =
134	134
135		-**Advisors**: Christian Motika
	135	+= (% style="color: rgb(0,0,0);" %) (%%) =
136	136
	137	+**Betreuung**: Christian Motika
	138	+
137	137	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.
138	138
139	139	(% class="external-link" %)
...	...	@@ -143,6 +143,10 @@
143	143
144	144	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.
145	145
	148	+= (% style="color: rgb(0,0,0);" %) (%%) =
	149	+
	150	+
	151	+
146	146	= (% style="color: rgb(0,0,0);" %)Miscellaneous Topics(%%) =
147	147
148	148	**Advisors:** to be determined.

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-13008941
	1	+10752006

URL

...	...	@@ -1,1 +1,1 @@
1		-https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/13008941/Topics for Student Theses
	1	+https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/10752006/Topics for Student Theses