Now showing items 12-30 of 30
| Abstract: | Video is dominating consumer internet traffic. Restless internet users expect smooth playback and low latency when watching video content and vendors risk losing customers if this cannot be provided. Distributed storage systems specialized for delivering video content and for handling the high traffic this lead to, have been developed over many years. This thesis look into building and deploying a distributed video storage to deliver video content to an enterprise sport analytics web interface using open source solutions. We look into properties such as horizontal scalability, fault tolerance, security and privacy to outline an architecture that can scale horizontally and deliver video content in an efficient way to a HTML5 web interface. Our conjecture is that developing such a distributed storage solution from scratch is not feasible, and that other, accessible, storage solutions should be evaluated. We ended up with deploying OpenStack Object Storage on our cluster, integrating it with the web front end for uploading, managing and accessing video content. Our experiments test and evaluate the performance and boundaries of our system. We also discuss elasticity problems related to sudden spikes in interest, and solutions in the context of privacy and economic issues. The final deployed video storage system has replaced an old centralized approach that previously has been used. It is currently in production delivering video content to a web interface that is used for soccer analytics by our sport partner Tromsø IL. A case study has been made to observe how they have been using our systems for the last year. |
| URI: | http://hdl.handle.net/10037/5163 |
| Abstract: | Argos is a middleware platform developed at the ArticBeans lab at the University of Tromsø. The purpose of Argos is to provide a personal application platform for custom services. In this thesis we look at how Bluetooth devices along with Argos can be combined to create an application for encouraging and motivating physical activity. Physical activity is steadily decreasing among the population. People are getting more and more unhealthy due to lack of exercise. Playing computer games or watching television is rather normal today, going outside for a walk is something people seldom do. If a person wants to break the habit of sitting still, he will struggle with breaking the habit and committing to the new lifestyle. A person might have a higher chance of success, if he has something to remind him to exercise at a certain time of the day. The most common reason for failing to break a habit, can be due to lack of reinforcement of the new lifestyle. Having a personal application which allows the person to control his exercise, and also lets him see how much he has achieved, might prove both motivating and encouraging to continue to be more active. |
| URI: | http://hdl.handle.net/10037/1411 |
| Abstract: | Live video search is emerging as a platform for multimedia production and entertainment service. Such systems rely on a stream of live video and metadata describing the video content. A high quality source for such metadata can be found on the web. Identifying and extracting metadata from web pages can be done by crawling and scraping. However, general crawler politeness rules limit per-site polling frequency, and therefore the freshness of the retrieved data is also limited. % our solution In this thesis we present a metadata extraction system capable of combining high metadata freshness, while at the same time adhering to polling politeness rules. To achieve this, the proposed solution uses a pool of web sources containing overlapping information scheduled in a round-robin fashion. % evaluation Our experiments and analysis show that our system is capable of keeping the average metadata freshness higher than any single-source solution, while at the same time adhere to polling politeness rules. |
| URI: | http://hdl.handle.net/10037/2400 |
| Abstract: | Denne oppgaven ser på mulighetene for å bruke kontekstinformasjon for å kunne tilpasse interaksjonsmodi mot mobile terminaler, spesielt mobiltelefoner. Hensikten er å illustrere hvordan brukere av et transportselskap automatisk kan motta beskjeder om forsinkelser på bussavganger han/hun er interessert i, samt andre beskjeder fra transportselskapet. Brukere skal altså slippe å kjenne til vanlige rutetider. På denne måten blir tjenesten skreddersydd for hver enkelt bruker. Kontekst som identitiet, lokasjon, situasjon og tid brukes for å avgjøre hvilket interaksjonsmodus som skal benyttes. Interaksjonsmodi som ses på i denne oppgaven er SMS og J2ME. Transportsystemet spesifiseres og designes i sin helhet, men kun en demonstrator utvikles. Demonstratoren er utviklet for å fungere på en Sony Ericsson P800, men andre telefoner vil også fungere. Demonstratoren utvikles for å vise at det er mulig å bruke kontekstinformasjon for å avgjøre hvilket interaksjonsmodus som skal benyttes. I demonstratoren er kun J2ME brukt som interaksjonsmodus, mens SMS som interaksjonsmodus ikke er implementert. |
| URI: | http://hdl.handle.net/10037/290 |
| Abstract: | The microprocessor industry has reached limitations of sequential processing power due to power-efficiency and heat problems. With the integrated-circuit technology moving forward, chip-multithreading has become the trend, increasing parallel processing power. The shift of focus has resulted in the vast majority of supercomputers having chip-multiprocessors. While the high performance computing community has long written parallel applications using libraries such as MPI, the performance-characteristics have changed from the traditional uni-core cluster, to the current generation of multi-core clusters; more communication is between processes on the same node, and processes run on cores sharing hardware resources, such as cache and memory bus. We explore the possibilities of optimizing a widely used MPI implementation, Open MPI, to minimize communication overhead for communication between processes running on a single node. We take three approaches for optimization: First we measure the message-passing latency between the different cores, and reduce latency for large messages by keeping the sender and receiver synchronized. Second, we increase scalability by using two new queue-designs, reducing the number of communication queues that need to be polled to receive messages. Third, we experiment with mapping a parallel application to different cores, using only a single node. The mapping is done dynamically during runtime, with no prior knowledge of the application's communication pattern. Our results show that for large messages sent between cores sharing cache, message-passing latency can be significantly reduced. Results from running the NAS Parallel Benchmarks using the new queue-designs show that Open MPI can increase its scalability when running more than 64 processes on a single node. Our dynamic mapper performs close to our manual mapping, but rarely increases performance. We see from the experimental results, that the three techniques give performance increase in different scenarios. Combining techniques like these with other techniques, can be a key to unlocking the parallel performance for a broader range of parallel applications. |
| URI: | http://hdl.handle.net/10037/1735 |
| Abstract: | Real-time media rich applications rely on live streams of rich and accurate meta-data describing the video content to provide personal user experiences. Unfortunately, the general amount of video meta-data today is often limited to titles, synopsis and a few keywords. A wildly used approach for extraction of meta-data from video is computer vision. It has been developed a number of different video processing algorithms which can analyse and retrieve useful data from video. However, the computational cost of current computer vision algorithms is considerable. This thesis presents a software architecture that aims to enable real-time annotation of multiple live video streams. The architecture is intended for use within media rich applications where extraction of video semantics in real-time is necessary. Our conjecture was that staging video processing in levels will make room for a more scalable video annotation system. To evaluate our thesis we have developed the prototype runtime Árvdadus. Our experiments show that staged processing can decrease the computation time of meta-data extraction. The evaluation of the architecture suggests that the architecture is applicable in a wide range of domains where extraction of meta-data in real-time is necessary |
| URI: | http://hdl.handle.net/10037/3520 |
| Abstract: | Digital photographing has become more and more popular as cameras and mobile phones get more advanced and have newer technology embedded. Manually searching in these growing image collections is problematic because of missing context information related to the image itself. If related context information could be added as an automated process, it could help the user view and locate images and information about the image. In this thesis I purpose a system that tries to collect relevant context information connected to an image using time and date, gps location and a user given image category taken with a Nokia N95 using mobile image capturing software like described in [1]. |
| URI: | http://hdl.handle.net/10037/2443 |
| Abstract: | Subversion, an open-source centralized version control system, developed by CoallabNet, is currently the second most popular version control system, after the ever popular CVS. Like CVS, Subversion uses a client-server architecture, but has a cleaner, modular architecture. One set of subversion modules, are the filesystem backends modules of subversion. Two ``official'' backends are currently supplied with subversion, a berkleyDB based backend(bdb), and a custom filebased filesystem implementation (fsfs). At least another un-official backend module using an SQL-database exists. Pesto is a secure, decentralized, distributed peer-to-peer storage system, implemented both as a NetBSD filesystem, and as middelware, a portable C-library (libpesto). Currently two applications using libpesto have been written, a C\#\/.Net windows client, and a highly scalable serverfarm for Pesto, written in Java. In this project we integrate subversion with pesto, by creating a new filesystem backend for subversion using libpesto. The result is a version-control system, that works like a centralized version-control system, but has decentralized storage. We show that this system can be used for backup, mirroring of repositories, and as a decentralized version-control system. |
| URI: | http://hdl.handle.net/10037/1174 |
| Abstract: | Argos is a middleware platform developed at the University of Tromsø. It provides tailored, flexible and extensible middleware support. In this thesis we suggest a new approach to creating user services for Argos by using a rule engine to setup the program flow for components in Argos. The users are provided with a graphical tool where they can set up rules that can trigger an action. The input, called a fact, to the rule and the action that is triggered has to be picked from the methods of the components in Argos. These fact/ action-methods are component methods annotated with fact/action annotation which is part of the created rule engine system service for Argos. The created rule engine system service also provides an API that is available to all programmers that want to use rules in their Argos components. There are many advantages to expressing functionality trough rules opposed to conventional declarative programming. By only telling the program what to do and not how to do it, rules are more easily understood by humans. This can benefit both the experienced programmer and the non-technical partner in a project. Lifestyle diseases are a growing problem in Western Europe and North-America. An application, realized trough the rule editor tool, for monitoring a user’s activity and give feedback will also be presented. |
| URI: | http://hdl.handle.net/10037/1409 |
| Abstract: | In biology the introduction next generation technology is increasing the amount of data generated rapidly. New sequencing machines are able to produce terabytes of genomic data in days and in later years the cost of storing data has become higher than to produce it. With enormous amounts of data arrives great opportunities, but also new challenges; how should biologists analyze and interpret the results? Going through terabytes of data manually is time consuming, and is in reality not practical. Because of this bioinformatics are working together with computer scientists to create programs that can parse, integrate, analyze and visualize data in ways that can aid the biologist to extract novel biological knowledge from it. |
| URI: | http://hdl.handle.net/10037/3523 |
| Abstract: | Web services enable businesses to deliver services via the Web. In addition, Web services can be used to improve business efficiency, because Web services can often replace manual activities in a business process. A Web service can be composed of other simpler Web services using the abstraction traditionally known as workflows. The process of controlling the correct and reliable execution of a workflow is known as workflow enactment, but it can also be referred to as Web services orchestration. A centralized approach to Web services orchestration is not an optimal solution, when considering the decentralized nature of Web services and the Internet. The problem is that a centralized workflow engine can easily become a communication and processing bottleneck as well as a central point of failure. Therefore, a decentralized approach to Web services orchestration is needed in order to overcome these obstacles. However, some decentralized approaches require static analysis of workflow specifications, which implies that resources must be allocated prior to the workflow execution. As a result, resources are wasted. In this thesis a prototype is developed to demonstrate a decentralized Web services orchestration based on continuation-passing enactment of distributed workflows. This decentralized approach does not require any pre-allocation of resources, nor is it subject to the limitations of a centralized approach. The continuation-passing mechanism involves continuations, or the reminder of the executions, which are passed along asynchronous messages for workflow enactment. |
| URI: | http://hdl.handle.net/10037/1355 |
| Abstract: | The duration of video playlists, might be a problem when watching on mobile devices, while on the go. We are exploring the problem of how to reduce the size of a video playlist, while maintain the important parts of the videoclips in the playlist. We have designed algorithms that automatically can cut down a playlist by cutting the duration of clips or sometimes even removing clips. We have shown that our algorithm is better than a naive solution that just cut at the end. Furthermore we have looked at playlist cutting for Davvi. This means playlist cutting for the soccer domain. We have created a hint based cutting algorithm that uses domain knowledge to achieve good results compared to the other algorithms available. |
| URI: | http://hdl.handle.net/10037/2636 |
| Abstract: | Recently, television broadcasters such as the NRK and TV2 channels, have begun offering live internet television and movie archive along with their regular schedule, much like the known video archives such as Youtube and Vimeo. The amount of all television offered reduces the ability of the user to get an overview of the programs that are available at any given time, making the user will probably miss important events. Regular indexing engines for recommending does not generally work on media since it is hard to index media data. Tags and keywords describing a media le does only describe the whole le, making it difficult to use them for indexing and recommendation of specific scenes within the media. This thesis presents a text event detection system for discovering interesting events based on video subtitles. By performing textual analytics, our system is able to discover events that are not discoverable through regular syntactic search. We have, based on related work, extended algorithms used for discovering semantic relationships between different words. Also, we have experimented with several algorithm for capturing the essence of each sentence, relating the prominent sense of each sense towards the events. Our experiments illustrates how we can increase the accuracy of the algorithm used by performing a context exploration based on event keywords. The results shows that our system improved the base algorithm of the prototype by including more relevance methods like consecutive sentence similarity and similarity based on sentence internals. |
| URI: | http://hdl.handle.net/10037/3521 |
| Abstract: | Applications that adapt to environmental and situational changes are difficult to build because computers cannot capture, represent or process context information as easily as human beings. Nevertheless, context information is very valuable because it allows applications to be made more user-friendly, flexible, and adaptable. This realization has spawned a multitude of research efforts to simplify development of context-sensitive applications. A result of one of these research efforts is the Argos middleware platform, which is an application server created specifically for personal applications that can adapt to changes in their environment. Applications that rely on context information must often collect this information from external measurement devices, commonly known as sensors. These devices respond directly to physical stimulus to produce meaningful information about their surroundings. Typical examples are sensors that produce location, temperature or motion information, but they can also, for instance, be devices that monitors the physical condition of a person. The goal of this thesis has been to design, develop and evaluate functionality for the Argos middleware platform that makes it easier for Argos applications to collect and use sensor measurements. The functionality has been developed in collaboration with the National Center for Telemedicine (NST) who wants to use Argos for monitoring patients. They intend to develop a system that can give patients semi-automatic feedback and advice on how to maintain and improve their lifestyle. To do this they want to use personal sensors that monitor attributes relevant to a patient's condition. The functionality developed in this thesis has provided a starting point for NST to develop their system and contributed lots of technical information that will prove useful for their project. |
| URI: | http://hdl.handle.net/10037/1137 |
| Abstract: | Current GPUs have many times the memory bandwidth and computing power compared to CPUs. The difference in performance is getting bigger as the evolution speed of the GPUs is higher than of the CPUs. This make it interesting to use the GPU for general purpose computing (GPGPU). I begin by looking at the architecture of the GPU, and some different techniques for programming on a GPU, including some of the available high-level languages. I have implemented the Mandelbrot computation on a cluster of GPUs (the HPDC display wall), and compared it against two different CPU implementations on the cluster. I have also implemented the Mandelbrot computation in both Cg and Brook, and compared the performance of the two languages. My experimental study shows that the GPU implementation of the Mandelbrot application is up to twice as fast as the load-balanced CPU implementation on the cluster of 28 computers, and up to 6 times faster on one computer. |
| URI: | http://hdl.handle.net/10037/1565 |
| Abstract: | Software systems today are becoming larger and more complex, resulting in a growing need for good and efficient testing routines. An approach used by several software developers is to automate the test process. Test automation has the benefits that it reduces the time of the testing process and that automated tests are more accurate and precise than manual tests.
Manufacturers who wish to develop products using the Bluetooth technology, the Bluetooth logo and trademark has to go through a qualification program. This program is expensive, thus the manufacturer has incentives to make sure that the product is well tested before sending it to qualification. A Bluetooth stack is an example of a product that must be qualified. An automated tool for testing of Bluetooth stacks is therefore desired. FAT is a framework that provides functionality to write and execute tests on a Bluetooth stack. The framework makes use of the ability to stitch generic test layers in-between the layers of the stack. These test layers can operate on messages passing through the stack. Our test layers provide an API to insert, modify, copy and delete messages. FAT introduces a test system client (TSC) where a tester can write tests and choose tests for execution. The tests are written in Java, where each test is a single method. The tester uses the test layer’s API to interface with the stack. The communication mechanism between the TSC and the test layer is XML-RPC. The TSC may therefore be executed on a different node than the stack itself. This thesis motivates FAT, and describes how the framework is designed and implemented. |
| URI: | http://hdl.handle.net/10037/233 |
| Abstract: | This thesis investigates how head tracking can be implemented by using inexpensive off-the-shelf hardware for a 6 x 3 meter high-resolution display wall. The tracking system has been integrated into to an existing event system, Shout, that allows for inter-program communication. An application called htsim has been developed that is used for testing different head tracking configurations in a virtual environment. Developing in a virtual environment does not require access to head tracking hardware. Tracking algorithms developed in the virtual environment can directly be used for head tracking in a physical environment. The tracking system is able to track a user's head with cameras that are placed behind the user. htsim is also used for configuring the head tracking system used in the physical environment. Experiments detail out the overall latency in the system and sources of jitter. |
| URI: | http://hdl.handle.net/10037/2634 |
| Abstract: | The widespread use of digital cameras and mobile phones, along with a rapidly growth of image sharing, challenges current image retrieval techniques. It is difficult for image retrieval system to find the semantic meaning of images based on human’s subjectivity and the size of current image databases makes it difficult to organize and search images. This thesis shows that information retrieval techniques can be used to reduce the search space of existing image collections, by creating collection summaries that holds only the most representative metadata from existing image collections. The representative metadata are metadata that are most distinguishing for the specific image collection. The system take advantage of the metadata available for images, which includes user provided tags, date/time, GPS coordinates, and metadata augmented by the system using already available metadata. Higher level representations of user provided terms are located and ensures that the system captures the most descriptive properties of the image collections. The system designed is able to produce collection summaries that capture properties of an image collection that support human’s natural perception as long as enough metadata are available. Also, the system increase the contextual understanding of images as long as date/time (of capture) and GPS coordinates is available for all or some of the images in the collection. The evaluation of the system indicates that grouping user provided terms into higher level representations is very useful for capturing the most important properties of an image collection. Also the evaluation expresses the usefulness of augmenting images with additional metadata and converting numeric metadata into readable terms. The comparisons made in the evaluation indicates that not only are the collection summaries similar to individual test users perception of image collections, but the summaries also includes more descriptive information of relevance. |
| URI: | http://hdl.handle.net/10037/3657 |
| Abstract: | There is a continuing desire and need for improving the processes of describing and searching for digital images. While good progress has been made adapting traditional information retrieval techniques to perform these tasks, processing images still presents a number of challenges not encountered when working with just text. This project implements a system allowing for the indexing and searching of collections of images where images are not individually described. Such collections are typically largely unsuitable data material for traditional text-based image search systems. The basic idea underlying this system is to not search for images directly, but instead first search for the collections they are part of. When a set of relevant collections have been found, one can then apply the collection-level semantics to the images belonging to these collections. An important concept in this project is that one image can be a part of several collections. Such images can be identified when collection information is added to the system, allowing one to link the same image to several collections before searches are run. Semantic information from several different collections can then be applied to the same image, potentially giving a better idea of what the image actually depicts. |
| URI: | http://hdl.handle.net/10037/1881 |
Now showing items 12-30 of 30
Munin is powered by DSpace 1.8.2
The University Library of Tromsø, N-9037 Tromsø
Tel: +47 77 64 40 00, E-mail: munin@ub.uit.no