ppxscal/embedding_network huggingface dataset:
Human values and the future of technology: a declaration of responsibility
Authors: Ben Shneiderman
Venue: ACM SIGCHI Bulletin (1991)

"We must learn to balance the material wonders of technology with the spiritual demands of our human nature."---John Naisbitt (1982).We can make a difference in shaping the future by ensurin g that computers "serve human needs (Mumford, 1934)." By making explicit the enduring values that we hold dear we can guide computer system designers and developers for the next decade, century, and thereafter. After setting our high-level goals we can pursue the components and seek the process for fulfilling them.High-level goals might include peace, excellent health care, adequate nutrition, accessible education, communication, freedom of expression, support for creative exploration, safety, and socially constructive entertainment. Computer technology can help attain these high-level goals if we clearly state measurable objectives, obtain participation of professionals, and design effective human-computer interfaces. Design considerations include adequate attention to individual differences among users, support of social and organizational structures, design for reliability and safety, provision of access by the elderly, handicapped, or illiterate, and appropriate user controlled adaptation. With suitable theories and empirical research we can achieve ease of learning, rapid performance, low error rates, and good retention over time, while preserving high subjective satisfaction.To raise the consciousness of designers and achieve these goals, we must generate an international debate, stimulate discussions within organizations, and interact with other intellectual communities. This paper calls for a focus on the "you" and "I" in developing improved user interface (UI) research and systems, offers a Declaration of Responsibility, and proposes a Social Impact Statement for major computing projects.
A multi-layer router utilizing over-cell areas
Authors: Evagelos Katsadas, Edwin Kinnen
Venue: Proceedings of the 27th ACM/IEEE Design Automation Conference (1991)

A new methodology is presented for the solution of the multilayer routing problem that has the potential to outperform channel based multi-layer routing algorithms by expanding the routing regions to include areas over the cells. It is assumed that four routing layers are available. Routing is completed in two steps; a selected group of nets is routed in the between-cell areas using existing channel routing algorithms and the first two routing layers. Then the remaining nets are routed over the entire layout area, between-cell and over-cell areas, using a new two-dimensional router and the next two routing layers. The router used for over-cell routing recognizes arbitrarily sized obstacles, for example, due to power and ground routing or sensitive circuits in the underlying cells. The proposed router was tested on a number of macro-cell layout examples. Advantages of dedicating two routing layers for over-cell routing is illustrated. Results show a significant reduction in total layout area, wire length and number of via when compared to results obtained using two-layer or multi-layer channel routing methods.
Fast parallel implementation of lazy languages&mdash;the EQUALS experience
Authors: O. Kaser, S. Pawagi, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar
Venue: Proceedings of the 1992 ACM conference on LISP and functional programming (1992)

This paper describes EQUALS, a fast parallel implementation of a lazy functional language on a commercially available shared-memory parallel machine, the Sequent Symmetry. In contrast to previous implementations, we detect parallelism automatically by propagating exhaustive (normal form) demand. Another important difference between EQUALS and previous implementations is the use of reference counting for memory management instead of garbage collection. Our implementation shows that reference counting leads to very good scalability, low memory requirements and improved locality. We compare our results with sequntial SML/NJ as well as parallel (v, G-machine and GAML implementations.
Integrating syntax and semantics into spoken language understanding
Authors: Lynette Hirschman, Stephanie Seneff, David Goodine, Michael Phillips
Venue: Proceedings of the workshop on Speech and Natural Language (1991)

This paper describes several experiments combining natural language and acoustic constraints to improve overall performance of the MIT VOYAGER spoken language system. This system couples the SUMMIT speech recognition system with the TINA language understanding system to answer spoken queries about navigational assistance in the Cambridge, MA, area. The overall goal of our research is to combine acoustic, syntactic and semantic knowledge sources. Our first experiment showed improvement by combining acoustic score and parse probability normalized for number of terminals. Results were further improved by the use of an explicit rejection criterion based on normalized parse probabilities. The use of the combined parse/acoustic score, together with the rejection criterion, gave an improvement in overall score of more than 33% on both training and test data, where score is defined as percent correct minus percent incorrect. Experiments on a fully integrated system which uses the parser to predict possible next words to the recognizer are now underway.
TWIST-TOP: transputers with I-stores test out processor
Authors: George S. Davidson
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

Future parallel computing systems will require high speed communication, efficient synchronization primitives, and low overhead context switches for communicating and synchronizing instruction streams. These issues are developed with respect to I-storage, a global memory that can synchronize requests for data values issued before the data is produced. Methods to implement these I-stores are described for the transputer architecture, with programs and timing results. This description, for both single and multiprocessors, includes a discussion of run-time systems requiring no extra hardware. However, simple hardware extensions are also proposed, which will provide faster implementations. This hardware is expected to be much less expensive than a custom dataflow machine, allowing a larger research community to experiment with dataflow languages and applications.
An algorithm for solving parametric linear systems
Authors: William Y. Sit
Venue: Journal of Symbolic Computation (1992)

We present a theoretical foundation for studying parametric systems of linear equations and prove an efficient algorithm for identifying all parametric values (including degenerate cases) for which the system is consistent. The algorithm gives a small set of regimes where for each regime, the solutions of the specialized systems may be given uniformly. For homogeneous linear systems, or for systems where the right hand side Is arbitrary, this small set is irredundant. We discuss in detail practical issues concerning implementations, with particular emphasis on simplification of results, Examples are given based on a close implementation of the algorithm in SCRATCHPAD II. We also give a complexity analysis of the Gaussian elimination method and compare that with our algorithm.
Fault-Tolerance Analysis of One-Sided Crosspoint Switching Networks
Authors: Anujan Varma, Suresh Chalasani
Venue: IEEE Transactions on Computers (1992)

The fault-tolerance capability of one-sided crosspoint networks is analyzed with respect to crosspoint faults. Because of the correspondence between one-sided crosspoint networks and multiple-bus interconnection networks, the analysis also applies to multiple-bus configurations, where M buses are used to interconnect N processors. Upper bounds are established on the size of a fault set to sustain a given level of connectivity. Two modes of operation are considered, namely, nonblocking and rearrangeable. A complete nonblocking switch matrix with N ports has N/sup 2//2 crosspoints. It is shown that at most N/2-1 faulty crosspoints can be tolerated in the case of nonblocking operation.
The BACK system&mdash;an overview
Authors: Christof Peltason
Venue: ACM SIGART Bulletin (1991)

The BACK project was begun at the Technical University Berlin in January 1985 as part of a larger project within the ESPRIT programme1. Our task in the project group was the specification, design and implementation of a knowledge representation system which we called BACK ("Berlin Advanced Computational Knowledge Representation System"). It is a based on a terminological logic (term description language) and supports complex representation of a domain terminology, description of domain objects using that terminology, and database access via a uniform interface language.
On expert database systems (abstract)
Authors: Chung Chen-Hwa, Christos Nikolopoulos
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

A deductive or expert database system (EDS) is the product of the combination of a logic programming system (LPS) and a database management systems (DBMS). One approach in designing an EDS would be to add database facilities in a LPS by implementing new predicates. For example, the basic relational algebra operations union, intersection, join, selection, projection and hence relational DML can be implemented in PROLOG ([2]). Unfortunately, other aspects of a DBMS, like DDL, concurrency, sophisticated indexing, security, data integrity and query optimization are very difficult to implement in a logic programming environment like PROLOG. Another difficulty is that most LPS are in-memory systems, i.e. all information is loaded in memory before execution. No storage management concurs unless the operating system supports paging. An interface between an existing DBMS and a LPS seems to provide a solution ([1]). We present such an interface and a method of storing both facts and rules in the DB MS, if the size of the knowledge base is prohibitive. For a small size database, we could simply retrieve all the relations which correspond to rule predicates before execution. But if we deal with very large amounts of information we need the secondary storage management capabilities of a DBMS. To reduce communication cost, we propose a technique which allows us to avoid repeating the same database query every time a predicate needs to go through unification.
The Rochester Checkers Player: Multimodel Parallel Programming for Animate Vision
Authors: Brian Marsh, Chris Brown, Thomas LeBlanc, Michael Scott, Tim Becker, Cesar Quiroz, Prakash Das, Jonas Karlsson
Venue: Computer (1992)

It is maintained that to exploit fully the parallelism inherent in animate vision systems, an integrated vision architecture must support multiple models of parallelism. To support this claim, the hardware base of a typical animate vision laboratory and the software requirements of applications are described. A brief overview is then given of the Psyche operating system, which was designed to support multimodel programming. A complex animate vision application, checkers, constructed as a multimodel program under Psyche, is also described. Checkers demonstrates the advantages of decomposing animate vision systems by function and independently selecting an appropriate parallel-programming model for each function.
Computing sums of radicals in polynomial time
Authors: Johannes Blömer
Venue: Proceedings of the 32nd annual symposium on Foundations of computer science (1991)

For a certain sum of radicals the author presents a Monte Carlo algorithm that runs in polynomial time to decide whether the sum is contained in some number field Q( alpha ), and, if so, its coefficient representation in Q( alpha ) is computed. As a special case the algorithm decides whether the sum is zero. The main algorithm is based on a subalgorithm which is of interest in its own right. This algorithm uses probabilistic methods to check for an element beta of an arbitrary (not necessarily) real algebraic number field Q( alpha ) and some positive rational integer r whether there exists an rth root of beta in Q( alpha ).
Interprocedural static analysis of sequencing constraints
Authors: Kurt M. Olender, Leon J. Osterweil
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (1992)

This paper describes a system that automatically performs static interprocedural sequencing analysis from programmable constraint specifications. We describe the algorithms used for interprocedural analysis, relate the problems arising from the analysis of real-world programs, and show how these difficulties were overcome. Finally, we sketch the architecture of our prototype analysis system (called Cesar) and describe our experiences to date with its use, citing performance and error detection characteristics.
Deciding finiteness of matrix groups in Las Vegas polynomial time
Authors: László Babai
Venue: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (1992)

Let G be a group of matrices with integer entries, given by a list of generators. It is known that membership in such a group is undecidable, even for 4 x 4 integral matrices [Mi]. In this paper we show that one can decide whether or not G is finite, in Las Vegas polynomial time. The key estimate derived makes the entire &ldquo;black box group&rdquo; theory ([BSz], [BCFLS], [Ba2], [BKL]) applicable to the finite groups of integral matrices. In particular it follows that in this case, structural properties such as solvability and nilpotence are decidable in Monte Carlo polynomial time; and membership, order, isomorphism, and a host of other problems are in the relatively low complexity class AM &cap; coAM [Ba1]. We give two algorithms. The simpler one (Monte Carlo but not Las Vegas) employs a refinement of the random walk technique over groups, developed in [Ba3] (applied here to infinite groups). The termination rule rests on a new estimate on the bit-size of the elements of finite groups G, obtained via polynomial time symbolic manipulation of representations over algebraic number fields using results of [BR]. This symbolic manipulation technique is the basis of the Las Vegas algorithm. (A Las Vegas algorithm is a rnadomized algorithm which never errs; but with small probability, it may r eport failure.)
Spoken letter recognition
Authors: Ronald Cole, Mark Fanty
Venue: Proceedings of the workshop on Speech and Natural Language (1990)

Automatic recognition of spoken letters is one of the most challenging tasks in the field of computer speech recognition. The difficulty of the task is due to the acoustic similarity of many of the letters. Accurate recognition requires the system to perform <i>fine phonetic distinctions,</i> such as B vs. D, B vs. P, D vs. T, T vs. G, C vs. Z, V vs. Z, M vs. N and J vs. K. The ability to perform fine phonetic distinctions---to discriminate among the minimal sound units of the language---is a fundamental unsolved problem in computer speech recognition.
Semantics in object-oriented data models (abstract)
Authors: Stevan Mrdalj, Asad Khailany
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

Although object-oriented data models as a design tool for software development products is promising, nevertheless the semantics provided by the current contemporary object-oriented data models do not adequately support the design, evolution, and reuse of complex information systems. The semantic expressiveness of the abstraction techniques such as encapsulation, inheritance, and messaging for modeling application environment employee an overly simple object structures. The use of these simple object structures limit the capabilities of these techniques to describe the meaning of these systems which inevitably cause the loss of the information about the system. In this paper we present an object-oriented model which is based on structural constructs that are highly user-oriented and expressive of the application environment. Such as object-oriented model provide a rich set of mechanisms to allow the direct modeling of system semantics. Therefore, our goal is to establish a necessary set of semantic concepts for object-oriented data models that will enable the designer to naturally and directly incorporate more of the semantics of a system into its model. Such a semantics-based object-oriented data model will support: (1) Natural and efficient description of complex object structure; (2) Explicitly express relationships between objects; (3) Explicitly express extensive integrity constraints and exceptions on relationships between objects; (4) Express different levels of abstractions which allow the user to see objects from an operational or a structural view. Finally, we discuss reusability and extensibility of such a semantic object-oriented data model.
A two dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system
Authors: Keqin Li, Kam Hoi Cheng
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

The system partitioning problem in a partitionable mesh connected system (PMCS) is addressed. A two dimensional buddy system (2DBS) is proposed as a partitioning scheme for dynamic resource allocation in a PMCS. Allocation and reclamation algorithms and the method for locating buddies are designed. Internal fragmentation of our proposed 2DBS under various probability distributions of job sizes is analyzed. Experimental results on external and total fragmentations are also presented.
Stimulus-response machines: an Ada-based graphic notation for specifying, designing, and implementing reactive or interactive systems
Authors: George W. Cherry
Venue: ACM SIGAda Ada Letters (1991)

This paper describes Stimulus-Response (S-R) Machines, a new visual formalism based on the semantics of Ada. S-R Machines are SCOOP-3's [2] main medium for specifying and implementing critical units of behavior. They have the same motivation as Harel's Statecharts [3]: to manage the unstructured explosion of blobs and arrows that occur on complex State Transition Diagrams. S-R Machines add to Ada's semantics a named off-page abstraction mechanism called "boxes." Boxes are used to decompose S-R Machines into hierarchies of states (goals, steps, conditions, or modes), each of which can be easily verified. S-R Machines are similar to Harlan Mills' Box-Structured Systems [4]: our interfaces are identical to his black boxes; our bodies are similar to his state and clear boxes. Because S-R Machines combine the familiar features of dataflow diagrams, object-message diagrams, and structured flowcharts, its notation is easy to learn. S-R Machines are useful when developing state-rich safety-critical systems or whenever understanding or communication are problematical or critical (e.g., educational settings and software inspections).
A methodology for detecting shared variable dependencies in logic programs
Authors: B. Schend
Venue: Journal of Symbolic Computation (1991)

AND-parallel execution of logic programs turns out to be an intricate matter whenever clause literals are linked by shared variables. Shared variable dependencies call for special precautions to prevent processes from computing inconsistent bindings while working on clause literals simultaneously. Therefore, most systems restrict AND-parallelism to its producer/consumer style by allowing only independent literals to run in parallel. These literals then act as producers of variable bindings which will be consumed by dependent literals in subsequent steps. However, to implement producer/consumer parallelism efficiently, appropriate methods must be available for detecting dependencies caused by shared variables. Concerning such dependencies this paper presents a methodology which may serve as a basis for efficient dependency checking by performing compile and run-time analysis of program clauses.
Performance Analysis of Multiple Bus Interconnection Networks with Hierarchical Requesting Model
Authors: Wen-Tsuen Chen, Jang-Ping Sheu
Venue: IEEE Transactions on Computers (1991)

The authors study the performance of multiprocessor systems employing multiple buses as the interconnection networks under a nonuniform requesting model, called the hierarchical requesting model. The effective memory bandwidth is chosen as the performance measure. The networks investigated include multiple bus networks with full bus-memory connection, multiple bus networks with single bus-memory connection, and multiple bus networks with partial bus-memory connection. The authors also propose a type of multiple bus network with partial bus-memory connection, called partial bus networks with K classes. The N costs and fault-tolerant capabilities of the multiple bus networks are also evaluated and compared to one another. It is shown that the partial bus networks with K classes are useful in applications requiring high performance and degree of fault tolerance with moderate cost.
Fortran 90 arrays
Authors: Robert Bernecky
Venue: ACM SIGPLAN Notices (1991)

Excellent application performance should not require tour de force programming efforts by users. Fortran 90 in an attempt to bring it from a scalar orientation into an array notation, has adopted some of the early concepts of APL, such as array operations. The introduction of these ideas is shown to be inadequate meeting the algorithmic needs of programmers, in terms of expressiveness, consistency, and conciseness. Comparisons with APL show Fortran 90 to be a mongrel, neither scalar- nor array-oriented, unable achieve the levels of productivity, performance, reliability, and maintainability required by computer users in the 1990s.
Micro Time Cost Analysis of Parallel Computations
Authors: Bin Qin, Howard A. Sholl, Reda A. Ammar
Venue: IEEE Transactions on Computers (1991)

The authors investigate the modeling and analysis of time cost behavior of parallel computations. It is assumed parallel computations reside in a computer system in which there is a limited number of processors, all the processors have the same speed, and they communicate with each other through a shared memory. It has been found that the time costs of parallel computations depend on the input, the algorithm, the data structure, the processor speed, the number of processors, the processing power allocation, the communication, the execution overhead, and the execution environment. The authors define time costs of parallel computations as a function of the first seven factors as listed. The computation structure model is modified to describe the impact of these seven factors on time cost. Techniques based on the modified computation structure model are developed to analyze time cost. A software tool, TCAS (time cost analysis system), that uses both the analytic and the simulation approaches is designed and implemented to aid users in determining the time cost behavior of their parallel computations.
A Generalized Depth Estimation Algorithm with a Single Image
Authors: Shang-Hong Lai, Chang-Wu Fu, Shyang Chang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

A depth estimation algorithm proposed by A.P. Pentland (1987) is generalized. In the proposed algorithm, the raw image data in the vicinity of the edge is used to estimate the depth from defocus. Since no differentiation operation on the image data is required before the optimization process, the method is less sensitive to the noise disturbance of measurements. Furthermore, the edge orientation that was critical in Pentland's approach will not be required in the case. This algorithm is then applied to synthetic images containing various amounts of noise to test its performance. Experimental results indicate that the depth estimation errors are kept within 5% of true values on the average when it is applied to real images.
Hawaii international conference on system sciences
Authors: E. Eugene Schultz
Venue: ACM SIGCHI Bulletin (1992)

On January 8 - 10, 1992, I attended the 25th Annual Hawaii International Conference on System Sciences. One of the main reasons I attended is that I helped organize the User Interface Track of this conference, and also was scheduled to chair several paper sessions.