all_queries.txt

what articles exist which deal with tss time sharing system an operating system for ibm computers
i am interested in articles written either by prieve or udo pooch prieve b pooch u
intermediate languages used in construction of multitargeted compilers tcoll
im 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 messagepassing are examples of my interests
id like papers on design and implementation of editing interfaces windowmanagers command interpreters etc the essential issues are human interface design with views on improvements to user efficiency effectiveness and satisfaction
interested in articles on robotics motion planning particularly the geometric and combinatorial aspects we are not interested in the dynamics of arm motion
i am interested in distributed algorithms concurrent programs in which processes communicate and synchronize by using message passing areas of particular interest include faulttolerance and techniques for understanding the correctness of these algorithms
addressing schemes for resources in networks resource addressing in network operating systems
security considerations in local networks network operating systems and distributed systems
parallel languages languages for parallel computation
setl very high level languages
portable operating systems
code optimization for space efficiency
find all discussions of optimal implementations of sort algorithms for database management applications
find all discussions of horizontal microcode optimization with special emphasis on optimization of loops and global optimization
find all descriptions of file handling in operating systems based on multiple processes and message passing
optimization of intermediate and machine code
languages and compilers for parallel processors especially highly horizontal microcoded machines code compaction
parallel algorithms
graph theoretic algorithms applicable to sparse matrices
computational complexity intractability classcomplete reductions algorithms and efficiency
i am interested in hiddenline and hiddensurface algorithms for cylinders toroids spheres and cones this is a rather specialized topic in computer graphics
distributed computing structures and algorithms
applied stochastic processes
performance evaluation and modelling of computer systems
concurrency control mechanisms in operating systems
memory management aspects of operating systems
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
numbertheoretic algorithms especially involving prime number series sieves and chinese remainder theorem
articles on text formatting systems including what you see is what you get systems examples tnroff scribe bravo
id 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
id 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 im especially interested in any heuristic algorithms for graph coloring and graph isomorphism using this method
articles about the sensitivity of the eigenvalue decomposition of real matrices in particular zeroone matrices im 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
currently interested in isolation of root of polynomial there is an old more recent material heindel l
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 rabinm
fast algorithm for contextfree language recognition or parsing
articles describing the relationship between data types and concurrency eg what is the type of a process when is a synchronization attempt between two processes type correct in a messagepassing system is there any notion of the types of messagesie any way to check that the sender of the message and the receiver are both treating the bit stream as some particular type
what is the type of a module i dont want the entire literature on abstract data types here but im not sure how to phrase this to avoid it im interested in questions about how one can check that a module matches contexts in which it is used
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 programmersupplied definitions of operators like 
list all articles dealing with data types in the following languages that are referenced frequently in papers on the above languages eg catch any languages with interesting type structures that i might have missed
theory of distributed systems and databases subtopics of special interest include reliability and faulttolerance 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
computer performance evaluation techniques using pattern recognition and clustering la 70803
analysis and perception of shape by humans and computers shape descriptions shape recognition by computer twodimensional shapes measures of circularity shape matching
texture analysis by computer digitized texture analysis texture synthesis perception of texture
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
the application of fuzzy subset theory to clustering and information retrieval problems this includes performance evaluation and automatic indexing considerations
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
the use of computer science principles eg data structures numerical methods in generating optimization eg linear programming algorithms this includes issues of the khachian russian ellipsoidal algorithm and complexity of such algorithms
the role of information retrieval in knowledge based systems ie expert systems
parallel processors in information retrieval
parallel processors and paging algorithms
modelling and simulation in agricultural ecosystems
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
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
anything dealing with star height of regular languages or regular expressions or regular events
articles relation the algebraic theory of semigroups and monoids to the study of automata and regular languages
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 629630 backus j de millo r lipton r perlis a
algorithms or statistical packages for anova regression using least squares or generalized linear models system design capabilities statistical formula are of interest students t test wilcoxon and sign tests multivariate and univariate components can be included
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
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
information retrieval articles by gerard salton or others about clustering bibliographic coupling use of citations or cocitations the vector space model boolean search methods using inverted files feedback etc salton g
results relating parallel complexity theory both for prams and uniform circuits
algorithms for parallel computation and especially comparisons between parallel and sequential algorithms
list all articles on el1 and ecl el1 may be given as el1 i dont remember how they did it