|
|
Interval linear programming
Garajová, Elif ; Hladík, Milan (advisor) ; Kearfott, Ralph Baker (referee) ; Bartl, David (referee)
Interval linear programming provides a modern approach for handling optimization problems affected by various sources of interval-valued uncertainty. Given lower and upper bounds on the inexact data, the model represents a set of linear programs with coefficients that can be independently perturbed within the respective ranges. The thesis forms a systematic study of the optimality properties of interval linear programs and their solutions. Building on the existing research, we present a compilation of results published by the author, which fill in some of the gaps in the state-of-the-art literature on interval programming. We first examine the effects of standard transformations used in linear programming on the optimal solutions and optimal values of interval programs. Then, we characterize the properties of feasibility, optimality and (un)boundedness in the weak and in the strong sense (i.e. whether a property holds for some or for each scenario) and we analyze computational complexity of the associated decision problems. Further, we focus on the optimal solutions and prove that several related decision problems are (co)NP-hard even for interval programs with a fixed constraint matrix. We also show an integer programming reformulation useful in computing the optimal value range and discuss other concepts...
|
|
|
Bridging the Gap: Towards Unified Approach to Perfect and Imperfect Information Games
Moravčík, Matej ; Hladík, Milan (advisor) ; Pilarski, Patrick (referee) ; Kroupa, Tomáš (referee)
From the onset of AI research, games have played an important part, serving as a benchmark for progress in artificial intelligence. Recent approaches using search in combination with learning from self-play have shown strong performance and the ability to generalize across a wide range of perfect information games. In contrast, the leading algorithms for imperfect information traditionally used a small, abstract version of a game and solved this abstraction in one go. This thesis introduces a chain of improvements for imperfect information algorithms that culminates in two significant milestones that helped bridge the gap between perfect and imperfect information games. The first milestone is DeepStack - the first agent that successfully used a combination of sound search and a learned value function in imperfect information games. This led to the first AI to achieve victory over human professional players in no-limit poker. The second milestone is Player of Games - a universal algorithm that can master both perfect and imperfect information games starting from scratch. 1
|
|
| |
|
|
Production of plough share screw
Hladík, Milan ; Jopek, Miroslav (referee) ; Forejt, Milan (advisor)
The bachelor's thesis presents a design of plow screw production technology used to attach the blade to the plow frame. The screw is made of structural steel 14,140, in a production series of 120,000 pcs / year. From the possible technologies, the technology of volume cold forming was chosen. From the literature sources of the issue of volume cold forming, the optimal procedure of screw production was proposed. With the help of design, technological and control calculations, a machine was designed and subsequently a production tool, for which drawing documentation was prepared. With the help of technical - economic evaluation, the costs of component production were compared using volume forming and machining.
|
|
| |
|
|
Business Plan for Expansion of a Small Enterprise
Hladík, Martin ; Navrátil, Radoslav (referee) ; Khateb, Fabian (advisor)
The diploma thesis deals with company developement through improvement of product promotion, together with streamlining of the incentive pay system for employees and building of a new manufacturing facility. The theoretical part defines the main concepts that form the structure of the business plan. The following section includes a comprehensive analysis of the current status of the organization. The subject of the final part is to suggest measures based on the results of the previous analysis, aiming at overall development of the company.
|
|
|
Nanostructures for solar cells: controlling the surface electronic properties by monolayers of carborane molecules
Hladík, Martin ; Fejfar, Antonín (advisor)
Doped layers of crystalline silicon are currently the main driver of con- ventional photovoltaic devices. Direct introduction of group III and V atoms into the silicon matrix is still the mainstream of mass production of doped silicon. In this thesis, we are interested in non-invasive ways of doping of silicon wafers through the adsorption of molecules with a large intrinsic dipole moment on the semiconductor surface. These molecules, namely carboranedithiols, create a self-assembled monolayer accompanied by the surface dipole formation. In order to stabilise the dipole layer, an interfacial charge transfer can occur between the adsorbate and the substrate, modifying the density of accumulated charge carriers just below the silicon surface. These are the fundamen- tal features of the surface transfer doping of the silicon substrate where we employ the carboranedithiol molecules as mediators of adsorbing dipole layer. Regarding the structure of the thesis, we first test the carboranedithiol molecules on gold, and then we move on to the issue of silicon-molecule junctions. We characterise the geometry and the electronic properties of the carboranedithiol molecules on both of these substrates by means of atomistic simulations based on a density functional theory.
|
|
|
Nanostructures for solar cells: controlling the surface electronic properties by monolayers of carborane molecules
Hladík, Martin ; Fejfar, Antonín (advisor) ; Bartošík, Miroslav (referee) ; Londesborough, Michael G. S. (referee)
Doped layers of crystalline silicon are currently the main driver of con- ventional photovoltaic devices. Direct introduction of group III and V atoms into the silicon matrix is still the mainstream of mass production of doped silicon. In this thesis, we are interested in non-invasive ways of doping of silicon wafers through the adsorption of molecules with a large intrinsic dipole moment on the semiconductor surface. These molecules, namely carboranedithiols, create a self-assembled monolayer accompanied by the surface dipole formation. In order to stabilise the dipole layer, an interfacial charge transfer can occur between the adsorbate and the substrate, modifying the density of accumulated charge carriers just below the silicon surface. These are the fundamen- tal features of the surface transfer doping of the silicon substrate where we employ the carboranedithiol molecules as mediators of adsorbing dipole layer. Regarding the structure of the thesis, we first test the carboranedithiol molecules on gold, and then we move on to the issue of silicon-molecule junctions. We characterise the geometry and the electronic properties of the carboranedithiol molecules on both of these substrates by means of atomistic simulations based on a density functional theory.
|
|
|
Multiobjective shortest path problem with interval costs
Březina, Jiří ; Hladík, Milan (advisor) ; Fink, Jiří (referee)
The multiobjective shortest path problem with interval costs is a gener- alization of the single-pair shortest path problem. In this problem, the edge weights are represented as tuples of intervals. The aim is to find the path that minimizes the maximum regret. We present theorems regarding the compu- tation of the regret and the efficiency of a feasible solution to the problem. The main result of the thesis is an algorithm seeking for the solution with the least regret in the interval multiobjective shortest path problem. 1
|
|
|
Geometry of interval linear systems
Kotecký, Cyril ; Hladík, Milan (advisor) ; Rada, Miroslav (referee)
Interval linear systems of equalities and inequalities are linear systems, where the real numbered entries of the vectors and matrices are replaced with closed intervals of real numbers. The sets of solutions to these systems have interesting properties, mainly that they are unions of exponentially many convex polyhedra. This makes solving many problems hard, while on the other hand, the solution sets have a form that is convenient to analyze. This thesis deals with studying the geometry of such sets. We will begin by reviewing known properties of these sets, such as boundedness and connectedness. But mostly, we will focus on the conditions for convexity and the characterization of the convex hull, which are both known for the special case of systems with invertible interval matrices. Using polyhedral theory, we will broaden these results, mostly to general systems of interval linear inequalities. We will present illustrative examples, some serving as counter-examples in cases where generalizations are not possible. 1
|
guest ::
