<
From version < 136.1 >
edited by Jette Petzold
on 2022/11/17 13:18
To version < 117.1 >
edited by Alexander Schulz-Rosengarten
on 2022/04/07 08:22
>
Change comment: There is no comment for this version

Summary

Details

Page properties
Author
... ... @@ -1,1 +1,1 @@
1 -XWiki.jep
1 +XWiki.als
Content
... ... @@ -4,9 +4,15 @@
4 4  
5 5  Die möglichen Themen sind im Folgenden thematisch gruppiert. Die Zahlen vor der Themenbeschreibung stehen für Prioritäten. Je kleiner die Zahl, desto wichtiger ist uns das Thema.
6 6  
7 += Outline =
8 +
9 +
10 +
11 +{{toc exclude="Outline"/}}
12 +
7 7  = Automatic Graph Layout =
8 8  
9 -**Advisors:** Sören Domrös, Max Kasperowski, Reinhard von Hanxleden.
15 +**Advisors:** Sören Domrös, Reinhard von Hanxleden.
10 10  
11 11  Ein sehr wichtiges Gebiet für uns ist das automatische Layout von Diagrammen. Hierfür gibt es bereits Werkzeuge, die gute Algorithmen enthalten, so dass viele Diagramme bereits jetzt übersichtlich und automatisiert angeordnet werden können (siehe z.B. [[Graphviz>>url:http://www.graphviz.org/||shape="rect" class="external-link"]]). Für einige besondere Arten von Diagrammen sind diese allgemeinen Algorithmen jedoch nicht geeignet, da zusätzliche Anforderungen an das Layout erfüllt werden müssen. Außerdem ist häufig die technische Anbindung vorhandener Algorithmen umständlich. Nutzer müssen sich mit der Funktionsweise der Algorithmen beschäftigen, um sie für ihre Anwendung optimal konfigurieren zu können.
12 12  
... ... @@ -18,21 +18,25 @@
18 18  
19 19  Die Entwicklung geschieht im [[Eclipse Layout Kernel>>url:http://www.eclipse.org/elk||shape="rect"]]-Projekt (kurz ELK), einem offiziellen Eclipse-Projekt welches hauptsächlich wir betreuen und weiter entwickeln. Ergebnisse in diesem Bereich fließen damit einer tatsächlich existierenden Nutzerbasis zu.
20 20  
21 -==== **Topics** ====
22 -
23 -* [[doc:A Machine Learning Approach for Node Size Approximation in Top-down Layout]]
24 -* [[doc:Tree Layout with Vertical Position Constraints]]
25 -* [[doc:Node Placement with Flexible Node Size and Port Position]]
26 -
27 -Further possible thesis topics can be found [[in ELK's GitHub repository>>url:https://github.com/eclipse/elk/issues?q=is%3Aissue+is%3Aopen+label%3Athesis||shape="rect"]]. Note, however, that some issues there may already be worked on.
28 -
29 29  = Modeling Pragmatics =
30 30  
31 -**Advisors:** Niklas Rentz, Reinhard von Hanxleden
29 +**Advisors:** Sören Domrös, Niklas Rentz, Reinhard von Hanxleden
32 32  
33 -==== **Topics** ====
31 +* **Post-Processing Label Placement with Label Management** (Bachelor, Master)
32 +This is about implementing a stand-alone label placement algorithm that can place node and edge labels after everything else has already been placed. Since there might not be enough space to place all labels, the algorithm should provide different options of coping with such situations. One would be to hide such labels, another one would be to apply label management to them.
33 +* **Standalone Edge Routing **(Master)
34 +* **Compound Graph Exploration** (Bachelor, Master)
35 +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.
36 +* **Improvements to Spline Edge Routing** (Bachelor, Master)
37 +Spline edge routing closely follows the routes orthogonal edges would take. A Bachelor's thesis could work on improving how splines connect to their end points to make the results look more natural. A Master's thesis could look at improving the routes splines take through a diagram more generally.
38 +* **Interactivity for Further Diagram Elements and Layout Algorithms** (Bachelor, Master)
39 +* **Relative Interactivity Constraints** (Bachelor, Master)
40 +* **Polishing and Evaluating Interactive User Experiences **(Bachelor, Master)
41 +* **Interaction Techniques for Large Diagrams** (Bachelor, Master)
42 +* **Control Flow Graph Exploration / Visualization** (Bachelor)
43 +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.
34 34  
35 -* [[doc:Architecture Comparison Framework for Software Project Visualization]]
45 +Further possible thesis topics can be found [[in ELK's GitHub repository>>url:https://github.com/eclipse/elk/issues?q=is%3Aissue+is%3Aopen+label%3Athesis||shape="rect"]]. Note, however, that some issues there may already be worked on.
36 36  
37 37  = Semantics, Synchronous Languages and Model-based Design =
38 38  
... ... @@ -40,14 +40,22 @@
40 40  
41 41  Synchronous languages are well-established for the design of embedded, in particular safety-critical systems. One of our research areas concerns the further development of such languages and their efficient compilation. Specifically, we explore the paradigm of "sequential constructiveness" for reconciling familiar, imperative programming concepts with the sound grounding of synchronous languages. One language we have developed to try out and validate our concepts is the [[SCCharts>>doc:KIELER.SCCharts||shape="rect"]] language, which keeps evolving and thus offers many opportunities for student theses.
42 42  
43 -= Safety Analysis =
53 +//SCCharts Code Generation & Optimizations//
44 44  
45 -**Advisors:** Jette Petzold, Reinhard v. Hanxleden
55 +* **Optimization of the SCCharts compiler/transformations **(Bachelor/Master)
56 +Profile the actual SCCharts compiler/transformations and apply optimizations; also evaluate the possibility to use multiple cores for compilation.
57 +* **Javascript code generation** (Bachelor/Master)
58 +Implement a javascript code generation for SCCharts. Integrate with simulation and (environment) visualization to deploy a complete example as standalone web page. Compare with [[HipHop.js >>url:https://dl.acm.org/ft_gateway.cfm?id=3167440&type=pdf||shape="rect"]]based on Esterel.
46 46  
47 -==== **Topics** ====
60 +//SCCharts Simulation//
48 48  
49 -* [[doc:Fault Tree Analysis (FTA) Support for the STPA VS Code Extension]]
50 -* [[doc:Reevaluation Suggestions in System-Theoretic Process Analysis]]
51 -* [[doc:Logical Simplification for Context Tables in the STPA VS Code Extension]]
62 +* **Visualization of Model-based Simulation via Tracing** (Bachelor/Master)
63 +Use the already implemented Model-to-Model-Tracing in KIELER to visualize simulations.
64 +* **Core SCCharts Interpreter** **with dynamic Scheduling** (Master/Bachelor)
65 +Implement an Interpreter for Core SCCharts that supports SC Policies.
52 52  
53 53  \\
68 +
69 +\\
70 +
71 +\\
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -142606411
1 +126418957
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/142606411/Topics for Student Theses
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/126418957/Topics for Student Theses