Now showing items 195-214 of 378

    • JA-trie: Entropy-Based Packet Classification 

      Antichi, Gianni; Callegari, Christian; Moore, Andrew William; Giordano, Stefano; Anastasi, Enrico (IEEE, 2014-09-16)
      Any improvement in packet classification performance is crucial to ensure Internet functions continue to track the ever-increasing link capacities. Packet classification is the foundation of many Internet functions: from ...
    • Jitsu: Just-In-Time Summoning of Unikernels 

      Madhavapeddy, Anil Venkata; Leonard, Thomas; Skjegstad, Magnus; Gazagnaire, Thomas; Sheets, David; Scott, Dave; Mortier, Richard Michael et al. (USENIX, 2015-03-27)
      Network latency is a problem for all cloud services. It can be mitigated by moving computation out of remote datacenters by rapidly instantiating local services near the user. This requires an embedded cloud platform on ...
    • Joint channel sensing and power control scheme for cognitive radio wireless sensor networks 

      Feng, Ziqiang; Wassell, Ian James (IEEE, 2017-05-02)
      In this paper, we investigate channel sensing and power control problems in a cluster-based cognitive radio wireless sensor network (CRWSN). We first propose three channel sensing algorithms to solve the channel sensing ...
    • Joint sensing matrix and sparsifying dictionary optimization for tensor compressive sensing 

      Ding, X; Chen, W; Wassell, Ian James (IEEE, 2017-07-15)
      Tensor compressive sensing (TCS) is a multidimensional framework of compressive sensing (CS), and it is advantageous in terms of reducing the amount of storage, easing hardware implementations, and preserving multidimensional ...
    • Kadupul: Livin' on the Edge with Virtual Currencies and Time-Locked Puzzles 

      Skjegstad, Magnus; Madhavapeddy, Anil Venkata; Crowcroft, Jonathon Andrew (ACM, 2015-04-08)
      Devices connected to the Internet today have a wide range of local communication channels available, such as wireless Wifi, Bluetooth or NFC, as well as wired backhaul. In densely populated areas it is possible to create ...
    • Kiwi Scientific Acceleration at Large: Incremental Compilation and Multi FPGA HLS Demo 

      Greaves, David James (FPL, 2017-09)
      The Kiwi project revolves around a compiler that converts C# .NET bytecode into Verilog RTL and/or SystemC. An alpha version of the Kiwi toolchain is now open source and a user community is growing. We will demonstrate an ...
    • Kneecap: model-based generation of network traffic 

      Sultana, Nikolai; Mortier, Richard Michael (CEUR-WS.org, 2016)
      Packet generation is an important activity for network administration and security. Tools for packet generation work through template instantiation and are used in an imperative programming style. We describe a new design ...
    • Lacking Integrity: HPSG as a Morphosyntactic Theory 

      Emerson, Guy; Copestake, Ann (CSLI Publications, 2015-11-01)
      Standard accounts of HPSG assume a distinction between morphology and syntax. However, despite decades of research, no cross-linguistically valid definition of ‘word’ has emerged (Haspelmath, 2011), suggesting that no sharp ...
    • Latent Variable Dialogue Models and their Diversity 

      Clark, Stephen Christopher; Cao, K
      We present a dialogue generation model that directly captures the variability in possible responses to a given input, which reduces the ‘boring output’ issue of deterministic dialogue models. Experiments show that our model ...
    • Learning Bases of Activity for Facial Expression Recognition 

      Sariyanidi, E; Gunes, Hatice; Cavallaro, A (IEEE, 2017-04-01)
      The extraction of descriptive features from sequences of faces is a fundamental problem in facial expression analysis. Facial expressions are represented by psychologists as a combination of elementary movements known as ...
    • Learning Dynamic Systems From Time-Series Data - An Application to Gene Regulatory Networks 

      Timoteo, Ivo JPM; Holden, Sean Barry (SCITEPRESS, 2015)
      We propose a local search approach for learning dynamic systems from time-series data, using networks of differential equations as the underlying model. We evaluate the performance of our approach for two scenarios: first, ...
    • Learning Musical Contour on a Tabletop 

      Franceschini, Andrea; Laney, R; Dobbyn, C (2014-09)
      Many successful tabletop applications for music making have been developed, and the technology has been investigated from different perspectives. Yet, to date, despite optimistic claims regarding their potential as learning ...
    • LEO: Scheduling sensor inference algorithms across heterogeneous mobile processors and network resources 

      Georgiev, Petko; Lane, ND; Rachuri, KK; Mascolo, Cecilia (ACM, 2016-10-03)
      Mobile apps that use sensors to monitor user behavior often employ resource heavy inference algorithms that make computational offloading a common practice. However, existing schedulers/off loaders typically emphasize one ...
    • Leveraging a Semantically Annotated Corpus to Disambiguate Prepositional Phrase Attachment 

      Emerson, Guy; Copestake, Ann Alicia (Association for Computational Linguistics, 2015-04)
      Accurate parse ranking requires semantic information, since a sentence may have many candidate parses involving common syntactic constructions. In this paper, we propose a probabilistic frame- work for incorporating ...
    • Light at the middle of the tunnel: middleboxes for selective disclosure of network monitoring to distrusted parties 

      Sultana, Nik; Kohlweiss, Markulf; Moore, Andrew W. (Association for Computing Machinery, 2016-08-26)
      Network monitoring is vital to the administration and operation of networks, but it requires privileged access that only highly trusted parties are granted. This severely limits opportunities for external parties, such as ...
    • Lightning Talk: Supporting Software Sustainability with Lightweight Specifications 

      Contrastin, Mistral; Danish, Matthew; Orchard, Dominic; Rice, Andrew (CEUR Workshop Proceedings, 2016-09-14)
      Lightweight specifications support software maintainability by providing a way to verify that any changes to a code base preserve certain program properties. We give two examples of lightweight specifications for numerical ...
    • A Lightweight Service Placement Approach for Community Network Micro-Clouds 

      Selimi, Mennan; Cerdà-Alabern, L; Freitag, F; Veiga, L; Sathiaseelan, A; Crowcroft, Jonathon Andrew (Springer Nature, 2018-02-28)
      Community networks (CNs) have gained momentum in the last few years with the increasing number of spontaneously deployed WiFi hotspots and home networks. These networks, owned and managed by volunteers, offer various ...
    • Link prediction in drug-target interactions network using similarity indices 

      Lu, Yiding; Guo, Yufan; Korhonen, Anna-Leena (BioMed Central, 2017-01-17)
      Abstract Background In silico drug-target interaction (DTI) prediction plays an integral role in drug repositioning: the discovery of new uses for ...
    • List Objects with Algebraic Structure 

      Fiore, Marcelo Pablo; Saville, Philip (Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik, 2017-09)
      We introduce and study the notion of list object with algebraic structure. The first key aspect of our development is that the notion of list object is considered in the context of monoidal structure; the second key aspect ...
    • Lynx: Using OS and Hardware Support for Fast Fine-Grained Inter-Core Communication 

      Mitropoulou, Konstantina; Porpodas, Vasileios; Zhang, Xiaochun; Jones, Timothy Martin (Association for Computing Machinery, 2016-06-08)
      Designing high-performance software queues for fast intercore communication is challenging, but critical for maximising software parallelism. State-of-the-art single-producer / single-consumer queues for streaming applications ...