ppxscal/embedding_network huggingface dataset:
A performance study of a highly-parallel architecture to provide registration and translation services in an intelligent network
Authors: Jerry Stach, Jerry Place
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

This paper presents the initial investigation of a highly parallel architecture that can be used as an Intelligent Network Translation and Registration Platform (INTARP). The INTARP architecture is deterministic and uses a hyper-switch as well as bus connections to pass messages. Threads through the multiprocessing pipelines are maintained by service definitions of the call procedures on &ldquo;anchor processors&rdquo;. The processes call procedures distributed over &ldquo;sequencing processors&rdquo;. INTARP is being prototyped using the inMOS, family of transputers. Unlike other architectures designed for the Intelligent Network, INTARP is designed specifically to minimize the post dial delay (PDD) the architecture contributes to circuit switch call processing. Unmanaged PDD in the Intelligent Network can lead to higher call abandonments. PDD also increase trunk and port capitalization due to the greater call holding time in peripheral processors prior to information transfer. The INTARP architecture is evaluated using a simulation model. Translation, PCN Registration and Calling Card services have been implemented on the simulation model and the performance of the architecture is inferred from the performance of the simulation studies.
High-Performance Logic Programming with the Aquarius Prolog Compiler
Authors: Peter Van Roy, Alvin M. Despain
Venue: Computer (1992)

Aquarius Prolog, a high performance compiler designed and built to test the hypothesis that Prolog can be implemented as efficiently as an imperative language by compiling the more powerful features of logic programming only where they are needed, and then only in the simplest form, is described. The authors begin with some background on logic programming and then discuss the Prolog language in more detail. They present an overview of their compiler, giving its structure and the principles underlying its high performance. They compare their system with two popular high-performance commercial systems and with two implementations of C and conclude with an overview of ways to extend this work.
A software assessment and certification advisor
Authors: Hans-Ludwig Hausen
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

Software assessment and certification is specified by using rules to define a product model, a process model, a characteristics model, software methods and tools. The product is divided into actual service (i.e. programs), specified service (i.e. specifications) and expected service (ie requirements). Associated to these are the quality characteristics, defined by metrics. Assessment as certification is introduced as a particular process phase. The advisor specified produces advice on products and processes, such as product parts are missing or activities are not reported.
Taking SIGCHI to Amsterdam
Authors: John Karat, Claire-Marie Karat
Venue: ACM SIGCHI Bulletin (1992)

When we started this column last year, we had fully intended on trying to corner some of the overseas SIGCHI membership and capture their views on key distinctions between North American and "other" brands of HCI work (both research and applied). This has proven difficult to do, not because differences do not exist, but because in most areas we are more similar than different. In broad terms we are all interested in improving the quality of human computer interaction, though we may focus in different areas when we measure such quality. For example, I still think it is safe to say that North Americans place more emphasis on minimizing user effort in applied HCI work, while Scandinavians place more effort on improving quality of work (which may mean something different than minimizing keystrokes). That this is not "news" is related to the fact that these different communities have been in communication for some time now. Scandinavians are better able to discuss GOMS models, and North Americans better able to discuss participatory design.
An object-oriented approach to parameterized software in Ada
Authors: Ed Seidewitz, Mike Stark
Venue: Proceedings of the eighth annual Washington Ada symposium summer SIGAda meeting on Ada: software: foundation for competitveness (1991)

A parameterized software system is one that can be configured by selecting generalized models and providing specific parameter values to fit those models into a general design [Stark 1990]. This is in contrast to the top-down development approach where a system is designed first, and software is reused only when it fits into the design. The concept of parameterized software is particularly useful in a development environment such as the Goddard Space Flight Center Flight Dynamics Division (FDD), where successive systems have similar characteristics.
A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic n-roots
Authors: Göran Björck, Ralf Fröberg
Venue: Journal of Symbolic Computation (1991)

This paper deals with the problem of using symbolic algebra to count the solutions of inhomogeneous systems of algebraic equations. A trick is presented whereby the faster algorithms for the homogeneous case can be used in the inhomogeneous case. The method is applied to the cyclic n-roots studied by one of the authors (and sometimes referred to as solutions to Amborg's system or Davenport's problem).
Summary of the final report of the NSF workshop on scientific database management
Authors: James C. French, Anita K. Jones, John L. Pfaltz
Venue: ACM SIGMOD Record (1990)

The National Science Foundation sponsored a two day workshop hosted by the University of Virginia on March 12-13, 1990 at which representatives from the earth, life, and space sciences met with computer scientists to discuss the issues facing the scientific community in the area of database management. The workshop1 participants concluded that initiatives by the National Science Foundation and other funding agencies, as well as specific discipline professional societies are urgently needed to address the problems facing scientists with respect to data management. This article presents a condensed version of the workshop final report emphasizing the technical research issues.
Clock Skew Optimization
Authors: John P. Fishburn
Venue: IEEE Transactions on Computers (1990)

Improving the performance of a synchronous digital system by adjusting the path delays of the clock signal from the central clock source to individual flip-flops is investigated. Using a model to detect clocking hazards, two linear programs are investigated: (1) minimizing the clock period, while avoiding clock hazards, and (2) for a given period, maximizing the minimum safety margin against clock hazard. These programs are solved for a simple example, and circuit simulation is used to contrast the operation of a resulting circuit with the conventionally clocked version. The method is extended to account for clock skew caused by relative variations in the drive capabilities of N-channel versus P-channel transistors in CMOS.
A Contour-Based Recovery of Image Flow: Iterative Transformation Method
Authors: Kwang Yoen Wohn, Jian Wu, Roger W. Brockett
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The authors present an iterative algorithm for the recovery of 2-D motion, i.e., for the determination of a transformation that maps one image onto another. The local ambiguity in measuring the motion of contour segments (the aperture problem) implies a reliance on measurements along the normal direction. Since the measured normal flow does not agree with the actual normal flow, the full flow recovered from this erroneous flow also possesses substantial error, and any attempt to recover the 3-D motion from such full flow fails. The proposed method is based on the observation that a polynomial approximation of the image flow provides sufficient information for 3-D motion computation. The use of an explicit flow model results in improved normal flow estimates through an iterative process. The authors discuss the adequacy and the convergence of the algorithm. The algorithm was tested on some synthetic and some simple natural time-varying images. The image flow recovered from this scheme is sufficiently accurate to be useful in 3-D structure and motion computation.
Better expansion for Ramanujan graphs
Authors: Nabil Kahale
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

The expansion properties of regular graphs are investigated. The best previously known expansion of subsets of linear size of explicit k-regular graphs is k/4. This bound is achieved by nonbipartite Ramanujan graphs of degree k=p+1, which have the property that all but the largest eigenvalue have absolute value at most 2 square root p. The expansion coefficient for linear subsets for nonbipartite Ramanujan graphs is improved to 3(k-2)/8. Other results are established, including improved results about random walks on expanders.
Average case analysis when merging two ordered lists of different length
Authors: John A. Trono
Venue: ACM SIGCSE Bulletin (1991)

A derivation for the expected number of comparisons when merging two ordered lists is given, where the sizes of the individual lists are unknown but the size of the merged list is known. Other applications where this result can be applied are also mentioned, most notably the LUPSort algorithm of Merritt and Nauck[4].
A comparison between Watfor-77 and Fortran 90
Authors: K. A. Redish
Venue: ACM SIGPLAN Fortran Forum (1991)

The focus is on extensions in Watfor-77 that are also in Fortran 90. (Watfor-87 is a version that uses the Intel 8087 chip or equivalent.)
Teaching concurrency with Joyce and Linda
Authors: Chris McDonald
Venue: Proceedings of the twenty-third SIGCSE technical symposium on Computer science education (1992)

To overcome the difficulty of demonstrating the principles of concurrency with limited parallel computing resources, a concurrent programming language has been designed and implemented which uses the Linda parallel programming paradigm. The language executes under the UNIX operating system and is supported by an X-windows based viewer of programs undergoing concurrent execution. This paper describes the language, its compiler and execution environment and experiences gained in using the language in a third year undergraduate course over the last two years.
Learning Boolean read-once formulas with arbitrary symmetric and constant fan-in gates
Authors: Nader H. Bshouty, Thomas R. Hancock, Lisa Hellerstein
Venue: Proceedings of the fifth annual workshop on Computational learning theory (1992)

A formula is read-once if each variable appears on at most a single input. Angluin, Hellerstein, and Karpinski have shown that boolean formulas with AND, OR, and NOT gates are exactly identifiable in polynomial time using membership and equivalence queries [AHK89]. Hancock and Hellerstein have generalized this to allow a wider subclass of symmetric basis functions [HH91]. We show a polynomial time algorithm in this model for identifying read-once formulas whose gates compute arbitrary functions of fan-in k or less for some constant k (i.e. any f :{0,1}1&le;c&le;k &rarr; {0,1}). We further show that if there is a polynomial time membership and equivalence query algorithm to identify read-once formulas over some set of functions B that meets certain technical conditions, then there is also such an algorithm to identify read-once formulas over B&ugr;{f:{0,1}1&le;c&le;k &rarr; {0,1}}. Finally, we extend the previous results to show that there is a polynomial time identification algorithm for read-once formulas over the basis of all symmetric functions (and hence also over the union of arbitrary symmetric and arbitrary constant fan-in gates). Given standard cryptographic assumptions, none of these results are possible for read-twice formulas.
Concepts of operational software quality metrics
Authors: Amos O. Olagunju
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

Managers and developers of large software systems need a set of operationally defined measures of software quality. This paper presents metrics that are useful for the estimation of an overall software quality and computation of estimated field values such as the field fault density. The newly-developed algorithms can be applied to estimate the quality of a software whose contents change throughout the period of testing. Moreover, the estimation algorithms characterize major and minor software releases separately. The accuracy and reliability of the estimation algorithms are discussed.
Constraint Networks in Vision
Authors: David Suter
Venue: IEEE Transactions on Computers (1991)

Applications in machine vision of constraint networks based on an augmented Lagrangian formulation are discussed. Only those applications that have a fundamental significance are addressed. The first of these provides a generalization of the Harris coupled depth-slope analog model of visual reconstruction. Because of the generality of the approach, one can derive many more alternative structures, and the mathematical setting places this approach within the bounds of mixed finite element theory. This offers many advantages in terms of the associated mathematical theory and implementation on digital machines. The second use is in data fusion, which is a crucial task for systems using multiple sensors or methods of analysis of data.
Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane
Authors: Naoki Katoh, Kazuo Iwano
Venue: Proceedings of the eighth annual symposium on Computational geometry (1992)

We study the problem of enumerating k farthest pairs for n points in the plane and the problems of enumerating k closest/farthest bichromatic pairs of n red and n blue points in the plane. We propose a new technique for geometric enumeration problems which iteratively reduces the search space by a half and provides efficient algorithms. As applications of this technique, we develop algorithms, using higher order Voronoi diagrams, for the above problems, which run in O(min{n2, n log n + k4/3 log n/log1/3 k}) time and O(n+k4/3/(log k)1/3+k log n) space. Since, to the authors' knowledge, no nontrivial algorithms have been known for these problems, our algorithms are currently fastest when k=o(n3/2).
Performance-driven constructive placement
Authors: Ichiang Lin, David H. C. Du
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

A new approach to the performance-driven placement based on a window concept is presented. We first convert timing constraints to geometric shapes using the defined windows. A window represents a region in which all the modules along a given path can be placed without degrading the circuit performance. Then a constructive placement process uses the window information to select an unplaced module, and to find an appropriate position for the module. This approach represents a unified way to consider both timing and geometric constraints during the placement process. The experimental results show that the improvement of circuit performance can be achieved by the sufficient use of the window information.
Linking programs incrementally
Authors: Russell W. Quong, Mark A. Linton
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1991)

Linking is traditionally a batch process that resolves cross-references between object modules and run-time libraries to produce a stand-alone executable image. Because most program changes only involve a small part of the program, we have implemented an incremental linker, named Inclink, that processes only the changed modules. Inclink generates a new executable in time proportional to the size of change; in contrast, a batch linker generates an executable in time proporitonal to the size of the program. To minimize updates to the executable, Inclink allocates extra space for every module. By allocating 24 percent more space in the executable for overflows, Inclink can update a module in place over 97 percent of the time. Measurements show that Inclink is more than an order of magnitude faster than the UNIX [2] batch linker and that 88 percent of all links will take less than 2 s of CPU time on a MicroVAX-2, independent of program size.
Fault tolerance in hypercube-derivative networks (preliminary version)
Authors: Fred Annexstein
Venue: ACM SIGARCH Computer Architecture News (1991)

We present algorithms which reconfigure faulty deBruijn and Butterfly networks. We show that, with high probability, an N-node deBruijn (resp., Butterfly) network with uniformly distributed faulty processors can simulate a fault-free N-node deBruijn (resp., Butterfly) network with a slowdown factor of O(log log N). Our configuration algorithm is deterministic, operates in a distributed fashion, uses only local control, and takes time O(log2 N).
Statistical agenda parsing
Authors: Robert J. Bobrow
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

This paper presents the results of converting a standard Graham/Harrison/Ruzzo (GHR) parser for a unification grammar into an agenda-driven parsing system. The agenda is controlled by statistical measures of grammar-rule likelihood obtained from a training set.The techniques in the agenda parser lead to substantial reductions in chart size and parse time, and can be applied to any chart-based parsing algorithm without hand-tuning.
Run-time monitoring of concurrent programs on the Cedar multiprocessor
Authors: Sanjay Sharma, Allen D. Malony, Michael W. Berry, Priyamvada Sinvhal-Sharma
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

The ability to understand the behavior of concurrent programs depends greatly on the facilities available to monitor execution and present the results to the user. Beyond the basic profiling tools that collect data for post-mortem viewing, explorative use of multiprocessor computer systems demands a dynamic monitoring environment capable of providing run-time access to program performance. A prototype of such an environment has been built for the Cedar multiprocessor. This paper describes the design of the infrastructure enabling run-time monitoring of parallel Cedar applications and the communication of execution data among physically distributed machines. An application for matrix visualization is used to highlight important aspects of the system.
A history-based macro by example system
Authors: David Kurlander, Steven Feiner
Venue: Proceedings of the 5th annual ACM symposium on User interface software and technology (1992)

Many tasks performed using computer interfaces are very repetitive. While programmers can write macros or procedures to automate these repetitive tasks, this requires special skills. Demonstrational systems make macro building accessible to all users, but most provide either no visual representation of the macro or only a textual representation. We have developed a history-based visual representation of commands in a graphical user interface. This representation supports the definition of macros by example in several novel ways. At any time, a user can open a history window, review the commands executed in a session, select operations to encapsulate into a macro, and choose objects and their attributes as arguments. The system has facilities to generalize the macro automatically, save it for future use, and edit it.
Systems modelling and description
Authors: Motamarri Saradhi
Venue: ACM SIGSOFT Software Engineering Notes (1992)

The purpose of this paper is to enunciate the underlying notions of systems modelling. There is an obvious lack with many techniques to allow the description of the real world as native to its functioning as possible. A generic analytical framework is likely to have a strong impact in problem solving, whatever may be the domain. Further, it may ease the process of communication among various people by virtue of proper capturing of the system functionality in a more understandable framework. The exploration for such a framework will also rationalize the development process of computerized systems, whether they are going to employ conventional software or AI/ES techniques. The criticality of the computerized systems has been raising potential problems with respect to safety and security. Validation and verification of the systems have become a potential challenge. The current discussion will shed light on these issues, and guide in ensuring a robust application system.
Efficient at-most-once messages based on synchronized clocks
Authors: Barbara Liskov, Liuba Shrira, John Wroclawski
Venue: ACM Transactions on Computer Systems (TOCS) (1991)

This paper describes a new at-most-once message passing protocol that provides guaranteed detection of duplicate messages even when the receiver has no state stored for the sender. It also discusses how to use at-most-once messages to implement higher-level primitives such as at-once-remote procedure calls and sequenced bytestream protocols. Our performance measurements indicate that at-most-once RPCs can provide at the same cost as less desirable forms of RPCs that do not guarantee at-most-once execution. Our method is based on the assumption that clocks throughout the system are loosely synchronized. Modern clock synchronization protocols provide good bounds on clock skew with high probability; our method depends on the bound for performance but not for correctness.
User object models
Authors: William Kent
Venue: ACM SIGPLAN OOPS Messenger (1992)

Object users and developers have different needs, contributing to the plethora of object models. This paper focuses on user object models, differentiating them from developer models, and outlines a spectrum of characteristics which can provide a basis for comparing and reconciling different user models.
A Control-Flow Normalization Algorithm and its Complexity
Authors: Zahira Ammarguellat
Venue: IEEE Transactions on Software Engineering (1992)

A single method for normalizing the control-flow of programs to facilitate program transformations, program analysis, and automatic parallelization is presented. While previous methods result in programs whose control flowgraphs are reducible, programs normalized by this technique satisfy a stronger condition than reducibility and are therefore simpler in their syntax and structure than with previous methods. In particular, all control-flow cycles are normalized into single-entry, single-exit while loops and all GOTOs are eliminated. Furthermore, the method avoids problems of code replication that are characteristic of node-splitting techniques. This restructuring obviates the control dependence graph, since afterwards control dependence relations are manifest in the syntax tree of the program. Transformations that effect this normalization are presented, and the complexity of the method is studied.
On the Testability of One-Dimensional ILAs for Multiple Sequential Faults
Authors: Anastasios Vergis
Venue: IEEE Transactions on Computers (1992)

It is shown that one-dimensional, unilateral iterative logic arrays (ILAs) of combinational cells are C-testable for multiple sequential faults, provided the fault-free cell functions satisfy appropriate conditions. The test sequence is of length O((m/sup 2/n/sup 2/+mn/sup 3/)*K), where n (resp. m) is the number of signal values that can be applied to the horizontal (resp. vertical) cell input and K>or=n-1. Linear testability is also considered. The ripple-carry adder circuit (n=2, m=4) is shown to be C-testable with 699 test vectors.