Beam: Ending Monolithic Applications for Connected Devices

Total Page:16

File Type:pdf, Size:1020Kb

Beam: Ending Monolithic Applications for Connected Devices Beam: Ending Monolithic Applications for Connected Devices Chenguang Shen (UCLA)∗ Rayman Preet Singh (Samsung Research)∗ Amar Phanishayee Aman Kansal Ratul Mahajan Microsoft Research Abstract— The proliferation of connected sensing de- broad distribution of their applications because the cost vices (or Internet of Things) can in theory enable a range of deploying their specific hardware limits user adoption. of applications that make rich inferences about users and Second, for end users, each sensing device they install is their environment. But in practice developing such appli- limited to a small set of applications, even though the cations today is arduous because they must implement all hardware capabilities may be useful for a broader set of data sensing and inference logic, even as devices move applications. How do we break free from this monolithic or are temporarily disconnected. We develop Beam, a and restrictive setting? Can we enable applications to be framework that simplifies IoT applications by letting programmed to work seamlessly in heterogeneous envi- them specify “what should be sensed or inferred,” with- ronments with different types of connected sensors and out worrying about “how it is sensed or inferred.” Beam devices, while leveraging devices that may only be avail- introduces the key abstraction of an inference graph to able opportunistically, such as smartphones and tablets? decouple applications from the mechanics of sensing and To address this problem, we start from an insight that drawing inferences. The inference graph allows Beam to many inferences required by applications can be drawn address three important challenges: (1) device selection using multiple types of connected devices. For instance, in heterogeneous environments, (2) efficient resource us- home occupancy can be inferred by either detecting mo- age, and (3) handling device disconnections. Using Beam tion or recognizing people in images, with data sampled we develop two diverse applications that use several dif- from motion sensors (such as those in security systems or ferent types of devices and show that their implementa- Nest [12]), cameras (e.g. Dropcam [4], Simplicam [18]), × tions required up to 12 fewer source lines of code while microphone, smartphone GPS, or using a combination of × resulting in up to 3 higher inference accuracy. these sensors, since each may have different sources of 1 Introduction errors. We posit that inference logic, traditionally left up to applications, ought to be abstracted out as a system Connected sensing devices, such as cameras, ther- service, thus decoupling “what is sensed and inferred” mostats, in-home motion, door-window, energy, wa- from “how it is sensed and inferred”. Such decoupling ter sensors [2], collectively dubbed as the Internet of enables applications to work in heterogeneous environ- Things (IoT), are rapidly permeating our living environ- ments with different sensing devices while at the same ments [3], with an estimated 50 billion such devices in time benefiting from shared and well trained inferences. use by 2020 [34]. In theory, they enable a wide variety Consequently, there are three key challenges in design- of applications spanning security, efficiency, healthcare, ing such a service: and others. But in practice, developing IoT applications Device selection: The service must be able to select the is arduous because the tight coupling of applications to appropriate devices in a deployment that can satisfy an specific hardware requires each application to implement application’s inference request (including inference ac- the data collection logic from these devices and the logic curacy). Device selection helps applications to run in het- to draw inferences about the environment or the user. erogeneous deployments. It also helps applications to op- Unfortunately, this monolithic approach where appli- erate in settings with user mobility where the set of us- cations are tightly coupled to the hardware, is limiting able devices may change over time. Moreover, applica- in two important ways. First, for application developers, tions can leverage multiple available devices to improve this complicates the development process, and hinders inference accuracy, as shown in Figure 1. ∗Work done during an internship at Microsoft Research Efficiency: For inferences that are computationally ex- 1 100 Set 1 HomeOS [33], thus enabling the development of a vari- 95 Set 2 ety of inference modules. We find that for these applica- Set 1 ∪ Set 2 90 tions: 1) using Beam’s abstractions results in up to 4.5× 85 fewer development tasks and 12× fewer source lines of 80 code with negligible runtime overhead; 2) inference ac- × 75 curacy is 3 higher due to Beam’s ability to select de- vices in the presence of user mobility; and 3) network re- Average Inference Accuracy (%) 70 Occupancy Activity source usage due to Beam’s dynamic graph partitioning Figure 1: Improvement in occupancy and activity in- matches hand-optimized versions for the applications. ference accuracy by combining multiple devices in a lab deployment. For occupancy, sensor set 1 = 2 Beam Overview fcamera, microphoneg in one room and set 2 =fPC In this section, we first describe two representative interactivity detectiong in a second room. For physi- classes of applications and distill the challenges an infer- cal activity, set 1 = fphone accelerometerg and set 2 = ence framework should address. Next, we describe the fwrist worn FitBit [5]g. key abstractions central to Beam’s design in addressing pensive to run locally on user devices, or to support de- the identified challenges. ployments that span geographical boundaries, the service 2.1 Example Applications should be able to offload computation to remote servers. In doing so, the service should partition computation Our motivation for designing Beam are data-driven- while efficiently using network bandwidth. inference based applications, aimed at homes [12, 19], Disconnection tolerance: The service should be able to individual users [11, 14, 59, 69, 72] and enterprises [8, handle dynamics that can arise due to device disconnec- 16, 24, 46, 60]. We identify the challenges of building tions and user mobility. an inference framework by analyzing two popular appli- To address these challenges concretely, we propose cation classes in detail, one that infers environmental at- Beam, an application framework and associated runtime tributes and another that senses an individual user. which provides applications with inference-based pro- Rules: A large class of popular applications is based on gramming abstractions. It introduces the key abstraction the ‘If This Then That (IFTTT)’ pattern [9, 67]. IFTTT of an inference graph to not only decouple applications enables users to create their own rules connecting sensed from the mechanics of sensing and drawing inferences, attributes to desired actions. We consider a particular but also directly aid in addressing the challenges iden- rules application which alerts a user if a high risk appli- tified above. Applications simply specify their inference ance, e.g., electric oven, is left on when the home is un- requirements, while the Beam runtime bears the onus of occupied [64]. This application uses the appliance-state identifying the required sensors in the given deployment and home occupancy inferences. and constructing an appropriate inference graph. Quantified Self (QS) [11, 14, 23, 35, 53] disaggregates Inference graphs are made up of modules which are a user’s daily routine by tracking her physical activity processing units that encapsulate inference algorithms; (walking, running, etc), social interactions (loneliness), modules can use the output of other modules for their mood (bored, focused), computer use, and more. processing logic. Beam introduces three simple building Using these two popular classes of applications we ad- blocks that are key to constructing and maintaining the dress three important challenges they pose: device selec- inference graph: typed inference data units (IDUs) which tion, efficiency, and disconnection tolerance, as detailed guide module composability, channels that abstract all in Section 1. Next, we explain the key abstractions in inter-module communications, and coverage tags that aid Beam aimed at tackling these challenges. in device selection. The Beam runtime instantiates the 2.2 Beam Abstractions inference graph by selecting suitable devices and assign- ing computational hosts for each module. Beam also mu- In Beam, application developers only specify their de- tates this assignment by partitioning the graph at runtime sired inferences. To satisfy the request, Beam bears the for efficient resource usage. Beam’s abstractions and run- onus of identifying the required sensors and inference time together provide disconnection tolerance. algorithms in the given deployment and constructing an Our implementation of the Beam runtime works inference graph. across Windows PCs, tablets, and phones. Using the Inference Graphs are directed acyclic graphs that con- framework, we develop two realistic applications, eight nect devices to applications. The nodes in this graph cor- different types of inference modules, and add native respond to inference modules and edges correspond to support for many different types of sensors. Further, channels that facilitate the transmission of inference data Beam supports all device abstractions provided by units (IDUs) between modules. While these abstractions 2 Quantified Self App Fitness Activity
Recommended publications
  • Recursive Definitions Across the Footprint That a Straight- Line Program Manipulated, E.G
    natural proofs for verification of dynamic heaps P. MADHUSUDAN UNIV. OF ILLINOIS AT URBANA-CHAMPAIGN (VISITING MSR, BANGALORE) WORKSHOP ON MAKING FORMAL VERIFICATION SCALABLE AND USEABLE CMI, CHENNAI, INDIA JOINT WORK WITH… Xiaokang Qiu .. graduating! Gennaro Andrei Pranav Garg Parlato Stefanescu GOAL: BUILD RELIABLE SOFTWARE Build systems with proven reliability and security guarantees. (Not the same as finding bugs!) Deductive verification with automatic theorem proving • Floyd/Hoare style verification • User supplied modular annotations (pre/post cond, class invariants) and loop invariants • Resulting verification conditions are derived automatically for each linear program segment (using weakest-pre/strongest-post) Verification conditions are then proved valid using mostly automatic theorem proving (like SMT solvers) TARGET: RELIABLE SYS TEMS SOFTWARE Operating Systems Angry birds Browsers Excel VMs Mail clients … App platforms Systems Software Applications Several success stories: • Microsoft Hypervisor verification using VCC [MSR, EMIC] • A secure foundation for mobile apps [@Illinois, ASPLOS’13] A SECURE FOUNDATION FOR MOBILE APPS In collaboration with King’s systems group at Illinois First OS architecture that provides verifiable, high-level abstractions for building mobile applications. Application state is private by default. • Meta-data on files controls access by apps; only app with appropriate permissions can access files • Every page is encrypted before sending to the storage service. • Memory isolation between apps • A page fault handler serves a file- backed page for a process, the fille has to be opened by the same process. • Only the current app can write to the screen buffer. • IPC channel correctness • … VERIFICATION TOOLS ARE MATURE And works! ENOUGH TO BUILD RELIABLE S/W.
    [Show full text]
  • Type 2 Diabetes Prediction Using Machine Learning Algorithms
    Type 2 Diabetes Prediction Using Machine Learning Algorithms Parisa Karimi Darabi*, Mohammad Jafar Tarokh Department of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran Abstract Article Type: Background and Objective: Currently, diabetes is one of the leading causes of Original article death in the world. According to several factors diagnosis of this disease is Article History: complex and prone to human error. This study aimed to analyze the risk of Received: 15 Jul 2020 having diabetes based on laboratory information, life style and, family history Revised: 1 Aug 2020 with the help of machine learning algorithms. When the model is trained Accepted: 5 Aug 2020 properly, people can examine their risk of having diabetes. *Correspondence: Material and Methods: To classify patients, by using Python, eight different machine learning algorithms (Logistic Regression, Nearest Neighbor, Decision Parisa Karimi Darabi, Tree, Random Forest, Support Vector Machine, Naive Bayesian, Neural Department of Industrial Network and Gradient Boosting) were analyzed. Were evaluated by accuracy, Engineering, K. N. Toosi University sensitivity, specificity and ROC curve parameters. of Technology, Tehran, Iran Results: The model based on the gradient boosting algorithm showed the best [email protected] performance with a prediction accuracy of %95.50. Conclusion: In the future, this model can be used for diagnosis diabete. The basis of this study is to do more research and develop models such as other learning machine algorithms. Keywords: Prediction, diabetes, machine learning, gradient boosting, ROC curve DOI : 10.29252/jorjanibiomedj.8.3.4 people die every year from diabetes disease. Introduction By 2045, it will reach 629 million (1).
    [Show full text]
  • Scalable Fault-Tolerant Elastic Data Ingestion in Asterixdb
    UC Irvine UC Irvine Electronic Theses and Dissertations Title Scalable Fault-Tolerant Elastic Data Ingestion in AsterixDB Permalink https://escholarship.org/uc/item/9xv3435x Author Grover, Raman Publication Date 2015 License https://creativecommons.org/licenses/by-nd/4.0/ 4.0 Peer reviewed|Thesis/dissertation eScholarship.org Powered by the California Digital Library University of California UNIVERSITY OF CALIFORNIA, IRVINE Scalable Fault-Tolerant Elastic Data Ingestion in AsterixDB DISSERTATION submitted in partial satisfaction of the requirements for the degree of DOCTOR OF PHILOSOPHY in Information and Computer Science by Raman Grover Dissertation Committee: Professor Michael J. Carey, Chair Professor Chen Li Professor Sharad Mehrotra 2015 © 2015 Raman Grover DEDICATION To my wonderful parents... ii TABLE OF CONTENTS Page LIST OF FIGURES vi LIST OF TABLES viii ACKNOWLEDGMENTS ix CURRICULUM VITAE x ABSTRACT OF THE DISSERTATION xi 1 Introduction 1 1.1 Challenges in Data Feed Management . .3 1.1.1 Genericity and Extensibility . .3 1.1.2 Fetch-Once Compute-Many Model . .5 1.1.3 Scalability and Elasticity . .5 1.1.4 Fault Tolerance . .7 1.2 Contributions . .8 1.3 Organization . .9 2 Related Work 10 2.1 Stream Processing Engines . 10 2.2 Data Routing Engines . 11 2.3 Extract Transform Load (ETL) Systems . 12 2.4 Other Systems . 13 2.4.1 Flume . 14 2.4.2 Chukwa . 15 2.4.3 Kafka . 16 2.4.4 Sqoop . 17 2.5 Summary . 17 3 Background and Preliminaries 19 3.1 AsterixDB . 19 3.1.1 AsterixDB Architecture . 20 3.1.2 AsterixDB Data Model . 21 3.1.3 Querying Data .
    [Show full text]
  • Anomaly Detection and Identification Scheme for VM Live Migration in Cloud Infrastructure✩
    Future Generation Computer Systems 56 (2016) 736–745 Contents lists available at ScienceDirect Future Generation Computer Systems journal homepage: www.elsevier.com/locate/fgcs Anomaly detection and identification scheme for VM live migration in cloud infrastructureI Tian Huang a, Yongxin Zhu a,∗, Yafei Wu a, Stéphane Bressan b, Gillian Dobbie c a School of Microelectronics, Shanghai Jiao Tong University, China b School of Computing, National University of Singapore, Singapore c Department of Computer Science, University of Auckland, New Zealand h i g h l i g h t s • We extend Local Outlier Factors to detect anomalies in time series and adapt to smooth environmental changes. • We propose Dimension Reasoning LOF (DR-LOF) that can point out the ``most anomalous'' dimension of the performance profile. DR-LOF provides clues for administrators to pinpoint and clear the anomalies. • We incorporate DR-LOF and Symbolic Aggregate ApproXimation (SAX) measurement as a scheme to detect and identify the anomalies in the progress of VM live migration. • In experiments, we deploy a typical computing application on small scale clusters and evaluate our anomaly detection and identification scheme by imposing two kinds of common anomalies onto VMs. article info a b s t r a c t Article history: Virtual machines (VM) offer simple and practical mechanisms to address many of the manageability Received 3 March 2015 problems of leveraging heterogeneous computing resources. VM live migration is an important feature Received in revised form of virtualization in cloud computing: it allows administrators to transparently tune the performance 11 May 2015 of the computing infrastructure. However, VM live migration may open the door to security threats.
    [Show full text]
  • A Decidable Logic for Tree Data-Structures with Measurements
    A Decidable Logic for Tree Data-Structures with Measurements Xiaokang Qiu and Yanjun Wang Purdue University fxkqiu,[email protected] Abstract. We present Dryaddec, a decidable logic that allows reason- ing about tree data-structures with measurements. This logic supports user-defined recursive measure functions based on Max or Sum, and re- cursive predicates based on these measure functions, such as AVL trees or red-black trees. We prove that the logic's satisfiability is decidable. The crux of the decidability proof is a small model property which al- lows us to reduce the satisfiability of Dryaddec to quantifier-free lin- ear arithmetic theory which can be solved efficiently using SMT solvers. We also show that Dryaddec can encode a variety of verification and synthesis problems, including natural proof verification conditions for functional correctness of recursive tree-manipulating programs, legal- ity conditions for fusing tree traversals, synthesis conditions for con- ditional linear-integer arithmetic functions. We developed the decision procedure and successfully solved 220+ Dryaddec formulae raised from these application scenarios, including verifying functional correctness of programs manipulating AVL trees, red-black trees and treaps, check- ing the fusibility of height-based mutually recursive tree traversals, and counterexample-guided synthesis from linear integer arithmetic specifi- cations. To our knowledge, Dryaddec is the first decidable logic that can solve such a wide variety of problems requiring flexible combination of measure-related, data-related and shape-related properties for trees. 1 Introduction Logical reasoning about tree data-structures has been needed in various applica- tion scenarios such as program verification [32,24,26,42,49,4,14], compiler opti- mization [17,18,9,44] and webpage layout engines [30,31].
    [Show full text]
  • Data Intensive Computing with Linq to Hpc Technical
    DATA INTENSIVE COMPUTING WITH LINQ TO HPC TECHNICAL OVERVIEW Ade Miller, Principal Program Manager, LINQ to HPC Agenda Introduction to LINQ to HPC Using LINQ to HPC Systems Management Integrating with Other Data Technologies The Data Spectrum One extreme is analyzing raw, unstructured data. The analyst does not know exactly what the data contains, nor LINQ to HPC what cube would be justified. The analyst needs to do ad-hoc analyses that may never be run again. Another extreme is analytics targeting a traditional data warehouse. The analyst Parallel Data knows the cube he or she wants to build, Warehouse and the analyst knows the data sources. What kind of Data? Large Data Volume . 100s of TBs to 10s of PBs New Questions & Non-Traditional data Types New Technologies New Insights . Unstructured & Semi structured . How popular is my product? . Weak relational schema . Distributed Parallel Processing . What is the best ad to serve? . Text, Images, Videos, Logs Frameworks . Is this a fraudulent transaction? . Easy to Scale on commodity hardware . MapReduce-style programming models New Data Sources . Sensors & Devices . Traditional applications . Web Servers . Public data Overview MOVING THE DATA TO THE COMPUTE So how does it work? FIRST, STORE THE DATA Data Intensive Computing with HPC Server Windows HPC Server 2008 R2 Service Pack 2 So how does it work? SECOND, TAKE THE PROCESSING TO THE DATA Data Intensive Computing with HPC Server var logentries = from line in logs where !line.StartsWith("#") select new LogEntry(line); var user = from access
    [Show full text]
  • Cloud Computing Paradigms for Pleasingly Parallel Biomedical
    Cloud Computing Paradigms for Pleasingly Parallel Biomedical Applications Thilina Gunarathne, Tak-Lon Wu, Jong Youl Choi, Seung-Hee Bae, Judy Qiu School of Informatics and Computing / Pervasive Technology Institute Indiana University, Bloomington. {tgunarat, taklwu, jychoi, sebae, xqiu}@indiana.edu Abstract Cloud computing offers exciting new approaches for scientific computing that leverages the hardware and software investments on large scale data centers by major commercial players. Loosely coupled problems are very important in many scientific fields and are on the rise with the ongoing move towards data intensive computing. There exist several approaches to leverage clouds & cloud oriented data processing frameworks to perform pleasingly parallel computations. In this paper we present three pleasingly parallel biomedical applications, 1) assembly of genome fragments 2) sequence alignment and similarity search 3) dimension reduction in the analysis of chemical structures, implemented utilizing cloud infrastructure service based utility computing models of Amazon Web Services and Microsoft Windows Azure as well as utilizing MapReduce based data processing frameworks, Apache Hadoop and Microsoft DryadLINQ. We review and compare each of the frameworks and perform a comparative study among them based on performance, efficiency, cost and the usability. Cloud service based utility computing model and the managed parallelism (MapReduce) exhibited comparable performance and efficiencies for the applications we considered. We analyze the variations in cost between the different platform choices (eg: EC2 instance types), highlighting the need to select the appropriate platform based on the nature of the computation. 1. Introduction Scientists are overwhelmed with the increasing amount of data processing needs arising from the storm of data that is flowing through virtually every field of science.
    [Show full text]
  • Characterization and Prediction of Deep Learning Workloads in Large-Scale GPU Datacenters
    Characterization and Prediction of Deep Learning Workloads in Large-Scale GPU Datacenters Qinghao Hu1,2 Peng Sun3 Shengen Yan3 Yonggang Wen1 Tianwei Zhang1∗ 1School of Computer Science and Engineering, Nanyang Technological University 2S-Lab, Nanyang Technological University 3SenseTime {qinghao.hu, ygwen, tianwei.zhang}@ntu.edu.sg {sunpeng1, yanshengen}@sensetime.com ABSTRACT 1 INTRODUCTION Modern GPU datacenters are critical for delivering Deep Learn- Over the years, we have witnessed the remarkable impact of Deep ing (DL) models and services in both the research community and Learning (DL) technology and applications on every aspect of our industry. When operating a datacenter, optimization of resource daily life, e.g., face recognition [65], language translation [64], adver- scheduling and management can bring significant financial bene- tisement recommendation [21], etc. The outstanding performance fits. Achieving this goal requires a deep understanding of thejob of DL models comes from the complex neural network structures features and user behaviors. We present a comprehensive study and may contain trillions of parameters [25]. Training a production about the characteristics of DL jobs and resource management. model may require large amounts of GPU resources to support First, we perform a large-scale analysis of real-world job traces thousands of petaflops operations [15]. Hence, it is a common prac- from SenseTime. We uncover some interesting conclusions from tice for research institutes, AI companies and cloud providers to the perspectives of clusters, jobs and users, which can facilitate the build large-scale GPU clusters to facilitate DL model development. cluster system designs. Second, we introduce a general-purpose These clusters are managed in a multi-tenancy fashion, offering framework, which manages resources based on historical data.
    [Show full text]
  • Ray: a Distributed Framework for Emerging AI Applications
    Ray: A Distributed Framework for Emerging AI Applications Philipp Moritz, Robert Nishihara, Stephanie Wang, Alexey Tumanov, Richard Liaw, Eric Liang, Melih Elibol, Zongheng Yang, William Paul, Michael I. Jordan, and Ion Stoica, UC Berkeley https://www.usenix.org/conference/osdi18/presentation/nishihara This paper is included in the Proceedings of the 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI ’18). October 8–10, 2018 • Carlsbad, CA, USA ISBN 978-1-939133-08-3 Open access to the Proceedings of the 13th USENIX Symposium on Operating Systems Design and Implementation is sponsored by USENIX. Ray: A Distributed Framework for Emerging AI Applications Philipp Moritz,∗ Robert Nishihara,∗ Stephanie Wang, Alexey Tumanov, Richard Liaw, Eric Liang, Melih Elibol, Zongheng Yang, William Paul, Michael I. Jordan, Ion Stoica University of California, Berkeley Abstract and their use in prediction. These frameworks often lever- age specialized hardware (e.g., GPUs and TPUs), with the The next generation of AI applications will continuously goal of reducing training time in a batch setting. Examples interact with the environment and learn from these inter- include TensorFlow [7], MXNet [18], and PyTorch [46]. actions. These applications impose new and demanding The promise of AI is, however, far broader than classi- systems requirements, both in terms of performance and cal supervised learning. Emerging AI applications must flexibility. In this paper, we consider these requirements increasingly operate in dynamic environments, react to and present Ray—a distributed system to address them. changes in the environment, and take sequences of ac- Ray implements a unified interface that can express both tions to accomplish long-term goals [8, 43].
    [Show full text]
  • Natural Proofs for Structure, Data, and Separation
    Natural Proofs for Structure, Data, and Separation XiaokangQiu PranavGarg AndreiS¸tef˘anescu P.Madhusudan University of Illinois at Urbana-Champaign, USA {qiu2, garg11, stefane1, madhu}@illinois.edu Abstract ing verification conditions has become very powerful. The latter We propose natural proofs for reasoning with programs that ma- process is often executed by automated logical decision procedures nipulate data-structures against specifications that describe the supported by SMT solvers, which have emerged as robust and pow- structure of the heap, the data stored within it, and separation and erful engines to automatically find proofs. Several techniques and framing of sub-structures. Natural proofs are a subclass of proofs tools have been developed [2, 16, 20] and there have been several that are amenable to completely automated reasoning, that pro- success stories of large software verification projects using this ap- vide sound but incomplete procedures, and that capture common proach (the Verve OS project [42], the Microsoft hypervisor veri- reasoning tactics in program verification. We develop a dialect of fication project using VCC [16], and a recent verified-for-security + separation logic over heaps, called Dryad, with recursive defini- OS browser for mobile applications [29], to name a few). tions that avoids explicit quantification. We develop ways to reason Verification conditions do not, however, always fall into decid- with heaplets using classical logic over the theory of sets, and de- able theories. In particular, the verification of properties of the dy- velop natural proofs for reasoning using proof tactics involving namically modified heap is a big challenge for logical methods. The disciplined unfoldings and formula abstractions.
    [Show full text]
  • What's Included in the Homeos
    What’s included in the HomeOS kit (and some tips on using it) 2/21/2011 HomeOS is an experimental operating system for the home which focuses on providing centralized control of connected devices in the home, useful programming abstractions for developers, and allows for the easy addition of new devices and application functionality to the home environment. This document explains what application and driver modules are included in the kit and how to use them in your setup. It is not a programming guide; that would be programming-howto.docx. Because it might be a little out of date, your most up-to-date source of information is the source code itself Contents Drivers ......................................................................................................................................................... 2 DriverAxisCamera: for IP cameras made by Axis Communications ..................................................... 2 DriverDlnaDmr: for DLNA media renderers ......................................................................................... 2 DriverDlnaDms: for DLNA media servers ............................................................................................. 2 DriverImgRec: virtual device for face recognition ............................................................................... 3 DriverNotifications: virtual device for sending notifications over email and SMS .............................. 3 DriverWebCam: for Webcams ............................................................................................................
    [Show full text]
  • Computational Textiles and Augmenting Space Through Emotion
    Softbuilt: Computational Textiles and Augmenting Space Through Emotion by Felecia A. Davis Bachelor of Science in Engineering, Tufts University (1983) Master of Architecture, Princeton University (1993) Submitted to the Department of Architecture In Partial Fulfilment of the Requirements for the Degree of Doctor of Philosophy in the field of Architecture: Design and Computation at the Massachusetts Institute of Technology September 2017 © 2017 Felecia A. Davis All rights reserved The author hereby grants to M.I.T. permission to reproduce and distribute publicly paper and electronic copies of this thesis document in whole or in part in any medium now known or hereafter created. Signature of Author Felecia Davis 11 August 2017 Department of Architecture Certified by Terry Knight Professor of Design and Computation Department of Architecture Thesis Supervisor Accepted by Sheila Kennedy Professor of Architecture Chair, Department Committee on Graduate Students 1 2 DISSERTATION COMMITTEE Dr. Terry Knight, Chair Professor of Design and Computation Massachusetts Institute of Technology Dr. Edith K. Ackermann Honorary Professor of Developmental Psychology University of Aix-Marseille 1, France Visiting Scientist Design and Computation Massachusetts Institute of Technology Dr. Leah Buechley Designer, Engineer, Educator Former Director High/ Low Tech Lab Massachusetts Institute of Technology Media Lab 3 4 Softbuilt: Computational Textiles and Augmenting Space Through Emotion By Felecia A. Davis Submitted to the Department of Architecture August 11 2017 in Partial Fulfilment of the Requirements for the Degree of Doctor of Philosophy in Architecture: In Design and Computation at the Massachusetts Institute of Technology ABSTRACT When we inhabit, wear, and make textiles we are in conversation with our pre-historical and historical past and in a sense already connected to what is to come by the structure of fabric that operates as a mode of understanding the world.
    [Show full text]