|
|
System for Support of Dynamic Data Structures Learning
Trávníček, Jiří ; Grulich, Lukáš (referee) ; Křena, Bohuslav (advisor)
The main objective of this work is to design and implement an application that can be used as an aid for the education of programming essentials. Particularly, the attention focuses on the domain of dynamic data structures. The target application will be implemented with the use of web technologies so that it can be run in an ordinary WWW browser. First of all, a brief introduction recapitulates the data structures to be covered. Then the work summarizes the usable technologies available within the web browsers with the focus on the particular technology (which is DHTML) that will become the target platform. The most significant part of this work then discusses the design of the final application. This rather theoretical part is then followed by the description of the practical implementation. A short user manual is also included.
|
|
|
Scientific Web Portal Generator
Růžička, Štěpán ; Vyskočil, Michal (referee) ; Smrž, Pavel (advisor)
In this document I am talking about dynamic web application, which I am making via Ruby on Rails, XML, MySQL and AJAX technology. Introduce describes, why I have chosen this job, and what you can find in this document. Next part is about Ruby on Rails and XML, where I am describing how to use REXML library and what it offers to you. There are some examples to better understanding that. Continuing with describing libraries, which can offer dynamic, sound and some other effects. Prototype and script.aculo.us are described there and some examples as well. Semifinal chapter is about Web portal generator in general at first and next about single steps when I was working on my application. In last one chapter I am trying to look on my application from user's point of view. I am describing the way, how I tried to make application better for usual user. I joined some reactions from persons who had the opportunity to work with my application. Document terminates by resume of gained experiences.
|
|
|
The woody plants in the public city space
Markevičová, Vendula ; Kyselka, Mojmír (referee) ; Babka, Václav (referee) ; Hrubanová, Denisa (referee) ; Havliš, Karel (advisor)
This tesis are about the mutual relation between the woody plants and the city public space, more precisely between the architectural composition and its elements. Woody plants, particulalry the trees,are under the same aesthetical rules as all the other elements of the public space, but at the same time are the living organisms, that are under the rules of nature. The thesis present five thematic groups of information, thats are necessary to know for the design of the woody plants in the city public space. On the base of this information the thesis review the streets and the squares of the city Brno and prove no contradiction between the aesthetical rules and the rules of nature. Contrarily, they support each other. It proves, that the high quality city space with the woody plants, is possible to create only with the knowledge of the both rules and their aplications.
|
|
|
Web Application for Managing Notes
Hrdina, Jan ; Očenášek, Pavel (referee) ; Burget, Radek (advisor)
The thesis deals with design and implementation of a web application for managing tree-structured notes. Its aim is to fulfill the true potential of using computers in this area. It tries to achieve this goal using (1) multiple ways of viewing and editing one data, (2) focusing the data-model primarily on the meaning of stored information instead of appearance and (3) implementing tools for interactive work with text (e.g. attaching multimedia). Apart from the application design itself, the text briefly goes through modern trends in web applications development, it defines the basic concepts in relation to existing tools for managing notes and outlines wide possibilities of further development. The application itself was implemented using technologies such as Polymer, TypeScript or Firebase.
|
|
| |
|
| |
|
|
Visualization of relations between computers in the Internet
Cimbálek, Přemysl ; Malý, Jan (referee) ; Komosný, Dan (advisor)
Internet Protocol Television (IPTV) transmits the television signal over the TCP/IP family of protocols. Its advantages are for example that the transmitting is not only one-way as in the “classical” TV broadcasting, but it can provide feedback such as interactivity. There are also some problems which avoids development, for example low channel capacity of access networks. That is why new methods , for example how to get more efficiency in IPTV transmission, are proposed. The main task of this diploma thesis is to visualize tree structure of relations between nodes in the network, based on understanding of principles of the hierarchical summarization and IPTV transmitting. The nodes in the tree structure provide computing and summarizing of the data in back-way channel. There is the data from the end users in this channel. In the first part of this diploma thesis there is explained the principle of IPTV and its differences as compared with classical TV broadcasting. The part is also aimed for the supported services, advantages and disadvantages. There is explained the compressing data with the MPEG-2 and MPEG-4 standards and problems with transport networks called “last mile problem.” To transmitting data IPTV uses Source Specific Multicast – every user connects to the multicast session with requested TV program. Feedback is provided by unicast. Feedback network uses the hierarchical summarization principle to reduce the data. This problem, connected with RTP, RTCP and TTP protocols, is in the work described as well. There is an international experimental network called PlanetLab mentioned in theoretical part of this work. Proposed structure of new protocol and applications including the visualization for IPTV broadcast, is tested in that network. In the practical part of this work there are discussed possibilities and methods for the visualization and data storage. Because of high availability and flexibility, there were chosen web technologies, such as MySQL for data storage. The tree model is executed by Java. The visualization is solved by web technologies, source code for visualization is dynamically generated by scripts in JSP (Java Server Pages). Graphical output is provided by the vector format SVG (Scalable Vector Graphics) which is created for graphical expression on the internet and in the mobile phones. There were created interactive web application thanks its ability to cooperation with Javascript technology. This application visualizes relation-tree structure of nodes. In this work there are explained basics of all used technologies, there are also given reasons for chosen methods and formats. Examples and interesting parts of solution are mentioned as well.
|
|
|
Generating Realistic Tree Models
Kučerňák, Martin ; Nečas, Ondřej (referee) ; Polok, Lukáš (advisor)
This thesis deals with generating realistic tree models. It describes briefly growth of trees and factors that influence growth. Next, it describes development of methods for tree generation, and describes few chosen methods. After that, simple stochastic method for generating trees is designed, and application, in which the method is implemented, is described. Trees created by this method are then compared with existing methods and aplications, and its qualities are discussed. Then areas with room for improvement are named.
|
|
|
Application for Tree Stability Measurement
Šoltés, Jakub ; Kolář, Martin (referee) ; Polok, Lukáš (advisor)
This thesis is concerned with the subject of tree stability under a wind load. It defines, what the tree stability is, which techniques are used for its measurement and why it is important to determine it. It describes development process of application, that examines tree stability. Furthermore it analyses available the development tools, discusses a design and an implementation of the application written in C# language. Application has been created using .NET Framework along with graphical subsystem Windows Presentation Foundation following the design pattern Model View ViewModel. The result of this thesis is a desktop application aimed on Windows operating system. It can compute stability coefficient of the tree using information about trees‘ geometry and its environment. The value of stability coefficient is commonly used for tree safety inspection.
|
|
|
Searching algorithms
Ďuriš, Martin ; Šeda, Miloš (referee) ; Dvořák, Jiří (advisor)
The thesis describes and analyzes selected searching algorithms for single dimensional array. Algorithms are analyzed mathematically and graphically. Mathematical analysis is based on analysis of average amount of performed comparisons required for the final result and literature review. Graphical analysis is based on multiple examinations of selected searching methods with randomly generated single dimensional arrays. The graphs show dependency of elapsed searching time of successful and unsuccessful searching trial on the size of single dimensional array. The results establish the binary searching algorithm as the fastest one of the selected searching algorithms.
|
guest ::
