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

...	...	@@ -24,30 +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	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		-* **{{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)
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.
	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.
	50	+
	51	+
	52	+
40	40	* **Orthogonal "Edge Bundling"** (Bachelor, Master)
41	41	Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm.
42		-* **Improve and Assess KLay Layered's JUnit Test Environment**
43		-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.
44	44	* **A Simple Edge Router** (Bachelor)
45	45	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)
	60	+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.
46	46	\\
47	47
48	48	= Modeling Pragmatics =
49	49
50		-**Advisors:** Reinhard von Hanxleden, Ulf Rüegg, Christoph Daniel Schulze.
	65	+**Advisors:** Reinhard von Hanxleden, Ulf Rüegg, Christoph Daniel Schulze, Insa Fuhrmann
51	51
52	52	* **Control Flow Graph Exploration / Visualization** (Bachelor)
53	53	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.
...	...	@@ -56,7 +56,7 @@
56	56
57	57	= Semantics, Synchronous Languages and Model-based Design =
58	58
59		-**Advisors:** Christian Motika, Steven Smyth, Reinhard v. Hanxleden
	74	+**Advisors:** Christian Motika, Steven Smyth, Reinhard v. Hanxleden, Insa Fuhrmann
60	60
61	61	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.
62	62
...	...	@@ -85,6 +85,8 @@
85	85	Add priorities to variable accesses to extend the SC MoC and therefore the number of valid sequentially constructive synchronous programs.
86	86	* **Transformation of Circuits to SCCharts** (Bachelor/Master)
87	87	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.
88	88	\\\\
89	89	* **Efficient data dependency & scheduling analyses in SCCharts** (Master/Bachelor)
90	90	Implement analyses for data dependency, scheduling (e.g. tick boundaries) for SCCharts to improve static scheduling of the compiler
...	...	@@ -104,19 +104,6 @@
104	104	* **Raceyard evaluation** (Master)
105	105	Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
106	106
107		-= PRETSY / PRETSY2 =
108		-
109		-**Advisors:** Insa Fuhrmann, Steven Smyth
110		-
111		-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.
112		-
113		-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.
114		-
115		-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"]]
116		-
117		-* **Real-time extensions for SCCharts** (Bachelor/Master)
118		-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.
119		-
120	120	= (% style="color: rgb(0,0,0);" %)Miscellaneous Topics(%%) =
121	121
122	122	**Advisors:** to be determined.

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-15532283
	1	+15532291

URL

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