Background. With the rise of Internet of Things and Internet connected devices many things become convenient and efficient but these products also carry risks. Even though a lot of people own devices like this not so many think of the consequences if these devices aren't secure. Objectives. Given this our thesis aims to discover the implications of vulnerable devices and also at what rate there are insecure, unpatched devices compared to the patched, secure counterpart. Methods. The approach implemented uses Shodan to find these devices on the internet and also to find version information about each device. After the devices are found the objective is to calculate a CVSS score on the vulnerabilities and the exploit that can abuse the vulnerability, if there exists any. Results. What we found was that 71.85% of a smart home server brand was running an insecure version. As to the consequences of having an insecure device, it can be severe.Conclusions. We found that, for instance, an attacker can without much difficulty shut off alarms in your smart home and then proceed to break into your house. Keywords: Vulnerability; Shodan; Internet of Things (IoT); Patching

<p>Fuzzing, a technique for negative testing of programs using randomly mutated or gen?erated input data, is responsible for the discovery of thousands of bugs in software from web browsers to video players. Advances in fuzzing focus on various methods for enhancing the number of bugs found and reducing the time spent to find them by applying various static, dynamic, and symbolic binary analysis techniques. As a stochastic process, fuzzing is an inherently inefficient method for discovering bugs residing in deep logic of programs due to the compounding complexity of preconditions as paths in programs grow in length. We propose a novel system to overcome this limitation by abstracting away path-constraining preconditions from a statement level to a function level by identifying impeding functions, functions that inhibit control flow from proceeding. REFACE is an end-to-end system for enhancing the capabilities of an existing fuzzer by generating variant binaries that present an easier-to-fuzz interface and expands an ongoing fuzzing campaign with minimal offline overhead. REFACE operates entirely on binary programs, requiring no source code or sym?bols to run, and is fuzzer-agnostic. This enhancement represents a step forward in a new direction toward abstraction of code that has historically presented a significant barrier to fuzzing and aims to make incremental progress by way of several ancillary dataflow analysis techniques with potential wide applicability. We attain a significant improvement in speed of obtaining maximum coverage, re-discover one known bug, and discover one possible new bug in a binary program during evaluation against an un-modified state-of-the-art fuzzer with no augmentation.</p>

No description available.

The rapid emergence of embedded devices and sensor networks that frequently exchange object-level images foretells an increasing reliance on object-level systems. Additionally, nearly all computing systems, including control systems, enterprise applications, scientific codes and dynamic libraries operate eventually at the object code level. Studying adaptivity and runtime composition issues in such systems is becoming an important focus of systems research. In this thesis, we describe an object-level framework that will manipulate an object module to instrument control functionality and adaptivity in order to realize complex compositional scenarios. Using function and parameter remapping capabilities, our framework transcends programming language and design boundaries, and enables applications to adapt dynamically during runtime. We introduce the capability to "restart" an application automatically, a feature we utilize to support adaptivity not only spatially, over the algorithm domain, but temporally as well. A high-level adaptive control language based on XML is presented that allows complex adaptive scenarios to be expressed concisely. Additionally, the construction of several adaptive scenarios using our framework is illustrated, along with several experiments in ``learning adaptivity`` using reinforcement learning techniques. / Master of Science

Les logiciels de patching audio traditionnels, tels que Max ou Pure Data, sont des environnements qui permettent de concevoir et d’exécuter des traitements sonores en temps réel. Ces logiciels sont mono-utilisateurs, or, dans bien des cas, les utilisateurs ont besoin de travailler en étroite collaboration à l’élaboration ou à l’exécution d’un même traitement. C’est notamment le cas dans un contexte pédagogique ainsi que pour la création musicale collective. Des solutions existent, mais ne conviennent pas forcément à tous les usages. Aussi avons-nous cherché à nous confronter de manière concrète à cette problématique en développant une nouvelle solution de patching audio collaborative, baptisée Kiwi, qui permet l’élaboration d’un même traitement sonore à plusieurs mains de manière distribuée. À travers une étude critique des solutions logicielles existantes nous donnons des clefs de compréhension pour appréhender la conception d’un système multi-utilisateur de ce type. Nous énonçons les principaux verrous que nous avons eu à lever pour rendre cette pratique viable et présentons la solution logicielle. Nous exposons les possibilités offertes par l’application et les choix de mise en œuvre techniques et ergonomiques que nous avons faits pour permettre à plusieurs personnes de coordonner leurs activités au sein d’un espace de travail mis en commun. Nous revenons ensuite sur différents cas d’utilisation de ce collecticiel dans un contexte pédagogique et de création musicale afin d’évaluer la solution proposée. Nous exposons enfin les développements plus récents et ouvrons sur les perspectives futures que cette application nous permet d’envisager. / Traditional audio patching software, such as Max or Pure Data, are environments that allow you to design and execute sound processing in real time. These programs are single-user, but, in many cases, users need to work together and in a tight way to create and play the same sound processing. This is particularly the case in a pedagogical context and for collective musical creation. Solutions exist, but are not necessarily suitable for all uses. We have tried to confront this problem in a concrete way by developing a new collaborative audio patching solution, named Kiwi, which allows the design of a sound processing with several hands in a distributed manner. Through a critical study of the existing software solutions we give keys of comprehension to apprehend the design of a multi-user system of this type. We present the main barriers that we had to lift to make this practice viable and present the software solution. We show the possibilities offered by the application and the technical and ergonomic implementation choices that we have made to allow several people to coordinate their activities within a shared workspace. Then, we study several uses of this groupware in pedagogical and musical creation contexts in order to evaluate the proposed solution. Finally, we present the recent developments and open up new perspectives for the application.

No description available.

For more than a decade, streaming media services, including on-line conferences, distance education and movie broadcasting, have gained much popularity on the Internet. Due to the high bandwidth requirements and long lived nature of video streaming, it requires huge transmission cost to support these streaming media services. In addition, how to adapt rich multimedia content to satisfy various resource-constrained devices presents a challenge. The limited and time-varying network bandwidth complicates the content adaptation tasks. Differentiated content delivery may be required to meet diverse client profiles and user preferences. Therefore, in order to reduce transmission cost to serve heterogeneous clients for efficient streaming, in this dissertation, several novel schemes including transcoding-enable proxy caching scheme, reactive transmission schemes, and network coding P2P content distribution scheme, are proposed to support efficient multiple-version and layered video delivery in the proxy-attached network environment as well as to provide efficient interactive IPTV service in a peer-to-peer network. Firstly, for multiple-version cache consideration in the transcoding-enable proxy, we focus on reducing the required server bandwidth and startup delay by caching the optimal versions of the video. A generalized video object profit function is derived from the extended weighted transcoding graph to calculate the individual cache profit of certain version of a video object, and the aggregate profit from caching multiple versions of the same video object. This proposed function takes into account the popularity of certain version of a video object, the transcoding delay among versions and the average access duration of each version. Based on the profit function, cache replacement algorithms are proposed to reduce the startup delay and network traffic by efficiently caching video objects with maximum profits. Next, a set of proxy-assisted transmission schemes are proposed to reduce the transmission cost for layered video streaming by integrating the proxy caching with reactive transmission schemes, peer-to-peer mesh networks and multicast capability. These proposed transmission schemes make multiple requests to be serviced by the single transmission and thus to significantly reduce the total required transmission cost. The optimal proxy prefix cache allocation is also calculated for each transmission scheme to identify the cache layers and cache length of each video to minimize the aggregate transmission cost. The process considers the fact that reduction in transmission cost by caching X layers of a video is not only from requests on X layers, but also from requests on less than X layers. Finally, we proposed a network coding equivalent content distribution (NCECD) scheme to decrease server stress, startup delay and jumping latency to support random access operations which are desirable for peer-to-peer on-demand video streaming. The random access operations are difficult to be efficiently supported, due to the asynchronous interactive behaviors of users and the dynamic nature of peers. In NCECD, videos are divided into segments which are then further divided into blocks. These blocks are then encoded into independent encoded blocks that are distributed to the local storage of different peers. With NCECD, a new client only needs to connect to a sufficient number of parent peers in order to view the whole video and rarely needs to find new parents when performing random access operations. Whereas most existing methods must search for parent peers containing interested segments, NCECD uses the properties of network coding to cache equivalent content on most peers, so that searches are rarely needed. The analysis of system parameters is given to achieve reasonable block loss rates for peer-to-peer interactive video-on-demand streaming. Experimental results demonstrate that these proposed schemes can lead to significant transmission cost saving, high delay saving ratio, high bandwidth saving ratio, low startup and jumping searching delays, connecting to a new parent peer delay and less server resources. Hence, these proposed schemes can further be integrated and utilized to build an efficient video streaming platform for providing high-performance and high-quality IPTV services to a diversity of clients.

Over the last 20 years, electricity markets around the world have gradually been deregulated, creating wholesale markets in which generating companies compete for the right to supply electricity, through an offering system. This thesis considers the optimisation of the offering process from the perspective of an individual generator, subject to intertemporal constraints including fuel limitations, correlated rest-of-market behaviour patterns and unit operational decisions. Contributions from the thesis include a Pre-Processing scheme that results in considerable computational benefits for a two-level Dynamic Programming method, in addition to the development of a new process that combines the techniques of Decision Analysis and Dynamic Programming.

Följsamheten av ocklusionsbehandling hos barn med amblyopi är bristfällig. Det finns begränsat med forskning om vilka erfarenheter vårdpersonal har av denna bristande följsamhet, och det vore därför av intresse att undersöka vilka åtgärder ögonsjuksköterskor upplever kan vidtas för att främja följsamheten. Syftet med pilotstudien var därför att undersöka hur ögonsjuksköterskan kan främja följsamhetenav ocklusionsbehandling. Studien genomfördes som en beskrivande, kvalitativ pilotstudie med induktiv ansats där data analyserades med manifest kvalitativ dataanalys. I resultatet framkom fem kategorier, vilka påvisade vikten av att ögonsjuksköterskor tänker på att bemöta vårdnadshavare och barn med ett icke-dömande förhållningssätt, att ge tydlig och individanpassad information både muntligt och skriftligt, samt olika praktiska råd kring själva genomförandet av behandlingen. I resultatet framkom även vikten av att skapa en personlig relation vårdpersonal, vårdnadshavare och barn emellan och betydelsen av täta återbesök, samt hur ett gott samarbete och stöd kollegor emellan kan främja följsamheten. Rekommendationer för vårdverksamhet är bland annat att ge vårdnadshavare och barn kontinuitet vid besöken och rekommendationer för utbildning inom omvårdnad att lära ut vikten av ett positivt förhållningssätt och att ställa öppna frågor. Större studier med samma syfte är av intresse, samt forskning kring hur information på internet påverkar följsamheten. / Adherence to occlusion therapy with amblyopic children is inadequate. There is limited with research about medical staff’s experiences of inadequate occlusion therapy. Therefore it is of importance investigating which arrangements ophthalmic nurses’ perceive can be taken to improve adherence. The purpose of this pilot study was to investigate how ophthalmic nurses can improve adherence to occlusion therapy. The study was conducted as a descriptive, qualitative pilot study with an inductive approach where data was analyzed with manifest qualitative content analysis. Five different categories were revealed and showed the importance of a non-judgmental attitude among ophthalmic nurses towards the child and the caregivers, the importance of giving both verbal and written comprehensible, individualized information. Practical advice about carrying out the occlusion therapy emerged in the data along with the importance of creating a personal relationship between the medical staff and the child/caregiver. Frequent revisits were seen as important, and good support and cooperation between colleagues was believed to be able to improve adherence. Recommendations for care activities is to give the child and the caregivers continuity during visits and a recommendation for nursingeducation is to teach the importance of a positive attitude and open-ended questions. Larger studies with the same purpose are of interest, also further research of how information on the internet affects adherence to occlusion therapy.

This paper describes information about current most widespread methods, which are used by rootkits. It contains basic information connected with development of rootkits, such as process registers, memory protection and native API of Windows operation system. The primary objective of this paper is to provide overview of techniques, such as hooking, code patching and direct kernel object modification, which are used by rootkits and present methods to detect them. These methods will be then implemented by detection and removal tools of rootkits based on these techniques.