ppxscal/embedding_network huggingface dataset:
Analysis of eye tracking movements using FIR median hybrid filters
Authors: J. Gu, M. Meng, A. Cook, M G. Faulkner
Venue: Proceedings of the 2000 symposium on Eye tracking research & applications (2000)

This paper presents an approach of using FIR Median Hybrid Filters for analysis of eye tracking movements. The proposed filter can remove the eye blink artifact from the eye movement signal. The background of the project is described first. The whole idea is to put movements into eyes, which are used as static prosthesis, so that the ocular implant will have the same natural movement as the real eye. First step is to obtain the movement of the real eye. From the review of the eye movement methods, the electro-oculogram (EOG) is used to determine the eye position. Because the eye blink artifact is always corrupted in the EOG signal, it must be filtered out for the purpose of our project. The FIR Median Hybrid Filter is studied in the paper; its properties are explored with examples. Finally the filter is used to deal the real eye blink corrupted EOG signal. Examples are given of analysis procedure for eye tracking or a random moving target. The method is proved to be highly reliable.
Emancipating instances from the tyranny of classes in information modeling
Authors: Jeffrey Parsons, Yair Wand
Venue: ACM Transactions on Database Systems (TODS) (2000)

Database design commonly assumes, explicitly or implicitly, that instances must belong to classes. This can be termed the assumption of inherent classification. We argue that the extent and complexity of problems in schema integration, schema evolution, and interoperability are, to a large degree, consequences of inherent classification. Furthermore, we make the case that the assumption of inherent classification violates philosophical and cognitive guidelines on classification and is, therefore, inappropriate in view of the role of data modeling in representing knowledge about application domains. As an alternative, we propose a layered approach to modeling in which information about instances is separated from any particular classification. Two data modeling layers are proposed: (1) an instance model consisting of an instance base (i.e., information about instances and properties) and operations to populate, use, and maintain it; and (2) a class model consisting of a class base (i.e., information about classes defined in terms of properties) and operations to populate, use, and maintain it. The two-layered model provides class independence. This is analogous to the arguments of data independence offered by the relational model in comparison to hierarchical and network models. We show that a two-layered approach yields several advantages. In particular, schema integration is shown to be partially an artifact of inherent classification that can be greatly simplified in designing a database based on a layered model; schema evolution is supported without the complexity of operations currently required by class-based models; and the difficulties associated with interoperability among heterogeneous databases are reduced because there is no need to agree on the semantics of classes among independent databases. We conclude by considering the adequacy of a two-layered approach, outlining possible implementation strategies, and drawing attention to some practical considerations.
Empirical investigations on query modification using abductive explanations
Authors: Ian Rithven, Mounia Lalmas, Keith van Rijsbergen
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

In this paper we report on a series of experiments designed to investigate query modification techniques motivated by the area of abductive reasoning. In particular we use the notion of abductive explanation, explanations being a description of data that highlight important features of the data. We describe several methods of creating abductive explanations, exploring term reweighting and query reformulation techniques and demonstrate their suitability for relevance feedback.
Validating the intel pentium 4 microprocessor
Authors: Bob Bentley
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

Developing a new leading edge IA-32 micro-processor is an immensely complicated undertaking. In the case of the Pentium© 4 processor, the microarchitecture is significantly more complex than any previous IA-32 microprocessor and the implementation borrows almost nothing from any previous implementation. This paper describes how we went about the task of finding bugs in the Pentium© 4 processor design prior to initial silicon, and what we found along the way.
Efficient verification using generalized partial order analysis
Authors: S. Vercauteren, D. Verkest, G. de Jong, B. Lin
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper presents a new formal method for the efficient verification of concurrent systems that are modeled using a safe Petri net representation. Our method generalizes upon partial-order methods to explore concurrently enabled conflicting paths simultaneously. We show that our method can achieve an exponential reduction in algorithmic complexity without resorting to an implicit enumeration approach.
OOPtutor: a CBL system for introductory object-oriented programming
Authors: J. Helene Gelderblom
Venue: ACM SIGCSE Bulletin (2000)

The author developed OOPtutor, a prototype of a system that teaches entry level object-oriented programming in Java. It uses a simple world of dogs to introduce the important object-oriented concepts like objects, classes, methods and inheritance. The prototype was implemented as a set of object-oriented classes that perform general CBL authoring functions. This article gives a brief description of the OOPtutor prototype and its implementation.
The coordinated use of five performance evaluation methodologies
Authors: Gordon E. Anderson
Venue: Communications of the ACM (1984)

Information system design can be influenced and ultimate performance parameters accurately forecast through the coordinated use of five performance analysis tools. The complementary methodology is used to first predict and then validate system performance throughout its life cycle.
Built-in-self-test with an alternating output
Authors: T. Bogue, M. Jürgensen, Y. Zorian, M. Gössel
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

A new compaction technique based on signature analysis is presented. Rather than comparing the final signature with the expected one after the test is completed, the binary output of the MISA is converted into an alternating binary signal by two simple cover circuits. An error is indicated whenever the alternation of the output signal is disturbed. This technique results in a higher fault coverage, improved fault diagnosis capability, a greater test autonomy in core-based designs, and early fault notification.
Building a large-scale generic object model: applying the CYC upper ontology to object database development in Java
Authors: Stephen Strom
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

Can the benefits of re-use and patterns that are so well known in software design and implementation be carried over into analysis and database design? The fledgling field of Analysis Patterns has provided only a partial affirmative answer. We have instead attempted to import the CYC upper ontology (an AI-derived &ldquo;model of everything&rdquo;) into an object model expressed in Java. The result is an object model that is extremely resilient to change and should be extensible to practically any domain. We describe the difficulties involved and some of the most important lessons learned.
An exponential method of numerical integration of ordinary differential equations
Authors: David A. Pope
Venue: Communications of the ACM (1963)

A formula for numerical integration is prepared, which involves an exponential term. This formula is compared to two standard integration methods, and it is shown that for a large class of differential equations, the exponential formula has superior stability properties for large step sizes. Thus this formula may be used with a large step size to decrease the total computing time for a solution significantly, particularly in those engineering problems where high accuracy is not needed.
The department of computer mathematics at Moscow State University
Authors: I. S. Berezin
Venue: Communications of the ACM (1960)

For the preparation of specialists in computer and machine mathematics and the development of scientific work in this area, the department of computer mathematics was created in 1949 in Moscow State University within the staff of the mechanical-mathematics faculty. This was headed by Academician S. L. Sobolev beginning in 1952. 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
Architectural support for copy and tamper resistant software
Authors: David Lie, Chandramohan Thekkath, Mark Mitchell, Patrick Lincoln Dan Boneh John Mitchell Mark Horowitz
Venue: ACM SIGPLAN Notices (2000)

Although there have been attempts to develop code transformations that yield tamper-resistant software, no reliable software-only methods are known. This paper studies the hardware implementation of a form of execute-only memory (XOM) that allows instructions stored in memory to be executed but not otherwise manipulated. To support XOM code we use a machine that supports internal compartments---a process in one compartment cannot read data from another compartment. All data that leaves the machine is encrypted, since we assume external memory is not secure. The design of this machine poses some interesting trade-offs between security, efficiency, and flexibility. We explore some of the potential security issues as one pushes the machine to become more efficient and flexible. Although security carries a performance penalty, our analysis indicates that it is possible to create a normal multi-tasking machine where nearly all applications can be run in XOM mode. While a virtual XOM machine is possible, the underlying hardware needs to support a unique private key, private memory, and traps on cache misses. For efficient operation, hardware assist to provide fast symmetric ciphers is also required.
Some issues on the translator of smalltalk to C++
Authors: Wang Shaofeng, Yang Fuquing, Sun Jiaguang
Venue: ACM SIGPLAN Notices (2001)

This paper mainly discusses s2cpp that is a translator of Smalltalk to C++. Generally, the translators of programming languages can be classified into two types. The first type is the translation between two specific programming languages. The second type is the translation between any two programming languages. Although s2cpp belongs to the first type, the use of intermediate pseudocodes allows it to be easily modified to be a translator of Smalltalk to other programming languages. We describe the architecture of s2cpp as well as some issues in designing and implementing the translator. Some results concerning the translation were given in the end.
Misleading intuition in algorithmic problem solving
Authors: David Ginat
Venue: Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education (2001)

This paper presents a study of misleading intuition in the domain of algorithmic problem solving. I noticed incorrect intuitive solutions to challenging algorithmic problems and interviewed students on their solutions. The students arrived at an erroneous conviction rather rapidly and demonstrated overconfidence and reinforcement of their incorrect ideas when presented with new evidence. I present two colorful and unfamiliar algorithmic challenges posed to the students, describe and discuss my experience, and offer some suggestions for reducing the effect of misleading intuition.
Evolution and organizational information systems: an assessment of Nolan's stage model
Authors: John Leslie King, Kenneth L. Kraemer
Venue: Communications of the ACM (1984)

Richard Nolan's stage model is the best known and most widely cited model of computing evolution in organizations. The model's development over a decade demonstrates its own evolution from a simple theory, based on the factoring of change states indicated by changes in computing budgets, to an elaborate account of the characteristics of six stages of computing growth. An analysis of the model's logical and empirical structure reveals a number of problems in its formulation that help to account for the fact that its principal tenets have not been independently validated. The model is shown to be an &ldquo;evolutionistic&rdquo; theory within the theories of evolution in the social sciences, focusing on assumed directions of growth and an implied end state toward which growth proceeds, and suffering from problems inherent in such theories. Further research based on an &ldquo;evolutionary&rdquo; view of computing growth is suggested as a means of improving theories of computing in organizations.
Partitioning digital worlds: focal and peripheral awareness in multiple monitor use
Authors: Jonathan Grudin
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

Software today does not help us partition our digital worlds effectively. We must organize them ourselves. This field study of users of multiple monitors examines how people with a lot of display space arrange information. Second monitors are generally used for secondary activities related to principal tasks, for peripheral awareness of information that is not the main focus, and for easy access to resources. A second monitor improves efficiency in ways that are difficult to measure yet can have substantial subjective benefit. The study concludes with illustrations of shortcomings of today's systems and applications: the way we work could be improved at relatively low cost.
Which formulae shrink under random restrictions?
Authors: Hana Chockler, Uri Zwick
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We show that the shrinkage exponent, under random restrictions, of formulae over a finite complete basis B of Boolean functions is strictly greater than 1 if and only if all the functions in B are monotone increasing or monotone decreasing in each one of their variables. As a consequence, we get non-linear lower bounds on the formula complexity of the parity function over any basis composed only of monotone increasing or decreasing functions.
Visualization components for persistent conversations
Authors: Marc A. Smith, Andrew T. Fiore
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

An appropriately designed interface to persistent, threaded conversations could reinforce socially beneficial behavior by prominently featuring how frequently and to what degree each user exhibits such behaviors. Based on the data generated by the Netscan data-mining project [9], we have developed a set of tools for illustrating the structure of discussion threads like those found in Usenet newsgroups and the patterns of participation within the discussions. We describe the benefits and challenges of integrating these tools into a multi-faceted dashboard for navigating and reading discussions in social cyberspaces like Usenet and related interaction media. Visualizations of the structure of online discussions have applications for research into the sociology of online groups as well as possible interface designs for their members.
Applying software engineering methods for hypermedia systems
Authors: Ignacio Aedo, Paloma Díaz
Venue: Proceedings of the 6th annual conference on Innovation and technology in computer science education (2001)

Despite the existence of software engineering methods for hypermedia development, this process is not as systematic as it could be expected and, in fact, the "hypermedia software crisis" still remains. This situation can be attributed to the scarce dissemination of methods for hypermedia. In this context, we present our experience teaching a software engineering method for hypermedia, called Ariadne, which is used to develop hypermedia applications following a user-centered approach.
On shrinking binary picture patterns
Authors: S. Levialdi
Venue: Communications of the ACM (1972)

A parallel processing algorithm for shrinking binary patterns to obtain single isolated elements, one for each pattern, is presented. This procedure may be used for counting patterns on a matrix, and a hardware implementation of the algorithm using large scale integrated tecnology is envisioned. The principal features of this method are the very small window employed (two-by-two elements), the parallel nature of the process, and the possibility of shrinking any pattern, regardless of the complexity of its configuration. Problems regarding merging and disconnection of patterns during the process as well as the determination of the maximum number of steps necessary to obtain a single isolated element from a pattern, are reviewed and discussed. An analogy with a neural network description, in terms of McCulloch-pitts &ldquo;neurons&rdquo; is presented.
A Low-Voltage Low-Power Rail-to-Rail Constant g_m Transconductance Amplifier
Authors: Ahmed M. Eltawil, Ahmed M. Soliman
Venue: Analog Integrated Circuits and Signal Processing (2000)

In this paper, a low-voltage low-power rail-to-rail constant g_{\it{m}} transconductance amplifier (TA) is introduced. The supply voltages are set at (&plusmn;1.5 V). The circuit depends on selecting the maximum transconductance (g_{\it{m}}) to achieve an almost constant g_{\it{m}} over the entire common-mode (CM) range. The circuit is then used to realize a second-order 4 MHz lowpass filter consuming 530 &mu;W, and a fifth-order 450 kHz lowpass elliptic filter consuming 2.3 mW. Both filters can be integrated on silicon without any external connections.
Parallelization of a legacy research program using OpenMP
Authors: Joseph Landman, Piotr Piecuch
Venue: ACM SIGPLAN Fortran Forum (2000)

OpenMP is a standard for shared-memory parallel (SMP) programming that uses directives to specify the parallelism of the program, without requiring a significant investment in time for rewriting the program as other parallel programming standards require. Using these directives within an existing research code, we demonstrate parallel speedups of 20 on 32 CPUs.
The Cornell program synthesizer: a syntax-directed programming environment
Authors: Tim Teitelbaum, Thomas Reps
Venue: Communications of the ACM (1981)

Programs are not text; they are hierarchical compositions of computational structures and should be edited, executed, and debugged in an environment that consistently acknowledges and reinforces this viewpoint. The Cornell Program Synthesizer demands a structural perspective at all stages of program development. Its separate features are unified by a common foundation: a grammar for the programming language. Its full-screen derivation-tree editor and syntax-directed diagnostic interpreter combine to make the Synthesizer a powerful and responsive interactive programming tool.
Algorithm 279: Chebyshev quadrature
Authors: F. R. A. Hopgood, C. Litherland
Venue: Communications of the ACM (1966)

It has always been obvious that the aid to calculation offered by the computer forces a change in the curricula of mathematics, statistics, physics, engineering and other courses. Not so obvious are the many pedagogic aids the computer can offer in teaching the subject matter. The possibilities of giving the student a better technical as well as conceptual understanding of statistics were explored for a number of years at the College of Medicine of the University of Cincinnati and are reported here.
Indexing techniques for power management in multi-attribute data broadcast
Authors: Qinglong Hu, Wang-Chien Lee, Dik Lun Lee
Venue: Mobile Networks and Applications (2001)

In this paper, we discuss the power conservative indexing techniques for managing multi-attribute data broadcast on wireless channels. These indexing techniques, namely, index tree, signature and hybrid, aim at improving the battery power consumption of mobile clients. By taking into account the broadcast management factors such as clustering and scheduling, these three indexing schemes may significantly reduce tune-in time while maintaining a reasonable access time. Cost models for single and multi-attribute query processing are developed. Our performance evaluation shows that the signature and hybrid methods are superior to the index tree method.
Pattern and toolkits in introductory CS courses
Authors: Richard Rasala, Viera K. Proulx
Venue: Journal of Computing Sciences in Colleges (2001)

This workshop will focus on the pedagogy for teaching introductory programming courses and the materials that support this approach. In our model, students learn programming basics by using elementary programming and design patterns. students then apply their skills in larger laboratory projects that present interesting applications of computer science. A collection of pattern tutorials and related laboratory problems will be presented and made available to the participants. All programming work is supported by the extensive use of core toolkits that serve as design models. The pattern tutorials, laboratories, and core toolkits are currently in use in C++ and are being developed in Java.
Modularization and hierarchy in a family of operating systems
Authors: A. N. Habermann, Lawrence Flon, Lee Cooprider
Venue: Communications of the ACM (1976)

This paper describes the design philosophy used in the construction of a family of operating systems. It is shown that the concepts of module and level do not coincide in a hierarchy of functions. Family members can share much software as a result of the implementation of run-time modules at the lowest system level.
A Simple Neural Network Pruning Algorithm with Application to Filter Synthesis
Authors: Kenji Suzuki, Isao Horiba, Noboru Sugie
Venue: Neural Processing Letters (2001)

This paper describes an approach to synthesizing desired filters using a multilayer neural network (NN). In order to acquire the right function of the object filter, a simple method for reducing the structures of both the input and the hidden layers of the NN is proposed. In the proposed method, the units are removed from the NN on the basis of the influence of removing each unit on the error, and the NN is retrained to recover the damage of the removal. Each process is performed alternately, and then the structure is reduced. Experiments to synthesize a known filter were performed. By the analysis of the NN obtained by the proposed method, it has been shown that it acquires the right function of the object filter. By the experiment to synthesize the filter for solving real signal processing tasks, it has been shown that the NN obtained by the proposed method is superior to that obtained by the conventional method in terms of the filter performance and the computational cost.