|
|
Automatic Generation of Test Cases from Data-Flow
Kraut, Daniel ; Fiedor, Tomáš (referee) ; Smrčka, Aleš (advisor)
This thesis deals with automatic generation of test cases on Unit testing level for source codes in C language. In order to achieve automatization are used methods of approach to software as a Data-flow of variables. There is outlined a process of creating tests here as well as a function of CSP solvers which are necessary part of solving this problems. Static code analysis is accessed with LibTooling libraring as part of a compiler front-end project Clang. Output of a developed application are provided here which is automatically generated input values for test cases.
|
|
|
Combination of Evolutionary Algorithms and Constraint Programming for Scheduling
Štola, Miroslav ; Pilát, Martin (advisor) ; Klíma, Martin (referee)
Scheduling problems and constraint satisfaction problems are generally known to be extremely hard. This thesis proposes a new evolutionary al- gorithm approach to solve a constrained-based scheduling problem. In this approach, variable orderings are evolved. The variable ordering serves as a parameter for the constraint solver. Its purpose is to determine the order in which variables are labelled by the solver. Hence the evolving individuals may be encoded as permutations. Therefore, our approach can be applied to a wider range of constraint satisfaction problems. Methods for generating the initial population of individuals based on the analysis of the precedence constraints graph are proposed. New genetic operators are presented and successfully applied. Our approach succeeded in finding a range of diverse schedules with the optimal makespan. Furthermore, multi-objective opti- mization was successfully attempted with the NSGA-II. 1
|
|
|
Modeling of Cooperative Path Finding
Ježek, Milan ; Surynek, Pavel (advisor) ; Majerech, Vladan (referee)
In this thesis we describe new models for solving the cooperative pathfinding (cpf) with the requirement of minimal makespan and experimental comparison with current models is performed. These new models investigate the possibilities of encoding the cpf problem into binary integer programming (bip) or constraint satisfaction problem (csp). Mainly the new active-edges IP model tests with high number of agents yielded good results, where it fell only slightly behind the best SAT model. A new csp model reached the fastest times in tests with low number of obstacles and agent interactions while struggling heavily in the opposite cases. Powered by TCPDF (www.tcpdf.org)
|
|
|
Constraint Satisfaction Problem and Universal Algebra
Kazda, Alexandr ; Barto, Libor (advisor) ; Růžička, Pavel (referee) ; Valeriote, Matt (referee)
The thesis consists of a collection of my contributions to universal algebra. Motivated by the Constraint Satisfaction Problem (CSP), we study the algebras of polymorphisms of relational structures. We begin by showing by an algebraic argument (and a bit of calculus) that random relational structures' CSP is almost always NP-complete. We then study digraphs with a Maltsev polymorphism, and conclude that such digraphs must also have a majority polymorphism. Next, we show how to use absorption tech- niques to prove that congruence modular reflexive digraphs must have an NU operation. We close our work by giving an algebraic proof of a result (first obtained by graph theorists) that 3-conservative relational structures with only unary and binary relations either define NP-complete CSP, or CSP for them can be solved by the local consistency algorithm. 1
|
|
|
Planning algorithms and plan simulation in logistics domain
Štefan, Zdeněk ; Toropila, Daniel (advisor) ; Valla, Tomáš (referee)
The goal of this thesis is to compare some means of planning in the logistics domain.The aim was to compare the capabilities of those techniques among each other and against plans designed by humans.Because some planners do not return parallel plans,it is necessary to parallelize them.It is shown that some algorithms achieve good results in comparison to plans designed by hu- mans. However, due to their high time and memory consumptions they cannot be nowadays commonly used to solve more difficult tasks.
|
|
|
Model building using CSP
Peterová, Alena ; Stanovský, David (advisor) ; Kazda, Alexandr (referee)
In the present work, we study algorithms for building finite models of sets of first-order axioms with the aim of proposing and implementing a new method, based on translation onto constraint satisfaction problem (CSP). In the theoretical part, we describe the standard MACE-style method, based on translating problems onto SAT, and advanced techniques that improve the effectiveness of this method: clause splitting, term definitions and static symmetry reduction. Next, we propose an alternative method, which translates problems onto CSP in a similar way. In addition, we have newly proposed a static symmetry reduction technique for binary functions. Next, we describe an implementation of the alternative method using a CSP-modelling language MiniZinc and a CSP-solver Gecode. Finally, we compare performance of our model finder against state-of-the-art representatives of standard methods, systems Paradox and Mace4.
|
|
|
Cloud Computing in sector of small and middle companies
Gärtner, Adam ; Šilerová, Edita (advisor) ; Hřebejková, Jana (referee)
This research focuses on the area of cloud computing, an important research area in computer and service sciences. The general aim of this research is to emphasize the business value of cloud computing to the business. The objective of this research is to explore the economic benefits of cloud computing in order to promote its use in the sector of small and middle companies.
In order to accomplish the objectives of this research, technologies of cloud computing were studied extensively. This research relies on secondary data sourced from books and academic and business journals on service science and the cloud computing and Cloudonomics concepts. All literature is critically analyzed and finding are passed into my analysis. Subsequently, the insistent cost benefits of cloud computing are identified.
The output of this research is a practical recommendation to adopt a cloud computing as cost optional solution. Additionally, encourage IT as a business strategy, which gives the direction for future research in this specific field is suggested.
|
|
|
New ways in Packaging
Hřešil, Tomáš ; Jankovský, Jaroslav (referee) ; Szendiuch, Ivan (advisor)
This project deals with the creating a base of manual for modern electronic packages, which are more and more used in today's electronic circuits and devices. The modern packages are mentioned small outline DIL, QFP, BGA, PGA, CSP, Flip chip. The work is also including packages known SiP (System in Package) that are consisting or use the combinations of packages BGA, PGA, CSP and Flip Chip. At the end of the work are short described the most important design rules for assembly of mentioned packages on substrate (PCB).
|
|
| |
|
|
Automatic jazz arrangement
Chadim, Petr ; Karafiát, Martin (referee) ; Fapšo, Michal (advisor)
This Thesis is focused on the arranging of the melody, which is accompanied by jazz chords. It deals with creating a more harmonious voices using Block Voicing method. Distribution to target notes and passing notes is made using techniques of constraint programming (CSP). Passing notes are reharmonized by dominant seventh chord or by parallel chord. Using CSP a bass part is also created. To solve CSP is used Gecode library. The harmonious voices are arranged by Four Part Close Voicing. The application result is a tool for the music arranger.
|
guest ::
