ppxscal/embedding_network huggingface dataset:
Gazetracker: software designed to facilitate eye movement analysis
Authors: Chris Lankford
Venue: Proceedings of the 2000 symposium on Eye tracking research & applications (2000)

The Eye-gaze Response Interface Computer Aid (ERICA) is a computer system developed at the University of Virginia that tracks eye movement. Originally developed as a means to allow individuals with disabilities to communicate, ERICA was then expanded to provide methods for experimenters to analyze eye movements. This paper describes an application called Gaze Tracker&trade; that facilitates the analysis of a test subject's eye movements and pupil response to visual stimuli, such as still images or dynamic software applications that the test subject interacts with (for example, Internet Explorer).
The Dilogarithm function of a real argument [S22]
Authors: Edward S. Ginsberg, Dorothy Zaborowski
Venue: Communications of the ACM (1975)

The dilogarithm function [1-3], defined by Li2(x) = - &int;x0 (1/z) ln (1 - z) dz, (1) occurs in several different applications in physics and engineering, ranging from quantum electrodynamics, to network analysis, to the thermodynamics of ideal ferromagnets, to the structure of polymers. A new function subroutine is developed which computes the dilogarithm function of a real argument to an accuracy of a few parts in 1015. This program was designed to be included in the usual package of library subprograms relied upon by most users. It employs an alternative computational approach to a previously published algorithm [4].
Co-Constructing Non-Mutual Realities: Delay-Generated Trouble in Distributed Interaction
Authors: Karen Ruhleder, Brigitte Jordan
Venue: Computer Supported Cooperative Work (2001)

The use of remote communication technologies to carry out daily work is becoming increasingly common, and their use in certain settings is already commonplace. Yet, in spite of the fact that significant sums are being spent on the acquisition of technologies to support distributed work, we are only beginning to understand the intricacies of these interactions. This paper identifies and analyzes one particular limitation of video-based teleconferencing, the impact of an audio and video delay on distributed communication. It offers a detailed microanalysis of one distributed team's use of videoconferencing to support remote teamwork. We explore through this analysis the impact which technology-generated delays may have on shared meaning-making between remote participants. We draw conclusions about the significance of our findings for understanding talk, interaction and collaboration across remote links, and conclude with recommendations for designers, users and implementers.
Middleware object query processing with deferred updates and autonomous sources
Authors: Jerry Kiernan, Michael J. Carey
Venue: Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (2000)

This paper presents a query processing algorithm called DECAF for use in middleware object query systems that are based on the use of an object cache. The DECAF algorithm is designed to work correctly even in the presence of updates to the underlying databases that don't go through the object cache (i.e., even for autonomous data sources that can be updated through legacy applications that do not perform their updates through the middleware object layer). DECAF's query results are consistent with updates performed by such transactions; its results are also consistent with any deferred updates that are present in the object cache but not yet committed at the database server. The DECAF algorithm attempts to push down query predicates to the underlying DBMSs to take advantage of the query processing capabilities of these systems and to reduce the amount of data transferred from these systems to the object cache.
Low Voltage and Mismatch Analysis of Quadruple Source Coupled Multi-input Floating-gate Mosfet Multiplier with Offset Trimming
Authors: Chee Yee Kwok, Hamid Reza Mehrvarz
Venue: Analog Integrated Circuits and Signal Processing (2001)

Considerations for optimisation of the MFMOS(Multi-input Floating-gate Mosfet) multiplier for gain, minimal total harmonic distortion, low supply voltage operation and offset trimming are considered in this paper. Analysis shows that good matching between pairs of devices are essential for low harmonic distortion. Results from simulation studies show that offset trimming can be facilitated by connecting the dc bias inputs in pairs and biasing them separately. A &plusmn;1.5 volt supply MFMOS multiplier has been designed and fabricated. Measured THD and nonlinearity at fullscale input are 0.8% and 0.5%, respectively. Bandwidth is more than 20 MHz and input dynamic range over a 0-1 MHz bandwidth is 92.6 db. The lowest measured operable supply voltage is w&plusmn;0.9 volt.
A study of devirtualization techniques for a Java Just-In-Time compiler
Authors: Kazuaki Ishizaki, Motohiro Kawahito, Toshiaki Yasue, Hideaki Komatsu, Toshio Nakatani
Venue: Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (2000)

Many devirtualization techniques have been proposed to reduce the runtime overhead of dynamic method calls for various object-oriented languages, however, most of them are less effective or cannot be applied for Java in a straightforward manner. This is partly because Java is a statically-typed language and thus transforming a dynamic call to a static one does not make a tangible performance gain (owing to the low overhead of accessing the method table) unless it is inlined, and partly because the dynamic class loading feature of Java prohibits the whole program analysis and optimizations from being applied.We propose a new technique called direct devirtualization with the code patching mechanism. For a given dynamic call site, our compiler first determines whether the call can be devirtualized, by analyzing the current class hierarchy. When the call is devirtualizable and the target method is suitably sized, the compiler generates the inlined code of the method, together with the backup code of making the dynamic call. Only the inlined code is actually executed until our assumption about the devirtualization becomes invalidated, at which time the compiler performs code patching to make the backup code executed subsequently. Since the new technique prevents some code motions across the merge point between the inlined code and the backup code, we have furthermore implemented recently-known analysis techniques, such as type analysis and preexistence analysis, which allow the backup code to be completely eliminated. We made various experiments using 16 real programs to understand the effectiveness and characteristics of the devirtualization techniques in our Java Just-In-Time (JIT) compiler. In summary, we reduced the number of dynamic calls by ranging from 8.9% to 97.3% (the average of 40.2%), and we improved the execution performance by ranging from -1% to 133% (with the geometric mean of 16%).
Drag-and-drop versus point-and-click mouse interaction styles for children
Authors: Kori M. Inkpen
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2001)

This research investigates children's use of two common mouse interaction styles, drag-and-drop and point-and-click, to determine whether the choice of interaction style impacts children's performance in interactive learning environments. The interaction styles were experimentally compared to determine if either method was superior to the other in terms of speed, error rate, or user preference, for children. The two interaction styles were also compared based on children's achievement and motivation, within a commercial software environment. Experiment I used an interactive learning environment as children played two versions of an educational puzzle-solving game, each version utilizing a different mouse interaction style; experiment II used a mouse-controlled software environment modeled after the educational game. The results were similar to previous results reported for adults: the point-and-click interaction style was faster; fewer errors were committed using it; and it was preferred over the drag-and-drop interaction style. Within the context of the puzzle-solving game, the children solved significantly fewer puzzles, and they were less motivated using the version that utilized a drag-and-drop interaction style as compared to the version that utilized a point-and-click interaction style. These results were also explored through the use of state-transition diagrams and GOMS models, both of which supported the experimental data gathered.
Evaluating and Optimizing Thread Pool Strategies for Real-Time CORBA
Authors: Irfan Pyarali, Marina Spivak, Ron Cytron, Douglas C. Schmidt
Venue: Proceedings of the ACM SIGPLAN workshop on Languages, compilers and tools for embedded systems (2001)

Strict control over the scheduling and execution of processor resources is essential for many fixed-priority real-time applications. To facilitate this common requirement, the Real-Time CORBA (RT-CORBA) specification defines standard middleware features that support end-to-end predictability for operations in such applications. One of the most important features in RT-CORBA is thread pools, which allow application developers and end-users to configure and control processor resources.This paper provides two contributions to the evaluation of techniques for improving the quality of implementation of RT-CORBA thread pools. First, we describe the key patterns underlying common strategies for implementing RT-CORBA thread pools. Second, we evaluate each thread pool strategy in terms of its consequences on (1) feature support, such as request buffering and thread borrowing, (2) scalability in terms of end-points and event demultiplexers required, (3) efficiency in terms of data movement, context switches, memory allocations, and synchronizations required, (4) optimizations in terms of stack and thread specific storage memory allocations, and (5) bounded and unbounded priority inversion incurred in each implementation. This paper also provides results that illustrate empirically how different thread pool implementation strategies perform in different ORB configurations.
A CMOS Analog Multiplier Free from Mobility Reduction and Body Effect
Authors: Eitake Ibaragi, Akira Hyogo, Keitaro Sekine
Venue: Analog Integrated Circuits and Signal Processing (2000)

This paper proposes a novel CMOS analog multiplier. As its significant merit, it is free from mobility reduction and body effect. Thus, the proposed multiplier is expected to have good linearity, comparing with conventional multipliers. Four transistors operating in the linear region constitute the input cell of the multiplier. Their sources and backgates are connected to the ground to cancel the body effect. Their gates are fixed to the same bias voltage to remove the effect of the mobility reduction. Input signals are applied to the drains of the input cell transistors through modified nullors. The simulation results show that THD is less than 0.8% for 0.6 V_p-p input signal at 2.5 V supply voltage, and that the 3 dB bandwidth is up to about 13.3 MHz.
A Modified Version of the K-Means Algorithm with a Distance Based on Cluster Symmetry
Authors: Mu-Chun Su, Chien-Hsing Chou
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

In this paper, we propose a modified version of the K-means algorithm to cluster data. The proposed algorithm adopts a novel nonmetric distance measure based on the idea of ¿point symmetry.¿ This kind of ¿point symmetry distance¿ can be applied in data clustering and human face detection. Several data sets are used to illustrate its effectiveness.
A generic late-join service for distributed interactive media
Authors: Jürgen Vogel, Martin Mauve, Werner Geyer, Volker Hilt, Christoph Kuhmünch
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

In this paper we present a generic late-join service for distributed interactive media, i.e, networked media which involve user interactions. Examples for distributed interactive media are shared whiteboards, networked computer games and distributed virtual environments. The generic late-join service allows a latecomer to join an ongoing session. This requires that the shared state of the medium is transmitted from the old participants of the session to the latecomer in an efficient and scalable way. In order to be generic and useful for a broad range of distributed interactive media, we have implemented the late-join service based on the Real Time Application Level Protocol for Distributed Interactive Media (RTP/I). All applications which employ this protocol can also use the generic late-join service. Furthermore the late-join service can be adapted to the specific needs of a given application by specifying policies for the late-join process. Applications which do use a different application level protocol than RTP/I may still use the concepts presented in this work. However, they will not be able to profit from our RTP/I based implementation.
Scientific programming in field theory, part 1
Authors: Regina Hannemann, Jens Hannemann, Michael Zellerhoff, Ludger Klinkenbusch
Venue: Computing in Science and Engineering (2001)

Today, field-theory scientists tackle most contemporary research problems numerically, not analytically. For this purpose, the field-theory community has developed, combined, and described numerous methods: the finite-difference time domain method, the method of moments, the finite-integration technique, the fast multipole method, and the finite-element method, among others. Having much in common, these methods all usually rely on coordinate transforms, need an implicit or explicit model to describe the geometry under investigation, and operate on discretized portions of the solution domain (meshes).
An efficient quasi-multiple medium algorithm fo the capacitance extraction of actual 3-D VLSI interconnects
Authors: Wenjian Yu, Zeyi Wang
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

In this paper, the quasi-multiple medium (QMM) method based on the direct boundary element method (BEM) is used to extract the capacitance of three-dimensional (3-D) VLSI interconnects with multiple dielectrics. Each dielectric in 3-D VLSI parasitic capacitor is cut into several fictitious mediums, so it produces much fewer non-zero entries to the total coefficients matrix. As a result, the QMM algorithm can greatly reduce the CPU time and memory space used in the capacitance extraction. To characterize the efficiency of QMM algorithm, we discuss accuracy, storage and timing statistics in comparison with the analogous information from non-QMM algorithm.
A model for masking rotational latency by dynamic disk allocation
Authors: D. E. Gold, D. J. Kuck
Venue: Communications of the ACM (1974)

This paper presents the background and algorithms for masking the rotational latency of a disk or drum. It discusses the anticipatory input and output of blocks of data to buffer and primary memories for a mono-programmed computer system. A basic permutation algorithm and several variations are given. Because of the anticipatory nature of the I/O scheduling, these algorithms are restricted to classes of programs with predictable behavior. While the methods are not restricted to numerical computations, matrix and partial differential equation methods are typical examples of their use. It is shown that latency may be masked using a small amount of buffer memory. The methods discussed are independent of the overall size of the data base being considered.
Petri nets and speed independent design
Authors: David Misunas
Venue: Communications of the ACM (1973)

Petri nets are investigated as one method of modeling speed independent asynchronous circuits. A study of circuit realizations of Petri nets leads to a demonstration of their usefulness in modeling speed independent operation. This usefulness is emphasized by the design of a speed independent processor from modules developed in the investigation of Petri net implementation.
A control system for logical block diagnosis with data loading
Authors: M. E. Senko
Venue: Communications of the ACM (1960)

This paper describes a section of an integrated diagnostic monitor system which facilitates the checking of sections of instructions or subroutines anywhere in the object program. A new method of specifying all diagnostic operations in a format similar to a computer program makes the system convenient to use and relatively simple to understand. The paper also describes a number of other novel diagnostic features which can be included in the system.
Peephole optimization
Authors: W. M. McKeeman
Venue: Communications of the ACM (1965)

Redundant instructions may be discarded during the final stage of compilation by using a simple optimizing technique called peephole optimization. The method is described and examples are given.
Developing teamwork through experiential learning
Authors: Courtney S. Ferguson, Shade K. Little, Marilyn K. McClelland
Venue: Journal of Computing Sciences in Colleges (2001)

The purpose of this study was to investigate the effectiveness of various Experiential Learning activities in the development of teamwork for students studying Computer Information Systems (CIS) who work in teams to complete CIS projects or case studies. Empirical evidence was obtained from students after participation in Ropes Courses. Perceptions of satisfaction of the Ropes Courses were obtained from a survey on the extent participation helped build self-esteem, confidence, character, trust in others; and stimulated teamwork and cooperation with others. This was an exploratory study that presented descriptive statistics that showed a high extent of benefit from Ropes courses. In conclusion, this study is a springboard for further research to establish a conceptual model on CIS teamwork for students in a CIS curriculum who have participated in Ropes courses versus those who have not had similar team building experiences. The findings can also help firms who want to accelerate their teamwork training to enable their professionals to perform better and faster in teams by giving them a Ropes course experience.
Grapevine: an exercise in distributed computing
Authors: Andrew D. Birrell, Roy Levin, Michael D. Schroeder, Roger M. Needham
Venue: Communications of the ACM (1982)

Grapevine is a multicomputer system on the Xerox research internet. It provides facilities for the delivery of digital messages such as computer mail; for naming people, machines, and services; for authenticating people and machines; and for locating services on the internet. This paper has two goals: to describe the system itself and to serve as a case study of a real application of distributed computing. Part I describes the set of services provided by Grapevine and how its data and function are divided among computers on the internet. Part II presents in more detail selected aspects of Grapevine that illustrate novel facilities or implementation techniques, or that provide insight into the structure of a distributed system. Part III summarizes the current state of the system and the lesson learned from it so far.
Extensible MPEG-4 textual format (XMT)
Authors: Michelle Kim, Steve Wood, Lai-Tee Cheok
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

This paper describes the Extensible MPEG-4 Textual format (XMT), a framework for representing MPEG-4 scene description using a textual syntax. The XMT allows the content authors to exchange their content with other authors, tools or service providers, and facilitates interoperability with both the X3D, developed by the Web3D consortium, and the Synchronized Multimedia Integration Language (SMIL) from the W3C consortium.
Global-software development lifecycle: an exploratory study
Authors: Alvin W. Yeo
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

This study was conducted to explore the efficacy of the global-software development lifecycle (global-SDLC), which comprises design, implementation and usability evaluation phase. A spreadsheet was adapted using the global-SDLC process to accommodate a number of cultures. The design and implementation phases were efficacious. However, in the usability evaluation phase, the usability evaluation techniques were only efficacious when participants, who were experienced computer users and participants who were familiar with the experimenter, were employed. Explanations, from cultural literature such as Hofstede, are presented and implications of these findings on the usability evaluation phase and the global-SDLC are also described.
Efficient evaluation of XML middle-ware queries
Authors: Mary Fernandez, Atsuyuki Morishima, Dan Suciu
Venue: Proceedings of the 2001 ACM SIGMOD international conference on Management of data (2001)

We address the problem of efficiently constructing materialized XML views of relational databases. In our setting, the XML view is specified by a query in the declarative query language of a middle-ware system, called SilkRoute. The middle-ware system evaluates a query by sending one or more SQL queries to the target relational database, integrating the resulting tuple streams, and adding the XML tags. We focus on how to best choose the SQL queries, without having control over the target RDBMS.
Man-machine communication via simplified English
Authors: Edward M. Bennett, Rollin P. Mayer, Philip R. Bagley
Venue: Communications of the ACM (1961)

Two specific projects are in process as part of an advanced planning effort for the development of automated techniques for command and control.
An estimation of the relative efficiency of two internal sorting methods
Authors: H. Nagler
Venue: Communications of the ACM (1960)

This report concerns the IBM 705, models I and II. It is a study of the machine time required by two internal sorting methods, the conventional two-way merge, and a form of the binary search, which is due to D. Mordy, of the IBM Corporation. In particular, estimates are derived for the more time-consuming machine operations of comparison of keys, loading of keys into accumulator storage, and transmission of tags. The first two operations arise in both methods; the last is peculiar to the binary search. If the exclusion of other ancillary program steps from the estimation of machine times may be regretted from a purely practical point of view, some of the intermediate estimates may be of interest in a more theoretical context.
Read-backward polyphase sorting
Authors: R. L. Gilstad
Venue: Communications of the ACM (1963)

Read-backward Polyphase sorting provides more efficient use of the tapes available to a sort than most other sorting techniques. Backward Polyphase produces a continuous merging process from n - 1 tapes where n is the total number of tapes being used in the sorting process. Any of the available presorting techniques may be used in conjunction with the Polyphase merge sort provided that the presort has the capability of producing both ascending and descending strings and distributing the strings on the various tapes as required by the Polyphase Merge.
Detection of partially simultaneously alive signals in storage requirement estimation for data intensive applications
Authors: PerGunnar Kjeldsberg, Francky Catthoor, Einar J. Aas
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

In this paper, we propose a novel storage requirement estimation methodology for use in the early system design phases when the data transfer ordering is only partially fixed. At that stage, none of the existing estimation tools are adequate, as they either assume a fully specified execution order or ignore it completely. Using representative application demonstrators, we show how our technique can effectively guide the designer to achieve a transformed specification with low storage requirement.