Orientador: Francisco Foot Hardman / Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Estudos da Linguagem / Made available in DSpace on 2018-08-03T23:12:28Z (GMT). No. of bitstreams: 1 Gomide_Bruno_D.pdf: 6773198 bytes, checksum: 582cba31ba64de34f7288c6bfe0573d8 (MD5) Previous issue date: 2004 / Doutorado

The aim of this diploma thesis is to find suitable regression models between the chosen statistical data of transport and GDP per capita and determine whether these models are statistically significant. The first part is a theoretical introduction to the problems of transport in terms of economics, as well as a description of methods of regression analysis, which is used in the practical part. The practical part draws data from Eurostat's website that provide for this thesis sufficient statistical basis. The data are graphically processed as scatter charts, based on these are determined mathematical equation of regression. The choice of suitable regression analysis is based on coefficient of determination and significance level is alpha = 0,05.

Social networks - a description of principles and theoretical background, dynamics and possibilities of their use, particularly in management and marketing; methods for detection of social networks and work with them, the available software tools, the practical application of theoretical knowledge - analysis of specific data structures and social networks subsequent processing with regard to potential applications in management

Diploma thesis describes basics terms of data visualization elements in the theoretical part. There are the following main topics covered -- importance of data visualization in business management, description and application of main chart types, design and usage of complex visualizations (dashboards), key features of modern data visualization technology. Theoretical grounds are then applied on real examples from different companies in order to show how managers can benefit from good data visualization techniques. Examples from significantly different areas were chosen -- financial management, operations management, analysis of process efficiency.

Eulerian graphs have a closed walk traversing each edge exactly once. Finding such a walk is a basic arc routing problem based on a road network. Most of the problems with applications in operational research are NP-hard. We describe a formal model of a road network and vehicle routes and formulate several arc routing problems motivated by winter road maintenance in the Czech Republic. The main part is focused on single vehicle routing problems on trees. We propose a new unfairness minimization problem for finding a vehicle route with properties that lead to a minimal number of resident complaints against unfair maintenance. Residents feel like they are skipped when the vehicle route has multiple trips and passes nearby without providing maintenance to their street. By reduction of the necklace splitting problem to the unfairness minimization problem we prove it is PPA-complete. Further, we define a restricted arc routing problem on trees which formalize condi- tions given by Czech legislation. We proved the existence of a polynomial algorithm for deciding whether a single vehicle route exists when there is a single priority for roads. If multiple priorities are used, we express conditions and conjectures when the problem has polynomial complexity. Finally, a utilization of the model is illustrated by an...

The diploma thesis submitted solves problems of optimization of goods expedition from rack system of a logistic store. It concerns solution of a practical task which optimizes a passage route through the rack system and evaluates individual orders for creation of optimal expedition dispatching batch. The existing dispatching system, use of sources and creation of time schedule is being described at the beginning. Description of general practical solutions of seeking the shortest way through the graph through appointed nodes follows. Chosen solution and its practical implementation are introduced afterwards. Comparative tests with existing system and their evaluations are mentioned at the end of the thesis.

This master's thesis deals with implementation of a system for creating general image operations using an image processing chain. The text introduces the concept of image processing using chains and shows its advantages and possibilities. Furthermore, the text focuses on the detailed design of a system based on that concept. The system was successfully implemented and tested, while the results were described and discussed. Finally, the system is shown in a practical application of several image processing tasks.

The Moran process is a model for simulating evolutionary dynamics. In that model, one mutant with higher fitness is introduced to a structured population. Evolution is simulated in rounds. In one round, individual is selected proportio- nally to its fitness and spreads to the place of a random neighbour. In this thesis, we motivate the Moran process, present basic results, and define our variant. We work in a vertex dependent model; every individual has fitness according to its type and occupied vertex. In the vertex dependent model we prove two theorems about the number of steps the process has to make to get to the stable state. We show that on the complete graph, the process takes only polynomially many steps and we find a graph where the process take exponentially many steps, but in the normal settings the number of steps is the same as on the complete graph. 1

In this thesis we will focus on a problem of length bounded cut, also known as L-bounded cut. We are going to show a combinatorial algorithm for finding a minimal L-bounded cut on graphs with bounded treewidth based on dynamic programming. Then we going to show that this algorithm can also be used for finding minimal L-bounded cut on plannar graphs. We are also going to look at problem of (dG(s, t) + 1)-bounded cut. This problem is known to be NP-hard for general graphs. But it is an open problem whether this problem is also NP-hard on plannar graphs with special vertices on the outer face. We will try to outline a way, which might lead to showing that this problem is solvable in a polynomial time.

In this thesis, available tools for call graph generation, processing and visualization are analyzed. Based on this analysis, a call-graph processing tool is designed. The tool is then implemented and tested on call graphs generated from various real-world programs, including the Linux Kernel.