Browse by Subject "computer science"

  • Ranganathan, Anand (2005-08)
    Ubiquitous Computing advocates the enhancement of physical spaces with computing and communication resources that help users perform various kinds of tasks. However, these environments are highly complex, dynamic and ...

    application/pdf

    application/pdfPDF (444Kb)
  • Peiper, Chad E. (2009-01)
    Networked Tablet PCs have great potential for improving the learning environment in classrooms. By increasing the capacity for communication among participants, they can raise student engagement in, and teacher awareness ...

    application/pdf

    application/pdfPDF (23Mb)
  • Nakano, Jun (2006-01)
    As technology feature size continues to shrink, we see two challenging problems in designing computer systems. One is the hardware unreliability due to increasing chances of transient hardware faults caused by high-energy ...

    application/pdf

    application/pdfPDF (971Kb)
  • Sarangi, Smruti R. (2006-12)
    It is getting increasingly difficult to verify processors and guarantee subsequent reliable operation. The complexity of processors is rapidly increasing with every new generation, leading to an increase in the number of ...

    application/pdf

    application/pdfPDF (883Kb)
  • Meseguer, Jos�� (2007-02)
    This paper presents the temporal logic of rewriting TLR*. Syntactically, TLR* is a very simple extension of CTL* which just adds action atoms, in the form of spatial action patterns, to CTL*. Semantically and pragmatically, ...

    application/pdf

    application/pdfPDF (718Kb)
  • Cai, Deng; He, Xiaofei; Han, Jiawei (2006-04)
    Vector Space Model (VSM) has been at the core of information retrieval for the past decades. VSM considers the documents as vectors in high dimensional space. In such a vector space, techniques like Latent Semantic Indexing ...

    application/pdf

    application/pdfPDF (234Kb)
  • Papescu, Andrei; Rosu, Grigore (2006-04)
    Term-generic first-order logic, or simply generic first-order logic (GFOL), is presented as a first-order logic parameterized with terms defined axiomatically (rather than constructively), by requiring them to only provide ...

    application/pdf

    application/pdfPDF (461Kb)
  • Popescu, Andrei; Rosu, Grigore (2009-01)
    Term-generic logic (TGL) is a first-order logic parameterized with terms defined axiomatically (rather than constructively), by requiring them to only provide generic notions of free variable and substitution satisfying ...

    application/pdf

    application/pdfPDF (666Kb)
  • Lucas, Salvador; Meseguer, Jos�� (2007-02)
    The main goal of this paper is to apply rewriting termination technology .enjoying a quite mature set of termination results and tools. to the problem of proving automatically the termination of concurrent systems under ...

    application/pdf

    application/pdfPDF (374Kb)
  • Rocha, Camilo; Meseguer, Jos�� (2007-12)
    Deduction with inference rules modulo computation rules plays an important role in automated deduction as an effective method for scaling up. We present four equational theories that are isomorphic to the traditional Boolean ...

    application/pdf

    application/pdfPDF (411Kb)
  • Lee, Sang-Chul (2006-02)
    In this dissertation, I present a problem of three-dimensional volume reconstruction from fluorescent confocal laser scanning microscopy (CLSM) imagery. I overview a three-dimensional volume reconstruction framework which ...

    application/pdf

    application/pdfPDF (6Mb)
  • Gupta, Kamal Kant (2008-07)
    This thesis describes a system for tracking and detecting topics in personal search history. In particular, we developed a time tracking tool that helps users in analyzing their time and discovering their activity patterns. ...

    application/pdf

    application/pdfPDF (858Kb)
  • Lee, Adam J. (2008-07)
    The ubiquity of the Internet has led to increased resource sharing between large numbers of users in widely-disparate administrative domains. Unfortunately, traditional identity-based solutions to the authorization problem ...

    application/pdf

    application/pdfPDF (2Mb)
  • Lee, Adam J. (2008-07)
    The ubiquity of the Internet has led to increased resource sharing between large numbers of users in widely-disparate administrative domains. Unfortunately, traditional identity-based solutions to the authorization problem ...

    application/pdf

    application/pdfPDF (2Mb)
  • Lee, Jae-Gil; Han, Jiawei; Whang, Kyu-Young (2007-03)
    Existing trajectory clustering algorithms group similar trajectories as a whole, thus discovering common trajectories. Our key observation is that clustering trajectories as a whole could miss common sub-trajectories. ...

    application/pdf

    application/pdfPDF (885Kb)
  • Zilles, Craig; Rajwar, Ravi (2007-03)
    Transactional Memory (TM) has been proposed as an alternative implementation of mutual exclusion that avoids many of the drawbacks of locks (e.g., deadlock, reliance on the programmer to associate shared data with locks, ...

    application/pdf

    application/pdfPDF (204Kb)
  • Baugh, Lee W. (2008-10)
    Transactional memory is a promising technique for multithreaded synchronization and concurrency which has attracted much interest in recent years. Compared to locks, transactions can offer increased concurrency, composability, ...

    application/pdf

    application/pdfPDF (2Mb)
  • Mahmud, M.M.Hassan; Ray, Sylvian R. (2007-06)
    In transfer learning we aim to solve new problems quicker by using information gained from solving related problems. Transfer learning has been successful in practice, and extensive PAC analysis of these methods has been ...

    application/pdf

    application/pdfPDF (153Kb)
  • Kao, Gio K. (2008-08)
    Solving large combinatorial optimization problems is a ubiquitous task across multiple disciplines. Developing efficient procedures for solving these problems has been of great interest to both researchers and practitioners. ...

    application/pdf

    application/pdfPDF (691Kb)
  • Neelakantam, Naveen; Zilles, Craig (2007-01)
    In this paper, we advocate for a general-purpose, fine-grain memory protection mechanism for use by applications and software development tools. The hardware component of this mechanism consists of two bits (fault-on-read ...

    application/pdf

    application/pdfPDF (318Kb)