|
Analysis of plant extract of Orthosiphon stamineus by capillary zone electrophoresis
Hašek, Jan ; Polášek, Miroslav (referee) ; Pospíšilová, Marie (advisor)
Capillary zone electrophoresis with UV detection at 200 nm was developed for the determination of four phenolic acids and four flavonoids in plant material. The electrophoretic behavior of phenolic compounds was investigated to optimize their separation as a function of buffer pH, buffer concentration. A 50m mM borate buffer, pH 9 was found most favorable. The separation was obtained with fused-silica capillary column (50 cm x 50 μm I.D.) an applied voltage of 25 kV and a temperature of 25řC. For increase injection volume and decrease the detection limits was performed by applying Large-volume sample stacking with polarity switching. The limits of detection were between 0,006 and 0,014 μg/ml. The method was used to determine these compounds in methanolic extract of Orthosiphon stamineus leaves that contained 710,9 μg g-1 pulverized drug of rosmarinic acid and 38,2 μg g-1 of caffeic acid. About a 60- fold enhancement in senzitivity, relative to a conventional injection, was demonstrated in a real sample.
|
|
The Multi-Dimensional Knapsack Problem
Ficová, Pavla ; Kalčevová, Jana (advisor) ; Černohous, Roman (referee)
This work deals with multi-dimensional knapsack problem. Knapsack problem coincides with the category of integer linear programming. Thanks to the necessity of integer result it used to be more difficult to find the solution, by meeting all limitations. A lot of statisticians and mathematicians from all over the world are engaged in inventing an exact algorithm for calculation of these problems. As at now, there have been various accesses and heuristics concerning how to solve these problems or at least how to get as close to the optimal solution as possible. Problems with many variables are impossible to solve by hand calculations, the model is too complex and number of iterations is really high. Extensive exercises can be solved by advanced software in several minutes or longer. This work is trying to describe the problems, clear up and show practical application of knapsack problem in a real situation.
|
|
Solving of integer problems by dynamic programming
Polonyankina, Tatiana ; Kalčevová, Jana (advisor) ; Lagová, Milada (referee)
Optimalization problems with integer requirements on the variables occurs in real life very often. Unfortunately, finding optimal solutions to such problems are often numerically very difficukt. The work describes several possible algorithms for solving linear integer problems. The reader is also familiarized with the method of dynamic programming and the principle of optimality. This is demonstrated in a practical example of a knapsack model where the calculation is done using tables. The goal of this work is to apply the knowledge from the application of dynamic programming on a typical linear integer problems, namely on the problem of material separation, and thus show the algorithm of calculating integer problems. Finding the optimal integer solution is accomplished in two ways: by the classical method of spreadsheet tables and by the simplified method of using Lagrange multipliers. In the conclusion there are summarized the advantages and disadvantages of solving technic.
|
|
Optimization distribution and collection of infusion solutions
Kravciv, Zbyněk ; Fábry, Jan (advisor) ; Pelikán, Jan (referee)
There are many distribution tasks, that vary in a number of vehicles, time windows, dividend or undivided delivery or if it is static problems or dynamic problems. In this essay I focus just on few of them. At first I put my mind to simple statistic distribution task with one vehicle. Later I extend it with time windows, when the point can be served by one car and by many cars. In the essay it will be solved the real task of distribution and delivery transportation of infusion in the hospitals. Because of the difficulty of solution I have to use the heuristic methods - Method of nearest neighbour, Savings method and Insert method. All these methods are modified by capacity requirements, time windows and also observence of the rules, which the drivers have to keep during a distribution. The aim is to minimize the distance travelled by the vehicles. And at least the company could be recommended the best solution.
|
| |
|
Discrete Surface Fairing
Matýsková, Martina ; Kostková, Jana (advisor) ; Suk, Tomáš (referee)
This thesis proposes a new method for fairing of surfaces, which are represented by a triangulated mesh. Motivation for our task is a 3D reconstruction, which results in a triangulated mesh. Such mesh is typically corrupted by noise (due to data and processing inaccuracy), which is required to be faired out. We solve the problem on a discrete surface, where two criteria for optimization are defined: surface curvature and non-uniformity. The curvature deals with surface smoothness, while the non-uniformity with surface regularity. The problem of fairing is solved by a discrete diffusion. Since our aim is to fair surfaces with boundaries, first we describe the fairing of curves, then fairing of closed urfaces, and finally fairing of surfaces with boundary (which is in fact a combination of the former ones). We have tested the algorithm's performance on synthetic as well as real data with good results. The experiments showed that our proposed algorithm is robust, stable and does not shrink an object, while its main surface characteristics are preserved.
|
|
Special warehouse models of company Dencop Lighting
Gregůrek, Jakub ; Kořenář, Václav (advisor) ; Balner, Jan (referee)
The thesis is focused on finding optimal solution of stock company Dencop Lighting spol. s.r.o. At the very beginning of the thesis there is a brief characteristic of Dencop Lighting, their market aims and goals. After this view we are going to introduce you warehouse systems. There are analysis of products, their selection, flows and potentials for company. After completing product analysis we are going to focus on key factors of optimalization. There are mentioned many ways of optimalization with their advantages and disadvantages. Deterministic and stochastic methods are included as well. For better illusion in real live you can find added CD at the bottom of the thesis. Using guide of this software with detailed information about functions is in last pages of the thesis.
|
|
Route optimization for the parcels distribution
Ptáčková, Michaela ; Borovička, Adam (advisor) ; Čížek, Ondřej (referee)
This thesis deals with optimization problems of the parcels distribution. This issue can be solved on the ground of traveling salesman problem whose mathematical and economic model, including their modifications, are presented in the theoretical part of the thesis. We can solve these problems by using exact methods, heuristic and metaheuristic algorithms. In the theoretical part are described traveling salesman problem, traveling salesman problem with time windows, traveling salesman problem with multiple time windows and dynamic traveling salesman problem including possible ways of solution. In the practical part we can find application of problems on the real example, when we are finding the shortest possible route for the PPL's employee under different assumptions. The solution is obtained by using solver Gurobi within the modelling system MPL for Windows. In conclusion of the thesis the results are summarized and models are compared with each other.
|
|
Optimization model of production in food industry
Blachová, Katrin ; Pelikán, Jan (advisor) ; Fábry, Jan (referee)
The thesis deals with planning and scheduling of production in the food industry. The theoretical part is concerned with the formulation and structure of the task scheduling and analyses the flow shop in the detail, for which a real application for an unnamed company has been created. It also briefly describes the technical specifications of production, which are crucial for the practical part. The practical part deals with the formulation of a mathematical model. The optimal solution is obtained using the optimization program MPL for Windows. Mathematical model includes variables that solves serial and parallel processors and try to capture as most exact as possible manufacturing processes with the technical specifications for a particular enterprise. The criterion for optimization is to minimize the cost in terms of the selected technology of production.
|
|
Decision of a Steel Company Trading with Emissions
Zapletal, F. ; Šmíd, Martin
We formulate a Mean-CVaR decision problem of a production company obliged to cover its CO2 emissions by allowances. Certain amount of the allowances is given to the company for free, the missing/redundant ones have to be bought/sold on a market. To manage their risk, the company can use derivatives on emissions allowances (in particular futures and options), in addition to spot values of allowances. We solve the decision problem for the case of an real-life Czech steel company for different levels of risk aversion and different scenarios of the demand. We show that the necessity of emissions trading generally, and the risk caused by the trading in particular, can influence the production significantly even when the risk is decreased by means of derivatives. The results of the study show that even for low levels of the risk aversion, futures on allowances are optimal to use in order to reduce the risk caused by the emissions trading.
|
guest ::
