ppxscal/embedding_network huggingface dataset:
On Modulus Replication for Residue Arithmetic Computations of Complex Inner Products
Authors: N. M. Wigley, G. A. Jullien
Venue: IEEE Transactions on Computers (1990)

A technique is presented for coding weighted magnitude components (e.g. bits) of numbers directly into polynomial residue rings, such that repeated use may be made of the same set of moduli to effectively increase the dynamic range of the computation. This effectively limits the requirement for large sets of relatively prime moduli, For practical computations over quadratic residue rings, at least 6-bit moduli have to be considered. It is shown that 5-bit moduli can be effectively used for large dynamic range computations.
LiB: a cell layout generator
Authors: Yung-Ching Hsieh, Chi-Yi Hwang, Youn-Long Lin, Yu-Chin Hsu
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

We present an automatic layout generation system, called LiB, for the library cells used in CMOS ASIC design. LiB takes a transistor-level circuit schematic in SPICE format and outputs a symbolic layout. Our layout style is similar to that proposed by Uehara and van Cleemput in [17]. We propose several heuristic algorithms to solve the transistor-clustering, -pairing, -chaining, -folding, the chain placement, the routing, and the net assignment problems, respectively. Experimental results are presented to show the capability of LiB.
A Special Function Unit for Database Operations (SFU-DB): Design and Performance Evaluation
Authors: Herman Lam, Chiang Lee, Stanley Y. W. Su
Venue: IEEE Transactions on Computers (1991)

The design and analysis of a special function unit for database operations (SFU-DB) that uses a novel hardware sorting module, the automatic retrieval memory (ARM), are described. The SFU-DB is a functionally independent unit that efficiently performs certain nonnumeric operations. It can function as a coprocessor for a host CPU or as a special processing unit in a highly parallel processing system. The ARM implements in hardware a true distribution-based sort algorithm that requires no comparison operations. Without performing any comparison, the SFU-DB avoids the lower bound constraint on comparison-based sorting algorithms and achieves, for the worst case, a complexity of O(n) for both execution time and main memory size. Using the fundamental sort algorithm with slight modifications. the SFU-DB also uses the ARM as an engine for other primitive database operations such as relational join, elimination of duplicates, set union, set intersection, and set difference, also with complexity of O(n). The SFU-DB/ARM architecture is rather simple and requires only a modest amount of specialized hardware. The specialized hardware has been designed and simulated for fabrication using CMOS gate arrays, and the remainder of the SFU-DB has been simulated in software using Turbo Pascal running on an IBM-PC.
Improved Algorithms for Partitioning Problems in Parallel, Pipelined, and Distributed Computing
Authors: Pierre Hansen, Keh-Wei Lih
Venue: IEEE Transactions on Computers (1992)

S.H. Bokhari has studied the assignment of the modules of a parallel program to the processors of a multiple-computer system. He proposed algorithms to solve optimally the following problems: (1) partition chain-structured parallel or pipelined programs over chain-connected systems; (2) partition multiple chain-structured parallel or pipelined programs over single-host multiple satellite systems; (3) partition multiple arbitrarily structured serial programs over single-host multiple-satellite systems; (4) partition single-tree structured parallel or pipelined programs over single-host multiple identical satellite systems. The authors solve here problem 1 by dynamic programming and problem 2 by sorting and using bisection search for the bottleneck value. They also note that Bokhari's algorithms for problems 3 and 4 can be improved by using recent results of G. Gallo et al. (1989), and by implementing E.W. Dijkstra's (1959) algorithm, which is used as a subroutine, with a heap structure. The time complexity of all algorithms is thus reduced.
The winds of change?
Authors: Marianne Winslett
Venue: ACM SIGMOD Record (1992)

In this issue, we bring you coverage of recent events in the US that may have an impact on database funding, especially at NSF. We also announce two upcoming NSF Small Business Innovative Research Conferences and requests for proposals from the Air Force, the Army, and the folks at the Strategic Defense Initiative. A new database/knowledge-base BAA and other bits of news from DARPA round out the funding news for this issue.
A Markov chain approximation for the analysis of banyan networks
Authors: Arif Merchant
Venue: ACM SIGMETRICS Performance Evaluation Review (1991)

This paper analyzes the delay suffered by messages in a clocked, packet-switched, square Banyan network with k x k output-buffered switches by approximating the flow processes in the network with Markov chains. We recursively approximate the departure process of buffers of the nth stage in terms of thqt at the n -- lst stage. We show how to construct the transition matrix for the Markov chain at each stage of the network and how to solve for the stationary distribution of the delay in the queues of that stage. The analytical results are compared with simulation results for several cases. Finally, we give a method based on this approximation and the technique of coupling to compute upper bounds on the time for the system to approach steady state.
UnicStep-a visual stepper for COMMON LISP: portability and language aspects
Authors: Ivo Haulsen, Angela Sodan
Venue: ACM SIGPLAN Lisp Pointers (1989)

This article presents a visual stepper for Common Lisp with simple backup feature. The stepper is based on Lieberman's approach for visual stepping. The stepper operates at the source level of programs and uses the GNU Emacs editor for source code processing. Problems encountered on implementing this stepper are described: read-syntax, macroexpansion, and source-localization. Especially, language features are discussed which affected our goal to make this tool portable across Common Lisp systems.
Experience with transactions in QuickSilver
Authors: Frank Schmuck, Jim Wylie
Venue: Proceedings of the thirteenth ACM symposium on Operating systems principles (1991)

All programs in the QuickSilver distributed system behave atomically with respect to their updates to permanent data. Operating system support for transactions provides the framework required to support this, as well as a mechanism that unifies reclamation of resources after failures or normal process termination. This paper evaluates the use of transactions for these purposes in a general purpose operating system and presents some of the lessons learned from our experience with a complete running system based on transactions. Examples of how transactions are used in QuickSilver and measurements of their use demonstrate that the transaction mechanism provides an efficient and powerful means for solving many of the problems introduced by operating system extensibility and distribution.
Feature inversion: a practice on language versions determination
Authors: K. C. Wong
Venue: ACM SIGPLAN Notices (1992)

This paper briefly summarizes the work we have done on language versions determination in distributed systems. It is shown that a computer program can still be successfully compiled, locally or remotely, even though the host node does not support the desired version(s) and/or the program is written in multiple versions, disjoint or not. The approach is especially appropriate for those systems with a high potential to grow and expand frequently.
Electronic social fields in bureaucracies
Authors: Constance Perin
Venue: Communications of the ACM (1991)

Advanced computer tools designed to facilitate collaboration in a common task or across functions have had a remarkably disappointing record of diffusion and adoption [16]. Technologies that are unresponsive to users needs will not find their markets. Groupware such as electronic mail, conferencing, and on-line editing, however, has an apparently natural affinity to the team and project work of salaried professional employees.
Corolla based circuit partitioning and resynthesis
Authors: Sujit Dey, Franc Brglez, Gershon Kedem
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

This paper introduces a circuit partitioning method based on analysis of reconvergent fanout. We consider a DAG model for a circuit. We define a corolla as a set of overlapping reconvergent fanout regions. We partition the DAG into a set of non-overlapping corollas and use the corollas to resynthesize the circuit. We show that resynthesis of large benchmark circuits consistently reduces transistor pairs and layout area while improving delay and testability.
A multimodel methodology for qualitative model engineering
Authors: Paul A. Fishwick, Bernard P. Zeigler
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (1992)

Qualitative models arising in artificial intelligence domain often concern real systems that are difficult to represent with traditional means. However, some promise for dealing with such systems is offered by research in simulation methodology. Such research produces models that combine both continuous and discrete-event formalisms. Nevertheless, the aims and approaches of the AI and the simulation communities remain rather mutually ill understood. Consequently, there is a need to bridge theory and methodology in order to have a uniform language when either analyzing or reasoning about physical systems. This article introduces a methodology and formalism for developing multiple, cooperative models of physical systems of the type studied in qualitative physics. The formalism combines discrete-event and continuous models and offers an approach to building intelligent machines capable of physical modeling and reasoning.
A first encounter with f90
Authors: Michael Metcalf
Venue: ACM SIGPLAN Fortran Forum (1992)

A few weeks before the formal publication of the International Fortran 90 Standard, the world's first Fortran 90 compiler (f90) was announced. CERN was invited to perform beta-testing, and the opportunity was taken subsequently to assess the impact of Fortran 90 on the CERN Program Library.
Recursive Regularization Filters: Design, Properties, and Applications
Authors: Michael Unser, Akram Aldroubi, Murray Eden
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

Least squares approximation problems that are regularized with specified highpass stabilizing kernels are discussed. For each problem, there is a family of discrete regularization filters (R-filters) which allow an efficient determination of the solutions. These operators are stable symmetric lowpass filters with an adjustable scale factor. Two decomposition theorems for the z-transform of such systems are presented. One facilitates the determination of their impulse response, while the other allows an efficient implementation through successive causal and anticausal recursive filtering. A case of special interest is the design of R-filters for the first- and second-order difference operators. These results are extended for two-dimensional signals and, for illustration purposes, are applied to the problem of edge detection. This leads to a very efficient implementation (8 multiplies+10 adds per pixel) of the optimal Canny edge detector based on the use of a separable second-order R-filter.
Finding circular relationships in networks
Authors: Kenneth Fordyce, Jan Jantzen, Gerald Sullivan
Venue: ACM SIGAPL APL Quote Quad (1990)

A critical computational requirement for many of the decision technologies in the fields of MS/OR, AI/KBS, and DSS is the development and manipulation of a network describing the relationship between "actors" involved in the application of the decision technology to a specific problem. The manipulation of such networks using Boolean arrays and functions is well known in the APL community (see bibliography). Often in such networks it is important to identify circular conditions as a preprocessing step, but the techniques to accomplish often yield incomplete information. This paper describes a simple and efficient method to find all circular conditions as a preprocessing step.This paper is a subset of a longer paper (Fordyce, Jantzen, and Sullivan, 1990) which describes how we can fully build and manipulate a function network with Boolean arrays including focusing networks, finding circular conditions, and grouping functions based on relative independence to identify parallel computational opportunities and substantially reduces the non-procedural aspect of the problem.
Analysis and refutation of the LCAS
Authors: W. Kahan
Venue: ACM SIGNUM Newsletter (1991)

A Language Compatible Arithmetic Standard (LCAS) has been proposed as International Standard ISO/IEC 10967:1991 for Language Compatible Arithmetic, Project JTC.22.28, Version 3.1 (1 March 1991), by Drs. Mary Payne and Brian Wichmann. An earlier version appeared in both ACM SIGNUM and ACM SIGPLAN 25 1 (Jan. 1990). The following remonstrance has been sent to ANSI X3-T2, the American committee in charge of the proposal:This proposed Language Compatible Arithmetic Standard is so severely flawed that the computing world must reject it.
Design management based on design traces
Authors: Andrea Casotto, A. Richard Newton, Alberto Sangiovanni-Vincentelli
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

VOV is an automatic manager for VLSI design. It is based on the idea that CAD tools can leave a &ldquo;trace&rdquo; of their execution. The trace is represented as a bipartite directed and acyclic graph, in which the nodes represent either design data or CAD transactions. By managing and analyzing the traces, VOV offers a wide variety of services related to design management, such as coordination of team design, automatic execution of CAD transactions, capture of design history and data dependencies. All of these services are provided in a non-intrusive fashion. VOV has the notion of measurement on the design data, an ingredient which is necessary to provide even more services: tracking of design specifications, validation of design data, design estimation.
Software Specialization Via Symbolic Execution
Authors: Alberto Coen-Porisini, Flavio De Paoli, Carlo Ghezzi, Dino Mandrioli
Venue: IEEE Transactions on Software Engineering (1991)

A technique and an environment-supporting specialization of generalized software components are described. The technique is based on symbolic execution. It allows one to transform a generalized software component into a more specific and more efficient component. Specialization is proposed as a technique that improves software reuse. The idea is that a library of generalized components exists and the environment supports a designer in customizing a generalized component when the need arises for reusing it under more restricted conditions. It is also justified as a reengineering technique that helps optimize a program during maintenance. Specialization is supported by an interactive environment that provides several transformation tools: a symbolic executor/simplifier, an optimizer, and a loop refolder. The conceptual basis for these transformation techniques is described, examples of their application are given, and how they cooperate in a prototype environment for the Ada programming language is outlined.
A parallel branch-and-bound algorithm for MIN-based multiprocessors
Authors: Myung K. Yang, Chita R. Das
Venue: ACM SIGMETRICS Performance Evaluation Review (1991)

A parallel "Decomposite Best-First" search Branch-and-Bound algorithm (pdbsbb) for MIN-based multiprocessor systems is proposed in this paper. A conflict free mapping scheme, known as step-by-step spread, is used to map the algorithm efficiently on to a MIN-based system for reducing communication overhead. It is shown that the proposed algorithm provides better speed-up than other reported schemes when communication overhead is taken into consideration.
Reuse_system software repository tool concepts
Authors: Greg Gicca
Venue: ACM SIGAda Ada Letters (1991)

This paper discusses a software tool called the Reuse_System. The tool was developed using the Ada language to promote software reuse. It automates concepts designed to aid in both the storage and retrieval of existing software. Its own design emphasizes end user activities in finding and then extracting software for reuse.
Categorizing scenarios: a quixotic quest?
Authors: Robert L. Campbell
Venue: ACM SIGCHI Bulletin (1992)

I'm pleased to discover how many HCI practitioners are busy thinking about all this scenario talk. I wish I'd known about some of the work reported in this issue (particularly Jakob Nielsen's contribution, and that of Richard Young and Phil Barnard) before I launched my squib.
An Algorithm for Scaling and Single Residue Error Correction in Residue Number Systems
Authors: C.-C. Su, H.-Y. Lo
Venue: IEEE Transactions on Computers (1990)

An algorithm for scaling and single residue digit error correction is proposed. This algorithm is fully based on mixed radix conversion (MRC). The redundant digits of MRC can be used to establish a lookup table to correct single residue digit errors. By using this algorithm the error correction and scaling operation can be unified in one hardware, thereby reducing the complexity of these implementations. The scaling error e/sub s/ is analyzed and found to be limited to the interval of -1>e/sub s/>1. Since scaling is often required in the computations of digital signal processing (DSP), which is the main application of RNS, and error-correction circuit with scaling (ECCS) will by very efficient in the fault-tolerant systems for the DSP applications. Two examples for the application of the proposed ECCS are given.
The possibility and the complexity of achieving fault-tolerant coordination
Authors: Rida Bazzi, Gil Neiger
Venue: Proceedings of the eleventh annual ACM symposium on Principles of distributed computing (1992)

The problem of fault-tolerant coordination is fundamental in distributed computing. In the past, researchers have considered two types of coordination: general coordination, in which the actions of faulty processors are irrelevant, and consistent coordination, in which the faulty processors are forbidden from acting inconsistently. This paper studies the possibility and complexity of achieving coordination in synchronous and asynchronous systems with crash, send-omission, and general omission failures. We indicate the systems in which coordination cannot be achieved and, when it can, analyze the computational complexity of optimally achieving it. In some cases, optimum solutions can be implemented in polynomial time, while in others they require NP-hard local computation. These results provide a thorough characterization of coordination and will thus aid researchers in determining the approach to take when attempting to achieve fault-tolerant coordination.
IMT-RB/ED: a system based on multi-reorganization (abstract)
Authors: Ye Yiming, Chen Zhao-Xiong, Zhang Xiong, Gao Qinshi
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

With the advance of AI and the coming of the idea of intelligent MT system, several important practical and theoretical advances have been made in the field of machine translation. Recently a system called IMTRB/EC is being implemented in our institute. It is the grammar rule based system of IMT/EC (Intelligent English-Chinese Translation System) and is a relatively independent and complete subsystem. As a rule based system, many AI techniques have been used in it. This paper presents a method for the multi-reorganization of the rule base system and the general principles of IMT-RB/EC. This system is composed by six parts: rule base, parsing mechanism, rule accessing mechanism and man-machine interfaces. A transformation rule is composed by five parts: source expression, target expression, condition, context change and Chinese translation. The knowledge and the algorithms are separated, the rules are divided into layers. We make the system as subset of grammar rules, the learning mechanism can add new rules or delete unsatisfied rules or change a rule according to the running result or the knowledge of expert. With different attributes (dynamic or quiescent factors), we realized the multi-reorganization. The result of multi-reorganization will be used as the heuristic information. The performance of the system is greatly improved by apply these techniques.
The Q-bit scheme: congestion avoidance using rate-adaptation
Authors: O. Rose
Venue: ACM SIGCOMM Computer Communication Review (1992)

Modern protocols designed for high-speed networks mostly adapt the rate at which packets are transmitted to control the flow of data between a sender and a receiver, and to control the load put upon the underlying network. In this article, the use of rate-adaption to realize 'congestion avoidance', a recently proposed highly sophisticated technique to control overload-conditions in networks is examined. With a simple analytical model of the system, expressions which help to tune it are derived. By directly comparing the resulting system to the well-known DECbit scheme which uses a window to adapt the load it is shown that most of the limitations of this scheme can be eliminated while preserving its advantages. More specific, because of the direct adaption of a rate fairness can be guaranteed in general topologies. This is possible without the need to put the burden of enforcing fairness on the (in a high-speed network already heavily loaded) routers. Finally the system can better adapt to varying packet-sizes, thus offering greater robustness and efficiency when used in real networks.
Support for specifying temporal behavior in Ada designs
Authors: R. J. A. Buhr, G. M. Karam, R. Casselman
Venue: Proceedings of the first international symposium on Environments and tools for Ada (1991)

MachineCharts is a visual design notation that has both structural and temporal semantics. An Abstract Controller Machine (ACM) is an element of the notation that encapsulates the temporal behavior defined by a requirements entity and expresses it through an event/action interface. This interface is used by the design components to implement the communications semantics between entities that were present in the requirements model. To support the ACM concept as part of design, it has been integrated into TimeBench, a design environment targeted to support Ada software design and development.
Visibility preprocessing for interactive walkthroughs
Authors: Seth J. Teller, Carlo H. Séquin
Venue: ACM SIGGRAPH Computer Graphics (1991)

The number of polygons comprising interesting architectural models is many more than can be rendered at interactive frame rates. However, due to occlusion by opaque surfaces (e.g., walls), only a small fraction of a typical model is visible from most viewpoints.We describe a method of visibility preprocessing that is efficient and effective for axis-aligned or axial architectural models. A model is subdivided into rectangular cells whose boundaries coincide with major opaque surfaces. Non-opaque portals are identified on cell boundaries, and used to form an adjacency graph connecting the cells of the subdivision. Next, the cell-to-cell visibility is computed for each cell of the subdivision, by linking pairs of cells between which unobstructed sightlines exist.During an interactive walkthrough phase, an observer with a known position and view cone moves through the model. At each frame, the cell containing the observer is identified, and the contents of potentially visible cells are retrieved from storage. The set of potentially visible cells is further reduced by culling it against the observer's view cone, producing the eye-to-cell visibility. The contents of the remaining visible cells are then sent to a graphics pipeline for hidden-surface removal and rendering.Tests on moderately complex 2-D and 3-D axial models reveal substantially reduced rendering loads.