ppxscal/embedding_network huggingface dataset:
Subcube Allocation and Task Migration in Hypercube Multiprocessors
Authors: Ming-Syan Chen, Kang G. Shin
Venue: IEEE Transactions on Computers (1990)

Two important issues in managing processors in a hypercube are addressed: subcube allocation and task migration to eliminate the system fragmentation caused by allocation and deallocation of subcubes. It is proven that the subcube allocation strategy using a binary reflected Gray code (BRGC), called the GC strategy, possesses the best subcube recognition ability among all strategies using sequential searches. A binary code (BC) is defined as the binary representation of a nonnegative integer, and an extended binary code (EBC) is obtained by permutating the bits of a BC. Similarly, an extended Gray code (EGC) is obtained from a BRGC. The subcube recognition ability of an allocation strategy using multiple EBCs is analyzed and compared to that using multiple EGCs.
DMG&mdash;object-oriented iterative knowledge acquisition for the generation of diagnostic hypertext systems
Authors: Pasi T. Tyrväinen
Venue: ACM SIGPLAN Lisp Pointers (1991)

DMG is a development environment for building diagnostics applications of electrical equipment. Knowledge contained in an equipment model is compiled into a decision-tree like diagnostic logic, which is then used visually to pinpoint deficiencies in the performance of the equipment. The delivery application is a hypertext document which combines the diagnostic logic with links to sources of additional information. Benefits and experiences in real industrial use of DMG are presented; and practical issues on using a CLOS-based graphical user interface library are discussed.
Properties of Control-Flow Complexity Measures
Authors: K. B. Lakshmanan, S. Jayaprakash, P. K. Sinha
Venue: IEEE Transactions on Software Engineering (1991)

The authors attempt to formalize some properties which any reasonable control-flow complexity measure must satisfy. Since large programs are often built by sequencing and nesting of simpler constructs, the authors explore how control-flow complexity measures behave under such compositions. They analyze five existing control flow complexity measures-cyclomatic number, total adjusted complexity, scope ratio, MEBOW, and NPATH. The analysis reveals the strengths and weaknesses of these control flow complexity measures.
An efficient antialiasing technique
Authors: Xiaolin Wu
Venue: Proceedings of the 18th annual conference on Computer graphics and interactive techniques (1991)

An intuitive concept of antialiasing is developed into very efficient antialiased line and circle generators that require even less amount of integer arithmetic than Bresenham's line and circle algorithms. Unlike its predecessors, the new antialiasing technique is derived in spatial domain (raster plane) under a subjectively meaningful error measure to preserve the dynamics of curve and object boundaries. A formal analysis of the new antialiasing technique in frequency domain is also conducted. It is shown that our antialiasing technique computes the same antialiased images as Fujimoto-Iwata's algorithm but at a fraction of the latter's computational cost. The simplicities of the new antialiased line and circle generators also mean their easy hardware implementations.
Geometrically deformed models: a method for extracting closed geometric models form volume data
Authors: James V. Miller, David E. Breen, William E. Lorensen, Robert M. O'Bara, Michael J. Wozny
Venue: ACM SIGGRAPH Computer Graphics (1991)

We propose a new approach to the problem of generating a simple topologically-closed geometric model from a point-sampled volume data set. We call such a model a Geometrically Deformed Model or GDM. A GDM is created by placing a 'seed' model in the volume data set. The model is then deformed by a relaxation process that minimizes a set of constraints that provides a measure of how well the model fits the features in the data. Constraints are associated with each vertex in the model that control local deformation, interaction between the model and the data set, and the shape and topology of the model. Once generated, a GDM can be used for visualization, shape recognition, geometric measurements, or subjected to a series of geometric operations. This technique is of special importance because of the advent of nondestructive sensing equipment (CT, MRI) that generates point samples of true three-dimensional objects.
Codes to reduce switching transients across VLSI I/O pins
Authors: Arvin Park, Ron Maeder
Venue: ACM SIGARCH Computer Architecture News (1992)

We develop a coding scheme that reduces switching transients by limiting the number of lines that simultaneously switch during transmission of address and data information over the I/O pins of a VLSI chip, or the lines of a system bus. The maximum number of lines that simultaneously switch can be reduced by a factor of two using simple and fast circuitry for encoding and decoding.
Stochastic Bounds on Execution Times of Parallel Programs
Authors: Nihal Yazici-Pekergin, Jean-Marc Vincent
Venue: IEEE Transactions on Software Engineering (1991)

Stochastic bounds are obtained on execution times of parallel programs when the number of processors is unlimited. A parallel program is considered to consist of interdependent tasks with synchronization constraints. These constraints are described by an acyclic directed graph called a task graph. The execution times of tasks are considered to be independently identically distributed (i.i.d.) random variables. The performance measure of interest is the overall execution of the considered parallel program (task graph). Stochastic bound methods are applied to obtain lower and upper bounds on this measure. Another upper bound is obtained for parallel programs having 'new better than used in expectation' (NBUE) random variables as task execution times. NBUE random variables are replaced with exponential random variables of the same mean to derive this upper bound.
A variable observation time method for testing delay faults
Authors: Wei-Wei Mao, Michael D. Ciletti
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

Test methodologies for delay faults usually observe output patterns at a single observation time, and the same observation time is used for all faults in the circuit under test. In this paper we show that use of a single observation time is not advantageous for testing delay faults, and we are able to show that the detection threshold can be dramatically improved by using a testing methodology that allows variable, fault-dependent and output-dependent observation times. A &ldquo;waveform-type&rdquo; simulation method is used for calculating detection thresholds for definitely detectable faults. Statistical distributions of delay fault detection thresholds are presented for ten benchmark circuits.
Dynamic Control and Prototyping of Parallel Algorithms for Intermediate- and High-Level Vision
Authors: A. M. Wallace, G. J. Michaelson, P. McAndrew, K. G. Waugh, W. J. Austin
Venue: Computer (1992)

Developing parallel algorithms for intermediate and high levels of computer vision systems is addressed. Because the algorithms are complex and the nature and size of the input and output data sets vary for each application, the authors have directly developed parallel algorithms for dynamic control of both processing and communication complexity during execution. They have also examined the merits of functional prototyping and transforming programs into imperative execution code for final implementation. To evaluate and give direction to their work, they have implemented algorithms for plane detection and object recognition on a flexible transputer network.
End-user knowledge manipulation systems: the speech knowledge interface
Authors: S. M. O'Brien, L. Candy, E. A. Edmonds, T. J. Foster, E. McDaid
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

End-user knowledge manipulation systems (EUKMS) enable direct manipulation of knowledge-bases by non-programming personnel. The facilities afforded by the graphical interface include interaction with source data, knowledge editing, and automatic conversion of rules into operationalised code, facilitating knowledge acquisition and refinement in complex domains. A study of such a system is presented.
Inside the LOOM description classifier
Authors: Robert M. MacGregor
Venue: ACM SIGART Bulletin (1991)

This paper presents a symbol level account of some of the representation and reasoning structures within the LOOM knowledge representation system. Reasoning in LOOM centers around a classifier whose primary function is to construct a taxonomy of all descriptions that have been entered into the system. The LOOM classifier is unique in that it constructs a separate taxonomy for each of seven kinds of non-composite descriptions, and uses a marker passing algorithm to replace the quadratic time subsumption test found in most classifiers with a linear time test. We briefly illustrate how the selection of data structures within LOOM impacts the completeness of the classification algorithm, and we describe the LOOM option that allows concepts to be reasoned with in either a forward-chaining or a backward-chaining mode.
A framework for accessing data in models with many discrete states (abstract)
Authors: Mark Temte
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

In a class of applications, a model exists in which calculations depend upon a fixed set of independent real model parameters, say V1, V2, &hellip;, Vn. Each of the V's is a function of auxiliary data. The model often has a large number of discrete states, characterized by a set of discrete state parameters S1, S2, &hellip;, Sm. To calculate any particular V, a different function (algorithm and auxiliary data) may be needed for each state; typically, however, a function is shared among some group of states. It is desirable that only one copy of each function exist. The state may change frequently. Moreover, the state parameters are usually not independent; for example, choosing a particular value for one S may restrict permitted values for other S's. In an interactive application, inconsistent choices must be detected. An application oriented framework is presented for supplying the application with the V's while efficiently reconfiguring the model as the S's are changed. The role of the S's and the details of calculating each V are hidden from the application. The framework is maintainable and, moreover, allows the system to be enhanced by the addition of new states. Finally, inconsistent choices among the state parameters can be easily detected.
Incremental processing and the hierarchical lexicon
Authors: Erik-Jan van der Linden
Venue: Computational Linguistics (1992)

Hierarchical lexicon structures are not only of great importance for the nonredundant representation of lexical information, they may also contribute to the efficiency of the actual processing of natural language. Two parsing techniques that render the parsing process efficient are presented. Windowing is a technique for incrementally accessing the hierarchical lexicon. Lexical preferencing implements preferences within the parsing process as a natural consequence of the hierarchical structure of the lexicon. Within a proof-theoretic approach to Categorial Grammar it is possible to implement these techniques in a formal and principled way. Special attention is paid to idiomatic expressions.
A new inversive congruential pseudorandom number generator with power of two modulus
Authors: Jürgen Eichenauer-Herrmann, Holger Grothe
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (1992)

Pseudorandom numbers are important ingredients of stochastic simulations. Their quality is fundamental for the strength of the simulation outcome. The inversive congruential method for generating uniform pseudorandom numbers is a particularly attractive alternative to linear congruential generators, which show many undesirable regularities. In the present paper a new inversive congruential generator with power of two modulus is introduced. Periodicity and statistical independence properties of the generated sequences are analyzed. The results show that these inversive congruential generators perform very satisfactorily.
PHIGURE: a parallel hierarchical global router
Authors: Randall J. Brouwer, Prithviraj Banerjee
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

A new Parallel HIerarchical algorithm for Global Routing (PHIGURE) is presented in this paper. The router is based on the work of Burstein and Pelavin [1], but has many extensions for general global routing and parallel execution. Main features of the algorithm include structured hierarchical decomposition into separate independent tasks which are suitable for parallel execution and adaptive simplex solution for adding feedthroughs and adjusting channel heights for row-based layout. The algorithm is described and results are presented for a shared-memory multiprocessor implementation.
A flexible interface for linking applications to Penman's sentence generator
Authors: Robert T. Kasper
Venue: Proceedings of the workshop on Speech and Natural Language (1989)

The Penman text generation system has been used within several different experimental application domains, demonstrating that it provides the basis for an adaptable general purpose text generation capability. Linking with these applications also indicated several ways that Penman's interface with applications could be improved. Penman's interface with applications is described, focusing on SPL, a newly developed sentence plan language. SPL is a notation that can be used by text planning programs to specify plans for sentences at multiple levels of abstraction and varied amounts of detail. Sentence plans are interpreted with respect to a collection of predefined knowledge sources, thereby minimizing the size and complexity of inputs that must be dynamically constructed by the application to generate individual sentences.
A case study of a multimedia co-working task and the resulting interface design of a collaborative communication tool
Authors: Amanda Ropa, Bengt Ahlström
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

The Video Viewer is a communication tool that allows two users to share video information across a network. The design of this tool was based on the results of a case study involving two multimedia, collaborative workstations situated in two separate rooms. Users performed several tasks collaboratively using different media in an unstructured environment (i.e., there were four monitors to increase screen space and there was no specific interface for guidance). This video outlines the case study, the preliminary case study results and how these results effected the interface design of the Video Viewer.
On stability and performance of parallel processing systems
Authors: Nicholas Bambos, Jean Walrand
Venue: Journal of the ACM (JACM) (1991)

The general problem of parallel (concurrent) processing is investigated from a queuing theoretic point of view. As a basic simple model, consider infinitely many processors that can work simultaneously, and a stream of arriving jobs, each carrying a processing time requirement. Upon arrival, a job is allocated to a processor and starts being executed, unless it is blocked by another one already in the system. Indeed, any job can be randomly blocked by any preceding one, in the sense that it cannot start being processed before the one that blocks it leaves. After execution, the job leaves the system. The arrival times, the processing times and the blocking structures of the jobs form a stationary and ergodic sequence. The random precedence constraints capture the essential operational characteristic of parallel processing and allow a unified treatment of concurrent processing systems from such diverse areas as parallel computation, database concurrency control, queuing networks, flexible manufacturing systems. The above basic model includes the G/G/1 and G/G/ &infin; queuing systems as special extreme cases. Although there is an infinite number of processors, the precedence constraints induce a queuing phenomenon, which, depending on the loading conditions, can lead to stability or instability of the system. In this paper, the condition for stability of the system is first precisely specified. The asymptotic behavior, at large times, of the quantities associated with the performance of the system is then studied, and the degree of parallelism, expressed as the asymptotic average number of processors that work concurrently, is computed. Finally, various design and simulation aspects concerning parallel processing systems are considered, and the case of finite number of processors is discussed. The results proved for the basic model are then extended to cover more complex and realistic parallel processing systems, where each job has a random internal structure of subtasks to be executed according to some internal precedence constriants.
Toward a real-time spoken language system using commercial hardware
Authors: Steve Austin, Pat Peterson, Paul Placeway, Richard Schwartz, Jeff Vandergrift
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

We describe the methods and hardware that we are using to produce a real-time demonstration of an integrated Spoken Language System. We describe algorithms that greatly reduce the computation needed to compute the N-Best sentence hypotheses. To avoid grammar coverage problems we use a fully-connected first-order statistical class grammar. The speech-search algorithm is implemented on a board with a single Intel i860 chip, which provides a factor of 5 speedup over a SUN 4 for straight C code. The board plugs directly into the VME bus of the SUN4, which controls the system and contains the natural language system and application back end.
Projection-Based Approach to Image Analysis: Pattern Recognition and Representation in the Position-Orientation Space
Authors: Hayit Greenspan, Moshe Porat, Yehoshua Y. Zeevi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

A method for image analysis, based on the formalism of functional analysis is proposed. This approach, which is employed for pattern recognition in the combined position-orientation space, is motivated by a variety of neurophysiological findings that emphasize the importance of the orientation feature in visual image processing and analysis. The approach is applied to the so-called Glass patterns, which are special cases of images characterized uniquely by their orientational feature of local correlations between pairs of corresponding dots. The approach can be of interest in the analysis of optical flow.
Slow sorting: a whimsical inquiry
Authors: Bryant A. Julstrom
Venue: ACM SIGCSE Bulletin (1992)

Sorting is one of the most common and important computing operations. In analyzing and comparing sorting algorithms, we consider their execution times, as indicated by the number of operations they execute as they sort n elements. The simplest algorithms have times that grow approximately as n2, while more complex algorithms offer times that grow approximately as n log n. This paper pursues a contrary goal: a sorting algorithm whose time grows more quickly than that of the well-known algorithms. The paper exhibits and analyzes such an algorithm.
Socratic sequent systems
Authors: David A. McAllester
Venue: ACM SIGART Bulletin (1991)

This paper describes a general theoretical framework for constructing intelligent knowledge bases. The framework arises from the desire to construct powerful and efficient systems. Powerful in the sense that they drawn "deep" conclusions from the knowledge base, and efficient in that they give quick responses. Local inference relation are proposed as a way of constructing a variety of powerful yet efficient inference systems. Local Socratic sequent systems are proposed as a formal model of interactive knowledge bases based on local inference relations.
Symbolic computation of orientational correlation function moments
Authors: P. Pasini F. Semeria C. Zannoni
Venue: Journal of Symbolic Computation (1991)

Symbolic manipulation (REDUCE and SCHOONSCHIP) has been applied to the analytic evaluation of the coefficients in the Taylor series expansion of time-correlation functions. These expressions are derived for cylindrically and biaxially symmetric particles reorienting in a uniaxial fluid. The possibility of using computer algebra to determine correlation-function moments should make it applicable to various problems in statistical physics.
Design methodology management&mdash;a CAD framework initiative perspective
Authors: Kenneth W. Fiduk, Sally Kleinfeldt, Marta Kosarchyn, Eileen B. Perez
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

The design of today's electronic systems involves the use of a growing number of complex CAD tools. Invoking and controlling these tools, independently or as part of a captured, multi-operation flow, remains an error-prone and largely unsolved problem. This problem is the focus of the Design Methodology Management Technical Subcommittee (DMMTSC) of the CAD Framework Initiative. This paper describes the DMM problem, establishes DMM requirements, and presents the state of the DMMTSC effort to define interface standards for proposed solutions.
Computing for users with special needs and models of computer-human interaction
Authors: William W. McMillan
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

Models of human-computer interaction (HCI) can provide a degree of theoretical unity for diverse work in computing for users with special needs. Example adaptations for special users are described in the context of both implementation-oriented and linguistic models of HCI. It is suggested that the language of HCI be used to define standards for special adaptations. This would enhance reusability, modifiability, and compatibility of adaptations, inspire new innovations, and make it easier for developers of standard interfaces to incorporate adaptations. The creation of user models for subgroups of users with special needs would support semantic and conceptual adaptations.
Improved multithreading techniques for hiding communication latency in multiprocessors
Authors: Bob Boothe, Abhiram Ranade
Venue: Proceedings of the 19th annual international symposium on Computer architecture (1992)

Shared memory multiprocessors are considered among the easiest parallel computers to program. However building shared memory machines with thousands of processors has proved difficult because of the inevitably long memory latencies. Much previous research has focused on cache coherency techniques, but it remains unclear if caches can obtain sufficiently high hit rates. In this paper we present improved multithreading techniques that can easily tolerate latencies of hundreds of cycles, and yet only require a small number of threads per processor. High performance is achieved by introducing an explicit context switch instruction that can be used by a simple optimizing compiler to group together several shared accesses. This grouping of shared accesses dramatically reduces the frequency of context switches compared to simpler multithreading models. The combination of our techniques achieves efficiencies of 80% or higher on a broad set of applications.