ppxscal/embedding_network huggingface dataset:
JAVA Phrasebooks for comuters algebra and automated deduction
Authors: Olga Caprotti, Arjeh M. Cohen, Manfred Riem
Venue: ACM SIGSAM Bulletin (2000)

We discuss the developments within the OpenMath framework regarding programs that make it possible for a software package to interact with other packages or agents, namely Phrasebooks. Recently, several implementations of Phrasebooks have come about; we shall describe some of them. Most of the software is freely available, so, by downloading it and inspecting implemented examples, builders of software packages can pick up the examples and provide the mathematical community with further computational servers that can easily be interfaced.
Distributed sensor network for real time tracking
Authors: Bryan Horling, Régis Vincent, Roger Mailler, Jiaying Shen, Raphen Becker, Kyle Rawlins, Victor Lesser
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

In this paper we describe our solution to a real-time distributed resource allocation application involving distributed situation assessment. The hardware configuration consists of a set of reconfigurable sensors at fixed locations, each having local processing and low-bandwidth communication capabilities with other sensor nodes. The objective is to track objects moving in the environment in real-time as best as possible, given uncertainty and constraints on sensor loads, communication, power consumption, action characteristics, and clock synchronization. Once the target is detected, the sensors must communicate and cooperate so that, within a given window of time, the data needed to triangulate the position of the target can be collected. Our solution to this problem decomposes the environment into a number of sectors, where individual sensor nodes in a sector are specialize dynamically to address different parts of the goal. We describe our solution to this problem in detail, including the high-level architecture and a number of the more interesting implementation challenges. Results and future direction are also covered.
Manageability, availability, and performance in porcupine: a highly scalable, cluster-based mail service
Authors: Yasushi Saito, Brian N. Bershad, Henry M. Levy
Venue: ACM Transactions on Computer Systems (TOCS) (2000)

This paper describes the motivation, design and performance of Porcupine, a scalable mail server. The goal of Porcupine is to provide a highly available and scalable electronic mail service using a large cluster of commodity PCs. We designed Porcupine to be easy to manage by emphasizing dynamic load balancing, automatic configuration, and graceful degradation in the presence of failures. Key to the system's manageability, availability, and performance is that sessions, data, and underlying services are distributed homogeneously and dynamically across nodes in a cluster.
On the computation of least squares polynomials
Authors: Morton Goldberg
Venue: Communications of the ACM (1967)

Rounding error accumulated during digital computation of a least squares polynomial makes the computed polynomial only an approximation to the true least squares polynomial. A simple method for adjusting the constant term of the computed polynomial to get a better approximation to the true least squares polynomial is described.
An algorithm for generating projective reduction formulas for matrix elements of many-electron wavefunctions
Authors: C. M. Reeves
Venue: Communications of the ACM (1966)

An ALGOL procedure is given for automatically generating formulas for matrix elements arising in the variational solution of the Schr&ouml;dinger equation for many-electron systems.
Verification by simulation comparison using interface synthesi
Authors: C. Hansen, A. Kunzmann, W. Rosenstiel
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

One of the main tasks within the high-level synthesis (HLS) process is the verification problem to prove automatically the correctness of the synthesis results. Currently, the results are usually checked by simulation. In consequence, both the behavioral specification and the HLS results have to be simulated by the same set of test vectors. Due to the HLS and the inherent changes in the cycle-by-cycle behavior, the synthesis results require an adaption of the initial test vector set. This reduces the advantage gained by using the automated HLS process. In order to decrease these simulation efforts, in this paper a new method will be presented that enables the usage of the same simulation vectors at both abstraction levels and the execution of an automated simulation comparison.
Improving the granularity of access control in Windows NT
Authors: Michael M. Swift, Peter Brundrett, Cliff Van Dyke, Praerit Garg, Anne Hopkins, Shannon Chan, Mario Goertzel, Gregory Jensenworth
Venue: Proceedings of the sixth ACM symposium on Access control models and technologies (2001)

This paper presents the access control mechanisms in Windows 2000 that enable fine-grained protection and centralized management. These mechanisms were added during the transition from Windows NT 4.0 to support the Active Directory, a new feature in Windows 2000. We first extended entries in access control lists to allow rights to apply to just a portion of an object. The second extension allows centralized management of object hierarchies by specifying more precisely how access control lists are inherited. The final extension allows users to limit the rights of executing programs by restricting the set of objects they may access. These changes have the combined effect of allowing centralized management of access control while precisely specifying which accesses are granted to which programs.
Specification, Refinement and Verification of Concurrent Systems&mdash;An Integration of Object-Z and CSP
Authors: Graeme Smith, John Derrick
Venue: Formal Methods in System Design (2001)

This paper presents a method of formally specifying, refining and verifying concurrent systems which uses the object-oriented state-based specification language Object-Z together with the process algebra CSP. Object-Z provides a convenient way of modelling complex data structures needed to define the component processes of such systems, and CSP enables the concise specification of process interactions. The basis of the integration is a semantics of Object-Z classes identical to that of CSP processes. This allows classes specified in Object-Z to be used directly within the CSP part of the specification.In addition to specification, we also discuss refinement and verification in this model. The common semantic basis enables a unified method of refinement to be used, based upon CSP refinement. To enable state-based techniques to be used for the Object-Z components of a specification we develop state-based refinement relations which are sound and complete with respect to CSP refinement. In addition, a verification method for static and dynamic properties is presented. The method allows us to verify properties of the CSP system specification in terms of its component Object-Z classes by using the laws of the CSP operators together with the logic for Object-Z.
Automatic translation of Fortran to JVM bytecode
Authors: Keith Seymour, Jack Dongarra
Venue: Proceedings of the 2001 joint ACM-ISCOPE conference on Java Grande (2001)

This paper reports on the design of a FORTRAN-to-Java translator whose target language is the instruction set of the Java Virtual Machine. The goal of the translator is to generate Java implementations of legacy FORTRAN numerical codes in a consistent and reliable fashion. The benefits of directly generating bytecode are twofold. First, it provides a much more straightforward and efficient mechanism for translating FORTRAN GOTO statements. Second, it provides a framework for pursuing various compiler optimizations, which could be beneficial not only to our project, but to the Java community as a whole.
A Note on Median Split Trees
Authors: Douglas Comer
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1980)

The median split tree is an elegant technique for searching static sets of keys when the frequency of access is highly skewed. This paper generalizes the median split search technique, relates it to sequential search and binary search, discusses the choice of an optimum search strategy for a given set of keys, and poses several related optimization problems.
The history of versaCAD
Authors: Carl Machover
Venue: ACM SIGGRAPH Computer Graphics (2001)

For this issue's column, I'm delighted to bring you some reminiscences courtesy of Tom Lazear, President of Archway Systems. Tom wrote one of the first (Gwen Bell of the Computer Museum cautioned me never to claim anything as the first!) PC-CAD (computer-aided design) systems. T-Square, for the Terak PC, was subsequently adapted as CADapple for the ApplellE, and preceded AutoCAD (which was written for the IBM PC).Before presenting Tom's article, I want to remind you of ongoing Pioneer opportunities. Pioneer membership requires at least 20 years in the field, which means that if you were involved in computer graphics by 1981, you're now eligible for membership! Let's hear from you.
Solving the biharmonic equation in a square: a direct versus a semidirect method
Authors: L. W. Ehrlich
Venue: Communications of the ACM (1973)

Two methods for solving the biharmonic equation are compared. One method is direct, using eigenvalue-eigenvector decomposition. The other method is iterative, solving a Poisson equation directly at each iteration.
Computer photocomposition of technical text
Authors: Franz L. Alt, Judith Yuni Kirk
Venue: Communications of the ACM (1973)

In computer assisted typesetting by means of photocomposition, special problems arise in highly technical material such as mathematical formulas. New solutions to several of these problems have been devised in the information system of the American Institute of Physics. They include: the representation of special characters (foreign alphabets, mathematical symbols, etc.) not available on input keyboards or on the photocomposer; the generation of such symbols, e.g. by overprinting; the precise positioning of accent marks (floating diacritics); line breaks, i.e. words or formulas placed partly at the end of one line and partly at the beginning of the next; and certain aspects of error correction.
Linear-Time Self-Interpretation of the Pure Lambda Calculus
Authors: Torben æ. Mogensen
Venue: Higher-Order and Symbolic Computation (2000)

We show that linear-time self-interpretation of the pure untyped lambda calculus is possible, in the sense that interpretation has a constant overhead compared to direct execution under various execution models. The present paper shows this result for reduction to weak head normal form under call-by-name, call-by-value and call-by-need.We use a self-interpreter based on previous work on self-interpretation and partial evaluation of the pure untyped lambda calculus.We use operational semantics to define each reduction strategy. For each of these we show a simulation lemma that states that each inference step in the evaluation of a term by the operational semantics is simulated by a sequence of steps in evaluation of the self-interpreter applied to the term (using the same operational semantics).By assigning costs to the inference rules in the operational semantics, we can compare the cost of normal evaluation and self-interpretation. Three different cost-measures are used: number of beta-reductions, cost of a substitution-based implementation (similar to graph reduction) and cost of an environment-based implementation.For call-by-need we use a non-deterministic semantics, which simplifies the proof considerably.
Visual Speech Synthesis by Morphing Visemes
Authors: Tony Ezzat, Tomaso Poggio
Venue: International Journal of Computer Vision (2000)

We present MikeTalk, a text-to-audiovisual speech synthesizer which converts input text into an audiovisual speech stream. MikeTalk is built using visemes, which are a small set of images spanning a large range of mouth shapes. The visemes are acquired from a recorded visual corpus of a human subject which is specifically designed to elicit one instantiation of each viseme. Using optical flow methods, correspondence from every viseme to every other viseme is computed automatically. By morphing along this correspondence, a smooth transition between viseme images may be generated. A complete visual utterance is constructed by concatenating viseme transitions. Finally, phoneme and timing information extracted from a text-to-speech synthesizer is exploited to determine which viseme transitions to use, and the rate at which the morphing process should occur. In this manner, we are able to synchronize the visual speech stream with the audio speech stream, and hence give the impression of a photorealistic talking face.
Web-based network analysis and design
Authors: Dhananjai Madhava Rao, Radharamanan Radhakrishnan, Philip A. Wilsey
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2000)

The gradual acceptance of high-performance networks as a fundamental component of today's computing environment has allowed applications to evolve from static entities located on specific hosts to dynamic, distributed entities that are resident on one or more hosts. In addition, vital components of software and data used by an application may be distributed across the local/wide area network. Given such a fluid and dynamic environment, the design and analysis of high-performance communication networks (using off-the-shelf components offered by third party manufacturers) has been further complicated by the diversity of the available components. To alleviate these problems and to address the verification and validation issues involved in engineering such complex networks, a web-based framework for the design and analysis of computer networks was developed. Using the framework, a designer can explore design alternatives by constructing and analyzing configurations of the design using components offered by different researchers and manufacturers. The framework provides a flexible and robust environment for selecting and verifying the optimal solution from a large and complex solution space. This paper presents issues involved in the design and development of the framework.
A multimodal framework for music inputs (poster session)
Authors: Goffredo Haus, Emanuele Pollastri
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

The growth of digital music databases imposes new content-based methods of interfacing with stored data; although indexing and retrieval techniques are deeply investigated, an integrated view of querying mechanism has never been established before. Moreover, the multimodal nature of music should be exploited to match the users' expectations as well as their skills. In this paper, we propose a hierarchy of music-interfaces that is suitable for existent prototypes of music information retrieval systems; according to this framework, human/computer interaction should be improved by singing, playing or notating music. Dealing with multiple inputs poses many challenging problems for both their combination and the low-level translation needed to transform an acoustic signal into a symbolic representation. This paper addresses the latter problem in some details, aiming to develop music-interfaces available not only to trained-musician.
The development of decision tables via parsing of complex decision situations
Authors: Horst Strunz
Venue: Communications of the ACM (1973)

A new parsing technique is proposed which allows parsing based only on syntactical characteristics of the decision problem. It requires a description of the problem in decision grid chart format and allows the development of decision tables within defined limits by avoiding, or at least minimizing, repetition of conditions and actions in the resulting tables.
Transfusion Cost Containment for Abdominal Surgery with Neural Networks
Authors: Steven Walczak, John E. Scharf
Venue: Neural Processing Letters (2000)

Typing and crossmatching blood is a significant cost for most hospitals, regardless of whether the blood is actually transfused. Many hospitals have implemented a Maximum Surgical Blood Order Schedule, MSBOS, to control over-ordering of blood units for surgery. The research presented in this article examines the use of neural networks for predicting the quantity of blood required by individual patients undergoing abdominal surgery (e.g. splenectomy). A comparison is made between the neural network predictions at a particular hospital versus the current MSBOS methodology for ordering surgical blood, by using the crossmatch to transfusion ratio. Results from the neural network transfusion predictions for the abdominal aortic aneurysm (AAA) surgery imply that neural networks can significantly improve the transfusion efficiency of hospitals. However, further examination of neural network capabilities for predicting the transfusion needs of patients undergoing other types of abdominal surgeries indicates that for operations other than the AAA, neural networks tend to under-predict the transfusion requirements of ten percent of the patients. Even if not used to limit over-ordering of blood for surgical transfusions, neural networks may be used as an intelligent decision support system to evaluate the current efficiency of hospital transfusion practices and to indicate beneficial changes to current MSBOS values.
Some characteristics of sorting computing systems using random access storage devices
Authors: George U. Hubbard
Venue: Communications of the ACM (1963)

The substantial differences in characteristics of random access storage and tape devices dictate that concepts and objectives of computer program design be considered from the viewpoint of the external file medium used. This is particularly true in the case of sorting. In a tape-oriented system, the major sorting problem is that of minimizing merge time despite the limited orders of merge possible. In contrast, sorting in a random access-oriented system encourages the selection of the optimum order of merge from many possible orders. The latter problem is discussed in this paper, along with criteria developed for determining the optimum order of merge according to the various properties of random access storage devices. Attention is also given to the problem of key sorting versus record sorting and the possibly serious disadvantage of key sorting on a random access system.
Habitat monitoring: application driver for wireless communications technology
Authors: Alberto Cerpa, Jeremy Elson, Michael Hamilton, Jerry Zhao, Deborah Estrin, Lewis Girod
Venue: Workshop on Data communication in Latin America and the Caribbean (2001)

As new fabrication and integration technologies reduce the cost and size of micro-sensors and wireless interfaces, it becomes feasible to deploy densely distributed wireless networks of sensors and actuators. These systems promise to revolutionize biological, earth, and environmental monitoring applications, providing data at granularities unrealizable by other means. In addition to the challenges of miniaturization, new system architectures and new network algorithms must be developed to transform the vast quantity of raw sensor data into a manageable stream of high-level data. To address this, we propose a tiered system architecture in which data collected at numerous, inexpensive sensor nodes is filtered by local processing on its way through to larger, more capable and more expensive nodes. We briefly Habitat monitoring as our motivating application and introduce initial system building blocks designed to support this application. The remainder of the paper presents details of our experimental platform.
The natural language of interactive systems
Authors: Henry Ledgard, John A. Whiteside, Andrew Singer, William Seymour
Venue: Communications of the ACM (1980)

The work reported here stems from our deep belief that improved human engineering can add significantly to the acceptance and use of computer technology. In particular, this report describes an experiment to test the hypothesis that certain features of natural language provide a useful guide for the human engineering of interactive command languages. The goal was to establish that a syntax employing familiar, descriptive, everyday words and well-formed English phrases contributes to a language that can be easily and effectively used. Users with varying degrees of interactive computing experience used two versions of an interactive text editor; one with an English-based command syntax in the sense described above, the other with a more notational syntax. Performance differences strongly favored the English-based editor.
Meeting the crisis in computer science
Authors: Stephen S. Yau, Robert W. Ritchie, Warren Semon, Joseph Traub, Andries Van Dam, Stanley Winkler
Venue: Communications of the ACM (1983)

Participants in the 1982 Snowbird Conference reassessed the problems in computer science education and recommended steps for improvement.
The BKS system for the Philco-2000
Authors: Richard B. Smith
Venue: Communications of the ACM (1961)

The BKS System is a program sequencing system designed for the Philco-2000 computer to meet operational requirements of the Bettis and Knolls Atomic Power Laboratories. The Philco-2000 on which this system is being used has a 32,768-word memory, 16 tape transports on-line, and an electric typewriter on-line. The card-to-tape, card-to-printer, tape-to-card, tape-to-printer, and routine tape-to-tape operations are performed with off-line equipment.
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
Authors: Claire Kenyon, Eric Rémila
Venue: Mathematics of Operations Research (2000)

We present an asymptotic fully polynomial approximation scheme for strip-packing, or packing rectangles into a rectangle of fixed width and minimum height, a classicalNP-hard cutting-stock problem. The algorithm, based on a new linear-programming relaxation, finds a packing ofn rectangles whose total height is within a factor of (1 +e) of optimal (up to an additive term), and has running time polynomial both in n and in 1/ e.
On an algorithm for nonlinear minimax approximation
Authors: G. A. Watson
Venue: Communications of the ACM (1970)

Certain nonlinear minimax approximation problems are characterized by properties which permit the application of special algorithms, mainly based on the exchange algorithms of Remes (1934, 1935), for their solution. In this paper the application to problems of this type of a general nonlinear algorithm due to Osborne and Watson (1969) is considered. Examples are given to illustrate that this algorithm can give satisfactory results and, in particular, can successfully solve problems which lead to difficulties with the more conventional specialist method.
Remark on algorithm 162: Near-minimax polynomial approximations and partitioning of intervals
Authors: W. Fraser, J. F. Hart
Venue: Communications of the ACM (1964)

A method of near-minimax polynomial approximation is described. As a by-product, this method provides a formula for an estimate of the maximum error associated with a given degree of approximation. Using this formula, a partitioning algorithm is obtained for dividing a basic interval into sub-intervals for which approximations of equal degree give equal maximum error.
Attribute based file organization in a paged memory environment
Authors: James B. Rothnie,  Jr., Tomas Lozano
Venue: Communications of the ACM (1974)

The high cost of page accessing implies a need for for more careful data organization in a paged memory than is typical of most inverted file and similar approaches to multi-key retrieval. This article analyses that cost and proposes a method called multiple key hashing which attempts to minimize it. Since this approach is not always preferable to inversion, a combined method is described. The exact specifications of this combination for a file with given data and traffic characteristics is formulated as a mathematical program. The proposed heuristic solution to this program can often improve on a simple inversion technique by a factor of 2 or 3.