|
|
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.
|
|
|
Categorization of typical damage to vehicles
Obrátilová, Alena ; Kaluža, Zdeněk (referee) ; Tokař, Stanislav (advisor)
The Diploma thesis deals with segmentation of characteristic car damages, which arise during car crushes with ambient infrastructure of roads with concrete specialization to car crushes with trees and road culverts. According to chosen clash configurations there were characterized appropriate damages of front part of the car with usage of materials from real accidents. Level of damage is described according to location of the main point of impact and a speed during clash. The thesis provides summary of possible level of damage single parts of the car with focusing to front part and it gives opportunity comparison to detected damages during real car crushes with car damages made during manipulated harmful events.
|
|
| |
|
| |
|
|
Systems for remote measurement in power engineering
Hudec, Lukáš ; Mlýnek, Petr (referee) ; Mišurec, Jiří (advisor)
The work deals with the measurement and management in power. Provides an introduction to the problems of remote meter reading, management, and describes the current situation in the field of modern technologies Smart metering and Smart grids. It also analyzed the issue of collection of networks and data collection from a large number of meters over a wide area. For the purpose of data transmission are described GPRS, PLC, DSL, ... Further, there are given options to streamline communication. This area is used hierarchical aggregation. Using k-means algorithm is a program designed to calculate the number of concentrators and their location in the group of meters. The finished program is written in Java. It has a graphical interface and shows how the calculation is conducted. To verify the results of the optimization program is given simulation model in OPNET Modeler tool. Audited results are described in the conclusion and can deduce that using the optimization program is to streamline communications.
|
|
|
Tree Code Decoding Methods
Zamazal, Zdeněk ; Lambertová, Petra (referee) ; Němec, Karel (advisor)
This thesis deals with applying knowledge of data channel coding and concerns about possibilities of tree codes decoding. It describes several decoding methods and inquires their ins and outs. Basic knowledge of theory of information is necessary, it is presumed that reader is familiar with convolutional codes and coder definitions. Criterions for choosing decoding method are introduced and lightely described. A decoder is designed using method choosed by denoted criterions. Implementation of the decoder, using Matlab Simulink enviroment, has taken part in the thesis. Function of the decoder is verified in simulation.
|
|
|
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.
|
|
|
TRANSFORMATION OF BRONX IN BRNO
Najvarová, Lucie ; Karasová, Miroslava (referee) ; Havliš, Karel (advisor)
The strategy reacts to social exclusion of inhabitants of the Cejl district. It supports employment and intends to build a dynamic public space, that is missing in the area. Social urbanism focuses on the interaction of inhabitants between each other and with the spaces, and creates conditions for new workplaces. The massive broken block gets the order. The park defines a system for future development and opens up new possibilities of usage. Thanks to its low cost construction, the park can work immediately. The order created by the park allows the future objects to emerge freely and spontaneously. The design is not definitive, but it works in every phase or combination.
|
|
| |
|
|
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 ::
