|
|
An Interactive DNA Computing Simulator
Kovács, Martin ; Petrlík, Jiří (referee) ; Bidlo, Michal (advisor)
The aim of this work is to summarize the basic principles of operations performed over DNA molecules and to demonstrate their usage in solving some hard mathematical problems. In particular, the Hamiltonian Path Problem -- HPP (also known as the Traveling Salesman Problem) will be considered as a case study. A fundamental approach introduced by Leonard Adleman will be desctribed to solve the HPP using the DNA operations. His work may be considered as the first experiment in the area that is currently known as DNA computing. The goal of this bachelor thesis is to implement an interactive software simulator (based on the principles and formal models of Adleman's work) for solving the HPP and to evaluate its abilities with respect to area complexity considering various instances of HPP.
|
|
|
Statistical modul for working database TIVOLE
Ježek, Jan ; Wiera, Ryszard (referee) ; MBA, Jan Beran, (advisor)
Presented thesis thesis is written for IBM Company, specifically IBM IDC Czech Republic, s.r.o. branch. The thesis describes development of statistic module for work database TIVOLE utilizing Lotus Notes program. The basic aim of the thesis is to ease creation of reports and graphical data outputs in relation to speed of operator´s work while narrowing down the required time of human resources for solving problems.
|
|
|
Analysis of dynamic effects acting on the turnout constructions
Hajniš, Jan ; Vukušič, Ivan (referee) ; Smutný, Jaroslav (advisor)
Author´s name: Jan Hajniš School: Technical University - VUT, Brno Faculty of Civil Engineering Veveří 331/95, 602 00 Brno Program: Construction and Transportation Engineering Title: Analysis of dynamic effects acting on the turnout constructions Consultant: Prof. Ing. Jaroslav Smutný, Ph.D. Number of pages: about 70 + attachments Number of attachments: about 40 Year: 2012 This work describes the size and the process of dynamic effect – vibrations and shift – cockles in crossing panel and switch panels of the turnout constructions on steel and concrete sleepers in time and frequency domain. It compares the results of the measurement between these turnout constructions. Dynamic effects are undesirable physical phenomena for operation each train. It is therefore necessary to eliminate these phenomena as much as possible. The result of this test will by means of software programm and measuring set help to determine precisely the advantages and disadvantages of using both turnout constructions, or even to propose their improvements or dimensions.
|
|
|
Postal robot navigation
Jež, Radek ; Richter, Miloslav (referee) ; Janáková, Ilona (advisor)
This work deals with algorithms for postal robot control. It solves problems with finding shortest path and possible problems incurred during navigation of robot. Work includes description of used data structures and algorithms for autonomous activity. Next includes description of user interface of main control application and two supplement applications. Sequel is description of testing work in real environment and evaluation of results. At the end there are summarized information followed from testing and recommendations for next testing.
|
|
| |
|
|
Graphical Tool for Creation and Modification of Graphs
Hynšt, Miroslav ; Navrátil, Jan (referee) ; Zuzaňák, Jiří (advisor)
This paper deals with basics of the graph theory and graph rewriting. In the first part there is described a graph, graph rewriting systems, graph grammar and algebraic approach to the graph rewriting. In the second part of this paper there is analyzed an implementation of the designed aplication for creation, modification and saving graphs and graph rewrite systems.
|
|
|
Preparation of Homeworks in the Course Algorithms
Miloš, Roman ; Masopust, Tomáš (referee) ; Lukáš, Roman (advisor)
This Bachelor's thesis is about preparing of homeworks for the course Algorithms on graphs. Thesis contains five parts. The first task is to create graphs using adjacency matrix, next is to create a graph using the adjacency lists. The third task is to implement Prim algorithm for finding the minimum skeleton. The fourth is the implementation of Floyd-Warshall algorithm for finding minimum paths in the graph, finding the connection and completeness of the graph. The fifth task is to identify and implement discretion chart NP-complete problem of finding a maximum clique of graph.
|
|
|
High-Quality Visualization of Petri Nets for Publishing Purposes
Bednář, Drahoslav ; Kočí, Radek (referee) ; Janoušek, Vladimír (advisor)
This work is trying to solve the problem of graphical visualization of Petri nets in text publications. The aim of the thesis is to create a tool that will simplify generating of Petri nets and at the same time provide a more aesthetic graphical output than existing tools do. A simplex algorithm was used for automatic network layout. The program has both graphical interface and text mode and can cooperate well with existing tools for working with Petri nets, which the text also mentions. The program is able to load a pnml file and produce a usable image in png, pdf, and svg formats.
|
|
|
Optimization of dispatch of goods from rack system of logistics warehouse.
Chlup, Jiří ; Klapka, Jindřich (referee) ; Šeda, Miloš (advisor)
The diploma thesis submitted solves problems of optimization of goods expedition from rack system of a logistic store. It concerns solution of a practical task which optimizes a passage route through the rack system and evaluates individual orders for creation of optimal expedition dispatching batch. The existing dispatching system, use of sources and creation of time schedule is being described at the beginning. Description of general practical solutions of seeking the shortest way through the graph through appointed nodes follows. Chosen solution and its practical implementation are introduced afterwards. Comparative tests with existing system and their evaluations are mentioned at the end of the thesis.
|
|
|
Evolutionary Resynthesis of Combinational Circuits
Kocnová, Jitka ; Sekanina, Lukáš (referee) ; Vašíček, Zdeněk (advisor)
This master thesis is concerned about the resynthesis of combinational circuits with the help of evolutional principles. The first part of this text describes logic synthesis and its weak spots, evolutional synthesis and its advantages, and also some of the existing synthesis programs. The second part shows usage of graph algorithms in logic synthesis and their possible usage in an extension for the chosen synthesis program. Suggested design and practical implementation of the extension is also described in this part. In the third part extension testing is mentioned. The fourth part is the last one and concludes gained knowledge and results.
|
guest ::
