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

Content

...	...	@@ -1,37 +1,65 @@
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		-= Bachelor Topics =
	3	+**On this Page**
4	4
5		-== Graph Layout ==
6	6
7		-* (% style="line-height: 1.4285715;" %)**Implement Greedy Switch Heuristic for Crossing Minimization**(%%)
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		-* **{{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		-Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout.
11		-* **Integrate KIML with JGraph**
	6	+
	7	+{{toc/}}
	8	+
	9	+= Graph Layout =
	10	+
	11	+* **Tight Packing of Connected Components** (Bachelor)
	12	+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.
	13	+* **{{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}}Integrate KIML with JGraph** (Bachelor)
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		-* **{{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**
	15	+* **{{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** (Bachelor)
14	14	Our layout algorithm already supports the placement of edge labels. However, there's still room for improvement...
	17	+* **Layering Algorithms** (Bachelor, Master)
	18	+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.
	19	+* **Node Placement With a Focus on Compactness** (Master)
	20	+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.
	21	+* **Compound Graph Layout** (Master)
	22	+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.
	23	+* **Force Based Drawing with Port Constraints** (Master)
	24	+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"]].
	25	+* **Combining Forces and Layers** (Master)**
	26	+**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.
15	15
16		-== Modeling Pragmatics ==
	28	+= Modeling Pragmatics =
17	17
18		-* **Control Flow Graph Exploration / Visualization**
19		-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.
20		-* **OMG DD Format**
21		-Explore the mapping of [[KGraph>>doc:KGraph Meta Model]] / [[KRendering>>doc:The KRendering Notation Model]] to the [[Diagram Definition>>url:http://www.omg.org/spec/DD/||shape="rect"]] format of the OMG.
	30	+* **Comment Attachment** (Bachelor)
	31	+When computing a new layout for a diagram that contains comments (comparable to comments in source code), the comments often get placed far away of the nodes they refer to. This is because often the reference is not explicitly encoded in the original model. We have used a distance-based metric in the past to discover references automatically, but there are lots of ideas for improvement. This bachelor thesis would implement them, perhaps come up with additional ideas, and finally evaluate them in a thorough experiment.
	32	+* **Control Flow Graph Exploration / Visualization** (Bachelor)
	33	+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.
22	22
23		-== Semantics and Synchronous Languages ==
	35	+= Semantics and Synchronous Languages =
24	24
25	25	* **Validation Manager for Models**
26	26	Develop an integrated, flexible and generic syntactic validation framework for models (e.g. Esterel or SyncCharts).
27		-* **Esterel / SyncCharts Validation**
28		-Automate the validation for a (generic) SyncCharts simulator employing the Esterel simulator and the Esterel to SyncCharts transformation.
29		-* **Transformation from SyncCharts to Esterel** [possibly also Master Topic]
30		-Develop a transformation in Xtend2 to generate Esterel code for SyncCharts.
	39	+* **SCCharts compiler validation with Esterel**
	40	+Automate the validation of the SCCharts compiler using the Esterel simulation.
	41	+* **Transformation from SCCharts to Esterel** [possibly also Master Topic]
	42	+Develop a transformation in Xtend2 to generate Esterel code for SCCharts.
	43	+* **Hardware Synthesis from SCCharts to FPGA **[possibly also Master Topic]
	44	+Use the circuit-based code generation to produce code for FPGAs
	45	+* **Automatic documentation generation **[possibly also Master Topic]
	46	+Develop an automatic SCCharts documentation system
	47	+* **Optimizations for the SCCharts compiler **[possibly also Master Topic]
	48	+Profile the actual SCCharts compiler and apply optimizations
	49	+* **Multi-core SCCharts compiler **[possibly also Master Topic]
	50	+Implement the possibility to use more than one core to compile large SCCharts
	51	+* **Adding dataflow to SCCharts** [possibly also Master Topic]
	52	+Add dataflow to SCCharts
31	31
32		-== Miscellaneous Topics ==
	54	+= PRETSY / PRETSY2 =
33	33
34		-* **Developing an Info Screen**
	56	+* **Real-time extensions for SCCharts** [possibly also Master Topic]
	57	+Make the timing instructions //delay_until// und //exception_on_expire// of the [[FlexPRET>>url:http://rtsys.informatik.uni-kiel.de/confluence/Multithreaded/Multicore execution of SCCharts Evaluate possibilities to preserve parallelism in SCCharts, implement mapping for (fine grained) multithreading and multicore based on the FlexPRET||shape="rect"]] processor available in SCCharts.
	58	+* See also Semantics and Synchronous Languages: **Adding dataflow to SCCharts**
	59	+
	60	+= Miscellaneous Topics =
	61	+
	62	+* **Developing an Info Screen** (Bachelor)
35	35	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.
36	36
37	37	----
...	...	@@ -38,27 +38,26 @@
38	38
39	39	= (% style="color: rgb(0,0,0);" %)Master Topics(%%) =
40	40
41		-== Graph Layout ==
	69	+== Semantics and Synchronous Languages ==
42	42
43		-* **Layering Algorithms**
44		-Develop an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout. The algorithm shall be extended to consider the number of edge crossings and an optimal aspect ratio.
45		-* **Node Placement**
46		-Develop a new node placement algorithm that finds a good balance between keeping edges straight and keeping the drawing from getting too big.
47		-* (% style="line-height: 1.4285715;" %)**Compound Graph Layout**(%%)
48		-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.
49		-* **Force Based Drawing with Port Constraints**
50		-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"]].
51		-* **Combining Forces and Layers
52		-**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.
	71	+* **Quartz**
	72	+Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
	73	+* **Implementation of a priority-based compilation approach**
	74	+Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.
	75	+* **Curing Schizophrenia in SCCharts**
	76	+Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
	77	+* **Detecting tick boundaries in SCCharts**
	78	+Implement an algorithm that detects tick boundaries (in concurrent) threads and therefore improves the scheduling
	79	+* **Multithreaded/Multicore execution of SCCharts **(see below PRETSY/PRETSY2)**
	80	+**
	81	+* **Railway 2.0**
	82	+Design a new and modern hardware controlling (Version 4) for the railway installation.
53	53
54		-== Modeling Pragmatics ==
	84	+== PRETSY / PRETSY2 ==
55	55
56		-* **Diagram Description Language**
57		-Developing the concepts and implementation of a diagram description language based on Klighd, with SyncCharts as application example.
	86	+* **Multithreaded/Multicore execution of SCCharts**
	87	+Evaluate possibilities to preserve parallelism in SCCharts, implement mapping for (fine grained) multithreading and multicore
	88	+based on the [[FlexPRET>>url:http://www.eecs.berkeley.edu/Pubs/TechRpts/2013/EECS-2013-172.pdf||shape="rect"]] processor.**
	89	+**
58	58
59		-== Semantics and Synchronous Languages ==
60		-
61		-* **FPGA Statecharts**
62		-Development of a Statecharts editor, based on .NET, WPF, MS Silverlight. Synthesis onto FPGAs with a data-flow-based intermediate format.
63		-* **[Quartz]**
64		-Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
	91	+

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-9471600
	1	+10747971

URL

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