Browse Research and Tech Reports - Computer Science by Title

  • Kaushik, Rini T. (2011-05)
    Big Data explosion and surge in large-scale Big Data analytics cloud infrastructure have led to burgeoning energy costs and present a challenge to the existing run-time cooling energy management techniques. T*GreenHDFS, a ...

    application/pdf

    application/pdfPDF (1Mb)
  • Shi, Lin; Yu, Yizhou (2005-04)
    Following rapidly changing target objects is a challenging problem in fluid control, especially when the natural fluid motion should be preserved. The fluid should be responsive to the changing configuration of the target ...

    application/pdf

    application/pdfPDF (2Mb)
  • Adamczyk, Piotr D.; Busbey, Christopher W.; Bailey, Brian P. (2005-04)
    The use of continuous, physiological measures such as pupil size is becoming increasingly important in user interface design, attention management, and affective computing. While this data is best explored in context of ...

    application/pdf

    application/pdfPDF (344Kb)
  • Dinges, Peter; Agha, Gul A. (2014-09-11)
    Knowing inputs that cover a specific branch or statement in a program is useful for debugging and regression testing. Symbolic backward execution (SBE) is a natural approach to find such targeted inputs. However, SBE ...

    application/pdf

    application/pdfPDF (387Kb)
  • Ahmed, Amr M.E.; Patel, Abhilash; Brown, Tom; Ham, MyungJoo; Jang, Myeong-Wuk; Agha, Gul A. (2004-12)
    In the dynamic distributed task assignment (DDTA) problem, a team of agents is required to accomplish a set of tasks while maximizing the overall team utility. An effective solution to this problem needs to address two ...

    application/pdf

    application/pdfPDF (144Kb)
  • 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)
  • 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)
  • Kundu, Gourab; Roth, Dan (2013)
    Teaching is challenging in a real environment. One problem is that not all examples may be available to teach. We show how to teach several important concept classes namely conjunction, disjunction and linear threshold ...

    application/pdf

    application/pdfPDF (91Kb)
  • Alexandros Tzannes, Stephen T. Heumann, Lamyaa Eloussi, Mohsen Vakilian, Vikram S. Adve, Michael Han (IEEE, 2015-08-17)
    In this paper, we present the first full regions-and-effects inference algorithm for explicitly parallel fork-join programs. We infer annotations inspired by Deterministic Parallel Java (DPJ) for a type-safe subset of C++. ...

    application/pdf

    application/pdfPDF (198Kb)
  • 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)
  • Yang, Zhenyu; Nahrstedt, Klara; Cui, Yi; Yu, Bin; Liang, Jin; Jung, Sang-Hack; Bajscy, Ruxena (2005-08)
    Tele-immersive 3D multi-camera room environments are starting to emerge and with them new challenging research questions. One important question is how to organize the large amount of visual data, being captured, processed, ...

    application/pdf

    application/pdfPDF (449Kb)
  • 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)
  • 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)
  • Duran, Francisco; Lucas, Salvador; Meseguer, Jos�� (2009-06-19)
    Rewriting with rules R modulo axioms E is a widely used technique in both rule-based programming languages and in automated deduction. Termination methods for rewriting systems modulo specific axioms E (e.g., associativi ...

    application/pdf

    application/pdfPDF (311Kb)
  • 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)