Now showing items 114-133 of 297

    • Garbage Collector Memory Accounting in Language-Based Systems 

      Price, David W.; Rudys, Algis; Wallach, Dan S. (2003-11-11)
      Language run-time systems are often called upon to safely execute mutually distrustful tasks within the same runtime, protecting them from other tasks' bugs or otherwise hostile behavior. well-studied access controls exist ...
    • Gene Duplicability-Connectivity-Complexity across Organisms and a Neutral Evolutionary Explanation 

      Zhu, Yun; Du, Peng; Nakhleh, Luay (2012)
      Gene duplication has long been acknowledged by biologists as a major evolutionary force shaping genomic architectures and characteristics across the Tree of Life. Major research has been conducting on elucidating the fate ...
    • Gleaning Network-Wide Congestion Information from Packet Markings 

      Dinu, Florin; Ng, T. S. Eugene (2010-06-29)
      Distributed control protocols routinely have to operate oblivious of dynamic network information for scalability or complexity reasons. However, more informed protocols are likely to make more intelligent decisions. We ...
    • Gradual Typing: Isabelle/Isar Formalization 

      Siek, Jeremy; Taha, Walid (2006-04-07)
      This report formalizes a gradual type system using the Isabelle/Isar proof language and proof assistant. Gradual typing combines static typing and dynamic typing in the same language, allowing a programmer to gradual migrate ...
    • Hack-a-Vote: Demonstrating Security Issues with Electronic Voting Systems 

      Bannet, Jonathan; Price, David W.; Rudys, Algis; Singer, Justin; Wallach, Dan S. (2003-11-21)
      A representative democracy depends on a universally trusted voting system for the election of representatives; voters need to believe that their votes count, and all parties need to be convinced that the winner and loser ...
    • Hierarchical Attribute Grammars: Dialects, Applications and Evaluation Algorithms 

      Carle, Alan (1992-05)
      Although attribute grammars have been applied successfully to the specification of many different phases of analysis and transformation of complex language processing systems, including type checking, data flow analysis, ...
    • An HMM-Based Comparative Genomic Framework for Detecting Introgression in Eukaryotes 

      Liu, Kevin J.; Dai, Jingxuan; Truong, Kathy; Song, Ying; Kohn, Michael H.; Nakhleh, Luay (2014)
      One outcome of interspecific hybridization and subsequent effects of evolutionary forces is introgression, which is the integration of genetic material from one species into the genome of an individual in another species. ...
    • How To Build an Undervoting Machine: Lessons from an Alternative Ballot Design 

      Greene, Kristen K.; Byrne, Michael D.; Goggin, Stephen N. (2013-08)
      Despite the importance of usability in ensuring election integrity, it remains an under-studied aspect of voting systems. Voting computers (a.k.a. DREs) offer the opportunity to present ballots to voters in novel ways, yet ...
    • HPCTOOLKIT: Tools for performance analysis of optimized parallel programs 

      Adhianto, L.; Banerjee, S.; Fagan, M.; Krentel, M.; Marin, G.; Mellor-Crummey, J.; Tallent, N. R. (2008-10-03)
      HPCTOOLKIT is an integrated suite of tools that supports measurement, analysis, attribution, and presentation of application performance for both sequential and parallel programs. HPCTOOLKIT can pinpoint and quantify ...
    • Hybrid Dixon Resultants 

      Chionh, Eng-Wee; Goldman, Ronald; Zhang, Ming (1998-05-13)
      Dixon [1908] describes three distinct homogeneous determinant representations for the resultant of three bivariate polynomials of bidegree(m,n). These Dixon resultants are the determinants of matrices of orders 6mn, 3mn ...
    • Implementing a Static Debugger for a First-Order Functional Programming Language 

      Felleisen, Matthias; Steckler, Paul A. (2001-04)
      A static debugger assists a programmer in finding potential errors in programs. The key to a static debugger is set-based analysis (SBA). Many authors have described formulations of SBA, but leave open gaps among that ...
    • Implementing linear algebra algorithms on high performance architectures 

      Aleksandrov, Lyudmil; Candev, Michael; Djidjev, Hristo N. (1997-07-25)
      In this paper we consider the data distribution and data movement issues related to the solution of the basic linear algebra problems on high performance systems. The algorithms we discuss in details are the Gauss ...
    • Implementing the Top-Down Close Algorithm on the TI 6200 Architecture 

      Dasgupta, Anshuman (2002-12-12)
      Partitioned register-set architectures pose a challenge to standard scheduling algorithms. To create an efficient schedule, an instruction scheduler for such an architecture must consider the location of an operand in the ...
    • Implicitly Heterogeneous Multi-stage Programming 

      Eckhardt, Jason; Kaiabachev, Roumen; Pašalić, Emir; Swadi, Kedar; Taha, Walid (2005-04-16)
      Previous work on semantics-based multi-stage programming (MSP) language design focused on homogeneous languages designs, where the generating and the generated languages are the same. Homogeneous designs simply add a ...
    • Improving Effective Bandwidth through Compiler Enhancement of Global and Dynamic Cache Reuse 

      Ding, Chen (2000-01-21)
      While CPU speed has been improved by a factor of 6400 over the past twenty years, memory bandwidth has increased by a factor of only 139 during the same period. Consequently, on modern machines the limited data supply ...
    • Improving Memory Hierarchy Performance for Irregular Applications 

      Kennedy, Ken; Mellor-Crummey, John; Whalley, David (1999-03-10)
      The gap between CPU speed and memory speed in modern computer systems is widening as new generations of hardware are introduced. Loop blocking and prefetching transformations help bridge this gap for regular applications; ...
    • Improving Performance with Integrated Program Transformations 

      Jin, Guohua; Mellor-Crummey, John; Qasem, Apan (2004-09-09)
      Achieving a high fraction of peak performance on today’s computer systems is difficult for complex scientific applications. To do so, an application’s characteristics must be tailored to exploit the characteristics of its ...
    • Improving TLB Miss Handling with Page Table Pointer Caches 

      Wu, Michael; Zwaenepoel, Willy (1997-12-16)
      Page table pointer caches are a hardware supplement for TLBs that cache pointers to pages of page table entries rather than page table entries themselves. A PTPC traps and handles most TLB misses in hardware with low ...
    • In situ imaging of the conducting filament in a silicon oxide resistive switch 

      Yao, Jun; Zhong, Lin; Natelson, Douglas; Tour, James M. (2012)
      The nature of the conducting filaments in many resistive switching systems has been elusive. Throughᅠin situᅠtransmission electron microscopy, we image the real-time formation and evolution of the filament in a silicon ...
    • Inference of reticulate evolutionary histories by maximum likelihood: the performance of information criteria 

      Park, Hyun Jung; Nakhleh, Luay (2012)
      Background: Maximum likelihood has been widely used for over three decades to infer phylogenetic trees from molecular data. When reticulate evolutionary events occur, several genomic regions may have conflicting evolutionary ...