ppxscal/embedding_network huggingface dataset:
Queries and query processing in object-oriented database systems
Authors: David D. Straube, M. Tamer Özsu
Venue: ACM Transactions on Information Systems (TOIS) (1990)

Object-oriented database mangement systems (OODBMS) combine the data abstraction and computational models of object-oriented programming languages with the query and performance capabilities of database management systems. A concise, formal data model for OODBMS has not been universally accepted, preventing detailed investigation of various system issues such as query processing. We define a data model that captures the essence of classification-based object-oriented systems and formalize concepts such as object identity, inheritence, and methods. The main topic of the paper is the presentation of a query processing methodology complete with an object calculus to object algebra translation are discussed in detail. The paper concludes with a discussion of equivalence-preserving transformation rules for object algebra expressions.
The expandable split window paradigm for exploiting fine-grain parallelsim
Authors: Manoj Franklin, Gurindar S. Sohi
Venue: ACM SIGARCH Computer Architecture News (1992)

We propose a new processing paradigm, called the Expandable Split Window (ESW) paradigm, for exploiting fine-grain parallelism. This paradigm considers a window of instructions (possibly having dependencies) as a single unit, and exploits fine-grain parallelism by overlapping the execution of multiple windows. The basic idea is to connect multiple sequential processors, in a decoupled and decentralized manner, to achieve overall multiple issue. This processing paradigm shares a number of properties of the restricted dataflow machines, but was derived from the sequential von Neumann architecture. We also present an implementation of the Expandable Split Window execution model, and preliminary performance results.
Using inheritance and polymorphism with Ada in government sponsored contracts
Authors: Michael Hirasuna
Venue: ACM SIGAda Ada Letters (1992)

A practical approach for coding object-oriented design in Ada is described. Even though Ada lacks direct support for two important object-oriented constructs, inheritance and polymorphism, an object-orient design can be implemente d with existing portable Ada constructs. More lines of code will be required t o defined the implied constructs of inheritance and polymorphism, but such cod e will have side benefits such as improved readability. The extra lines of code can be minimized with the use of coding rules.This paper does not suggest how Ada can be modified to implement inheritance and polymorphism; such matters are already being addressed by the Ada 9X committee. Instead, it is concern with meeting the needs of government sponsored contracts which require object-oriented design techniques and Ada as th e coding language. Furthermore, this must be done with Ada as it exists today [LRM] and should not require the use of precompilers.Without modification, Ada cannot be as flexible as an object-oriented language; but this is not the issue. In government contracted software, design and coding are distinct phases in the software development. The flexibility of the object-oriented approach can be used in the design phase independently from the target language. The issue is how to code a relatively stable object-oriented design in Ada.
Dining philosophers revisited
Authors: Armando R. Gingras
Venue: ACM SIGCSE Bulletin (1990)

In 1965 Dijkstra posed and solved the Dining Philosophers problem. Since then the problem has become a classic test case for concurrency mechnisms and an example often discussed in operating systems courses. Two theorems prove the correctness of seatings where all philosophers always prefer to pick up a fork with a particular hand first. This note shows the subtlety required to solve the problem by showing that a recently published solution is incorrect. A correct solution is provided.
Abstract Personal Communications Manager (APCM)
Authors: Konrad Froitzheim
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

The Abstract Personal Communications Manager (APCM) is an Application programmers Interface (API) for telecommunications, providing simple and powerful interaction between communication applications and protocol software for circuit switched connections and transmission of voice and data. A few generic service primitives are developed through abstraction of the various call control operations.
Coming to terms with software reuse terminology: a model-based approach
Authors: A. Spencer Peterson
Venue: ACM SIGSOFT Software Engineering Notes (1991)

This article attempts to standardize the use of many terms used in the software reuse literature. Three terms of particular interest -- taxonomy, software reuse, and domain analysis -- and some problems with their usage are discussed. The specific problems with these terms are generalized and several solutions are given, the most important being the introduction of the concept of using reuse process models to provide both context and an overall view of the potential areas of discourse in reuse. Several new terms are proposed for future use; definitions of existing terms that are meaningful in the context of software reuse are also included.
MANEVRO: a new approach to class based programming
Authors: Srdjan Mijanovic
Venue: ACM SIGPLAN Notices (1992)

Manevro is a class based programming language designed primarily for system programming. Using FORTH-like environment, compiler produces extremely efficient code. One of the main goals of the project was to create machine independent compiler thus increasing portability of code.
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
Authors: Bernard Berthomieu, Michel Diaz
Venue: IEEE Transactions on Software Engineering (1991)

A description and analysis of concurrent systems, such as communication systems, whose behavior is dependent on explicit values of time is presented. An enumerative method is proposed in order to exhaustively validate the behavior of P. Merlin's time Petri net model, (1974). This method allows formal verification of time-dependent systems. It is applied to the specification and verification of the alternating bit protocol as a simple illustrative example.
On the attributes of the SCISM organization
Authors: Stamatis Vassiliadis, Bart Blaner, Richard J. Eickemeyer
Venue: ACM SIGARCH Computer Architecture News (1992)

In this paper, we describe some of the attributes of the SCISM organization, a multiple instruction-issuing machine, the outcome of five years of research at the IBM Glendale Laboratory, in Endicott, New York. The proposed organization embodies a number of mechanisms, including the analysis of instruction sequences and deciding which instructions will execute in parallel prior to instruction fetch and issue, the incorporation of permanent preprocessing of instructions to be executed in parallel, the categorization of instructions for parallel execution on the basis of hardware utilization rather than opcode description, the avoidance of memory interlocks through the preprocessing mechanism, and the elimination of execution interlocks with specialized hardware. It is shown that by incorporating these mechanisms, a SCISM capable of issuing and executing two instructions per cycle can achieve more than 90% of the theoretical maximum performance of an idealized, dual instruction issue superscalar machine.
Synchronization of the producer/consumer problem using semaphores, monitors, and the Ada rendezvous
Authors: Ralph C. Hilzer,  Jr.
Venue: ACM SIGOPS Operating Systems Review (1992)

This paper addresses the following questions regarding single-processor synchronization of the producer/consumer problem using semaphores, monitors, and the Ada rendezvous: bull; How does each synchronization method handle encapsulation and information hiding? bull; What task granualarity (size of protected code) is possible for each method during mutual exclusion? bull; When a process gets the processor, can it execute unimpeded to the end of its time quantum while it has work to do, or are unnecessary process switches required?Encapsulation and information hiding can be used to produce reliable code, while task granularity and process switching are performance considerations. Since large and complex programs such as operating systems need to be reliable, encapsulation and information hiding is desirable. However performance is an important consideration too, so task granularity must be as small as possible, and unnecessary process switching should be avoided.
Closed-Form Solutions for Physically Based Shape Modeling and Recognition
Authors: Alex Pentland, Stan Sclaroff
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The authors present a closed-form, physically based solution for recovering a three-dimensional (3-D) solid model from collections of 3-D surface measurements. Given a sufficient number of independent measurements, the solution is overconstrained and unique except for rotational symmetries. The proposed approach is based on the finite element method (FEM) and parametric solid modeling using implicit functions. This approach provides both the convenience of parametric modeling and the expressiveness of the physically based mesh formulation and, in addition, can provide great accuracy at physical simulation. A physically based object-recognition method that allows simple, closed-form comparisons of recovered 3-D solid models is presented. The performance of these methods is evaluated using both synthetic range data with various signal-to-noise ratios and using laser rangefinder data.
PARDES&mdash;an enhanced active database system (abstract)
Authors: Opher Etzion
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

Traditional databases are passive. They do only what is explicitly requested in the user's query or update operation. The active database paradigm states that a database may react in an intelligent way to an external input by creating and executing database operations, which, though not explicitly requested in the input, are required to preserve invariants associated to the data base. This paradigm replaces many operations traditionally implemented by application programs with descriptive definitions that are part of the database schema. Models and research prototypes based on this paradigm are POST-GRES, HiPAC, SAPIENS, Ariel. Our model extends existing active database models in the following ways: It increases the expressive-power of the language used to define the database schema by allowing the specification of a richer class of invariants than is currently supported. Example: (SALARY:=BASE-SALARY + BONUS + 1000* count (SUBORDINATES)) The proposed language is compact yet powerful. It reduces the cost of development and maintenance of database update applications and reduces the problems of validation and verification. It provides an efficient algorithm for generating the auxiliary operations required to preserve the invariants after an update (In other models these operations have to be explicitly coded, either in the application program or in the database schema.) Our model introduces the notion of Exception-Handling Mode, proposes a number of such modes, and specifies how modes can be defined in the data base schema. The modes we propose eliminate a large portion of the exception handling code that currently exists in application programs.
Upper and lower bounds on switching energy in VLSI
Authors: Gloria Kissin
Venue: Journal of the ACM (JACM) (1991)

A technology-independent framework is established for measuring the switching energy consumed by very large scale integrated (VLSI) circuits. Techniques are developed for analyzing functional energy consumption, and for designing energy-efficient VLSI circuits. A wire (or gate) in a circuit uses switching energy when it changes state from 1 to 0 or vice versa. This paper develops the Uniswitch Model (USM) of energy consumption, which measures the differences between pairs of states of an embedded circuit.&hellip; &mdash;From the Author's Abstract
Lower bounds for the complexity of reliable boolean circuits with noisy gates
Authors: Anna Gál
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

It is proved that the reliable computation of any Boolean function with, sensitivity s requires Omega (s log s) gates if the gates of the circuit fail independently with a fixed positive probability. The Omega (s log s) bound holds even if s is the block sensitivity instead of the sensitivity of the Boolean function. Some open problems are mentioned.
Surface Reflection: Physical and Geometrical Perspectives
Authors: Shree K. Nayar, Katsushi Ikeuchi, Takeo Kanade
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

Reflectance models based on physical optics and geometrical optics are studied. Specifically, the authors consider the Beckmann-Spizzichino (physical optics) model and the Torrance-Sparrow (geometrical optics) model. These two models were chosen because they have been reported to fit experimental data well. Each model is described in detail, and the conditions that determine the validity of the model are clearly stated. By studying reflectance curves predicted by the two models, the authors propose a reflectance framework comprising three components: the diffuse lobe, the specular lobe, and the specular spike. The effects of surface roughness on the three primary components are analyzed in detail.
Improved hidden Markov modeling for speaker-independent continuous speech recognition
Authors: Xuedong Huang, Fil Alleva, Satoru Hayamizu, Hsiao-Wuen Hon, Mei-Yuh Hwang, Kai-Fu Lee
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

The paper reports recent efforts to further improve the performance of the Sphinx system for speaker-independent continuous speech recognition. The recognition error rate is significantly reduced with incorporation of additional dynamic features, semi-continuous hidden Markov models, and speaker clustering. For the June 1990 (RM2) evaluation test set, the error rates of our current system are 4.3% and 19.9% for word-pair grammar and no grammar respectively.
Designing file systems for digital video and audio
Authors: P. Venkat Rangan, Harrick M. Vin
Venue: ACM SIGOPS Operating Systems Review (1991)

We address the unique requirements of a multimedia file system such as continuous storage and retrieval of media, maintenance of synchronization between multiple media streams, and efficient manipulation of huge media objects. We present a model that relates disk and device characteristics to the recording rate, and derive storage granularity and scattering parameters that guarantee continuous access. In order for the file system to support multiple concurrent requests, we develop admission control algorithms for determining whether a new request can be accepted without violating the realtime constraints of any of the requests.We define a strand as an immutable sequence of continuously recorded media samples, and then present a multimedia rope abstraction which is a collection of individual media strands tied together by synchronization information. We devise operations for efficient manipulation of multi-stranded ropes, and develop an algorithm for maintaining the scattering parameter during editing so as to guarantee continuous playback of edited ropes.We have implemented a prototype multimedia file system, which serves as a testbed for experimenting with policies and algorithms for multimedia storage. We present our initial experiences with using the file system.
The chaos router: a practical application of randomization in network routing
Authors: S. Konstantinidou, L. Snyder
Venue: ACM SIGARCH Computer Architecture News (1991)

We present the chaos router, an asynchronous adaptive router, which under certain circumstances can send messages farther from their destinations. The chaos router greatly simplifies the routing logic by removing the livelock protection of previous schemes. Through an effective use of randomness, whose sources include that due to the adaptively processed load, the natural timing differences of selftimed circuitry and explicitly injected randomization, the chaos router avoids long message routes with high probability. In this paper the router is described, it is argued that the chaos router is deadlock free and probabilistically live-lock and starvation free, and simulation results are presented showing that the chaos router performs well.
The Rejection Rate for Tasks with Random Arrivals, Deadlines, and Preemptive Scheduling
Authors: David W. Craig, C. Murray Woodside
Venue: IEEE Transactions on Software Engineering (1990)

A means of approximating light-traffic performance of RAD (random-arrivals-with-deadlines) systems for four basic preemptive scheduling policies is presented. The design goal is to keep congestion low enough to make the probability of rejection acceptably small. These designs must have low processor utilization. The study analyzes rejection probabilities at utilizations up to 20% and rejection probabilities up to about 10% for various well-known preemptive scheduling disciplines (shortest job first, earliest due date, and least laxity first), as well as first-come, first-served. Good approximations for the rejection probability and for a number of other properties, such as the distribution of time-to-go at rejection, are found.
1992&mdash;A critical year in HCI education
Authors: Gary Perlman
Venue: ACM SIGCHI Bulletin (1992)

Years from now, I think 1992 will be viewed as a critical year in HCI education, In this column, I would like to explain what has happened leading up to this year and how it will affect the future.
On Optimal Infinite Impulse Response Edge Detection Filters
Authors: Sudeep Sarkar, Kim L. Boyer
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The authors outline the design of an optimal, computationally efficient, infinite impulse response edge detection filter. The optimal filter is computed based on Canny's high signal to noise ratio, good localization criteria, and a criterion on the spurious response of the filter to noise. An expression for the width of the filter, which is appropriate for infinite-length filters, is incorporated directly in the expression for spurious responses. The three criteria are maximized using the variational method and nonlinear constrained optimization. The optimal filter parameters are tabulated for various values of the filter performance criteria. A complete methodology for implementing the optimal filter using approximating recursive digital filtering is presented. The approximating recursive digital filter is separable into two linear filters, operating in two orthogonal directions. The implementation is very simple and computationally efficient. has a constant time of execution for different sizes of the operator, and is readily amenable to real-time hardware implementation.
Statistical parsing of messages
Authors: Mahesh V. Chitrao, Ralph Grishman
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

The recent trend in natural language processing research has been to develop systems that deal with text concerning small, well defined domains. One practical application for such systems is to process messages pertaining to some very specific task or activity [5]. The advantage of dealing with such domains is twofold - firstly, due to the narrowness of the domain, it is possible to encode most of the knowledge related to the domain and to make this knowledge accessible to the natural language processing system, which in turn can use this knowledge to disambiguate the meanings of the messages. Secondly, in such a domain, there is not a great diversity of language constructs and therefore it becomes easier to construct a grammar which will capture all the constructs which exist in this sub-language.
An upper bound for conforming Delaunay triangulations
Authors: Herbert Edelsbrunner, Tiow Seng Tan
Venue: Proceedings of the eighth annual symposium on Computational geometry (1992)

A plane geometric graph C in R2 conforms to another such graph G if each edge of G is the union of some edges of C. It is proved that for every G with n vertices and m edges, there is a completion of a Delaunay triangulation of O(m2n) points that conforms to G. The algorithm that constructs the points is also described.
Finding k-cuts within twice the optimal
Authors: Huzur Saran, Vijay V. Vazirani
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

Two simple approximation algorithms are presented for the minimum k-cut problem. Each algorithm finds a k-cut having weight within a factor of (2-2/k) of the optimal. One of the algorithms is particularly efficient, requiring a total of only n-1 maximum flow computations for finding a set of near-optimal k-cuts, one for each value of k between 2 and n.
Task Response Time for Real-Time Distributed Systems with Resource Contentions
Authors: Wesley W. Chu, Chi-Man Sit, Kin K. Leung
Venue: IEEE Transactions on Software Engineering (1991)

An analytic model is proposed for estimating task response times in distributed systems with resource contentions. The model consists of two submodels. The first submodel is an extended queuing network model used for approximating module response times. This submodel is solved by a decomposition technique which reduces the computational complexity by two to three orders of magnitude when compared with a direct approach. The second submodel is a weighted control-flow graph model from which task response time can be obtained by aggregating module response time in accordance with the precedence relationships. Task response times estimated by the analytic model compare closely with simulation results. It is shown that resource contention delays depend on the availability of resources as well as on the invocation rates and response times of the modules that use the resources. The model can be used to study the tradeoffs among module assignments, scheduling policies, interprocessor communications, and resource contentions in distributed processing systems.
Representation and Presentation of Requirements Knowledge
Authors: W. Lewis Johnson, Martin S. Feather, David R. Harris
Venue: IEEE Transactions on Software Engineering (1992)

The approach to representation and presentation of knowledge used in ARIES, an environment to experiment with support for analysts in modeling target domains and in entering and formalizing system requirements, is described. To effectively do this, ARIES must manage a variety of notations so that analysts can enter information in a natural manner, and ARIES can present it back in different notations and from different viewpoints. To provide this functionality, a single, highly expressive internal representation is used for all information in the system. The system architecture separates representation and presentation, in order to localize consistency and propagation issues. The presentation architecture is tailored to be flexible enough so that new notations can be easily introduced on top of the underlying representation. Presentation knowledge is coupled to specification evolution knowledge thereby leveraging common representations for both in order to provide automated focusing support to users who need informative guidance in creating and modifying specifications.