ppxscal/embedding_network huggingface dataset:
A Shading Model for Cloth Objects
Authors: Takami Yasuda, Shigeki Yokoi, Jun-ichiro Toriwaki, Katsuhiko Inagaki
Venue: IEEE Computer Graphics and Applications (1992)

A fundamental light reflection model that takes into account the internal structure of cloth to render the peculiar gloss of cloth objects is presented. In developing this model, the microscopic structure of textiles was considered. The model represents fabric features such as fiber's cross-sectional shape or weave. By measuring the reflected light intensity from actual cloth objects of several typical materials, it was verified that the model can express the properties of several kinds of cloth, and the parameters in the model were defined.
Using layered support graphs for verifying external adequacy in rule-based expert systems
Authors: Gabriel Valiente
Venue: ACM SIGART Bulletin (1992)

The problem of verifying external adequacy in expert systems is addressed in this paper. External adequacy is defined in terms of a formal specification of question relevance, that expresses natural data dependencies among the external facts used in the ontology of the domain of expertise. A method is presented for verifying the expert system, at any stage of development, against the formal specification. The method is based on transforming the knowledge base plus inference engine into a partially ordered set of support graphs. The complex problem of verifying the external adequacy of expert systems is then translated into a simpler path-finding problem in support graphs.
Integrated Voice-Data Communication Over High-Speed Fiber Optic Networks
Authors: Biswanath Mukherjee
Venue: Computer (1991)

Voice-data integration over emerging high-speed fiber-optic LANs and MANs employing unidirectional buses for information transfer is addressed. Packet voice characteristics and requirements are examined, as are the characteristics of fiber-optic networks. Both train-oriented and non-train-oriented protocols are discussed and compared.
Extensible/rule based query rewrite optimization in Starburst
Authors: Hamid Pirahesh, Joseph M. Hellerstein, Waqar Hasan
Venue: Proceedings of the 1992 ACM SIGMOD international conference on Management of data (1992)

This paper describes the Query Rewrite facility of the Starburst extensible database system, a novel phase of query optimization. We present a suite of rewrite rules used in Starburst to transform queries into equivalent queries for faster execution, and also describe the production rule engine which is used by Starburst to choose and execute these rules. Examples are provided demonstrating that these Query Rewrite transformations lead to query execution time improvements of orders of magnitude, suggesting that Query Rewrite in general&mdash;and these rewrite rules in particular&mdash;are an essential step in query optimization for modern database systems.
Recursive 3-D Road and Relative Ego-State Recognition
Authors: Ernst D. Dickmanns, Birger D. Mysliwetz
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The general problem of recognizing both horizontal and vertical road curvature parameters while driving along the road has been solved recursively. A differential geometry representation decoupled for the two curvature components has been selected. Based on the planar solution of E.D. Dickmanns and A. Zapp (1986) and its refinements, a simple spatio-temporal model of the driving process makes it possible to take both spatial and temporal constraints into account effectively. The estimation process determines nine road and vehicle state parameters recursively at 25 Hz (40 ms) using four Intel 80286 and one 386 microprocessors. Results with the test vehicle (VaMoRs), which is a 5-ton van, are given for a hilly country road.
Representing Software Engineering Models: The TAME Goal Oriented Approach
Authors: Markku Oivo, Victor R. Basili
Venue: IEEE Transactions on Software Engineering (1992)

A methodology and a knowledge representation and reasoning framework for top-down goal-oriented characterization, modeling, and execution of software engineering activities is presented. A prototype system (ES-TAME) which demonstrates the underlying knowledge representation and reasoning principles is described. ES-TAME provides an object-oriented metamodel concept that provides support for tailorable and reusable software engineering models (SEMs). It provides the basic mechanisms, functions, and attributes for all the other models. It is based on interobject relationships, dynamic viewpoints, and selective inheritance in addition to traditional object-oriented mechanisms. Descriptive SEMs include representations for basic software engineering activities. They are controlled and made operational by active GQM (goal-question-metric paradigm) models which are built by a systematic mechanism for defining and evaluating project and corporate goals and using measurement to provide feedback in real-time.
Calculating the probability of a partial parse of a sentence
Authors: Fred Kochman, Joseph Kupin
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

A standard problem in parsing algorithms is the organization of branched searches to deal with ambiguous sentences. We discuss shift-reduce parsing of stochastic context-free grammars and show how to construct a probabilistic score for ranking competing parse hypotheses. The score we use is the likelihood that the collection of subtrees can be completed into a full parse tree by means of the steps the parser is constrained to follow.
Operation-based merging
Authors: Ernst Lippe, Norbert van Oosterom
Venue: ACM SIGSOFT Software Engineering Notes (1992)

Existing approaches for merging the results of parallel development activities are limited. These approaches can be characterised as state-based: only the initial and final states are considered. This paper introduces operation-based merging, which uses the operations that were performed during development. In many cases operation-based merging has advantages over state-based merging, because it automatically respects the data-type invariants of the objects, is extensible for arbitrary object types, provides better conflict detection and allows for better support for solving these conflicts. Several algorithms for conflict detection are described and compared.
The Jitter Model for Metastability and its Application to Redundant Synchronizers
Authors: Lindsay Kleeman
Venue: IEEE Transactions on Computers (1990)

A synchronizer timing model, called the jitter model, which has general application to metastable reliability analysis, is proposed and analyzed. The jitter model is applied to show that redundancy cannot improve the metastable reliability of synchronizers, contradicting previous work by A. El-Amawy. The jitter model extends previous synchronizer input timing models by incorporating the effects of circuit noise. The circuit noise translates into jitter or random time displacement of a previously proposed deterministic aperture mode. The jitter model is supported by simulation, circuit analysis, and experimental work. The results of a SPICE simulation of a CMOS D-type flip-flop are presented. An experimental bistable device is constructed to examine the behavior of synchronizers with noise. Statistical results obtained from the experimental bistable device support the jitter model for metastability. The sensitivity of metastable reliability of redundant synchronizers to modeling assumptions is highlighted.
Comparison of the functional power of APL2 and FORTRAN 90
Authors: Robert G. Willhoft
Venue: ACM SIGAPL APL Quote Quad (1991)

APL and Fortran, although very different, share the challenge of remaining "competitive" in the light of an onslaught of "modern" computer languages. To meet this challenge, both have attempted to enhance their position by adding significant new features to their language. For example, APL2 is an extension of APL.Fortran has also attempted to meet the challenges of modern programming by developing a new Fortran standard called Fortran 90. This standard revises many areas of Fortran, but this paper will only concentrate on those that affect the computational power of Fortran. Many of the changes were motivated by the increased use of vector and array "supercomputers." Therefore, array features, the ability to act on entire arrays instead of individual elements, are an important part of this new standard. In doing this work, the Fortran community looked to APL as an example of a powerful array language.This paper will answer several questions regarding this new standard. First, from a computational or functional point of view, what are the major features of Fortran 90? Next, how do these features compare with APL2? And finally, what can APL2 learn from the Fortran 90 work?
Sculpting: an interactive volumetric modeling technique
Authors: Tinsley A. Galyean, John F. Hughes
Venue: ACM SIGGRAPH Computer Graphics (1991)

We present a new interactive modeling technique based on the notion of sculpting a solid material. A sculpting tool is controlled by a 3D input device and the material is represented by voxel data; the tool acts by modifying the values in the voxel array, much as a "paint" program's "paintbrush" modifies bitmap values. The voxel data is converted to a polygonal surface using a "marching-cubes" algorithm; since the modifications to the voxel data are local, we accelerate this computation by an incremental algorithm and accelerate the display by using a special data structure for determining which polygons must be redrawn in a particular screen region. We provide a variety of tools: one that cuts away material, one that adds material, a "sandpaper" tool, a "heat gun," etc. The technique provides an intuitive direct interaction, as if the user were working with clay or wax. The models created are free-form and may have complex topology; however, they are not precise, so the technique is appropriate for modeling a boulder or a tooth but not for modeling a crankshaft.
BYBLOS speech recognition benchmark results
Authors: F. Kubala, S. Austin, C. Barry, J. Makhoul, P. Placeway, R. Schwartyz
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

This paper presents speech recognition test results from the BBN BYBLOS system on the Feb 91 DARPA benchmarks in both the Resource Management (RM) and the Air Travel Information System (ATIS) domains. In the RM test, we report on speaker-independent (SI) recognition performance for the standard training condition using 109 speakers and for our recently proposed SI model made from only 12 training speakers. Surprisingly, the 12-speaker model performs as well as the one made from 109 speakers. Also within the RM domain, we demonstrate that state-of-the-art SI models perform poorly for speakers with strong dialects. But we show that this degradation can be overcome by using speaker adaptation from multiple-reference speakers. For the ATIS benchmarks, we ran a new system configuration which first produced a rank-ordered list of the N-best word-sequence hypotheses. The list of hypotheses was then reordered using more detailed acoustic and language models. In the ATIS benchmarks, we report SI recognition results on two conditions. The first is a baseline condition using only training data available from NIST on CD-ROM and a word-based statistical bi-gram grammar developed at MIT/Lincoln. In the second condition, we added training data from speakers collected at BBN and used a 4-gram class grammar. These changes reduced the word error rate by 25%.
On Reliable Computation With Formal Neurons
Authors: Santosh S. Venkatesh, Demetri Psaltis
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The authors investigate the computing capabilities of formal McCulloch-Pitts neurons when errors are permitted in decisions. They assume that m decisions are to be made on a randomly specified m set of points in n space and that an error tolerance of epsilon m decision errors is allowed, with 0>or= epsilon >1/2. The authors are interested in how large an m can be selected such that the neuron makes reliable decisions within the prescribed error tolerance. Formal results for two protocols for error-tolerance-a random error protocol and an exhaustive error protocol-are obtained. The results demonstrate that a formal neuron has a computational capacity that is linear in n and that this rate of capacity growth persists even when errors are tolerated in the decisions.
AN SQL interface for Common Lisp
Authors: Alan S. Gunderson
Venue: ACM SIGPLAN Lisp Pointers (1991)

Access to persistent database storage from Common Lisp applications is an increasingly frequent requirement. This paper discusses a software module that allows a Common Lisp program to access a relational database management system. Database queries are expressed as SQL statements. In Common Lisp, the SQL query is represented as a string, which allows sequence functions to be used to construct the query. Through a foreign function interface, the SQL query is passed from Lisp to a C component. The C component contains embedded database statements to utilize the dynamic SQL facility provided by the database management system. The database result table is returned to Lisp. Functions are provided to convert the returned data into a list of structures. Each structure corresponds to one row in the database result table. Structure accessor functions allow each individual attribute (field) in the structure representation of a row in the result table to be obtained.
Multilinear cayley factorization
Authors: Neil L. White
Venue: Journal of Symbolic Computation (1991)

An important problem in computer-aided geometric reasoning is to automatically find geometric interpretations for algebraic expressions. For projective geometry this question can be reduced to the Cayley factorization problem. A Cayley factorization of a homogeneous bracket polynomial P is a Cayley algebra expression (using only the join and meet operations) which evaluates to P. We give an introduction to both Cayley algebra and bracket algebra for those readers not already familiar with them. The main result of this paper is an algorithm which solves the Cayley factorization problem in the important special case that P is multilinear.
An Approach to the Reliability Optimization of Software with Redundancy
Authors: Fevzi Belli, Piotr Jedrzejowicz
Venue: IEEE Transactions on Software Engineering (1991)

An approach to the optimization of software reliability is proposed. The emphasis is put on the software redundancy to achieve fault tolerance, i.e. the results of the optimization process are used to determine the optimal structure of the software to be developed. Two optimization models are formulated covering, respectively, modified recovery block scheme and multiversion programming approaches. Both cases are illustrated by simple examples. The models show that it is possible to formulate and solve some software related reliability optimization problems. They further show that the concept of redundancy to achieve fault tolerance (basic for the traditional theory of reliability) can be used in the field of software reliability optimization.
Navigating the video maze
Authors: Terry Myerson, Theresa Rhyne
Venue: ACM SIGGRAPH Computer Graphics (1992)

The technology required to produce professional video and audio presentations from a desktop computing environment is now available and is supported by many companies. The hardware to support this technology, however, is offered in widely varying forms and at a broad range of prices. This article provides an introductory perspective on the current video technology and includes commercial hardware products currently available for producing video productions from a computing environment.Recording a computer graphics animation to videotape is a complicated task. The heart of the difficulty lies in the fact that video monitors, such as standard televisions, and computer monitors both use the same Cathode Ray Tube (CRT) technology, but they require different signals for display. In 1941, the National Television Standards Committee, NTSC, established a standard for broadcast video in North America. This standard signal is still in use today and consists of a composite, interlaced, 525 line signal, scanning at 30 frames per second (30 Hz.) In contrast to this antiquated standard, today's high-quality monitors display a component red, green, and blue (RGB), non-interlaced, 1280 x 1024 signal, scanning at 75 Hz. The art of producing a video signal can be summed up as translating today's technology to meet yesterday's NTSC standard, with a minimal loss of quality. Although only NTSC signal needs are specifically addressed in this article, most of the equipment is equally compatible with the European broadcast standards: Phase Alternate Line (PAL) and Sequential Color and Memory (SECAM).A video production can be produced from an animation on either a low-end personal computer or a high-end workstation, and most of the hardware discussed can be used interchangeably with any platform. However, choosing the proper system for your needs can still be a formidable task. The vast array of available products presents an endless maze, rather than an easy solution.
Using taps to separate the user interface from the application code
Authors: Thomas Berlage
Venue: Proceedings of the 5th annual ACM symposium on User interface software and technology (1992)

A new mechanism based on taps is introduced to separate the output from the application code in graphical interactive interfaces. The mechanism is implemented in GINA, an object-oriented application framework. Taps maintain a functional mapping from application data to interface objects that is described in a general-purpose programming language. Taps are triggered automatically by user actions. Compared to constraints or the MVC model, taps do not need execution or memory support from the application objects, at the expense of a performance penalty. Screen updates, which pose the largest performance problem, are minimized by checking for attribute changes and window visibility. A comparison operation is used to maintain structural consistency between hierarchies of application and interface objects. Taps can be defined interactively using formulas in a spreadsheet-like tool.
Ada 9X protected types in Pascal-FC
Authors: A. Burns, G. L. Davies
Venue: ACM SIGAda Ada Letters (1992)

In concurrent languages whose inter-process communication and synchronisation is based on message-passing, passive objects such as buffers are generally implemented as processes (tasks). This practice is not wholly satisfactory. The Ada9X mapping team have introduced the protected type as an abstraction for passive objects. This paper briefly describes the proposal and then reports on the introduction of a similar structure into Pascal-FC, a language designed for use in teaching concurrent programming. The paper therefore helps to inform the Ada community of this new feature in the language. Examples are given. Pascal-EC is freely available.
A heuristic algorithm for the fanout problem
Authors: Kanwar Jit Singh, Alberto Sangiovanni-Vincentelli
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

We present an algorithm to optimally distribute a signal to its required destinations. The choice of the buffers and the topology of the distribution tree depends on the availability of different strength gates and on the load and the required times at the destinations. The general problem is to construct a fanout-tree for a signal so that the required time constraint at the source node is met and the fanout-tree has a minimum area. Since the area constrained fanout problem is NP-complete and area is not a major consideration in present high density designs, we restrict our attention to the simpler problem of designing fast fanout circuits without any area constraint. The proposed algorithm builds the fanout tree by partitioning the fanout signals into subsets and then recursively solving each sub-problem. At each stage the algorithm generates a fanout tree that is an improvement over the previous stage. This feature allows the user to specify the improvement desired by the fanout correction process. The performance of the algorithm, when run on randomly generated distributions of required times and on real design examples, is very promising.
Automatic incorporation of on-chip testability circuits
Authors: Noriyuki Ito
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

This paper presents a system which automatically incorporates testability circuits into ECL chips. This system incorporates three types of circuit: (1) random access scan circuit, (2) clock suppression circuit for delay fault testing, and (3) pin scan-out circuit for chip I/O pin observation in board testing. Fanout destinations of each gate in the testability circuits are localized on a chip to keep the logical net length within the limit. This system was used to develop the new Fujitsu VP-2000 supercomputer.
Basis Sets for Synthesis of Switching Functions
Authors: Snehamay Kundu
Venue: IEEE Transactions on Computers (1992)

The synthesis of switching function f(x/sub 1/, x/sub 2/, . . ., x/sub n/) from a given family of functions g/sub i/(x/sub 1/, x/sub 2/, . . ., x/sub n/), 1>or=i>or=k, using a complete set of logic primitives is considered. Necessary and sufficient conditions for the synthesis of f from the g/sub i/'s are derived using the concept of a basis set. The independence between the basis property and the completeness of a set of logic primitives is shown, the conditions for extending a set (g/sub 1/, g/sub 2/, . . ., g/sub j/), j>n, to a basis set are found. Thus, the selection of a basis set and the logic primitives can be treated as separate problems. Finally, it is shown that there is a unique generalized Reed-Muller expansion for any f in terms of the basis functions (g/sub i/).
An Efficient Method of Computing Generalized Reed-Muller Expansions from Binary Decision Diagram
Authors: Suman Purwar
Venue: IEEE Transactions on Computers (1991)

An efficient method for the generation of all the 2/sup n/ sets of generalized Reed-Muller (GRM) coefficients for a Boolean function f(X) of n variables using the binary decision diagram (BDD) is presented. The author describes the generation of RM coefficients from minterm values and relates them to the associated subfunctions. Examples are included to illustrate the procedure.
Seesoft-A Tool for Visualizing Line Oriented Software Statistics
Authors: Stephen G. Eick, Joseph L. Steffen, Eric E. Sumner,  Jr.
Venue: IEEE Transactions on Software Engineering (1992)

The Seesoft software visualization system allows one to analyze up to 50000 lines of code simultaneously by mapping each line of code into a thin row. The color of each row indicates a statistic of interest, e.g., red rows are those most recently changed, and blue are those least recently changed. Seesoft displays data derived from a variety of sources, such as version control systems that track the age, programmer, and purpose of the code (e.g., control ISDN lamps, fix bug in call forwarding); static analyses, (e.g., locations where functions are called); and dynamic analyses (e.g., profiling). By means of direct manipulation and high interaction graphics, the user can manipulate this reduced representation of the code in order to find interesting patterns. Further insight is obtained by using additional windows to display the actual code. Potential applications for Seesoft include discovery, project management, code tuning, and analysis of development methodologies.