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.uru
	1	+XWiki.ima

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	* **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		-* **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		-* **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	* **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	* **Node Placement With a Focus on Compactness** (Master)
...	...	@@ -41,40 +41,39 @@
41	41
42	42
43	43
44		-* **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	* **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	* **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	+* **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.
50	50
51	51
52	52
	53	+* **Orthogonal "Edge Bundling"** (Bachelor, Master)
	54	+Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm.
	55	+* **A Simple Edge Router** (Bachelor)
	56	+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.
53	53	* **Improved Spline Edge Routing **(Master)
54	54	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.
55		-* **Orthogonal "Edge Bundling"** (Bachelor, Master)
56		-Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm.
	59	+* **Improve and Assess KLay Layered's JUnit Test Environment **(Bachelor, Master)
	60	+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.
57	57	\\
58		-* **Force-directed Methods for State Machine Layout** (Master)
59		-We currently use layer-based methods to layout SCCharts, a state machine dialect. The goal of this topic is to evaluate and implement force-directed methods to lay out SCCharts. Hard requirements are a proper placement of edge labels, proper routing of edges, and being able to specify the relative positioning of certain nodes to each other.
60		-* **Routing of Self-Loops** (Master)
61		-Self-loops are an integral part of many diagram types, for instance, of state diagrams and dataflow diagrams. Properly routing self-loops is not as easy as one may think. The task of this topic is to evaluate and implement different strategies to route self-loops for three edge routing styles: polyline, orthogonal, and splines. Labels of self loops are to be considered as well.
62		-\\
63	63
64	64	= Modeling Pragmatics =
65	65
66		-**Advisors:** Reinhard von Hanxleden, Ulf Rüegg, Christoph Daniel Schulze
	65	+**Advisors:** Reinhard von Hanxleden, Ulf Rüegg, Christoph Daniel Schulze, Insa Fuhrmann
67	67
68		-* **1 Compound Graph Exploration** (Bachelor, Master)
	67	+* **Control Flow Graph Exploration / Visualization** (Bachelor)
	68	+Use pragmatics concepts (automatic layout, focus & context) for exploring/visualizing control flow graphs and specific paths, eg. as computed by OTAWA WCET analysis tool, eg. using KLighD.
	69	+* **Compound Graph Exploration** (Bachelor, Master)
69	69	A new graph exploration approach should be examined which is uses different zoom levels for different compound nodes. This tries to map the "Google Maps approach" of only showing the information of interest at any given zoom level to the field of graph exploration.
70		-* **1 OpenStreetMap-Based Model Exploration** (Bachelor, Master)
	71	+* **OpenStreetMap-Based Model Exploration** (Bachelor, Master)
71	71	Implement a prototype to investigate whether OpenStreetMap can be used to display custom data (such as, say, rendered diagrams) to use its filtering and exploration features for exploring large diagrams.
72		-* **3 Control Flow Graph Exploration / Visualization** (Bachelor)
73		-Use pragmatics concepts (automatic layout, focus & context) for exploring/visualizing control flow graphs and specific paths, eg. as computed by OTAWA WCET analysis tool, eg. using KLighD.
74	74
75	75	= Semantics, Synchronous Languages and Model-based Design =
76	76
77		-**Advisors:** Steven Smyth, Alexander Schulz-Rosengarten, Reinhard v. Hanxleden
	76	+**Advisors:** Christian Motika, Steven Smyth, Reinhard v. Hanxleden, Insa Fuhrmann
78	78
79	79	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.
80	80
...	...	@@ -89,64 +89,44 @@
89	89
90	90
91	91
92		-//SCCharts Modelling & Transformations//
93		-
	91	+* (% style="line-height: 1.4285715;" %)**Optimization of the SCCharts compiler/transformations **(%%)(Bachelor/Master)
	92	+Profile the actual SCCharts compiler/transformations and apply optimizations; also evaluate the possibility to use multiple cores for compilation
94	94	* (% style="line-height: 1.4285715;" %)**On the pragmatics of modeling large models in SCCharts**(%%) (Bachelor/Master)
95	95	Evaluate the possibilities to create and maintain large models in model-based languages (i.e. SCCharts) and provide suggestions for improvements
96		-* **Transformation of Circuits to SCCharts** (Bachelor/Master)
97		-Implement a transformation that translates circuits to (dataflow) SCCharts.
98		-* **SCCharts Verification** (Master/Bachelor)
99		-Add the possibility to perfom model checking on SCCharts
100		-* **Transformation Verification** (Master/Bachelor)
101		-Develop a method for SCCharts to check transformations for semantic equivalence.
102		-* **Derive M2M Transformations from Pseudocode** (Master/Bachelor)
103		-Create a Pseudocode DSL (and generator) to automatically derive M2M transformations.
104		-* **Raceyard evaluation** (Master)
105		-Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
106		-
107		-//SCCharts Code Generation & Optimizations//
108		-
109		-* **Optimization of the SCCharts compiler/transformations **(Bachelor/Master)
110		-Profile the actual SCCharts compiler/transformations and apply optimizations; also evaluate the possibility to use multiple cores for compilation.
111		-* **SCG Optimization based on SSA **(Bachelor/Master)
112		-The Static Single Assignment form enables powerful optimizations such as [[sparse conditional constant propagation>>url:http://dl.acm.org/citation.cfm?id=103136||shape="rect"]]. Adjust and implement this algorithm in the context of SCGs and evaluate the result.
	95	+* **Visualization of Model-based Simulation via Tracing** (Bachelor/Master)
	96	+Use the already implemented Model-to-Model-Tracing in KIELER to visualize simulations.
	97	+* **Incremental Compilation of SCEst** (Bachelor/Master)
	98	+Modify the KIELER SCEst language so that KIELER is able to compile Esterel step-by-step to C via SCL.
	99	+* **Model-based Compilation of Legacy C Programs** (Bachelor/Master)
	100	+Implement a model-based compiler in KIELER that is able to compile C to (S)CCharts and then back to C again.
113	113	* **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
114	114	Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
115		-* **Efficient data dependency & scheduling analyses in SCCharts** (Master/Bachelor)
116		-Implement analyses for data dependency, scheduling (e.g. tick boundaries) for SCCharts to improve static scheduling of the compiler.
	103	+* **Transformation of Circuits to SCCharts** (Bachelor/Master)
	104	+Implement a transformation that translates circuits to (dataflow) SCCharts.
	105	+* **On the Pragmatics of Interactive Timing Information Feedback for Graphical Modeling** (Bachelor)
	106	+Use Pragmatics concepts to enhance the timing information feedback of the Interactive Timing Analysis.
	107	+\\\\
	108	+* **On the Pragmatics of Interactive Timing Information Feedback for Graphical Modeling** (Bachelor)
	109	+Use Pragmatics and enhanced visualization for the timing information feedback of the Interactive Timing Analysis.
	110	+\\\\
	111	+* **Efficient data dependency & scheduling analyses in SCCharts** (Master/Bachelor)
	112	+Implement analyses for data dependency, scheduling (e.g. tick boundaries) for SCCharts to improve static scheduling of the compiler
117	117	* **Curing Schizophrenia in SCCharts **(Master/Bachelor)
118	118	Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
119		-
120		-//SCCharts Simulation//
121		-
122		-* **Visualization of Model-based Simulation via Tracing** (Bachelor/Master)
123		-Use the already implemented Model-to-Model-Tracing in KIELER to visualize simulations.
124		-* **Environment Simulations for SCCharts** (Master/Bachelor)
	115	+* **SCCharts Debugging** (Master/Bachelor)
	116	+Implement more sophisticated debugging mechanisms (e.g. breakpoints, observers) for SCCharts
	117	+* **Environment Simulations for SCCharts** (Master/Bachelor)
125	125	Develop a system to simulate environments (e.g. for Lego Mindstorms) for SCCharts in KIELER
126		-* **Core SCCharts Interpreter** (Master/Bachelor)
127		-Implement an Interpreter for Core SCCharts.
128		-
129		-//Model-based C Code Compilation//
130		-
131		-* **Incremental Model-based Compilation of Legacy C Programs** (Bachelor/Master)
132		-Modify the model-based compiler in KIELER so that it is able to compile C to (S)CCharts incrementally.
133		-* **Execution of Recursive Dataflow Code** (Master/Bachelor)
134		-* **Execution of Concurrent Dataflow Code** (Master/Bachelor)
135		-Modify the model-based dataflow compiler in KIELER so that it is able to compile recursive/concurrent C programs.
136		-For Master students: Implement both.
137		-
138		-//Synchronous Languages//
139		-
140		-* **Incremental Compilation of SCEst** (Bachelor/Master)
141		-Modify the KIELER SCEst language so that KIELER is able to compile Esterel step-by-step to C via SCL.
142		-For Master Students: Also add the possibility to compile from SCCharts to SCEst.
143		-* **eSCL - Implementing {{code language="none"}}gotopause{{/code}}** (Bachelor/Master)
144		-Create an extended dialect of the SC Language including the {{code language="none"}}gotopause{{/code}} statement and implement a transformation to SCL.
	119	+* **SCCharts Verification** (Master/Bachelor)
	120	+Add the possibility to perfom model checking on SCCharts
	121	+\\\\
145	145	* **Quartz **(Master)
146	146	Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
	124	+* --**Implementation of a priority-based compilation approach **(Master) --
	125	+--Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.--
	126	+* **Raceyard evaluation** (Master)
	127	+Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
147	147
148		-
149		-
150	150	= (% style="color: rgb(0,0,0);" %)Miscellaneous Topics(%%) =
151	151
152	152	**Advisors:** to be determined.
...	...	@@ -153,15 +153,3 @@
153	153
154	154	* **Developing an Info Screen** (Bachelor)
155	155	Info screens are screens that present data in ways that can be easily understood. This includes static data (project description graphics, members of a team, ...) as well as dynamically aggregated data (bug statistics, automatic build overviews, ...). This topic is about developing such an info screen for our group and making it easily configurable.
156		-\\
157		-* **Developing a domain specific language (DSL) for model railway control** (Bachelor/Master)
158		-We maintain a model railway installation as a demonstrator for our work and as a student teaching tool. Especially for demonstations to non-technical visitors we would like to have a simple language to create controllers for the railway.
159		-
160		-
161		-
162		-(% style="display: none;" %)
163		-(((
164		-408
165		-)))
166		-
167		-

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-25952324
	1	+15532296

URL

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