Now showing items 227-246 of 488

    • Kernel Data Integrity Protection via Memory Access Control 

      Srivastava, Abhinav; Erete, Ikpeme; Giffin, Jonathon (Georgia Institute of Technology, 2009)
      Operating system kernels isolate applications from other malicious software via protected memory created by virtual memory management. Even though modern kernels aggregate core kernel code with driver and module components ...
    • KIMA: Hybrid Checkpointing for Recovery from a Wide Range of Errors and Detection Latencies 

      Doudalis, Ioannis; Prvulovic, Milos (Georgia Institute of Technology, 2010)
      Full system reliability is a problem that spans multiple levels of the software/hardware stack. The normal execution of a program in a system can be disrupted by multiple factors, ranging from transient errors in a ...
    • KTK: Kernel Support for Configurable Objects and Invocations 

      Gheith, Ahmed M.; Mukherjee, Bodhisattwa; Silva, Dilma M.; Schwan, Karsten (Georgia Institute of Technology, 1994)
      The Kernel Tool Kit (KTK) is an object-based operating system kernel and parallel programming library that offers explicit support for on- and off-line program configuration. Specifically, KTK allows the ...
    • Language Issues in Hazard Detection Using Queries 

      Plale, Beth; Schwan, Karsten (Georgia Institute of Technology, 1997)
      Safety-critical systems are pervading all areas of our lives. Accompanying the growth is an increasing level of awareness of the potential dangers involved. As a result, there has been recent realization among ...
    • Leads-to Properties and the But-not-yet Operator 

      Calvert, Kenneth L. (Georgia Institute of Technology, 1993)
      We define a predicate transformer, in terms of which finite disjunctions of leads-to properties can be rewritten as single leads-to properties. Although disjunctions of leads-to properties do not typically arise naturally ...
    • Learning Roles: Behavioral Diversity in Robot Teams 

      Balch, Tucker (Georgia Institute of Technology, 1997)
      This paper describes research investigating behavioral specialization in learning robot teams. Each agent is provided a common set of skills (motor schema-based behavioral assemblages) from which it builds a task-achie ...
    • Learning Submodular Functions 

      Balcan, Maria-Florina; Harvey, Nicholas J. A. (Georgia Institute of Technology, 2009)
      This paper considers the problem of learning submodular functions. A problem instance consists of a distribution on {0,1}[superscript n] and a real-valued function on {0,1}[superscript n] that is non-negative, monotone ...
    • Learning to troubleshoot: Multistrategy learning of diagnostic knowledge for a real-word problem solving task 

      Ram, Ashwin; Narayanan, Sundaram; Cox, Michael Thomas (Georgia Institute of Technology, 1993)
      This article presents a computational model of the learning of diagnostic knowledge based on observations of human operators engaged in a real-world troubleshooting task. We present a model of problem solving and ...
    • Leveraging Block Decisions and Aggregation in the ShareStreams QoS Architecture 

      Krishnamurthy, Rajaram B.; Yalamanchili, Sudhakar; Schwan, Karsten; West, Richard (Georgia Institute of Technology, 2003)
      ShareStreams (Scalable Hardware Architectures for Stream Schedulers) is a canonical architecture for realizing a range of scheduling disciplines. This paper discusses the design choices and tradeoffs made in the ...
    • Leveraging Forensic Tools for Virtual Machine Introspection 

      Dolan-Gavitt, Brendan; Payne, Bryan; Lee, Wenke (Georgia Institute of Technology, 2011)
      Virtual machine introspection (VMI) has formed the basis of a number of novel approaches to security in recent years. Although the isolation provided by a virtualized environment provides improved security, software that ...
    • Leveraging Memory Mapping for Fast and Scalable Graph Computation on a PC 

      Lin, Zhiyuan; Chau, Duen Horng (Polo) (Georgia Institute of Technology, 2013-08)
      Large graphs with billions of nodes and edges are increasingly common, calling for new kinds of scalable computation frameworks. Although popular, distributed approaches can be expensive to build, or require many resources ...
    • Life (and routing) on the Wireless Manifold 

      Kanade, Varun; Vempala, Santosh (Georgia Institute of Technology, 2007)
      We present the wireless manifold, a 2-dimensional surface in 3-dimensional space with the property that geodesic distances accurately capture wireless signal strengths. A compact representation of the manifold can be ...
    • Lithium: Event-Driven Network Control 

      Kim, Hyojoon; Voellmy, Andreas; Burnett, Sam; Feamster, Nick; Clark, Russ (Georgia Institute of Technology, 2012)
      This paper introduces event-driven network control, a network control framework that makes networks easier to manage by automating many tasks that must currently be performed by manually modifying low-level, distributed, ...
    • Local Region Caching to Support Object-Centered Constraints 

      Arnold, Stephen; Mark, Leo (Georgia Institute of Technology, 1995)
      Object-centered constraints are a computationally practical type of constraint that can be defined on any network of data. If a current-element in the database can be identified, a local region about the current element ...
    • A Local-global Principle for Diophantine Equations 

      Lipton, Richard J.; Vishnoi, Nisheeth Kumar (Georgia Institute of Technology, 2003)
      We observe the following global-local principle for Diophantine equations: If an equation f(x₁,...,x[subscript t]) ϵ ℤ[x₁,...,x[subscript t] = p can be solved efficiently for a dense set of primes p, then one can ...
    • Localization and 3D Reconstruction of Urban Scenes Using GPS 

      Kim, Kihwan; Summet, Jay; Starner, Thad; Ashbrook, Daniel; Kapade, Mrunal; Essa, Irfan A. (Georgia Institute of Technology, 2008)
      Using off-the-shelf Global Positioning System (GPS) units, we reconstruct buildings in 3D by exploiting the reduction in signal to noise ratio (SNR) that occurs when the buildings obstruct the line-of-sight between the ...
    • LOCK: Locating Countermeasure-Capable Prefix Hijackers 

      Qiu, Tongqing; Ji, Lusheng; Pei, Dan; Wang, Jia; Xu, Jun; Ballani, Hitesh (Georgia Institute of Technology, 2008)
      Prefix hijacking is known as one of the security threats on today’s Internet. A number of measurement based solutions have been proposed to detect prefix hijacking events. In this paper we take these solutions one step ...
    • Long Term Channel Allocation Strategies for Video Applications 

      Almeroth, Kevin C.; Dan, Asit; Sitaram, Dinkar; Tetzlaff, William H. (Georgia Institute of Technology, 1995)
      In typical video delivery systems offering programs on-demand, service should be nearly immediate and continuous. A video server can provide this type of service by reserving sufficient network and server resources for ...
    • Loss-Tolerant and Secure Embedded Computing via Inscrutable Instruction-Set Architectures (I²SA) 

      Mooney, Vincent John, III; Palem, Krishna V.; Wunderlich, Richard B. (Georgia Institute of Technology, 2004)
      In short, we examine secure computing where a microprocessor reads, writes and executes operations ideally in an inscrutable domain. The goal is to provide methods and implementations for computation where data never ...
    • A Lower Bound for Boolean Permanent in Bijective Boolean Circuits and Its Consequences 

      Sengupta, Rimli; Venkateswaran, H. (Georgia Institute of Technology, 1994)
      We identify a new and non-trivial restriction called bijectivity on Boolean circuits and prove an exponential size lower bound for computing the Boolean permanent matching function in this model. As consequences of ...