ppxscal/embedding_network huggingface dataset:
MPEG-4 Systems: Architecting Object-Based Audio-Visual Content
Authors: Alexandros Eleftheriadis
Venue: Journal of VLSI Signal Processing Systems (2001)

We describe the architecture and key features of the MPEG-4 Systems specification, as well as the encoding methodology of its various components: scene description and BIFS, animation streams, object descriptors, object content information, as well as delivery and multiplexing. We also describe the MPEG-4 reference software as well as our own prototype software for MPEG-4 authoring, streaming, and playback. Finally, we briefly compare MPEG-4 Systems with a number of currently available alternative standards and commercial solutions.
Combinatorial Classification of Optimal AuthenticationCodes with Arbitration
Authors: Satoshi Obana, Kaoru Kurosawa
Venue: Designs, Codes and Cryptography (2000)

Unconditionally secure authentication codes with arbitration ( A^2-codes) protect against deceptions from the transmitter and the receiver as well as that from the opponent. We first show that an optimal A^2-code implies an orthogonal array and an affine \alpha-resolvable design. Next we define a new design, an affine \alpha-resolvable + BIBD, and prove that optimal A^2-codes are equivalent to this new design. From this equivalence, we derive a condition on the parameters for the existence of optimal A^2-codes. Further, we show tighter lower bounds on the size of keys than before for large sizes of source states which can be considered as an extension of the bounds on the related designs.
MemorIES: a programmable, real-time hardware emulation tool for multiprocessor server design
Authors: Ashwini Nanda, Kwok-Ken Mak, Krishnan Sugavanam, Ramendra K. Sahoo, Vijayaraghavan Soundararajan, T. Basil Smith
Venue: ACM SIGPLAN Notices (2000)

Modern system design often requires multiple levels of simulation for design validation and performance debugging. However, while machines have gotten faster, and simulators have become more detailed, simulation speeds have not tracked machine speeds. As a result, it is difficult to simulate realistic problem sizes and hardware configurations for a target machine. Instead, researchers have focussed on developing scaling methodologies and running smaller problem sizes and configurations that attempt to represent the behavior of the real problem. Given the increasing size of problems today, it is unclear whether such an approach yields accurate results. Moreover, although commercial workloads are prevalent and important in today's marketplace, many simulation tools are unable to adequately profile such applications, let alone for realistic sizes.In this paper we present a hardware-based emulation tool that can be used to aid memory system designers. Our focus is on the memory system because the ever-widening gap between processor and memory speeds means that optimizing the memory subsystem is critical for performance. We present the design of the Memory Instrumentation and Emulation System (MemorIES). MemorIES is a programmable tool designed using FPGAs and SDRAMs. It plugs into an SMP bus to perform on-line emulation of several cache configurations, structures and protocols while the system is running real-life workloads in real-time, without any slowdown in application execution speed. We demonstrate its usefulness in several case studies, and find several important results. First, using traces to perform system evaluation can lead to incorrect results (off by 100% or more in some cases) if the trace size is not sufficiently large. Second, MemorIES is able to detect performance problems by profiling miss behavior over the entire course of a run, rather than relying on a small interval of time. Finally, we observe that previous studies of SPLASH2 applications using scaled application sizes can result in optimistic miss rates relative to real sizes on real machines, providing potentially misleading data when used for design evaluation.
Caption processing for MPEG video in MC-DCT compressed domain
Authors: Jongho Nang, Ohyeong Kwon, Seungwook Hong
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

The (cinema) caption processing that adds descriptive texts on the sequence of frames is an important video manipulation function that video editor should support. This paper proposes an efficient MC-DCT compressed domain approach to insert the caption into the MPEG-compressed video stream. It basically adds the DCT blocks of the caption image to the corresponding DCT blocks of the input frames one by one in MC-DCT domain as in [5]. However, the strength of the caption image is adjusted in the DCT domain to prevent the resulting DCT coefficients from exceeding the maximum value that is allowed in MPEG. In order to adjust the strength of caption image adaptively, we should know the exact pixel values of input image that is a difficult task in DCT domain. We propose an approximation scheme for the pixel values in which the DC value of a block is used as the expected pixel value for all pixels in that block. Although this approximation may lead some errors in the caption area, it still provides a relatively high image quality in the non-caption area, while the processing time is about 4.9 times faster than the decode-captioning-reencode approach.
Data management: lasting impact on wild, wild, web
Authors: Reed M. Meseck
Venue: ACM SIGMOD Record (2001)

This paper describes some of the ways the Internet and World Wide Web have affected databases and data warehousing and the lasting impact in these areas.
On programming of arithmetic operations
Authors: A. P. Ershov
Venue: Communications of the ACM (1958)

The concepts used without explanation are taken from [1].
Architectural Support for Efficient Multicasting in Irregular Networks
Authors: Rajeev Sivaram, Ram Kesavan, Dhabaleswar K. Panda, Craig B. Stunkel
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

Parallel computing on networks of workstations is fast becoming a cost-effective high-performance computing alternative to MPPs. Such a computing environment typically consists of processing nodes interconnected through a switch-based irregular network. Many of the problems that were solved for regular networks have to be solved anew for these systems. One such problem is that of efficient multicast communication. In this paper, we propose two broad categories of schemes for efficient multicasting in such irregular networks: network interface-based (NI-based) and switch-based. The NI-based multicasting schemes use the network interface of intermediate destinations for absorbing and retransmitting messages to other destinations in the multicast tree. In contrast, the switch-based multicasting schemes use hardware support for packet replication at the switches of the network and a concept known as multidestination routing to convey a multicast message from one source to multiple destinations. We first present alternative schemes for efficient multipacket forwarding at the NI and derive an optimal $k \hbox {-} {binomial}$ multicast tree for multipacket NI-based multicast. We then propose two switch-based multicasting schemes that differ in the power of the encoding scheme and the complexity of the decoding logic at the switches. These multicasting schemes use path-based multidestination worms that can cover all nodes connected to switches along a valid unicast path and tree-based multidestination worms that can cover entire destination sets in a single phase using one worm, respectively. For each scheme, we describe the associated header encoding and decoding operation, the method for deriving multidestination worms that cover arbitrary multicast destination sets, and the multicasting scheme using the derived multidestination worms. We then compare the NI-based multicasting scheme to the switch-based multicasting schemes with path-based and tree-based multidestination worms using simulation to determine the system parameters that affect each of the schemes and the range of system parameters for which each scheme performs best. Our results show that the switch-based multicasting scheme using a single tree-based multidestination worm performs the best among the three schemes. However, the NI-based multicasting scheme is capable of delivering high performance compared to the switch-based multicast using path-based worms, especially when the software overhead at the network interface is less than half of the overhead at the host. We therefore conclude that support for multicast at the NI is an important first step to improving multicast performance. However, there is still considerable gain that can be achieved by supporting hardware multicast in switches. Finally, while supporting such hardware multicast, it is better to support schemes that can achieve multicast in one phase.
Implementing weighted b-matching algorithms: insights from a computational study
Authors: Matthias Müller-Hannemann, Alexander Schwartz
Venue: Journal of Experimental Algorithmics (JEA) (2000)

We present an experimental study of an implementation of weighted perfect <i>b</i>-matching based on the primal-dual blossom algorithm. Although this problem is well-understood in theory and efficient algorithms are known, only little experience with implementations is available. In this paper several algorithmic variants are compared on synthetic and application problem data of very sparse graphs. This study was motivated by the practical need for an efficient <i>b</i>-matching solver for the latter application, namely as a subroutine in our approach to a mesh refinement problem in computer-aided design (CAD).Linear regression and operation counting is used to analyze code variants. The experiments confirm that a fractional jump-start speeds up the algorithm, they indicate that a variant based on pairing heaps is slightly superior to a <i>k</i>-heap variant, and that scaling of large <i>b</i>-values is not necessary, whereas a delayed blossom shrinking heuristic significantly improves running times only for graphs with average degree two. The fastest variant of our implementation appears to be highly superior to a code by Miller and Pekny (1995).
Verification of Large State/Event Systems Using Compositionality and Dependency Analysis
Authors: Jørn Lind-Nielsen, Henrik Reif Andersen, Henrik Hulgaard, Gerd Behrmann, Kåre Kristoffersen, Kim G. Larsen
Venue: Formal Methods in System Design (2001)

A state/event model is a concurrent version of Mealy machines used for describing embedded reactive systems. This paper introduces a technique that uses compositionality and dependency analysis to significantly improve the efficiency of symbolic model checking of state/event models. It makes possible automated verification of large industrial designs with the use of only modest resources (less than 5 minutes on a standard PC for a model with 1421 concurrent machines). The results of the paper are being implemented in the next version of the commercial tool visualSTATETM.
ATM traffic shaper: ATS
Authors: J. C. Diaz, P. Plaza, J. Crespo
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

The design and Implementation of an ATM Traffic Shaper (ATS) is here described. This IC was realized on a 0.35m CMOS technology. The main function of the ATS is the collection of low bit rate traffics to fill a higher bit rate pipe in order to reduce the cost of ATM based services, nowadays mainly influenced by transmission cost. The circuit fits in several ATM system configurations but mainly will be used at the User-Network Interfaces or Network-Network interfaces. The IC was designed with a Top-Down methodology using as HDL, Verilog. The Chip is pad limited and is encapsulated on a 208 PQFP Package. The circuit complexity is 38 Kgates and its working frequency is 32Mhz. A circuit prototype was build with FPGAs in order to validate the RTL description.
Novel components for supporting adaptivity in education systems - model-based integration approach
Authors: Owen Conlan
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

The goal of this research is to provide an adaptive learning engine driven by a model based integration approach. The Adaptive Engine should produce a cohesive course adapted to the users individual preferences.
Theoretical considerations in information retrieval systems
Authors: Jack Belzer, W. Goffman
Venue: Communications of the ACM (1964)

A method for automatic loading of library subroutines, which can be adapted to operate in conjunction with any conventional two-pass assembler is described. The method is specifically designed to cope with a nested library structure.
Empirical working set behavior
Authors: Juan Rodriguez-Rosell
Venue: Communications of the ACM (1973)

The working set model for program behavior has been proposed in recent years as a basis for the design of scheduling and paging algorithms. Although the words &ldquo;working set&rdquo; are now commonly encountered in the literature dealing with resource allocation, there is a dearth of published data on program working set behavior. It is the purpose of this paper to present empirical data from actual program measurements, in the hope that workers in the field might find experimental evidence upon which to substantiate and base theoretical work.
Time sharing in a traffic control program
Authors: L. E. S. Green
Venue: Communications of the ACM (1964)

The Toronto traffic-signal control system consists of a variety of logically distinct computer programs, all competing for machine time. To satisfy these demands, a time-sharing program has been written whose purpose is to execute, in the order of a predefined priority, the various subprograms within the real-time system. In this paper the more interesting aspects of the time-sharing program are outlined.
Cooking with Linux: The Ghost of Fun Times Past
Authors: Marcel Gagne
Venue: Linux Journal (2000)

Marcel writes about text-based games.
Rapid computation of general interpolation formulas and mechanical quadrature rules
Authors: Sven-Åke Gustafson
Venue: Communications of the ACM (1971)

Let &fnof; have n continuous derivatives on a closed interval [a, b] and let L be a linear functional. The attempt is made to approximate L(&fnof;) with L(Q) where Q is a polynomial, approximating &fnof;. Algorithms are developed for rapid computation of L(Q) for a wide class of selections of Q which includes the Lagrangian and Hermitian rules as special cases.
A prototype system for visualizing time-dependent volume data
Authors: Lutz Kettner, Jack Snoeyink
Venue: Proceedings of the seventeenth annual symposium on Computational geometry (2001)

This video shows a prototype system for the visualization of time-vary ing volume data of one or several variables as they occur in scientific and engineering applications. It partitions the data dimensions on the client side into a 3D viewer for iso-surfaces and a 2D control plane where each point selects a particular iso-surface in 3D.
Two approaches for the resolution of word mismatch problem caused by English words and foreign words in Korean information retrieval
Authors: Byung-Ju Kang, Key-Sun Choi
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

In Korean text, recently, the use of English words with or without phonetic translation is growing at high speed. To make matters worse the Korean transliterations of an English word may be very various. The mixed use of English words and their various transliterations may cause severe word mismatch problem in Korean information retrieval. There can be two possible approaches, transliteration and back-transliteration method, to tackle the problem. We argue that our newly proposed transliterations approach is more advantageous for the resolution of the word mismatch problem than the previously proposed back-transliteration approach. Our information retrieval experiment results support this argument.
Student motivation and positive impressions of computing subjects
Authors: Matthew Mitchell, Judy Sheard, Selby Markham
Venue: Proceedings of the Australasian conference on Computing education (2000)

This paper presents results of a student survey which investigates factors affecting student impressions of non-introductory elective computing subjects. The surveys were completed by students in several selected subjects in the last week of semester, prior to them completing their final exam. The factors investigated include students' reason's for taking the surveyed subjects, their expected final result and their opinions on the subject assessment requirements and the quality of teaching. The results indicate there are strong relationships between students' motivations and their impression of subjects. We suggest that in addition to focusing on quality teaching, educators should ensure that their subjects are meeting students' motivational requirements.
An Analog VLSI Model of Periodicity Extraction in the Human Auditory System
Authors: Andrévan Schaik
Venue: Analog Integrated Circuits and Signal Processing (2001)

This paper presents an electronic system that extracts the periodicity of a sound. It uses three analog VLSI building blocks: a silicon cochlea, two Inner Hair Cell circuits and two spiking neuron chips. The silicon cochlea consists of a cascade of filters which delays (and filters) the input sound as it passes along the cascade. The time delay added by each individual filter in the cochlea increases exponentially with position of the filter along the cochlea. The frequency for which the time delay between two outputs that are n-stages apart corresponds to a phase delay of 2&pi; therefore decreases exponentially along the cochlea. In the system presented in this paper we create spike trains from the output of the cochlear filters and we compare the output of each filter with the output of a filter four sections earlier in the cascade. If the signal frequency corresponds to the inverse of the time delay between these two filters, then the two spikes in the spike trains created at these two outputs will coincide. Detecting these coincidences can yield very selective filters, i.e., filters that respond only to a very narrow range of periodicities, but that at the same time still respond after a few periods of the input signal. This is an advantage over traditional band-pass filters, where an increase in selectivity has to be traded off against decrease in response time.
A graph formulation of a school scheduling algorithm
Authors: A. Salazar, R. V. Oakford
Venue: Communications of the ACM (1974)

The problem classically titled &ldquo;The Examination Schedule Problem&rdquo; takes various forms in the literature. Most of these formulations can be presented in the terminology of classical Network Theory. One such formulation is: Given a nondirected network, partition its nodes into a minimal number of subsets such that no two members of the same subset are connected by an arc. An obvious lower limit to this number is the size of the largest strongly connected subgraph. Kirchgassner proved that an upper limit is this size plus one. One logical extension of the previous work is the introduction of variable length examinations where W(I) is the number of periods for exam I. The object of this paper is to generalize the definition of largest strongly connected subgraph to include the weighting of nodes, to present an approximate algorithm which usually finds the largest strongly connected subgraph, and to discuss the application of this algorithm to the solution of school scheduling and exam scheduling problems.
Computer science as empirical inquiry: symbols and search
Authors: Allen Newell, Herbert A. Simon
Venue: Communications of the ACM (1976)

Computer science is the study of the phenomena surrounding computers. The founders of this society understood this very well when they called themselves the Association for Computing Machinery. The machine&mdash;not just the hardware, but the programmed, living machine&mdash;is the organism we study.
Neural Networks in Non-Euclidean Spaces
Authors: Włodzisław Duch, Rafał Adamczak, Geerd H. F. Diercksen
Venue: Neural Processing Letters (1999)

Multilayer Perceptrons (MLPs) use scalar products to compute weighted activation of neurons providing decision borders using combinations of soft hyperplanes. The weighted fun-in activation function may be replaced by a distance function between the inputs and the weights, offering a natural generalization of the standard MLP model. Non-Euclidean distance functions may also be introduced by normalization of the input vectors into an extended feature space. Both approaches influence the shapes of decision borders dramatically. An illustrative example showing these changes is provided.
Extended tasks elicit complex eye movement patterns
Authors: Jeff B. Pelz, Roxanne Canosa, Jason Babcock
Venue: Proceedings of the 2000 symposium on Eye tracking research & applications (2000)

Visual perception is an inherently complex task, yet the bulk of studies in the past were undertaken with subjects performing relatively simple tasks under reduced laboratory conditions. In the research reported here, we examined subjects' oculomotor performance as they performed two complex, extended tasks. In the first task, subjects built a model rocket from a kit. In the second task, a wearable eyetracker was used to monitor subjects as they walked to a restroom, washed their hands, and returned to the starting point. For the purposes of analysis, both tasks can be broken down into smaller sub-tasks that are performed in sequence. Differences in eye movement patterns and high-level strategies were observed in the model building and hand-washing tasks. Fixation durations recorded in the model building tasks were significantly shorter than those reported in simpler tasks. Performance in the hand-washing task revealed look-ahead eye movements made to objects well in advance of a subject's interaction with the object. Often occurring in the middle of another task, they provide overlapping temporal information about the environment, providing a mechanism to produce our conscious visual experience.
An example of hierarchical design and proof
Authors: Jay M. Spitzen, Karl N. Levitt, Lawrence Robinson
Venue: Communications of the ACM (1978)

Hierarchical programming is being increasingly recognized as helpful in the construction of large programs. Users of hierarchical techniques claim or predict substantial increases in productivity and in the reliability of the programs produced. In this paper we describe a formal method for hierarchical program specification, implementation, and proof. We apply this method to a significant list processing problem and also discuss a number of extensions to current programming languages that ease hierarchical program design and proof.
Minimizing wasted space in partitioned segmentation
Authors: Erol Gelenbe, J. C. A. Boekhorst, J. L. W. Kessels
Venue: Communications of the ACM (1973)

A paged virtual memory system using a finite number of page sizes is considered. Two algorithms for assigning pages to segments are discussed. Both of these algorithms are simple to implement. The problem of choosing the page sizes to minimize the expected value of total wasted space in internal fragmentation and in a page table, per segment, is then solved for a probability density function of segment size which may be expressed as a convex combination of Erlang densities.