Changes for page Available Topics

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

From version < 69.1 >

edited by ima
on 2016/02/19 13:44

To version < 93.1 >

edited by cds
on 2018/02/08 12:54

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.ima
++XWiki.cds

Content

@@ -4,6 +4,8 @@
  **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 =
@@ -24,54 +24,22 @@
  //» 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.
--* **Tight Packing of Connected Components** (Bachelor, Master)
--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 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}}\\
--
--{{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}}
--
--
--
--* **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 be 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.
--
--
--
--* **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.
--* **Interactive constraint creation and application in automatic layout **(Bachelor/Master)
--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.
--
--
--
--* **Orthogonal "Edge Bundling"** (Bachelor, Master)
--Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm.
--* **A Simple Edge Router** (Bachelor)
--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.
--* **Improved Spline Edge Routing **(Master)
--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.
--* **Improve and Assess KLay Layered's JUnit Test Environment **(Bachelor, Master)
--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.
--\\
--
  = Modeling Pragmatics =
--**Advisors:** Reinhard von Hanxleden, Ulf Rüegg, Christoph Daniel Schulze, Insa Fuhrmann
++**Advisors:** Reinhard von Hanxleden, Ulf Rüegg, Christoph Daniel Schulze
--* **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, Synchronous Languages and Model-based Design =
--**Advisors:** Christian Motika, Steven Smyth, Reinhard v. Hanxleden, Insa Fuhrmann
++**Advisors:** Steven Smyth, Alexander Schulz-Rosengarten, Reinhard v. Hanxleden
  Heute haben sich eine ganze Reihe von Modellierungssprachen durchgesetzt, die grafische Modelle verwenden. Dazu zählen beispielsweise die [[Unified Modeling Language (UML) >>url:http://de.wikipedia.org/wiki/UML||shape="rect" class="external-link"]]oder die Werkzeugketten [[Simulink/Stateflow von Mathworks >>url:http://de.wikipedia.org/wiki/Simulink||shape="rect" class="external-link"]]und [[SCADE von Esterel-Technologies>>url:http://en.wikipedia.org/wiki/SCADE||shape="rect" class="external-link"]]. Letztere werden insbesondere auch im Entwurf eingebetteter und sicherheitskritischer Systeme (z.B. in Fahr- und Flugzeugen) eingesetzt.
@@ -84,46 +84,60 @@
  In diesem Kontext sind Themenstellungen für Bachelor-/Master-/Diplom- und Studienarbeiten beispielhaft genannt. Bei Fragen oder sprechen Sie einen Betreuer bitte direkt an:
--
++\\
--* (% style="line-height: 1.4285715;" %)**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
++//SCCharts Modelling & Transformations//
++
  * (% style="line-height: 1.4285715;" %)**On the pragmatics of modeling 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
--* **Visualization of Model-based Simulation via Tracing** (Bachelor/Master)
--Use the already implemented Model-to-Model-Tracing in KIELER to visualize simulations.
--* **Incremental Compilation of SCEst** (Bachelor/Master)
--Modify the KIELER SCEst language so that KIELER is able to compile Esterel step-by-step to C via SCL.
--* **Model-based Compilation of Legacy C Programs** (Bachelor/Master)
--Implement a model-based compiler in KIELER that is able to compile C to (S)CCharts and then back to C again.
--* **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.
  * **Transformation of Circuits to SCCharts** (Bachelor/Master)
  Implement a transformation that translates circuits to (dataflow) SCCharts.
--* **On the Pragmatics of Interactive Timing Information Feedback for graphical modeling** (Bachelor)
--Use Pragmatics concepts to enhance the timing information feedback of the Interactive Timing Analysis.
--\\\\
--* **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
--* **Curing Schizophrenia in SCCharts **(Master/Bachelor)
--Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
--* **SCCharts Debugging** (Master/Bachelor)
--Implement more sophisticated debugging mechanisms (e.g. breakpoints, observers) for SCCharts
--* **Environment Simulations for SCCharts** (Master/Bachelor)
--Develop a system to simulate environments (e.g. for Lego Mindstorms) for SCCharts in KIELER
  * **SCCharts Verification** (Master/Bachelor)
  Add the possibility to perfom model checking on SCCharts
--\\\\
--* **Quartz **(Master)
--Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
--* --**Implementation of a priority-based compilation approach **(Master) --
----Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.--
++* **Transformation Verification** (Master/Bachelor)
++Develop a method for SCCharts to check transformations for semantic equivalence.
++* **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
--= (% style="color: rgb(0,0,0);" %)Miscellaneous Topics(%%) =
++//SCCharts Code Generation & Optimizations//
--**Advisors:** to be determined.
++* **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.
++* **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.
++* **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.
++* **Curing Schizophrenia in SCCharts **(Master/Bachelor)
++Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
--* **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.
++//SCCharts Simulation//
++
++* **Visualization of Model-based Simulation via Tracing** (Bachelor/Master)
++Use the already implemented Model-to-Model-Tracing in KIELER to visualize simulations.
++* **Environment Simulations for SCCharts** (Master/Bachelor)
++Develop a system to simulate environments (e.g. for Lego Mindstorms) for SCCharts in KIELER
++* **Core SCCharts Interpreter** (Master/Bachelor)
++Implement an Interpreter for Core SCCharts.
++
++//Model-based C Code Compilation//
++
++* **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.
++
++//Synchronous Languages//
++
++* **Incremental Compilation of SCEst** (Bachelor/Master)
++Modify the KIELER SCEst language so that KIELER is able to compile Esterel step-by-step to C via SCL.
++For Master Students: Also add the possibility to compile from SCCharts to SCEst.
++* **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.
++* **Quartz **(Master)
++Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.

Confluence.Code.ConfluencePageClass[0]

Id

@@ -1,1 +1,1 @@
--15532291
++40894596

URL

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

Changes for page Available Topics

Summary

Details

Navigation

Quick Links