ppxscal/embedding_network huggingface dataset:
Reconfigurable Filter Coprocessor Architecture for DSP Applications
Authors: S. Ramanathan, S. K. Nandy, V. Visvanathan
Venue: Journal of VLSI Signal Processing Systems (2000)

Digital Signal Processing (DSP) is widely used in high-performance media processing and communication systems. In majority of these applications, critical DSP functions are realized as embedded cores to meet the low-power budget and high computational complexity. Usually these cores are ASICs that cannot be easily retargeted for other similar applications that share certain commonalities. This stretches the design cycle that affects time-to-market constraints. In this paper, we present a reconfigurable high-performance low-power filter coprocessor architecture for DSP applications. The coprocessor architecture, apart from having the performance and power advantage of its ASIC counterpart, can be reconfigured to support a wide variety of filtering computations. Since filtering computations abound in DSP applications, the implementation of this coprocessor architecture can serve as an important embedded hardware IP.
A comparison of disks and tapes
Authors: Herman Hess
Venue: Communications of the ACM (1963)

The principal characteristics of current magnetic disks and tape units are summarized and compared. Some of the characteristics of disk files are illustrated in a sorting example and compared to a tapesort. The conclusion is presented that disk files are competitive to tapes in some important applications. 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
The parameterized complexity of database queries
Authors: Martin Grohe
Venue: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2001)

This paper gives a short introduction into parameterized complexity theory, aimed towards database theorists interested in this area. The main results presented here classify the evaluation of first-order queries and conjunctive queries as hard parameterized problems.
Mining needle in a haystack: classifying rare classes via two-phase rule induction
Authors: Mahesh V. Joshi, Ramesh C. Agarwal, Vipin Kumar
Venue: ACM SIGMOD Record (2001)

Learning models to classify rarely occurring target classes is an important problem with applications in network intrusion detection, fraud detection, or deviation detection in general. In this paper, we analyze our previously proposed two-phase rule induction method in the context of learning complete and precise signatures of rare classes. The key feature of our method is that it separately conquers the objectives of achieving high recall and high precision for the given target class. The first phase of the method aims for high recall by inducing rules with high support and a reasonable level of accuracy. The second phase then tries to improve the precision by learning rules to remove false positives in the collection of the records covered by the first phase rules. Existing sequential covering techniques try to achieve high precision for each individual disjunct learned. In this paper, we claim that such approach is inadequate for rare classes, because of two problems: splintered false positives and error-prone small disjuncts. Motivated by the strengths of our two-phase design, we design various synthetic data models to identify and analyze the situations in which two state-of-the-art methods, RIPPER and C4.5 rules, either fail to learn a model or learn a very poor model. In all these situations, our two-phase approach learns a model with significantly better recall and precision levels. We also present a comparison of the three methods on a challenging real-life network intrusion detection dataset. Our method is significantly better or comparable to the best competitor in terms of achieving better balance between recall and precision.
Introduction to the fifth generation
Authors: Pamela McCorduck
Venue: Communications of the ACM (1983)

In October 1981, Japan's Ministry of International Trade and Industry (MITI) sponsored a conference to announce a new national project. Alongside national projects in supercomputing and robotics, there would be an effort to develop a new generation (the fifth, by their reckoning) of computers.
Weakly augmented reality: observing and designing the work-place of creative designers
Authors: Giorgio De Michelis, Flavio De Paoli, Costanza Pluchinotta, Marco Susani
Venue: Proceedings of DARE 2000 on Designing augmented reality environments (2000)

In this paper we distinguish between two spatially oriented system design paradigms: weak and strong augmented reality. The weak augmented reality paradigm is then applied in the design of a system supporting co-operation and knowledge creation within a design centre. The system has been designed on the hints we got from two subsequent ethnographies of the work practice of creative designers. Since the design centre moved to a new location between our two sets of observations, we clearly focused our attention on the impact that space arrangements had on the practice of its members. The comparison between the two settings in terms of layout, ICT equipment, changes occurred in the practices and attitudes of the designers throughout these years, lead us to design a collaborative environment weakly augmenting the place where designers are working.
&ldquo;Alfonse, give me a call!&rdquo;
Authors: Stephen J. Hartley
Venue: ACM SIGCSE Bulletin (2001)

The SR programming language supports a simple and elegant set of abstractions for its model of distributed computing. The model provides an effective framework for demonstrating to students the different styles of distributed programming. A small Java toolkit based on SR's model is presented in this paper. This toolkit allows instructors to use the popular Java language as a platform in parallel and distributed processing courses.
From equal access to differential invitation: creating collaborative cultures that provide equal access and encourage equal participation
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

We will address the challenge of including a diversity of users, and of facilitating their relationship to technology as a tool. When characteristics of individuals are considered different, stigmatized, or negatively stereotyped, they make individuals less likely to explore and to participate in activities that promote learning and successful adaptation. We will pose the question, &ldquo;what makes some groups &ldquo;shy&rdquo; about using technology?&rdquo;
One-line random number generators and their use in combinations
Authors: George Marsaglia, T. A. Bray
Venue: Communications of the ACM (1968)

Some one-line random number generators, i.e. generators requiring a single FORTRAN instruction are discussed, and some short FORTRAN programs which mix several such generators are described. The aim is to provide methods for incorporating random number generators directly in FORTRAN programs, by means of a few in-line instructions. The advantages are speed (avoiding linkage to and from a subroutine), convenience, and versatility. Anyone wishing to experiment with generators, either using congruential generators by themselves or mixing several generators to provide a composite with potentially better statistical properties than the library generators currently available, may wish to consider some of the simple FORTRAN programs discussed here.
Extending understanding of federal statistics in tables
Authors: Gary Marchionini, Carol Hert, Liz Liddy, Ben Shneiderman
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

This paper describes progress toward improving user interfaces for US Federal government statistics that are presented in tables. Based on studies of user behaviors and needs related to statistical tables, we describe interfaces to assist diverse users with a range of statistical literacy to explore, find, understand, and use US Federal government statistics.
Dynamic software testing of MPI applications with umpire
Authors: Jeffrey S. Vetter, Bronis R. de Supinski
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

As evidenced by the popularity of MPI (Message Passing Interface), message passing is an effective programming technique for managing coarse-grained concurrency on distributed computers. Unfortunately, debugging message-passing applications can be difficult. Software complexity, data races, and scheduling dependencies can make programming errors challenging to locate with manual, interactive debugging techniques. This article describes Umpire, a new tool for detecting programming errors at runtime in message passing applications. Umpire monitors the MPI operations of an application by interposing itself between the application and the MPI runtime system using the MPI profiling layer. Umpire then checks the application's MPI behavior for specific errors. Our initial collection of programming errors includes deadlock detection, mismatched collective operations, and resource exhaustion. We present an evaluation on a variety of applications that demonstrates the effectiveness of this approach.
Object database evolution using separation of concerns
Authors: Awais Rashid, Peter Sawyer
Venue: ACM SIGMOD Record (2000)

This paper proposes an object database evolution approach based on separation of concerns. The lack of customisability and extensibility in existing evolution frameworks is a consequence of using attributes at the meta-object level to implement links among meta-objects and the injection of instance adaptation code directly into the class versions. The proposed approach uses dynamic relationships to separate the connection code from meta-objects and aspects - abstractions used by Aspect-Oriented Programming to localise cross-cutting concerns - to separate the instance adaptation code from class versions. The result is a customisable and extensible evolution framework with low maintenance overhead.
Formal property verification by abstraction refinement with formal, simulation and hybrid engines
Authors: Dong Wang, Pei-Hsin Jiang, James Kukula, Yunshan Zhu, Tony Ma, Robert Damiano
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

We present RFN, a formal property verification tool based on abstraction refinement. Abstraction refinement is a strategy for property verification. It iteratively refines an abstract model to better approximate the behavior of the original design in the hope that the abstract model alone will provide enough evidence to prove or disprove the property.However, previous work on abstraction refinement was only demonstrated on designs with up to 500 registers. We developed RFN to verify real-world designs that may contain thousands of registers. RFN differs from the previous work in several ways. First, instead of relying on a single engine, RFN employs multiple formal verification engines, including a BDD-ATPG hybrid engine and a conventional BDD-based fixpoint engine, for finding error traces or proving properties on the abstract model. Second, RFN uses a novel two-phase process involving 3-valued simulation and sequential ATPG to determine how to refine the abstract model. Third, RFN avoids the weakness of other abstraction-refinement algorithms --- finding error traces on the original design, by utilizing the error trace of the abstract model to guide sequential ATPG to find an error trace on the original design.We implemented and applied a prototype of RFN to verify various properties of real-world RTL designs containing approximately 5,000 registers, which represents an order of magnitude improvement over previous results. On these designs, we successfully proved a few properties and discovered a design violation.
Graphics: Pick a Card...Any Card
Authors: Matt Matthews
Venue: Linux Journal (2000)

With graphics capabilities being so important and new cards appearing all the time, you need a scorecard to pick the right one. Here it is ...
Workforce retention: what do IT employees really want?
Authors: Guy Paré, Michel Tremblay, Patrick Lalonde
Venue: Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research (2001)

The purpose of this study is to present and test an integrated model of turnover intentions that addresses the unique nature of the IT profession. We identified a multidimensional set of HR practices likely to increase retention among IT employees and considered citizenship behaviors as well as two distinct types of organizational commitment as key antecedents of turnover intentions. A questionnaire was developed and sent to the Quebec members of the Canadian Information Processing Society. Data from 394 respondents were used to validate the measures and test the research hypotheses. We present and discuss the results and make a series of recommendations for IT and HR executives.
A relational model of data for large shared data banks
Authors: E. F. Codd
Venue: Communications of the ACM (1970)

Future users of large data banks must be protected from having to know how the data is organized in the machine (the internal representation). A prompting service which supplies such information is not a satisfactory solution. Activities of users at terminals and most application programs should remain unaffected when the internal representation of data is changed and even when some aspects of the external representation are changed. Changes in data representation will often be needed as a result of changes in query, update, and report traffic and natural growth in the types of stored information. Existing noninferential, formatted data systems provide users with tree-structured files or slightly more general network models of the data. In Section 1, inadequacies of these models are discussed. A model based on n-ary relations, a normal form for data base relations, and the concept of a universal data sublanguage are introduced. In Section 2, certain operations on relations (other than logical inference) are discussed and applied to the problems of redundancy and consistency in the user's model.
The international impact of computers
Authors: Isaac L. Auerbach
Venue: Communications of the ACM (1961)

Just one year ago, I had the pleasure of surveying over 40 laboratories, factories and universities throughout Western Europe that were actively engaged in the computer field. Since then, many visitors from Europe have visited me and updated my information on the status of developments abroad.
Metasearch consistency
Authors: Mark Montague, Javed A. Aslam
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

We investigate the performance of metasearch algorithms in terms of how much they improve consistency. We find that three different metasearch algorithms, each over three datasets, usually improve the consistency of search results; sometimes the improvement is dramatic. Furthermore, consistency tends to improve when performance improves.
A Bayesian Method for Fitting Parametric and Nonparametric Models to Noisy Data
Authors: Michael Werman, Daniel Keren
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

We present a simple paradigm for fitting models, parametric and nonparametric, to noisy data, which resolves some of the problems associated with classical MSE algorithms. This is done by considering each point on the model as a possible source for each data point. The paradigm can be used to solve problems which are ill-posed in the classical MSE approach, such as fitting a segment (as opposed to a line). It is shown to be nonbiased and to achieve excellent results for general curves, even in the presence of strong discontinuities. Results are shown for a number of fitting problems, including lines, circles, elliptic arcs, segments, rectangles, and general curves, contaminated by Gaussian and uniform noise.
The universe model: an approach for improving the modularity and reliability of concurrent programs
Authors: Reimer Behrends, R. E. Kurt Stirewalt
Venue: Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications (2000)

We present the universe model, a new approach to concurrency management that isolates concurrency concerns and represents them in the modular interface of a component. This approach improves program comprehension, module composition, and reliability for concurrent systems. The model is founded on designer-specified invariant properties, which declare a component's dependencies on other concurrent components. Process scheduling is then automatically derived from these invariants. We illustrate the advantages of this approach by applying it to a real-world example.
A deductive question-answerer for natural language inference
Authors: Robert M. Schwarcz, John F. Burger, Robert F. Simmons
Venue: Communications of the ACM (1970)

The question-answering aspects of the Protosynthex III prototype language processing system are described and exemplified in detail. The system is written in LISP 1.5 and operates on the Q-32 time-sharing system. The system's data structures and their semantic organization, the deductive question-answering formalism of relational properties and complex-relation-forming operators, and the question-answering procedures which employ these features in their operation are all described and illustrated. Examples of the system's performance and of the limitations of its question-answering capability are presented and discussed. It is shown that the use of semantic information in deductive question answering greatly facilitates the process, and that a top-down procedure which works from question to answer enables effective use to be made of this information. It is concluded that the development of Protosynthex III into a practically useful system to work with large data bases is possible but will require changes in both the data structures and the algorithms used for question answering.
A model for and discussion of multi-interpreter systems
Authors: Michael J. Manthey
Venue: Communications of the ACM (1979)

A multi-interpreter system is a system in which programs execute by virtue of being interpreted by other programs, which themselves may either be interpreted (i.e. nested interpreters) or run directly on the host machine. The model reveals the anatomy of interpreters and how these differ from procedures, and exhibits links to protection domains and multiprocessor architectures.
Constructive modeling of FRep solids using spline volumes
Authors: Schmitt Benjamin, Pasko Alexander, Schlick Christophe
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

We present an approach to constructive modeling of FRep solids [2] defined by real-valued functions using 4D uniform rational cubic Bspline volumes as primitives. While the first three coordinates are used to represent the spatial component of the volume to be sculpted, the fourth coordinate is used as a scalar, which corresponds to a function value or a volume density. Thus, the shape can be manipulated by changing the scalar control coefficients of the spline volume. This modeling process is interactive as the isosurface can be polygonized and visualized in real time. The distance property we obtain, combined with the properties of the spline volumes, allow us to use the resulting 3D solid as a leaf of a constructive tree and to apply to it set-theoretic, blending and other operations defined using R-functions [2]. Additional deformations can be achieved by moving arbitrary points in the coordinate space and applying space mapping at any level of the constructive tree. The final constructive solid is defined by a single real-valued function evaluated by the tree traversing procedure.
Extended path expressions of XML
Authors: Makoto Murata
Venue: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2001)

Query languages for XML often use path expressions to locate elements in XML documents. Path expressions are regular expressions such that underlying alphabets represent conditions on nodes. Path expressions represent conditions on paths from the root, but do not represent conditions on siblings, siblings of ancestors, and descendants of such siblings. In order to capture such conditions, we propose to extend underlying alphabets. Each symbol in an extended alphabet is a triplet (e1, a, e2), where a is a condition on nodes, and e1 (e2) is a condition on elder (resp. younger) siblings and their descendants; e1 and e2 are represented by hedge regular expressions, which are as expressive as hedge automata (hedges are ordered sequences of trees). Nodes matching such an extended path expression can be located by traversing the XML document twice. Furthermore, given an input schema and a query operation controlled by an extended path expression, it is possible to construct an output schema. This is done by identifying, where in the input schema the given extended path expression is satisfied.
Symbolic Analysis of Bounded Petri Nets
Authors: Enric Pastor, Jordi Cortadella, Oriol Roig
Venue: IEEE Transactions on Computers (2001)

This work presents a symbolic approach for the analysis of bounded Petri nets. The structure and behavior of the Petri net is symbolically modeled by using Boolean functions, thus reducing reasoning about Petri nets to Boolean calculation. The set of reachable markings is calculated by symbolically firing the transitions in the Petri net. Highly concurrent systems suffer from the state explosion problem produced by an exponential increase of the number of reachable states. This state explosion is handled by using Binary Decision Diagrams (BDDs) which are capable of representing large sets of markings with small data structures. Petri nets have the ability to model a large variety of systems and the flexibility to describe causality, concurrency, and conditional relations. The manipulation of vast state spaces generated by Petri nets enables the efficient analysis of a wide range of problems, e.g., deadlock freeness, liveness, and concurrency. A number of examples are presented in order to show how large reachability sets can be generated, represented, and analyzed with moderate BDD sizes. By using this symbolic framework, properties requiring an exhaustive analysis of the reachability graph can be efficiently verified.
Space-efficient online computation of quantile summaries
Authors: Michael Greenwald, Sanjeev Khanna
Venue: Proceedings of the 2001 ACM SIGMOD international conference on Management of data (2001)

An &isin;-approximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of &isin;N. We present a new online algorithm for computing&isin;-approximate quantile summaries of very large data sequences. The algorithm has a worst-case space requirement of &Ogr;(1&divide;&isin; log(&isin;N)). This improves upon the previous best result of &Ogr;(1&divide;&isin; log2(&isin;N)). Moreover, in contrast to earlier deterministic algorithms, our algorithm does not require a priori knowledge of the length of the input sequence. Finally, the actual space bounds obtained on experimental data are significantly better than the worst case guarantees of our algorithm as well as the observed space requirements of earlier algorithms.
On the performance of balanced hashing functions when the keys are not equiprobable
Authors: Christos H. Papadimitriou, Philip A. Bernstein
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1980)

The cost (expected number of accesses per retrieval) of hashing functions is examined without the assumption that it is equally probable for all keys to be present in the table. It is shown that the obvious strategy&mdash;trying to balance the sums of probabilities of the keys mapped to any given address&mdash;may be suboptimal; however, the difference from the exactly optimal distribution cannot be large.