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

...	...	@@ -8,7 +8,7 @@
8	8
9	9
10	10
11		-{{toc/}}
	11	+{{toc exclude="Outline"/}}
12	12
13	13	= Automatic Graph Layout =
14	14
...	...	@@ -37,12 +37,10 @@
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	38	* **Interactive constraint creation and application in automatic layout **(Bachelor/Master)
39	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.
40		-\\
41	41	* **Compound Graph Layout** (Master)
42	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	43	* **Orthogonal "Edge Bundling"** (Bachelor, Master)
44	44	Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm.
45		-\\
46	46	* **Integrate KIML with JGraph** (Bachelor)
47	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	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**
...	...	@@ -82,14 +82,14 @@
82	82	Develop a transformation in Xtend2 to generate Esterel code for SCCharts.
83	83	* **Hardware Synthesis from SCCharts to FPGA **(Bachelor/Master)
84	84	Use the circuit-based code generation approach to produce code for FPGAs
85		-* (% style="line-height: 1.4285715;" %)**Optimization of the SCCharts compiler **(%%)(Bachelor/Master)
86		-Profile the actual SCCharts compiler and apply optimizations; also evaluate the possibility to use multiple cores for compilation
87		-* **Optimization of the SCCharts transformations** (Bachelor/Master)
88		-Profile the actual SCCharts transformations and apply optimizations
89		-* **On the pragmatics of modeling large models in SCCharts** (Bachelor/Master)
	83	+* (% style="line-height: 1.4285715;" %)**Optimization of the SCCharts compiler/transformations **(%%)(Bachelor/Master)
	84	+Profile the actual SCCharts compiler/transformations and apply optimizations; also evaluate the possibility to use multiple cores for compilation
	85	+* (% style="line-height: 1.4285715;" %)**On the pragmatics of modeling large models in SCCharts**(%%) (Bachelor/Master)
90	90	Evaluate the possibilities to create and maintain large models in model-based languages (i.e. SCCharts) and provide suggestions for improvements
91	91	* **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
92	92	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).
93	93	\\\\
94	94	* **Detecting tick boundaries in SCCharts **(Master/Bachelor)
95	95	Implement an algorithm that detects tick boundaries (in concurrent) threads and therefore improves the scheduling
...	...	@@ -99,15 +99,15 @@
99	99	Develop a reliable evaluation environment to compare common synchronous languages (i.e. Esterel/SyncCharts & SCCharts)
100	100	* **Raceyard evaluation** (Master/Bachelor)
101	101	Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
	100	+* **Curing Schizophrenia in SCCharts **(Master/Bachelor)
	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.
102	102	\\\\
103	103	* **Quartz **(Master)
104	104	Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
105	105	* **Implementation of a priority-based compilation approach **(Master)
106	106	Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.
107		-* **Curing Schizophrenia in SCCharts **(Master)
108		-Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
109		-* **Hybrid Models for Legacy Code Extraction**
110		-Extract legacy code (e.g. legacy C code) to (SCCharts) Hybrid Models.
111	111
112	112	= PRETSY / PRETSY2 =
113	113

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-13009004
	1	+13762907

URL

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