ppxscal/embedding_network huggingface dataset:
USA participation in an international standard glossary on information processing
Authors: J. F. Traub
Venue: Communications of the ACM (1963)

A considerable number of glossaries in the area of information processing have been produced in the USA in the last ten years [1, 2]. In some cases the glossaries were reworked versions of earlier glossaries, while in other cases major new contributions were made. All told, the glossary effort has cost thousands of man-hours of work. Several years ago the ASA X3 sectional committee sponsored by BEMA was established to prepare standards for the USA in the information processing field. (See Appendix 1 for the meaning of abbreviations and acronyms. See also [3].) ASA X3.5 was assigned the double scope of advising the other X3.n subcommittees on the establishment of definitions required for their proposed standards and of establishing a standard glossary, pASGIP, for general use. At the same time there was important British standardization activity. After reworking a number of earlier drafts, the BSI released the &ldquo;Glossary of Terms Used in Automatic Data Processing,&rdquo; British Standard 3527: 1962. The British effort differed in at least one very important respect from the USA glossaries. It was organized along subject rather than alphabetical lines. This was to have important consequences, as we shall see.
A computer analysis method for thermal diffusion in biochemical systems
Authors: Norman Davids, Robert L. Berger
Venue: Communications of the ACM (1964)

In the thermal detection of rapid biochemical reactions it is necessary to correct the temperature data for transient heat conduction losses in a cylindrical calorimeter. To handle the complexities arising from varying thermal-relaxation times of concentric insulating layers, a computer program was developed which gives the temperature distribution of the system as a function of radius and time. This distribution is corrected at each step by a subroutine which calculates the instantaneous chemical state of the reaction, as well as the heat produced by this reaction. The program is based on a direct statement of Fourier's law of heat conduction and the chemical rate equation to provide a &ldquo;bookkeeping law&rdquo; to follow the reactants and the flow of heat packets, in such a way that the computer continually stores the heat distribution. A computer analysis method is here regarded as one in which the physical laws of a process are used explicitly in the program. Usually this results in bypassing much of the mathematical procedures conventionally used.
Conversion of a power to a series of Chebyshev polynomials
Authors: Henry C. Thacher,  Jr.
Venue: Communications of the ACM (1964)

Even slowly convergent power series can be rearranged as series in Chebyshev polynomials if appropriate sequence transformations are used in evaluating the coefficients. The method is illustrated by computing the coefficients for the expansion of the logarithm and dilogarithm.
Performance Evaluation and Monitoring
Authors: Henry Lucas,  Jr.
Venue: ACM Computing Surveys (CSUR) (1971)

Three major purposes for evaluating the hardware and software performance of computer systems--selection evaluation, performance projection, and performance monitoring--are described. Eight techniques that have been used or suggested for evaluating performance are discussed. Each of these techniques is rated on its suitability for the three purposes of evaluation. Recommendations are made on the most appropriate technique for each evaluation purpose. These suggestions include the development of a comprehensive set of synthetic programs on an industry-wide basis for selection evaluation purposes. Simulation is recommended as the most suitable technique for performance projection. Finally, a number of hardware and software monitors are available for performance monitoring.
Facile: a language and compiler for high-performance processor simulators
Authors: Eric C. Schnarr, Mark D. Hill, James R. Larus
Venue: ACM SIGPLAN Notices (2001)

Architectural simulators are essential tools for computer architecture and systems research and development. Simulators, however, are becoming frustratingly slow, because they must now model increasingly complex micro-architectures running realistic workloads. Previously, we developed a technique called fast-forwarding, which applied partial evaluation and mermoization to improve the performance of detailed architectural simulations by as much as an order of magnitude [14]. While writing a detailed processor simulator is difficult, implementing fast-forwarding is even more complex. This paper describes Facile, a domain-specific language for writing detailed, accurate micro-architecture simulators. Architectural descriptions written in Facile can be compiled, using partial evaluation techniques, into fast-forwarding simulators that achieve significant performance improvements with far less programmer effort. Facile and its compiler make this performance-enhancing technique accessible to computer architects.
Notable abbreviations in telecommunications
Authors: Hans W. Barz
Venue: ACM SIGCOMM Computer Communication Review (1989)

Two years ago I already published the first version of abbreviations - see [1]. Compared to the first edition the number of abbreviations has doubled.
Social role awareness in animated agents
Authors: Helmut Prendinger, Mitsuru Ishizuka
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

This paper promotes {\itshape social role awareness\/} as a desirable capability of animated agents, that are by now strong affective reasoners, but otherwise often lack the social competence observed with humans. In particular, humans may easily adjust their behavior depending on their respective role in a socio-organizational setting, whereas their synthetic pendants tend to be driven mostly by attitudes, emotions, and personality. Our main contribution is the incorporation of `social filter programs' to mental models of animated agents. Those programs may qualify an agent's expression of its emotional state by the social context, thereby enhancing the agent's believability as a conversational partner or virtual teammate. Our implemented system is entirely web-based and demonstrates socially aware animated agents in an environment similar to Hayes-Roth's Cybercaf\'{e}.
Minimizing the impact of orphan requests in e-commerce services
Authors: E. Kraemer, G. Paixão, D. Guedes, W. Meira,  Jr., V. Almeida
Venue: ACM SIGMETRICS Performance Evaluation Review (2000)

The most common problem of an overloaded electronic-commerce server is an increase in the response time perceived by customers, who may restart their requests hoping to get a faster response, or simply abort them, giving up on the store. Both behaviors generate "orphan" requests: although they were received by the server, they should not be answered because their requestors have already abandoned them. Orphan requests waste system resources, since the server becomes aware of their cancellation only when it tries to send a response and finds out that the connection was closed. In this paper we propose a new kernel service, the Connection Sentry, which keeps track of requests being performed and notify processes about an eventual cancellation. Once notified, a process can interrupt the execution of the request, saving system resources and bandwidth. We evaluated the gains by using our proposal in a virtual bookstore, where we observed that the Connection Sentry reduced service latency by up to 31% and increased the throughput by 27% in overloaded servers.
The dot.com generation: IT practices skills of transition students (2000)
Authors: Andrew Stein, Annemieke Craig
Venue: Proceedings of the Australasian conference on Computing education (2000)

The Dot.Com or generation Y student was born after 1981 and will be entering university as a transition student from 2000. The Dot.Com transition student has received an intensive education in information technology. The Dot.Com student comes to university with a need to be information competent and can demonstrate considerable information technology skills. This paper analyses the information literacy and knowledge of the Dot.Com transition student at Victoria University. Two definitions were used to categorise IT usage of students; General IT practices looked at the availability of IT to students and specific IT skills refer to the use of business IT packages. The main findings show that home access to a computer has peaked, home internet usage is escalating, the gender gap in IT practices is closing but a gender and Dot.Com gap in IT skills still exist.
Using a Neural Network to Approximate an Ensemble of Classifiers
Authors: X. Zeng, T. R. Martinez
Venue: Neural Processing Letters (2000)

Several methods (e.g., Bagging, Boosting) of constructing and combining an ensemble of classifiers have recently been shown capable of improving accuracy of a class of commonly used classifiers (e.g., decision trees, neural networks). The accuracy gain achieved, however, is at the expense of a higher requirement for storage and computation. This storage and computation overhead can decrease the utility of these methods when applied to real-world situations. In this Letter, we propose a learning approach which allows a single neural network to approximate a given ensemble of classifiers. Experiments on a large number of real-world data sets show that this approach can substantially save storage and computation while still maintaining accuracy similar to that of the entire ensemble.
A Flexible New Technique for Camera Calibration
Authors: Zhengyou Zhang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

We propose a flexible new technique to easily calibrate a camera. It only requires the camera to observe a planar pattern shown at a few (at least two) different orientations. Either the camera or the planar pattern can be freely moved. The motion need not be known. Radial lens distortion is modeled. The proposed procedure consists of a closed-form solution, followed by a nonlinear refinement based on the maximum likelihood criterion. Both computer simulation and real data have been used to test the proposed technique and very good results have been obtained. Compared with classical techniques which use expensive equipment such as two or three orthogonal planes, the proposed technique is easy to use and flexible. It advances 3D computer vision one more step from laboratory environments to real world use. The corresponding software is available from the author's Web page.
The use of grammatical inference for designing programming languages
Authors: S. Crespi-Reghizzi, M. A. Melkanoff, L. Lichten
Venue: Communications of the ACM (1973)

Both in designing a new programming language and in extending an existing language, the designer is faced with the problem of deriving a &ldquo;natural&rdquo; grammar for the language. We are proposing an interactive approach to the grammar design problem wherein the designer presents a sample of sentences and structures as input to a grammatical inference algorithm. The algorithm then constructs a grammar which is a reasonable generalization of the examples submitted by the designer. The implemention is presently restricted to a subclass of operator precedence grammars, but a second algorithm is outlined which applies to a larger class of context-free grammars.
The IceCube approach to the reconciliation of divergent replicas
Authors: Anne-Marie Kermarrec, Antony Rowstron, Marc Shapiro, Peter Druschel
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

We describe a novel approach to log-based reconciliation called IceCube. It is general and is parameterised by application and object semantics. IceCube considers more flexible orderings and is designed to ease the burden of reconciliation on the application programmers. IceCube captures the static and dynamic reconciliation constraints between all pairs of actions, proposes schedules that satisfy the static constraints, and validates them against the dynamic constraints. Preliminary experience indicates that strong static constraints successfully contain the potential combinatorial explosion of the simulation stage. With weaker static constraints, the system still finds good solutions in a reasonable time.
Automatic web search query generation to create minority language corpora
Authors: Rayid Ghani, Rosie Jones, Dunja Mladenic
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

The Web is a valuable source of language specific resources but collecting, organizing and utilizing this information is difficult. We describe CorpusBuilder, an approach for automatically generating Web-search queries to collect documents in a minority language. It differs from pseudo-relevance feedback in that retrieved documents are labeled by an automatic language classifier as relevant or irrelevant and a subset of documents is used to generate new queries. We experiment with various query-generation methods and query-lengths to find inclusion/exclusion terms that are helpful for finding documents in the target language and find that using odds-ratio scores calculated over the documents acquired so far was one of the most consistently accurate query-generation methods. We also describe experiments using a handful of words elicited from a user instead of initial documents and show that the methods perform similarly. Applying the same approach to multiple languages show that our system generalizes to a variety of languages.
An RTL design-space exploration method for high-level applications
Authors: Peng-Cheng Kao, Chih-Kuang Hsieh, Allen C.-H. Wu
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

In this paper, we present an RTL design-space exploration method for high-level applications. We formulate the RTL design-space exploration into a performance-driven module selection problem. We devise a dynamic-programming algorithm to solve the problem. We present an exploration flow by integrating commercial synthesis and layout tools with our proposed method. Experimental results have demonstrated that generating AT-curve for all modules is the most time consuming task in the design-space exploration process. Using the proposed 3-point AT projection approach, our method can achieve on an average of 80% speed-up in run time and 90% accuracy in design estimation.
Our little orchestra: the development of an interactive toy
Authors: Carolina Browall, Kristina Lindquist
Venue: Proceedings of DARE 2000 on Designing augmented reality environments (2000)

This paper describes the process and the results of a project to develop an interactive educating toy for children. The purpose was to work together with the users and to take advantage of the different disciplines represented in each project group. We were interested in questions such as: How do children play and interact? How do children co-operate and what do they want to play with? To encourage children to cooperate was one of our thoughts, another was to let them help us in the process of developing the toy. Through observations and interviews with the children and studies of scientific literature and studies of what kind of instruments, mixers and music-toys already was out on the market we decided to develop &ldquo;something-that-makes-music&rdquo;, and the result was a sound-mixer, Our Little Orchestra, looking like a birthday cake.
HMIPv6: A hierarchical mobile IPv6 proposal
Authors: Claude Castelluccia
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2000)

The IETF Mobile IPv6 protocol has been developped to manage global (macro) mobility. It is not adapted to local (micro) mobility since it does not support any kind of hierarchy. This paper presents a hierarchical protocol, built on top of Mobile IPv6, that separates local mobility (within a site) from global mobility (across sites) management. Local handoffs are managed locally and transparently to a mobile node' correspondent hosts while global mobility is managed with Mobile IPv6. Our scheme is flexible (several levels of hierarchy can be used), scalable, interworks with Mobile IPv6 and can be deployed gradually.
Lazy lists in C++
Authors: Sibylle Schupp
Venue: ACM SIGPLAN Notices (2000)

Languages that support lazy evaluation allow computations with "infinite" data structures (lazy lists); C++ is not among these languages. Using an idiom of generic programming in C++, template metaprogramming, this paper shows how to provide lazy lists nevertheless.
A comment on optimal tree structures
Authors: Larry E. Stanfel
Venue: Communications of the ACM (1969)

In Y.N. Patt's paper &ldquo;Variable Length Tree Structures Having Minimum Average Search Time&rdquo; [Comm. ACM 12 (Feb. 1969)], the tree structures obtained are not actually optimal with respect to the two-dimensional chaining devised by Sussenguth in his 1963 paper. This note points out that the result can be described as &ldquo;optimal&rdquo; only under the constraint&mdash;which Patt implicity assumes&mdash;that no key be allowed to prefix another.
DejaVu: deterministic Java replay debugger for Jalape&ntilde;o Java virtual machine
Authors: Bowen Alpern, Ton Ngo, Jong-Deok Choi, Manu Sridharan
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

The execution behavior of a Java application can be non-deterministic due to multithreading. This non-determinism makes understanding and debugging multithreaded Java applications a difficult and laborious process. DejaVu (Deterministic Java Replay Utility) helps the user in understanding and debugging non-deterministic Java applications by deterministically replaying the execution behavior of a non-deterministic execution. In this demo, we will present a debugger for the Jalape&ntilde;o Java Virtual Machine that utilizes the replay capability provided by DejaVu. The debugger helps in isolating non-deterministic failure(s) by faithfully reproducing the same execution behavior that led to the observe failure(s). Jalapeno is a JVM being developed at IBM T. J. Watson Research Center. The debugger provides the following features: (1) DejaVu deterministically replays Java programs; (2) Remote Reflection supports general debugging functionalities such as setting breakpoints, examining the program state, and detecting deadlocks; and (3) a GUI provides an intuitive and easy to use interface.
A hybrid technique for accelerated simulation of ATM networks and network elements
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2001)

Conventional simulation of cell- or packet-switched networks involves the use of discrete event simulators that model each individual cell through the network, typically called cell-level simulation. Each cells arrival at, or departure from, a network element is represented by an event. However, statistical considerations are such that very large numbers of cells have to be simulated to guarantee the accuracy of the results. This has always caused very long simulation times, often amounting to many hours of real time just to simulate a few minutes of simulated time. In this article we describe a novel methodology for accelerating simulation studies in cell-based communication networks, e.g., ATM, by using a hybrid analytical/simulation combination. The methodology uses a mathematical technique to seperate foreground traffic from background traffic, and focuses on accelerating cell by cell simulation.
Quantization Index Modulation Methods for Digital Watermarking and Information Embedding of Multimedia
Authors: Brian Chen, Gregory W. Wornell
Venue: Journal of VLSI Signal Processing Systems (2001)

Copyright notification and enforcement, authentication, covert communication, and hybrid transmission applications such as digital audio broadcasting are examples of emerging multimedia applications for digital watermarking and information embedding methods, methods for embedding one signal (e.g., the digital watermark) within another &ldquo;host&rdquo; signal to form a third, &ldquo;composite&rdquo; signal. The embedding is designed to achieve efficient trade-offs among the three conflicting goals of maximizing information-embedding rate, minimizing distortion between the host signal and composite signal, and maximizing the robustness of the embedding.We present a class of embedding methods called quantization index modulation (QIM) that achieve provably good rate-distortion-robustness performance. These methods, and low-complexity realizations of them called dither modulation, are provably better than both previously proposed linear methods of spread spectrum and nonlinear methods of low-bit(s) modulation against square-error distortion-constrained intentional attacks. We also derive information-embedding capacities for the case of a colored Gaussian host signal and additive colored Gaussian noise attacks. These results imply an information embedding capacity of about 1/3 b/s of embedded digital rate for every Hertz of host signal bandwidth and every dB drop in received host signal quality.We show that QIM methods achieve performance within 1.6 dB of capacity, and we introduce a form of postprocessing we refer to as distortion compensation that, when combined with QIM, allows capacity to be achieved. In addition, we show that distortion-compensated QIM is an optimal embedding strategy against some important classes of intentional attacks as well. Finally, we report simulation results that demonstrate the performance of dither modulation realizations that can be implemented with only a few adders and scalar quantizers.
Corrigendum: Algorithm 806: SPRNG: a scalable library for pseudorandom number generation
Authors: Michael Mascagni, Ashok Srinivasan
Venue: ACM Transactions on Mathematical Software (TOMS) (2000)

In this article we present background, rationale, and a description of the Scalable Parallel Random Number Generators (SPRNG) library. We begin by presenting some methods for parallel pseudorandom number generation. We will focus on methods based on parameterization, meaning that we will not consider splitting methods such as the leap-frog or blocking methods. We describe, in detail, parameterized versions of the following pseudorandom number generators: (1) linear congruential generators, (ii) shift-register generators, and (iii) lagged-Fibonacci generators. We briefly describe the methods, detail some advantages and disadvantages of each method, and recount results from number theory that impact our understanding of their quality of parallel applications. SPRNG was designed around the uniform implementation of different families of parameterized random number generators. We then present a short description of SPRNG. The description contained within this document is meant only to outline the rationale behind and the capabilities of SPRNG. Much more information, including examples and detailed documentation aimed at helping users with putting and using SPRNG on scalable systems is available at http://sprng.cs.fsu.edu. In this description of SPRNG we discuss the random-number generator library as well as the suite of tests of randomness that is an integral part of SPRNG. Random-number tools for parallel Monte Carlo applications must be subjected to classical as well as new types of empirical tests of randomness to eliminate generators that show defects when used in scalable environments.
Algorithm 804: subroutines for the computation of Mathieu functions of integer orders
Authors: Fayez A. Alhargan
Venue: ACM Transactions on Mathematical Software (TOMS) (2000)

Computer subroutines in C++ for computing Mathieu functions of integer orders are described. The routines can handle a large range of the order n and the parameter h. Sample test results and graphs are given.