Browse Dept. of Computer Science by Title

  • Xin, Dong; Shao, Zheng; Han, Jiawei; Liu, Hongyan (2005-10)
    It is well recognized that data cubing often produces huge outputs. Two popular efforts devoted to this problem are (1) iceberg cube, where only significant cells are kept, and (2)closed cube, where a group of cells which ...

    application/pdf

    application/pdfPDF (209Kb)
  • Xue, Yuan; Nguyen, Hoang; Nahrstedt, Klara (2006-10)
    In a wireless network, data transmission suffers from varied signal strengths and channel bit error rates. To ensure successful packet reception under different channel conditions, automatic bit rate control schemes are ...

    application/pdf

    application/pdfPDF (144Kb)
  • Strauss, Karin (2007-08)
    Design complexity and limited power budget are causing the number of cores on the same chip to grow very rapidly. The wide availability of Chip Multiprocessors (CMPs) is enabling the design of inexpensive, shared-memory ...

    application/pdf

    application/pdfPDF (620Kb)
  • Okunbor, Daniel Irowa (1993)
    Hamiltonian systems possess dynamics (e.g., preservation of volume in phase space and symplectic structure) that call for special numerical integrators, namely canonical methods. Recent research in this aspect have shown ...

    application/pdf

    application/pdfPDF (4Mb)Restricted to U of Illinois
  • Chen, Thomas Tar-Fei (1972)

    application/pdf

    application/pdfPDF (2Mb)Restricted to U of Illinois
  • Zhang, Honghai; Hou, Jennifer C. (2004-07)
    In this paper, we study how the achievable throughput scales in a wireless network with randomly located nodes as the number of nodes increases, under a communication model where (i) each node has a maximum transmission ...

    application/pdf

    application/pdfPDF (286Kb)
  • Vakilian, Mohsen; Phaosawasdi, Amarin; Ernst, Michael D.; Johnson, Ralph E. (2014-09-09)
    Type qualifier inference tools usually operate in batch mode and assume that the program must not be changed. In practice, programs must be changed to make them type correct, and programmers must understand them. Cascade ...

    application/pdf

    application/pdfPDF (282Kb)
  • Jayachandran, Praveen; Abdelzaher, Tarek F. (2007-05)
    Contrary to traditional belief, we show in this paper, that for distributed systems non-preemptive scheduling can perform better than preemptive scheduling in the worst case in terms of task schedulability, under certain ...

    application/pdf

    application/pdfPDF (254Kb)
  • Zhong, Hengzhi (2011-08-26)
    Many applications are interested in mining context-aware sequential patterns such as opinions, common navigation patterns, and product recommendations. However, traditional sequential pattern mining algorithms are not ...

    application/pdf

    application/pdfPDF (647Kb)
  • Méndez, Mariano; Overbey, Jeffrey; Garrido, Alejandra; Tinetti, Fernando; Johnson, Ralph (2010-08-30)
    This paper presents a catalog of code refactorings that are intended to improve the different quality attributes of Fortran programs. We classify the refactorings according to their purpose, that is, the internal or ...

    application/pdf

    application/pdfPDF (395Kb)
  • Hafiz, Munawar; Adamczyk, Paul; Johnson, Ralph (2009-02)
    Security requirements change, but the typical way of improving system security by patches is ad hoc and has not produced good results. Security improvements should be systematic, just as new features can be added to software ...

    application/pdf

    application/pdfPDF (336Kb)
  • Hafiz, Munawar; Adamczyk, Paul; Johnson, Ralph (2009-02)
    Security requirements change, but the typical way of improving system security by patches is ad hoc and has not produced good results. Security improvements should be systematic, just as new features can be added to software ...

    application/pdf

    application/pdfPDF (336Kb)
  • Tsai, Mei-Chin (1994)
    In this thesis, we categorize linked structures and linked substructures each into four groups based on two attributes, sharing and cycles. We show that these two attributes can be determined at compile-time by augmenting ...

    application/pdf

    application/pdfPDF (5Mb)Restricted to U of Illinois
  • Farzan, Azadeh; Madhusudan, P. (2007-01)
    We define a novel formulation of dataflow analysis for concurrent programs, where the flow of facts is along the causal dependencies of events. We capture the control flow of concurrent programs using a Petri net (called ...

    application/pdf

    application/pdfPDF (2Mb)
  • Ceze, Luis H.; Strauss, Karin; Tuck, James M.; Renau, Jose; Torrellas, Josep (2004-06)
    Modern superscalar processors often suffer long stalls due to load misses in on-chip L2 caches. To address this problem, we propose hiding L2 misses with Checkpoint-Assisted VAlue prediction (CAVA). On an L2 cache miss, a ...

    application/pdf

    application/pdfPDF (281Kb)
  • Behzad, Babak; Zhang, Junchao; Hoefler, Torsten; Snir, Marc (2012-06-16)
    This report develops an analytical model of the performance of the CGPOP mini-app and validates the model by running CGPOP on various processor counts.

    application/pdf

    application/pdfPDF (1Mb)
  • Ioerger, Thomas Richard (1996)
    While many excellent induction algorithms are known for making predictions from databases in well-studied domains, learning systems still perform poorly in many difficult real-world domains, such as weather prediction or ...

    application/pdf

    application/pdfPDF (9Mb)Restricted to U of Illinois
  • Xue, Yuan; Li, Baochun; Nahrstedt, Klara (2004-09)
    Cooperation in wireless ad hoc networks has two-fold implications. First, each wireless node does not excessively and greedily inject traffic to the shared wireless channel. Second, intermediate nodes voluntarily relay ...

    application/pdf

    application/pdfPDF (444Kb)
  • application/pdf

    application/pdfPDF (7Mb)Restricted to U of Illinois
  • Rahman, Muntasir Raihan; Tseng, Lewis; Nguyen, Son; Gupta, Indranil; Vaidya, Nitin (2014)
    The CAP theorem is a fundamental result that applies to distributed storage systems. In this paper, we first present probabilistic models to characterize the three important elements of the CAP theorem: consistency (C), ...

    application/pdf

    application/pdfPDF (507Kb)