5,203 research outputs found
Neúplné vyhledávací algoritmy
No full textNázev práce: Neúplné vyhledávací algoritmy Autor: Jakub Lehotský Katedra: Katedra teoretické informatiky a matematické logiky Vedoucí diplomové práce: Doc. RNDr. Roman Barták, Ph.D. e-mail vedoucího: [email protected] Abstrakt:Problémy s omezujícími podmínkami jsou množinou diskrétních optimalizačních problémů, které řeší mnoho problémů ze skutečného života. Jsou řešeny inferenčními a vyhledávacími algoritmy. Ve většině případů úplné vyhledávací algoritmy dokážou najít řešení, existují ale problémy, kterých zložitost je příliš vysoká na to, aby byl prostor řešení prozkoumán kompletně. V týchto případech musíme zavést omezení, které ořežou velikost stavového prostoru pro vyhledávání. Algoritmy založené na diskrepancích omezují počet případů, kde se algoritmus rozhodne proti dané heuristice. Neúplné vyhledávací algoritmy negarantují nalezení řešení. Mnoho vyhledávacích algoritmů má vlastnost any-time, která nám poskytuje nějaké řešení optimalizačního problému v libovlný časový okamih, i když řešení ještě není optimální. Klíčová slova: CSP, neúplné vyhledávání, vyhledávání s diskrep- ancemi 1Title:Incomplete Search Techniques Author: Jakub Lehotský Department: Department of Theoretical Computer Science and Mathematical Logic Supervisor: Doc. RNDr. Roman Barták, Ph.D. Supervisor's email address: [email protected] Abstract:The constraint satisfaction problems is set of discrete combinatorial problems which address to solve many of the real life problems. They are commonly solved by inference and search algorithms. In most cases the complete search algorithm can find a solution to a problem, but in many cases, search space is too large to be explored completely. In these case the limitation of search space is necessary in a way which gives us some way to still find a solution without having to search whole search space. Discrepancy-based search algorithms limit the search space by limiting the number where search decisions go against the heuristic in given search. Incomplete algorithms don't guarantee finding a solution. Many incomplete algorithms have any-time property useful in optimization problems, where algorithm provides some solution at any time even if it is not an optimal one. Keywords: CSP, incomplete search, discrepancy search 1Department of Theoretical Computer Science and Mathematical LogicKatedra teoretické informatiky a matematické logikyFaculty of Mathematics and PhysicsMatematicko-fyzikální fakult
Poker and Probability
Get PDFTitle: Poker and Probability Author: Roman Jelínek Department: Department of Mathematics Education Supervisor: RNDr. Jakub Staněk, Ph.D., Department of Mathematics Education Abstract: The aim of this Bachelor thesis is to create a historical introduction to the exciting card game and especially proximity of its mathematical aspects to the general public. The work consists of didactic way with many comments to the theory. The text is worded in a way that most people understand the situations, which are described without mathematical basics. For this reason there are no complicated formulas written and used are thoroughly described. The work focuses mainly on amateur poker players, but also on people, who knows anything about this card game. Keywords: history of poker, poker rules, poker hands, the probability of winnin
HexMage - Encounter Balancing in Hex Arena
No full textTitle: HexMage - Encounter Balancing in Hex Arena Author: Jakub Arnold Department: Department of Software and Computer Science Education Supervisor: Mgr. Jakub Gemrot, Department of Software and Computer Science Education Abstract: Procedural content generation (PCG) is mostly examined in the con- text of map/environment creation, rather than generating the actual game char- acters. The goal of this thesis is to design a turn-based RPG-like game with perfect information for which we can generate balanced encounters. The game consists of a hex-based arena in which two teams fight. Each team consists of a few player controller characters with unique abilities. We generate the attributes of these abilities in order to make the encounter balanced. We will also build an AI that can be used to automatically play-test the PCG algorithm. The goal is to generate an equally strong, but different opponent. Keywords: video games encounter balancing hex arena rpg elements
Degree of excerise specificity in winter preparation period in football.
Get PDFBibliographical identification Title of Bachelor work: Degree of excerise specificity in winter preparation period in football Place of work: UK FTVS Author: Jakub Šlitr Field of study: Physical education and sport Head of work: Mgr. Jakub Kokštejn Defence year: 2012 Generalization: In this work we will try to determine the specificity of peace exercise in the winter pre-season football. The aim is to analyze pre-winter season in football in terms of degree of specificity in the development of fitness abilities. The data collection method to use direct observation, as when the player is attending the winter pre-season and each training unit to record a pre-prepared sheet. Statistical relative expression level of specificity of training in preparation discover whether the conditional ability to develop more specific or nonspecific manner at the regional championship adult football players. Key words: fitness, specificity excerise, the preparatory period, training gam
L'Œuvre de Felix Jenewein de Jakub Deml : une interprétation poétique
No full textDílo Felixe Jeneweina od Jakuba Demla : poetická interpretace
Dílo malíře Felixe Jeneweina přitahovalo pozornost a budilo obdiv mladé generace intelektuálů, sdružených kolem Katolické moderny. V letech 1903-1905 do jejího časopisu Nový život přispíval i mladý kněz-básník Jakub Demi. Jeho kniha Dílo Felixe Jeneweina, napsaná v letech 1927-28 a zveřejněná v roce 1929, patří к nejdůležitějším literárním výkladům výtvarného díla, které kdy byly v Čechách napsány. V zájmu pochopení tohoto textu je nejprve třeba vysledovat jeho genezi a analyzovat tématický a stylistický vztah, který se vytvářel mezi výtvarným dílem Jeneweinovým a Demlovým psaným projevem (zvláště okolo motivu tance smrti). Tato publikace poukazuje na souzvuk výtvarných a literárních děl, vzešlých z křesťanství a z existenciálních pocitů moderní doby.The Work of Felix Jenewein by Jakub Deml : A Poetic Interpretation
In the 1890s, the painter Felix Jenewein attracted the admiration of the young intellectuals who had founded the Modem Catholic Group (Katolická moderna) and the review New Life [Nový život] (to which the young priest and poet Jakub Deml contributed in the years 1903-1905). Written from 1927 to 1928, and published in 1929, The Work of Felix Jenewein by Deml features among the most important literary exegeses on art works ever written in Bohemia. In order to understand why, it is necessary to go back to the origins of the work and to analyze the thematic and stylistic relationships woven between Jenewein's pictorial art and Demi's writing, in particular around the motif of the danse macabre. This publication illustrates the connection between Christian pictorial and literary works and the existential feeling of the modem era.Musil Roman, Galmiche Xavier. L'Œuvre de Felix Jenewein de Jakub Deml : une interprétation poétique. In: Revue des études slaves, tome 74, fascicule 1, 2002. pp. 77-87
HexMage - Balancování setkání v hexové aréně
Get PDFNázev práce: HexMage - Balancování setkání v hexové aréně Autor: Jakub Arnold Katedra: Katedra softwaru a výuky informatiky Vedoucí bakalářské práce: Mgr. Jakub Gemrot, Katedra softwaru a výuky infor- matiky Abstrakt: Procedurální generování obsahu (PCG - procedural content genera- tion) je zejména prozkoumáváno v kontextu vytváření herních map, nikoliv však pro účely generování herních postav. Cílem této práce je navrhnout tahovou hru s RPG prvky s úplnou informací, na které implementujeme algoritmus pro balancování setkání. Hra probíhá v hexové aréně, v níž bojují dva týmy proti sobě. Každý tým je složen z několika hráčem ovládaných postav s různými schop- nostmi. Naším cílem je generovat atributy těchto schopností, abychom docílili vyváženého souboje. Dalším cílem je také naprogramovat umělou inteligenci, která bude použita pro automatické testování PCG algoritmu. Cílem je, aby vygenerovaný nepřítel byl stejně silný jako hráč, ale dostatečně odlišný. Klíčová slova: počítačové hry, balancování soubojů, hexová aréna, rpg prvky 1Title: HexMage - Encounter Balancing in Hex Arena Author: Jakub Arnold Department: Department of Software and Computer Science Education Supervisor: Mgr. Jakub Gemrot, Department of Software and Computer Science Education Abstract: Procedural content generation (PCG) is mostly examined in the con- text of map/environment creation, rather than generating the actual game char- acters. The goal of this thesis is to design a turn-based RPG-like game with perfect information for which we can generate balanced encounters. The game consists of a hex-based arena in which two teams fight. Each team consists of a few player controller characters with unique abilities. We generate the attributes of these abilities in order to make the encounter balanced. We will also build an AI that can be used to automatically play-test the PCG algorithm. The goal is to generate an equally strong, but different opponent. Keywords: video games encounter balancing hex arena rpg elements 1Department of Software and Computer Science EducationKatedra softwaru a výuky informatikyMatematicko-fyzikální fakultaFaculty of Mathematics and Physic
Dva eseje o cílování inflace
Get PDFTitle: Two Essays on Inflation Targeting Author: Mgr. Jakub Matějů Department: Institute of Economic Studies Supervisor: Roman Horváth, PhD. Abstract: The thesis consists of two essays on inflation targeting. The first essay examines how do monetary authorities set their inflation targets. Survey of central banks' communication regarding the target is presented, theoretical model is developed and finally empirical analysis is conducted on a panel of inflation targeting countries. This pioneering analysis of the topic leads us to conclusion that inflation targets are influenced by more variables than central banks admit. In addition to past and foreign inflation, inflation variability and GDP growth we find significant impact of central bank credibility and other institutional factors. The short second essay surveys literature assessing performance of inflation targeting and outlines perspectives of inflation targeting as a monetary policy framework. The conclusion is that if inflation targeting central banks stick to their best practice in transparency and communication and remain open to innovations, inflation targeting will have a good chance to score well even in the periods of turmoil.Název práce: Dva eseje o cílování inflace Autor: Mgr. Jakub Matějů Katedra (ústav): Institut ekonomických studií Vedoucí bakalářské práce: Roman Horváth, PhD. Abstrakt: Práce sestává ze dvou esejů o cílování inflace. První esej zkoumá, jak centrální banky a vlády určují své inflační cíle. Prezentován je přehled komunikace centrálních bank ohledně inflačních cílů, dále je zkoustruován teoretický model a nakonec je provedena panelová empirická analýza zemí cílujích inflaci. Tato první analýza daného problému vede k závěru, ze inflační cíle jsou ovlivněny více proměnnými nez centrální banky přiznávají. Kromě vlivu minulé a zahraniční inflace, variability inflace a růstu HDP nacházíme signifikantní vliv kredibility centrální banky a dalsích institucionálních faktorů. Krátký druhý esej se zabývá perspektivami cílování inflace jako rámce pro měnovou politiku a zároveň je přehledem dosavadní literatury hodnotící cílování inflace. Závěrem je, ze pokud budou centrální banky cílující inflaci pokračovat v důrazu na transparentnost a komunikaci a zároveň zůstanou otevřeny inovacím, cílování inflace má vysoké sance uspět i v období krize.Institut ekonomických studiíInstitute of Economic StudiesFaculty of Social SciencesFakulta sociálních vě
Incomplete Search Techniques
No full textTitle:Incomplete Search Techniques Author: Jakub Lehotský Department: Department of Theoretical Computer Science and Mathematical Logic Supervisor: Doc. RNDr. Roman Barták, Ph.D. Supervisor's email address: [email protected] Abstract:The constraint satisfaction problems is set of discrete combinatorial problems which address to solve many of the real life problems. They are commonly solved by inference and search algorithms. In most cases the complete search algorithm can find a solution to a problem, but in many cases, search space is too large to be explored completely. In these case the limitation of search space is necessary in a way which gives us some way to still find a solution without having to search whole search space. Discrepancy-based search algorithms limit the search space by limiting the number where search decisions go against the heuristic in given search. Incomplete algorithms don't guarantee finding a solution. Many incomplete algorithms have any-time property useful in optimization problems, where algorithm provides some solution at any time even if it is not an optimal one. Keywords: CSP, incomplete search, discrepancy search
Two Essays on Inflation Targeting
No full textTitle: Two Essays on Inflation Targeting Author: Mgr. Jakub Matějů Department: Institute of Economic Studies Supervisor: Roman Horváth, PhD. Abstract: The thesis consists of two essays on inflation targeting. The first essay examines how do monetary authorities set their inflation targets. Survey of central banks' communication regarding the target is presented, theoretical model is developed and finally empirical analysis is conducted on a panel of inflation targeting countries. This pioneering analysis of the topic leads us to conclusion that inflation targets are influenced by more variables than central banks admit. In addition to past and foreign inflation, inflation variability and GDP growth we find significant impact of central bank credibility and other institutional factors. The short second essay surveys literature assessing performance of inflation targeting and outlines perspectives of inflation targeting as a monetary policy framework. The conclusion is that if inflation targeting central banks stick to their best practice in transparency and communication and remain open to innovations, inflation targeting will have a good chance to score well even in the periods of turmoil
USER HABITS METAMPHETAMINE USERS
No full text1 Univerzita Karlova v Praze 1. lékařská fakulta Studijní program: Specializace ve zdravotnictví Studijní obor: Adiktologie ID studijního oboru: B5345 Jan Plaček Uživatelské zvyklosti uživatele pervitinu User habits of methamphetamine addicts Bakalářská práce Vedoucí závěrečné práce: MUDr. Jakub Minařík Praha 2016 2 Summary The author sets "to map user's habits (frequency and dose) of methamphetamine users, including such addictive substances combined with the primary addictive substance" as aim of this work. The work is divided into two parts - theoretical (Chapter 1) and practical (Chapter 3 - 6). The theoretical part explores methamphetamine - what is it, history, effects, number of users. The second part consists of interviews with eight users of methamphetamine. The author demonstrates common habits of methamphetamine users. It is very difficult, because there are many factors affecting frequency and dose of users. Many of that factors are not entirely predictable. Keywords methamphetamine, drug, dose, frequency, combinatio
- …
