ppxscal/embedding_network huggingface dataset:
Graphic StoryWriter: an interactive environment for emergent storytelling
Authors: Karl E. Steiner, Thomas G. Moher
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

The Graphic StoryWriter (GSW) is an interactive system that enables its users to create structurally complete stories through the manipulation of graphic objects in a simulated storybook. A rule-based story engine manages character and prop interaction, guides story development, and generates text. Through the simple interface and story writing engine, the Graphic StoryWriter provides an environment for early readers to learn about story structures, to experience the relationship between pictures and text, and to experiment with causal effects. This paper describes the motivation for and design of the Graphic StoryWriter, and reports on an empirical comparison of childrens' stories generated orally and using the GSW.
Using scientific experiments in early computer science laboratories
Authors: Doug Baldwin, Johannes A. G. M. Koomen
Venue: Proceedings of the twenty-third SIGCSE technical symposium on Computer science education (1992)

Computer science is an experimental science, in the same sense that biology or physics are experimental sciences. Nonetheless, lab exercises for CS1 and CS2 courses are almost never formal &ldquo;experiments&rdquo; as the term would be understood in any other science. This paper describes our experiences using formal experiments in CS1 and 2 laboratories. Such exercises are extremely valuable, in part because they help students relate abstract concepts to concrete programs, but more importantly because they lead students into new areas of computing, and even new forms of learning.
Hankel matrices and computer algebra
Authors: Juan R. Sendra
Venue: ACM SIGSAM Bulletin (1990)

In this paper we show some results concerning symbolic manipulation of Hankel matrices, as well as some applications of these matrices to Computer Algebra. We present algorithmic approaches, based on Hankel matrices, to the calculation of multivariate polynomial resultants, to polynomial gcd computations including the extended polynomial gcd problem, to modular factorization and to the determination of the number of distinct real roots of a real polynomial. The computing time analysis shows that the three first applications have the same asymptotic complexity as the currently fastest algorithm for these problems, and that the last one runs in O(n5 log2 L) where n is the degree of the polynomial, and L its norm.
A global illumination solution for general reflectance distributions
Authors: Françis X. Sillion, James R. Arvo, Stephen H. Westin, Donald P. Greenberg
Venue: ACM SIGGRAPH Computer Graphics (1991)

A general light transfer simulation algorithm for environments composed of materials with arbitrary reflectance functions is presented. This algorithm removes the previous practical restriction to ideal specular and/or ideal diffuse environments, and supports complex physically based reflectance distributions, This is accomplished by extending previous two-pass ray-casting radiosity approaches to handle non-uniform intensity distributions, and resolving all possible energy transfers between sample points. An implementation is described based on a spherical harmonic decomposition for encoding both bidirectional reflectance distribution functions for materials, and directional intensity distributions for illuminated surfaces. The method compares favorably with experimental measurements.
Getting advice from a computer: five models and a simulator
Authors: Paul S. Licker
Venue: ACM SIGMIS Database (1991)

This article introduces a simulation system---CARMART---that is useful in teaching and research in computer-based advising. Advising is seen as a contributor to the activity of concluding a set of actions. This article develops an extended model of concluding based on Simon's three stage model of decision making.A typology of advising situations is developed detailing five increasingly powerful advising situations: 1) contextualization 2) data query and report facilities (MIS); 3) consultant advice on past history (CS); 4) logical models; and 5) mathematical models (DSS). This scale is based on the degree of assist to the concluder and the amount of pre-existing knowledge necessary to construct and use valid models in providing the advice.CARMART provides a vehicle for teaching students about these four modes of advising, given a specific 19-factor description requiring a decision from the student concerning sales technique. In addition, CARMART is helping to test hypotheses about the applicability of each mode of advising to situations which differ in the ease of access to systematic knowledge. A relationship between the kind of advice required and the stage of concluding is posited and explored.
A Cost Minimization Approach to Edge Detection Using Simulated Annealing
Authors: Hin Leong Tan, Saul B. Gelfand, Edward J. Delp
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

The authors cast edge detection as a problem in cost minimization. This is achieved by the formulation of a cost function that evaluates the quality of edge configurations. The function is a linear sum of weighted cost factors. The cost factors capture desirable characteristics of edges such as accuracy in localization, thinness, and continuity. Edges are detected by finding the edge configurations that minimize the cost function. The authors give a mathematical description of edges and analyze the cost function in terms of the characteristics of the edges in minimum cost configurations. Through the analysis, guidelines are provided on the choice of weights to achieve certain characteristics of the detected edges. The cost function is minimized by the simulated annealing method. A set of strategies is presented for generating candidate states and to devise a suitable temperature schedule.
Design of charging mechanisms according to the interaction between information technology type and diffusion lifecycle phase
Authors: Nava Pliskin, Tsilia Romm
Venue: ACM SIGMIS Database (1991)

The prescriptive literature on charging for information technologies considers two main objectives that are served by access charges and use charges: cost recovery and regulation of computing resource utilization. Recently, researchers in the field have suggested that designers of charging mechanisms must also pay attention to the type of information technology and to the phase of the diffusion lifecycle. Specifically, innovation-oriented organizations have been advised to design liberal low charges either for communication technologies or during the technology initiation phase.The contribution of this paper is twofold. First, it organizes published recommendations under one conceptual framework, whereby charging is adapted according to both the technology type and the phase of the diffusion lifecycle. Second, where diffusion patterns are most sensitive to the charging policy, i.e., for communication technologies during the initiation and perhaps even the adaptation phase of the lifecycle, we go beyond existing recommendations and advocate negative charging. Mini-cases serve to illustrate the various recommended charging options.
XINIX time-sharing operating system
Authors: Jorge Buenabadd Chávez
Venue: ACM SIGOPS Operating Systems Review (1991)

The availability of the source code of a running real operating system is essential for teaching a practical course on Operating Systems. This, and the wide-spread use of PC-XT computers were the main reasons for transporting the XINU operating system to these computers. This paper describes the features, additions and constraints of this transportation, named XINIX.
Using Larch to Specify Avalon/C++ Objects
Authors: J. M. Wing
Venue: IEEE Transactions on Software Engineering (1990)

A formal specification of three base Avalon/C++ classes - recoverable, atomic, and subatomic - is given. Programmers derive from class recoverable to define persistent objects, and from either class atomic or class subatomic to define atomic objects. The specifications, written in Larch, provide the means for showing that classes derived from the base classes implement objects that are persistent or atomic and thus exemplify the applicability of an existing specification method to specifying nonfunctional properties. Writing these formal specifications for Avalon/C++'s built-in classes has helped to clarify assumptions explicit, and to characterize complex properties of objects.
Tetrahedrizing point sets in three dimensions¿
Authors: H. Edelsbrunner, F. P. Preparata, D. B. West
Venue: Journal of Symbolic Computation (1990)

This paper offers combinatorial results on extremum problems concerning the number of tetrahedra in a tetrahedrization of n points in general position in three dimensions, i.e. such that no four points are co-planar, It also presents an algorithm that in O(n log n) time constructs a tetrahedrization of a set of n points consisting of at most 3n-11 tetrahedra.
An iterative solution to the four-peg Tower of Hanoi problem
Authors: Appie van de Liefvoort
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

One of the variations of the Towers of Hanoi puzzle allows for p pegs, and for four pegs the solution to this variation is shown to have a simple structure which can be used to derive an iterative solution to the problem.
High performance preconditioning on supercomputers for the 3D device simulator MINIMOS
Authors: K. P. Traar, W. Mader, O. Heinreichsberger, S. Selberherr, M. Stiftinger
Venue: Proceedings of the 1990 ACM/IEEE conference on Supercomputing (1990)

Discretization and iterative solution of the semiconductor equations in a three-dimensional rectangular region lead to very large sparse linear systems. Nevertheless, design engineers and scientists of device physics need reliable results in short time in order to draw the best advantage out of computer simulation when designing new technologies and advanced devices. This goal can be achieved by use of pre-conditioned iterative methods for the solution of the linear equations on powerful computers as vector and concurrent supercomputers. To achieve optimum performance of such methods special algorithms and coding techniques have to be used in order to allow vectorization and parallelization of the inherent recurrence relations. We have investigated Jacobi and incomplete LU-factorization methods along with various hand tuning options with special emphasis on application on a SIEMENS/Fujitsu VP200. Results are compared with those obtained on a Cray-2 and an ALLIANT/FX40 minisupercomputer.
Parallel Recognition and Parsing on the Hypercube
Authors: Oscar H. Ibarra, Ting-Chuen Pong, Stephen M. Sohn
Venue: IEEE Transactions on Computers (1991)

The authors present parallel algorithms for recognizing and parsing context-free languages on the hypercube. This algorithm is both time-wise and space-wise optimal with respect to the usual sequential dynamic programming algorithm. Also, the number of nonoverlapping interprocessor data transmissions for the recognition phase is small. It is noted that this is desirable since communication cost in reality is a function of the number of transmissions as well as transmission length. The authors present another recognition algorithm that achieves the same time and space bounds but employs a dynamic loading balancing technique to increase processor utilization. The results of implementing these algorithms on a 64-node NCUBE/7 MIMD hypercube machine are also given. The experimental evidence indicates that, while both recognition algorithms exhibit acceptable speedups, using load balancing results in significantly better performance. The authors obtain parallel algorithms with the same time and space bounds as above for the polygon triangulation problem and the matrix product chain problem.
Programming time in multimedia user interfaces
Authors: Nuno M. Guimarães, Nuno Correia, Telmo A. Carmo
Venue: Proceedings of the 5th annual ACM symposium on User interface software and technology (1992)

The new media types used in advance user interfaces and interactive systems introduce time as a significant variable. This paper addresses the architectural support and programming tools that should be provided to the programmer to manage the time dependencies. The approach considers that the basic models and programming paradigms adopted in the manipulation and management of time should be isomorphic with the spatial models used in existing graphical user interfaces. The paper describes the architectural principles of a toolkit designed to support the construction of user interfaces with temporal characteristics. The Ttoolkit is an extension of an existing graphical user interface toolkit, the Xt toolkit. Its design is presented and a sample application is described.
Approximating the minimum weight triangulation
Authors: David Eppstein
Venue: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1992)

In O(n log n) time we compute a triangulation with O(n) new points, and no obtuse triangles, that has length within a constant factor of the minimum possible. We also approximate the minimum weight Steiner triangulation using triangulations with no sharp angles. No previous polyonomial time triangulation achieved an approximation factor better than O(log n).
The metadatabase project at Rensselaer
Authors: Cheng Hsu
Venue: ACM SIGMOD Record (1991)

The Metadatabase project is a multi-year research effort at Rensselaer Polytechnic Institute. Sponsored by industry (ALCOA, DEC, GE, CM, IBM and other) through Rensselaer's Computer Integrated Manufacturing Program, this project seeks to develop novel concepts, methods and techniques for achieving information integration across major functional systems pertaining to computerized manufacturing enterprises. Thus, the metadatabase model emcompasses the generic tasks of heterogeneous, distributed, aand autonomous databases administration, but also includes information resources management and integration of concurrent (functional) systems. The model entails (1) an integrated data and knowledge modeling and representation method; (2) an online kernel (the metadatabase) for information modeling and management; (3) metadatabase assisted global query formulation and processing; (4) a concurrent architectural whereby global synergies are achieved through (distributed) metadata management rather than synchronization of (distributed) database processing; and (5) a theory of information requirements for integration. A metadatabase prototype was recently demonstrated to the industrial sponsors. The basic concept of the metadatabase model is discussed in this paper.
Minimizing External Wires in Generalized Single-Row Routing
Authors: Jean R. S. Blair, Errol L. Lloyd
Venue: IEEE Transactions on Computers (1992)

Much of the recent work on the automated design of VLSI chips has concentrated on routing problems associated with such designs. One major class of routing problems focuses on single-row routing. Recently, the traditional single-row routing model has been generalized to allow external wires. Under this generalized model, it is possible to route many more single-row routing instances than in the traditional model. There is, however, a clear disadvantage in the use of external wires, since they force a lengthening of the channels surrounding the single row of terminals. Thus, it is desirable for these generalized single-row routings to use a minimum number of external wires. A linear-time algorithm for determining the minimum number of external wires needed to route a given instance of single-row routing is provided here.
A cache multitasking model
Authors: Makoto Kobayashi
Venue: ACM SIGMETRICS Performance Evaluation Review (1992)

A hierarchical program behavior model in a multitasking environment was proposed and applied to a cache multitasking model for performance evaluation. The hierarchical program behavior model consists of the task switching model, execution interval model, and the line (block) reference behavior model for each individual task. An execution interval is a continuous execution of a task between task switches. As a task executes in an execution interval, it brings its lines into a cache according to the line reference behavior model. The Stack Growth Function (SGF) model was used for this purpose. The state of a cache is defined by the numbers of lines of the individual tasks. The state of a cache at task switches then constitutes an imbedded Markov chain. Although a set of simultaneous linear equations in steady state cannot exactly be solved practically because of its excessively large state space, it can be solved very efficiently by a Monte-Carlo simulation. The model was validated against the miss rate measured by a hardware monitor in a controlled environment on a mainframe running IBM MVS operating system.
Fast recognition of doubly transitive groups
Authors: P. J. Cameron, J. Cannon
Venue: Journal of Symbolic Computation (1991)

The availability of the classification of finite simple groups allows us to design algorithms for identifying the composition factors of finite groups. This paper presents an algorithm which identifies any finite doubly transitive permutation group G. If we exclude the 2-transitive subgroups of the one-dimensional affine group and 14 small exceptional groups, the cost of our algorithm is essentially the cost of constructing a base and strong generating set for G. Consequently, our algorithm avoids the need to compute the soluble residual of G as required by Kantor's composition factors algorithm for a general permutation group.
Teaching experienced developers to design graphical user interfaces
Authors: Jakob Nielsen, Rita M. Bush, Tom Dayton, Nancy E. Mond, Michael J. Muller, Robert W. Root
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

Five groups of developers with experience in the design of character-based user interfaces were taught graphical user interface design through a short workshop with a focus on practical design exercises using low-tech tools derived from the PICTIVE method. Several usability problems were found in the designs by applying the heuristic evaluation method, and feedback on these problems constituted a way to make the otherwise abstract usability principles concrete for the designers at the workshop. Based on these usability problems and on observations of the design process, we conclude that object-oriented interactions are especially hard to design and that the developers were influenced by the graphical interfaces of personal computers with which they had interacted as regular users.
An annotated bibliography of computer supported cooperative work
Authors: Saul Greenberg
Venue: ACM SIGCHI Bulletin (1991)

Computer-supported cooperative work (CSCW) is a new multi-disciplinary field with roots in many disciplines. Due to the area's youth and diversity, few specialized books or journals are available, and articles are scattered amongst diverse journals, proceedings and technical reports. Building a CSCW reference library is particularly demanding, for it is difficult for the new researcher to discover relevant documents. To aid this task, this article compiles, lists and annotates some of the current research in computer supported cooperative work into a bibliography. Over 300 references are included.
Arithmetic Interpolation Search for Alphabet Tables
Authors: Yehoshua Perl, Loizos Gabriel
Venue: IEEE Transactions on Computers (1992)

The inefficiency of interpolation search for an alphabetic table has been demonstrated by F.W. Burton and G.N. Lewis (1980). This inefficiency is expected since such tables are usually far from uniform in distribution. However, for nonuniformly distributed tables for which the cumulative distribution function F is known, applying F to the keys yields uniform distribution for which interpolation search is very fast. In arithmetic coding a string of characters is mapped into the (0, 1) interval according to the probabilities of its characters. It is found that this transformation, designed for data compression, is actually the cumulative distribution function F for alphabetic tables. Experiments confirm that interpolation search on alphabetic tables, applying arithmetic coding to the character strings in a sophisticated way, shows a performance very close to lg lg n accesses. Hence, a new fast search technique for alphabetic tables is designed.
Human-computer interaction research at Georgia Institute of Technology
Authors: James D. Foley, Christine M. Mitchell, Neff Walker
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

HCI research at Georgia Tech is found in three cooperating groups: the Engineering Psychology and Experimental Psychology Programs in the School of Psychology, the Center for Human-Machine Systems Research in the School of Industrial and Systems Engineering, and the interdisciplinary Graphics, Visualization and Usability (GVU) Center. We cooperate via cross-listed courses, having students in one area take a minor in another area, collaborative research projects, serving on Ph. D. committees, joint colloquia and brown bag lunches, and joint appointments. The GVU Center (housed in the College of Computing) and Cognitive Science Program (sponsored by Psychology, Industrial and Systems Engineering, and the College of Computing) involves a number of the same faculty, further enhancing our collaborations.
High-speed local area networks and their performance: a survey
Authors: Bandula W. Abeysundara, Ahmed E. Kamal
Venue: ACM Computing Surveys (CSUR) (1991)

At high data transmission rates, the packet transmission time of a local area network (LAN) could become comparable to or less than the medium propagation delay. The performance of many LAN schemes degrades rapidly when the packet transmission time becomes small comparative to the medium propagation delay. This paper introduces LANs and discusses the performance degradation of LANs at high speeds. It surveys recently proposed LAN schemes designed to operate at high data rates, including their performance characteristics desirable in LAN medium access protocols are identified and discussed. The paper serves as a tutorial for readers less familiar with local computer communication networks. It also serves as a survey of the state-of-the-art LANs.
Investigating a hybrid perturbation-Galerkin technique using computer algebra
Authors: Carl M. Andersen, James F. Geer
Venue: Journal of Symbolic Computation (1991)

A two-step hybrid perturbation-Galerkin method is investigated using computer algebra. The technique is applicable to a variety of differential equation type problems which involve a scalar parameter. An approximate solution is sought in the form of a sum where each term consists of the product of two functions. The first is a function of the independent field variable(s) x, and the second is a function of the parameter @l. In step one the functions of x are determined by forming a perturbation expansion in @l. In step two the functions of @l are determined through the use of the classical Bubnov-Galerkin method. This hybrid technique has the potential of overcoming some of the drawbacks of the perturbation and Bubnov-Galerkin methods applied separately, while combining some of the good features of each. In order to help investigate some of the properties of the approximate solutions generated by the hybrid technique, the technique is applied with the aid of computer algebra to a simple two-point boundary-value problem where the radius of convergence is finite and to a quantum eigenvalue problem where the radius of convergence is zero. For both problems the hybrid solutions are useful well beyond the radius of convergence associated with the perturbation expansion. Furthermore, for the first problem we demonstrate convergence for all values of the parameter. The role of computer algebra in applying and studying the hybrid technique is discussed.