Now showing items 311-330 of 376

    • SCANDEX: Service Centric Networking for Challenged Decentralised Networks 

      Sathiaseelan, Arjuna; Wang, Liang; Aucinas, Andrius; Tyson, Gareth; Crowcroft, Jonathon Andrew (Association for Computing Machinery, 2015-05-18)
      Do-It-Yourself (DIY) networks are decentralised networks built by an (often) amateur community. As DIY networks do not rely on the need for backhaul Internet connectivity, these networks are mostly a mix of both offine and ...
    • Scripting the crime commission process in the illicit online prescription drug trade 

      Leontiadis, Nektarios; Hutchings, Alice (Oxford University Press, 2015-11-10)
      This paper considers the processes in the illicit online prescription drug trade, namely search-redirection attacks and the operation of unlicensed pharmacies using crime script analysis. Empirical data have been used to ...
    • Seamless Authentication with Pico 

      Krol, Katarzyna Kinga; Aebischer, Seb; Llewellyn-Jones, David; Dettoni, Claudio; Stajano, Francesco Mario (2017-04-27)
      In this talk, we present seamless authentication as a challenge in terms of anticipating user preferences and offering them options to balance their need for convenience, security, and control. We describe our ongoing trial ...
    • Searching for doppelgängers: assessing the universality of the IrisCode impostors distribution 

      Daugman, John Gustav; Downing, Cathryn (Institution of Engineering and Technology, 2015-01-27)
      We generated 316,250 entire distributions of IrisCode impostor scores, each distribution obtained by comparing one iris against hundreds of thousands of others in a database including persons spanning 152 nationalities. ...
    • Self-Formalisation of Higher-Order Logic: Semantics, Soundness, and a Verified Implementation 

      Kumar, Ramana; Arthan, Rob; Myreen, Magnus O.; Owens, Scott (Springer, 2016-02-15)
      We present a mechanised semantics for higher-order logic (HOL), and a proof of soundness for the inference system, including the rules for making definitions, implemented by the kernel of the HOL Light theorem prover. Our ...
    • Semantic Composition via Probabilistic Model Theory 

      Emerson, Guy; Copestake, Ann Alicia
    • Semi-sharp Creases on Subdivision Curves and Surfaces 

      Kosinka, Jiri; Sabin, MA; Dodgson, Neil Anthony (2014-08-23)
      We explore a method for generalising Pixar semi-sharp creases from the univariate cubic case to arbitrary degree subdivision curves. Our approach is based on solving simple matrix equations. The resulting schemes allow for ...
    • Shading curves: vector-based drawing with explicit gradient control 

      Lieng, Henrik; Tasse, Flora; Kosinka, Jiri; Dodgson, Neil Anthony (Wiley, 2015-02-23)
      A challenge in vector graphics is to define primitives that offer flexible manipulation of colour gradients. We propose a new primitive, called a shading curve, that supports explicit and local gradient control. This is ...
    • Shadow Kernels: A General Mechanism For Kernel Specialization in Existing Operating Systems 

      Chick, Oliver RA; Carata, Lucian; Snee, James; Balakrishnan, Nikilesh; Sohan, Ripduman Singh (ACM, 2015)
      Existing operating systems share a common kernel text section amongst all processes. It is not possible to perform kernel specialization or tuning such that different applications execute text optimized for their kernel ...
    • Short and long-term genome stability analysis of prokaryotic genomes 

      Brilli, Matteo; Liò, Pietro; Lacroix, Vincent; Sagot, Marie-France (2013-05-08)
      Abstract Background Gene organization dynamics is actively studied because it provides useful evolutionary information, makes functional annotation easier and often enables to characterize pathogens. There is therefore a ...
    • A Simple Recursively Computable Lower Bound on the Noncoherent Capacity of Highly Underspread Fading Channels 

      Herbert, Steven; Wassell, Ian James; Loh, Tian-Hong (IEEE, 2016-02-18)
      Real-world wireless communication channels are typically highly underspread: their coherence time is much greater than their delay spread. In such situations it is common to assume that, with sufficiently high bandwidth, ...
    • Simplifying ARM concurrency: multicopy-atomic axiomatic and operational models for ARMv8 

      Pulte, Christopher; Flur, Shaked; Deacon, Will; French, Jon; Sarkar, Susmit; Sewell, Peter Michael (2017-12-27)
      ARM has a relaxed memory model, previously specified in informal prose for ARMv7 and ARMv8. Over time, and partly due to work building formal semantics for ARM concurrency, it has become clear that some of the complexity ...
    • Simultaneous Bayesian Sparse Approximation With Structured Sparse Models 

      Chen, Wei; Wipf, David; Wang, Yu; Liu, Yang; Wassell, Ian James (IEEE, 2016-09-01)
      Sparse approximation is key to many signal processing, image processing and machine learning applications. If multiple signals maintain some degree of dependency, for example the support sets are statistically related, ...
    • SMAPs: Short Message Authentication Protocols 

      Baqer, Khaled; Bezuidenhoudt, J; Anderson, Ross John; Kuhn, Markus Guenther
      There is a long history of authentication protocols designed for ease of human use, which rely on users copying a short string of digits. Historical examples include telex test keys and early nuclear firing codes; familiar ...
    • SmileNet: Registration-Free Smiling Face Detection in the Wild 

      Jang, Y; Gunes, Hatice; Patras, I (IEEE, 2017-10-29)
      We present a novel smiling face detection framework called SmileNet for detecting faces and recognising smiles in the wild. SmileNet uses a Fully Convolutional Neural Network (FCNN) to detect multiple smiling faces in a ...
    • Software Prefetching for Indirect Memory Accesses 

      Ainsworth, Sam; Jones, Timothy Martin (Association for Computing Machinery, 2017)
      Many modern data processing and HPC workloads are heavily memory-latency bound. A tempting proposition to solve this is software prefetching, where special non-blocking loads are used to bring data into the cache hierarchy ...
    • Solving Linear Programs without Breaking Abstractions 

      Anderson, Matthew; Dawar, Anuj; Holm, Bjarki (ACM, 2015-12-10)
      We show that the ellipsoid method for solving linear programs can be implemented in a way that respects the symmetry of the program being solved. That is to say, there is an algorithmic implementation of the method that ...
    • Solving the AL Chicken-and-Egg Corpus and Model Problem: Model-free Active Learning for Phenomena-driven Corpus Construction 

      Kaplan, D; Rubens, N; Teufel, Simone Heidi; Tokunaga, T (European Language Resources Association, 2016-05-25)
      Active learning (AL) is often used in corpus construction (CC) for selecting “informative” documents for annotation. This is ideal for focusing annotation efforts when all documents cannot be annotated, but has the limitation ...
    • Soroban: Attributing Latency in Virtualized Environments 

      Snee, James; Carata, Lucian; Chick, Oliver RA; Sohan, Ripduman Singh; Faragher, Ramsey M; Rice, Andrew; Hopper, Andrew (USENIX, 2015)
      Applications running in the cloud have highly-variable response times due to the lack of perfect performance isolation from other services served by common infrastructure. In particular, response latency when executing on ...
    • Source-code queries with graph databases—with application to programming language usage and evolution 

      Urma, Raoul-Gabriel; Mycroft, Alan (Elsevier, 2013-11-12)
      Program querying and analysis tools are of growing importance, and occur in two main variants. Firstly there are source-code query languages which help software engineers to explore a system, or to find code in need of ...