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.ssm
	1	+XWiki.nbw

Content

...	...	@@ -4,8 +4,6 @@
4	4
5	5	**Hinweis**: Es ist Studierenden ausdrücklich empfohlen, sich frühzeitig bei den verschiedenen Arbeitsgruppen über mögliche Themen der Abschlussarbeit zu informieren. WWW-Seiten wie diese hier sind ein guter erster Anlaufpunkt, und es ist eine gute Idee, sich vor einem Gespräch mit einem potenziellen Betreuer (Professor, Assistenten ~-~- generell die Dozenten von Lehrveranstaltungen) über mögliche Themen einen Blick auf diese Seiten zu werfen. Es ist jedoch erfahrungsgemäß schwierig, auf solchen Seiten vollständige und aktuelle Informationen bereitzustellen; sie sollten daher eher als grober Indikator der jeweils möglichen Themenfelder dienen denn als konkrete Ausschreibungen. Um zu erfahren, welche Themen konkret verfügbar sind, zu dem angestrebten Zeitrahmen, sollte man auf jeden Fall die Dozenten konsultieren.
6	6
7		-Die möglichen Themen sind im Folgenden thematisch gruppiert. Die Zahlen vor der Themenbeschreibung stehen für Prioritäten. Je kleiner die Zahl, desto wichtiger ist uns das Thema.
8		-
9	9	= Outline =
10	10
11	11
...	...	@@ -28,12 +28,14 @@
28	28
29	29	* **1 Tight Packing of Connected Components** (Bachelor, Master)
30	30	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.
31		-\\
	29	+{{jira id="KIELER JIRA" columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1262"}}KIPRA-1262{{/jira}}\\
32	32
33		-* **2 Heuristics for the Compact Layering Problem** (Bachelor, Master)
34		-Usually the layer assignment problem of the layer-based approach seeks to let as many edges as possible point into the same direction. Refraining from doing so sometimes allows more compact drawings, which so far has been evaluated using optimization problems. The task is to find and evaluate appropriate heuristics.
35		-* **2 Evaluate Impact of Reversing Edges on Humans** (Master)
36		-Reversing edges during the layer assignment problem as suggested by the previous topic may have a negative impact on the readability of diagram. User-studies should be carefully planned and conducted to answer two questions: which edges are naturally reversed by humans and does reversing too many edges worsen comprehensibility?
	31	+{{jira id="KIELER JIRA" columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1031"}}
	32	+KIPRA-1031
	33	+{{/jira}}
	34	+
	35	+
	36	+
37	37	* **2 Layering Algorithms** (Bachelor, Master)
38	38	Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout. The focus of the algorithm could be the consideration of the number of edge crossings, a given aspect ratio, or overall compactness.
39	39	* **2 Node Placement With a Focus on Compactness** (Master)
...	...	@@ -41,16 +41,16 @@
41	41
42	42
43	43
44		-* **2 Interactive Constraint Creation and Application in Automatic Layout **(Bachelor, Master)
45		-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. Assess how such constraints can be persisted within the model.
46	46	* **3 Force Based Drawing with Port Constraints** (Master)
47	47	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"]].
48	48	* **3 Combining Forces and Layers** (Master)**
49	49	**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.
	48	+* **2 Interactive Constraint Creation and Application in Automatic Layout **(Bachelor/Master)
	49	+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. Assess how such constraints can be persisted within the model.
50	50
51	51
52	52
53		-* **1 A (Simple) Edge Router** (Bachelor, Master)
	53	+* **1 A Simple Edge Router** (Bachelor)
54	54	Often, people want their nodes to stay in the same place, but have the edges routed somehow. We currently don't have any layout algorithm that can do so. In this assignment, you would implement a simple edge router to solve this.
55	55	* **1 Improved Spline Edge Routing **(Master)
56	56	Our layer-based layout algorithm is capable to route edges as splines. Evaluate the results using state machine diagrams, identify possible improvements and develop solutions to address these.
...	...	@@ -58,6 +58,7 @@
58	58	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.
59	59	* **3 Orthogonal "Edge Bundling"** (Bachelor, Master)
60	60	Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm.
	61	+*
61	61	\\
62	62
63	63	= Modeling Pragmatics =
...	...	@@ -101,7 +101,6 @@
101	101	Use the already implemented Model-to-Model-Tracing in KIELER to visualize simulations.
102	102	* **Incremental Compilation of SCEst** (Bachelor/Master)
103	103	Modify the KIELER SCEst language so that KIELER is able to compile Esterel step-by-step to C via SCL.
104		-For Master Students: Also add the possibility to compile from SCCharts to SCEst.
105	105	* **Incremental Model-based Compilation of Legacy C Programs** (Bachelor/Master)
106	106	Modify the model-based compiler in KIELER so that it is able to compile C to (S)CCharts incrementally.
107	107	* **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
...	...	@@ -108,8 +108,6 @@
108	108	Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
109	109	* **Transformation of Circuits to SCCharts** (Bachelor/Master)
110	110	Implement a transformation that translates circuits to (dataflow) SCCharts.
111		-* **eSCL - Implementing {{code language="none"}}gotopause{{/code}}** (Bachelor/Master)
112		-Create an extended dialect of the SC Language including the {{code language="none"}}gotopause{{/code}} statement and implement a transformation to SCL.
113	113
114	114
115	115
...	...	@@ -123,8 +123,6 @@
123	123	Add the possibility to perfom model checking on SCCharts
124	124	* **Core SCCharts Interpreter** (Master/Bachelor)
125	125	Implement an Interpreter for Core SCCharts.
126		-* **Derive M2M Transformations from Pseudocode** (Master/Bachelor)
127		-Create a Pseudocode DSL (and generator) to automatically derive M2M transformations.
128	128
129	129
130	130

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-20153068
	1	+20152351

URL

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