Skip to Content

Changes for page Available Topics

Last modified by Maximilian Kasperowski on 2026/03/09 09:06
From version 76.1
edited by uru
on 2016/08/23 14:55
Change comment: There is no comment for this version
To version 81.1
edited by ssm
on 2016/08/23 15:56
Change comment: There is no comment for this version

Summary

Details

Page properties
Author
... ... @@ -1,1 +1,1 @@
1 -XWiki.uru
1 +XWiki.ssm
Content
... ... @@ -28,14 +28,12 @@
28 28  
29 29  * **1 Tight Packing of Connected Components** (Bachelor, Master)
30 30  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.
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-1262"}}KIPRA-1262{{/jira}}\\
31 +\\
32 32  
33 -{{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"}}
34 -KIPRA-1031
35 -{{/jira}}
36 -
37 -
38 -
33 +* **2 Heuristics for the Compact Layering Problem** (Bachelor, Master)
34 +Usually the layer assignment problem of the layer-based approach seeks to let as many edges as possible point into the same direction. Refraining from doing so sometimes allows more compact drawings, which so far has been evaluated using optimization problems. The task is to find and evaluate appropriate heuristics.
35 +* **2 Evaluate Impact of Reversing Edges on Humans** (Master)
36 +Reversing edges during the layer assignment problem as suggested by the previous topic may have a negative impact on the readability of diagram. User-studies should be carefully planned and conducted to answer two questions: which edges are naturally reversed by humans and does reversing too many edges worsen comprehensibility?
39 39  * **2 Layering Algorithms** (Bachelor, Master)
40 40  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.
41 41  * **2 Node Placement With a Focus on Compactness** (Master)
... ... @@ -43,16 +43,16 @@
43 43  
44 44  
45 45  
44 +* **2 Interactive Constraint Creation and Application in Automatic Layout **(Bachelor, Master)
45 +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.
46 46  * **3 Force Based Drawing with Port Constraints** (Master)
47 47  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"]].
48 48  * **3 Combining Forces and Layers** (Master)**
49 49  **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.
50 -* **2 Interactive Constraint Creation and Application in Automatic Layout **(Bachelor/Master)
51 -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.
52 52  
53 53  
54 54  
55 -* **1 A Simple Edge Router** (Bachelor)
53 +* **1 A (Simple) Edge Router** (Bachelor, Master)
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 57  * **1 Improved Spline Edge Routing **(Master)
58 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.
... ... @@ -103,6 +103,7 @@
103 103  Use the already implemented Model-to-Model-Tracing in KIELER to visualize simulations.
104 104  * **Incremental Compilation of SCEst** (Bachelor/Master)
105 105  Modify the KIELER SCEst language so that KIELER is able to compile Esterel step-by-step to C via SCL.
104 +For Master Students: Also add the possibility to compile from SCCharts to SCEst.
106 106  * **Incremental Model-based Compilation of Legacy C Programs** (Bachelor/Master)
107 107  Modify the model-based compiler in KIELER so that it is able to compile C to (S)CCharts incrementally.
108 108  * **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
... ... @@ -109,6 +109,8 @@
109 109  Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
110 110  * **Transformation of Circuits to SCCharts** (Bachelor/Master)
111 111  Implement a transformation that translates circuits to (dataflow) SCCharts.
111 +* **eSCL - Implementing {{code language="none"}}gotopause{{/code}}** (Bachelor/Master)
112 +Create an extended dialect of the SC Language including the {{code language="none"}}gotopause{{/code}} statement and implement a transformation to SCL.
112 112  
113 113  
114 114  
... ... @@ -122,6 +122,8 @@
122 122  Add the possibility to perfom model checking on SCCharts
123 123  * **Core SCCharts Interpreter** (Master/Bachelor)
124 124  Implement an Interpreter for Core SCCharts.
126 +* **Derive M2M Transformations from Pseudocode** (Master/Bachelor)
127 +Create a Pseudocode DSL (and generator) to automatically derive M2M transformations.
125 125  
126 126  
127 127  
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -20152353
1 +20153068
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/20152353/Topics for Student Theses
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/20153068/Topics for Student Theses