ppxscal/embedding_network huggingface dataset:
HCI in the global knowledge-based economy: designing to support worker adaptation
Authors: Kim J. Vicente
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2000)

Increasingly, people are being required to perform open-ended intellectual tasks that require discretionary decision making. These demands require a relatively unique approach to the design of computer-based support tools. A review of the characteristics associated with the global knowledge-based economy strongly suggests that there will be an increasing need for workers, managers, and organizations to adapt to change and novelty. This is equivalent to a call for designing computer tools that foster continuous learning. There are reasons to believe that the need to support adaptation and continuous learning will only increase. Thus, in the new millennium HCI should be concerned with explicitly designing for worker adaptation. The cognitive work analysis framework is briefly described as a potential programmatic approach to this practical design challenge.
A program testing assistant
Authors: David Chapman
Venue: Communications of the ACM (1982)

This paper describes the design and implementation of a program testing assistant which aids a programmer in the definition, execution, and modification of test cases during incremental program development. The testing assistant helps in the interactive definition of test cases and executes them automatically when appropriate. It modifies test cases to preserve their usefulness when the program they test undergoes certain types of design changes. The testing assistant acts as a fully integrated part of the programming environment and cooperates with existing programming tools such as a display editor, compiler, interpreter, and debugger.
A geometric algorithm for selecting optimal set of cutters for multi-part milling
Authors: Zhiyang Yao, Satyandra K. Gupta, Dana S. Nau
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

For the manufacture of milled parts, it is well known that the size of the cutter significantly affects the machining time. However, for small-batch manufacturing, the time spent on loading tools into the tool magazine and establishing z-length compensation values is just as important. If we can select a set of milling tools that will produce good machining time on more than one type of parts, then several unnecessary machine-tool reconfiguration operations can be eliminated. This paper describes a geometric algorithm for finding an optimal set of cutters for machining a set of 2&frac12;D parts. In selecting milling cutters we consider both the tool loading time and the machining time and generate solutions that allow us to minimize the total machining time. Our problem formulation addresses the general problem of how to cover a target region to be milled with a cylindrical cutter without intersecting with the obstruction region; this definition allows us to handle both open and closed edges in the target region. Our algorithm improves upon previous work in the tool selection area in following ways: (1) in selecting cutters, it accounts for the tool loading time, and (2) it can simultaneously consider multiple different parts and select the optimal set of cutters to minimize the total manufacturing time.
An on-chip 96.5% current efficiency CMOS linear regulator
Authors: Kazuhisa Sunaga, Tetsuo Endoh, Hiroshi Sakuraba, Fujio Masuoka
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

A proposed linear regulator uses a Flexible Control technique of Output Current (FCOC) to achieve 96.5% efficiency. The FCOC technique realizes to drive a flexible output current according to the output current variation and stable output voltage supply. The linear regulator fabricated by 1.2um CMOS process occupies 0.423mm 2. The fabricated linear regulator achieves 96.5% current efficiency and less than 6.81mVpp output voltage fluctuation at an output current frequency from 1.8Hz to 100 MHz.
The development of a simple, low cost set of universal access features for electronic devices
Authors: Chris Law, Gregg Vanderheiden
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

A simple set of universal access features has been developed, which can be applied to almost any public or personal electronic device, providing access for people with a wide variety of sensory and physical disabilities, and a wide variety of functional limitations imposed by circumstance. Implementing the features require adding one to three buttons to the device (or using existing buttons on a device if appropriate), adding speech output and enhancing the programming of the device to utilize the techniques. In our experience, thus far, adding these features can be done for approximately 1% or less of the retail value of the device. This paper introduces the access features (collectively called EZ Access&trade;, pronounced &ldquo;easy access&rdquo;), and discusses some of the key underlying principles which make the features easy to learn and use. Other issues concerning industrial transfer or the techniques are also discussed.
Correspondence-based data structures for double-ended priority queues
Venue: Journal of Experimental Algorithmics (JEA) (2000)

We describe three general methods--total, dual, and leaf correspondence--that may be used to derive efficient double-ended priority queues from single-ended priority queues. These methods are illustrated by developing double-ended priority queues based on the classical heap. Experimental results indicate that the leaf-correspondence method generally leads to a faster double-ended priority queue than either total or dual correspondence. On randomly generated test sets, however, the splay tree outperforms the tested correspondence-based double-ended priority queues.
Export control of high-performance computing: analysis and alternatives
Authors: Delores M. Etter, Charles J. Holland, John Grosh
Venue: Computing in Science and Engineering (2001)

The authors present their 2 February 2001 Department of Defense report, with minor edits, analyzing US government export control strategies for high-performance computing. Due to advances in clustering technology, export controls on high-performance computer systems are found to be no longer effective. The authors recommend a shift away from hardware controls to protections on critical Defense applications software.
Vertical information technology in the Galua's base—new direction in development of computer machines (abstract only)
Authors: Yaroslav Nykolajchuk, Roman Korol
Venue: Proceedings of the symposium on Contemporary computing in Ukraine (2000)

In the indicated article the stated theoretical basis and structural solutions of the Galua's base for construction of elements of peripheral knots operational and microprocessor computer machines. The offered methodology of realization of vertical information technology in the Galua's base in problems of programming with a deep level of paralle's data processing in multiprocessor systems with the associative memory.
Our curriculum has become math-phobic!
Authors: Allen B. Tucker, Charles F. Kelemen, Kim B. Bruce
Venue: ACM SIGCSE Bulletin (2001)

The paper [2] argued that mathematical ideas play an important role in the computer science curriculum, and that Discrete Mathematics needs to be taught early in the computer science curriculum. In this follow-up paper, we present evidence that computer science curricula are drifting away from a fundamental commitment to theoretical and mathematical ideas. We propose some actions that can be taken to help reverse this drift.
Computing the internet checksum
Authors: R. Braden, D. Borman, C. Partridge
Venue: ACM SIGCOMM Computer Communication Review (1989)

This memo discusses methods for efficiently computing the Internet checksum that is used by the standard Internet protocols IP, UDP, and TCP.An efficient checksum implementation is critical to good performance. As advances in implementation techniques streamline the rest of the protocol processing, the checksum computation becomes one of the limiting factors on TCP performance, for example. It is usually approapriate to carefully hand-craft the checksum routine, exploiting every machine-dependent trick possible; a fraction of a microsecond per TCP data byte can add up to significant CPU time savings overall.
Application isolation in the Java Virtual Machine
Authors: Grzegorz Czajkowski
Venue: Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (2000)

To date, systems offering multitasking for the Java trade; programming language either use one process or one class loader for each application. Both approaches are unsatisfactory. Using operating system processes is expensive, scales poorly and does not fully exploit the protection features inherent in a safe language. Class loaders replicate application code, obscure the type system, and non-uniformly treat 'trusted' and 'untrusted' classes, which leads to subtle, but nevertheless, potentially harmful forms of undesirable inter-application interaction.In this paper we propose a novel, simple yet powerful solution. The new model improves on existing designs in terms of resource utilization while offering strong isolation among applications. The approach is applicable both on high-end servers and on small devices. The main idea is to maintain only one copy of every class, regardless of how many applications use it. Classes are transparently and automatically modified, so that each application has a separate copy of its static fields. Two prototypes are described and selected performance data is analyzed. Various aspects of the proposed architectural changes to the Java Virtual Machine are discussed.
Embedded UML: a merger of real-time UML and co-design
Authors: Grant Martin, Luciano Lavagno, Jean Louis-Guerin
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

In this paper, we present a proposal for a UML profile called `Embedded UML'. Embedded UML represents a synthesis of various ideas in the real-time UML community, and concepts drawn from the Hardware-Software co-design field. Embedded UML first selects from among the competing real-time UML proposals, the set of ideas which best allow specification and analysis of mixed HW-SW systems. It then adds the necessary concept of underlying deployment architecture that UML currently lacks in complete form, using the notion of an embedded HW-SW `platform'. It supplements this with the concept of a `mapping', which is a platform-dependent refinement mechanism that allows efficient generation of an optimised implementation of the executable specification in both HW and SW. Finally, it provides an approach which supports the development of automated analysis, simulation, synthesis and code generation tool capabilities which can be provided for design usage even while the embedded UML standardisation process takes place.
Compact Encodings of List Structure
Authors: Daniel G. Bobrow, Douglas W. Clark
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1979)

List structures provide a general mechanism for representing easily changed structured data, but can introduce inefficiencies in the use of space when fields of uniform size are used to contain pointers to data and to link the structure. Empirically determined regularity can be exploited to provide more space-efficient encodings without losing the flexibility inherent in list structures. The basic scheme is to provide compact pointer fields big enough to accommodate most values that occur in them and to provide &ldquo;escape&rdquo; mechanisms for exceptional cases. Several examples of encoding designs are presented and evaluated, including two designs currently used in Lisp machines. Alternative escape mechanisms are described, and various questions of cost and implementation are discussed. In order to extrapolate our results to larger systems than those measured, we propose a model for the generation of list pointers and we test the model against data from two programs. We show that according to our model, list structures with compact cdr fields will, as address space grows, continue to be compacted well with a fixed-width small field. Our conclusion is that with a microcodable processor, about a factor of two gain in space efficiency for list structure can be had for little or no cost in processing time.
Toward Improved Ranking Metrics
Authors: Nicu Sebe, Michael S. Lew, Dionysius P. Huijsmans
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

In many computer vision algorithms, a metric or similarity measure is used to determine the distance between two features. The Euclidean or SSD (sum of the squared differences) metric is prevalent and justified from a maximum likelihood perspective when the additive noise distribution is Gaussian. Based on real noise distributions measured from international test sets, we have found that the Gaussian noise distribution assumption is often invalid. This implies that other metrics, which have distributions closer to the real noise distribution, should be used. In this paper, we consider three different applications: content-based retrieval in image databases, stereo matching, and motion tracking. In each of them, we experiment with different modeling functions for the noise distribution and compute the accuracy of the methods using the corresponding distance measures. In our experiments, we compared the SSD metric, the SAD (sum of the absolute differences) metric, the Cauchy metric, and the Kullback relative information. For several algorithms from the research literature which used the SSD or SAD, we showed that greater accuracy could be obtained by using the Cauchy metric instead.
Responding to subtle, fleeting changes in the user's internal state
Authors: Wataru Tsukahara, Nigel Ward
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

In human-to-human interaction, people sometimes are able to pick up and respond sensitively to the other's internal state as it shifts moment by moment over the course of an exchange. To find out whether such an ability is worthwhile for computer human interfaces, we built a semi-automated tutoring-type spoken dialog system. The system inferred information about the user's \scare{ephemeral emotions}, such as confidence, confusion, pleasure, and dependency, from the prosody of his utterances and the context. It used this information to select the most appropriate acknowledgement form at each moment. In doing so the system was following some of the basic social conventions for real-time interaction. Users rated the system with this ability more highly than a version without.
Computer programming as an art
Authors: Donald E. Knuth
Venue: Communications of the ACM (1974)

When Communications of the ACM began publication in 1959, the members of ACM's Editorial Board made the following remark as they described the purposes of ACM's periodicals [2]: &ldquo;If computer programming is to become an important part of computer research and development, a transition of programming from an art to a disciplined science must be effected.&rdquo; Such a goal has been a continually recurring theme during the ensuing years; for example, we read in 1970 of the &ldquo;first steps toward transforming the art of programming into a science&rdquo; [26]. Meanwhile we have actually succeeded in making our discipline a science, and in a remarkably simple way: merely by deciding to call it &ldquo;computer science.&rdquo;
Software: recommendations for an export control policy
Authors: Charles L. Gold, Seymour E. Goodman, Benjamin G. Walker
Venue: Communications of the ACM (1980)

The control of computer technology exports, for both hardware and software, is being actively debated in government and industry circles. At the request of the U.S. Department of Defense, the Computer Network Critical Technology Expert Group (CNCTEG) was established with the support of the Electronics Industries Association and the Computer Business Equipment Manufacturers Association. The task of the CNCTEG was to assess critical technologies associated with computer networks, and to make recommendations regarding the control of the export of such technologies. The formulation of a reasonable export control policy for software has remained a particularly difficult matter that has frustrated both the U.S. government and industry. This article presents the CNCTEG's initial recommendations for the export control of software. This material is presented in the belief that open, active discussion among members of the information processing community will be helpful in advancing the development of a sound national policy regarding the export of software products and know-how.
A large semaphore based operating system
Authors: Søren Lauesen
Venue: Communications of the ACM (1975)

The paper describes the internal structure of a large operating system as a set of cooperating sequential processes. The processes synchronize by means of semaphores and extended semaphores (queue semaphores). The number of parallel processes is carefully justified, and the various semaphore constructions are explained. The system is proved to be free of &ldquo;deadly embrace&rdquo; (deadlock). The design principle is an alternative to Dijkstra's hierarchical structuring of operating systems. The project management and the performance are discussed, too. The operating system is the first large one using the RC 4000 multiprogramming system.
Certification of algorithm 386 [A1]
Authors: Larry C. Ragland, Donald I. Good
Venue: Communications of the ACM (1973)

Subroutine GCDN, Algorithm 386 as described in [1, 2], computes the greatest common divisor, IGCD, of n integers A(1), &hellip; , A(n) by using the Euclidean algorithm to compute first gcd(A(1), A(2)), then gcd(gcd(A(1), A(2)), A(3)), etc. It also computes integer multipliers Z(1), &hellip; , Z(n) such that IGCD = &sum;ni=1 A(i)Z(i).
Efficient Rule-Based Attribute-Oriented Induction for Data Mining
Authors: David W. Cheung, H. Y. Hwang, Ada W. Fu, Jiawei Han
Venue: Journal of Intelligent Information Systems (2000)

Data mining has become an important technique which has tremendous potential in many commercial and industrial applications. Attribute-oriented induction is a powerful mining technique and has been successfully implemented in the data mining system DBMiner (Han et al. Proc. 1996 Int'l Conf. on Data Mining and Knowledge Discovery (KDD'96), Portland, Oregon, 1996). However, its induction capability is limited by the unconditional concept generalization. In this paper, we extend the concept generalization to rule-based concept hierarchy, which enhances greatly its induction power. When previously proposed induction algorithm is applied to the more general rule-based case, a problem of induction anomaly occurs which impacts its efficiency. We have developed an efficient algorithm to facilitate induction on the rule-based case which can avoid the anomaly. Performance studies have shown that the algorithm is superior than a previously proposed algorithm based on backtracking.
Crawler-Friendly Web Servers
Authors: Onn Brandman, Junghoo Cho, Hector Garcia-Molina, Narayanan Shivakumar
Venue: ACM SIGMETRICS Performance Evaluation Review (2000)

In this paper we study how to make web servers (e.g., Apache) more crawler friendly. Current web servers offer the same interface to crawlers and regular web surfers, even though crawlers and surfers have very different performance requirements. We evaluate simple and easy-to-incorporate modifications to web servers so that there are significant bandwidth savings. Specifically, we propose that web servers export meta-data archives decribing their content.
RTP: a transport layer implementation project
Authors: Brad Richards
Venue: Proceedings of the sixth annual CCSC northeastern conference on The journal of computing in small colleges (2001)

This paper describes a project for use in computer networks courses, implementation of the Reliable Transport Protocol (RTP), that gives students hands-on experience with network protocol concepts and construction. Lecture topics such as the protocol layering model, sliding window protocols, packet formats and headers, techniques for establishing and closing connections, and UDP sockets programming are all driven home via first-hand experience. Students gain general programming and debugging experience on a realistic, event-driven, asynchronous application as well, and necessarily exercise their knowledge of algorithms and data structures.
A performance optmization method by gate sizing using statistical static timing analysis
Authors: M. Hashimoto, H. Onodera
Venue: Proceedings of the 2000 international conference on Computer-aided design (2001)

We propose a gate resizing method for delay and power optimization that is based on statistical static timing analysis. Our method focuses on the component of timing uncertainties due to local random fluctuation. Utilizing our method, over-design of a circuit can be eliminated and high-performance and high-reliability LSI design can be realized. The effectiveness of our method can reduce relay and power dissipation from the circuits optimized without the consideration of fluctuation.
Minimizing Data and Synchronization Costs in One-Way Communication
Authors: Mahmut Kandemir, Alok Choudhary, Prithviraj Banerjee, J. Ramanujam, Nagaraj Shenoy
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

Minimizing communication and synchronization costs is crucial to the realization of the performance potential of parallel computers. This paper presents a general technique which uses a global data-flow framework to optimize communication and synchronization in the context of the one-way communication model. In contrast to the conventional send/receive message-passing communication model, one-way communication is a new paradigm that decouples message transmission and synchronization. In parallel machines with appropriate low-level support, this may open up new opportunities not only to further optimize communication, but also to reduce the synchronization overhead. We present optimization techniques using our framework for eliminating redundant data communication and synchronization operations. Our approach works with the most general data alignments and distributions in languages like High Performance Fortran (HPF) and uses a combination of the traditional data-flow analysis and polyhedral algebra. Empirical results for several scientific benchmarks on a Cray T3E multiprocessor machine demonstrate that our approach is successful in reducing the number of data (communication) and synchronization messages, thereby reducing the overall execution times.
An optimal real-time algorithm for planar convex hulls
Authors: F. P. Preparata
Venue: Communications of the ACM (1979)

An algorithm is described for the construction in real-time of the convex hull of a set of n points in the plane. Using an appropriate data structure, the algorithm constructs the convex hull by successive updates, each taking time O(log n), thereby achieving a total processing time O(n log n).
The role of computational chemistry in translating genomic information into bioactive small molecules (abstract only)
Authors: Yvonne Martin
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

Although genomic information provides many potential targets for drug discovery, the challenge is to convert this information into drugs that cure human disease. Workers in computer assisted molecular design and chemometrics have developed a number of techniques to aid this process. Examples include selecting diverse compounds for high throughput screening, designing universal or targeted combinatorial libraries, and using a variety of computational techniques to forecast binding affinitiy and bioavailability of compounds. This lecture will summarize recent advances in these areas.