Polycyclic aromatic hydrocarbons (PAHs) are produced via the incomplete combustion of organic matter. They are ubiquitously present in the environment, and human exposures typically involve complex PAH mixtures in complex matrices (e.g., soil, urban air). Many PAHs are genotoxic carcinogens; exposures can augment cancer risk and reliable risk assessment of PAH mixtures is a regulatory concern. There is a paucity of in vivo genotoxicity information for most PAHs and PAH mixtures. Risk assessment of PAH mixtures assumes dose addition (i.e., additive, incremental contributions from each PAH); however, there is a lack of evidence to support this assumption. This thesis assessed the in vivo genotoxicity of 9 PAHs and 6 PAH mixtures following sub-chronic oral exposure of transgenic Muta™Mouse (i.e., adduct and lacZ mutant frequency across 5 tissues). The results revealed that PAHs and PAH mixtures induce significant levels of genetic damage; the mixtures induced very high levels of damage and mutations. Differences in the nature and magnitude of the effects in individual tissues appear to be related to the processes that govern PAH metabolism and the processing of genetic damage (e.g., repair and translesion synthesis). Scrutiny of the dose addition assumption revealed more-than-additive effects in tissues proximal to the exposure route (i.e., intestine, liver), but less-than-additive effects in distal tissues (i.e., bone marrow); however, discrepancies between the experimentally-observed and predicted responses were typically small (i.e., within 5-fold). Comparisons of cross-tissue patterns in adduct and mutant frequencies revealed that the frequency of the former is generally inversely related to that of the latter. This appears to be related to the experimental design, and the influence of repair and replication on adduct and mutant frequency. The BMD approach was employed to estimate genotoxic (i.e., adduct) potency and mutagenic (i.e., lacZ mutant) potency for all agent-tissue combinations. The results demonstrate that the mutagenic potency of PAHs and PAH mixtures is empirically related to genotoxic potency; moreover, that there is cross-tissue and cross-compound congruence in the processing of PAH-induced damage. The results obtained significantly advance existing knowledge regarding the genotoxic hazards of PAHs and PAH mixtures; moreover, the empirical relationships between genetic toxicity endpoints.

The goal of the thesis is to examine and assess actual portfolio of products on the market for server visualization and to compare performance of individual products with performance of the physical machine. The research and the assessment of the actual portfolio will be carried out with the focus on current trends in the area of server virtualization, reasons for realization, and important aspects for their successful implementation. The comparison will be carried out in areas of supported platforms, hardware emulation spectra, hardware limitations, licensing and prices. Further it will be performed comparison in the form of benchmark performance in areas of CPU, RAM, hard-drive throughput, and network throughput of most commonly used products for server virtualization.

This thesis deals with NoSQL database performance issue. The aim of the paper is to compare most common prototypes of distributed database systems with emphasis on performance and scalability. Yahoo! Cloud Serving Benchmark (YCSB) is used to accomplish the aforementioned aim. The YCSB tool allows performance testing through performance indicators like throughput or response time. It is followed by a thorough explanation of how to work with this tool, which gives readers an opportunity to test performance or do a performance comparison of other distributed database systems than of those described in this thesis. It also helps readers to be able to create testing environment and apply the testing method which has been listed in this thesis should they need it. This paper can be used as a help when making an arduous choice for a specific system from a wide variety of NoSQL database systems for intended solution.

The goal of the master thesis is to analyze portfolio performance. The theoretical part of the thesis describes risk, portfolio performance measurement, investment funds, theory of portfolio. The analysis of portfolio performance is measured by different portfolio measurement tools.

Simulation of viscoelastic fluid flows in complex geometry at high Weissenburg (Wi) number is still a challenging problem in computational rheology. In this thesis, parallel computing toolbox available in OpenFOAM has been analysed in details. The scalability of parallel viscoelastic flow solver has been critically evaluated under benchmark flow problems, including 2D and 3D 4:1 contraction flow, 2D flow past a cylinder with 50% blockage, using up to 4096 CPU cores and 55 million computational grids. Areas for further improvements in parallel computational rheology are discussed. A new monitoring and preserving molecular conformation method is proposed to overcome the unphysical artefact problem in simulation of the FENE-CD-JS model under benchmark flow problems. It greatly enhances the stability of parallel viscoelastic flow solver in simulation of high Wi number flows and, for the first time, successfully captures elastic turbulence in flow past a cylinder problem. A new constitutive model, named as FENE-CD2-JS model, is proposed to overcome the existing shortcomings of the original FENE dumbbell model. The model accounts for high order interactions between non-equilibrium polymer chain molecules and could reproduce the asymmetric oscillatory vortex dynamics in the 16:1 contraction flow geometry at high Wi number (up to 48) flow observed in the experiments. For the first time, the analysis of the spatial distribution of non-equilibrium polymer conformation, through the conformational tensor, in strong complex flow and the results of their power-law scaling are also presented.

Arbetet jämför fyra olika NoSQL-databaser med fokus på tidseffektivitet. De fyra databaserna är MongoDB, RavenDB, ArangoDB och Couchbase. Studien består av en benchmark för att mäta tidseffektiviteten av de fyra databaserna och en litteraturstudie av hur tidseffektiviteten påverkas av optimeringslösningar. Tillsammans bidrar dessa metoder till en slutsats från båda perspektiven då de kompletterar varandra och ger en grund för resultatets betydelse. Arbetets grund ligger i ett tidigare examensarbete som går ut på att jämföra en SQL-databas mot en NoSQL-databas med en benchmark. Resultatet av studien visar att för de flesta databaser så ökar söktiden för en query i korrelation med ökningen av query-komplexiteten, och att tidseffektiviteten mellan de olika databaserna varierar vid sökningar med hög komplexitet. Framtida arbeten som kan baseras på denna studie är att göra en liknande benchmark på ett dataset som är större eller att en annan typ av databas används.

When it comes to developing software, it is important to keep in mind a variety of factors. It is paramount that software is fast, responsive, optimized, and able to be stored and used by the end consumer. This is especially true within fields such as medical care or critical systems where the speed is critical to the end-user and where the memory and storage capacity may all be a limiting factor to the software. This paper evaluates the differences in performance between the Java programming language and the Kotlin programming language. This paper evaluates this by comparing performance by experiment, comparing metrics between the two and relevant literature review about the subject. The results show an overall better performance of Java in most occasions, with Kotlin managing to perform better in much fewer benchmarks. These differences are mostly not very significant, however there are exceptions where Kotlin is performing considerably worse. That happens particularly when a lot of the Kotlin idiomatic features are implemented, which add a big overhead and if performance is a big concern, they should be used sparingly.

This paper will explore the speed of execution, memory foot-print and the maturity of WebAssembly Runtimes (WasmRT).For this study, the WasmRT will be Wasmer1and Wasmtime.2Initially, benchmarks were run on a Raspberry Pi 3 model Bto simulate a more hardware capable IoT-device. Tests per-formed on a Raspberry Pi shows that there are many instanceswhere a WasmRT outperforms a similar Docker+C solution.WasmRT has a very clear use case for IoT devices, specifi-cally short jobs, the results from our research will show thatWasmRT can be up to almost 70 times as fast as a similarDocker solution. WasmRT has a very strong use case thatother container solutions can not contend with. This paperwill show how effective a lightweight, portable, and fast Was-merRT can be, but also to highlight its pain points and whenother container solutions may make more sense

Cílem této práce je vytvořit nástroj pro vývoj aplikací  na určité minoritní platformy, primárně Smart TV a HbbTV. Ty jsou implementovány v klienském JavaScriptu. Cílovou skupinou jsou tedy vývojáři takových aplikací, nikoli koncoví uživatelé. Zmíněný nástroj bude mít za cíl zjednodušit a urychlit vývojové procesy, hlavně ladění výkonu aplikací.

Le Cloud, avec son modèle économique, offre la possibilité d’un gestion élastique des ressources; les utilisateurs peuvent louer des ressources selon leurs besoins. Cette élasticité permet de réduire les coûts énergétiques et financiers, et aide les applications à s’adapter aux charges de travail variables.Les applications manipulant de grandes quantités de données exécutées dans le Cloud ou sur des supercalculateurs sont souvent colocalisées avec un système de stockage distribué pour garantir un accès rapide aux données. Bien que de nombreux travaux aient été proposés pour redimensionner dynamiquement les capacités de calcul pour s’ajuster à la charge de travail, le stockage n’est pas considéré comme malléable (capable d’être redimensionné dynamiquement) puisque les transferts de grandes quantités de données nécessaires sont considérés trop lents. Cependant, le matériel et les techniques de stockage ont évolué et cette hypothèse doit être réévaluée.Dans cette thèse, nous présentons une étude sous différents angles des opérations de redimensionnement des systèmes de stockage distribués.Nous commençons par modéliser la durée minimale de ces opérations pour évaluer leur vitesse potentielle. Puis, nous développons un benchmark conçu pour mesurer la viabilité de la malléabilité d’un système de stockage sur une plateforme donnée. Finalement, nous implémentons un gestionnaire d’opérations de redimensionnement pour systèmes de stockage distribués qui décide et organise les transferts de données requis par ces opérations. / The Cloud, with its pay-as-you-go model, gives the possibility of elastic resource management; users can claim and release resources as needed. This elasticity leads to financial and energetical cost reductions, and helps applications to cope with varying workloads.Distributed cloud and HPC applications processing large amounts of data are often co-located with a distributed storage system in order to ensure fast data accesses. Although many works have been proposed to dynamically rescale the processing part of such systems to match their workload, the storage is never considered as malleable (able to be dynamically rescaled) since moving massive amounts of data around is assumed to be too slow in practice. However, in recent years hardware and storage techniques have evolved and this assumption needs to be revisited.In this thesis, we present a study of the rescaling operations in distributed storage systems approached from different angles. We start by modeling the minimal duration of rescaling operations to estimate their potential speed. Then, we develop a benchmark to measure the viability of distributed storage system malleability on a given platform. Last, we implement a rescaling manager for distributed storage systems that decides and organizes the data transfers required during a rescaling operation.