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.uru

Content

...	...	@@ -19,6 +19,8 @@
19	19	Our layout algorithm already supports the placement of edge labels. However, there's still room for improvement...
20	20	* **Layering Algorithms** (Bachelor, Master)
21	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	+* **Orthogonal "Edge Bundling"** (Bachelor, Master)
	23	+Implement and evaluate strategies for orthogonal edge bundling within our layer-based layout algorithm.
22	22	* **Node Placement With a Focus on Compactness** (Master)
23	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	24	* **Compound Graph Layout** (Master)
...	...	@@ -27,13 +27,12 @@
27	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	28	* **Combining Forces and Layers** (Master)**
29	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.
	32	+\\
30	30
31	31	= Modeling Pragmatics =
32	32
33	33	**Advisors:** Reinhard von Hanxleden, Ulf Rüegg, Christoph Daniel Schulze.
34	34
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	37	* **Control Flow Graph Exploration / Visualization** (Bachelor)
38	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	39	* **Compound Graph Exploration** (Bachelor, Master)
...	...	@@ -62,7 +62,7 @@
62	62	Profile the actual SCCharts compiler and apply optimizations; also evaluate the possibility to use multiple cores for compilation
63	63	* **Optimization of the SCCharts transformations** (Bachelor/Master)
64	64	Profile the actual SCCharts transformations and apply optimizations
65		-* **SCCharts Andriod backend for Mini Drones** (Bachelor/Master)
	66	+* **SCCharts Andriod backend for Mini Drones** (Bachelor/Master)  [work in progress, Bachelor/Master project summer term 2015]
66	66	Develop a new code generation backend for SCCharts for Andriod applications with Mini Drones as demonstrator
67	67	* **On the pragmatics of modelling large models in SCCharts** (Bachelor/Master)
68	68	Evaluate the possibilities to create and maintain large models in model-based languages (i.e. SCCharts) and provide suggestions for improvements
...	...	@@ -97,9 +97,9 @@
97	97	* **Real-time extensions for SCCharts** (Bachelor/Master)
98	98	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.
99	99	* **Adding dataflow to SCCharts** (Bachelor/Master) [work in progress, Axel Umland]
100		-Add dataflow to SCCharts
	101	+Add dataflow to SCCharts
101	101	\\
102		-* **Multithreaded/Multicore execution of SCCharts **(Master/Bachelor)
	103	+* **Multithreaded/Multicore execution of SCCharts **(Master/Bachelor)  [work in progress, Tibor Weiß]
103	103	Evaluate possibilities to preserve parallelism in SCCharts, implement mapping for (fine grained) multithreading and multicore
104	104	based on the [[FlexPRET>>url:http://www.eecs.berkeley.edu/Pubs/TechRpts/2013/EECS-2013-172.pdf||shape="rect"]] processor.
105	105

Confluence.Code.ConfluencePageClass[0]

Id

...	...	@@ -1,1 +1,1 @@
1		-10751356
	1	+10751672

URL

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