|
|
Suspension footbridge across the Elbe River
Gregor, Petr ; Kocourek, Petr (referee) ; Stráský, Jiří (advisor)
The objective of this master´s thesis is a design of suspension footbridge across the Elbe river. The footbridge is suspended construction by three spans. The brick deck is supported on the outer edges and it is kept in a parabolic arc. The suspension cables are kept at two inclined levels. The model is implemented in the program ANSYS. The solution is non-linear. The designe is according to the europien standart.
|
|
|
Filling materials for vertical and horizontal constructions using renewable raw materials
Gregor, Petr ; Vacula, Miroslav (referee) ; Bydžovský, Jiří (advisor)
This thesis deals with industrial hemp and its use in vertical and horizontal structures. The work is mainly focused on the fillers of industrial hemp and inorganic binder. In the practical part of the feasibility study for future use of industrial hemp in the construction industry as a filling materiál in vertical and horizontal structures. This area has been targeted by all test samples. They are presented here and evaluated and compared the results of tests on unconfined compressive strength, compressive strength, depending on the deformation density of fresh and hardened mixture and the termal conductivity of different types of inorganic binders and fillers such as hemp.
|
|
|
Distance magic labelings
Pfeiffer, Hayden ; Gregor, Petr (advisor) ; Pangrác, Ondřej (referee)
Title: Distance Magic Labelings Author: Hayden Pfeiffer Department: Dept. of Theoretical Computer Science and Mathematical Logic Supervisor: doc. Mgr. Petr Gregor, Ph.D., KTIML, MFF UK Abstract: A distance magic labeling of a graph G is a bijection f : V (G) → {1, 2, . . . , |V (G)|} such that the sum of labels on the neighbourhood of each vertex is constant. A framework based on linear algebra has been developed using the notion of neighbour balance to determine whether there exists a distance magic labeling for a hypercube with dimension n. In this thesis, we extend this framework to all Cayley graphs on Zn 2 . We use this framework to reprove some known results from recent literature. We also use this framework to introduce the notion of component-wise distance magic labelings on Cayley graphs of Zn 2 . Keywords: distance magic labeling, Cayley graph, hypercube, neighbour balance iii
|
|
|
Gray code based bitmap compression
Škorvaga, David ; Dvořák, Tomáš (advisor) ; Gregor, Petr (referee)
This thesis deals with a compression of bitmap indexes. Bitmap indexes may be reduced through specialized algorithms which look for long runs of identical bits. To improve the compression ratio, it is useful to reorder the rows of the index. Even though the problem of optimal reordering is NP-hard, there are efficient heuristics which reorder the index in polynominal time. Recent results suggest that Gray code based sorting provides an effective alternative to the classical lexicographical sorting. In this thesis, we replace the classical Gray code with a novel construction which generates a compressed Gray code. We describe this construction in detail and use both real-life and randomly generated datasets to test whether the novel construction is more efficient than the classical one when used in the WAH compression scheme.
|
|
|
Communication in Multi-Agent Systems
Bosík, Andrej ; Štěpánek, Petr (advisor) ; Gregor, Petr (referee)
This thesis analyses the questions of communication between agents in MAS. Firstly, I tried to introduce a logic agents, particularly logic rational agents. For rational logic agents characterization I used LORA logic. I illustrated the syntax and the semantic of LORA. Then I concentrated on architecture MAS according to a FIPA specification. I used the JADE environment as implementation of this architecture. JADE is fully implemented in the JAVA language. I described how the communication between two JADE agents works and what form and parameters the messages according to the ACL language have. FIPA developed the ACL language for communication between agents. I described how agents use the protocols. JADE didn't contain any protocol for negotiation. That is why I integrated a new VETO protocol into JADE. This protocol can use all the JADE agents. In order to do it, I integrated new message parameters into JADE. This message parameters extend the ACL message parameters. For demonstration I implemented two classes in the JADE (one for the initiator and one for the responder) using a Veto protocol. Further, I described how new negotiation protocols could be add to JADE. For example I added to JADE another negotiation protocol, called NEGO. At last I used my new implemented ability to negotiation on...
|
|
|
Hamiltonovské kružnice v hyperkrychlích s odstraněnými vrcholy
Pěgřímek, David ; Gregor, Petr (advisor) ; Dvořák, Tomáš (referee)
In 2001 Stephen Locke conjectured that for every balanced set F of 2k faulty vertices in the n-di- mensional hypercube Qn where n ≥ k + 2 and k ≥ 1 the graph Qn − F is hamiltonian. So far the conjecture remains open although partial results are known; some of them with additional conditions on the set F. We explore hamiltonicity of Qn − F if the set of faulty vertices F forms certain isometric subgraph in Qn. For an odd (even) isometric path P in Qn the graph Qn − V (P) is Hamiltonian laceable for every n ≥ 4 (resp. n ≥ 5). Although a stronger result is known, the method we use in proving the theorem allows us to obtain following results. Let C be an isometric cycle in Qn of length divisible by four for n ≥ 6. Then the graph Qn −V (C) is Hamiltonian laceable. Let T be an isometric tree in Qn with odd number of edges and let S be an isometric tree in Qm with even number of edges. For every n ≥ 4, m ≥ 5 the graphs Qn −T and Qm −S are Hamiltonian laceable. A part of the proof is verified by a computer. 1
|
|
|
Decision trees
Jahoda, Miroslav ; Mrázová, Iveta (advisor) ; Gregor, Petr (referee)
Among the known methods of data mining are neural networks, ILP, associative rules, Bayes networks, clustering, decision trees and others. This thesis is about decision trees, their implementation, visualization, extraction rules and the comparison of different decision trees and models of classification data in general. An integral part of the data mining process is preprocessing of data, which plays an important role and is also discussed in this thesis. Part of this thesis also concerns the comparison of different decision tree models such as CART, CHAID, C5.0 (See5) and others on a set of 3 data kinds. Finally, this model's results are compared to its results when data preprocessed by PCA analysis is used.
|
|
|
Třídy Booleovských funkcí umožňující efektivní hledání minimálních reprezentací.
Kuřík, Stanislav ; Čepek, Ondřej (advisor) ; Gregor, Petr (referee)
This thesis deals with the Boolean minimization problem. We discuss its time complexity in the general case for various representations of the input. Since this problem is known to be NP-complete, a survey of some of important classes for which it is polynomially solvable follows. The main part of this thesis presents a definition of a new class of Boolean functions, along with an algorithm for finding a minimal representation of a given function from this class in polynomial time. Finally, a generalization of this class is obtained and its minimization-related properties are discussed.
|
|
|
Software for Modeling Car Driving Properties
Malý, Ondřej ; Surynek, Pavel (advisor) ; Gregor, Petr (referee)
This work is intended for all interested in physical modelling, discrete computer simulations and motorism. Text part describes mathematical model of a car, description of forces and effects which occurs within car motion. Model is focused especially on the engine, trasferring the torque, braking and turning. Furthermore the thesis deals with electronic systems like ABS or ESP, which improves the steering control. The most important part of this work is a computer application for simulating and visualising the model. The program supports batch input and become a useful tool for experimenting with different settings of the car. Text part of the work includes screenshots taken during the tests and along with mathematical interpretation provides an insight into a physical principle of the car behaviour.
|
|
| |
guest ::
RSS feed.