Browse Dept. of Computer Science by Title

  • Bhatele, Abhinav; Kumar, Sameer; Mei, Chao; Phillips, James C.; Zheng, Gengbin; Kale, Laxmikant V. (2009-02)
    NAMD is a portable parallel application for biomolecular simulations. NAMD pioneered the use of hybrid spatial and force decomposition, a technique used by most scalable programs for biomolecular simulations, including ...

    application/pdf

    application/pdfPDF (350kB)
  • Bhatele, Abhinav; Kumar, Sameer; Mei, Chao; Phillips, James C.; Zheng, Gengbin; Kale, Laxmikant V. (2009-02)
    NAMD is a portable parallel application for biomolecular simulations. NAMD pioneered the use of hybrid spatial and force decomposition, a technique used by most scalable programs for biomolecular simulations, including ...

    application/pdf

    application/pdfPDF (350kB)
  • Cheng, Ray Franklin (1984)
    Referencing remote entities by names rather than by addresses is desirable in computer network or a joint-network. In this thesis, the naming and addressing problems in the internetwork environment are studied. Four naming ...

    application/pdf

    application/pdfPDF (6MB)Restricted to U of Illinois
  • Gupta, Indranil; Cho, Brian; Rahman, Muntasir Raihan; Chajed, Tej; Abad, Cristina L.; Roberts, Nathan; Lin, Philbert (2013-06-06)
    This paper presents Natjam, a system that supports arbitrary job priorities, hard real-time scheduling, and efficient preemption for Mapreduce clusters that are resource-constrained. Our contributions include: i) smart ...

    application/pdf

    application/pdfPDF (749kB)
  • Hodosh, Micah A (2015-11-25)
    Automatically describing an image with a concise natural language description is an ambitious and emerging task bringing together the Natural Language and Computer Vision communities. With any emerging task, the necessary ...

    application/pdf

    application/pdfPDF (34MB)
  • Punyakanok, Vasin; Roth, Dan; Yih, Wen-tau (2004-01)
    We describe an approach for answer selection in a free form question answering task. In order to go beyond a key-word based matching in selecting answers to questions, one would like to develop a principled way for the ...

    application/pdf

    application/pdfPDF (343kB)
  • Horn, Jeffrey (1997)
    We extend the above analysis by looking at some aspects of the general case of multiple overlapping niches. We discover that calculating the equilibrium point for three or more niches under resource sharing can be ...

    application/pdf

    application/pdfPDF (13MB)Restricted to U of Illinois
  • Taylor, Kamilah J. (2011-01-14)
    This thesis introduces a sensor-based planning algorithm that uses less sensing information than any others within the family of bug algorithms. The robot is unable to access precise information regarding position ...

    application/pdf

    application/pdfPDF (8MB)
  • Ailavajhala, Megha (2015-12-03)
    This paper proposes a navigation system on an android platform, Navigator, designed for the visually impaired for easy and independent travel. People with physical disabilities have a tough time going from one place to ...

    application/pdf

    application/pdfPDF (5MB)
  • Fesehaye, Debessay; Xia, Pengye; P. Brighten Godfrey; Nahrstedt, Klara; Lumetta, Steven S. (2012-03-24)
    The transmission control protocol (TCP) is the major trans- port layer protocol in the Internet today. TCP and its vari- ants have the drawback of not knowing the explicit rate share of flows at bottleneck links. The ...

    application/pdf

    application/pdfPDF (163kB)
  • Wei, Mingliang; Snir, Marc; Torrellas, Josep; Tremaine, R. Brett (2005-02)
    Many important scientific and engineering applications execute sub-optimally on current commodity processors and servers. Specifically, since they frequently use caches ineffectively, they are often heavily bottlenecked ...

    application/pdf

    application/pdfPDF (196kB)
  • Vakilian, Mohsen; Chen, Nicholas; Negara, Stas; Rajkumar, Balaji Ambresh; Zilouchian Moghaddam, Roshanak; Johnson, Ralph E. (2011)
    Even though modern Integrated Development Environments (IDEs) support many refactorings, studies suggest that automated refactorings are used infrequently, and few developers use anything beyond Rename and Extract refactorings. ...

    application/pdf

    application/pdfPDF (167kB)
  • Kassa, Debessay Fesehaye; Nahrstedt, Klara; Caesar, Matthew (2010-07-11)
    The transmission control protocol (TCP) which is the dominant congestion control protocol at the transport layer is proved to have many performance problems with the growth of the Internet. TCP for instance results in ...

    application/pdf

    application/pdfPDF (276kB)
  • Kassa, Debessay Fesehaye (2012-10-29)
    The transmission control protocol (TCP) is the major trans- port protocol in the Internet. TCP and its variants have the drawback of not accurately knowing rate share of flows at bottleneck links. Some protocols proposed ...

    application/pdf

    application/pdfPDF (238kB)
  • Kim, Hwangnam; Lim, Hyuk; Hou, Jennifer C. (2004-04)
    In this paper, we present a rescaling simulation methodology (RSM) to expedite simulation in large-scale TCP/IP networks without loss of fidelity of simulation results. Conceptually, we scale down the network to be simulated ...

    application/pdf

    application/pdfPDF (796kB)
  • Kim, Junguk Lawrence (1987)
    Data replication in distributed database systems is designed to achieve high reliability and availability. In case of network partitioning, the mutual consistency of data may become doubtful unless the transaction processing ...

    application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois
  • Qian, Minglun (2005)
    When using a constrained formulation along with violation guided backpropagation to neural network learning for near noiseless time-series benchmarks, we achieve much improved prediction performance as compared to that of ...

    application/pdf

    application/pdfPDF (9MB)Restricted to U of Illinois
  • Qian, Minglun (2005-04)
    In this thesis, we propose a recurrent FIR neural network, develop a constrained formulation for neural network learning, study an e_cient violation guided backpropagation algorithm for solving the constrained formulation ...

    application/pdf

    application/pdfPDF (4MB)
  • Harris, Harlan D. (2003)
    Another significant goal of this work was to identify the inductive biases of each algorithm, so that they can be fairlycompared with each other. By examining their biases and properties using the results presented here, ...

    application/pdf

    application/pdfPDF (5MB)Restricted to U of Illinois
  • application/pdf

    application/pdfPDF (4MB)Restricted to U of Illinois