ppxscal/embedding_network huggingface dataset:
Personal computing: personal computers and the world software market
Authors: Larry Press
Venue: Communications of the ACM (1991)

It may be trite to say that &ldquo;the world is shrinking,&rdquo; but it is true nonetheless. Political and technological changes are edging us in the direction of the global village. We have the economic unification of Western Europe, the transition of Eastern Europe to market economies, and free trade agreements and negotiations in the Western hemisphere. Blue jeans and rock and roll music are found throughout the world, we can direct dial to Iceland, and your grandmother may have a FAX machine.
Biblio of object-oriented system development
Authors: S. Mrdalj
Venue: ACM SIGSOFT Software Engineering Notes (1990)

An increasing number of articles and books is being published in the area of object-oriented system development (OOSD). A need for collection, classification and evaluation of the available material is already evident. This is why we decided to collect a bibliography when we started our research project on comparison of object-oriented analysis and design methods.Most of the included items do not attack the whole problem of OOSD but together they represent work done on many aspects of the problem. Some are related to the system design using various object-oriented programming languages. Also a few items have been included that deal with object-oriented principles in general. There are even some which are "comments" or "discussions" on the topic. The items were chosen on the basis that they should have some direct reference to object-oriented system development.This bibliography contains material in the field that has been published before Spring 1990. It is by no means supposed to be complete. If any references of particular significance have been omitted, the author would appreciate hearing about them. I hope this bibliography will help those planning to build object-oriented systems, or those who are working on new OOSD methods.
Teaching computer graphics using RenderMan
Authors: G. Scott Owen
Venue: Proceedings of the twenty-third SIGCSE technical symposium on Computer science education (1992)

A computer graphics course is extremely hardware system dependent, even more than most computer science courses. To produce high quality graphics images requires a high resolution system with extensive color capability and a fast cpu. Fortunately, the computer graphics capabilities of inexpensive systems have continued to increase. As this trend continues we need to consider changing the way we teach our computer graphics courses. In this paper I discuss a major shift in my teaching methods in the past year. Whereas, previously my students developed their own programs to create images, I have switched to the use of the Pixar RenderMan graphics package in the second graphics course and use it at the end of the first graphics course. I will discuss the rational for this change, mine and the students' experiences with it, and future planned modifications of the courses.
Computer animation of knowledge-based human grasping
Authors: Hans Rijpkema, Michael Girard
Venue: ACM SIGGRAPH Computer Graphics (1991)

The synthesis of human hand motion and grasping of arbitrary shaped objects is a very complex problem. Therefore high-level control is needed to perform these actions. In order to satisfy the kinematic and physical constraints associated with the human hand and to reduce the enormous search space associated with the problem of grasping objects, a knowledge based approach is used. A three-phased scheme is presented which incorporates the role of the hand, the object, the environment and the animator. The implementation of a hand simulation system HANDS is discussed.
Supply, demand, and piracy
Authors: Eric Zabinski
Venue: ACM SIGCAS Computers and Society (1991)

Software piracy has robbed the computer industry of billions of dollars according to PC World. Piracy, one of the most common forms of computer crime, is the reproduction of "protected" programs (e.g. copyrighted programs). A nonviolent crime, software piracy is unique in that the "stolen" object is left behind; the thief only walks off with a copy of the program. Futhermore, piracy is generally committed in the privacy of one's home, away from the firm being robbed.
3-D Corridor Modeling from a Single View Under Natural Lighting Conditions
Authors: Takeshi Shakunaga
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The author discusses the modeling of a 3-D indoor scene from a single view using a generic object model. It is assumed that an image is made by a well-calibrated camera, and that the camera height above the floor is known. The image is assumed to be a projection of a natural corridor scene from which a generic model is known, but the specific model is unknown. This system can model any corridor that satisfies the following conditions: (1) the corridor is a rectangular parallelepiped, (2) there are several lines along each axis of the rectangle parallelepiped, (3) there are not many parallel lines in directions other than along the principal axes, and (4) corridor height is within a known range. The system for 3-D modeling from a single view of such a corridor consists of a robust bottom-up image processing part and a top-down, model-based interpretation part. Experimental results show that specific corridor models can be recovered from a single view with an approximately 1% estimation error.
Verification of interacting sequential circuits
Authors: Abhijit Ghosh, Srinivas Devadas, A. Richard Newton
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

The problem of verifying the equivalence of interacting finite state machines (FSMs) described at the logic level is addressed. The problem is formulated as that of checking for the equivalence of the reset/starting states of the two FSMs. First, separate sum-of-product representations of the ON-sets and OFF-sets of each of the flip-flop inputs and primary outputs of the sequential circuit, are extracted using the PODEM algorithm. We describe a fast algorithm for state differentiation based on this representation. The input as well as the state space is implicitly enumerated through a process of repeated cube intersections to generate the State Transition Graph (STG). In contrast to previous approaches, this algorithm can be efficiently generalized for verifying distributed-style specifications of interacting sequential circuits, exploiting the nature of the interconnection topology. Pipeline latches in a distributed-style specification typically do not add complexity to the sequential behavior of a circuit, but greatly add to the complexity of traditional approaches to verifying sequential circuits. Pipeline latches are easily incorporated into our generalized, hierarchical verification strategy whereby the states of pipeline latches can be implicitly enumerated. Experimental results indicate the superior efficiency of this approach as compared to previous approaches for FSM verification. It is possible to verify examples with more than 1050 states.
Object-Oriented Database Management Systems: Concepts and Issues
Authors: Elisa Bertino, Lorenzo Martino
Venue: Computer (1991)

Requirements imposed on both the object data model and object management by the support of complex objects are outlined. The basic concepts of an object-oriented data model are discussed. They are objects and object identifiers, aggregation, classes and instantiation mechanisms, metaclasses, and inheritance. Object-oriented models are compared with semantic, relational, and Codasyl models. Object-oriented query languages and query processing are considered. Some operational aspects of data management in object-oriented systems are examined. Schema evolution is discussed.
An 86,000-word recognizer based on phonemic models
Authors: M. Lennig, V. Gupta, P. Kenny, P. Mermelstein, D. O'Shaughnessy
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

We have developed an algorithm for the automatic conversion of dictated English sentences to written text, with essentially no restriction on the nature of the material dictated. We require that speakers undergo a short training session so that the system can adapt to their individual speaking characteristics and that they leave brief pauses between words. We have tested our algorithm extensively on an 86,000 word vocabulary (the largest of any such system in the world) using nine speakers and obtained word recognition rates on the order of 93%.
On PCF parallel Fortran extensions
Authors: John Reid
Venue: ACM SIGPLAN Fortran Forum (1992)

This paper is a summary and personal critique of [1]. The foreword ends with "Underlying all of the design decisions was the old saying: Keep it Simple, Stupid.". I am sorry to say that I think that the authors have failed in this objective. The document is 57 pages long and it is tough reading. I have a number of suggestions of ways that it can be simplified. None involve any loss of functionality or clarity, but some will mean a few more bytes in source codes.
Breaking the Frame-Buffer Bottleneck with Logic-Enhanced Memories
Authors: John Poulton, John Eyles, Steven Molnar, Henry Fuchs
Venue: IEEE Computer Graphics and Applications (1992)

Logic-enhanced memory chips that can remove the rasterizer/frame buffer bottleneck which limits the performance of current image-generation architectures are discussed. Putting pixel memory on-chip with rasterizing processors provides the two to three orders of magnitude improvement in access rates needed to support realistic shading models and aliasing in interactive systems. Current high-performance graphics systems and logic-enhanced memory architectural issues are reviewed. The design of the PixelFlow Enhanced Memory Chip (EMC), which exploits advances in semiconductor technology and circuit techniques to build compact, high-performance rasterizers, is described.
Exploiting parallelism through run-time analysis on a vector processor (abstract)
Authors: V. P. Krothapalli, P. Sadayappan
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

Several vendors such as Cray, Fujitsu, NEC supply vector processors that use pipelined functional units. A pipelined functional unit can extract parallelism by operating on a stream of operands simultaneously, with each stage in the pipeline working on a different set of operands. Users of these machines typically program in FORTRAN, and rely on an optimizing compiler (vectorizer) to extract parallelism. These compilers analyze loops in a program and generate a vector instruction for each type of operation that can be performed simultaneously on different elements of an array. When the independence of operations on different elements of an array is not compile-time determinable, as for example is the case with unstructured sparse matrix computations, these compilers generate scalar code. In this paper we propose a scheme based on run-time dependence analysis to vectorize loops with dependencies unknown at compile-time. Our approach analyses a loop at run-time by executing a skeleton of the loop and assigns a level to each operation. Operations that are independent of any other operations in the loop are given a level of one. Other operations are given a level one greater than the maximum of levels of all dependent operations. A vector instruction, using indirect operand access, is generated for all the operations of a given type at each level. The approach was evaluated by implementing a sparse triangular solver on one processor of a Cray X-MP. A number of sparse matrices derived from the application domain of circuit simulation were used. An improvement in performance ranging between 100-500.
Distributed program checking: a paradigm for building self-stabilizing distributed protocols (extended abstract)
Authors: Baruch Awerbuch, George Varghese
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

The notion of distributed program checking as a means of making a distributed algorithm self-stabilizing is explored. A compiler that converts a deterministic synchronous protocol pi for static networks into a self-stabilizing version of pi for dynamic networks is described. If T/sub pi / is the time complexity of pi and D is a bound on the diameter of the final network, the compiled version of pi stabilizes in time O(D+T/sub pi /) and has the same space complexity as pi . The general method achieves efficient results for many specific noninteractive tasks. For instance, solutions for the shortest paths and spanning tree problems take O(D) to stabilize, an improvement over the previous best time of O(D/sup 2/).
Mediators in the Architecture of Future Information Systems
Authors: Gio Wiederhold
Venue: Computer (1992)

For single databases, primary hindrances for end-user access are the volume of data that is becoming available, the lack of abstraction, and the need to understand the representation of the data. When information is combined from multiple databases, the major concern is the mismatch encountered in information representation and structure. Intelligent and active use of information requires a class of software modules that mediate between the workstation applications and the databases. It is shown that mediation simplifies, abstracts, reduces, merges, and explains data. A mediator is a software module that exploits encoded knowledge about certain sets or subsets of data to create information for a higher layer of applications. A model of information processing and information system components is described. The mediator architecture, including mediator interfaces, sharing of mediator modules, distribution of mediators, and triggers for knowledge maintenance, are discussed.
On the design of an expert help system for computer algebra systems
Authors: R. P. dos Santos, W. L. Roque
Venue: ACM SIGSAM Bulletin (1990)

REDUCE[2, 3], like many modern Computer Algebra Systems (CAS) (MACSYMA, MATHEMATICA, MAPLE, SCRATCHPAD to name a few), embodies a large amount of mathematical knowledge which is spread out through thousands of procedures in the source code of the system. Most of this knowledge is, however, in an implicit form almost inaccessible to the user, who would have to decipher the source files to recover it. Also, to profit from it one needs to know in addition the capabilities of these computing systems and how to operate them.
P-Functions-Ternary Logic Functions Capable of Correcting Input Failures and Suitable for Treating Ambiguities
Authors: Yoshinori Yamamoto, Masao Mukaidono
Venue: IEEE Transactions on Computers (1992)

The authors consider a new class of special ternary logic functions: the P-functions capable of correcting input failures, based on the regular ternary logic. There are three major results. First, the P-functions are a special subset of the regular functions with no information loss. Second a ternary logic function defined by the all-prime-implicant disjoint of any Boolean connective is a P-function. Third, a P-function may be identified from the irredundant disjunctive form. The relationship between P-functions and other meaningful ternary logic functions is discussed.
Use of intelligent computer aided instruction in the classroom (abstract)
Authors: Richard O'Lander
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

There is no question that computers are important technical tools in today's society. In education, computers can assist the student in learning. ICAI are systems which utilize the techniques of expert systems and artificial intelligence to help a person learn interactively. The basic view of these systems is that they serve as the student's private tutor, responding to the student's individual needs. Such systems have changed the structure of the classroom; the teacher is no longer the focal point of classroom activity. Rather, he serves as a guide for the student as he learns the material. Current trends also tend to support using such systems as an instructional aid in teaching mathematics. This has meant reorganizing the structure of the classroom. Each student and instructor has access to a terminal, and the time periods are restructured to allow for the use of this technology. Most of the systems developed were designed to teach mathematics or technical subjects. Current research indicates that such systems are successful in that the student learns the logic behind a particular concept. It is hoped that these logical thinking skills that are developed can be transferred to other subject areas. It should be noted that most of the studies were conducted with highly motivated students; many systems were designed for this type of student. In concept, this type of individualized instruction is well suited for the unmotivated and slow learner. To use this system for these types of students, ICAI systems will require modifications of the interface of the tutoring system and will require improved graphics interfaces to hold their interest. These systems will require close monitoring by the teacher.
The design of a RISC based multiprocessor chip
Authors: Rajiv Gupta, Michael Epstein, Michael Whelan
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

This paper describes the architecture of a RISC based multiprocessor chip. The processors operate in a MIMD fashion executing parallel instruction streams generated by a parallelizing compiler for the exploitation of fine-grained parallelism. Low cost synchronization mechanisms are supported in hardware. The resulting system is tolerant of unpredictable delays in the progress of individual streams. Instruction level parallelism is exploited through the use of register channels and a mechanism for the collective branching of processors. For efficient synchronization during parallel execution of loops, fuzzy barriers are provided. On chip memory is organized into multiple banks in order to provide sufficient bandwidth for the processors. The RISC processors are based upon the Sun SPARC architecture.
Fitting Parameterized Three-Dimensional Models to Images
Authors: David G. Lowe
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

Model-based recognition and motion tracking depend upon the ability to solve for projection and model parameters that will best fit a 3-D model to matching 2-D image features. The author extends current methods of parameter solving to handle objects with arbitrary curved surfaces and with any number of internal parameters representing articulation, variable dimensions, or surface deformations. Numerical stabilization methods are developed that take account of inherent inaccuracies in the image measurements and allow useful solutions to be determined even when there are fewer matches than unknown parameters. The Levenberg-Marquardt method is used to always ensure convergence of the solution. These techniques allow model-based vision to be used for a much wider class of problems than was possible with previous methods. Their application is demonstrated for tracking the motion of curved, parameterized objects.
Data manipulation in heterogeneous databases
Authors: Abhirup Chatterjee, Arie Segev
Venue: ACM SIGMOD Record (1991)

Many important information systems applications require access to data stored in multiple heterogeneous databases. This paper examines a problem in interdatabase data manipulation within a heterogeneous environment, where conventional techniques are no longer useful. To solve the problem, a broader definition for join operator is proposed. Also, a method to probabilistically estimate the accuracy of the join is discussed.
Fault-Tolerant Networks Based on the de Bruijn Graph
Authors: M. A. Sridhar, C. S. Raghavendra
Venue: IEEE Transactions on Computers (1991)

The authors introduce a novel class of networks based on the de Bruijn graph. These directed graphs are regular of degree, have N=k/sup n/ vertices for some n, and can tolerate up to k-2 node faults. Their fault-free diameter is n=log/sub k/N, and this is increases by at most 1 hop in the presence of k-2 faults. This class is very rich: for any given N=k/sup n/, one can construct at least 2/sup N/ different graphs. This is in sharp contrast to most other such constructions (including the de Bruijn graph), in which only one graph exists for each N. It is also shown how to implement certain algorithms on these networks.
Matching interval-valued-argument propositions in rule-based systems
Authors: Chris Merz, W. E. Bond, Dan St. Clair
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

Inference engines for rule-based systems attempt to match facts in working memory with rule antecedents. Rules for which matching can be performed are considered for execution (firing). Matching is well defined when the arguments of each proposition used in facts and rules can assume only a single value [Forgy 1982]. However, the matching of propositions whose arguments can assume interval values, interval-valued-argument propositions, requires expansion of the standard definition of pattern matching. The complexity of the problem is compounded by the fact that two intervals may be related in a number of ways. This paper describes a powerful knowledge representation which can be used for expressing interval-valued arguments. In addition, it specifies an approach for performing matching between interval-valued-argument propositions. This approach was inspired by the authors' need to perform matching on propositions whose arguments were ranges of real values and by J.F. Allen's work in temporal reasoning [Allen 1983]. It represents an expansion of current matching techniques. Several examples are provided to illustrate the power and utility of this approach. Many of these concepts have been implemented in a rule-based expert system shell called the Generalized Adaptive Learning Environment (GALE), a research tool being used to study machine learning in diagnostic expert systems.
An Incremental Deductive Strategy for Controlling Constructive Induction in Learning from Examples
Authors: Renée Elio, Larry Watanabe
Venue: Machine Learning (1991)

This article describes LAIR, a constructive induction system that acquires conjunctive concepts by applying a domain theory to introduce new features into the evolving concept description. Each acquired concept is added to the domain theory, making LAIR a closed-loop learning system that weakens the inductive bias with each iteration of the learning loop. LAIR's novel feature is the use of an incremental deductive strategy for constructive induction, reducing the amount of inference required for learning. A series of experiments manipulated features of learning tasks to assess this incremental method of constructive induction relative to an uncontrolled constructive induction process that extends each example description with all derivable features. These learning tasks differed in global characteristics of the domain theory, the training sequence, and the percentage of irrelevant features in the example descriptions. The results show that LAIR's constructive induction approach saves considerable inferencing effort, with little or no cost in the number of examples needed to reach a learning criterion. The experimental results also underscored the importance of viewing a domain theory as a search space, identifying several factors that impact the deductive and inductive aspects of constructive induction, such as concept definition overlap, density of features, and fan-in and fan-out of inference chains. The paper also discusses LAIR's operation as a pac-learner and its relation to other constructive induction techniques.