Changes for page Available Topics

Last modified by Niklas Rentz on 2025/05/09 08:15

From version < 45.1 >

edited by ssm
on 2014/12/30 18:32

To version < 95.1 >

edited by Reinhard von Hanxleden
on 2018/04/11 10:16

Change comment: There is no comment for this version

Raw
Rendered

Summary

Page properties (2 modified, 0 added, 0 removed)
Objects (1 modified, 0 added, 0 removed)
- Confluence.Code.ConfluencePageClass[0]

Details

Page properties

Author

@@ -1,1 +1,1 @@
--XWiki.ssm
++XWiki.rvh

Content

@@ -1,111 +1,85 @@
--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.
++Hier eine Themenübersicht, gefolgt von etwas detaillierteren Darstellungen. Generell sind Themenvariationen möglich, und auch selbst definierte Themen aus dem Bereich Echtzeitsysteme/Eingebettete Systeme können gerne besprochen werden. Ein weiterer Weg, um in kompakter Form einen Einblick in aktuelle Themen der Arbeitsgruppe zu bekommen, ist die Teilnahme an dem regelmäßig zu Semesterende bzw. in der vorlesungsfreien Zeit angebotenen Oberseminar.
--**On this Page**
++**Hinweis**: Es ist Studierenden ausdrücklich empfohlen, sich frühzeitig bei den verschiedenen Arbeitsgruppen über mögliche Themen der Abschlussarbeit zu informieren. WWW-Seiten wie diese hier sind ein guter erster Anlaufpunkt, und es ist eine gute Idee, sich vor einem Gespräch mit einem potenziellen Betreuer (Professor, Assistenten ~-~- generell die Dozenten von Lehrveranstaltungen) über mögliche Themen einen Blick auf diese Seiten zu werfen. Es ist jedoch erfahrungsgemäß schwierig, auf solchen Seiten vollständige und aktuelle Informationen bereitzustellen; sie sollten daher eher als grober Indikator der jeweils möglichen Themenfelder dienen denn als konkrete Ausschreibungen. Um zu erfahren, welche Themen konkret verfügbar sind, zu dem angestrebten Zeitrahmen, sollte man auf jeden Fall die Dozenten konsultieren.
++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.
++= Outline =
--{{toc/}}
--= Graph Layout =
--**Advisors:** Ulf Rüegg, Christoph Daniel Schulze.
++{{toc exclude="Outline"/}}
--* **Tight Packing of Connected Components** (Bachelor)
--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.
--{{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}}\\
--* **{{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)
--Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.\\
--* **{{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)
--Our layout algorithm already supports the placement of edge labels. However, there's still room for improvement...
--* **Layering Algorithms** (Bachelor, Master)
--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.
--* **Node Placement With a Focus on Compactness** (Master)
--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.
--* **Compound Graph Layout** (Master)
--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.
--* **Force Based Drawing with Port Constraints** (Master)
--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"]].
--* **Combining Forces and Layers** (Master)**
--**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.
++= Automatic Graph Layout =
++**Advisors:** Christoph Daniel Schulze, Reinhard von Hanxleden.
++
++Ein sehr wichtiger Teil des KIELER Projekts is 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.
++
++Wir verfolgen drei Themenbereiche, die zusammen solche Probleme lösen und den Nutzen von automatischem Layout erhöhen sollen:
++
++//» Algorithmen-Entwicklung.// Wir implementieren vorhandene Ansätze zum Layout von Graphen in Java und binden sie in das KIELER Framework ein. Der Schwerpunkt liegt auf dem Entwurf von Erweiterungen, die spezielle Anforderungen unterstützen, z.B. für Datenfluss-Diagramme. Dies ist gut für alle geeignet, die sich gerne mit Graphentheorie, effizienten Algorithmen oder kombinatorischer Optimierung beschäftigen.
++
++//» Meta Layout.// Hierunter verstehen wir ein abstraktes Layout, welches im Gegensatz zum konkreten Layout nicht durch (x,y) Koordinaten definiert ist, sondern den Nutzern verschiedene Schnittstellen bietet, um auf schnelle und einfache Weise die Layout-Algorithmen zu konfigurieren. Die große Herausforderung liegt dabei in der Entwicklung von Abstraktionsebenen, die den Nutzer möglichst direkt zu einem guten Layout führen und trotzdem flexibel genug sind.
++
++//» Dienste.// Algorithmen und Meta Layout müssen den Anwendern zugänglich gemacht werden, damit ein Nutzen daraus entsteht. Dazu müssen wir verschiedenste graphische Frameworks mit vorhandenen Layout-Bibliotheken integrieren und eine Reihe von Werkzeugen entwickeln, mit denen die Verfügbarkeit unserer Lösungen gesteigert wird. Hierzu gehört z.B. die Unterstützung von Standard-Graphenformaten sowie ein Web-Service für automatisches Layout.
++
  = Modeling Pragmatics =
--**Advisors:** Reinhard von Hanxleden, Ulf Rüegg, Christoph Daniel Schulze.
++**Advisors:** Ulf Rüegg, Christoph Daniel Schulze, Reinhard von Hanxleden
--* **Comment Attachment** (Bachelor)
--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.
--* **Control Flow Graph Exploration / Visualization** (Bachelor)
--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.
--* **Compound Graph Exploration** (Bachelor, Master)
++* **1 Compound Graph Exploration** (Bachelor, Master)
  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.
++* **1 OpenStreetMap-Based Model Exploration** (Bachelor, Master)
++Implement a prototype to investigate whether OpenStreetMap can be used to display custom data (such as, say, rendered diagrams) to use its filtering and exploration features for exploring large diagrams.
++* **3 Control Flow Graph Exploration / Visualization** (Bachelor)
++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.
++* **Use signal flow graphs for parameterizing / debugging audio system configurations (Master)**
++The configuration of how signals are routed and how signal processors are configured in an audio system is a complex task. Make configuration and debugging easier by providing a visualization of the current configuration. Also, research what will help developers and users find configuration problems. The resulting software can be integrated into an existing Python-based configuration application, or be developed as a standalone tool that communicates with the audio system through Ethernet. (In conjunction with [[sonoware GmbH>>url:https://www.sonoware.de/en/||shape="rect"]])
--= Semantics and Synchronous Languages =
++= Semantics, Synchronous Languages and Model-based Design =
--**Advisors:** Christian Motika, Steven Smyth
++**Advisors:** Steven Smyth, Alexander Schulz-Rosengarten, Reinhard v. Hanxleden
--* **Automatic documentation generation for model-based languages **(Bachelor)
--Develop an automatic SCCharts documentation & comment system
--* **Merging SCCharts and KLOTS** (Bachelor)
--Implement KLOTS as demonstrator extension of the KIELER SCCharts implementation
--* **On the usability of the KIELER SCCharts compiler** (Bachelor)
--Evaluate the actual implementation of the KIELER SCCharts compiler and provide suggestions for improvements, i.e. the usability as standalone (commandline) compiler
--\\
--* **Validation Manager for Models **(Bachelor/Master)
--Develop an integrated, flexible and generic syntactic validation framework for models (e.g. Esterel or SyncCharts).
--* **SCCharts compiler validation with Esterel **(Bachelor/Master)
--Automate the validation of the SCCharts compiler using the Esterel simulation.
--* **Transformation from SCCharts to Esterel** (Bachelor/Master)
--Develop a transformation in Xtend2 to generate Esterel code for SCCharts.
--* **Hardware Synthesis from SCCharts to FPGA **(Bachelor/Master)
--Use the circuit-based code generation approach to produce code for FPGAs
--* (% style="line-height: 1.4285715;" %)**Optimization of the SCCharts compiler **(%%)(Bachelor/Master)
--Profile the actual SCCharts compiler and apply optimizations; also evaluate the possibility to use multiple cores for compilation
--* **Optimization of the SCCharts transformations** (Bachelor/Master)
--Profile the actual SCCharts transformations and apply optimizations
--* **SCCharts Andriod backend for Mini Drones** (Bachelor/Master)
--Develop a new code generation backend for SCCharts for Andriod applications with Mini Drones as demonstrator
--* **On the pragmatics of modelling large models in SCCharts** (Bachelor/Master)
--Evaluate the possibilities to create and maintain large models in model-based languages (i.e. SCCharts) and provide suggestions for improvements
--* **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
--Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
--\\
--* **Detecting tick boundaries in SCCharts **(Master/Bachelor)
--Implement an algorithm that detects tick boundaries (in concurrent) threads and therefore improves the scheduling
--* **Efficient data dependency analyses in SCCharts** (Master/Bachelor)
--Implement data dependency analyses for SCCharts to improve static scheduling of the compiler
--* **KIELER evaluation environment for synchronous languages** (Master/Bachelor)
--Develop a reliable evaluation environment to compare common synchronous languages (i.e. Esterel/SyncCharts & SCCharts)
--* **Raceyard evaluation** (Master/Bachelor)
++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.
++
++//SCCharts Modelling & Transformations//
++
++* **SCCharts Verification** (Master/Bachelor)
++Add the possibility to perfom model checking on SCCharts
++* **Derive M2M Transformations from Pseudocode** (Master/Bachelor)
++Create a Pseudocode DSL (and generator) to automatically derive M2M transformations.
++* **Raceyard evaluation** (Master)
  Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
++
++//SCCharts Code Generation & Optimizations//
++
++* **Optimization of the SCCharts compiler/transformations **(Bachelor/Master)
++Profile the actual SCCharts compiler/transformations and apply optimizations; also evaluate the possibility to use multiple cores for compilation.
++* **SCG Optimization based on SSA **(Bachelor/Master)
++The Static Single Assignment form enables powerful optimizations such as [[sparse conditional constant propagation>>url:http://dl.acm.org/citation.cfm?id=103136||shape="rect"]]. Adjust and implement this algorithm in the context of SCGs and evaluate the result.
++* **Efficient data dependency & scheduling analyses in SCCharts** (Master/Bachelor)
++Implement analyses for data dependency, scheduling (e.g. tick boundaries) for SCCharts to improve static scheduling of the compiler.
  \\
--* **Quartz **(Master)
--Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
--* **Implementation of a priority-based compilation approach **(Master) [work in progress, Caroline Butschek]
--Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.
--* **From Esterel to SCL **(Master) [work in progress, Karsten Rathlev]
--Implement transformations that translate Esterel programs to SCL
--* **Curing Schizophrenia in SCCharts **(Master)
--Develop new synchronizer to handle schizophrenia properly (e.g. depth join).**
--**
--* **Railway 4.0 **(Master) [work in progress, Nis Wechselberg]
--Design a new and modern hardware controlling (Version 4) for the railway installation.
--= PRETSY / PRETSY2 =
++//SCCharts Simulation//
--**Advisors:** Insa Fuhrmann, Steven Smyth
++* **Visualization of Model-based Simulation via Tracing** (Bachelor/Master)
++Use the already implemented Model-to-Model-Tracing in KIELER to visualize simulations.
++* **Core SCCharts Interpreter** (Master/Bachelor)
++Implement an Interpreter for Core SCCharts.
--* **Real-time extensions for SCCharts** (Bachelor/Master)
--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.
--* **Adding dataflow to SCCharts** (Bachelor/Master) [work in progress, Axel Umland]
--Add dataflow to SCCharts
--\\
--* **Multithreaded/Multicore execution of SCCharts **(Master/Bachelor)
--Evaluate possibilities to preserve parallelism in SCCharts, implement mapping for (fine grained) multithreading and multicore
--based on the [[FlexPRET>>url:http://www.eecs.berkeley.edu/Pubs/TechRpts/2013/EECS-2013-172.pdf||shape="rect"]] processor.
++//Model-based C Code Compilation//
--= (% style="color: rgb(0,0,0);" %)Miscellaneous Topics(%%) =
++* **Incremental Model-based Compilation of Legacy C Programs** (Bachelor/Master)
++Modify the model-based compiler in KIELER so that it is able to compile C to (S)CCharts incrementally.
++* **Execution of Recursive Dataflow Code** (Master/Bachelor)
++* **Execution of Concurrent Dataflow Code** (Master/Bachelor)
++Modify the model-based dataflow compiler in KIELER so that it is able to compile recursive/concurrent C programs.
++For Master students: Implement both.
--**Advisors:** to be determined.
++//Synchronous Languages//
--* **Developing an Info Screen** (Bachelor)
--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.
++* (% style="letter-spacing: 0.0px;" %)**eSCL - Implementing {{code language="none"}}gotopause{{/code}}**(%%) (Bachelor/Master)
++Create an extended dialect of the SC Language including the {{code language="none"}}gotopause{{/code}} statement and implement a transformation to SCL.
++\\

Confluence.Code.ConfluencePageClass[0]

Id

@@ -1,1 +1,1 @@
--10751356
++40894631

URL

@@ -1,1 +1,1 @@
--https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/10751356/Topics for Student Theses
++https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/40894631/Topics for Student Theses

Changes for page Available Topics

Summary

Details

Navigation

Quick Links