Wiki source code of Topics for Student Theses

Version 44.1 by ssm on 2014/12/27 18:14

version	line-number	content
36.1	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.
3.1	2
36.1	3	On this Page
	4
	5
	6
	7	{{toc/}}
	8
39.1	9	= Graph Layout =
1.1	10
41.1	11	Advisors: Ulf Rüegg, Christoph Daniel Schulze.
	12
39.1	13	* Tight Packing of Connected Components (Bachelor)
40.1	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}}\\
39.1	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)
40.1	17	Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.\\
39.1	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)
24.1	19	Our layout algorithm already supports the placement of edge labels. However, there's still room for improvement...
39.1	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.
15.1	30
39.1	31	= Modeling Pragmatics =
15.1	32
41.1	33	Advisors: Reinhard von Hanxleden, Ulf Rüegg, Christoph Daniel Schulze.
	34
39.1	35	* Comment Attachment (Bachelor)
33.1	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.
39.1	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.
41.1	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.
15.1	41
39.1	42	= Semantics and Synchronous Languages =
15.1	43
42.1	44	Advisors: Christian Motika, Steven Smyth
41.1	45
42.1	46	* Automatic documentation generation for model-based languages (Bachelor)
	47	Develop an automatic SCCharts documentation & comment system
	48	* Merging SCCharts and KLOTS (Bachelor)
	49	Implement KLOTS as demonstrator extension of the KIELER SCCharts implementation
44.1	50	* On the usability of the KIELER SCCharts compiler (Bachelor)
	51	Evaluate the actual implementation of the KIELER SCCharts compiler and provide suggestions for improvements
42.1	52	\\
	53	* Validation Manager for Models (Bachelor/Master)
9.1	54	Develop an integrated, flexible and generic syntactic validation framework for models (e.g. Esterel or SyncCharts).
42.1	55	* SCCharts compiler validation with Esterel (Bachelor/Master)
33.1	56	Automate the validation of the SCCharts compiler using the Esterel simulation.
42.1	57	* Transformation from SCCharts to Esterel (Bachelor/Master)
33.1	58	Develop a transformation in Xtend2 to generate Esterel code for SCCharts.
42.1	59	* Hardware Synthesis from SCCharts to FPGA (Bachelor/Master)
34.1	60	Use the circuit-based code generation to produce code for FPGAs
43.1	61	* (% style="line-height: 1.4285715;" %)Optimization of the SCCharts compiler (%%)(Bachelor/Master)
34.1	62	Profile the actual SCCharts compiler and apply optimizations
43.1	63	* Optimization of the SCCharts transformations (Bachelor/Master)
	64	Profile the actual SCCharts transformations and apply optimizations
44.1	65	* SCCharts Andriod backend for Mini Drones (Bachelor/Master)
	66	Develop a new code generation backend for SCCharts for Andriod applications with Mini Drones as demonstrator
	67	* On the pragmatics of modelling large models in SCCharts (Bachelor/Master)
	68	Evaluate the possibilities to create and maintain large models in model-based languages (i.e. SCCharts) and provide suggestions for improvements
42.1	69	\\
	70	* Detecting tick boundaries in SCCharts (Master/Bachelor)
	71	Implement an algorithm that detects tick boundaries (in concurrent) threads and therefore improves the scheduling
	72	* Efficient data dependency analyses in SCCharts (Master/Bachelor)
44.1	73	Implement data dependency analyses for SCCharts to improve static scheduling of the compiler
42.1	74	* KIELER evaluation environment for synchronous languages (Master/Bachelor)
	75	Develop a reliable evaluation environment to compare common synchronous languages (i.e. Esterel/SyncCharts & SCCharts)
	76	* Raceyard evaluation (Master/Bachelor)
	77	Evaluate the possibility for the use of SCCharts in the Raceyard context and pave the way for future experiments
	78	\\
	79	* Quartz (Master)
	80	Integrate the synchronous Quartz language into KIELER for validation purposes and teaching.
	81	* Implementation of a priority-based compilation approach (Master) [work in progress, Caroline Butschek]
	82	Implement the SyncCharts priority-based compilation approach into the SCCharts compiler chain.
	83	* From Esterel to SCL (Master) [work in progress, Karsten Rathlev]
	84	Implement transformations that translate Esterel programs to SCL
	85	* Curing Schizophrenia in SCCharts (Master)
	86	Develop new synchronizer to handle schizophrenia properly (e.g. depth join).**
	87	**
	88	* Railway 4.0 (Master) [work in progress, Nis Wechselberg]
	89	Design a new and modern hardware controlling (Version 4) for the railway installation.
1.1	90
39.1	91	= PRETSY / PRETSY2 =
38.1	92
42.1	93	Advisors: Insa Fuhrmann, Steven Smyth
41.1	94
42.1	95	* Real-time extensions for SCCharts (Bachelor/Master)
38.1	96	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.
42.1	97	* Adding dataflow to SCCharts (Bachelor/Master) [work in progress, Axel Umland]
	98	Add dataflow to SCCharts
	99	\\
	100	* Multithreaded/Multicore execution of SCCharts (Master/Bachelor)
	101	Evaluate possibilities to preserve parallelism in SCCharts, implement mapping for (fine grained) multithreading and multicore
	102	based on the [[FlexPRET>>url:http://www.eecs.berkeley.edu/Pubs/TechRpts/2013/EECS-2013-172.pdf\|\|shape="rect"]] processor.
38.1	103
42.1	104	= (% style="color: rgb(0,0,0);" %)Miscellaneous Topics(%%) =
15.1	105
41.1	106	Advisors: to be determined.
	107
39.1	108	* Developing an Info Screen (Bachelor)
15.1	109	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.

Wiki source code of Topics for Student Theses

Navigation

Quick Links