The main topic of the master’s thesis is the inluence of the locality on the usual price of a family house in town of Ostrava. This analysis does not only focus on usual criterias (accessibility to the center, etc.), but also addresses the specific problems of the region, eg. air quality. There is also a questionnaire survey aimed at identifying respondents' preferences regarding the choice of the ideal location for housing. For the valuation of the selected family house, two methods are selected, namely the comparative method according to the valid valuation rule and the method of market comparison, specifically the direct comparison method, which are described in more detail in the theoretical introduction. The final part deals with the comparison of the outcomes of these two methods and possible discrepancies that might arise.

This thesis analyzes the specific critical accident points in the district Blansko. The purpose of this thesis is to suggest the organizational, constructional and technical measures needed to reduce the possibility of accidents, thus increasing road safety in these locations.

This diploma thesis presents a tool for dynamic memory allocator analysis, focused on their performance. The work identifies the important memory allocator performance metrics, as well as the environment and program factors influencing these metrics. Using this knowledge, a tool was designed and implemented. This tool allows to gather and analyze these metrics. The tool provides the ability to create memory allocator usage scenarios for the purpose of the allocator behavior analysis under different conditions. The tool was tested on several available memory allocators with free license.

More than a hundred sites were in Prague in the past, where skeletal remains of Pleistocene mammals had been found. Most of these sites were brickyards or sand pits. These pits were in operation during the second half of the 19th century and first half of the 20th century. Many awards were found during construction works as well. Most of researchers attended only several most famous sites at the time of the findings. The catalog summarizes the basic known information about majority of Prague localities and includes a list of taxa wich were found there. Key words: Prague, locality, mammals, Pleistocene, brickyards, sand pits

UNIVERZITA KARLOVA FAKULTA HUMANITNÍCH STUDIÍ Katedra sociální a kulturní ekologie Ing. Jitka Preusslerová Alternativní a doplňkové ekonomické systémy v praxi Abstract of diploma thesis Vedoucí práce: Mgr. et Mgr. Arnošt Novák, Ph.D. Praha 2019 Abstract: This thesis is based on the premise of long-term unsustainability of the current economic system and its aim is to explore possible alternatives, or supplements, which could contribute to its transformation into more viable form. The first part consists of a literature research that contains the widest possible range of related concepts, thought and does not neglect the historical continuity of alternative economic thinking. In the practical part the research focuses on two concrete implementations, which are very different from each other. The intention is to explore functionality, their drawbacks and bright sides to which the method of participating observation and interviews with system members or their founders will be used. In the final part there is a discussion about whether this reformation path is the right solution to the problems and shortcomings that the current economic world is facing, or rather a patch for the soul for individuals who are aware of these threats. Key words: shift, money, business, community, natural environment, locality, LETS

Ce manuscrit s’intéresse principalement à l'influence de la répulsion entre électrons libres sur la réponse optique des métaux. Les modèles de matériaux classiques considèrent que la réponse d'un métal est locale -- c'est à dire que la réponse en un point dépend exclusivement des champs en ce point. La prise en compte de la répulsion entre électrons conduit à adopter une description dite non locale de la réponse métallique. Cette thèse explore de façon théorique et numérique les effets de la non-localité sur les propriétés optiques de nanostructures métallo-diélectriques dans le visible et le proche infra-rouge. A l'aide d'un modèle hydrodynamique il est montré que, de façon surprenante, les modes d'interstices plasmoniques peuvent être sensible à la non-localité pour des épaisseurs de plusieurs dizaines de nanomètres. Il est également montré que le plasmon de surface lui même peut être sensible à la non-localité à condition de considérer une interface entre le métal et un diélectrique d'indice suffisamment élevé. Nous proposons et étudions (théoriquement) ici plusieurs configurations simples et réalistes (coupleurs à prisme et à réseaux) pour la mise en évidence expérimentale de la non-localité sur des structures dont les échelles caractéristiques sont de l'ordre de plusieurs dizaines ou centaines de nanomètres. Enfin, dans une seconde partie du manuscrit, le formalisme et les considérations numériques nécessaires à l'étude du rayonnement d'un dipôle dans une structure multi-couche sont présentés en détail puis validés grâce à des comparaisons de dyadiques de Green, diagrammes de rayonnement, et taux d'émission avec des cas disponibles dans la littérature. / This manuscript is mainly focused on the influence of repulsion between free electrons on the optical response of metals. Classical material models consider that the metallic response is local -- i.e. that the response at a given point only depends on the fields at this point. Taking into account the repulsion between electrons leads to a so-called non-local description of the metalic response. This thesis explores in a theoritical and numerical way the effects of non-locality on the optical properties of metallo-dielectric nanostructures in the visible and near infrared. Using a hydrodynamical model it is shown that, suprisingly, the modes of plasmonic gaps can be sensitive to non-locality for thicknesses of several tens of nanometers. It is also shown that the surface plasmon itself can be sensitive to non-locality provided that an interface between a metal and a sufficiently high refractive index dielectric is considered. We propose and study here several simple and realictic setups (prism and grating couplers) which would allow to experimentally observe the impact of non-locality and which have characteristic scales of tens or even hundreds of nanometers. Finally, in a second part of the manuscript, the formalism and numerical considerations necessary for the study of a dipole radiation in a multi-layered structure are presented in detail and then validated thanks to comparisons of Green dyadics, radiation diagrams, and emission rates with cases avaible in the literature.

Since its emergence, user generated content (UGC) has become the driving force in the growth of Internet traffic. As one of the most successful and popular UGC systems, YouTube contributes a great share of Internet traffic volume and has attracted a lot of academic interest. The continuously increasing amount of IP traffic motivates the need for better network design, more efficient content distribution mechanisms, and more sustainable system development. Web caching is one of the widely used techniques to reduce the inter Internet Service Provider (ISP) traffic. Web caching is considered an important part in the design of a content distribution infrastructure. This master’s thesis utilizes a one month trace of YouTube traffic in two residential networks in Sweden. Based upon a systematic and in-depth measurement we focus on analyzing the geographic locality of traffic patterns within small areas for these two networks. We summarize the YouTube traffic characteristics and user replay patterns, and then discuss why caching can be useful for YouTube-like systems. We present the optimal caching gain on a per area basis and also divide users into two groups: PC and mobile device users to show the caching gain for these two groups. Overall, an infinite capacity proxy cache for each small area could reduce the YouTube streaming data traffic by 30% to 45%. The result presented in this paper help us to understand YouTube traffic and user behaviors and provides valuable information for the ISPs to enable them to design more efficient caching mechanisms. When this work began we thought that a reduction of backhaul traffic (especially for mobile operators) may delay the need to make investments in upgrading their network capacity. However, an important conclusion from this thesis project is that the cache efficiency depends on the terminal type. For mobile terminals (smart phones, iPads, etc) a terminal cache solution is found to be the most efficient. For PCs in fixed networks, a network cache would be more efficient. It should be noted that the mobile terminals covered in the project are connected through home Wi-Fi, so further research is needed in order to draw definite conclusions for caching solutions for cellular networks. / Sedan dess tillkomst har användargenererat innehåll (på engelska: User Generated Content UGC) blivit den drivande kraften bakom ökningen av internettrafiken. Ett av de mest använda och populära UGC-systemen är Youtube, som bidrar med en stor del av volymen i internettrafiken, och har på så sätt lockat till sig ett stort akademiskt intresse. Den konstant ökande mängden av IP-trafik motiverar behovet av bättre nätverksdesign, effektivare mekanismer för delning av data, och en mer långsiktig system utveckling. Mellanlagring i nätet (network caching) är en av de mer använda teknikerna för att reducera trafiken för Internetoperatörer. Mellanlagring i nätet anses vara en viktig del i designen av den framtida media-distributionens infrastruktur. Det här examensarbetet använder en månads data från Youtube-trafik i två lokala nätverk i Sverige. Baserat på en systematisk och detaljerad mätning, fokuserar vi på att analysera specifika trafikmönster geografisk små områden för dessa två nätverk. Vi analyserar Youtube-trafikens egenskaper och karakteristik och användarnas beteende mönster. Baserat på dessa analyserar vi om mellanlagring kan vara en nyttig lösning för att reducera trafiken för Youtube-liknande system. Vi presenterar den optimala lagringsvinsten (cache gain) för geografiskt definierade populationer och vi delar även upp användare i två grupper: PC och mobila enheter, för att visa lagringsvinsten individuellt för dessa grupper. Generellt sett, om man hade en oändlig lagringskapacitet hos en proxy cache inom ett visst område, så skulle man kunna reducera Youtube-trafiken med 30-45%. Resultaten som presenterats i detta dokument, hjälper oss att förstå Youtube trafik och användar beteende, och ger värdefull information till operatörer, så att de kan designa effektivare lagringsmekanismer. Some utgångspunkt för detta arbete antog vi att en minskning av backhaultrafiken (särskilt för mobiloperatörer) kan fördröja behovet av att göra investeringar för att uppgradera kapaciteten i nätet. En viktig slutsats av detta examensarbete är att effektiviteten hos en proxy cache beror av terminaltypen. För mobila terminaler (smarta telefoner, iPads, etc) ger terminal-cache högre effektivitet, medan en nätverks-cache är effektivare för PCs. Det bör dock nämnas att mätningarna i detta arbete är från terminaler uppkopplade via fast bredband. Det behövs vidare analys för att dra konkreta slutsatser för användarbeteende och cache-lösningar i mobilnät.

Le sujet de cette thèse est une étude de tests du caractère quantique des systèmes de dimension supérieure à deux dans des conditions réalistes. La non-localité est une des propriétés quantiques utile pour des protocoles du domaine des communications quantiques. L’étude réalisée sur les effets de la décohérence (modèles de conditions réalistes) permet de rendre compte des moyens à mettre en oeuvre afin d’optimiser la conservation de la non-localité en pratique. La contextualité est une autre propriété quantique fondamentale avec un potentiel dans le domaine de traitement d’information quantique. Un test de contextualité a été développé pour toutes les dimensions de systèmes quantiques supérieures à deux. Une expérience prenant en compte les enjeux expérimentaux des tests de contextualité est aussi proposée. / The subject of this thesis is a study of tests of the quantum features of systems of dimension greater than two under realistic conditions. Non-locality is one of the quantum properties used in protocols in the field of quantum communications. The study on the effects of the decoherence (models ofrealistic conditions) address the issue of the conservation of non-locality in practice. Contextuality is another fundamental quantum property with a potential power in quantum information processing. A contextuality test has been developed for all dimensions of quantum systems greater than two. An experiment that considers the experimental issues of contextuality tests is also proposed.

Background: Data analysis for biomedical research often requires a record linkage step to identify records from multiple data sources referring to the same person. Due to the lack of unique personal identifiers across these sources, record linkage relies on the similarity of personal data such as first and last names or birth dates. However, the exchange of such identifying data with a third party, as is the case in record linkage, is generally subject to strict privacy requirements. This problem is addressed by privacy-preserving record linkage (PPRL) and pseudonymization services. Mainzelliste is an open-source record linkage and pseudonymization service used to carry out PPRL processes in real-world use cases. Methods: We evaluate the linkage quality and performance of the linkage process using several real and near-real datasets with different properties w.r.t. size and error-rate of matching records. We conduct a comparison between (plaintext) record linkage and PPRL based on encoded records (Bloom filters). Furthermore, since the Mainzelliste software offers no blocking mechanism, we extend it by phonetic blocking as well as novel blocking schemes based on locality-sensitive hashing (LSH) to improve runtime for both standard and privacy-preserving record linkage. Results: The Mainzelliste achieves high linkage quality for PPRL using field-level Bloom filters due to the use of an error-tolerant matching algorithm that can handle variances in names, in particular missing or transposed name compounds. However, due to the absence of blocking, the runtimes are unacceptable for real use cases with larger datasets. The newly implemented blocking approaches improve runtimes by orders of magnitude while retaining high linkage quality. Conclusion: We conduct the first comprehensive evaluation of the record linkage facilities of the Mainzelliste software and extend it with blocking methods to improve its runtime. We observed a very high linkage quality for both plaintext as well as encoded data even in the presence of errors. The provided blocking methods provide order of magnitude improvements regarding runtime performance thus facilitating the use in research projects with large datasets and many participants.

Modern Garbage Collectors provide performance improvements by increasing program locality to utilize the faster CPU cache. A common approach is to move objects together according to the mutators’ access order, which brings more relocations during GC. In most cases, more relocations would not impact performance when using concurrent Garbage Collectors such as ZGC. However, in constrained environments with fewer CPU cores or less memory, bad relocation performance will cause overall performance degradation. In this thesis, we investigated why larger objects do not benefit from better program locality, then proposed a new design to reduce the number of relocations by efficiently identifying and ignoring larger objects. As a result, the relocation performance can be improved. In constrained environments, this can lead to an increase in overall throughput. In the new design, we introduce an extra page type, the tiny page. If an object is considerably small that it could benefit from relocation, it will be placed on the tiny page when allocating. As a result, we could replace the time‐consuming size check of objects with a faster page type check. Memory fragmentation also can be reduced by this design. To evaluate this design, we add the size identification procedure into a locality improvement implementation named HCSGC. The results of benchmarks show a slight improvement in constrained environments. In the JGraphT benchmark, we see a 3‐5% speedup in different configurations with memory limitations. In the SPECjbb2015 benchmark, we see a ~1% increase in performance on average, but with overlapping confidence intervals. In the DaCapo benchmark suite, we see a 1% improvement in the sunflow benchmark with CPU constraint. For other benchmarks in DaCapo, no significant difference is discovered. The results suggest that the proposed new design is a feasible way of filtering out larger objects, and doing so can further improve the relocation and overall performance. / Modern Garbage Collector ger prestandaförbättringar genom att öka programplatsen för att använda den snabbare CPU‐cachen. En vanlig metod är att flytta fler objekt baserat på mutators åtkomstorder. I de flesta fall skulle fler omplaceringar inte påverka prestanda vid användning av samtidiga Garbage Collector som ZGC. Men i begränsade miljöer med färre CPU‐kärnor eller mindre minne kommer dålig flyttningsprestanda att leda till övergripande prestandaförsämring. I denna avhandling undersökte vi varför större objekt inte gynnas av bättre programplats, och föreslog sedan en ny design för att minska antalet flyttningar genom att effektivt identifiera och ignorera större objekt. Som ett resultat kan flyttningsprestandan förbättras. I begränsade miljöer kan detta leda till en ökning av den totala genomströmningen. I den nya designen introducerade vi en extra sidtyp, den lilla sidan. Om ett objekt är avsevärt litet som kan ha nytta av omplacering, kommer det att placeras på den lilla sidan vid allokeringen. Som ett resultat kan vi ersätta den tidskrävande storlekskontrollen av objekt med en snabbare sidtypskontroll. Minnesfragmentering kan också reduceras med denna design. För att utvärdera denna design lägger vi till storleksidentifieringsproceduren i en implementering av lokaliseringsförbättring som heter HCSGC. Resultaten av riktmärken visar en liten förbättring i begränsade miljöer. I JGraphT‐riktmärket ser vi en hastighet på 3‐ 5% i olika konfigurationer med minnesbegränsningar. I riktmärket SPECjbb2015 ser vi i genomsnitt en ~1% prestationsökning, men med överlappande konfidensintervall. I DaCapo ‐riktmärket ser vi en förbättring på 1% i solflödesriktmärket med CPU‐begränsning. För andra riktmärken i DaCapo upptäcks ingen signifikant skillnad. Resultaten tyder på att den föreslagna nya designen är ett genomförbart sätt att filtrera bort större objekt, och det kan ytterligare förbättra flytten och den övergripande prestandan.