ppxscal/embedding_network huggingface dataset:
Universal editor unattainable
Authors: C. S. Yovev
Venue: ACM SIGPLAN Notices (1990)

A universal editor problem has been formulated, based on a notion of editability specified by a class of formal text-manipulation models - T-spaces, for which editability is equivalent to computability.Unlike the superficially similar universal Turing machine problem, the universal editor problem and its complement are not r.e., so the ultimate universal editor is an unattainable goal.Thus the bad news is that we cannot manipulate all editable languages in all possible ways. Nevertheless, there are good news as well: we can still manipulate all r.e. languages in some ways.
Visual programming in an X Windows workstation environment
Authors: James Canning, David Pelland, Sharon Sliger
Venue: ACM SIGSMALL/PC Notes (1992)

The concept of visual programming, merged with contemporary user interfaces for workstations has tremendous potential to transform non high level programmers into visual programmers. Furthermore, visual programming provides an excellent prototyping environment, one which allows the user to intuitively grasp difficult concepts. In this paper we describe our visual programming environment, termed Eyes, and explain how we intend to apply it toward education.
HyperWeb: a framework for hypermedia-based environments
Authors: James C. Ferrans, David W. Hurst, Michael A. Sennett, Burton M. Covnot, Wenguang Ji, Peter Kajka, Wei Ouyang
Venue: ACM SIGSOFT Software Engineering Notes (1992)

Software productivity and quality will increase as we improve our model of software and develop tools to support that model. Development environments must take into account that software is more than source; that it is more than text; and that it forms a highly interconnected web of information. Because more time is spent understanding and maintaining software than creating it, environments should strongly support browsing and reading. Finally, environments must be easy to customize. In this paper we present HyperWeb, a framework that supports the construction of hypermedia-based software development environments having this richer view of software. It coordinates the activities of an integrated set of tools through a message server, uses an object-oriented database to store software artifacts, and supports hypermedia linking of these software artifacts. It is built around an interpreter for a general purpose scripting language, allowing for very flexible customization and environment building. We also describe our experience in using it to build an environment that supports software design, development and maintenance on Unix. Its primary features include support for document linking, source code annotation and restructuring, and modification request tracking. It is being used and evaluated internally and at several external sites.
Probabilistic retrieval based on staged logistic regression
Authors: William S. Cooper, Fredric C. Gey, Daniel P. Dabney
Venue: Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval (1992)

The goal of a probabilistic retrieval system design is to rank the elements of the search universe in descending order of their estimated probability of usefulness to the user. Previously explored methods for computing such a ranking have involved the use of statistical independence assumptions and multiple regression analysis on a learning sample. In this paper these techniques are recombined in a new way to achieve greater accuracy of probabilistic estimate without undue additional computational complexity. The novel element of the proposed design is that the regression analysis be carried out in two or more levels or stages. Such an approach allows composite or grouped retrieval clues to be analyzed in an orderly manner -- first within groups, and then between. It compensates automatically for systematic biases introduced by the statistical simplifying assumptions, and gives rise to search algorithms of reasonable computational efficiency.
Creating pedagogical programming environments
Authors: C. L. Ezell
Venue: ACM SIGCSE Bulletin (1990)

A popular way to introduce program design concepts to beginning programming students is to discuss the solution of familiar, easily decomposed problems involving ordinary situations, such as washing a car or cleaning a room. Extensible languages, such as Smalltalk, make it easy to create pedagogical programming systems on which the solutions of such problems can be implemented.
Spacetime visualization of relativistic effects
Authors: Ping-Kang Hsiung, Robert Thibadeau
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

We have developed an innovative ray-tracing algorithm to describe Relativistic Effects in SpaceTime (&ldquo;REST&rdquo;). Our algorithm, called REST-frame, models light rays that have assumed infinite speed in conventional ray-tracing to have a finite speed c in spacetime, and uses general Lorentz Transformation, which connects the spacetime description of a single event in two inertial coordinate systems (frames) that differ by a constant velocity, to perform the relativistic translation and aberration of light rays. In this paper, we report the extension of our previous work for visualizing relativistic motion in spacetime to include relativistic Doppler color shift and the simulation of complex kinematic systems in which objects of different relativistic velocities coexist. Our simulations have produced non-intuitive images showing anisotropic deformation (warping) of space and intensity concentration/spreading of light sources in spacetime. Images of objects undergoing relativistic Doppler shift are also generated. By applying state-of-the-art computation technology and simulation techniques to the earlier quests in Physics that were conducted mainly by thought experiment, we demonstrate, through our new revelations, that REST-frame offers a powerful experimentation tool to study and explore some of the most exciting aspects of the natural world; particularly, the rich physical properties associated with the finite speed of light.
Performance interpolation for computer simulation models: a simulation-based approach
Authors: Darush Davani
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

This paper proposes a new approach for interpolation in order to obtain an efficient algorithm which will help to reduce the time and computational efforts for estimating system performance at multiple settings from a simulation run at only two or more parameter settings. The algorithm properties and the validity of the estimates were examined by applying it to a multi-component reliability model with a known analytic solution. When implementation of this algorithm becomes operational under a true multi-tasking system, it will provide helpful insights for realization of similar software on parallel computer systems.
Organization of the basic agent
Authors: Steven A. Vere
Venue: ACM SIGART Bulletin (1991)

The Basic Agent is an attempt to create a conscious, mindlike AI artifact embedded in time and functioning in a simulated dynamic environment. The agent integrates temporal planning, temporal reasoning, reactive replanning, action execution, limited natural language understanding and generation, symbolic perception, episodic memory and reflection, and some general knowledge associated with the vocabulary items. A state-change style semantics for action verbs, based on a set of primitive relations, allows convenient integration of the natural language and planning components. The architectural elements of the system and their interaction are described.
Characterization of Signals from Multiscale Edges
Authors: Stephane Mallat, Sifen Zhong
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

A multiscale Canny edge detection is equivalent to finding the local maxima of a wavelet transform. The authors study the properties of multiscale edges through the wavelet theory. For pattern recognition, one often needs to discriminate different types of edges. They show that the evolution of wavelet local maxima across scales characterize the local shape of irregular structures. Numerical descriptors of edge types are derived. The completeness of a multiscale edge representation is also studied. The authors describe an algorithm that reconstructs a close approximation of 1-D and 2-D signals from their multiscale edges. For images, the reconstruction errors are below visual sensitivity. As an application, a compact image coding algorithm that selects important edges and compresses the image data by factors over 30 has been implemented.
Designing collaborative, knowledge-building environments for tomorrow's schools
Authors: Anne Nicol Thomas, James Pellegrino, Peter Rowley, Marlene Scardamalia, Elliot Soloway, Jim Webb
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

The notion that children learn by constructing their own knowledge is highly popular these days among educational theorists. But what are the particular abilities that enable learners to be successful? And how must computer systems, and in particular their user interfaces, be designed to foster and support those abilities? The panel members represent several nationally-recognized education projects, all designed to give children control over their own learning while, at the same time, providing supports for effective learning strategies. They will discuss the unique design issues&ndash;resolved and unresolved&ndash;that arise as cognitive theories meet classroom realities. CSILE, a collaborative, user-constructed database, JASPER, a video-based mathematics program, and MediaText, a multi-media authoring environment, are available for use and review by CHI92 attendees prior to the panel presentation.
Recognition of Hurwitz polynomials
Authors: Vilmar Trevisan
Venue: ACM SIGSAM Bulletin (1990)

An algorithm for recognizing Hurwitz polynomials is presented. It uses a recent result due to Beauzamy and the Euclidean algorithm. Some machine examples with timing are included.
A unified geometric approach to graph separators
Authors: Gary L. Miller, Shang-Hua Teng, Stephen A. Vavasis
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

A class of graphs called k-overlap graphs is proposed. Special cases of k-overlap graphs include planar graphs, k-nearest neighbor graphs, and earlier classes of graphs associated with finite element methods. A separator bound is proved for k-overlap graphs embedded in d dimensions. The result unifies several earlier separator results. All the arguments are based on geometric properties of embedding. The separator bounds come with randomized linear-time and randomized NC algorithms. Moreover, the bounds are the best possible up to the leading term.
Optimal link path queries in a simple polygon
Authors: Esther M. Arkin, Joseph S. B. Mitchell, Subhash Suri
Venue: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1992)

We develop a data structure for answering link distance queries between two arbitrary points in a simple polygon. The data structure requires O(n3) time and space for its construction and answers link distance queries in O(log n) time. Our result extends to link distance queries between pairs of segments or polygons. We also propose a simpler data structure for computing a link distance approximately, where the error is bounded by a small additive constant. Finally, we also present a scheme for approximating the link and the shortest path distance simultaneously.
Augmented role filling capabilities for semantic interpretation of spoken language
Authors: Lewis Norton, Marcia Linebarger, Deborah Dahl, Nghi Nguyen
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

This paper describes recent work on the Unisys ATIS Spoken Language System, and reports benchmark results on natural language, spoken language, and speech recognition. We describe enhancements to the system's semantic processing for handling non-transparent argument structure and enhancements to the system's pragmatic processing of material in answers displayed to the user. We found that the system's score on the natural language benchmark test decreased from 48% to 36% without these enhancements. We also report results for three spoken language systems, Unisys natural language coupled with MIT-Summit speech recognition, Unisys natural language coupled with MIT-Lincoln Labs speech recognition and Unisys natural language coupled with BBN speech recognition. Speech recognition results are reported on the results of the Unisys natural language selecting a candidate from the MIT-Summit N-best (N=16).
Splitting-Integrating Method for Normalizing Images by Inverse Transformations
Authors: Z. C. Li, C. Y. Suen, T. D. Bui, Y. Y. Tang, Q. L. Gu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The splitting-integrating method is a technique developed for the normalization of images by inverse transformation. It does not require solving nonlinear algebraic equations and is much simpler than any existing algorithm for the inverse nonlinear transformation. Moreover, its solutions have a high order of convergence, and the images obtained through T/sup -1/ are free from superfluous holes and blanks, which often occur in transforming digitized images by other approaches. Application of the splitting-integrating method can be extended to supersampling in computer graphics, such as picture transformations by antialiasing, inverse nonlinear mapping, etc.
Constant wavefront iteration methods for nine- and 15-point difference matrices
Authors: O. Axelsson, G. Lindskog
Venue: Computing (1991)

Classical wavefront preconditioned iteration methods for difference matrices on a rectangular or on a rectangular parallelepipedal domain use wavefronts based on diagonal (line or plane, respectively) orderings of the mesh-point. Since such wavefronts do not have constant widths, they cannot be implemented efficiently on parallel computers. We discuss various methods to get wavefronts with constant width for difference matrices for second order elliptic problems. In particular, we discuss their applications for the nine-point (2D) and 15-point (3D) difference approximations for the Laplacian, which are fourth order accurate for proper choices of the coefficients. It turns out that we can easily get preconditioning methods with wavefronts in the form of vertical or horizontal lines both in 2D and 3D, which have condition number Oh-1 , but for general three space dimensional problems no simple ordering leading to constant plane wavefronts seems to exist in general, for which the corresponding preconditioner has such a small condition number. A crucial property we make use of in the methods is the spectral equivalence between the nine-point and the standard five-point difference matrices and between the 15-point and the standard seven-point difference matrices in two and three space dimensions, respectively. The methods use only nearest neighbor connections and can therefore be implemented efficiently not only on shared memory computers but also on distributed memory computer architectures, such as mesh-connected computer architectures. &mdash;Authors' Abstract
Computers, ethics, and values
Authors: Peter G. Neumann
Venue: Communications of the ACM (1991)

Comdex in Las Vegas is the largest North American trade show for personal computer users. The show, which is vast, provided me with many impressions. I jotted many of these in my notebook and will share some of them with you here.
International perspectives: Chair's introduction
Authors: Austin Henderson
Venue: ACM SIGCHI Bulletin (1991)

Two years ago, ACM adopted a five point development plan to guide its efforts to meet the needs of computer professions. One of these five points was to become a truly international organization.
OBSERV&mdash;a prototyping language and environment
Authors: Shmuel Tyszberowicz, Amiram Yehudai
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (1992)

The OBSERV methodology for software development is based on rapid construction of an executable specification, or prototype, of a systems, which may be examined and modified repeatedly to achieve the desired functionality. The objectives of OBSERV also include facilitating a smooth transition to a target system, and providing means for reusing specification, design, and code of systems and subsystems. We are particularly interested in handling embedded systems, which are likely to have concurrency and have some real-time requirements. The OBSERV prototyping language combines several paradigms to express the behavior of a system. The object-oriented approach provides the basic mechanism for building a system from a collection of objects, with well-defined interfaces between them. We use finite-state machines to model the behavior of individual objects. At a lower level, activities that occur within objects, either upon entry to a state or in transition between thus allowing a nonprocedural description. The environment provided to a prototype builder is as important as the language. We have made an attempt to provide flexible tools for executing or simulating the prototype being built, as well as for browsing and static checking. The first implementation of the tools was window based but not graphic. A graphic front end, name CRUISE, was developed afterwards. A simulation sequence focuses on a single object, which can be as complex as necessary, possibly the entire system, and expects all the interactions between it and the outside world to be achieved by communication between the simulator and the user. The simulator allows the user to easily switch back and forth from one object to another, simulating each object in isolation. To enable testing the behavior of a prototype in a realistic environment, it is possible to construct objects that imitate the environment objects. We also allow simulation of systems with missing pieces, by calling upon the user to simulate any such missing piece by himself.
Improving the performance of technologists and users on interdisciplinary teams: an analysis of information systems project teams
Authors: Jonathan K. Trower, Detmar W. Straub,  Jr.
Venue: ACM SIGCPR Computer Personnel (1991)

As the technological dimension of society becomes more complex (Huber, 1984), the role played by technologists will become more important. And as this occurs, the question of motivating these individuals also becomes more important. Little prior empirical research has examined the impact of motivation on the performance of technologists--those workers who work primarily with technology in their job. Potential differences between technologists and nontechnologists in organizations which may effect the impact of motivation on performance include: (1) there tends to be a definable and measurable end-point to their tasks: (2) the work of the technologists will have a major impact on a major portion of the organization; and (3) they are preoccupied with things rather than organizational issues (von Heydebrand 1985, Medcof 1985).
Multidimensional Orientation Estimation with Applications to Texture Analysis and Optical Flow
Authors: Josef Bigün, Gösta H. Granlund, Johan Wiklund
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The problem of detection of orientation in finite dimensional Euclidean spaces is solved in the least squares sense. The theory is developed for the case when such orientation computations are necessary at all local neighborhoods of the n-dimensional Euclidean space. Detection of orientation is shown to correspond to fitting an axis or a plane to the Fourier transform of an n-dimensional structure. The solution of this problem is related to the solution of a well-known matrix eigenvalue problem. The computations can be performed in the spatial domain without actually doing a Fourier transformation. Along with the orientation estimate, a certainty measure, based on the error of the fit, is proposed. Two applications in image analysis are considered: texture segmentation and optical flow. The theory is verified by experiments which confirm accurate orientation estimates and reliable certainty measures in the presence of noise. The comparative results indicate that the theory produces algorithms computing robust texture features as well as optical flow.
Minimal Order Loop-Free Routing Strategy
Authors: Kang G. Shin, Ming-Syan Chen
Venue: IEEE Transactions on Computers (1990)

A multiorder routing strategy is developed which is loop-free even in the presence of link/node failures. Unlike most conventional methods in which the same routing strategy is applied indiscriminately to all nodes in the network, nodes under this proposal may adopt different routing strategies according to the network structure. Formulas are developed to determine the minimal order of routing strategy for each node to eliminate looping completely. A systematic procedure for striking a compromise between the operational overhead and network adaptability is proposed. Several illustrative examples are presented.
A functional DBPL revealing high level optimizations
Authors: Martin Erwig, Udo W. Lipeck
Venue: Proceedings of the third international workshop on Database programming languages : bulk types persistent data: bulk types persistent data (1992)

We present a functional DBPL in the style of FP that facilitates the definition of precise semantics and opens up opportunities for far-reaching optimizations. The language is integrated into a functional data model, which is extended by arbitrary type hierarchies and complex objects. Thus we are able to provide the clarity of FP-like programs together with the full power of semantic data modelling. To give an impression of the special facilities for optimizing functional database languages, we point out some laws not presented before which enable access path selection already on the algebraic level of optimization. The algebraic way of access path optimization also gives new insights into optimization strategies.
LEGALESE: a legal argumentation tool
Authors: D. Charles Hair
Venue: ACM SIGCHI Bulletin (1991)

For my dissertation I have constructed a computer tool called LEGALESE that assists lawyers in the construction of legal arguments. The specific type of legal argument involved is the kind presented in legal briefs, where a lawyer presents an argument on behalf of a client. LEGALESE is a graphical, hypertext based tool that has been constructed on a Macintosh computer using HyperCard.
Protected records, time management and distribution
Authors: Ted Baker
Venue: Proceedings of the fourth international workshop on Real-time Ada issues (1990)

This is a summary of the discussions on three requirement areas: Protected Records; Time Management; Distribution.
Bridge channel access algorithms for integrated services ethernets
Authors: Jim M. Ng, Edward Chan
Venue: ACM SIGCOMM Computer Communication Review (1991)

To provide integrated data/voice services on an inter-connected CSMA/CD type network, a proper channel access algorithm must be used by the bridge in order to minimize the end-to-end delay. Two algorithms, a static aggressive mechanism and a load adaptive dynamic mechanism, are presented and compared with the algorithm specified in the IEEE 802.3 standard. The performance of each algorithm is analyzed, and its suitability for the integrated service environment is evaluated.