1979 SIGNUM Meeting on Numerical Ordinary Differential Equations, April 3-5, 1979, University Inn, Champaign, Illinois : jointly sponsored by Association for Computing Machinery, Special Interest Group on Numerical Mathematics; Department of Computer Science, University of Illinois at Urbana-Champaign; National Science Foundation /

Includes bibliographical references.

The graduate program in computer science.

Bibliography: p. 7-9.

Syllabus for low level performance for the qualifying examination in computer science /

"April, 1970"

ACSES : the automated computer science education system at the University of Illinois /

Bibliography: p. 141-143.

Record of achievements and plans of the Information Engineering Laboratory in the Department of Computer Science of the University of Illinois at Urbana-Champaign, 1955-1973

Mode of access: Internet.

Characterization of a distributed data base system /

Thesis--University of Illinois at Urbana-Champaign.

ROBOCAR : educating the layman in computer science /

Originally presented as the author's thesis (M.A.), University of Illinois at Urbana-Champaign.

Maintenance testing for the data encryption standard /

"Issued August 1980."

Approximate processing of massive continuous quantile queries over high-speed data streams

Quantile computation has many applications including data mining and financial data analysis. It has been shown that an is an element of-approximate summary can be maintained so that, given a quantile query d (phi, is an element of), the data item at rank [phi N] may be approximately obtained within the rank error precision is an element of N over all N data items in a data stream or in a sliding window. However, scalable online processing of massive continuous quantile queries with different phi and is an element of poses a new challenge because the summary is continuously updated with new arrivals of data items. In this paper, first we aim to dramatically reduce the number of distinct query results by grouping a set of different queries into a cluster so that they can be processed virtually as a single query while the precision requirements from users can be retained. Second, we aim to minimize the total query processing costs. Efficient algorithms are developed to minimize the total number of times for reprocessing clusters and to produce the minimum number of clusters, respectively. The techniques are extended to maintain near-optimal clustering when queries are registered and removed in an arbitrary fashion against whole data streams or sliding windows. In addition to theoretical analysis, our performance study indicates that the proposed techniques are indeed scalable with respect to the number of input queries as well as the number of items and the item arrival rate in a data stream.

Programming Paradigms in Computer Science Education

Main styles, or paradigms of programming – imperative, functional, logic, and object-oriented – are shortly described and compared, and corresponding programming techniques are outlined. Programming languages are classified in accordance with the main style and techniques supported. It is argued that profound education in computer science should include learning base programming techniques of all main programming paradigms.

Key Aspects and Approaches of Open Access, Open Data and Open Science

Overview of the key aspects and approaches to open access, open data and open science, emphasizing on sharing scientific knowledge for sustainable progress and development.

Policy Framework and Roadmap for Open Access, Open Research Data and Open Science

Overview of the growth of policies and a critical appraisal of the issues affecting open access, open data and open science policies. Example policies and a roadmap for open access, open research data and open science are included.