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 @@
1		-XWiki.ssm
	1	+XWiki.ima

Content

...	...	@@ -8,7 +8,7 @@
8	8
9	9
10	10
11		-{{toc/}}
	11	+{{toc exclude="Outline"/}}
12	12
13	13	= Automatic Graph Layout =
14	14
...	...	@@ -24,34 +24,45 @@
24	24
25	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.
26	26
27		-* **Tight Packing of Connected Components** (Bachelor)
	27	+* **Tight Packing of Connected Components** (Bachelor, Master)
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}}Layering Algorithms** (Bachelor, Master)
31		-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.
32		-* **Combining Forces and Layers** (Master)**
33		-**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.
	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	+
	31	+{{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"}}
	32	+KIPRA-1031
	33	+{{/jira}}
	34	+
	35	+
	36	+
	37	+* **Layering Algorithms** (Bachelor, Master)
	38	+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.
34	34	* **Node Placement With a Focus on Compactness** (Master)
35	35	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.
	41	+
	42	+
	43	+
36	36	* **Force Based Drawing with Port Constraints** (Master)
37	37	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"]].
	46	+* **Combining Forces and Layers** (Master)**
	47	+**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.
38	38	* **Interactive constraint creation and application in automatic layout **(Bachelor/Master)
39	39	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.
40		-\\
41		-* **Compound Graph Layout** (Master)
42		-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.
	50	+
	51	+
	52	+
43	43	* **Orthogonal "Edge Bundling"** (Bachelor, Master)
44	44	Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm.
45		-\\
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**
	55	+* **A Simple Edge Router** (Bachelor)
	56	+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.
	57	+* **Improved Spline Edge Routing **(Master)
	58	+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.
	59	+* **Improve and Assess KLay Layered's JUnit Test Environment **(Bachelor, Master)
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.
50	50	\\
51	51
52	52	= Modeling Pragmatics =
53	53
54		-**Advisors:** Reinhard von Hanxleden, Ulf Rüegg, Christoph Daniel Schulze.
	65	+**Advisors:** Reinhard von Hanxleden, Ulf Rüegg, Christoph Daniel Schulze, Insa Fuhrmann
55	55
56	56	* **Control Flow Graph Exploration / Visualization** (Bachelor)
57	57	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.
...	...	@@ -60,7 +60,7 @@
60	60
61	61	= Semantics, Synchronous Languages and Model-based Design =
62	62
63		-**Advisors:** Christian Motika, Steven Smyth, Reinhard v. Hanxleden
	74	+**Advisors:** Christian Motika, Steven Smyth, Reinhard v. Hanxleden, Insa Fuhrmann
64	64
65	65	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.
66	66
...	...	@@ -73,55 +73,43 @@
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
85		-* (% style="line-height: 1.4285715;" %)**Optimization of the SCCharts compiler **(%%)(Bachelor/Master)
86		-Profile the actual SCCharts compiler and apply optimizations; also evaluate the possibility to use multiple cores for compilation
87		-* **Optimization of the SCCharts transformations** (Bachelor/Master)
88		-Profile the actual SCCharts transformations and apply optimizations
89		-* **On the pragmatics of modeling large models in SCCharts** (Bachelor/Master)
	87	+
	88	+
	89	+* (% style="line-height: 1.4285715;" %)**Optimization of the SCCharts compiler/transformations **(%%)(Bachelor/Master)
	90	+Profile the actual SCCharts compiler/transformations and apply optimizations; also evaluate the possibility to use multiple cores for compilation
	91	+* (% style="line-height: 1.4285715;" %)**On the pragmatics of modeling large models in SCCharts**(%%) (Bachelor/Master)
90	90	Evaluate the possibilities to create and maintain large models in model-based languages (i.e. SCCharts) and provide suggestions for improvements
91		-* **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
	93	+* **Visualization of Model-based Simulation via Tracing** (Bachelor/Master)
	94	+Use the already implemented Model-to-Model-Tracing in KIELER to visualize simulations.
	95	+* **Incremental Compilation of SCEst** (Bachelor/Master)
	96	+Modify the KIELER SCEst language so that KIELER is able to compile Esterel step-by-step to C via SCL.
	97	+* **Model-based Compilation of Legacy C Programs** (Bachelor/Master)
	98	+Implement a model-based compiler in KIELER that is able to compile C to (S)CCharts and then back to C again.
	99	+* **Extend the SC MoC to handle priority-based variable accesses** (Bachelor/Master)
92	92	Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
	101	+* **Transformation of Circuits to SCCharts** (Bachelor/Master)
	102	+Implement a transformation that translates circuits to (dataflow) SCCharts.
	103	+* **On the Pragmatics of Interactive Timing Information Feedback for graphical modeling** (Bachelor)
	104	+Use Pragmatics concepts to enhance the timing information feedback of the Interactive Timing Analysis.
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
	106	+* **Efficient data dependency & scheduling analyses in SCCharts** (Master/Bachelor)
	107	+Implement analyses for data dependency, scheduling (e.g. tick boundaries) for SCCharts to improve static scheduling of the compiler
	108	+* **Curing Schizophrenia in SCCharts **(Master/Bachelor)
	109	+Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
	110	+* **SCCharts Debugging** (Master/Bachelor)
	111	+Implement more sophisticated debugging mechanisms (e.g. breakpoints, observers) for SCCharts
	112	+* **Environment Simulations for SCCharts** (Master/Bachelor)
	113	+Develop a system to simulate environments (e.g. for Lego Mindstorms) for SCCharts in KIELER
	114	+* **SCCharts Verification** (Master/Bachelor)
	115	+Add the possibility to perfom model checking on SCCharts
102	102	\\\\
103	103	* **Quartz **(Master)
104	104	Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
105		-* **Implementation of a priority-based compilation approach **(Master)
106		-Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.
107		-* **Curing Schizophrenia in SCCharts **(Master)
108		-Develop new synchronizer to handle schizophrenia properly (e.g. depth join).
109		-* **Hybrid Models for Legacy Code Extraction**
110		-Extract legacy code (e.g. legacy C code) to (SCCharts) Hybrid Models.
	119	+* --**Implementation of a priority-based compilation approach **(Master) --
	120	+--Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.--
	121	+* **Raceyard evaluation** (Master)
	122	+Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
111	111
112		-= PRETSY / PRETSY2 =
113		-
114		-**Advisors:** Insa Fuhrmann, Steven Smyth
115		-
116		-Im Rahmen des PRETSY-Projektes (siehe [[www.pretsy.org>>url:http://www.pretsy.org/||title="Projekthomepage" shape="rect" class="external-link-new-window external-link"]], dort findet sich auch im Rahmen des Projektes bereits veröffentlichte Literatur) und seines geplanten Nachfolgerprojektes sind Abschlussarbeiten zu vergeben, die sich inhaltlich mit der Verbindung Sequentiell Konstruktiver (SC für Sequentially Constructive) Sprachen mit Precision Timed (PRET) Prozessoren als Ausführungsplattform befinden.
117		-
118		-Sequentielle Konstruktivität als "Model of Computation (MoC)" ist im Zuge des PRETSY Projektes entwickelt worden und ist eng mit dem MoC der Sychronen Sprachen verwandt, erweitert dieses aber konservativ, das heißt, es lässt alle Programme zur Ausführung zu, die auch als gültiges synchrones Programm (insbesondere im Sinne der Programmiersprache Esterel) gelten würden. Anders als Esterel erlaubt es aber mehrere schreibende und lesende Zugriffe auf geteilte Variablen, solange diese eindeutig sequentiell geordnet sind. Dies macht das SC MoC zugänglicher für Programmierer gängiger sequentieller Programmiersprachen: Zum Beispiel ist das Programmiermuster present "present x else emit x" ("if (!x) {...; x = true}") gültig im SC MoC, nicht aber in Esterel.
119		-
120		-Im PRETSY Projekt wurden die Programmiersprachen SCCharts und SCL entwickelt, grundsätzlich können wir diese auf jeder beliebigen Plattform ausführen, die Ausführung auf PRET Architekturen bietet aber einige zusätzliche Vorteile und Aspekte, insbesondere verfügen diese Architekturen über eine besonders einfach zu analysierende WCET, über zusätzliche Befehle, um die Ausführungszeit zu kontrollieren und Exceptions bei Zeitüberschreitungen zu definieren sowie über mehrere Hardwarethreads. Aktuelle Themenvorschläge finden sich im [[KIELER Wiki>>url:http://rtsys.informatik.uni-kiel.de/confluence/display/KIELER/Topics+for+Student+Theses||shape="rect" class="internal-link None"]]
121		-
122		-* **Real-time extensions for SCCharts** (Bachelor/Master)
123		-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.
124		-
125	125	= (% style="color: rgb(0,0,0);" %)Miscellaneous Topics(%%) =
126	126
127	127	**Advisors:** to be determined.

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-13009004
	1	+15532291

URL

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