ppxscal/embedding_network huggingface dataset:
Constructing Parallel Paths Between Two Subcubes
Authors: Guan-Ing Chen, Ten-Hwang Lai
Venue: IEEE Transactions on Computers (1992)

The authors consider a hypercube system that runs more than one job at a time, with each job allocated a subcube. They discuss the problem of migrating (relocating) a job from one subcube to another, assuming a circuit-switching hypercube network. An algorithm is presented for constructing parallel circuits between two subcubes so that the tasks of a job can be migrated simultaneously. It is shown that no matter how fragmented the hypercube is, one can always construct parallel paths between two given subcubes. Furthermore, one can always minimize the maximum length of the constructed circuits. A solution that minimizes the maximum length of the circuits will also minimize the total length. The circuits are mutually edge-disjoint and do not use any edge that has been used by other jobs. The time complexity of the algorithm is O(n/sup 2/m), where n is the dimension of the hypercube system and m is the number of jobs already in the system.
Lexicalized TAGs, parsing and lexicons
Authors: Anne Abeille
Venue: Proceedings of the workshop on Speech and Natural Language (1989)

In our approach, each elementary structure is systematically associated with a lexical head. These structures specify extended domains of locality (as compared to a context-free grammar) over which constraints can be stated. These constraints either hold within the elementary structure itself or specify what other structures can be composed with a given elementary structure. The 'grammar' consists of a lexicon where each lexical item is associated with a finite number of structures for which that item is the head. There are no separate grammar rules. There are, of course, 'rules' which tell us how these structures are composed. A grammar of this form will be said to be 'lexicalized'. A 'lexicalized' grammar naturally follows from the extended domain of locality of TAGs.A general parsing strategy for 'lexicalized' grammars is discussed. In the first stage, the parser selects a set of elementary structures associated with the lexical items in the input sentence, and in the second stage the sentence is parsed with respect to this set. An Earley-type parser for TAGs has been has been developed. It can be adapted to take advantage of the two steps parsing strategy. The system parses unification formalisms that have a CFG skeleton and that have a TAG skeleton.Along with the development of an Earley-type parser for TAGs, lexicons for English are under development. A lexicons for French is also being developed. Subsets of these lexicons are being incrementally interfaced to the parser.We finally show how idioms are represented in lexicalized TAGs. We assign them regular syntactic structures while representing them semantically as one entry. We finally show how they can be parsed by a parsing strategy as mentioned above.
PPMB: A Partial-Multiple-Bus Multiprocessor Architecture with Improved Cost-Effectiveness
Authors: Hong Jiang, Kenneth C. Smith
Venue: IEEE Transactions on Computers (1992)

The authors address the design and performance analysis of partial-multiple-bus interconnection networks. They are bus architectures that have evolved from the multiple-bus structure by dividing buses into groups and reducing bus connections. Their effect is to reduce cost and alleviate arbitration and drive requirements without degrading performance significantly. One such structure, called processor-oriented partial-multiple-bus (PPMB), is proposed. It serves as an alternative to the conventional structure called memory-oriented partial-multiple-bus (MPMB) and is aimed at higher system performance at less or equal system cost. It has been shown, both analytically and by simulation, that a substantial increase in system bandwidth (up to 20%) is achieved by the PPMB structure over the MPMB structure. With very large systems, the results also imply a significantly improved cost-effectiveness over the conventional multiple-bus architecture.
Join processing in relational databases
Authors: Priti Mishra Margaret H. Eich
Venue: ACM Computing Surveys (CSUR) (1992)

The join operation is one of the fundamental relational database query operations. It facilitates the retrieval of information from two different relations based on a Cartesian product of the two relations. The join is one of the most diffidult operations to implement efficiently, as no predefined links between relations are required to exist (as they are with network and hierarchical systems). The join is the only relational algebra operation that allows the combining of related tuples from relations on different attribute schemes. Since it is executed frequently and is expensive, much research effort has been applied to the optimization of join processing. In this paper, the different kinds of joins and the various implementation techniques are surveyed. These different methods are classified based on how they partition tuples from different relations. Some require that all tuples from one be compared to all tuples from another; other algorithms only compare some tuples from each. In addition, some techniques perform an explicit partitioning, whereas others are implicit.
Performance Analysis of Single Stage Interconnection Networks
Authors: J. Richard Burke, Chienhua Chen, Tsung-Ying Lee, Dharma P. Agrawal
Venue: IEEE Transactions on Computers (1991)

A single-stage interconnection network (SSIN) consisting of only one stage of switches and recirculation through processors is studied. An analytical probability model for SSINs using 2*2 switches is introduced, and results obtained with the model are compared with simulation results. Four SSINs with different network sizes, loading, and routing strategies are discussed. Processors with and without buffers are considered, and three different routing strategies are applied to resolve conflicts. The analytical model is seen to be in close agreement with the simulation results while providing at least an order of magnitude reduction in CPU time.
A new characterization of Mehlhorn's polynomial time functionals (extended abstract)
Authors: Bruce Kapron, Stephen A. Cook
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

A. Cobham (1964) presented a machine-independent characterization of computational feasibility, via inductive definition. R. Constable (1973) was apparently the first to consider the notion of feasibility for type 2 functionals. K. Mehlhorn's (1976) study of feasible reducibilities proceeds from Constable's work. Here, a class of polytime operators is defined, using a generalization of Cobham's definition. The authors provide an affirmative answer to the question of whether there is a natural machine based definition of Mehlhorn's class.
Minimum Spanning Trees of Moving Points in the Plane
Authors: Jyh-Jong Fu, R. C. T. Lee
Venue: IEEE Transactions on Computers (1991)

Consideration is given to the following problem. Preprocess n moving points in a plane, such that the Euclidean minimum spanning tree of these points at a given time t can be reported efficiently. In the result, if the moving points are in k-motion, after an O(kn/sup 4/ log n) time preprocessing step and using O(m) space to store the preprocessing result, the Euclidean minimum spanning tree at t can be reported in O(n) time, where m denotes the number of changes of the Euclidean minimum spanning tree of these points from time t=0 to time t= infinity.
Marks on Paper: Part 1. A Historical Survey of Computer Output Printing
Authors: Irving L. Wieselman, Erwin Tomash
Venue: IEEE Annals of the History of Computing (1991)

The evolution and history of computer printing technology in the United States is covered from the end of World War II to recent times (1946-1987). The wide variety of printer products introduced over the forty-year period is surveyed and their differentiating characteristics described. The relationship of computer technology to printer technology is discussed as is the relationship of the computer industry to the printer industry.
An Algebraic Approach to Feature Interactions
Authors: Raghu R. Karinthi, Dana Nau
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The various approaches proposed to provide communication between CAD systems and process planning systems share the major problem that, due to geometric interactions among features, there may be several equally valid sets of manufacturable features describing the same part, and different sets of features may differ in their manufacturability. Thus, to produce a good process plan-or, in some cases, any plan at ll-it may be necessary to interpret the part as a different set of features than the one initially obtained from the CAD model. This is addressed using an algebra of features. Given a set of features describing a machinable part, other equally valid interpretations of the part can be produced by performing operations in the algebra. This will enable automated process planning systems to examine these interpretations in order to see which one is most appropriate for use in manufacturing. The feature algebra has been implemented for a restricted domain and integrated with the Protosolid solid modeling system and the EFHA process planning system.
Task-Flow Architecture for WSI Parallel Processing
Authors: Robert W. Horst
Venue: Computer (1992)

The basics of task-flow architecture and the simulated wafer-scale implementation of flowing tasks (SWIFT), a register-transfer simulator that investigates the behavior of task-flow programs, are discussed. SWIFT simulates a ring of cells with two pipeline stages between successive cells. Each cell contains an arithmetic logic unit (ALU), a receive queue for holding incoming transmission packets, and a memory for storing memory packets (MPs). The chain wafer-scale integration (WSI) architecture that allows linear arrays to be configured from the working cells on a partially good wafer is applied to task-flow-machine implementations. Results from a limited Monte Carlo simulation run to predict yields for a 164-cell wafer configured using the chain WSI technique are presented. Results of a simulated sparse matrix-vector multiplication application of the task-flow architecture are also presented.
Structural recursion as a query language
Authors: Val Breazu-Tannen, Peter Buneman, Shamim Naqvi
Venue: Proceedings of the third international workshop on Database programming languages : bulk types persistent data: bulk types persistent data (1992)

We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. Its main computational engine is structural recursion on sets. All programming is done within a &ldquo;nicely&rdquo; typed lambda calculus, as in Machiavelli [OBB89]. A guiding principle is that how queries are implemented is as important as whether they can be implemented. As in relational algebra, the meaning of any relation transformer is guaranteed to be a total map taking finite relations to finite relations. A naturally restricted class of programs written with structural recursion has precisely the expressive power of the relational algebra. The same programming paradigm scales up, yielding query languages for the complex-object model [AB89]. Beyond that, there are, for example, efficient programs for transitive closure and we are also able to write programs that move out of sets, and then perhaps back to sets, as long as we stay within a (quite flexible) type system. The uniform paradigm of the language suggests positive expectations for the optimization problem. In fact, structural recursion yields finer grain programming therefore we expect that lower-level, and therefore better optimization will be feasible.
The compiler controlled pack cache and messaging
Authors: Stanley E. Lass
Venue: ACM SIGARCH Computer Architecture News (1991)

A compiler controlled pack cache allows the compiler to plan the allocation of the cache memory to minimize thrashing, group memory accesses, and specify strided transfers between the cache and main memory, thereby achieving a higher usable bandwidth and reducing the overall miss delay.Since it will soon be reasonable to have on-chip DRAM memories of 4 Mbits (512k bytes), a size comparable to the personal computer main memories of several years ago, the accesses to main memory will become more like the disc input/output of personal computers of several years ago.Message passing between adjacent devices will likely supplant busses, e.g. processor to DRAM to DRAM to DRAM to SCSI controller to keyboard controller, etc. Message passing is inherently faster than a buss.
An assessment of HCI: issues and implications
Authors: Wendie Wulff, Dick E. Mahling
Venue: ACM SIGCHI Bulletin (1990)

The focus of Human Computer Interaction (HCI) is to generate an understanding of how people can best interact with computers, and then to design and build technologies and tools that facilitate that interaction. As a field, HCI draws on many disciplines and perspectives. The primary contributors have historically been psychology, computer science and human factors -- more recent entries include (among others) anthropology, communication, education, graphic and industrial design, linguistics, sociology, and systems science. The work being done in the HCI field is shifting rapidly in response to the influx of these new perspectives. A quick survey of the literature from the past ten years reveals some further trends, and even some unexpected paradoxes1. Much of the work reported focuses either on theory [8], or on practice [3], although in many cases, work moves from theory to implementation and evaluation [4]. Papers are usually either technology-based [7] or user-based [11], but there is also work that approaches HCI problems from both of these ends of the interaction spectrum [12].
A computational model of skilled use of a graphical user interface
Authors: Muneo Kitajima, Peter G. Polson
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

This paper describes a computational model of skilled use of a graphical user interface based on Kintsch's construction-integration theory [4, 8]. The model uses knowledge of a detailed representation of information on the display, a user's goals and expectations, knowledge about the interface, and knowledge about the application domain to compute actions necessary to accomplish the user's current goal. The model provides a well-motivated account of one kind of errors, action slips [14], made by skilled users. We show how information about the intermediate state of a task on the display plays a critical role in skilled performance, i.e., display-based problem solving.
Get high school students hooked on science with a challenge
Authors: M. Cohen, M. Foster, D. Kratzer, P. Malone, A. Solem
Venue: Proceedings of the twenty-third SIGCSE technical symposium on Computer science education (1992)

Skilled scientists and engineers along with a public that understands science and technology are vital in today's technically competitive world. The United States must encourage its students to study and excel in scientific academic subjects and consider science and engineering as a possible career. An academic program that progresses from a statewide to a national competition is a way of developing science and computing knowledge among high school students and teachers, as well as instilling enthusiasm for science. This paper describes the new Mexico High School Supercomputing Challenge, a nonselective academic-year long program that was initiated in 1990. Teams of high school students from throughout New Mexico do a team computational science project using high performance computers.
Combining Logic Minimization and Folding for PLAs
Authors: Yu-Chin Hsu, Youn-Long Lin, Hang-Ching Hsieh, Ting-Hai Chao
Venue: IEEE Transactions on Computers (1991)

The authors present an approach that combines logic minimization and folding for a programmable logic array (PLA). An efficient algorithm is proposed for optimal bipartite column folding. In the algorithm, the authors model the PLA personality matrix as a network and the bipartite PLA folding as a partitioning problem of that network. This folding algorithm is able to find optimal solutions for the benchmarks from the literature. The algorithm also substitutes product terms by their alternatives in order to find the one best suited for folding. The authors combine this algorithm and a logic minimization algorithm into a folding system. When comparing the results to those by a conventional approach, about one half of the benchmarks show area gain if product-term-alternatives exist.
Bayesian learning of Gaussian mixture densities for hidden Markov models
Authors: Jean-Luc Gauvain, Chin-Hui Lee
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

An investigation into the use of <i>Bayesian learning</i> of the parameters of a multivariate Gaussian mixture density has been carried out. In a <i>continuous density hidden Markov model</i> (CDHMM) framework, Bayesian learning serves as a unified approach for parameter smoothing, speaker adaptation, speaker clustering, and corrective training. The goal of this study is to enhance model robustness in a CDHMM-based speech recognition system so as to improve performance. Our approach is to use Bayesian learning to incorporate prior knowledge into the CDHMM training process in the form of prior densities of the HMM parameters. The theoretical basis for this procedure is presented and preliminary results applying to HMM parameter smoothing, speaker adaptation, and speaker clustering are given.Performance improvements were observed on tests using the DARPA RM task. For speaker adaptation, under a supervised learning mode with 2 minutes of speaker-specific training data, a 31% reduction in word error rate was obtained compared to speaker-independent results. Using Baysesian learning for HMM parameter smoothing and sex-dependent modeling, a 21% error reduction was observed on the FEB91 test.
A network-topology independent task allocation strategy for parallel computers
Authors: Takanobu Baba, Yoshifumi Iwamoto, Tsutomu Yoshinaga
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

A network-topology, independent practical task allocation strategy has been designed and implemented for parallel computers. For mapping a task graph to a processor graph, this strategy evaluates several functions that represent some intuitively feasible properties of the graphs. Several strategies are defined to guide the mapping process, utilizing the indicated values. An allocation system has been designed and implemented based on this strategy. The experimental results indicate the following: 1) the system can yield 2.14 times better allocation than an arbitrary allocation, 2) it is difficult to select a single strategy capable of providing the best solutions for a wide range of task-processor combinations, and 3) the computation time of the allocator is reasonable. The effect of task and processor topology combinations on the allocation results is also discussed.
Building a Sonar Map in a Specular Environment Using a Single Mobile Sensor
Authors: Ömür Bozma, Roman Kuc
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The physical properties of acoustic sensors are exploited to obtain information about the environment for sonar map building. A theoretical formulation for interpreting the sensor databases on the physical principles of acoustic propagation and reflection is presented. A characterization of the sonar scan that allows the differentiation of planes, corners, and edges in a specular environment is described. A single sensor mounted on an autonomous vehicle in a laboratory verifies the technique. The implications for sonar map building and the limitations of differentiating elements with one sensor are discussed.
Designing the human machine interface in the ATIS domain
Authors: B. Bly, P. J. Price, S. Park, S. Tepper, E. Jackson, V. Abrash
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

Spoken language systems for the near future will not handle all of English, but, rather, will be limited to a domain-specific sub-language. Accurate modeling of the sub-language will depend on analysis of domain-specific data. Since no spoken language systems currently have a wide range of users, and since variability across users is expected to be large, we are simulating applications in which a large population of potential users can be sampled. The data resulting from the simulations can be used for system development and for system evaluation. The application discussed here is the air travel domain using the Official Airline Guide (OAG) reformatted in a relational structure.This study assesses the effects of changes in the simulations on the speech and language of the experimental subjects. These results are relevant to both the experimental conditions for data collection and the design of the human interface for spoken language systems. We report here on five experiments: (1) the effect of longer instructions with examples vs. shorter instructions, using our earlier data collection system, (2) a baseline experiment using a functional equivalent of the data collection effort at Texas Instruments (TI), (3) the use of a more specific version of the scenario used in the baseline experiment, (4) the use of a short, simple familiarization scenario before the main scenario, and (5) in addition to the short familiarization scenario, the use of a finite vocabulary with rejection of sentences with extra-lexical items.
Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects
Authors: Ziv Gigus, John Canny, Raimund Seidel
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

An efficient algorithm and a data structure for computing and representing the aspect graph of polyhedral objects under orthographic projection are presented. The aspect graph is an approach to representing 3-D objects by a set of 2-D views, for the purpose of object recognition. In this approach the viewpoint space is partitioned into regions such that in each region the qualitative structure of the line drawing does not change. The viewing data of an object is the partition of the viewpoint space together with a representative view in each region. The algorithm computes the viewing data for line drawings of polyhedral objects under orthographic projection.
Square Rooting Algorithms for Integer and Floating-Point Numbers
Authors: R. Hashemian
Venue: IEEE Transactions on Computers (1990)

An algorithm for evaluating the square root of integers and real numbers is developed. The procedure consists of two parts: one to obtain a close estimate of the square root and the other to modify the initial value, iteratively, until a precise root is evaluated. The major effort in this development has been concentrated on two objectives: high speed and no division operation other than division by 2. The first objective is achieved through a simple two-step procedure for getting the first estimate, and then modifying it by employing a fast converging iteration technique. The second objective is also fulfilled through applying bit-shift operation rather than division operation. The algorithm is simulated for both integer and real numbers, and the results are compared to two methods being widely used. The results (tabulated) show considerable improvement in speed compared to these other two methods.