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.cds

Content

...	...	@@ -1,5 +1,11 @@
1		-Here's a selection of possible bachelor and master topics. If you're interested in one of them, don't hesitate to contact us! We'll sit down, have tea, and talk about what we could do together.
	1	+Here's a selection of possible bachelor and master topics. If you're interested in one of them, don't hesitate to contact us! We'll sit down, have tea, and talk about what we great things we could do together.
2	2
	3	+**On this Page**
	4	+
	5	+
	6	+
	7	+{{toc/}}
	8	+
3	3	= Bachelor Topics =
4	4
5	5	== Graph Layout ==
...	...	@@ -8,7 +8,9 @@
8	8	The order of nodes in a layer determines the number of crossings and is computed during the crossing minimization step. The results can usually be further improved by switching the order of nodes around, which we currently lack proper algorithms for.
9	9	* **{{jira columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-891"}}KIPRA-891{{/jira}}Layering Algorithms**
10	10	Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout.
11		-* **Integrate KIML with JGraph**
	17	+* Tight Packing of Connected Components
	18	+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.
	19	+* **{{jira columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" jqlQuery="key in (KIPRA-1262,KIPRA-1031)" source="jql" maximumIssues="20"}}key in (KIPRA-1262,KIPRA-1031){{/jira}}Integrate KIML with JGraph**
12	12	Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.
13	13	* **{{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**
14	14	Our layout algorithm already supports the placement of edge labels. However, there's still room for improvement...
...	...	@@ -36,6 +36,10 @@
36	36	Develop an automatic SCCharts documentation system
37	37	* **Optimizations for the SCCharts compiler **[possibly also Master Topic]
38	38	Profile the actual SCCharts compiler and apply optimizations
	47	+* **Multi-core SCCharts compiler **[possibly also Master Topic]
	48	+Implement the possibility to use more than one core to compile large SCCharts
	49	+* **Adding dataflow to SCCharts** [possibly also Master Topic]
	50	+Add dataflow to SCCharts
39	39
40	40	== Miscellaneous Topics ==
41	41
...	...	@@ -61,8 +61,6 @@
61	61
62	62	== Modeling Pragmatics ==
63	63
64		-
65		-
66	66	* **Diagram Description Language**
67	67	Developing the concepts and implementation of a diagram description language based on Klighd, with SyncCharts as application example.
68	68
...	...	@@ -74,11 +74,10 @@
74	74	Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.
75	75	* **Curing Schizophrenia in SCCharts**
76	76	Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
77		-* **Adding dataflow to SCCharts**
78		-Add dataflow to SCCharts
79	79	* **Detecting tick boundaries in SCCharts**
80	80	Implement an algorithm that detects tick boundaries (in concurrent) threads and therefore improves the scheduling
81		-* **Preserving concurrency for multi-core **
82		-Evaluate possibilities to preserve parallelism in SCCharts**.**
	89	+* **Preserving concurrency/parallelism for multi-core **
	90	+Evaluate possibilities to preserve parallelism in SCCharts**.
	91	+**
83	83	* **Railway 2.0**
84	84	Design a new and modern hardware controlling (Version 4) for the railway installation.

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-9471794
	1	+9471823

URL

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