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

Content

...	...	@@ -24,27 +24,40 @@
24	24
25	25	//» Dienste.// Algorithmen und Meta Layout müssen den Anwendern zugänglich gemacht werden, damit ein Nutzen daraus entsteht. Dazu müssen wir verschiedenste graphische Frameworks mit vorhandenen Layout-Bibliotheken integrieren und eine Reihe von Werkzeugen entwickeln, mit denen die Verfügbarkeit unserer Lösungen gesteigert wird. Hierzu gehört z.B. die Unterstützung von Standard-Graphenformaten sowie ein Web-Service für automatisches Layout.
26	26
27		-* **Tight Packing of Connected Components** (Bachelor)
	27	+* **Tight Packing of Connected Components** (Bachelor, Master)
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		-{{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}}Implement and Evaluate a Layout Algorithm for Simple Cluster Graphs** (Bachelor/Master)
31		-Cluster graphs are graphs in which every node belongs can belong to one or more groups of nodes, or //clusters//. The clusters can overlap and do not need to form a hierarchy. We already have some ideas for laying out cluster graphs with simple structures. This topic focusses on implementing at least one of these ideas and evaluating it to find out if it works well.
	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}}\\
	30	+
	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	+
32	32	* **Layering Algorithms** (Bachelor, Master)
33		-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.
34		-* **Combining Forces and Layers** (Master)**
35		-**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	+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.
36	36	* **Node Placement With a Focus on Compactness** (Master)
37	37	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.
	41	+
	42	+
	43	+
38	38	* **Force Based Drawing with Port Constraints** (Master)
39	39	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"]].
	46	+* **Combining Forces and Layers** (Master)**
	47	+**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	* **Interactive constraint creation and application in automatic layout **(Bachelor/Master)
41	41	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	+
	51	+
	52	+
42	42	* **Orthogonal "Edge Bundling"** (Bachelor, Master)
43	43	Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm.
44		-* **Improve and Assess KLay Layered's JUnit Test Environment**
45		-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.
46	46	* **A Simple Edge Router** (Bachelor)
47	47	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.
	57	+* **Improved Spline Edge Routing **(Master)
	58	+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.
	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.
48	48	\\
49	49
50	50	= Modeling Pragmatics =
...	...	@@ -71,41 +71,40 @@
71	71
72	72	In diesem Kontext sind Themenstellungen für Bachelor-/Master-/Diplom- und Studienarbeiten beispielhaft genannt. Bei Fragen oder sprechen Sie einen Betreuer bitte direkt an:
73	73
74		-* --**Automatic documentation generation for model-based languages **(Bachelor)--
75		---Develop an automatic SCCharts documentation & comment system--
76		-* --**On the usability of the KIELER SCCharts compiler** (Bachelor)--
77		---Evaluate the actual implementation of the KIELER SCCharts compiler and provide suggestions for improvements, i.e. the usability as standalone (commandline) compiler--
78		-\\\\
79		-* --**Transformation from SCCharts to Esterel** (Bachelor/Master)--
80		---Develop a transformation in Xtend2 to generate Esterel code for SCCharts.--
81		-* --**Hardware Synthesis from SCCharts to FPGA **(Bachelor/Master)--
82		---Use the circuit-based code generation approach to produce code for FPGAs--
	87	+
	88	+
83	83	* (% style="line-height: 1.4285715;" %)**Optimization of the SCCharts compiler/transformations **(%%)(Bachelor/Master)
84	84	Profile the actual SCCharts compiler/transformations and apply optimizations; also evaluate the possibility to use multiple cores for compilation
85	85	* (% style="line-height: 1.4285715;" %)**On the pragmatics of modeling large models in SCCharts**(%%) (Bachelor/Master)
86	86	Evaluate the possibilities to create and maintain large models in model-based languages (i.e. SCCharts) and provide suggestions for improvements
87		-* **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
	93	+* **Visualization of Model-based Simulation via Tracing** (Bachelor/Master)
	94	+Use the already implemented Model-to-Model-Tracing in KIELER to visualize simulations.
	95	+* **Incremental Compilation of SCEst** (Bachelor/Master)
	96	+Modify the KIELER SCEst language so that KIELER is able to compile Esterel step-by-step to C via SCL.
	97	+* **Model-based Compilation of Legacy C Programs** (Bachelor/Master)
	98	+Implement a model-based compiler in KIELER that is able to compile C to (S)CCharts and then back to C again.
	99	+* **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
88	88	Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
89		-* **The Semantics of Hybrid SCCharts** (Bachelor/Master)
90		-Evaluate SCCharts hybrid models and define semantics for the new features of SCCharts (3.0).
	101	+* **Transformation of Circuits to SCCharts** (Bachelor/Master)
	102	+Implement a transformation that translates circuits to (dataflow) SCCharts.
91	91	\\\\
92		-* **Detecting tick boundaries in SCCharts **(Master/Bachelor)
93		-Implement an algorithm that detects tick boundaries (in concurrent) threads and therefore improves the scheduling
94		-* **Efficient data dependency analyses in SCCharts** (Master/Bachelor)
95		-Implement data dependency analyses for SCCharts to improve static scheduling of the compiler
96		-* --**KIELER evaluation environment for synchronous languages** (Master/Bachelor)--
97		---Develop a reliable evaluation environment to compare common synchronous languages (i.e. Esterel/SyncCharts & SCCharts)--
98		-* **Raceyard evaluation** (Master/Bachelor)
99		-Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
	104	+* **Efficient data dependency & scheduling analyses in SCCharts** (Master/Bachelor)
	105	+Implement analyses for data dependency, scheduling (e.g. tick boundaries) for SCCharts to improve static scheduling of the compiler
100	100	* **Curing Schizophrenia in SCCharts **(Master/Bachelor)
101	101	Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
102		-* --**Hybrid Models for Legacy Code Extraction **(Master/Bachelor)--
103		---Extract legacy code (e.g. legacy C code) to (SCCharts) Hybrid Models.--
	108	+* **SCCharts Debugging** (Master/Bachelor)
	109	+Implement more sophisticated debugging mechanisms (e.g. breakpoints, observers) for SCCharts
	110	+* **Environment Simulations for SCCharts** (Master/Bachelor)
	111	+Develop a system to simulate environments (e.g. for Lego Mindstorms) for SCCharts in KIELER
	112	+* **SCCharts Verification** (Master/Bachelor)
	113	+Add the possibility to perfom model checking on SCCharts
104	104	\\\\
105	105	* **Quartz **(Master)
106	106	Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
107		-* **Implementation of a priority-based compilation approach **(Master)
108		-Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.
	117	+* --**Implementation of a priority-based compilation approach **(Master) --
	118	+--Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.--
	119	+* **Raceyard evaluation** (Master)
	120	+Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
109	109
110	110	= PRETSY / PRETSY2 =
111	111

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-15532042
	1	+15532287

URL

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