Skip to Content

Changes for page Available Topics

Last modified by Maximilian Kasperowski on 2026/03/09 09:06
From version 77.1
edited by uru
on 2016/08/23 15:04
Change comment: There is no comment for this version
To version 82.1
edited by ssm
on 2016/09/28 11:09
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,8 @@
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 -
39 39  * **2 Heuristics for the Compact Layering Problem** (Bachelor, Master)
40 40  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.
41 41  * **2 Evaluate Impact of Reversing Edges on Humans** (Master)
... ... @@ -47,8 +47,8 @@
47 47  
48 48  
49 49  
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.\\
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.
52 52  * **3 Force Based Drawing with Port Constraints** (Master)
53 53  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"]].
54 54  * **3 Combining Forces and Layers** (Master)**
... ... @@ -56,7 +56,7 @@
56 56  
57 57  
58 58  
59 -* **1 A Simple Edge Router** (Bachelor)
53 +* **1 A (Simple) Edge Router** (Bachelor, Master)
60 60  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.
61 61  * **1 Improved Spline Edge Routing **(Master)
62 62  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.
... ... @@ -94,46 +94,62 @@
94 94  
95 95  
96 96  
91 +//Timing//
92 +
97 97  * (% style="line-height: 1.4285715;" %)**On the Pragmatics of Interactive Timing Information Feedback for Graphical Modeling **(%%)(Bachelor)(% style="line-height: 1.4285715;" %)**
98 98  **(%%)Use Pragmatics concepts to enhance the timing information feedback of the Interactive Timing Analysis.
99 99  
100 -
96 +//SCCharts Modelling & Compilation//
101 101  
102 102  * (% style="line-height: 1.4285715;" %)**Optimization of the SCCharts compiler/transformations **(%%)(Bachelor/Master)
103 103  Profile the actual SCCharts compiler/transformations and apply optimizations; also evaluate the possibility to use multiple cores for compilation
104 104  * (% style="line-height: 1.4285715;" %)**On the pragmatics of modeling large models in SCCharts**(%%) (Bachelor/Master)
105 105  Evaluate the possibilities to create and maintain large models in model-based languages (i.e. SCCharts) and provide suggestions for improvements
106 -* **Visualization of Model-based Simulation via Tracing** (Bachelor/Master)
107 -Use the already implemented Model-to-Model-Tracing in KIELER to visualize simulations.
108 -* **Incremental Compilation of SCEst** (Bachelor/Master)
109 -Modify the KIELER SCEst language so that KIELER is able to compile Esterel step-by-step to C via SCL.
110 -* **Incremental Model-based Compilation of Legacy C Programs** (Bachelor/Master)
111 -Modify the model-based compiler in KIELER so that it is able to compile C to (S)CCharts incrementally.
112 112  * **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
113 113  Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
114 114  * **Transformation of Circuits to SCCharts** (Bachelor/Master)
115 115  Implement a transformation that translates circuits to (dataflow) SCCharts.
116 -
117 -
118 -
119 -* **Efficient data dependency & scheduling analyses in SCCharts** (Master/Bachelor)
106 +* **Efficient data dependency & scheduling analyses in SCCharts** (Master/Bachelor)
120 120  Implement analyses for data dependency, scheduling (e.g. tick boundaries) for SCCharts to improve static scheduling of the compiler
121 121  * **Curing Schizophrenia in SCCharts **(Master/Bachelor)
122 122  Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
123 -* **Environment Simulations for SCCharts** (Master/Bachelor)
124 -Develop a system to simulate environments (e.g. for Lego Mindstorms) for SCCharts in KIELER
125 125  * **SCCharts Verification** (Master/Bachelor)
126 126  Add the possibility to perfom model checking on SCCharts
127 -* **Core SCCharts Interpreter** (Master/Bachelor)
112 +* **Derive M2M Transformations from Pseudocode** (Master/Bachelor)
113 +Create a Pseudocode DSL (and generator) to automatically derive M2M transformations.
114 +* **Raceyard evaluation** (Master)
115 +Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
116 +
117 +//SCCharts Simulation//
118 +
119 +* **Visualization of Model-based Simulation via Tracing** (Bachelor/Master)
120 +Use the already implemented Model-to-Model-Tracing in KIELER to visualize simulations.
121 +* **Environment Simulations for SCCharts** (Master/Bachelor)
122 +Develop a system to simulate environments (e.g. for Lego Mindstorms) for SCCharts in KIELER
123 +* **Core SCCharts Interpreter** (Master/Bachelor)
128 128  Implement an Interpreter for Core SCCharts.
129 129  
130 -
126 +//Model-based C Code Compilation//
131 131  
128 +* **Incremental Model-based Compilation of Legacy C Programs** (Bachelor/Master)
129 +Modify the model-based compiler in KIELER so that it is able to compile C to (S)CCharts incrementally.
130 +* **Execution of Recursive Dataflow Code** (Master/Bachelor)
131 +* **Execution of Concurrent Dataflow Code** (Master/Bachelor)
132 +Modify the model-based dataflow compiler in KIELER so that it is able to compile recursive/concurrent C programs.
133 +For Master students: Implement both.
134 +
135 +//Synchronous Languages//
136 +
137 +* **Incremental Compilation of SCEst** (Bachelor/Master)
138 +Modify the KIELER SCEst language so that KIELER is able to compile Esterel step-by-step to C via SCL.
139 +For Master Students: Also add the possibility to compile from SCCharts to SCEst.
140 +* **eSCL - Implementing {{code language="none"}}gotopause{{/code}}** (Bachelor/Master)
141 +Create an extended dialect of the SC Language including the {{code language="none"}}gotopause{{/code}} statement and implement a transformation to SCL.
132 132  * **Quartz **(Master)
133 133  Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
134 -* **Raceyard evaluation** (Master)
135 -Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
136 136  
145 +
146 +
137 137  = (% style="color: rgb(0,0,0);" %)Miscellaneous Topics(%%) =
138 138  
139 139  **Advisors:** to be determined.
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -20152354
1 +20153308
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/20152354/Topics for Student Theses
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/20153308/Topics for Student Theses