Changes for page Available Topics

Last modified by Niklas Rentz on 2025/03/13 09:21
<
From version < 60.1 >
edited by ssm
on 2015/10/19 09:35
To version < 62.1 >
edited by ssm
on 2016/01/20 11:02
>
Change comment: There is no comment for this version

Summary

Details

Page properties
Content
... ... @@ -26,8 +26,8 @@
26 26  
27 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 -{{jira columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1262"}}KIPRA-1262{{/jira}}\\
30 -* **{{jira columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1031"}}KIPRA-1031{{/jira}}Implement and Evaluate a Layout Algorithm for Simple Cluster Graphs** (Bachelor/Master)
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 +* **{{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 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.
32 32  * **Layering Algorithms** (Bachelor, Master)
33 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.
... ... @@ -39,14 +39,12 @@
39 39  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"]].
40 40  * **Interactive constraint creation and application in automatic layout **(Bachelor/Master)
41 41  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.
42 -* **Compound Graph Layout** (Master)
43 -Design and implement new concepts for computing layer-based layouts of compound graphs. The main focus shall be on //maintainability//: ensuring that the implementation can be kept working over the years. The main area to be considered here is the crossing minimization phase.
44 44  * **Orthogonal "Edge Bundling"** (Bachelor, Master)
45 45  Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm.
46 -* **Integrate KIML with JGraph** (Bachelor)
47 -Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.\\
48 -* **{{jira showSummary="true" columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1214"}}KIPRA-1214{{/jira}}Improve and Assess KLay Layered's JUnit Test Environment** 
44 +* **Improve and Assess KLay Layered's JUnit Test Environment** 
49 49  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.
46 +* **A Simple Edge Router** (Bachelor)
47 +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.
50 50  \\
51 51  
52 52  = Modeling Pragmatics =
... ... @@ -73,41 +73,34 @@
73 73  
74 74  In diesem Kontext sind Themenstellungen für Bachelor-/Master-/Diplom- und Studienarbeiten beispielhaft genannt. Bei Fragen oder sprechen Sie einen Betreuer bitte direkt an:
75 75  
76 -* --**Automatic documentation generation for model-based languages **(Bachelor)--
77 ---Develop an automatic SCCharts documentation & comment system--
78 -* --**On the usability of the KIELER SCCharts compiler** (Bachelor)--
79 ---Evaluate the actual implementation of the KIELER SCCharts compiler and provide suggestions for improvements, i.e. the usability as standalone (commandline) compiler--
80 -\\\\
81 -* --**Transformation from SCCharts to Esterel** (Bachelor/Master)--
82 ---Develop a transformation in Xtend2 to generate Esterel code for SCCharts.--
83 -* --**Hardware Synthesis from SCCharts to FPGA **(Bachelor/Master)--
84 ---Use the circuit-based code generation approach to produce code for FPGAs--
74 +
75 +
85 85  * (% style="line-height: 1.4285715;" %)**Optimization of the SCCharts compiler/transformations **(%%)(Bachelor/Master)
86 86  Profile the actual SCCharts compiler/transformations and apply optimizations; also evaluate the possibility to use multiple cores for compilation
87 87  * (% style="line-height: 1.4285715;" %)**On the pragmatics of modeling large models in SCCharts**(%%) (Bachelor/Master)
88 88  Evaluate the possibilities to create and maintain large models in model-based languages (i.e. SCCharts) and provide suggestions for improvements
89 -* **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
90 -Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
91 -* **The Semantics of Hybrid SCCharts** (Bachelor/Master)
92 -Evaluate SCCharts hybrid models and define semantics for the new features of SCCharts (3.0).
80 +* **Visualization of Model-based Simulation via Tracing** (Bachelor/Master)
81 +Use the already implemented Model-to-Model-Tracing in KIELER to visualize simulations.
82 +* **Incremental Compilation of SCEst** (Bachelor/Master)
83 +Modify the KIELER SCEst language so that KIELER is able to compile Esterel step-by-step to C via SCL.
84 +* **Model-based Compilation of Legacy C Programs** (Bachelor/Master)
85 +Implement a model-based compiler in KIELER that is able to compile C to (S)CCharts and then back to C again.
93 93  \\\\
94 -* **Detecting tick boundaries in SCCharts **(Master/Bachelor)
95 -Implement an algorithm that detects tick boundaries (in concurrent) threads and therefore improves the scheduling
96 -* **Efficient data dependency analyses in SCCharts** (Master/Bachelor)
97 -Implement data dependency analyses for SCCharts to improve static scheduling of the compiler
98 -* --**KIELER evaluation environment for synchronous languages** (Master/Bachelor)--
99 ---Develop a reliable evaluation environment to compare common synchronous languages (i.e. Esterel/SyncCharts & SCCharts)--
100 -* **Raceyard evaluation** (Master/Bachelor)
101 -Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
87 +* **Efficient data dependency & scheduling analyses in SCCharts** (Master/Bachelor)
88 +Implement analyses for data dependency, scheduling (e.g. tick boundaries) for SCCharts to improve static scheduling of the compiler
102 102  * **Curing Schizophrenia in SCCharts **(Master/Bachelor)
103 103  Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
104 104  * --**Hybrid Models for Legacy Code Extraction **(Master/Bachelor)--
105 105  --Extract legacy code (e.g. legacy C code) to (SCCharts) Hybrid Models.--
93 +* **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
94 +Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
106 106  \\\\
107 107  * **Quartz **(Master)
108 108  Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
109 109  * **Implementation of a priority-based compilation approach **(Master) 
110 110  Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.
100 +* **Raceyard evaluation** (Master)
101 +Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
111 111  
112 112  = PRETSY / PRETSY2 =
113 113  
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -13763616
1 +15532151
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/13763616/Topics for Student Theses
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/15532151/Topics for Student Theses

Navigation

Quick Links

KIELER on GitHub
RTSYS Homepage