An IPTV Set-top box enables the possibility of doing much more than decodingtelevision content. Its Ethernet interface gives it the same possibilities to communicatewith the outside world as any network device. This enables a wide rangeof services from internet radio to acting as a digital media receiver in your homenetwork. These highly interactive services increase the demands for responsiveand visually attractive user interfaces.Due to the cost-sensitive market of IPTV STBs the preferred platform to developthe user interface is the HTML browser as it allows for fast developmenttimes and low costs. As a W3C standard it also offers high portability and hardwareabstraction making it easy to use more than one STB vendor. The cons ofHTML based GUIs are low performance and lacklustre graphics.This thesis aims to find out if SVG can be used to achieve rich, scalable and animatedgraphics with high performance and still keep the attractive characteristicsof HTML.To do this much effort was put into identifying the strenghts and weaknesses ofSVG. The lessons learned resulted in an SVG AJAX framework called TOIXSVGmaking it possible to develop SVG GUIs in the same manner as modern Rich InternetApplications, enabling component reuse to make sure development time scalespreferably with the scope and complexity of the user interface. Along with theframework several new widgets had to be developed to achieve the targeted functionality.As a proof of concept a mock-up GUI was created with the frameworkand widgets.

The aim of this thesis is to develop an educational methodology for the following languages: Markdown, HyperText Markup Language (HTML), eXtensible Markup Language (XML) and Scalable Vector Graphics (SVG); and to verify the methodology at Czech elementary schools on the lower secondary level. An integral part of the methodology is also an introduction to the history and development, as well as the theory of syntax of the mentioned markup languages, necessary for teaching according to this methodology. The methodology uses specific examples, on which the students can verify their newly acquired knowledge in practice. The verification of the methodology took place in the form of teaching at two Czech elementary schools. The teaching took place in the seventh grade within the compulsory elective subject of informatics, in the ninth grade within a compulsory subject. The expected differences in understanding the markup languages education in favor of the ninth year have not been confirmed. The motivation of the students proved to play much greater role than their age. The verification of the methodology has shown that it is necessary to pay careful attention to the precise formulation of the task assignments and guidelines to the students, to avoid confusion and substitution of the source code of the...

Pointer analysis is one of the key static analyses during compilation. The efficiency of several compiler optimizations and transformations depends directly on the scalability and precision of the underlying pointer analysis. Recent advances still lack an efficient and scalable context-sensitive inclusion-based pointer analysis. In this work, we propose four novel techniques to improve the scalability of context-sensitive points-to analysis for C/C++ programs. First, we develop an efficient way of storing the approximate points-to information using a multi-dimensional bloom filter (multibloom). By making use of fast hash functions and exploiting the spatial locality of the points-to information, our multibloom-based points-to analysis offers significant savings in both analysis time and memory requirement. Since the representation never resets any bit in the multibloom, no points-to information is ever lost; and the analysis is sound, though approximate. This allows a client to trade off a minimal amount of precision but gain huge savings(two orders less) in memory requirement. By making use of multiple random and independent hash functions, the algorithm also achieves high precision and runs, on an average,2×faster than Andersen’s points-to analysis. Using Mod/Ref analysis as a client, we illustrate that the precision is above 98% of that of Andersen’s analysis. Second, we devise a sound randomized algorithm that processes a group of constraints in a less precise but efficient manner and the remaining constraints in a more precise manner. By randomly choosing different groups of constraints across different runs, the analysis results in different points-to information, each of which is guaranteed to be sound. By joining the results of a few runs, the analysis obtains an approximation that is very close to the one obtained by the more precise analysis and still proves efficient in terms of the analysis time. We instantiate our technique to develop a randomized context-sensitive points-to analysis. By varying the level of randomization, a client of points-to analysis can trade off minimal precision (less than 5%) for large gain in efficiency(over 50% reduction in analysis time). We also develop an adaptive version of the randomized algorithm that carefully varies the randomization across different runs to achieve maximum benefit in terms of analysis time and precision without pre-setting the randomization percentage and the number of runs. Third, we transform the points-to analysis problem into finding a solution to a system of linear equations. By making novel use of prime factorization, we illustrate how to transform complex points-to constraints into a set of linear equations and transform the solution back as a points-to solution. We prove that our algorithm is sound and show that our technique is 1.8×faster than Andersen’s analysis for large benchmarks. Finally, we observe that the order in which points-to constraints are processed plays a vital role in the algorithm efficiency. We prove that finding an optimal ordering to compute the fixpoint solution is NP-Hard. We then propose a greedy heuristic based on the amount of points-to information computed by a constraint to prioritize the constraints. This results in a dynamic ordering of the constraint evaluation which, in turn, results in skewed evaluation of constraints where each constraint is evaluated repeatedly and different number of times in a single iteration. Our prioritized analysis achieves, on an average, an improvement of 33% over Andersen’s points-to analysis. We illustrate that our algorithms help in scaling the state-of-the-art pointer analyses. We also believe that the techniques developed would be useful for other program analyses and transformations.

This diploma thesis focuses on graph database data visualization, where data is stored in RDF format. Standard visualisation of RDF data in tables does not offer sufficiently usable user view. One of the goals of this work is to show RDF data in interactive graph, which is ideal form of viewing data considering lucidity and information value. The graph gives good view of not only the data itself but also relationships between the data. Another goal is to test ability of browsers to visualize large amounts of data.

[EN] This thesis dissertation tackles the problem concerning provision of video streaming services over mobile wireless ad hoc networks. Such networks are characterized by their versatility and flexibility, features that make them particularly suited to be used in many scenarios. However, some limitations inherited of the wireless channel and the mobility of the nodes make difficult to guarantee certain degree of quality of service, which is a required condition to the multimedia applications. Furthermore, with the massive demand of video content, it has become very necessary for mobile ad hoc networks to have an efficient routing and quality of services mechanisms to support this traffic. This is because video streaming services require network to provide sufficient bandwidth and an upper bound in delay, jitter and loss rate. Consequently, traditional best-effort protocols are not adequate. The main contribution of this thesis is the development of a comprehensive routing protocol that has a feedback scheme in order to provide information to the application about the network conditions. This protocol has a cross-layer architecture and it incorporates three important enhancements. Firstly, a new route recovery strategy, which provides a mechanism to detect the link failures in a route and re-establish the connections taking into account the conditions of quality of service that have been established during the previous route discovery phase. Secondly, an algorithm for the estimation of the available bandwidth along the route, information that is sent to application layer in order to apply an adaptation procedure that adjusts the bit rate of the video source. This rate-adaptive strategy is performed exploiting the layered scheme of the scalable video coding. In particular, the adaptive method removes, from the scalable video stream, those layers that could not be efficiently supported by network since their bitrates exceed the available bandwidth. The third main feature of the proposed routing protocol is a gateway discovery algorithm to improve the interconnectivity between mobile ad hoc networks and infrastructure-based networks. This algorithm incorporates available bandwidth as a metric during the gateway selection and a dynamic adaptation of some operational parameters such as the size of the proactive area and the frequency of the advertisement messages. Additionally, in order to solve the lack of a software tool to simulate rate-adaptive transmission of scalable video, a new simulation framework had be implemented. This simulation tool is an open source software freely available and, thus, it represents other contribution of this thesis. The results reveal performance improvements in terms of packet delay, dropped packets and the number of link failures while a more efficient use of the available bandwidth is obtained. In terms of video transmission, the results prove that the combined use of the proposed protocol and the scalable video coding provides an efficient platform for supporting rate-adaptive video streaming over mobile ad hoc networks. / [ES] Esta tesis aborda los problemas relacionados con los servicios de video en modo streaming sobre las redes móviles ad hoc. Este tipo de redes se caracterizan por su versatilidad y flexibilidad, lo cual las hace especialmente adecuadas para ser utilizadas en diversos escenarios. Sin embargo, algunas limitaciones inherentes a los enlaces inalámbricos y a la movilidad de los nodos, hace difícil garantizar cierto nivel de calidad de servicio, lo cual es una condición necesaria para el transporte de flujos multimedia. Además, con la masiva demanda de videos desde los dispositivos móviles, hace aún más necesario asegurar un encaminamiento eficiente y un cierto nivel de calidad de servicio en las redes móviles ad hoc. Por lo tanto, los tradicionales protocolos que funcionan bajo el modelo del "mejor esfuerzo" no son adecuados. Esto se debe principalmente a que las aplicaciones multimedia necesitan que la red asegure suficiente ancho de banda y unos valores máximos de retardo, jitter, y tasa de pérdidas. La principal contribución de esta tesis es el desarrollo de un protocolo de encaminamiento que contiene un esquema de realimentación que le permite informar a la aplicación sobre las condiciones de la red. Este protocolo tiene una arquitectura cross-layer e incorpora tres importantes mejoras. Primero, una nueva estrategia de mantenimiento y recuperación de rutas que provee mecanismos para detectar los fallos de conectividad y el posterior re-establecimiento de las conexiones, teniendo en cuenta las condiciones de calidad de servicio que fueron establecidas durante la etapa inicial del descubrimiento de las rutas. Segundo, un algoritmo para la estimación del ancho de banda disponible a lo largo de la ruta, información que es enviada a la capa de aplicación para aplicar un proceso de adaptación que ajusta la tasa de envío de datos de la fuente. Esta estrategia adaptativa de la tasa aprovecha el esquema por capas de la codificación escalable de video. En particular, el método adaptativo elimina del flujo de video escalable, aquellas capas que no pueden ser transmitidas por la red ya que su tasa de bits supera el ancho de banda disponible. La tercera mejora incluida en el protocolo propuesto es un algoritmo de descubrimiento de gateways para mejorar la interconectividad entre las redes móviles ad hoc y las redes basadas en infraestructura. Dicho algoritmo utiliza el ancho de banda disponible para seleccionar el mejor gateway, así mismo, realiza una adaptación dinámica de algunos parámetros operacionales como el alcance y la frecuencia de los mensajes anuncio. Adicionalmente, ha sido desarrollada una herramienta software para simular la transmisión adaptativa de video escalable sobre redes móviles ad hoc. Esta herramienta de simulación es un software de código abierto y constituye otra contribución más de esta tesis. Los resultados muestran mejoras en el funcionamiento de las redes relacionadas con el retardo, la tasa de pérdidas de paquetes y el número de fallos en la conectividad. Simultáneamente, se obtiene un uso más eficiente del ancho de banda. En relación a la calidad del video transmitido, los resultados demuestran que la utilización del protocolo propuesto junto con la codificación de video escalable, provee un eficiente sistema para la transmisión adaptativa de video escalable sobre redes móviles ad hoc. / [CAT] Aquesta tesi aborda els problemes relacionats amb els serveis de vídeo en mode streaming sobre les xarxes mòbils ad hoc. Aquest tipus de xarxes es caracteritzen per la seva versatilitat i flexibilitat, la qual cosa les fa especialment adequades per a ser utilitzades en diversos escenaris. No obstant això, algunes limitacions inherents als enllaços sense fils i a la mobilitat dels nodes, fa difícil garantir cert nivell de qualitat de servei, cosa que és una condició necessària per al transport de fluxos multimèdia. A més, amb la massiva demanda de vídeos des dels dispositius mòbils, fa encara més necessari assegurar un encaminament eficient i un cert nivell de qualitat de servei en les xarxes mòbils ad hoc. Per tant, els tradicionals protocols que funcionen sota el model del "millor esforç" no són adequats. Això es deu principalment al fet que les aplicacions multimèdia necessiten que la xarxa asseguri suficient ample de banda i uns valors màxims de retard, jitter, i taxa de pèrdues. La principal contribució d'aquesta tesi és el desenvolupament d'un protocol d'encaminament que conté un esquema de realimentació que li permet informar l'aplicació sobre les condicions de la xarxa. Aquest protocol té una arquitectura cross-layer i incorpora tres importants millores. Primer, una nova estratègia de manteniment i recuperació de rutes que proveeix mecanismes per detectar les fallades de connectivitat i el posterior re-establiment de les connexions, tenint en compte les condicions de qualitat de servei que van ser establertes durant l'etapa inicial del descobriment de les rutes. Segon, un algoritme per a l'estimació de l'ample de banda disponible al llarg de la ruta, informació que és enviada a la capa d'aplicació per aplicar un procés d'adaptació que ajusta la taxa d'enviament de dades de la font. Aquesta estratègia adaptativa de la taxa aprofita l'esquema per capes de la codificació escalable de vídeo. En particular, el mètode adaptatiu elimina del flux de vídeo escalable aquelles capes que no poden ser transmeses per la xarxa ja que la seva taxa de bits supera l'ample de banda disponible. La tercera millora inclosa en el protocol proposat és un algoritme de descobriment de gateways per millorar la interconnectivitat entre les xarxes mòbils ad hoc i les xarxes basades en infraestructura. Aquest algoritme utilitza l'ample de banda disponible per seleccionar el millor gateway, així mateix, realitza una adaptació dinàmica d'alguns paràmetres operacionals com l'abast i la freqüència dels missatges anunci. Addicionalment, ha estat desenvolupada una eina programari per a simular la transmissió adaptativa de vídeo escalable sobre xarxes mòbils ad hoc. Aquesta eina de simulació és un programari de codi obert i constitueix una altra contribució més d'aquesta tesi. Els resultats mostren millores en el funcionament de les xarxes relacionades amb el retard, la taxa de pèrdues de paquets i el nombre de fallades en la connectivitat. Simultàniament, se n'obté un ús més eficient de l'ample de banda. En relació a la qualitat del vídeo transmès, els resultats demostren que la utilització del protocol proposat juntament amb la codificació de vídeo escalable, proveeix un eficient sistema per a la transmissió adaptativa de vídeo escalable sobre xarxes mòbils ad hoc. / Castellanos Hernández, WE. (2015). Quality of Service Routing and Mechanisms for Improving Video Streaming over Mobile Wireless Ad hoc Networks [Tesis doctoral]. Editorial Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/53238 / TESIS

No description available.

No description available.

Am 1. und 2. März 2018 fand das diesjährige Frühjahrstreffen der GI-Fachgruppe „Datenbanken“ in St. Leon-Rot statt, welches mit über 120 registrierten Teilnehmern einen neuen Besucherrekord verzeichnen konnte und dadurch sowohl die Relevanz des gewählten Themas als auch die Lebendigkeit der Fachgruppe verdeutlichte. Das übergeordnete Thema des Fachgruppentreffens lautete „ModernDatabase Platforms“, wobei das von der DFG finanzierte Schwerpunktprogramm „Scalable Data Management for Future Hardware“ (SPP 2037) als Ideengeber für die eingeladenen Vorträge stand und auch inhaltlich in das Programm des Treffens integriert war. Das Treffen fand in den Räumlichkeiten der SAP SE am SAP Campus in St. Leon-Rot statt.

A smart home is a building equipped with sensors collecting data about its environment. Data collected from smart home buildings can be used for research to improve home automation and develop smart cities. A scalable web-based system can be used to handle the large quantities of data generated from smart homes. Previous studies have been conducted on the requirements of a system collecting sensor data from smart homes, however, information about the presentation of data is still lacking. Because of this research needs to be done on what kind of system handles and presents sensor data well.The aim of this degree project is to identify the requirements of a web-based system handling and presenting sensor data. A scalable web-based system is developed based on the requirements identified from interviews and a literature study. The system shows that sensor data can be presented in a manner which facilitates research. Results show that a scalable web-based system can be used to display and download sensor data with associated information about the data. / Ett smart hem är en byggnad utrustad med sensorer som samlar data om sin miljö. Data insamlad från smarta hem kan leda till förbättringar i hemautomatisering och utvecklingen av smarta städer. Ett skalbart webbaserat system kan användas för att hantera stora mängder data som genereras utav smarta hem. Tidigare studier har genomförts för att framställa kraven utav ett system som samlar in data från smarta hem, dock saknas fortfarande information om hur denna data ska presenteras. På grund av detta behövs forskning om vilket typ av system som kan hantera och presentera data.Målet med detta examensarbete är att identifiera kraven för ett webbaserat system som hanterar och presenterar sensordata. Ett skalbart webbaserat system utvecklas baserat på krav identifierade genom intervjuer och en literaturstudie. Systemet visar att sensor data kan presenteras på ett sätt som underlättar forskning. Resultatet visar att ett skalbart webbaserat system kan användas för att visa och ladda ned sensordata med tillhörande information om datan.

A variety of research exists for the processing of continuous queries in large, mobile environments. Each method tries, in its own way, to address the computational bottleneck of constantly processing so many queries. For this research, we present a two-pronged approach at addressing this problem. Firstly, we introduce an efficient and scalable system for monitoring traditional, continuous queries by leveraging the parallel processing capability of the Graphics Processing Unit. We examine a naive CPU-based solution for continuous range-monitoring queries, and we then extend this system using the GPU. Additionally, with mobile communication devices becoming commodity, location-based services will become ubiquitous. To cope with the very high intensity of location-based queries, we propose a view oriented approach of the location database, thereby reducing computation costs by exploiting computation sharing amongst queries requiring the same view. Our studies show that by exploiting the parallel processing power of the GPU, we are able to significantly scale the number of mobile objects, while maintaining an acceptable level of performance. Our second approach was to view this research problem as one belonging to the domain of data streams. Several works have convincingly argued that the two research fields of spatiotemporal data streams and the management of moving objects can naturally come together. [IlMI10, ChFr03, MoXA04] For example, the output of a GPS receiver, monitoring the position of a mobile object, is viewed as a data stream of location updates. This data stream of location updates, along with those from the plausibly many other mobile objects, is received at a centralized server, which processes the streams upon arrival, effectively updating the answers to the currently active queries in real time. iv For this second approach, we present GEDS, a scalable, Graphics Processing Unit (GPU)-based framework for the evaluation of continuous spatio-temporal queries over spatiotemporal data streams. Specifically, GEDS employs the computation sharing and parallel processing paradigms to deliver scalability in the evaluation of continuous, spatio-temporal range queries and continuous, spatio-temporal kNN queries. The GEDS framework utilizes the parallel processing capability of the GPU, a stream processor by trade, to handle the computation required in this application. Experimental evaluation shows promising performance and shows the scalability and efficacy of GEDS in spatio-temporal data streaming environments. Additional performance studies demonstrate that, even in light of the costs associated with memory transfers, the parallel processing power provided by GEDS clearly counters and outweighs any associated costs. Finally, in an effort to move beyond the analysis of specific algorithms over the GEDS framework, we take a broader approach in our analysis of GPU computing. What algorithms are appropriate for the GPU? What types of applications can benefit from the parallel and stream processing power of the GPU? And can we identify a class of algorithms that are best suited for GPU computing? To answer these questions, we develop an abstract performance model, detailing the relationship between the CPU and the GPU. From this model, we are able to extrapolate a list of attributes common to successful GPU-based applications, thereby providing insight into which algorithms and applications are best suited for the GPU and also providing an estimated theoretical speedup for said GPU-based applications