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

Content

...	...	@@ -2,25 +2,31 @@
2	2
3	3	= Bachelor Topics =
4	4
5		-== Graph Layout ==
	5	+== Diagram Layout ==
6	6
7	7	* **Add Support for Self Loops for Polyline / Spline Layouts
8		-**Self loops, that is, edges connecting a node with itself, need to be properly routed. This is already implemented for orthogonal edge routing, but is still an open problem for spline and polyline edge routing.
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-1073"}}KIPRA-1073{{/jira}}Implement Greedy Switch Heuristic for Crossing Minimization**
10		-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.
11		-* **{{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**
	8	+**Self loops, that is, edges connecting a node with itself, need to be properly routed. This is already implemented for orthogonal edge routing, but is still an open problem for spline and polyline edge routing. (See ticket [[KIELER-2136>>url:http://rtsys.informatik.uni-kiel.de/jira/browse/KIELER-2136||shape="rect"]].)
	9	+* **Heuristics for Side Aware Edge Label Placement**
	10	+Think about and implement heuristic algorithms for solving the edge aware edge label placement problem for placing edge labels in data flow diagrams.
	11	+* **Implement Greedy Switch Heuristic for Crossing Minimization**
	12	+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. (See ticket [[KIELER-1871>>url:http://rtsys.informatik.uni-kiel.de/jira/browse/KIELER-1871||shape="rect"]])
	13	+* **Layering Algorithms**
12	12	Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout.
13		-* **Integrate KIML with JGraph**
14		-Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.
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**
16		-Our layout algorithm already supports the placement of edge labels. However, there's still room for improvement...
	15	+* **Node Placement Algorithms**
	16	+Implement alternative algorithms for node placement to minimize the number of bend points produced.
17	17
18	18	== Modeling Pragmatics ==
19	19
20	20	* **Control Flow Graph Exploration / Visualization**
21	21	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	+* **Incremental Update for Klighd**
	23	+Incremental update of Klighd data structure after editing.
22	22	* **OMG DD Format**
23	23	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.
	26	+* **SyncCharts and Actor Model Visualization**
	27	+Develop an integrated viewer for [[doc:SCCharts SyncCharts]] and [[KAOM>>doc:Actor Oriented Modeling (KAOM)]] models using [[KLighD>>doc:Lightweight Diagrams (KLighD)]], including view management techniques such as focus & context and structure-based editing.
	28	+* **Visualizing Model Edits/Changes**
	29	+Develop and implement methods to visualize a model while it is edited. A particular concern here is the preservation of the mental map.
24	24
25	25	== Semantics and Synchronous Languages ==
26	26
...	...	@@ -36,31 +36,13 @@
36	36	* **Developing an Info Screen**
37	37	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.
38	38
39		-----
	45	+= Master Topics =
40	40
41		-= (% style="color: rgb(0,0,0);" %)Master Topics(%%) =
42		-
43		-== Graph Layout ==
44		-
45		-* **Layering Algorithms**
46		-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.
47		-* **Spline Layout**
48		-Develop a proper spline routing for KLay Layered. Part of this would be implementing self-loops with splines. The expected end result is that KLay Layered can well be used to layout state charts.
49		-* **Compound Graph Layout**
50		-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.
51		-* **Force Based Drawing with Port Constraints**
52		-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"]].
53		-* **Combining Forces and Layers
54		-**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.
55		-
56		-== Modeling Pragmatics ==
57		-
58		-* **Diagram Description Language**
59		-Developing the concepts and implementation of a diagram description language based on Klighd, with SyncCharts as application example.
60		-
61		-== Semantics and Synchronous Languages ==
62		-
	47	+* **SyncCharts in Yakindu**
	48	+Develop a SyncChart-Editor based on Yakindu, including basic pragmatics concept (automatic layout, collapse/expand, structure-based editing) and interfacing to host-language.
63	63	* **FPGA Statecharts**
64	64	Development of a Statecharts editor, based on .NET, WPF, MS Silverlight. Synthesis onto FPGAs with a data-flow-based intermediate format.
	51	+* **Diagram Description Language**
	52	+Developing the concepts and implementation of a diagram description language based on Klighd, with SyncCharts as application example.
65	65	* **[Quartz]**
66	66	Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-9470121
	1	+8651033

URL

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