ppxscal/embedding_network huggingface dataset:
The audio notebook: paper and pen interaction with structured speech
Authors: Lisa Stifelman, Barry Arons, Chris Schmandt
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

This paper addresses the problem that a listener experiences when attempting to capture information presented during a lecture, meeting, or interview. Listeners must divide their attention between the talker and their notetaking activity. We propose a new device-the Audio Notebook-for taking notes and interacting with a speech recording. The Audio Notebook is a combination of a digital audio recorder and paper notebook, all in one device. Audio recordings are structured using two techniques: user structuring based on notetaking activity, and acoustic structuring based on a talker's changes in pitch, pausing, and energy. A field study showed that the interaction techniques enabled a range of usage styles, from detailed review to high speed skimming. The study motivated the addition of phrase detection and topic suggestions to improve access to the audio recordings. Through these audio interaction techniques, the Audio Notebook defines a new approach for navigation in the audio domain.
Graphical models for problem solving
Authors: Carlos Alberola, Lorenzo Tardón, Juan Ruiz-Alzola
Venue: Computing in Science and Engineering (2000)

Graphical models are not just efficient computational structures--they also incorporate knowledge in an intuitive way. The authors give an overview of the most important graphical models and some interesting applications of each.
Associating cooking video with related textbook
Authors: Reiko Hamada, Ichiro Ide, Shuichi Sakai
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

We have been handling video with supplementary documents, such as cooking programs, and are working on integration of such media. Through the integration, many applications will become possible, for example, reconstruction of multimedia data that supplement the information of each medium, construction of interactive database, or kitchen automation. Until now, we have proposed an integration system that perform integrative analysis of image, audio and text and associate each other. In this paper, we will introduce the latest text analysis result and discuss about future image and audio analysis of the proposed system.
A computer program for editing the news
Authors: Wayne A. Danielson, Bruce Briggs
Venue: Communications of the ACM (1963)

The computer news editing program is designed to perform the following functions: (1) it will input automatically those stories from the AP Teletypesetter tape which the editor wishes to use; (2) it will make additions and deletions in these stories according to instructions received from the editor; (3) it will attempt to &ldquo;edit,&rdquo; i.e. cut from the bottom, the stories in its possession according to (a) an overall news hole limitation, (b) a minimum-lines-per-story limitation, (c) the general interests of the paper's editor in various categories of news, (d) a formula which grants more space to those stories which the editor thinks are more important, and (e) the availability of news on the day in question; (4) it will print out stories cut to desired lengths and arranged in categories. There are, of course, many editing functions which the program does not perform. It does not assign stories to pages; it does not lay out the news and advertising; it does not crop pictures nor provide for display headlines; it does not cut stories (as an editor would) with regard for their meaningfulness and literary effectiveness. In short, the present program is presented more as an &ldquo;aid to the editor&rdquo; handling the news than as a complete computer editing system. Designing a complete editing system, though probably feasible, would be a major undertaking.
An Efficient and Stable Algorithm for the Symmetric-Definite Generalized Eigenvalue Problem
Authors: S. Chandrasekaran
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

A new, efficient, and stable algorithm for computing all the eigenvalues and eigenvectors of the problem $Ax = \lambda Bx$, where A is symmetric indefinite and B is symmetric positive definite, is proposed.
Computer simulation&mdash;discussion of the technique and comparison of languages
Authors: Daniel Teichroew, John Francis Lubin
Venue: Communications of the ACM (1966)

The purpose of this paper is to present a comparison of some computer simulation languages and of some of the packages by which each is implemented. Some considerations involved in comparing software packages for digital computers are discussed in Part I. The issue is obvious: users of digital computers must choose from available languages or write their own. Substantial costs can occur, particularly in training, implementation and computer time if an inappropriate language is chosen. More and more computer simulation languages are being developed: comparisons and evaluations of existing languages are useful for designers and implementers as well as users. The second part is devoted to computer simulation and simulation languages. The computational characteristics of simulation are discussed with special attention being paid to a distinction between continuous and discrete change models. Part III presents a detailed comparison of six simulation languages and packages: SIMSCRIPT, CLP, CSL, GASP, GPSS and SOL. The characteristics of each are summarized in a series of tables. The implications of this analysis for designers of languages, for users, and for implementers are developed. The conclusion of the paper is that the packages now available for computer simulation offer features which none of the more general-purpose packages do and that analysis of strengths and weaknesses of each suggests ways in which both current and future simulation languages and packages can be improved.
Acceleration Tools for Diagonal Information Global Optimization Algorithms
Authors: Anna Molinaro, Clara Pizzuti, Yaroslav D. Sergeyev
Venue: Computational Optimization and Applications (2001)

In this paper we face a classical global optimization problem&mdash;minimization of a multiextremal multidimensional Lipschitz function over a hyperinterval. We introduce two new diagonal global optimization algorithms unifying the power of the following three approaches: efficient univariate information global optimization methods, diagonal approach for generalizing univariate algorithms to the multidimensional case, and local tuning on the behaviour of the objective function (estimates of the local Lipschitz constants over different subregions) during the global search. Global convergence conditions of a new type are established for the diagonal information methods. The new algorithms demonstrate quite satisfactory performance in comparison with the diagonal methods using only global information about the Lipschitz constant.
Metrics based plagarism monitoring
Authors: Edward L. Jones
Venue: Journal of Computing Sciences in Colleges (2001)

Plagiarism in programming courses is a pervasive and frustrating problem that undermines the educational process. Defining plagiarism is difficult because of the fuzzy boundary between allowable peer-peer collaboration and plagiarism. Pursuing suspected plagiarism has attendant emotional and legal risks to the student and teacher, with the teacher bearing the burden of proof. In this paper we present a metrics-based system for monitoring similarities between programs and for gathering the &ldquo;preponderance&rdquo; of evidence needed to pursue suspected plagiarism. Anonymous results from monitoring are posted to create a climate in which the issue of plagiarism is discussed openly.
A Polymorphic Environment Calculus and its Type-Inference Algorithm
Authors: Shin-Ya Nishizaki
Venue: Higher-Order and Symbolic Computation (2000)

The polymorphic environment calculus is a polymorphic lambda calculus which enables us to treat environments as first-class citizens. In the calculus, environments are formalized as explicit substitutions, and the substitutions are included in the set of terms of the calculus. First, we introduce an untyped environment calculus, and we present a semantics of the calculus as a translation into the lambda calculus. Second, we propose a polymorphic type system for the environment calculus based on Damas-Milner's ML-polymorphic type system. In ML, polymorphism is allowed only in let-expressions&semi; in the polymorphic environment calculus, polymorphism is provided with environment compositions. We prove a subject-reduction theorem for the type system. Third, a type-inference algorithm is given to the polymorphic environment calculus, and we establish its soundness, termination, and principal-typing theorem.
Vector-space ranking with effective early termination
Authors: Vo Ngoc Anh, Owen de Kretser, Alistair Moffat
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

Considerable research effort has been invested in improving the effectiveness of information retrieval systems. Techniques such as relevance feedback, thesaural expansion, and pivoting all provide better quality responses to queries when tested in standard evaluation frameworks. But such enhancements can add to the cost of evaluating queries. In this paper we consider the pragmatic issue of how to improve the cost-effectiveness of searching. We describe a new inverted file structure using quantized weights that provides superior retrieval effectiveness compared to conventional inverted file structures when early termination heuristics are employed. That is, we are able to reach similar effectiveness levels with less computational cost, and so provide a better cost/performance compromise than previous inverted file organisations.
A decade of modeling financial vehicles
Authors: William F. Frank, Anil Karunaratne
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

While building nine object-oriented financial systems since 1989, we evolved techniques for modeling &ldquo;financial vehicles&rdquo; (bonds, contracts, real estate, racehorses). We specify each particular financial vehicle and vehicle type by combining objects that model the fundamental ideas behind financial vehicles. These techniques enable installed systems to accommodate new kinds of financial vehicles. Many normal software design techniques proved ineffective.
Improving co-operative working in the utility industry through mobile context aware geographic information systems
Authors: Martin Hope, Tom Chrisp, Nigel Linge
Venue: Proceedings of the 8th ACM international symposium on Advances in geographic information systems (2000)

This paper presents the development of a mobile context aware geographic information system (G.I.S.) based upon IEEE 802.11 compliant standards and equipment, distributed database systems, and modular software components. Delivered across a high bandwidth wireless intranet, and developed from standard &ldquo;off the shelf&rdquo; products, the system presents a unique integration of existing technologies that when applied, could be beneficial to a number of industries that rely on remote access to distributed geo-spatial data. Results from extensive field trials of the system in Manchester (UK) are then presented, in terms of the potential impact of the system on both the co-operative and the isolated working practices of field engineers in the Utility Industry.
Inferring calendar event attendance
Authors: Elizabeth Mynatt, Joe Tullio
Venue: Proceedings of the 6th international conference on Intelligent user interfaces (2001)

The digital personal calendar has long been established as an effective tool for supporting workgroup coordination. For the new class of ubiquitous computing applications, however, the calendar can also be seen as a sensor, providing both location and availability information to these applications. In most cases, however, the calendar represents a sequence of events that people could (or should) attend, not their actual daily activities. To assist in the accurate determination of user whereabouts and availability, we present Ambush, a calendar system extension that uses a Bayesian model to predict the likelihood of one's attendance at the events listed on his or her schedule. We also present several techniques for the visual display of these likelihoods in a manner intended to be quickly interpreted by users examining the calendar.
A high-speed PLA using array logic circuits with latch sense amplifiers and a charge sharing scheme
Authors: Hiroaki Yamaoka, Makoto Ikeda, Kunihiro Asada
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

In this paper, a high-speed PLA based on latch sense amplifiers and a charge sharing scheme is resented. The circuit consists of logic cell arrays, dual-rail bit-lines, latch sense amplifiers, and control blocks. By latch sense amplifiers, a read-out scheme sensing the differential voltage of dual-rail bit-lines caused by charge sharing is used for high-speed operation. As an application of the proposed PLA, a 32-bit binary comparator is designed and implemented in a 0.6-um double-poly, triple-metal CMOS process. Results of HSPICE simulation are 2.9 times faster than the conventional CMOS circuit. The measured results show a good agreement with the simulation.
A proposal for character code compatability
Authors: R. W. Bemer
Venue: Communications of the ACM (1960)

The emergence of a single standard from a welter of conflicting precedents depends upon two solutions: selection or development of an adequate and logical standard, phasing out (or peaceful coexistence with) the old varieties. This paper deals with the latter problem and proposes the mechanics for a solution in the area of character codes, as represented by bit combinations.
Exploring 3D navigation: combining speed-coupled flying with orbiting
Authors: Desney S. Tan, George G. Robertson, Mary Czerwinski
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

We present a task-based taxonomy of navigation techniques for 3D virtual environments, used to categorize existing techniques, drive exploration of the design space, and inspire new techniques. We briefly discuss several new techniques, and describe in detail one new techniques, Speed-coupled Flying with Orbiting. This technique couples control of movement speed to camera height and tilt, allowing users to seamlessly transition between local environment-views and global overviews. Users can also orbit specific objects for inspection. Results from two competitive user studies suggest users performed better with Speed-coupled Flying with Orbiting over alternatives, with performance also enhanced by a large display.
Part II: A Profile of SoundTracker
Authors: Dave Phillips
Venue: Linux Journal (2001)

This article is based on a chapter from the author's book Linux Music & Sound, published by No Starch Press in October 2000.
A parallel dynamic-mesh Lagrangian method for simulation of flows with dynamic interfaces
Authors: Noel J. Walkington, James F. Antaki, Guy E. Blelloch, Omar Ghattas, Iran Melcevic, Gary L. Miller
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

Many important phenomena in science and engineering, including our motivating problem of microstructural blood flow, can be modeled as flows with dynamic interfaces. The major challenge faced in simulating such flows is resolving the interfacial motion. Lagrangian methods are ideally suited for such problems, since interfaces are naturally represented and propagated. However, the material description of motion results in dynamic meshes, which become hopelessly distorted unless they are regularly regenerated. Lagrangian methods are particularly challenging on parallel computers, because scalable dynamic mesh methods remain elusive. Here, we present a parallel dynamic mesh Lagrangian method for flows with dynamic interfaces. We take an aggressive approach to dynamic meshing by triangulating the propagating grid points at every timestep using a scalable parallel Delaunay algorithm. Contrary to conventional wisdom, we show that the costs of the dynamic mesh components (triangulation, coarsening, refinement, and partitioning) can be made small relative to the flow solver.
Stably updating mean and standard deviation of data
Authors: Richard J. Hanson
Venue: Communications of the ACM (1975)

By considering the (sample) mean of a set of data as a fit to this data by a constant function, a computational method is given based on a matrix formulation and Givens transformations. The (sample) mean and standard deviation can be updated as data accumulates. The procedure is numerically stable and does not require storage of the data. Methods for dealing with weighted data and data removal are presented. When updating the mean and square of the standard deviation, the process requires no square roots.
Efficient minimum spanning tree construction without Delaunay triangulation
Authors: Hai Zhou, Narendra Shenoy, William Nicholls
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

Minimum spanning tree problem is a very important problem in VLSI CAD. Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs of points and takes at least &omega;(n2) time. More efficient approaches find a minimum spanning tree only among edges in the Delaunay triangulation of the points. However, Delaunay triangulation is not well defined in rectilinear distance. In this paper, we first establish a framework for minimum spanning tree construction which is based on a general concept of spanning graphs. A spanning graph is a natural definition and not necessarily a Delaunay triangulation. Based on this framework, we then design an O(n log n) sweep-line algorithm to construct a rectilinear minimum spanning tree without using Delaunay triangulation.
Transient dynamics simulations: parallel algorithms for contact detection and smoothed particle hydrodynamics
Authors: Steve Plimpton
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

Transient dynamics simulations are commonly used to model phenomena such as car crashes, underwater explosions, and the response of shipping containers to high-speed impacts. Physical objects in such a simulation are typically represented by Lagrangian meshes because the meshes can move and deform with the objects as they undergo stress. Fluids (gasoline, water) or fluid-like materials (earth) in the simulation can be modeled using the techniques of smoothed particle hydrodynamics. Implementing a hybrid mesh/particle model on a massively parallel computer poses several difficult challenges. One challenge is to simultaneously parallelize and load-balance both the mesh and particle portions of the computation. A second challenge is to efficiently detect the contacts that occur within the deforming mesh and between mesh elements and particles as the simulation proceeds. These contacts impart forces to the mesh elements and particles which must be computed at each timestep to accurately capture the physics of interest. In this paper we describe new parallel algorithms for smoothed particle hydrodynamics and contact detection which turn out to have several key features in common. Additionally, we describe how to join the new algorithms with traditional parallel finite element techniques to create an integrated particle/mesh transient dynamics simulation. Our approach to this problem differs from previous work in that we use three different parallel decompositions, a static one for the finite element analysis and dynamic ones for particles and for contact detection. We have implemented our ideas in a parallel version of the transient dynamics code PRONTO-3D and present results for the code running on a large Intel Paragon.
The push tree problem
Authors: Frédéric Havet, Marc Wennink
Venue: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures (2001)

In this paper, we introduce the Push Tree problem which contains elements from both the Steiner Tree and the Shortest Path problem. The Push Tree problem deals with the trade-offs between the push and pull mechanisms used in information distribution and retrieval. We present some initial complexity results and analyse several heuristics. Moreover, we discuss what lessons can be learned from the static and deterministic Push Tree problem for more realistic scenarios characterised by high uncertainty and changing information request and update patterns.
The SPARK way to correctness is via abstraction
Authors: John Barnes
Venue: ACM SIGAda Ada Letters (2000)

This paper gives a short introduction to the SPARK language and illustrates how the use of abstraction leads towards correctness.
A general business-oriented language based on decision expressions
Authors: Lionello A. Lombardi
Venue: Communications of the ACM (1964)

The structure of a digital computer programming language which covers a wide class of business and file processing applications is presented. Such a structure, based on identifying and incorporating into a compiler the aspects common to all processes of such class, permits writing extremely compact programs, even for comparatively complex applications, in terms of tables of control expressions which express only information characteristic of the particular application. Furthermore, local changes of a process (e.g. changes affecting only one of the output files involved) can be effected by local modifications in the program (e.g. modification of only one entry of the tables). This structure also allows for inexpensive preparation of loading-speed compilers which translate the source programs into efficient machine codes. The approach adopted here departs from conventional mechanical language design philosophies. It stresses the structural analysis of the class of processes to be represented in the languages, as opposed to emphasizing formal (i.e., contents-independent) syntactical definitions. It relies exclusively on nonprocedural representation of processes as sets (tables) of relations between data and results (there are no control statements such as GO TO, etc.), instead of using procedure descriptions (which are one-to-one translations of flowcharts). Here an invariant pattern of procedure is identified as characteristic of the class of all batch file processes.
A minimalist approach to framework documentation
Authors: Ademar Aguiar
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

Good documentation is crucial for the success of frameworks. In this research, a new documenting approach is proposed combining existing document styles in a kind of &ldquo;minimalist&rdquo; framework manual with a special emphasis on framework understandability and usability, rather than on describing framework design. Benefits and drawbacks are evaluated from frameworks of different domains and complexity.
A design for a number theory package with an optimized trial division routine
Authors: M. C. Wunderlich, J. L. Selfridge
Venue: Communications of the ACM (1974)

A number theory package is described which uses doubly linked list structures for storing multiprecise integers. The package has been coded in IBM's Basic Assembly Language and makes heavy use of the macro language and conditional assembly. An optimally coded trial division routine is also described which can be used to determine the unique factorization of large integers.