REDUCING GRANULARITY OF BROWSER FINGERPRINTING TECHNIQUES

A data transformation system transforms a data representation of an image displayed by an application such as a web browser. The system receives a data representation of an image. The system fetches a stored seed value associated with a user profile. The system performs a transformation of the data representation of the image based on the seed value. The seed value updates occasionally. Transforming the image using a sporadically-changing seed value reduces canvas-based fingerprinting granularity

Resource failures risk assessment modelling in distributed environments

Service providers offer access to resources and services in distributed environments such as Grids and Clouds through formal Service level Agreements (SLA), and need well-balanced infrastructures so that they can maximise the Quality of Service (QoS) they offer and minimise the number of SLA violations. We propose a mathematical model to predict the risk of failure of resources in such environments using a discrete-time analytical model driven by reliability functions fitted to observed data. The model relies on the resource historical data so as to predict the risk of failure for a given time interval. The model is evaluated by comparing the predicted risk of failure with the observed risk of failure, and is shown to accurately predict the resources risk of failure, allowing a service provider to selectively choose which SLA request to accept

Risk driven Smart Home resource management using cloud services

In order to fully exploit the concept of Smart Home, challenges associated with multiple device management in consumer facing applications have to be addressed. Specific to this is the management of resource usage in the home via the improved utilization of devices, this is achieved by integration with the wider environment they operate in. The traditional model of the isolated device no longer applies, the future home will be connected with services provided by third parties ranging from supermarkets to domestic appliance manufacturers. In order to achieve this risk based integrated device management and contextualization is explored in this paper based on the cloud computing model. We produce an architecture and evaluate risk models to assist in this management of devices from a security, privacy and resource management perspective. We later propose an expansion on the risk based approach to wider data sharing between the home and external services using the key indicators of TREC (Trust, Risk, Eco-efficiency and Cost). The paper contributes to Smart Home research by defining how Cloud service management principles of risk and contextualization for virtual machines can produce solutions to emerging challenges facing a new generation of Smart Home devices

Effiziente Anfragebearbeitung in DHT-basierten RDF-Speichern

Die Informationsflut der modernen Informationsgesellschaft macht es zunehmend schwieriger, relevante Informationen zu finden, welche die Menschen bei ihrer Arbeit unterstützen. Daher wird bestrebt, Daten eine wohldefinierte semantische Bedeutung zu geben, um so eine bessere Zusammenarbeit von Computern und Menschen zu ermöglichen. Die vorherrschende Repräsentierung von semantischen Daten ist das Resource Description Framework (RDF). RDF beschreibt Informationen als Mengen von Tripeln oder äquivalent als gerichtete Graphen. Es bietet die Grundlage, um Ontologien zu definieren, Objekte und Konzepte zu annotieren, Informationen zu integrieren und implizites Wissen abzuleiten. Anwendung findet es in den Bereichen Semantic Web, Semantic Desktop, Grid Computing, E-Business, soziale Netzwerke, Naturwissenschaften und vielen mehr. Diese Dissertation beschreibt ein Indizierungsschema für RDF Tripel auf der Basis einer verteilten Hashtabelle (DHT), einem strukturierten Peer-to-Peer Overlay-Netzwerk, um Skalierbarkeit und Verlässlichkeit zu verbessern. Die Skalierbarkeit wird im Vergleich zu konventionellen zentralen Tripel-Speichern verbessert indem die Peers der DHT die Speicher- und Anfragelast untereinander teilen. Verlässlichkeit wird durch Replikation und fehlertolerante Routingmechanismen erreicht. Die Kernfrage dieser Dissertation ist, wie Anfragen effizient bearbeitet werden können, wobei berücksichtigt werden muss, dass die dafür relevanten Daten im Netzwerk verteilt liegen. Die Dissertation beschreibt und vergleicht dazu neue Strategien, um den Aufwand für die Übermittlung entfernt liegender Daten abzuschätzen und zu reduzieren. Des Weiteren beschreibt sie Caching-Mechanismen, die danach streben, Zwischenergebnisse vorhergehender Anfragen wieder zu verwenden. Abschließend werden Verfahren diskutiert, um die Anfrage- und Speicherlast der Knoten im Netzwerk zu balancieren. Der Erfolg der diskutierten Verfahren wird anhand von Benchmarks mit dem Lehigh University Benchmark demonstriert.The growth of information in modern society makes it more and more difficult to find relevant information that supports people at their tasks. Therefore, we strive to give information a well-defined meaning for better enabling computers and people to work in cooperation. The prevalent representation for semantic information is the Resource Description Format (RDF). RDF describes information as sets of triples or equivalently as directed graphs. It provides the foundation for defining ontologies, annotating objects and concepts, information integration, and knowledge inference. Its applications are found in the areas of Semantic Web, Semantic Desktop, Grid computing, e-Business, social networks, natural sciences, and many others. This thesis presents an indexing schema for RDF triples that is based on a distributed hash table (DHT), a structured peer-to-peer overlay network, in order to improve scalability and reliability. Scalability is improved in comparison to centralized triple stores as the peers participating in the DHT share the storage and the query load. Reliability is achieved by replication and fault tolerant routing mechanisms. The core question addressed by this thesis is how queries can be processed efficiently given the fact that data relevant for the query is spread within the network. The thesis presents and compares novel strategies to estimate the effort of retrieving remote data and mechanisms to reduce the amount of data that needs to be transferred. It presents a caching mechanism that strives to reuse intermediate results of previous queries. Finally, it discusses strategies to balance the query and storage load of peers. The success of the strategies is demonstrated by benchmarks with the Lehigh University Benchmark

Die Entwicklung und der Stand der geographischen Forschung über Uhéhe in Deutsch-Ostafrika

Jena, Univ., Phil. Diss., 1911von Ernst BattréMit Bibliog

Does Violence in Professional Hockey Pay?: Cross Country Evidence from Three Leagues

Battré M, Coates D, Deutscher C. Does Violence in Professional Hockey Pay?: Cross Country Evidence from Three Leagues. In: Jewell T, ed. Violence and Agression in Sporting Contests: Sports Economics, Management, and Policy. Sports Economics, Management and Policy. Vol 4. New York, NY: Springer; 2012: 47-63