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

Content

...	...	@@ -24,40 +24,27 @@
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, Master)
	27	+* **Tight Packing of Connected Components** (Bachelor)
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	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		-
	30	+* **{{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"}}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.
37	37	* **Layering Algorithms** (Bachelor, Master)
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.
	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.
39	39	* **Node Placement With a Focus on Compactness** (Master)
40	40	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		-
44	44	* **Force Based Drawing with Port Constraints** (Master)
45	45	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.
48	48	* **Interactive constraint creation and application in automatic layout **(Bachelor/Master)
49	49	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		-
53	53	* **Orthogonal "Edge Bundling"** (Bachelor, Master)
54	54	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.
55	55	* **A Simple Edge Router** (Bachelor)
56	56	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.
61	61	\\
62	62
63	63	= Modeling Pragmatics =
...	...	@@ -109,8 +109,6 @@
109	109	Implement more sophisticated debugging mechanisms (e.g. breakpoints, observers) for SCCharts
110	110	* **Environment Simulations for SCCharts** (Master/Bachelor)
111	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
114	114	\\\\
115	115	* **Quartz **(Master)
116	116	Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-15532287
	1	+15532274

URL

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