Changes for page Available Topics

Summary

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

Details

Page properties

Content

...	...	@@ -1,80 +1,104 @@
1		-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.
	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.
2	2
3		-**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.
	3	+**On this Page**
4	4
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	8
	7	+{{toc/}}
9	9
	9	+= Graph Layout =
10	10
11		-{{toc exclude="Outline"/}}
	11	+**Advisors:** Ulf Rüegg, Christoph Daniel Schulze.
12	12
13		-= Automatic Graph Layout =
	13	+* **Tight Packing of Connected Components** (Bachelor)
	14	+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.
	15	+{{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}}\\
	16	+* **{{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)
	17	+Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.\\
	18	+* **{{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)
	19	+Our layout algorithm already supports the placement of edge labels. However, there's still room for improvement...
	20	+* **Layering Algorithms** (Bachelor, Master)
	21	+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.
	22	+* **Node Placement With a Focus on Compactness** (Master)
	23	+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.
	24	+* **Compound Graph Layout** (Master)
	25	+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.
	26	+* **Force Based Drawing with Port Constraints** (Master)
	27	+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"]].
	28	+* **Combining Forces and Layers** (Master)**
	29	+**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.
14	14
15		-**Advisors:** Christoph Daniel Schulze, Reinhard von Hanxleden.
	31	+= Modeling Pragmatics =
16	16
17		-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.
	33	+**Advisors:** Reinhard von Hanxleden, Ulf Rüegg, Christoph Daniel Schulze.
18	18
19		-Wir verfolgen drei Themenbereiche, die zusammen solche Probleme lösen und den Nutzen von automatischem Layout erhöhen sollen:
	35	+* **Comment Attachment** (Bachelor)
	36	+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.
	37	+* **Control Flow Graph Exploration / Visualization** (Bachelor)
	38	+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.
	39	+* **Compound Graph Exploration** (Bachelor, Master)
	40	+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.
20	20
21		-//» 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.
	42	+= Semantics and Synchronous Languages =
22	22
23		-//» 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.
	44	+**Advisors:** Christian Motika, Steven Smyth.
24	24
25		-//» 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.
	46	+* **Validation Manager for Models**
	47	+Develop an integrated, flexible and generic syntactic validation framework for models (e.g. Esterel or SyncCharts).
	48	+* **SCCharts compiler validation with Esterel**
	49	+Automate the validation of the SCCharts compiler using the Esterel simulation.
	50	+* **Transformation from SCCharts to Esterel** [possibly also Master Topic]
	51	+Develop a transformation in Xtend2 to generate Esterel code for SCCharts.
	52	+* **Hardware Synthesis from SCCharts to FPGA **[possibly also Master Topic]
	53	+Use the circuit-based code generation to produce code for FPGAs
	54	+* **Automatic documentation generation **[possibly also Master Topic]
	55	+Develop an automatic SCCharts documentation system
	56	+* **Optimizations for the SCCharts compiler **[possibly also Master Topic]
	57	+Profile the actual SCCharts compiler and apply optimizations
	58	+* **Multi-core SCCharts compiler **[possibly also Master Topic]
	59	+Implement the possibility to use more than one core to compile large SCCharts
	60	+* **Adding dataflow to SCCharts** [possibly also Master Topic]
	61	+Add dataflow to SCCharts
26	26
27		-= Modeling Pragmatics =
	63	+= PRETSY / PRETSY2 =
28	28
29		-**Advisors:** Ulf Rüegg, Christoph Daniel Schulze, Reinhard von Hanxleden
	65	+**Advisors:** Insa Fuhrmann.
30	30
31		-* **1 Compound Graph Exploration** (Bachelor, Master)
32		-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.
33		-* **1 OpenStreetMap-Based Model Exploration** (Bachelor, Master)
34		-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.
35		-* **1 Improvements to Spline Edge Routing** (Bachelor, Master)
36		-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.
37		-* **3 Control Flow Graph Exploration / Visualization** (Bachelor)
38		-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.
	67	+* **Real-time extensions for SCCharts** [possibly also Master Topic]
	68	+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.
	69	+* See also Semantics and Synchronous Languages: **Adding dataflow to SCCharts**
39	39
40		-= Semantics, Synchronous Languages and Model-based Design =
	71	+= Miscellaneous Topics =
41	41
42		-**Advisors:** Steven Smyth, Alexander Schulz-Rosengarten, Reinhard v. Hanxleden
	73	+**Advisors:** to be determined.
43	43
44		-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.
	75	+* **Developing an Info Screen** (Bachelor)
	76	+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.
45	45
46		-//SCCharts Modelling & Transformations//
	78	+----
47	47
48		-* **SCCharts Verification** (Master/Bachelor)
49		-Add the possibility to perfom model checking on SCCharts
50		-* **Raceyard evaluation** (Master)
51		-Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
	80	+= (% style="color: rgb(0,0,0);" %)Master Topics(%%) =
52	52
53		-//SCCharts Code Generation & Optimizations//
	82	+== Semantics and Synchronous Languages ==
54	54
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		-* **Efficient data dependency & scheduling analyses in SCCharts** (Master/Bachelor)
58		-Implement analyses for data dependencies and scheduling (e.g. tick boundaries) for SCCharts to improve static scheduling of the compiler.
	84	+* **Quartz**
	85	+Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
	86	+* **Implementation of a priority-based compilation approach**
	87	+Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.
	88	+* **Curing Schizophrenia in SCCharts**
	89	+Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
	90	+* **Detecting tick boundaries in SCCharts**
	91	+Implement an algorithm that detects tick boundaries (in concurrent) threads and therefore improves the scheduling
	92	+* **Multithreaded/Multicore execution of SCCharts **(see below PRETSY/PRETSY2)**
	93	+**
	94	+* **Railway 2.0**
	95	+Design a new and modern hardware controlling (Version 4) for the railway installation.
59	59
60		-//SCCharts Simulation//
	97	+== PRETSY / PRETSY2 ==
61	61
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** (Master/Bachelor)
65		-Implement an Interpreter for Core SCCharts.
	99	+* **Multithreaded/Multicore execution of SCCharts**
	100	+Evaluate possibilities to preserve parallelism in SCCharts, implement mapping for (fine grained) multithreading and multicore
	101	+based on the [[FlexPRET>>url:http://www.eecs.berkeley.edu/Pubs/TechRpts/2013/EECS-2013-172.pdf||shape="rect"]] processor.**
	102	+**
66	66
67		-//Model-based C Code Compilation//
68		-
69		-* **Incremental Model-based Compilation of Legacy C Programs** (Bachelor/Master)
70		-Modify the model-based compiler in KIELER so that it is able to compile C to (S)CCharts incrementally.
71		-* **Execution of Recursive Dataflow Code** (Master/Bachelor)
72		-* **Execution of Concurrent Dataflow Code** (Master/Bachelor)
73		-Modify the model-based dataflow compiler in KIELER so that it is able to compile recursive/concurrent C programs.
74		-For Master students: Implement both.
75		-
76		-//Synchronous Languages//
77		-
78		-* (% style="letter-spacing: 0.0px;" %)**eSCL - Implementing {{code language="none"}}gotopause{{/code}}**(%%) (Bachelor/Master)
79		-Create an extended dialect of the SC Language including the {{code language="none"}}gotopause{{/code}} statement and implement a transformation to SCL.
80		-\\
	104	+

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-46858245
	1	+10748078

URL

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