ppxscal/embedding_network huggingface dataset:
Binocular eye tracking in virtual reality for inspection training
Authors: Andrew T. Duchowski, Vinay Shivashankaraiah, Tim Rawls, Anand K. Gramopadhye, Brian J. Melloy, Barbara Kanki
Venue: Proceedings of the 2000 symposium on Eye tracking research & applications (2000)

This paper describes the development of a binocular eye tracking Virtual Reality system for aircraft inspection training. The aesthetic appearance of the environment is driven by standard graphical techniques augmented by realistic texture maps of the physical environment. A &ldquo;virtual flashlight&rdquo; is provided to simulate a tool used by inspectors. The user's gaze direction, as well as head position and orientation, are tracked to allow recording of the user's gaze locations within the environment. These gaze locations, or scanpaths, are calculated as gaze/polygon intersections, enabling comparison of fixated points with stored locations of artificially generated defects located in the environment interior. Recorded scanpaths provide a means of comparison of the performance of experts to novices, thereby gauging the effects of training.
Automated data-member layout of heap objects to improve memory-hierarchy performance
Authors: Thomas Kistler, Michael Franz
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2000)

We present and evaluate a simple, yet efficient optimization technique that improves memory-hierarchy performance for pointer-centric applications by up to 24% and reduces cache misses by up to 35%. This is achieved by selecting an improved ordering for the data members of pointer-based data structures. Our optimization is applicable to all type-safe programming languages that completely abstract from physical storage layout; examples of such languages are Java and Oberon. Our technique does not involve programmers in the optimization process, but runs fully automatically, guided by dynamic profiling information that captures which paths through the program are taken with that frequencey. The algorithm first strives to cluster data members that are accessed closely after one another onto the same cache line, increasing spatial locality. Then, the data members that have been mapped to a particular cache line are ordered to minimize load latency in case of a cache miss.
Reducing bus delay in submicron technology using coding
Authors: Paul P. Sotiriadis, Anantha Chandrakasan
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

In this paper we study the delay associated with transmission of data through busses. Previous work in this area has presented models for delay assuming a distributed model or a lumped capacitive coupling between wires. In this paper we extend the Elmore delay to account for a distributed model with distributed coupling component and an arbitrary number of lines driven by independent sources. The effect of data patterns is taken into account allowing us to estimate the delay on a sample by sample basis instead of making a worst case assumption. Using this detailed wire delay model, we propose a technique to speed up the communication through a data bus using coding. The idea is to encode the data being transmitted through the bus with the goal of eliminating certain types of transitions that require a large delay. We show that by using proper encoding techniques, the bus can be sped up by a factor of 2.
The SL5 procedure mechanism
Authors: David R. Hanson, Ralph E. Griswold
Venue: Communications of the ACM (1978)

This paper describes an integrated procedure mechanism that permits procedures to be used as recursive functions or as coroutines. This integration is accomplished by treating procedures and their activation records (called environments) as data objects and by decomposing procedure invocation into three separate components at the source-language level. In addition, argument binding is under the control of the programmer, permitting the definition of various methods of argument transmission in the source language itself. The resulting procedure mechanism, which is part of the SL5 programming language, is well suited to goal-oriented problems and to other problems that are more readily programmed by using coroutines. Several examples are given.
Scripting in GIS applications: experimental standards-based framework for perl
Authors: Alexandre Sorokine, Kurt Ackermann
Venue: Proceedings of the 8th ACM international symposium on Advances in geographic information systems (2000)

Scripting languages have long been utilized by GIS application developers to achieve higher levels of programming and shorter development times. Modern general-purpose scripting languages &mdash; like Tcl/Tk, Perl or Python &mdash; allow the smooth integration of various software components, while at the same time providing rich programming capabilities. Increases in processor speed and the development of industry-wide standards are removing obstacles to the proliferation of universal scripting languages in GIS applications. This paper examines the feasibility, architecture and early results of the building of a framework of object-oriented modules for Perl that is designed to provide uniform access to various sources of spatial data from Perl scripts. The framework is independent of any particular GIS application and thus based on the object model detailed in the Abstract Specification by The OpenGIS Consortium. The framework is intended to be used for rapid application development, gluing various software components together and prototyping.
Discontinuous enrichment in finite elements with a partition of unity method
Authors: John Dolbow, Nicolas Moës, Ted Belytschko
Venue: Finite Elements in Analysis and Design (2000)

We present an approximate analytical method to evaluate efficiently and accurately the call blocking probabilities in wavelength routing networks with multiple classes of calls. The model is fairly general and allows each source-destination pair to service calls of different classes, with each call occupying one wavelength per link. Our approximate analytical approach involves two steps. The arrival process of calls on some routes is first modified slightly to obtain an approximate multiclass network model. Next, all classes of calls on a particular route are aggregated to give an equivalent single-class model. Thus, path decomposition algorithms for single-class wavelength routing networks may be readilt extended to the multiclass case. This article is a first step towards understanding the issues arising in wavelength routing networks that serve multiple classes of customers.
Novel Test Pattern Generators for Pseudoexhaustive Testing
Authors: Rajagopalan Srinivasan, Sandeep K. Gupta, Melvin A. Breuer
Venue: IEEE Transactions on Computers (2000)

Pseudoexhaustive testing of a combinational circuit involves applying all possible input patterns to all its individual output cones. The testing ensures detection of all detectable multiple stuck-at faults in the circuit and all detectable combinational faults within individual cones. Test pattern generators based on coding theory principles are not tailored to a specific circuit as they do not utilize any structural information. They usually generate test sets that are several orders of magnitude larger than the minimum size pseudoexhaustive test set required for a specific circuit. In this paper, we describe hardware efficient test pattern generators that employ knowledge of the circuit output cone structures for generating minimal test sets. Using our techniques, we have designed generators that generate minimum size test sets for the ISCAS benchmark circuits.
Adaptive Parallel Rendering on Multiprocessors and Workstation Clusters
Authors: Wai-Sum Lin, Rynson W. H. Lau, Kai Hwang, Xiaola Lin, Paul Y. S. Cheung
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

This paper presents the design and performance of a new parallel graphics renderer for 3D images. This renderer is based on an adaptive supersampling approach that works for time/space-efficient execution on two classes of parallel computers. Our rendering scheme takes subpixel supersamples only along polygon edges. This leads to a significant reduction in rendering time and in buffer memory requirements. Furthermore, we offer a balanced rasterization of all transformed polygons. Experimental results prove these advantages on both a shared-memory SGI multiprocessor server and a Unix cluster of Sun workstations. We reveal performance effects of the new rendering scheme on subpixel resolution, polygon number, scene complexity, and memory requirements. The balanced parallel renderer demonstrates scalable performance with respect to increase in graphic complexity and in machine size. Our parallel renderer outperforms Crow's scheme in benchmark experiments performed. The improvements are made in three fronts: 1) reduction in rendering time, 2) higher efficiency with balanced workload, and 3) adaptive to available buffer memory size. The balanced renderer can be more cost-effectively embedded within many 3D graphics algorithms, such as those for edge smoothing and 3D visualization. Our parallel renderer is MPI-coded, offering high portability and cross-platform performance. These advantages can greatly improve the QoS in 3D imaging and in real-time interactive graphics.
General equations for idealized CPU-I/O overlap configurations
Authors: Toby J. Teorey
Venue: Communications of the ACM (1978)

General equations are derived for estimating the maximum possible utilization of main storage partitions, CPU and I/O devices under different conditions in an idealized CPU-I/O overlap model of multiprogrammed computer systems. The equations are directly applicable to any configuration consisting of sets of identical CPU's, I/O processors, main storage partitions and user tasks. Examples are provided to illustrate the use of the equations to compute effective processing time per record and expected timesharing response time under both balanced and unbalanced resource utilization conditions.
The computer revolution hasn't happened yet (keynote session)
Authors: Alan C. Kay
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

The printing press was invented in the middle of the 15th century, yet it took 100 years before a book was considered dangerous enough to be banned. 150 years before science was invented, almost 200 years before a new kind of political essay was invented, and more than 300 hundred years before a country with an invented political system (the US) could be argued into existence via the press and a citizenry that could understand the arguments. Schooling and general literacy were also fruits of the press, and also took many centuries to become established. The commercial computer is now about 50 years old and is still imitating the paper culture that came before it, just as the printing press did with the manuscript culture it gradually replaced. No media revolution can be said to have happened without a general establishment of &ldquo;literacy&rdquo;: fluent &ldquo;reading&rdquo; and &ldquo;writing&rdquo; at the highest level of ideas that the medium can represent. With computers, we are so far from that fluent literacy &mdash; or even understanding what that literacy should resemble &mdash; that we could claim that the computer revolution hasn't even started. This talk will try to put a shape to the real computer revolution to come.
Image watermaking for owner and content authentication
Authors: Jean-Luc Dugelay, Christian Rey
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

The aim of this technical demonstration is to present the ongoing performance of our R D watermarking scheme software for copyright and image content authentication. The proposed demonstration cover a large panel of original images (in gray levels and colors), signatures and attacks. Evaluation is performed according to ratio, visibility and robustness.
Development of an international system for legal protection of computer programs
Authors: Oliver R. Smoot
Venue: Communications of the ACM (1976)

Is execution of a program &ldquo;copying?&rdquo; If a program is copyrighted, is execution an infringement of the copyright? Is an algorithm, or a program, or a computer running a program, patentable? If a program is licensed as a trade secret to N users with a nondisclosure clause, at what point is N so large as to be the equivalent of publication? How far can old laws be stretched to accommodate new technology? How can developing countries gain access to the computer software they need? Questions such as these increasingly have concerned software developers and lawyers since computer programs first began to be sold. Now international diplomats responding to the call of the developing nations for increased assistance in their development are asking similar questions.
Dribble posting a master file
Authors: Robert V. Head
Venue: Communications of the ACM (1966)

Many business applications employ sequential magnetic tape rather than random-access storage techniques to process a very small number of transactions against a voluminous master file. In such situations, it may prove economical to avoid creating a new master file during each updating run by producing instead a dribble ledger containing only those master file accounts which have experienced activity. 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
Implicit context: easing software evolution and reuse
Authors: Robert J. Walker, Gail C. Murphy
Venue: Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications (2000)

Software systems should consist of simple, conceptually clean software components interacting along narrow, well-defined paths. All too often, this is not reality: complex components end up interacting for reasons unrelated to the functionality they provide. We refer to knowledge within a component that is not conceptually required for the individual behaviour of that component as extraneous embedded knowledge (EEK). EEK creeps into a system in many forms, including dependences upon particular names and the passing of extraneous parameters. This paper proposes the use of implicit context as a means for reducing EEK in systems by combining a mechanism to reflect upon what has happened in a system, through queries on the call history, with a mechanism for altering calls to and from a component. We demonstrate the benefits of implicit context by describing its use to reduce EEK in the Java&trade; Swing library.
The TACO protocol processor simulation environment
Authors: Seppo Virtanen, Johan Lilius
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

Network hardware design is becoming increasingly challenging because more and more demands are put on network bandwidth and throughput requirements, and on the speed with which new devices can be put on the market. Using current standard techniques (general purpose microprocessors, ASIC's) these goals are difficult to reach simultaneously. One solution to this problem that has recently attracted interest is the design of programmable processors with network-optimized hardware, that is, network or protocol processors. In this paper a simulation framework for a family of TTA protocol processor architectures is proposed. The protocol processors consist of a number of buses with functional units that encapsulate protocol specific operations. The TACO protocol processor simulator is a C++ framework based on SystemC. Functional units are created as C++ classes, which makes it easy to experiment with different configurations of the processor to see its performance.
Soft timers: efficient microsecond software timer support for network processing
Authors: Mohit Aron, Peter Druschel
Venue: ACM Transactions on Computer Systems (TOCS) (2000)

This paper proposes and evaluates soft timers, a new operating system facility that allows the efficient scheduling of software events at agranularity down to tens of microseconds. Soft timers can be used to avoid interrupts and reduce context switches associated with network processing, without sacrificing low communication delays. More specifically, soft timers enable transport protocols like TCP to efficiently perform rate-based clocking of packet transmissions. Experiments indicate that soft timers allow a server to employ rate-based clocking with little CPU overhead (2-6%) at high aggregate bandwidths. Soft timers can also be used to perform network polling, which eliminates network interrupts and increases the memory access locality of the network subsystem without sacrificing delay. Experiments show that this technique can improve the throughput of a Web server by up to 25%.
Moment Approach to Nonlinear Time Optimality
Authors: G. M. Sklyar, S. Yu. Ignatovich
Venue: SIAM Journal on Control and Optimization (2000)

The time-optimal control problem to a stationary point for an affine analytic nonlinear system is considered as a certain nonlinear power Markov moment min-problem. Conditions for a solution to be asymptotically close to a solution of a linear time-optimal control problem are obtained in terms of Lie brackets of the vector fields appearing in the system.
POSE: a parallel object-oriented synthesis environment
Authors: Pao-Ann Hsiung
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2001)

Design automation tools and methodologies always encounter a problem of how systems may be designed efficiently, including issues such as static modeling and dynamic manipulation of system parts. With the rapid progress of design technology, the continuously increasing number of different choices per system part and the growing complexity of today's systems, the efficiency of the design environment is not only a major concern now, but will also be a demanding problem in the near future. In contrast to heuristic methods, a novel environment called POSE is proposed that increases efficiency during design without losing optimality in the final design results. System parts are modeled using the popular object-oriented modeling technique and are dynamically manipulated using the parallel design technique. A complete integration of object-oriented and parallel techniques is one of the major feature of POSE. Common problems related to parallel design such as emptiness and deadlock are also elegantly solved within POSE. Experimental results and formal analysis based on POSE all show its practical and theoretical usefulness. POSE can be used at any level of synthesis as long as off-the-shelf building-blocks manipulation is required. POSE can be applied especially to system-level synthesis, whose targets can be parallel computer architectures, systems-on-chip, or embedded systems. We will show how POSE has been applied to ICOS, a recently proposed synthesis methodology. Furthermore, POSE can be easily integrated with other heuristic design methodologies to allow increased design efficiency.
Support for flexbile work settings by augmenting artifacts
Authors: Ernest Holm Svendsen, Astrid Pinholt Søndergaard
Venue: Proceedings of DARE 2000 on Designing augmented reality environments (2000)

Based on experiments, this paper argues that augmentation works well to support complex work settings with heavy demands of flexibility. But augmenting particular artifacts has consequences that reach far beyond the artifact itself and into the practice that surrounds it.
Evolutionary programming techniques for testing students' code
Authors: Cara MacNish
Venue: Proceedings of the Australasian conference on Computing education (2000)

Tools for analysing student code offer great potential for enhancing student learning through informing both students and staff. One such tool, the datlab system, has been successfully employed in second year data structures courses and provides facilities for testing students' laboratory work, providing feedback to students, and assigning marks for completed tasks. While the system has proven successful, there is potential for significant improvement in the way that code is analysed and the quality of the feedback that is returned. This paper reports on new work investigating the use of evolutionary computation as a mechanism for generating appropriate test sequences. Our goal is to synthesize test sequences that efficiently uncover logical errors in student code, provide lecturers with models of common student errors, and provide students with more helpful feedback to use in locating errors themselves. We present encouraging preliminary results showing that significant improvements can be achieved using the evolutionary approach, and discuss some of the challenges in extending this approach.
High performance question/answering
Authors: Marius A. Pasca, Sandra M. Harabagiu
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

In this paper we present the features of a Question/Answering (Q/A) system that had unparalleled performance in the TREC-9 evaluations. We explain the accuracy of our system through the unique characteristics of its architecture: (1) usage of a wide-coverage answer type taxonomy; (2) repeated passage retrieval; (3) lexico-semantic feedback loops; (4) extraction of the answers based on machine learning techniques; and (5) answer caching. Experimental results show the effects of each feature on the overall performance of the Q/A system and lead to general conclusions about Q/A from large text collections.
Identify Regions of Interest(ROI) for video watermark embedment with principle component analysis
Authors: Roy Wang, Qiang Cheng, Thomas Huang
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

The temporal redundancy of video provides a greater space than images for information hiding at the expense of invitation towards many forms of spatial and temporal attacks, such as frame dropping, frame averaging that are not common in images. With video, the active change of watermark placement location serves as an effective counterattack measure. In this paper, we utilize principal components of joint feature observation of video frames to robustly determine the location of watermark embedment. The approach eliminates the need of storing original sequence and is robust against common attacks.
Bayesian Sampling and Ensemble Learning in Generative Topographic Mapping
Authors: Akio Utsugi
Venue: Neural Processing Letters (2000)

Generative topographic mapping (GTM) is a statistical model to extract a hidden smooth manifold from data, like the self-organizing map (SOM). Although a deterministic search algorithm for the hyperparameters regulating the smoothness of the manifold has been proposed previously, it is based on approximations that are valid only on abundant data. Thus, it often fails to obtain suitable estimates on small data. In this paper, to improve the hyperparameter search in GTM, we construct a Gibbs sampler on the model, which generates random sample series following the posteriors on the hyperparameters. Reliable estimates are obtained from the samples. In addition, we obtain another deterministic algorithm using the ensemble learning. From the result of an experimental comparison of these algorithms, an efficient method for reliable estimation in GTM is suggested.