Social networks are the current phenomenon, and their integration begins to gain importance. Basic idea is to pair identical pieces of information stored in various social networks and to detect inconsistencies between them. The most important data that need to be integrated are user profi les and lists of contacts. In our work, we propose the integration of both the pro files and lists of contacts, and even groups of users that could be created in social networks. Implementation is not part of the work. However the proposal suggests the creation of Main social network in form of a web application, that brokers the integration to end users. From the perspective of users it is bene cial to display data from all social networks in one place and automate detection of di erences. User's data could be used for commercial purposes, of course, within legal limits. From this perspective, the biggest contribution of Main social network is a social graph. It consists of various social graphs of social networks. Additionally it would contain information about membership of users in social networks. The proposal consists of three main parts: main processes of the Main social network, its data model and means of gathering information from different networks. The design of data model was partially inspired by existing...

The main goal of this work was to create an XSLT Benchmark, to compare available XSLT processors. At first, we determined main criteria of XSLT processors (price, correctness, speed, memory usage, support, OS and UX), which we discussed. Next, we summarized existing XSLT processors, described individual types of processors (program, library and browser) and measured criteria price, support, OS} and UX. We had to create appropriate test environment to measure criteria correctness, speed and memory usage. Created program XSLT Benchmarking is one of the main benefits of this work. The program also includes tests. We created tests based on 5787 downloaded XSLT files. Tests were created based on the analysis of these files. Firstly, we researched common features of XSLT files (used elements, used XSLT versions, output format etc.). Secondly, we researched focuses of their usages. Next big benefit of this work is a summary of results of tests from different views. We discussed other criteria and features of tested processors. Finally, we summarized possible extensions of our program and also of our analysis.

Nowadays, arsenic is becoming an important pollutant in the environment. Chronic exposure to arsenic can cause number of serious diseases. Therefore, a development of analytical methods for trace and ultratrace speciation analysis- analysis of individual forms or phases in which As is found in the sample - is fully in place. This Thesis compares four methods of trace speciation analysis, with focus on limits of detection and quantification, and on comparison of results of analysis of river and sea water reference materials. Methods based on hydride generation with preconcentration by cryotrapping and AAS or ICP-MS detection, with limits of detection in ng or tenths of ng·dm-3 , are compared with procedures employing HPLC, with ICP-MS detection. The Thesis includes development and optimization of a pre-reduction step of postcolumn hydride generation with on-line pre-reduction of pentavalent arsenic species, in order to improve sensitivity of this method. Limits of detection around 10 ng·dm-3 are achieved. The results of analyses obtained by individual methods are in excellent agreement. Keywords: Arsenic, speciation analysis, hydride generation, atomic absorption spectrometry, inductively coupled plasma- mass spectrometry, high efficiency liquid chromatography, limits of detection.

The goal of this work is to create a generator that provides a corpora of input episodes in the specified format, which can be used as an input to test episodic memory models. More specifically, the methods used should ensure the scope to be in years up to a possible lifetime of a typical human agent. It also attempts to verify this on an actual episodic memory model, and test if the generated data has high enough quality to be used for testing psychological paradigms on memory models.

This thesis proposes a novel method for procedural generation of urban street networks. A simple traffic simulation, based on observations made about the social-geographic nature of cities, that is able to drive the temporal evolution of city road networks by creating new major roads, as well as a modified generation algorithm for minor roads, are described. The presented method is highly automated.

This thesis deals with generation of realistic tree models. Implemented algorithm has many variable parameters, which allow generating large amount of species of broad-leaved trees. Generated models are also quite realistic looking.

This thesis develops high-performance liquid chromatography-inductively coupled plasma mass spectrometry (HPLC-HG-ICP-MS) method used for the analysis of glutathione arsenic complexes in biological samples. The aim of the thesis was to verify the suitability of this methods and to perform pilot studies on analysis of the enzymatic methylation assay containing glutathione and urine. Inclusion of post-column hydride generation step resolves the problem of changing sensitivity of ICP-MS with gradient elution. Using the standards of glutathione complexes, it was verified that the HPLC-HG-ICP-MS method can provide both qualitative and quantitative analysis of these complexes. The limit of detection was found at 5 pg/ml. Analysis of the methylation assay of arsenic with glutathione showed that only DMAsGS complex occurs in the assay during methylation. It was verified that the presence of the enzyme is required for the complex formation. In the samples of urine from unexposed people analyzed by HPLC- HG-ICP-MS and hydride generation-cryotrapping-inductively coupled plasma mass spectrometry (HG-CT-ICP-MS), only the presence of free pentavalent arsenic species was found, whereas neither glutathione complexes nor trivalent species could be observed.

The thesis describes the creation of a system for generating insurance invoices sent through billing to individual clients of company Allrisk, a.s. The theoretical part of the document introduces the current concept of the company’s information system and a related existing application. This part of the thesis includes the reasons for creation, used principles and technology selection for the mentioned application. The practical part is about the application design and implementation. The thesis also includes discussion about testing, evaluation of results, management of anticipated risks and potential extensions.

This paper broods over a subject of automated generation of game levels in the Unity engine, namely the generation of mazes and generation of environment using L-systems. It also describes some of the major components and principles of the Unity engine. On the basis of these data have been created and described two automated generators of game levels as well as a 3D computer game that uses these generators.

1 Maxim Gumin's Wave Function Collapse (WFC) algorithm is an example-driven image generation algorithm emerging from the craft of procedural content generation. The intended use of the algorithm is to generate new images in the style of given examples by ensuring local similarity. Our work aims to generalize the original work to make the algorithm applicable in other domains. Furthermore, we aim to apply it in a more difficult task of village generation in the 3D sandbox video game Minecraft. We will create a generic WFC library and a Minecraft mod, which will allow for structure generation using WFC. We hope that our WFC library will be beneficial to anyone exploring WFC and its applications in the Kotlin language and that our Minecraft showcase reveals some of the benefits and limits of the algorithm in complex problems.