queries.txt

<collection title=CACM_queries>

<document docid=1>
 What articles exist which deal with TSS (Time Sharing System), an
operating system for IBM computers?
</document>

<document docid=2>
 I am interested in articles written either by Prieve or Udo Pooch
Prieve, B.
Pooch, U.
</document>

<document docid=3>
 Intermediate languages used in construction of multi-targeted compilers; TCOLL
</document>

<document docid=4>
 I'm interested in mechanisms for communicating between disjoint processes,
possibly, but not exclusively, in a distributed environment.  I would
rather see descriptions of complete mechanisms, with or without implementations,
as opposed to theoretical work on the abstract problem.  Remote procedure
calls and message-passing are examples of my interests.
</document>

<document docid=5>
 I'd like papers on design and implementation of editing interfaces,
window-managers, command interpreters, etc.  The essential issues are
human interface design, with views on improvements to user efficiency,
effectiveness and satisfaction.
</document>

<document docid=6>
 Interested in articles on robotics, motion planning particularly the
geometric and combinatorial aspects.  We are not interested in the
dynamics of arm motion.
</document>

<document docid=7>
 I am interested in distributed algorithms - concurrent programs in
which processes communicate and synchronize by using message passing.
Areas of particular interest include fault-tolerance and techniques
for understanding the correctness of these algorithms.
</document>

<document docid=8>
 Addressing schemes for resources in networks; resource addressing in
network operating systems
</document>

<document docid=9>
 Security considerations in local networks, network operating systems,
and distributed systems.
</document>

<document docid=10>
 Parallel languages; languages for parallel computation
</document>

<document docid=11>
 SETL, Very High Level Languages
</document>

<document docid=12>
 portable operating systems
</document>

<document docid=13>
 code optimization for space efficiency
</document>

<document docid=14>
 find all discussions of optimal implementations of sort algorithms for
database management applications
</document>

<document docid=15>
 Find all discussions of horizontal microcode optimization with special
emphasis on optimization of loops and global optimization.
</document>

<document docid=16>
 find all descriptions of file handling in operating systems based on
multiple processes and message passing.
</document>

<document docid=17>
 Optimization of intermediate and machine code
</document>

<document docid=18>
 Languages and compilers for parallel processors, especially highly
horizontal microcoded machines; code compaction
</document>

<document docid=19>
 Parallel algorithms
</document>

<document docid=20>
 Graph theoretic algorithms applicable to sparse matrices
</document>

<document docid=21>
 computational complexity, intractability, class-complete reductions,
algorithms and efficiency
</document>

<document docid=22>
 I am interested in hidden-line and hidden-surface algorithms for
cylinders, toroids, spheres, and cones.  This is a rather specialized
topic in computer graphics.
</document>

<document docid=23>
 Distributed computing structures and algorithms
</document>

<document docid=24>
 Applied stochastic processes
</document>

<document docid=25>
 Performance evaluation and modelling of computer systems
</document>

<document docid=26>
 Concurrency control mechanisms in operating systems
</document>

<document docid=27>
 Memory management aspects of operating systems
</document>

<document docid=28>
 Any information on packet radio networks.  Of particular interest are
algorithms for packet routing, and for dealing with changes in
network topography.  I am not interested in the hardware used in the
network.
</document>

<document docid=29>
 Number-theoretic algorithms, especially involving prime number series,
sieves, and Chinese Remainder theorem.
</document>

<document docid=30>
 Articles on text formatting systems, including "what you see is what you
get" systems.  Examples: t/nroff, scribe, bravo.
</document>

<document docid=31>
 I'd like to find articles describing the use of singular value decomposition
in digital image processing.  Applications include finding approximations
to the original image and restoring images that are subject to noise. An
article on the subject is H. Andrews and C. Patterson "Outer product
expansions and their uses in digital image processing", American Mathematical
Andrews, H.
Patterson, C.
</document>

<document docid=32>
 I'd like to find articles describing graph algorithms that are based on
the eigenvalue decomposition (or singular value decomposition) of the
ajacency matrix for the graph.  I'm especially interested in any heuristic
algorithms for graph coloring and graph isomorphism using this method.
</document>

<document docid=33>
 Articles about the sensitivity of the eigenvalue decomposition of real
matrices, in particular, zero-one matrices.  I'm especially interested in
the separation of eigenspaces corresponding to distinct eigenvalues.
Articles on the subject:
C. Davis and W. Kahn, "The rotation of eigenvectors by a permutation:,
SIAM J. Numerical Analysis, vol. 7, no. 1 (1970); G. Stewart, "Error
bounds for approximate invariant subspaces of closed linear operators",
SIAM J. Numerical Analysis., Vol. 8, no. 4 (1971).
Davis, C.
Kahn, W.
Stewart, G.
</document>

<document docid=34>
 Currently interested in isolation of root of polynomial; there is an old
more recent material.
Heindel, L.
</document>

<document docid=35>
 Probabilistic algorithms especially those dealing with algebraic and
symbolic manipulation.  Some examples:
Rabiin, "Probabilistic algorithm on finite field", SIAM
Waztch, "Probabilistic testing of polynomial identities", SIAM
Rabin,M.
</document>

<document docid=36>
 Fast algorithm for context-free language recognition or parsing
</document>

<document docid=37>
 Articles describing the relationship between data types and concurrency
(e.g. what is the type of a process?  when is a synchronization attempt 
between two processes "type correct"?  in a message-passing system is there
any notion of the types of messages?--i.e. any way to check that the sender
of the message and the receiver are both treating the bit stream as some
particular type)
</document>

<document docid=38>
 What is the type of a module?	(I don't want the entire literature on
Abstract Data Types here, but I'm not sure how to phrase this to avoid it.
I'm interested in questions about how one can check that a module "matches"
contexts in which it is used.)
</document>

<document docid=39>
 What does type compatibility mean in languages that allow programmer
defined types?  (You might want to restrict this to "extensible" languages
that allow definition of abstract data types or programmer-supplied
definitions of operators like *, +.)
</document>

<document docid=40>
 List all articles dealing with data types in the following languages:
that are referenced frequently in papers on the above languages (e.g. catch
any languages with interesting type structures that I might have missed).
</document>

<document docid=41>
 Theory of distributed systems and databases.  Subtopics of special
interest include reliability and fault-tolerance in distributed systems,
atomicity, distributed transactions, synchronization algorithms, 
resource allocation; lower bounds and models for asynchronous parallel
systems.  Also theory of communicating processes and protocols.   
     P. Box 2158 Yale Station, New Haven, Conn.  06520
</document>

<document docid=42>
 Computer performance evaluation techniques using pattern recognition
and clustering.
     LA    70803
</document>

<document docid=43>
 Analysis and perception of shape by humans and computers.  Shape
descriptions, shape recognition by computer.  Two-dimensional shapes.
Measures of circularity.  Shape matching.
</document>

<document docid=44>
 Texture analysis by computer.	Digitized texture analysis.  Texture
synthesis. Perception of texture.
</document>

<document docid=45>
 The use of operations research models to optimize information system
performance.  This includes fine tuning decisions such as secondary index
selection, file reorganization, and distributed databases.
</document>

<document docid=46>
 The application of fuzzy subset theory to clustering and information
retrieval problems.  This includes performance evaluation and automatic
indexing considerations.
</document>

<document docid=47>
 The use of Bayesian decision models to optimize information retrieval
system performance.  This includes stopping rules to determine when a
user should cease scanning the output of a retrieval search.
</document>

<document docid=48>
 The use of computer science principles (e.g. data structures, 
numerical methods) in generating optimization (e.g. linear programming)
algorithms.  This includes issues of the Khachian (Russian, ellipsoidal)
algorithm and complexity of such algorithms.
</document>

<document docid=49>
 The role of information retrieval in knowledge based systems
(i.e., expert systems).
</document>

<document docid=50>
 Parallel processors in information retrieval
</document>

<document docid=51>
 Parallel processors and paging algorithms
</document>

<document docid=52>
 Modelling and simulation in agricultural ecosystems.
</document>

<document docid=53>
 mathematical induction, group theory, integers modulo m,
probability, binomial coefficients, binomial theorem, homomorphism,
morphism, transitivity, relations, relation matrix.
     Syracuse University, 313 Link Hall, Syracuse, N. 13210
</document>

<document docid=54>
 Semantics of programming languages, including abstract specifications
of data types, denotational semantics, and proofs of correctness.
Hoare, A.
Dijkstra, E.
 University of Massachusetts, Amherst, MA 01003
</document>

<document docid=55>
 Anything dealing with star height of regular languages or regular
expressions or regular events.
</document>

<document docid=56>
 Articles relation the algebraic theory of semigroups and monoids
to the study of automata and regular languages.
</document>

<document docid=57>
 Abstracts of articles:
    J. Backus, "Can programming be liberated from the Von Neumann style?
               A functional style and its algebra of programs", CACM 21
    Re Millo, R. Lipton, A. Perlis, letter to ACM Forum, CACM 22
	       (1979), 629-630
Backus, J.
De Millo, R.
Lipton, R.
Perlis, A.
</document>

<document docid=58>
 Algorithms or statistical packages for ANOVA, regression using least
squares or generalized linear models.  System design, capabilities,
statistical formula are of interest.  Student's t test, Wilcoxon and
sign tests, multivariate and univariate components can be included.
</document>

<document docid=59>
 Dictionary construction and accessing methods for fast retrieval
of words or lexical items or morphologically related information.
Hashing or indexing methods are usually applied to English spelling or
natural language problems.
</document>

<document docid=60>
 Hardware and software relating to database management systems.
Database packages, back end computers, special associative hardware
with microcomputers attached to disk heads or things like RAP, 
relational or network (CODASYL) or hierarchical models, systems
like SYSTEM R, IMS, ADABAS, TOTAL, etc.
</document>

<document docid=61>
 Information retrieval articles by Gerard Salton or others about clustering,
bibliographic coupling, use of citations or co-citations, the vector
space model, Boolean search methods using inverted files, feedback, etc.
Salton, G.
</document>

<document docid=62>
 Results relating parallel complexity theory (both for PRAM's and
uniform circuits).
</document>

<document docid=63>
 Algorithms for parallel computation, and especially comparisons
between parallel and sequential algorithms.
</document>

<document docid=64>
 List all articles on EL1 and ECL (EL1 may be given as EL/1; I don't
remember how they did it.
</document>

</collection>