ppxscal/embedding_network huggingface dataset:
Optimal Reward-Based Scheduling for Periodic Real-Time Tasks
Authors: Hakan Aydin, Rami Melhem, Daniel Mosseé, Pedro Mejía-Alvarez
Venue: IEEE Transactions on Computers (2001)

Reward-based scheduling refers to the problem in which there is a reward associated with the execution of a task. In our framework, each real-time task comprises a mandatory and an optional part. The mandatory part must complete before the task's deadline, while a nondecreasing reward function is associated with the execution of the optional part, which can be interrupted at any time. Imprecise computation and Increased-Reward-with-Increased-Service models fall within the scope of this framework. In this paper, we address the reward-based scheduling problem for periodic tasks. An optimal schedule is one where mandatory parts complete in a timely manner and the weighted average reward is maximized. For linear and concave reward functions, which are most common, we 1) show the existence of an optimal schedule where the optional service time of a task is constant at every instance and 2) show how to efficiently compute this service time. We also prove the optimality of Rate Monotonic Scheduling (with harmonic periods), Earliest Deadline First, and Least Laxity First policies for the case of uniprocessors when used with the optimal service times we computed. Moreover, we extend our result by showing that any policy which can fully utilize all the processors is also optimal for the multiprocessor periodic reward-based scheduling. To show that our optimal solution is pushing the limits of reward-based scheduling, we further prove that, when the reward functions are convex, the problem becomes NP-Hard. Our static optimal solution, besides providing considerable reward improvements over the previous suboptimal strategies, also has a major practical benefit: Run-time overhead is eliminated and existing scheduling disciplines may be used without modification with the computed optimal service times.
Buffer allocation in merge-sorting
Authors: David E. Ferguson
Venue: Communications of the ACM (1971)

A fixed buffer allocation for merge-sorting is presented here which minimizes the number of input-output operations for a given order of merge. When sorting on movable arm disks, the number of seeks is equal to the number of input-output operations, and the seek time usually controls the sort time. First some standard terminology is introduced. Then the input buffer allocation method is described, followed by an analysis of the improvement to be expected over more conventional allocation. This analysis makes use of a particular distribution function. An analysis of a completely different distribution is given which yields similar results. This suggests that the results do not depend on a particular distribution function. An optimum output buffer size is also determined. It is concluded that this buffering allocation can significantly reduce the time of merge sorting on movable arm disks when the input data are not random, and that this output buffer allocation should be used whether the data is random or not.
Cold-start vs. warm-start miss ratios
Authors: Malcolm C. Easton, Ronald Fagin
Venue: Communications of the ACM (1978)

In a two-level computer storage hierarchy, miss ratio measurements are often made from a &ldquo;cold start&rdquo;, that is, made with the first-level store initially empty. For large capacities the effect on the measured miss ratio of the misses incurred while filling the first-level store can be significant, even for long reference strings. Use of &ldquo;warm-start&rdquo; rather than &ldquo;cold-start&rdquo; miss ratios cast doubt on the widespread belief that the observed &ldquo;S-shape&rdquo; of lifetime (reciprocal of miss ratio) versus capacity curve indicates a property of behavior of programs that maintain a constant number of pages in main storage. On the other hand, if cold-start miss ratios are measured as a function of capacity and measurement length, then they are useful in studying systems in which operation of a program is periodically interrupted by task switches. It is shown how to obtain, under simple assumptions, the cache miss ratio for multiprogramming from cold-start miss ratio values and how to obtain approximate cold-start miss ratios from warm-start miss ratios.
Quantum Hopfield Network Using Single-Electron Circuits&mdash;A Novel Hopfield Network Free from the Local-Minimum Difficulty
Authors: Masamichi Akazawa, Eriko Tokuda, Noburu Asahi, Yoshihito Amemiya
Venue: Analog Integrated Circuits and Signal Processing (2000)

The concept of the quantum Hopfield network is proposed with examples of its network construction, which uses single-electron circuits. In this network, two or more threshold elements can change their outputs simultaneously in a form of coherent combination. This can be put into physical form by utilizing the co-tunneling phenomenon found in single-electron circuits. In the quantum Hopfield network, a state transition with a large Hamming distance can occur and therefore the local-minimum difficulty disappears; in consequence the global-minimum energy state can always be achieved. Use of this property made possible the development of novel computation devices that solve combinatorial problems without hindrance from the local-minimum difficulty.
Quiet calls: talking silently on mobile phones
Authors: Les Nelson, Sara Bly, Tomas Sokoler
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

Quiet Calls is a technology allowing mobile telephone users to respond to telephone conversations without talking aloud. QC-Hold, a Quiet Calls prototype, combines three buttons for responding to calls with a PDA/mobile phone unit to silently send pre-recorded audio directly into the phone. This permits a mixed-mode communication where callers in public settings use a quiet means of communication, and other callers experience a voice telephone call. An evaluation of QC-Hold shows that it is easily used and suggests ways in which Quiet Calls offers a new form of communication, extending the choices offered by synchronous phone calling and asynchronous voicemail.
Computer education in a graduate school of management
Authors: D. N. Ness, R. S. Green, W. A. Martin
Venue: Communications of the ACM (1970)

Several years of experience have led to the belief that the creative design and evaluation of management information systems requires a thorough understanding of the related computer technology. Concepts such as paging and priority interrupt systems can best be explained at the machine language level. Any machine used for exposition should fulfill several criteria. It should: (1) raise as few spurious issues as possible; (2) allow, without undue effort, the solution of interesting problems; (3) be capable of exposing all outstanding issues of significance, within the chosen machine; (4) be useful for pursuing issues in great depth when appropriate; (5) not be committed to the equipment provided by any manufacturer; (6) be able to provide the student with diagnostic aids to a great depth; (7) allow the student ready access to the machine; (8) be capable of extension to expose new issues as they come along. We have constructed a simulated machine and its associated software which meets these criteria. This system, called the PRISM system, is documented by a primer and a reference manual.
Parallel Multiplication in GF(2^k) usingPolynomial Residue Arithmetic
Authors: A. Halbutogullari, C. K. Koc
Venue: Designs, Codes and Cryptography (2000)

We present a novel method of parallelization of the multiplication operation in \GF(2^k) for an arbitrary value of k and arbitrary irreducible polynomial n(x) generating the field. The parallel algorithm is based on polynomial residue arithmetic, and requires that we find L pairwise relatively prime modulim_i(x) such that the degree of the product polynomialM(x)=m_1(x)m_2(x)\cdots m_L(x) is at least 2k. The parallel algorithm receives the residue representations of the input operands (elements of the field) and produces the result in its residue form, however, it is guaranteed that the degree of this polynomial is less than k and it is properly reduced by the generating polynomial n(x), i.e., it is an element of the field. In order to perform the reductions, we also describe a new table lookup based polynomial reduction method.
Datapath routing based on a decongestion metric
Authors: S. Raman, S. S. Sapatnekar, C. J. Alpert
Venue: Proceedings of the 2000 international conference on Computer-aided design (2001)

For a four-layer datapath routing environment, we present an algorithm that considers all the nets simultaneously. Routing probabilities are calculated for potential routing regions and consolidated into a congestion metric. This is followed by an iterative diversion technique where the region with the maximum congestion metric is repetitively relaxed until the track probabilities crystallize into integer values of 1 and 0. We have run the algorithm on large test cases and achieved significant routability within a small number of available tracks.
Algorithmic selection of the best method for compressing map data strings
Authors: E. L. Amidon, G. S. Akin
Venue: Communications of the ACM (1971)

The best of a dozen different methods for compressing map data is illustrated. The choices are generated by encoding data strings&mdash;sequence of like codes&mdash;by three methods and in four directions. Relationships are developed between compression alternatives to avoid comparing all of them. The technique has been used to compress data from forest resource maps, but is widely applicable to map and photographic data reduction.
Business Applications: GAN, a system for generating and analyzing activity networks
Authors: A. Schurmann
Venue: Communications of the ACM (1968)

GAN, a system for generating activity networks, is designed to save time in the preparation of activity networks and to deal conveniently with network programs. A defining description of a programming language designed for generating activity network from a set of standard networks is presented. Also, a general idea of a language for performing calculations on activity networks (scheduling activity networks) is given.
Ranking retrieval systems without relevance judgments
Authors: Ian Soboroff, Charles Nicholas, Patrick Cahan
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

The most prevalent experimental methodology for comparing the effectiveness of information retrieval systems requires a test collection, composed of a set of documents, a set of query topics, and a set of relevance judgments indicating which documents are relevant to which topics. It is well known that relevance judgments are not infallible, but recent retrospective investigation into results from the Text REtrieval Conference (TREC) has shown that differences in human judgments of relevance do not affect the relative measured performance of retrieval systems. Based on this result, we propose and describe the initial results of a new evaluation methodology which replaces human relevance judgments with a randomly selected mapping of documents to topics which we refer to aspseudo-relevance judgments.Rankings of systems with our methodology correlate positively with official TREC rankings, although the performance of the top systems is not predicted well. The correlations are stable over a variety of pool depths and sampling techniques. With improvements, such a methodology could be useful in evaluating systems such as World-Wide Web search engines, where the set of documents changes too often to make traditional collection construction techniques practical.
Linear Frameworks for Block Ciphers
Authors: Joan Daemen, Lars R. Knudsen, Vincent Rijmen
Venue: Designs, Codes and Cryptography (2001)

In this paper we generalize the structure of the ciphers Shark, Square, BKSQ, Crypton and Rijndael. We show that the linear components play an essential role in the effect of the nonlinear S-boxes in providing resistance against differential and linear cryptanalysis and provide upper bounds for the probability of differential characteristics and the correlation of linear approximations for the general structure. We show how good linear components can be constructed efficiently from Maximum-Distance Separable codes. The presented block cipher structure can make optimal use of a wide range of processor word lengths and its parallelism allows very fast dedicated hardware implementations. Ciphers with variable block length can be constructed by varying certain parameters in the presented structure.
Managing variability in software architectures
Authors: Felix Bachmann, Len Bass
Venue: ACM SIGSOFT Software Engineering Notes (2001)

This paper presents experience with explicitly managing variability within a software architecture. Software architects normally plan for change and put mechanisms in the architecture to support those changes. Understanding the situations where change has been planned for and recording the options possible within particular situations is usually not done explicitly. This becomes important if the architecture is used for many product versions over a long period or in a product line context where the architecture is used to build a variety of different products. That is, it is important to explicitly represent variation and indicate within the architecture locations for which change has been allowed. We will describe how the management of variations in an architecture can be made more explicit and how the use of variation points connected to the choices a customer has when ordering a product can help to navigate to the appropriate places in the architecture.
Coherent Response in a Chaotic Neural Network
Authors: Haruhiko Nishimura, Naofumi Katada, Kazuyuki Aihara
Venue: Neural Processing Letters (2000)

We set up a signal-driven scheme of the chaotic neural network with the coupling constants corresponding to certain information, and investigate the stochastic resonance-like effects under its deterministic dynamics, comparing with the conventional case of Hopfield network with stochastic noise. It is shown that the chaotic neural network can enhance weak subthreshold signals and have higher coherence abilities between stimulus and response than those attained by the conventional stochastic model.
The Exception Handling Effectiveness of POSIX Operating Systems
Authors: Philip Koopman, John DeVale
Venue: IEEE Transactions on Software Engineering (2000)

Operating systems form a foundation for robust application software, making it important to understand how effective they are at handling exceptional conditions. The Ballista testing system was used to characterize the handling of exceptional input parameter values for up to 233 POSIX functions and system calls on each of 15 widely used operating system (OS) implementations. This identified ways to crash systems with a single call, ways to cause task hangs within OS code, ways to cause abnormal task termination within OS and library code, failures to implement defined POSIX functionality, and failures to report unsuccessful operations. Overall, only 55 percent to 76 percent of the exceptional tests performed generated error codes, depending on the operating system being tested. Approximately 6 percent to 19 percent of tests failed to generate any indication of error despite exceptional inputs. Approximately 1 percent to 3 percent of tests revealed failures to implement defined POSIX functionality for unusual, but specified, situations. Between 18 percent and 33 percent of exceptional tests caused the abnormal termination of an OS system call or library function, and five systems were completely crashed by individual system calls with exceptional parameter values. The most prevalent sources of these robustness failures were illegal pointer values, numeric overflows, and end-of-file overruns. There is significant opportunity for improving exception handling within OS calls and especially within C library functions. However, the role of signals vs. error return codes is both controversial and the source of divergent implementation philosophies, forming a potential barrier to writing portable, robust applications.
TV anytime as an application scenario for MPEG-7
Authors: Silvia Pfeiffer, Uma Srinivasan
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

The ISO/MPEG group has identified a wide range of application scenarios [1] for their emerging MPEG-7 standard on audio-visual metadata. TV Anytime with their vision of future digital TV services [2] encompasses a large number of them. As TV Anytime has also identified metadata as one of the key requirements to realize their vision, MPEG-7 is the natural candidate to fill that role. Here, we describe technically how metadata for the TV Anytime scenario can be created using MPEG-7.
Zinc finger gene clusters and tandem gene duplication
Authors: Mengxiang Tang, Michael Waterman, Shibu Yooseph
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

Zinc finger genes in mammalian genomes are frequently found to occur in clusters with cluster members appearing in a tandem array on the chromosome. It has been suggested that in situ gene duplication events are primarily responsible for the evolution of such clusters. The problem of inferring the series of duplication events responsible for producing clustered families is different from the standard phylogeny problem. In this paper we study this inference problem using a graph called Duplication Model that captures the series of duplication events while taking into account the observed order of the genes on the chromosome. We provide algorithms to reconstruct a duplication model for a given data set. We use our method to hypothesise the series of duplication events that may have produced the ZNF45 family that appears on human chromosome 19.
Code Reviews
Authors: Larry Colen
Venue: Linux Journal (2001)

The best code reviews are the ones that actually get done.
98&cent;/Mflops/s ultra-large-scale neural-network training on a pIII cluster
Authors: Douglas A. Aberdeen, Jonathan Baxter, Robert Edwards
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

Artificial neural networks with millions of adjustable parameters and a similar number of training examples are a potential solution for difficult, large-scale pattern recognition problems in areas such as speech and face recognition, classification of large volumes of web data and finance. The bottleneck is that neural network training involves iterative gradient descent and is extremely computationally intensive. In this paper we present a technique for distributed training of Ultra Large Scale Neural Networks (ULSNN) on Bunyip, a Linux-based cluster of 196 Pentium III processors. To illustrate ULSNN training we describe an experiment in which a neural network with 1.73 million adjustable parameters was trained to recognize machine-printed Japanese characters from a database containing 9 million training patterns. The training runs with a average performance of 163.3 Gflops/s (single precision). With a machine cost of $150,913, this yields a price/performance ratio of 92.4&cent; /Mflops/s (single precision).
Scientific Applications: Computer synthesis of Holograms for 3-D display
Authors: L. B. Lesem, P. M. Hirsch, J. A. Jordan,  Jr.
Venue: Communications of the ACM (1968)

Optical and digital holography are reviewed. The mathematical model and computational techniques of the authors' digital holographic process are discussed, and applications of computer holography are suggested. Computer holograms have been made of three-dimensional objects which give faithful reconstructions, even in white light. A new approach based on point apertures for the image is discussed. Photographs of the images reconstructed from digital holograms are presented
The Geometry and Matching of Lines and Curves Over Multiple Views
Authors: Cordelia Schmid, Andrew Zisserman
Venue: International Journal of Computer Vision (2000)

This paper describes the geometry of imaged curves in two and three views. Multi-view relationships are developed for lines, conics and non-algebraic curves. The new relationships focus on determining the plane of the curve in a projective reconstruction, and in particular using the homography induced by this plane for transfer from one image to another. It is shown that given the fundamental matrix between two views, and images of the curve in each view, then the plane of a conic may be determined up to a two fold ambiguity, but local curvature of a curve uniquely determines the plane. It is then shown that given the trifocal tensor between three views, this plane defines a homography map which may be used to transfer a conic or the curvature from two views to a third. Simple expressions are developed for the plane and homography in each case.A set of algorithms are then described for automatically matching individual line segments and curves between images. The algorithms use both photometric information and the multiple view geometric relationships. For image pairs the homography facilitates the computation of a neighbourhood cross-correlation based matching score for putative line/curve correspondences. For image triplets cross-correlation matching scores are used in conjunction with line/curve transfer based on the trifocal geometry to disambiguate matches. Algorithms are developed for both short and wide baselines. The algorithms are robust to deficiencies in the segment extraction and partial occlusion.Experimental results are given for image pairs and triplets, for varying motions between views, and for different scene types. The methods are applicable to line/curve matching in stereo and trinocular rigs, and as a starting point for line/curve matching through monocular image sequences.
A successful example of a layered-architecture based embedded development with Ada 83 for standard-missile control
Authors: Kelly L. Spicer
Venue: ACM SIGAda Ada Letters (2000)

A need for a standard understandable software architecture that can be reused from project to project has long been recognized. This paper describes the software architecture used for the Standard-Missile-3 (SM-3), Stage-3 development program. The architecture was defined based on hierarchical principles with the goal of providing a general solution for the architecture-level design for embedded systems. An architecture-need statement is first presented listing the attributes of the needed architecture. An overview of the notation is given, and then the layered architecture is described. How the architecture supports multi-build projects is then described. A brief discussion on reuse is then provided --- both reuse of algorithms in the architecture and reuse of the architecture itself. The paper concludes with a few comments on support for the software process. The paper includes two attachments: Attachment A - a list of acronyms and other definitions, and Attachment B - an overview of the SM-3 Stage-3 software requirements.