ppxscal/embedding_network huggingface dataset:
ViKI: an accessibility project
Authors: Blaise W. Liffick
Venue: Proceedings of the sixth annual CCSC northeastern conference on The journal of computing in small colleges (2001)

Although computerized assistive devices for most handicaps are becoming more widely available, one major drawback is that users must currently provide customized interfaces for every computer system they use. In addition to specialized input and output devices, such assistive devices also frequently require customized software. This paper proposes an alternative solution, by providing a customized interface (both hardware and controlling software) on a laptop computer that is then used to control standard software on any other host computer. In this way, the user can carry their specialized interface to essentially any general computer, and can interact with any standard software supported on the host. The laptop system becomes a virtual keyboard to the host machine.
Regular expression pattern matching for XML
Authors: Haruo Hosoya, Benjamin Pierce
Venue: ACM SIGPLAN Notices (2001)

We propose regular expression pattern matching as a core feature for programming languages for manipulating XML (and similar tree-structured data formats). We extend conventional pattern-matching facilities with regular expression operators such as repetition (*), alternation (I), etc., that can match arbitrarily long sequences of subtrees, allowing a compact pattern to extract data from the middle of a complex sequence. We show how to check standard notions of exhaustiveness and redundancy for these patterns.Regular expression patterns are intended to be used in languages whose type systems are also based on the regular expression types. To avoid excessive type annotations, we develop a type inference scheme that propagates type constraints to pattern variables from the surrounding context. The type inference algorithm translates types and patterns into regular tree automata and then works in terms of standard closure operations (union, intersection, and difference) on tree automata. The main technical challenge is dealing with the interaction of repetition and alternation patterns with the first-match policy, which gives rise to subtleties concerning both the termination and the precision of the analysis. We address these issues by introducing a data structure representing closure operations lazily.
Hanlon and Stanley's Conjecture and the Milnor Fibre of a Braid Arrangement
Authors: G. Denham
Venue: Journal of Algebraic Combinatorics: An International Journal (2000)

Let {\cal A} be a real arrangement of hyperplanes. Let B &equals; B(q) be Varchenko's quantum bilinear form of {\cal A}, introduced [15], specialized so that all hyperplanes have weight q. B(q) is nonsingular for all complex q except certain roots of unity. Here, we examine the kernel of B at roots of unity in relation to the topology of the hyperplane singularity.We use Varchenko's work [16] to relate B(q) to a Salvetti complex for the Milnor fibration of {\cal A}. This paper's main result is specific to the arrangement of reflecting hyperplanes associated with the A_n &minus; 1 root system. We use a geometric property of the Milnor fibre to resolve a conjecture due to Hanlon and Stanley regarding the {\Fraktur C}_n-module structure of the kernel of B(q) at certain roots of unity.
Preparing students for internet and multimedia technology careers
Authors: Kathleen Harmeyer, Donna Tupper, William Beck, Sylvia Sorkin
Venue: ACM SIGCSE Bulletin (2001)

This paper provides descriptions of three courses in a thirty-credit Internet and Multimedia Technology (I/MMT) certificate program. They are: Multimedia Authoring II, Project Development, and Internet Programming. The latter has been offered in both traditional and online versions at the Essex Campus of the Community College of Baltimore County (CCBC-Essex).
Discrimination in the employment of women in the computer industry
Authors: Richard E. Weber, Bruce Gilchrist
Venue: Communications of the ACM (1975)

It has been more than ten years since the passage of the Equal Pay Act and Title VII of the 1964 Civil Rights Act, which were intended to end employment and wage discrimination against women. Thus it seems an appropriate time for the computer industry to examine its own employment practices with respect to women.
Nuts and bolts of core and SoC verification
Authors: Ken Albin
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

Digital design at Motorola is performed at design centers throughout the world, on projects with different design objectives, executed on different time scales, by different sized teams with different skill sets. This paper attempts to categorize these diverse efforts and identify common threads: what works, what the challenges are, and where we need to go.
Resolving Motion Correspondence for Densely Moving Points
Authors: Cor J. Veenman, Marcel J. T. Reinders, Eric Backer
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

This paper studies the motion correspondence problem for which a diversity of qualitative and statistical solutions exist. We concentrate on qualitative modeling, especially in situations where assignment conflicts arise either because multiple features compete for one detected point or because multiple detected points fit a single feature point. We leave out the possibility of point track initiation and termination because that principally conflicts with allowing for temporary point occlusion. We introduce individual, combined, and global motion models and fit existing qualitative solutions in this framework. Additionally, we present a new efficient tracking algorithm that satisfies these¿possibly constrained¿models in a greedy matching sense, including an effective way to handle detection errors and occlusion. The performance evaluation shows that the proposed algorithm outperforms existing greedy matching algorithms. Finally, we describe an extension to the tracker that enables automatic initialization of the point tracks. Several experiments show that the extended algorithm is efficient, hardly sensitive its few parameters, and qualitatively better than other algorithms, including the presumed optimal statistical multiple hypothesis tracker.
Recursive subtyping revealed: (functional pearl)
Authors: Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pierce
Venue: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming (2000)

Algorithms for checking subtyping between recursive types lie at the core of many programming language implementations. But the fundamental theory of these algorithms and how they relate to simpler declarative specifications is not widely understood, due in part to the difficulty of the available introductions to the area. This tutorial paper offers an "end-to-end" introduction to recursive types and subtyping algorithms, from basic theory to efficient implementation, set in the unifying mathematical framework of coinduction.
Efficient algorithms to globally balance a binary search tree
Authors: Hsi Chang, S. Sitharama Iyangar
Venue: Communications of the ACM (1984)

A binary search tree can be globally balanced by readjustment of pointers or with a sorting process in O(n) time, n being the total number of nodes. This paper presents three global balancing algorithms, one of which uses folding with the other two adopting parallel procedures. These algorithms show improvement in time efficiency over some sequential algorithms [1, 2, 7] when applied to large binary search trees. A comparison of various algorithms is presented.
Accelerating LP algorithms
Authors: B. L. Fox
Venue: Communications of the ACM (1969)

It is shown how a novel method for computing (related) inner products can accelerate the pricing phase of LP algorithms. Other LP applications are indicated.
Remote Sensing with Linux
Authors: Mark Lucas
Venue: Linux Journal (2001)

One company takes the initiative and saves time and money using a Linux Beowulf cluster.
What is floorplan?
Authors: R. Otten
Venue: Proceedings of the 2000 international conference on Computer-aided design (2001)

This paper surveys the more important floorplan models and their use in the backend of chip design. Floorplans are here considered as data structures that capture the relative positions of objects in a plane. This is in correspondence with how they were introduced in design automation in the early eighties: as a generalization of placement, that is the manipulation of geometrically fixed objects in order to get an overlap-free arrangement of these objects in a plane region. The introduction of the floorplanning concept not only liberated back-end design from its (manual) puzzle character and its intractable and sometimes even undecidable problems, but also enabled hierarchical design, even taking a functional hierarchy and transforming it by stepwise refinement into a floorplan with a compatible representation. The elegance of that procedure was so overpowering that many identified floorplanning with hierarchical back-end design. That floorplanning proves to be a powerful notion by itself becomes once more apparent, since almost all modern effective "placement" procedures are in essence floorplanning followed by packing or some other "legalization" stage. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Numerical Analysis: Quasilinearization and the estimation of differential operators from eigenvalues
Authors: R. E. Bellman, H. H. Kagiwada, R. E. Kalaba, R. Vasudevan
Venue: Communications of the ACM (1968)

Given a linear ordinary differential operator containing several unknown constants and a number of its eigenvalues, the values of the unknown constants are estimated. A precise formulation is provided, and an effective numerical procedure for solution is indicated. The results of some computational experiments are given.
Linking public spaces: technical and social issues
Authors: Gavin Jancke, Gina Danielle Venolia, Jonathan Grudin, J. J. Cadiz, Anoop Gupta
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

Three public spaces frequency used by members of a single organization who are distributed across different floors of two buildings were linked by constantly-running video and audio connections. We discuss the design of the system, including issues in providing low-latency, full-duplex audio-video connectivity, ways to increase possibilities for interaction while addressing privacy concerns, and the introduction of the system to the community. We report on responses to the system and lessions learned, including unexpected issues, such as creative decorations of the spaces and assertions by a vocal minority of employees about the private nature of &ldquo;public space.&rdquo;
Transition network grammars for natural language analysis
Authors: W. A. Woods
Venue: Communications of the ACM (1970)

The use of augmented transition network grammars for the analysis of natural language sentences is described. Structure-building actions associated with the arcs of the grammar network allow for the reordering, restructuring, and copying of constituents necessary to produce deep-structure representations of the type normally obtained from a transformational analysis, and conditions on the arcs allow for a powerful selectivity which can rule out meaningless analyses and take advantage of semantic information to guide the parsing. The advantages of this model for natural language analysis are discussed in detail and illustrated by examples. An implementation of an experimental parsing system for transition network grammars is briefly described.
Documentation for a model: a hierarchical approach
Authors: Saul I. Gass, Karla L. Hoffman, Richard H. F. Jackson, Lambert S. Joel, Patsy B. Saunders
Venue: Communications of the ACM (1981)

A set of documents and their organization according to functional requirements in order to produce information that will facilitate the use of models are described. The authors discuss the role of models in the policy process and of documentation in the assessment of such models.
DITRAN&mdash;a compiler emphasizing diagnostics
Authors: P. G. Moulton, M. E. Muller
Venue: Communications of the ACM (1967)

DITRAN DIagnostic FORTRAN) is an implementation of ASA Basic FORTRAN with rather extensive error checking capabilities both at compilation time and during execution of a program. The need for improved diagnostic capabilities and some objectives to be met by any compiler are discussed. Attention is given to the design and implementation of DITRAN and the particular techniques employed to provide the diagnostic features. The handling of error messages by a general macro approach is described. Special features which provide teaching aids for use by instructors are noted.
Restricted universe data structures
Authors: Erkki Mäkinen, Markku Siermala
Venue: ACM SIGCSE Bulletin (2000)

Restricted universe data structures and their algorithms augment our knowledge of the behavior of standard data structures. Understanding the increase in asymptotic efficiency when restricting the universe of possible keys helps us to realize the limits of the common data structures, such as balanced binary trees. This paper first introduces the principles of restricted universe data structures and then empirically compares stratified trees and AVL trees in the connection with a simple algorithmic problem.
Complex gamma function with error control
Authors: Hirondo Kuki
Venue: Communications of the ACM (1972)

An algorithm to compute the gamma function and the loggamma function of a complex variable is presented. The standard algorithm is modified in several respects to insure the continuity of the function value and to reduce accumulation of round-off errors. In addition to computation of function values, this algorithm includes an object-time estimation of round-off errors. Experimental data with regard to the effectiveness of this error control are presented. A Fortran program for the algorithm appears in the algorithms section of this issue.
Numerical Analysis: Stable numerical methods for obtaining the Chebyshev solution to an overdetermined system of equations
Authors: Richard H. Bartels, Gene H. Golub
Venue: Communications of the ACM (1968)

An implementation of Stiefel's exchange algorithm for determining a Chebyshev solution to an overdetermined system of linear equations is presented, that uses Gaussian LU decomposition with row interchanges. The implementation is computationally more stable than those usually given in the literature. A generalization of Stiefel's algorithm is developed which permits the occasional exchange of two equations simultaneously.
Enumerating full-time programmers
Authors: Bruce Gilchrist, Richard E. Weber
Venue: Communications of the ACM (1974)

Data from the 1970 Census and the Department of Labor's Area Wage Surveys are used to derive estimates of the number of full-time programmers employed during the years 1969 through 1973. The 1973 figure of 180,000 is considerably less than suggested in earlier reports. It is recommended that educational administrators consider whether the many courses aimed at training programmers are justified on a vocational basis.
Structured programming in Cobol: an approach for application programmers
Authors: Allen van Gelder
Venue: Communications of the ACM (1977)

Techniques for designing and writing Cobol programs are presented. Previous work in structured programming is drawn upon and adapted. The presentation is informal: the terminology is nonmathematical as far as possible, no theorems are proved, and examples are used frequently. Top-down program design is implemented through the use of structured flowcharts, disciplined specifications, and step by step verification. A well-formed Cobol program is defined. The proper use of the GO TO and other Cobol coding practices are discussed.
Aligning Logical and Psychological Perspectives on Diagrammatic Reasoning
Authors: Keith Stenning, Oliver Lemon
Venue: Artificial Intelligence Review (2001)

We advance a theoretical framework which combines recent insights of research in logic, psychology, and formal semantics, on the nature of diagrammatic representation and reasoning. In particular, we wish to explain the varied efficacy of reasoning and representing with diagrams. In general we consider diagrammatic representations to be restricted in expressive power, and we wish to explain efficacy of reasoning with diagrams via the semantical and computational properties of such restricted `languages'. Connecting these foundational insights (from semantics and complexity theory) to the psychology of reasoning with diagrams requires us to develop the notion of the availability (to an agent) of constraints operating within representation systems, as a consequence of their direct semantic interpretation. Thus we offer a number of fundamental definitions as well as a research programme which aligns current efforts in the logical and psychological analysis of diagrammatic representation systems.
Extending OpenMP for NUMA machines
Authors: John Bircsak, Peter Craig, RaeLyn Crowell, Zarka Cvetanovic, Jonathan Harris, C. Alexander Nelson, Carl D. Offner
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

This paper describes extensions to OpenMP which implement data placement features needed for NUMA architectures. OpenMP is a collection of compiler directives and library routines used to write portable parallel programs for shared-memory architectures. Writing efficient parallel programs for NUMA architectures, which have characteristics of both shared-memory and distributed-memory architectures, requires that a programmer control the placement of data in memory and the placement of computations that operate on that data. Optimal performance is obtained when computations occur on processors that have fast access to the data needed by those computations. OpenMP-designed for shared-memory architectures-does not by itself address these issues. The extensions to OpenMP Fortran presented here have been mainly taken from High Performance Fortran. The paper describes some of the techniques that the Compaq Fortran compiler uses to generate efficient code based on these extensions. It also describes some additional compiler optimizations, and concludes with some preliminary results.
Evaluating navigation methods for an AR system
Authors: Morten Fjeld
Venue: Proceedings of DARE 2000 on Designing augmented reality environments (2000)

BUILD-IT is a planning tool based on computer vision technology, supporting complex planning and composition tasks. A group of people, seated around a table, interact with objects in a virtual scene using real bricks. A plan view of the scene is projected onto the table, where object manipulation takes place. A perspective view is projected on the wall. The views are set by virtual cameras, having spatial attributes like shift, rotation and zoom. However, planar interaction with bricks provides only position and rotation information. This paper explores two alternative methods to bridge the gap between planar interaction and three-dimensional navigation. An empirical evaluation of the two alternatives is in process.
On the Use of Virtual Channels in Networks of Workstations with Irregular Topology
Authors: Federico Silla, José Duato
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

Networks of workstations are becoming increasingly popular as a cost-effective alternative to parallel computers. Typically, these networks connect workstations using irregular topologies, providing the wiring flexibility, scalability, and incremental expansion capability required in this environment. Recently, we proposed two methodologies for the design of adaptive routing algorithms for networks with irregular topology, as well as fully adaptive routing algorithms for these networks. These algorithms increase throughput considerably with respect to previously existing ones, but require the use of at least two virtual channels. In this paper, we propose a very efficient flow control protocol to support virtual channels when link wires are very long and/or have different lengths. This flow control protocol relies on the use of channel pipelining and control flits. Control traffic is minimized by assigning physical bandwidth to virtual channels until the corresponding message blocks or it is completely transmitted. Simulation results show that this flow control protocol performs as efficiently as an ideal network with short wires and flit-by-flit multiplexing. The effect of additional virtual channels per physical channel has also been studied, revealing that the optimal number of virtual channels varies with network size. The use of virtual channel priorities is also analyzed. The proposed flow control protocol may increase short message latency, due to long messages monopolizing channels and hindering the progress of short messages. Therefore, we have analyzed the impact of limiting the number of flits (block size) that a virtual channel may forward once it gets the link. Simulation results show that limiting the maximum block size causes the overall network performance to decrease.
Methods of numerical integration applied to a system having trivial function evaluations
Authors: John Waters
Venue: Communications of the ACM (1966)

A study has been made to determine which methods of numerical integration require the least computation time for a given amount of truncation error when applied to a particular system of ordinary differential equations where function evaluations are relatively trivial. Recent methods due to Butcher and Gear are compared with classic Runge-Kutta, Kutta-Nystr&ouml;m and Adams methods. Some of the newer one-step methods due to Butcher are found to be slightly superior, but no one method is found to have any great advantage over the others in the application to this particular problem.
Optimal balancing of I/O requests to disks
Authors: William F. Piepmeier
Venue: Communications of the ACM (1975)

Determining a policy for efficient allocation and utilization of a set of disk drives with differing operational characteristics is examined using analytical techniques. Using standard queueing theory, each disk drive is characterized by a queueing model with service time of a disk drive represented by the probability density function of the sum of two uniform distributions. Total response time of the set of disk models is then minimized under varying load conditions. The results indicate that faster devices should have higher utilization factors and that the number of different device types utilized tends to decrease with decreasing load. Specific examples using 2314 and 3330 combinations are examined.
An algorithm for hidden line elimination
Authors: R. Galimberti
Venue: Communications of the ACM (1969)

The algorithm presented causes the elimination of hidden lines in the representation of a perspective view of concave and convex plane-faced objects on the picture plane. All the edges of the objects are considered sequentially, and all planes which hide every point of an edge are found. The computing time increases roughly as the square of the number of edges. The algorithm takes advantage of a reduced number of concave points and automatically recognizes if only one object with no concave points is considered. In this last case, the result is obtained in a much simpler way.