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.nbw
	1	+XWiki.ima

Content

...	...	@@ -24,7 +24,7 @@
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		-* **1 Tight Packing of Connected Components** (Bachelor, Master)
	27	+* **Tight Packing of Connected Components** (Bachelor, Master)
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	30
...	...	@@ -34,31 +34,30 @@
34	34
35	35
36	36
37		-* **2 Layering Algorithms** (Bachelor, Master)
	37	+* **Layering Algorithms** (Bachelor, Master)
38	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.
39		-* **2 Node Placement With a Focus on Compactness** (Master)
	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	41
42	42
43	43
44		-* **3 Force Based Drawing with Port Constraints** (Master)
	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		-* **3 Combining Forces and Layers** (Master)**
	46	+* **Combining Forces and Layers** (Master)**
47	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		-* **2 Interactive Constraint Creation and Application in Automatic Layout **(Bachelor/Master)
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. Assess how such constraints can be persisted within the model.
	48	+* **Interactive constraint creation and application in automatic layout **(Bachelor/Master)
	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	50
51	51
52	52
53		-* **1 A Simple Edge Router** (Bachelor)
	53	+* **Orthogonal "Edge Bundling"** (Bachelor, Master)
	54	+Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm.
	55	+* **A Simple Edge Router** (Bachelor)
54	54	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.
55		-* **1 Improved Spline Edge Routing **(Master)
	57	+* **Improved Spline Edge Routing **(Master)
56	56	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.
57		-* **1 Improve and Assess KLay Layered's JUnit Test Environment **(Bachelor, Master)
	59	+* **Improve and Assess KLay Layered's JUnit Test Environment **(Bachelor, Master)
58	58	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.
59		-* **3 Orthogonal "Edge Bundling"** (Bachelor, Master)
60		-Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm.
61		-*
62	62	\\
63	63
64	64	= Modeling Pragmatics =
...	...	@@ -65,12 +65,10 @@
65	65
66	66	**Advisors:** Reinhard von Hanxleden, Ulf Rüegg, Christoph Daniel Schulze, Insa Fuhrmann
67	67
68		-* **1 Compound Graph Exploration** (Bachelor, Master)
69		-A new graph exploration approach should be examined which is uses different zoom levels for different compound nodes. This tries to map the "Google Maps approach" of only showing the information of interest at any given zoom level to the field of graph exploration.
70		-* **1 OpenStreetMap-Based Model Exploration** (Bachelor, Master)
71		-Implement a prototype to investigate whether OpenStreetMap can be used to display custom data (such as, say, rendered diagrams) to use its filtering and exploration features for exploring large diagrams.
72		-* **3 Control Flow Graph Exploration / Visualization** (Bachelor)
	67	+* **Control Flow Graph Exploration / Visualization** (Bachelor)
73	73	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.
	69	+* **Compound Graph Exploration** (Bachelor, Master)
	70	+A new graph exploration approach should be examined which is uses different zoom levels for different compound nodes. This tries to map the "Google Maps approach" of only showing the information of interest at any given zoom level to the field of graph exploration.
74	74
75	75	= Semantics, Synchronous Languages and Model-based Design =
76	76
...	...	@@ -89,11 +89,6 @@
89	89
90	90
91	91
92		-* (% style="line-height: 1.4285715;" %)**On the Pragmatics of Interactive Timing Information Feedback for Graphical Modeling **(%%)(Bachelor)(% style="line-height: 1.4285715;" %)**
93		-**(%%)Use Pragmatics concepts to enhance the timing information feedback of the Interactive Timing Analysis.
94		-
95		-
96		-
97	97	* (% style="line-height: 1.4285715;" %)**Optimization of the SCCharts compiler/transformations **(%%)(Bachelor/Master)
98	98	Profile the actual SCCharts compiler/transformations and apply optimizations; also evaluate the possibility to use multiple cores for compilation
99	99	* (% style="line-height: 1.4285715;" %)**On the pragmatics of modeling large models in SCCharts**(%%) (Bachelor/Master)
...	...	@@ -102,30 +102,30 @@
102	102	Use the already implemented Model-to-Model-Tracing in KIELER to visualize simulations.
103	103	* **Incremental Compilation of SCEst** (Bachelor/Master)
104	104	Modify the KIELER SCEst language so that KIELER is able to compile Esterel step-by-step to C via SCL.
105		-* **Incremental Model-based Compilation of Legacy C Programs** (Bachelor/Master)
106		-Modify the model-based compiler in KIELER so that it is able to compile C to (S)CCharts incrementally.
	97	+* **Model-based Compilation of Legacy C Programs** (Bachelor/Master)
	98	+Implement a model-based compiler in KIELER that is able to compile C to (S)CCharts and then back to C again.
107	107	* **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
108	108	Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
109	109	* **Transformation of Circuits to SCCharts** (Bachelor/Master)
110	110	Implement a transformation that translates circuits to (dataflow) SCCharts.
111		-
112		-
113		-
	103	+* **On the Pragmatics of Interactive Timing Information Feedback for graphical modeling** (Bachelor)
	104	+Use Pragmatics concepts to enhance the timing information feedback of the Interactive Timing Analysis.
	105	+\\\\
114	114	* **Efficient data dependency & scheduling analyses in SCCharts** (Master/Bachelor)
115	115	Implement analyses for data dependency, scheduling (e.g. tick boundaries) for SCCharts to improve static scheduling of the compiler
116	116	* **Curing Schizophrenia in SCCharts **(Master/Bachelor)
117	117	Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
	110	+* **SCCharts Debugging** (Master/Bachelor)
	111	+Implement more sophisticated debugging mechanisms (e.g. breakpoints, observers) for SCCharts
118	118	* **Environment Simulations for SCCharts** (Master/Bachelor)
119	119	Develop a system to simulate environments (e.g. for Lego Mindstorms) for SCCharts in KIELER
120	120	* **SCCharts Verification** (Master/Bachelor)
121	121	Add the possibility to perfom model checking on SCCharts
122		-* **Core SCCharts Interpreter** (Master/Bachelor)
123		-Implement an Interpreter for Core SCCharts.
124		-
125		-
126		-
	116	+\\\\
127	127	* **Quartz **(Master)
128	128	Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
	119	+* --**Implementation of a priority-based compilation approach **(Master) --
	120	+--Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.--
129	129	* **Raceyard evaluation** (Master)
130	130	Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
131	131

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-20152351
	1	+15532291

URL

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