The goal of this diploma thesis was to create four laboratory exercises for the subject "Parallel Data Processing", where students will try on the options and capabilities of Apache Spark as a parallel computing platform. The work also includes basic setup and use of Apache Kafka technology and NoSQL Apache Cassandra database. The other two lab assignments focus on working with a Travelling Salesman Problem. The first lab was designed to demonstrate the difficulty of a task where the student will face an exponential increase in complexity. The second task consists of an optimization algorithm to solve the problem in cluster. This algorithm is subjected to performance measurements in clusters. The conclusion of the thesis contains recommendations for optimization as well as comparison of running with different number of computing devices.

This thesis deals with the Travelling salesman problem with time windows. The problem is that the travelling salesman must pass through each defined location exactly once and finally return to the original place for the lowest possible price. The time windows in this problem are that each place can only be visited in a given time range, or it can happen that in a certain period of time there will be no path between some places. The thesis deals with an overview of this problem and problems similar to it. It also deals with the description of various methods by which this problem can be solved. As part of this thesis, an application in the Python programming language was also created, which is used to test selected methods for finding solutions. Finally, the given experiments are evaluated and the effectiveness of the given strategies is compared.

The diploma thesis focuses on the use of genetic algorithms for tasks related to the travelling salesman problem. Based on theoretical knowledge and problem analysis a proposal of the solution is provided. This creates a daily route plan for service technicians with regard to constraints. The case study shows that the proposed solution in comparison with manual scheduling by experience enables to reduce transportation costs.

This work deals with traveling salesman problem (TSP) and examines it’s possibilities to use in business. It is about the optimization of the travel cost, saving time and unnecessary mileage. Part of the work is a program with a GUI written in program MATLAB. Program uses neural networks to calculate the most effective path between places, where the trader has to reach. It’s possible to use the algorithm for many purposes, e.g. distribution of goods, store management, planning of PCBs or rescue services. Program communicates with the Google Maps API server, which provides the actual information of the path.

This study is an archetypal literary analysis of Arthur Miller’s play Death of a Salesman and Homer’s The Odyssey. The analysis aims to demonstrate how Arthur Miller’s protagonist, Willy Loman, in Death of a Salesman demonstrates several stages of Carl Gustav Jung’s theory of the individuation process, similar to Odysseus in Homer’s The Odyssey. This is done by identifying set archetypes and stages of Jung’s individuation process, the persona, the shadow, the anima, and the self. After that, the stages are applied to both Miller’s play and Homer’s epic poem. The analysis shows that both protagonists demonstrate and complete Jung’s individuation process. Willy Loman completes a symbolic journey, whereas Odysseus completes a physical one.

The diploma thesis examines a drama translation and its changes for staging purposes. The thesis strives for interdisciplinarity, for it enriches the theoretical-analytical approaches of translation studies with practical dramaturgy insights of the creators of the stagings. The thesis analyses Arthur Miller's play Death of a Salesman (1949) as translated by Luba and Rudolf Pellar (1962). Their literary translation is subjected to a translation analysis under Peter Newmark's model of analysing a translation (1988). Subsequently, the thesis examines the types and the extent of the changes in the scripts for stagings used in the Czech National Theatre in 1993-1996, and in the current staging in the Municipal Theatres of Prague (premiere in 2019) while employing their comparison with the Pellars' published translation. Key words: translation studies, translation of drama, Death of a Salesman, Arthur Miller, Luba and Rudolf Pellar, staging, dramaturgy

<p> In this thesis, we investigate and characterize policies for task allocation to teams of agents in settings with heterogeneity and risk. We first consider a scenario consisting of a set of heterogeneous mobile agents located at a base (or depot), and a set of tasks dispersed over a geographic area. The agents are partitioned into different types. The tasks are partitioned into specialized tasks that can only be done by agents of a certain type, and generic tasks that can be done by any agent. The distances between every pair of tasks are specified and satisfy the triangle inequality. Given this scenario, we address the problem of allocating these tasks among the available agents (subject to type compatibility constraints) while minimizing the maximum travel cost for any agent. We first look at the Heterogeneous Agent Cycle Problem (HACP) where agents start at a common base (or depot) and need to tour the set of tasks allocated to them before returning to the base. This problem is NP-hard, and we provide a 5-approximation algorithm. We then consider the Heterogeneous Agent Path Problem (HAPP) where agents can start from arbitrary locations and are not constrained to return to their start location. We consider two approaches to solve HAPP and provide a 15-approximation algorithm for HAPP.</p> <p> We then look at the effect of risk on path planning by considering a scenario where a mobile agent is required to collect measurements from a geographically dispersed set of sensors and return them to a base. The agent faces a risk of destruction while traversing the environment to reach the sensors and gets the reward for gathering a sensor measurement only if it successfully returns to base. We call this the Single Agent Risk Aware Task Execution (SARATE) problem. We characterize several properties of the optimal policy for the agent. We provide the optimal policy when the risk of destruction is sufficiently high and evaluate several heuristic policies via simulation. We then extend the analysis to multiple heterogeneous agents. We show that the scoring scheme is submodular when the risk is sufficiently high, and the greedy algorithm gives solutions that provide a utility that is guaranteed to be within 50% of the optimal utility. </p>

This thesis consists of a critical introduction followed by a novel told in twentyfive chapters. The novel begins in the first person with the eighteen-year-old protagonist Kirtland Grant beginning a summer job as a door-to-door pest control salesman in Florida. Trained using Mormon missionary techniques, his office of relocated Utah boys, all of them Mormon, dodge angry homeowners and evade police in gated communities while insects root the brand-new houses from below and corrupt banking pushes the region toward collapse. With his departure date for a two-year Mormon mission looming at summer’s end, Kirt delves into Mormon doctrine and attempts to solidify his spiritual faith through a salesman’s experiment in finding God. As Kirt redoubles his efforts in faith and in sales in order to earn enough money to fund his mission, he finds himself in ethically dubious positions and comes to understand the questionable practices of the company for whom he has been selling. He simultaneously struggles to comprehend his own sexuality, and a sexual run-in with a young woman, which Kirt interprets as serious sin, triggers additional trauma and spiritual flailing. God does not commune with Kirt in any way Kirt can comprehend, and as the novel ends he is beaten, alone, but nevertheless, alive. Perhaps most critically, he has effectively quit his position in the pest control company and made a failed attempt at reconnecting with the young woman. The novel is an embodiment of the nature of belief, and examines our reliance on each other’s faith to prop up our own, whether it be faith in housing markets, pest control products, or God.

No description available.

京都大学 / 0048 / 新制・課程博士 / 博士(情報学) / 甲第18621号 / 情博第545号 / 新制||情||96(附属図書館) / 31521 / 京都大学大学院情報学研究科数理工学専攻 / (主査)教授 永持 仁, 教授 太田 快人, 教授 髙橋 豊 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM