Skip to Content

Wiki source code of Topics for Student Theses

Version 39.1 by cds on 2014/12/09 11:07
Hide last authors
cds 36.1 1 Here's a selection of possible bachelor and master topics. If you're interested in one of them, don't hesitate to contact us! We'll sit down, have tea, and talk about what we great things we could do together.
cds 3.1 2
cds 36.1 3 **On this Page**
4
5
6
7 {{toc/}}
8
cds 39.1 9 = Graph Layout =
cds 1.1 10
cds 39.1 11 * **Tight Packing of Connected Components** (Bachelor)
cds 36.1 12 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.
cds 39.1 13 * **{{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}}Integrate KIML with JGraph** (Bachelor)
cds 22.1 14 Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.
cds 39.1 15 * **{{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}}Improved Edge Label Placement** (Bachelor)
cds 24.1 16 Our layout algorithm already supports the placement of edge labels. However, there's still room for improvement...
cds 39.1 17 * **Layering Algorithms** (Bachelor, Master)
18 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.
19 * **Node Placement With a Focus on Compactness** (Master)
20 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.
21 * **Compound Graph Layout** (Master)
22 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.
23 * **Force Based Drawing with Port Constraints** (Master)
24 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"]].
25 * **Combining Forces and Layers** (Master)**
26 **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.
cds 15.1 27
cds 39.1 28 = Modeling Pragmatics =
cds 15.1 29
cds 39.1 30 * **Comment Attachment** (Bachelor)
ssm 33.1 31 When computing a new layout for a diagram that contains comments (comparable to comments in source code), the comments often get placed far away of the nodes they refer to. This is because often the reference is not explicitly encoded in the original model. We have used a distance-based metric in the past to discover references automatically, but there are lots of ideas for improvement. This bachelor thesis would implement them, perhaps come up with additional ideas, and finally evaluate them in a thorough experiment.
cds 39.1 32 * **Control Flow Graph Exploration / Visualization** (Bachelor)
33 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.
cds 15.1 34
cds 39.1 35 = Semantics and Synchronous Languages =
cds 15.1 36
cds 12.1 37 * **Validation Manager for Models**
Reinhard von Hanxleden 9.1 38 Develop an integrated, flexible and generic syntactic validation framework for models (e.g. Esterel or SyncCharts).
ssm 33.1 39 * **SCCharts compiler validation with Esterel**
40 Automate the validation of the SCCharts compiler using the Esterel simulation.
41 * **Transformation from SCCharts to Esterel** [possibly also Master Topic]
42 Develop a transformation in Xtend2 to generate Esterel code for SCCharts.
ssm 34.1 43 * **Hardware Synthesis from SCCharts to FPGA **[possibly also Master Topic]
44 Use the circuit-based code generation to produce code for FPGAs
45 * **Automatic documentation generation **[possibly also Master Topic]
46 Develop an automatic SCCharts documentation system
47 * **Optimizations for the SCCharts compiler **[possibly also Master Topic]
48 Profile the actual SCCharts compiler and apply optimizations
ssm 35.1 49 * **Multi-core SCCharts compiler **[possibly also Master Topic]
50 Implement the possibility to use more than one core to compile large SCCharts
51 * **Adding dataflow to SCCharts** [possibly also Master Topic]
52 Add dataflow to SCCharts
cds 1.1 53
cds 39.1 54 = PRETSY / PRETSY2 =
ima 38.1 55
56 * **Real-time extensions for SCCharts** [possibly also Master Topic]
57 Make the timing instructions //delay_until// und //exception_on_expire// of the [[FlexPRET>>url:http://rtsys.informatik.uni-kiel.de/confluence/Multithreaded/Multicore execution of SCCharts Evaluate possibilities to preserve parallelism in SCCharts, implement mapping for (fine grained) multithreading and multicore based on the FlexPRET||shape="rect"]] processor available in SCCharts.
58 * See also Semantics and Synchronous Languages: **Adding dataflow to SCCharts**
59
cds 39.1 60 = Miscellaneous Topics =
cds 15.1 61
cds 39.1 62 * **Developing an Info Screen** (Bachelor)
cds 15.1 63 Info screens are screens that present data in ways that can be easily understood. This includes static data (project description graphics, members of a team, ...) as well as dynamically aggregated data (bug statistics, automatic build overviews, ...). This topic is about developing such an info screen for our group and making it easily configurable.
64
msp 26.1 65 ----
cds 1.1 66
msp 26.1 67 = (% style="color: rgb(0,0,0);" %)Master Topics(%%) =
68
69 == Semantics and Synchronous Languages ==
70
ssm 33.1 71 * **Quartz**
msp 26.1 72 Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
ssm 33.1 73 * **Implementation of a priority-based compilation approach**
ssm 34.1 74 Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.
75 * **Curing Schizophrenia in SCCharts**
76 Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
ssm 33.1 77 * **Detecting tick boundaries in SCCharts**
ssm 34.1 78 Implement an algorithm that detects tick boundaries (in concurrent) threads and therefore improves the scheduling
ima 38.1 79 * **Multithreaded/Multicore execution of SCCharts **(see below PRETSY/PRETSY2)**
ssm 35.1 80 **
ssm 33.1 81 * **Railway 2.0**
ssm 34.1 82 Design a new and modern hardware controlling (Version 4) for the railway installation.
ima 38.1 83
84 == PRETSY / PRETSY2 ==
85
86 * **Multithreaded/Multicore execution of SCCharts**
87 Evaluate possibilities to preserve parallelism in SCCharts, implement mapping for (fine grained) multithreading and multicore
88 based on the [[FlexPRET>>url:http://www.eecs.berkeley.edu/Pubs/TechRpts/2013/EECS-2013-172.pdf||shape="rect"]] processor.**
89 **
90
91