ppxscal/embedding_network huggingface dataset:
A multimedia system based on MPEG video coding algorithm
Authors: Yoshihiro Miyamoto, Mutsumi Ohta, Mitsuharu Yano, Takao Nishitani
Venue: ACM SIGCOMM Computer Communication Review (1992)

A multimedia player system has been developed. The player is a playback system of video, audio, and graphics recoded on a CD-ROM or received through an ISDN primary rate service. Both CD-ROM and ISDN primary rate services can carry about 1.5Mbit/sec information, but this rate is too low compared with original video data rate. Therefore, video data compression techniques are needed for realizing such systems. Coding algorithm of video and associated audio has been discussed by MPEG (Motion Picture Experts Group) in ISO-IEC/JTC1. In our system, video decoding algorithm is based on the MPEG standardized method [1]. Only CD-ROM interface is provided because of limited availability of ISDN applications at present.
On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication
Authors: Randal E. Bryant
Venue: IEEE Transactions on Computers (1991)

Lower-bound results on Boolean-function complexity under two different models are discussed. The first is an abstraction of tradeoffs between chip area and speed in very-large-scale-integrated (VLSI) circuits. The second is the ordered binary decision diagram (OBDD) representation used as a data structure for symbolically representing and manipulating Boolean functions. The lower bounds demonstrate the fundamental limitations of VLSI as an implementation medium, and that of the OBDD as a data structure. It is shown that the same technique used to prove that any VLSI implementation of a single output Boolean function has area-time complexity AT/sup 2/= Omega (n/sup 2/) also proves that any OBDD representation of the function has Omega (c/sup n/) vertices for some cor=i>or=n, the following lower bounds are proved: any VLSI implementation must have AT/sup 2/= Omega (i/sup 2/) and any OBDD representation must have Omega (1.09/sup i/) vertices.
Beyond Turing: a knowledge based model relativistic Cn machine
Authors: A. C. Manoharan
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

We extend some Turing notions of computation, from over the integers Z, to computation over complex variables C. Corresponding to scientific problems, we implement knowledge based heuristically developed Prolog databases for visualizing and symbolically analyzing domains for analytic functions over several complex variables. The domains, at the outset, deal with the quantum theory of physical fields, incorporating Einstein's special relativity in a 1-space, 1-time model. These methods could constitute the earliest symbolic computer experiments for several complex variable domains. The objects visualized are of dimension 12, with methods to hopefully handle even higher dimensions. The computations are motivated by a formulation of Hilbert's 6'th problem and impact on artificial intelligence capabilities of machines. We use logical deduction and inference, with a form of Minsky frames and slots.
Efficient bottom-up parsing
Authors: Robert Moore, John Dowding
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

This paper describes a series of experiments aimed at producing a bottom-up parser that will produce partial parses suitable for use in robust interpretation and still be reasonably efficient. In the course of these experiments, we improved parse times by a factor of 18 over our first attempt, ending with a system that was twice as fast as our previous parser, which relied on strong top-down constraints. The major algorithmic variations we tried are described along with the corresponding performance results.
Spot noise texture synthesis for data visualization
Authors: Jarke J. van Wijk
Venue: Proceedings of the 18th annual conference on Computer graphics and interactive techniques (1991)

The use of stochastic texture for the visualization of scalar and vector fields over surfaces is discussed. Current techniques for texture synthesis are not suitable, because they do not provide local control, and are not suited for the design of textures. A new technique, spot noise, is presented that does provide these features. Spot noise is synthesized by addition of randomly weighted and positioned spots. Local control of the texture is realized by variation of the spot. The spot is a useful primitive for texture design, because, in general, the relations between features of the spot and features of the texture are straightforward. Various examples and applications are shown. Spot noise lends itself well for the synthesis of texture over curved surfaces, and is therefore an alternative to solid texturing. The relations of spot noise with a variety of other techniques, such as radom faults, filtering, sparse convolution, and particle systems, are discussed. It appears that spot noise provides a new perspective on those techniques.
Application of sequential staging of tasks to petroleum reservoir modeling
Authors: Frederic J. L. Briens, Ching H. Wu
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

A large-scale compositional reservoir simulation (>1,000 cells) is not often run on a conventional mainframe computer due to excessive turn-around times. This paper presents programming and computational techniques that fully exploit the capabilities of parallel supercomputers for a large-scale compositional simulation. A novel algorithm called Sequential Staging of Tasks (SST) that can take full advantage of parallel-vector processing to speed-up the solution of a large linear system is introduced. The effectiveness of SST is illustrated with results from computer experiments conducted on an IBM 3090-600E.
Improving fault tolerance and supporting partial writes in structured coterie protocols for replicated objects
Authors: Michael Rabinovich, Edward D. Lazowska
Venue: Proceedings of the 1992 ACM SIGMOD international conference on Management of data (1992)

This paper presents a new technique for efficiently controlling replicas in distributed systems. Conventional structured coterie protocols are efficient but incur a penalty of reduced availability in exchange for the performance gain. Further, the performance advantage can only be fully realized when write operations always replace the old data item with the new value instead of updating a portion of the data item. Our new approach significantly improves availability while allowing partial write operations. After presenting our general approach, we apply it to an existing structured coterie protocol and analyze the availability of the resulting protocol. We also show that other classes of protocols can make use of our approach.
Advantages of a component-based approach to defining complicated objects
Authors: Andrew M. Drinnan, David M. Morton
Venue: ACM SIGPLAN OOPS Messenger (1993)

We describe the construction of a browser in Auditon, a language that incorporates and extends the performer and stage paradigm first introduced in Rehersal World. Performers provide the instance specialisation of both behavior and structure; stages manage performers and provide a local namespace. This approach improves the modularity and eases debugging of interconnected objects.
Some simple ways to construct and to use formulas mechanically
Authors: Michael P. Barnett
Venue: ACM SIGSAM Bulletin (1991)

This note describes a style of mechanical formula construction and several utilities that help to debug, document and monitor Mathematica procedures, that evolved from some recent work on the symbolic evaluation of molecular integrals of quantum chemistry. Objects called grules and crules are used to substitute from one equation into another, with easily controlled generality or specificity. Operations are performed in situ on subexpressions that are specified hierarchically. Interpretive and string manipulation techniques serve supporting roles.
A class of replacement policies for medium and high-associativity structures
Authors: Yannick Deville, Jean Gobert
Venue: ACM SIGARCH Computer Architecture News (1992)

The content of set associative and fully associative structures (such as cache memories, TLBs and main memories) is controlled by a replacement algorithm. Replacing the elements that have not been accessed for a long period yields high performance. This property has been used in the LRU policy, it is also used in this paper, in order to define a new class of replacement policies that provide two improvements over LRU : 1) they exhibit higher performance, 2) they have a lower complexity of implementation : when the associativity increases, their complexity remains unchanged while it increases very rapidly for LRU. Trace-driven simulations show that, in 4-way caches, the performance improvement of one of the proposed policies over LRU is similar to the improvement of LRU over random and FIFO (i.e. about 10 %). For higher associativities, the proposed policies yield much higher performance in a particular range of cache sizes. In fully associative TLBs, the performance improvement is smaller but they yield much simpler implementations.
Building user interfaces interactively using pre- and postconditions
Authors: Martin R. Frank, J. J. de Graaff, Daniel F. Gieskens, James D. Foley
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

A tool is presented which allows graphic layout of a user interface integrated with specification of behavior using pre- and postconditions.
Upsilon Pi Epsilon (UPE): the role of the computing science honor society in computer science programs
Authors: Robert F. Roggio
Venue: ACM SIGCSE Bulletin (1990)

It is the role of the university and programs in computer science to provide a quality education in the computing sciences. These activities clearly imply the need to expose the students to the professional societies, such as ACM, IEEE-CS, and DPMA, as appropriate. But in addition, recognition for outstanding scholarship is a must. While other major areas, such as engineering, mathematics, and business have societies through which outstanding students may be recognized for a number of years, the computer science honor society is relatively new.The purpose of this paper is to present not only the general features and organization of the honor society, but, most importantly, to demonstrate the impact of the society on the daily activities of computing science students.
The Influence of Different Workload Descriptions on a Heuristic Load Balancing Scheme
Authors: Thomas Kunz
Venue: IEEE Transactions on Software Engineering (1991)

A task scheduler based on the concept of a stochastic learning automation, implemented on a network of Unix workstations, is described. Creating an artificial, executable workload, a number of experiments were conducted to determine the effect of different workload descriptions. These workload descriptions characterize the load at one host and determine whether a newly created task is to be executed locally or remotely. Six one-dimensional workload descriptors are examined. Two workload descriptions that are more complex are also considered. It is shown that the best single workload descriptor is the number of tasks in the run queue. The use of the worst workload descriptor, the 1-min load average, resulted in an increase of the mean response time of over 32%, compared to the best descriptor. The two best workload descriptors, the number of tasks in the run queue and the system call rate, are combined to measure a host's load. Experimental results indicate that no performance improvements over the scheduler versions using a one-dimensional workload descriptor can be obtained.
Four generic communication tasks which must be supported in electronic conferencing
Authors: John C. McCarthy, Victoria C. Miles, Andrew F. Monk, Michael D. Harrison, Alan J. Dix, Peter C. Wright
Venue: ACM SIGCHI Bulletin (1991)

In this paper we describe and discuss the design implications of four Generic Communication Tasks which must be supported in electronic conferencing.
How hard is halfspace range searching?
Authors: Hervé Brönnimann, Bernard Chazelle
Venue: Proceedings of the eighth annual symposium on Computational geometry (1992)

We investigate the complexity of halfspace range searching: Given n points in d-space, build a data structure that allows us to determine efficiently how many points lie in a query halfspace. We establish a tradeoff between the storage m and the worst-case query time t in the Fredman/Yao arithmetic model of computation. We show that t must be at least on the order of (n/log n)1-((d-1)/(d(d+1))m1/d. To our knowledge, this is the first nontrivial lower bound for halfspace range searching. Although the bound is unlikely to be optimal, it falls reasonably close to the recent O(n(log m/n)d+1/m1/d) upper bound established by Matous&caron;ek. We also show that it is possible to devise a sequence of n inserts and halfspace range queries that require a total time of n2-&thgr;(1/d). Our results imply nontrivial lower bounds for spherical range searching in any fixed dimension. For example they show that, with linear storage, circular range queries in the plane require &OHgr;(n1/3) time (modulo a logarithmic factor).
Intrinsic Constraints in Space-Time Filtering: A New Approach to Representing Uncertainty in Low-Level Vision
Authors: Radu S. Jasinschi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

Describes how, in the process of extracting the optical flow through space-time filtering, one has to consider the constraints associated with the motion uncertainty, as well as the spatial and temporal sampling rates of the sequence of images. The motion uncertainty satisfies the Cramer-Rao (CR) inequality, which is shown to be a function of the filter parameters. On the other hand, the spatial and temporal sampling rates have lower bounds, which depend on the motion uncertainty, the maximum support in the frequency domain, and the optical flow. These lower bounds on the sampling rates and on the motion uncertainty are constraints that constitute an intrinsic part of the computational structure of space-time filtering. The author shows that if he uses these constraints simultaneously, the filter parameters cannot be arbitrarily determined but instead have to satisfy consistency constraints. By using explicit representations of uncertainties in extracting visual attributes, one can constrain the range of values assumed by the filter parameters.
Image Restoration Using Gibbs Priors: Boundary Modeling, Treatment of Blurring, and Selection of Hyperparameter
Authors: Valen E. Johnson, Wing H. Wong, Xiaoping Hu, Chin-Tu Chen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The authors propose a Bayesian model for the restoration of images based on counts of emitted photons. The model treats blurring within the context of an incomplete data problem and utilizes a Gibbs prior to model the spatial correlation of neighboring regions. The Gibbs prior includes line sites to account for boundaries between regions, and the line sites are assigned continuous values to permit efficient estimation using a method called iterative conditional averages. In addition, the effect of blurring in masking differences between images and the effects of misspecifying the amount of blurring are discussed.
Compact Object Recognition Using Energy-Function-Based Optimization
Authors: N. S. Friedland, Azriel Rosenfeld
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

Describes a method of recognizing objects whose contours can be represented in smoothly varying polar coordinate form. Both low- and high-level information about the object (contour smoothness and edge sharpness at the low level and contour shape at the high level) are incorporated into a single energy function that defines a 1D, cyclic, Markov random field (1DCMRF). This 1DCMRF is based on a polar coordinate object representation whose center can be initialized at any location within the object. The recognition process is based on energy function minimization, which is implemented by simulated annealing.
Structured analysis and object-oriented development are not compatible
Authors: Donald Firesmith
Venue: ACM SIGAda Ada Letters (1991)

Since its introduction in 1978, traditional Structured Analysis has been an industry standar d method for software requirements analysis that is supported by numerous CASE tools. Since their introduction in the early 1980s, various forms of Object-Oriented Development (OOD) have also become the preferred approach for the design and coding of Ada software. More recently, OOD has included various forms of Object-Oriented Requirements Analysis. OOD has therefor e come into direct competition with Structured Analysis. While some methodologists have advocated retaining Structured Analysis and have worked to merge the two paradigms, others have pointed out significant disadvantages of combining them and urge the use of a unifie d object-oriented paradigm throughout all development activities. A recent article published in Ada Letters by Ken Shumate [SH 1991] is illustrative of this controversy and has prompted this reply.It is the thesis of this paper that traditional Structured Analysis, even when modified for real-tim e systems, is a technically obsolete way to specify software requirements, and that Structure d Analysis and Object-Oriented Development are fundamentally incompatible and unnecessarily difficult for software engineers to combine effectively.
Recovery of Nonrigid Motion and Structure
Authors: Alex Petland, Bradley Horowitz
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The authors introduce a physically correct model of elastic nonrigid motion. This model is based on the finite element method, but decouples the degrees of freedom by breaking down object motion into rigid and nonrigid vibration or deformation modes. The result is an accurate representation for both rigid and nonrigid motion that has greatly reduced dimensionality, capturing the intuition that nonrigid motion is normally coherent and not chaotic. Because of the small number of parameters involved, this representation is used to obtain accurate overstrained estimates of both rigid and nonrigid global motion. It is also shown that these estimates can be integrated over time by use of an extended Kalman filter, resulting in stable and accurate estimates of both three-dimensional shape and three-dimensional velocity. The formulation is then extended to include constrained nonrigid motion. Examples of tracking single nonrigid objects and multiple constrained objects are presented.
Supporting cooperation in the Marvel process-centered SDE
Authors: Naser S. Barghouti
Venue: ACM SIGSOFT Software Engineering Notes (1992)

Large scale software development processes often require cooperation among multiple teams of developers. To support such processes, SDEs must allow developers to interleave their access to the various components of the projects. This interleaving can lead to interference, which may corrupt the project components. In traditional database systems, the problem is avoided by enforcing serializability among concurrent transactions. In traditional software development, the problem has been addressed by introducing version and configuration management techniques combined with checkout/checkin mechanisms. Unfortunately, both of these solutions are too restrictive for SDEs because they enforce serialization of access to data, making cooperation unacceptably difficult. In this paper, I illustrate the problem and show how the encoding of the software development process in process-centered SDEs can be used to provide more appropriate concurrency control. I present the concurrency control mechanism I developed for the MARVEL SDE. This mechanism uses the process model in MARVEL to support the degree of cooperation specified in the development process.
Getting the most for your Megabit
Authors: Michael H. Comer, Michael W. Condry, Scott Cattanach, Roy Campbell
Venue: ACM SIGCOMM Computer Communication Review (1991)

The Gigabit Study Group at the University of Illinois is developing a tool that will permit analysis of the network from the application point of view, providing input into the network engineering process and predicting application performance. Phases in this development include the measurement of existing networks, the profiling of application input/output activity, and the integration of the information derived from these into a simulation tool.Maximum throughput ratings on networks continue to rise but our measurements show that the throughput realized by an application is closely tied to the sizes of data (buffer sizes) used by the application over the network and the number of buffers that are sent consecutively. Our preliminary study indicates that, while there are applications are specifically designed to take advantage of large network packets, most interactive TCP/IP applications use small (4 bytes to 8k bytes) buffers and do not send large numbers of buffers in a row. For this type of traffic, a 1 Gbps UltraNet provides about the same performance as a 10 Mbps Ethernet. For large volume traffic (32k bytes to 256k bytes), either generated by large packets or sequences of small packets, the UltraNet provides quite satisfactory throughput to the application. The study described herein examines the throughput of four networks as a function of buffer size for sequences of 4 buffers and 128 buffers.Because the maximum rated throughput of a network can be a poor indicator of the throughput that network provides to an application, we believe that a tool that takes into account the characteristics of the application set is needed.
Array privatization for parallel execution of loops
Authors: Zhiyuan Li
Venue: Proceedings of the 6th international conference on Supercomputing (1992)

In recent experiments, array privatization played a critical role in successful parallelization of several real programs. This paper presents compiler algorithms for the program analysis for this transformation. The paper also addresses issues in the implementation.
Specifying Interdatabase Dependencies in a Multidatabase Environment
Authors: Marek Rusinkiewicz, Amit Sheth, George Karabatis
Venue: Computer (1991)

The problem of interdatabase dependencies and the effect they have on applications updating interdependent data are addressed. A model that allows specifications of constraints among multiple databases in a declarative fashion is proposed. The separation of the constraints from the application programs facilitates the maintenance of data constraints and allows flexibility in their implementation. It allows investigation of various mechanisms for enforcing the constraints, independently of the application programs. By grouping the constraints together, it is possible to check their completeness and discover possible contradictions among them. The concepts of polytransactions, which use interdatabase dependencies to generate a series of related transactions that maintain mutual consistency among interrelated databases, is discussed.