ppxscal/embedding_network huggingface dataset:
Processing of cross-sectional image data for reconstruction of human developmental anatomy from museum specimens
Authors: Michael D. Doyle, Cheong Ang, Rakesh Raju, Gary Klein, Betsey S. Williams, Thomas DeFanti, Ardeshir Goshtasby, Robert Grzesczuk, Adrianne Noe
Venue: ACM SIGBIO Newsletter (1993)

A project is described (The Visible Embryo Project) to develop software strategies for the creation of large-scale databases of 3-dimensional image data on human developmental anatomy. The issues discussed relate to the processing of serial-section image data for the purpose of reconstructing volumetric models of individual embryos from museum specimens. Attempts were made to fully automate the processes of image registration and artifact correction, in order to allow for the eventual unattended reconstruction of thousands of such embryos from such resources as the Carnegie Collection of Human Embryology. Tools were also developed to allow the real-time interactive visualization of the massive databases that this type of reconstruction project creates. The implementation of a 3-D model of a human embryo in a viewer-centric virtual reality environment is also described.
Circumscription with homomorphisms: solving the equality and counterexample problems
Authors: Peter K. Rathmann, Marianne Winslett, Mark Manasse
Venue: Journal of the ACM (JACM) (1994)

One important facet of common-sense reasoning is the ability to draw default conclusions about the state of the world, so that one can, for example, assume that a given bird flies in the absence of information to the contrary. A deficiency in the circumscriptive approach to common-sense reasoning has been its difficulties in producing default that Tweety &ne; Blutto using ordinary circumscription, or conclude by default that a particular bird flies, if some birds are known not to fly. In this paper, we introduce a new form of circumscription, based on homomorphisms between models, that remedies these two problems and still retains the major desirable properties of traditional forms of circumscription.
Replicated data in a distributed environment
Authors: Malcolm Colton
Venue: Proceedings of the 1993 ACM SIGMOD international conference on Management of data (1993)

Replication Server is a forthcoming Sybase product that dynamically maintains subsets of data in a distributed environment, providing several transaction models to maintain loose consistency. Replication Server is constrasted with existing products which provide location-transparent reads and high-consistency coordinated commits Replication Server makes it possible to build systems that are much more robust in the face of system component failures. By moving transactions rather than data, and by locating data at the point of processing, it maximizes the use of network bandwidth, enabling the deployment of robust, high-performance applications at a lower cost than with traditional approaches.
Adding time to a logic of authentication
Authors: Paul F. Syverson
Venue: Proceedings of the 1st ACM conference on Computer and communications security (1993)

In [BAN89] Burrows, Abadi, and Needham presented a logic (BAN) for analyzing cryptographic protocols in terms of belief. This logic is quite useful in uncovering flaws in protocols; however, it also has produced confusion and controversy. Much of the confusion was cleared up when Abadi and Tuttle provided a semantics for a version of that logic (AT) in [AT91].In this paper we present a protocol to show that both BAN and AT are not expressive enough to capture all of the kinds of flaws that appear to be within their scope. We then present a logic that adds temporal formalisms to AT and that is rich enough to reveal the flaws in the presented protocol; nonetheless, this logic is sound with respect to the same semantics that was given in [AT91]. Finally, we argue that any approach of this type is inadequate by itself to demonstrate the absence of such flaws. We must supplement the formal logic with semantic analysis techniques.
Growing pains in information systems: transforming the IS organization for client/server development
Authors: William D. Nance
Venue: Proceedings of the 1994 computer personnel research conference on Reinventing IS : managing information technology in changing organizations: managing information technology in changing organizations (1994)

Information systems (IS) groups are under increasing pressure to contribute to organizational performance and to support, or even drive, broad organizational transformation efforts through the successful exploitation of information technology (IT). Using a &ldquo;sociocentric&rdquo; model of organizational work, this paper analyzes the experiences of one company's IS group that recently embarked on a long-term, enterprise-wide client/server system development initiative designed to transform organizational decision support processes. Even though the client/server initiative is still in its infancy and has not yet delivered high-impact applications, it has brought about substantial changes in the nature of work in the IS group. These changes range from new philosophies, methodologies, and technologies to shifts in the skills, communication patterns, and control structures required to develop and manage information systems.
A deductive and object-oriented database system: why and how?
Authors: Laurent Vieille
Venue: Proceedings of the 1993 ACM SIGMOD international conference on Management of data (1993)

This talk will outline the principles, the architecture and the potential target applications of a Deductive and Object-Oriented Database System (DOOD). Such systems combine the novel functionalities (relying on the associated technology) developed in deductive database projects, the ability to manipulate the complex objects appearing in many applications and the architectural advances achieved by Object-Oriented DBMS's.
Quality of information and the goals and targets of the organization
Authors: G. John van der Pijl
Venue: Proceedings of the 1994 computer personnel research conference on Reinventing IS : managing information technology in changing organizations: managing information technology in changing organizations (1994)

In this paper a framework is presented for the ex-post evaluation of the quality of information in organizations. The framework brings together several approaches to quality that can be found in the literature, which however, offers no approach to the evaluation of the goal-related aspects of quality. Therefore such an approach is described in the second half of this paper.
Evaluating existing information systems from a business process perspective
Authors: Martin W. Mende, Leo Brecht, Hubert Österle
Venue: Proceedings of the 1994 computer personnel research conference on Reinventing IS : managing information technology in changing organizations: managing information technology in changing organizations (1994)

The evaluation of existing information systems has gained importance in information systems management. A research project involving ten major Swiss companies and the University of St. Gallen has developed a method for assessing existing system from a business process perspective. Systems are evaluated at two levels: the business process supported, and the technical and functional quality of the system. Users and business managers participate actively in the evaluation project. Evaluation criteria are derived using a critical success factor approach and a set of generally applicable factors. Measurement is considered central to the evaluation, and is supported by a set of generic measures and a catalogue of further measures. The evaluation aims at initiating improvement actions. The method has been tested successfully in the participating companies.
Industry influence on IS personnel and roles
Authors: Fred Neiderman, Jonathan Trower
Venue: Proceedings of the 1993 conference on Computer personnel research (1993)

In recent years, IS departments within non-IS product firms have been challenged by growing number of firms turning to outsourcing and packaged software for new applications development. These trends, along with general downsizing of IS operations, have led to distinguishing between IS personnel working in different industries. This paper proposes considering two dimensions along which industry differences may influence the role of IS professionals and presents a model for examining how these industry differences working through differences in IS department structure and IS personnel characteristics influence productivity. Research propositions and their rationale are presented along with a proposed approach toward investigating these questions.
Physical limitations of a computer
Authors: Iraj Danesh
Venue: ACM SIGARCH Computer Architecture News (1993)

This article introduces the physical limitations of a computer and describes limiting architectural impact of the laws of physics on computer hardware design and shows how imaginative application of skills of a computer architect and artistic management of the circuitry may override some of these limitations.
Parallel algorithms for simulating continuous time Markov chains
Authors: David M. Nicol, Philip Heidelberger
Venue: ACM SIGSIM Simulation Digest (1993)

We have previously shown that the mathematical technique of uniformization can serve as the basis of synchronization for the parallel simulation of continuous-time Markov chains. This paper reviews the basic method and compares four different methods based on uniformization, evaluating their strengths and weaknesses as a function of problem characteristics. The methods vary in their use of optimism, logical aggregation, communication management, and adaptivity. Touchstone Delta multiprocessor, using up to 256 processors.
Query evaluation under the well-founded semantics
Authors: Weidong Chen, David S. Warren
Venue: Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1993)

SLD resolution with negation as finite failure (or SLDNF) reflects the procedural interpretation of Horn-clause predicate logic as a programming language and forms the computational basis for prolog systems. Despite its advantages in memory management, SLDNF is often not appropriate for query evaluation for three reasons; a) it may not terminate due to infinite positive recursion; b) it may not terminate due to infinite recursion through negation; and c) it may repeatedly evaluate the same clause body literal, leading to unacceptable performance. We address all three problems for goal-oriented query evaluation of arbitrary programs by presenting an extension of SLDNF, called SLG resolution, with the following distinctive features: (i) SLG resolution is a partial deduction procedure, consisting of several transformations. Each query is transformed step by step into a set of answer clauses; (ii) SLG resolution is sound and ideally complete for all non-floundering queries with respect to all three-valued stable models (including the well founded partial model); (iii) SLG resolution allows an arbitrary computation rule and an arbitrary control strategy for selecting transformations to apply; (iv) SLG resolution avoids both positive and negative loops and always terminates for programs with the bounded-term-size property; (v) SLG resolution has a polynomial time data complexity for well founded negation. Restricted forms of SLG resolution are identified for definite, locally stratified, and modularly stratified programs, thereby shedding light on the role each transformation plays. To provide answers to a query under different three-valued stable models, SLG resolution can be enhanced by further processing of the derived set of answer clauses. SLG resolution makes many more clausal specifications into effective programs. With simple (user or computer generated) annotations, SLDNF resolution and SLG resolution can be fully integrated. Thus a system including SLG resolution can be fully integrated. Thus a system including SLG resolution is naturally upward compatible with Prolog. For all these reasons we believe that SLG resolution will provide the computational basis for the next generation of logic programming systems.
Imperative functional programming
Authors: Simon L. Peyton Jones, Philip Wadler
Venue: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1993)

We present a new model, based on monads, for performing input/output in a non-strict, purely functional language. It is composable, extensible, efficient, requires no extensions to the type system, and extends smoothly to incorporate mixed-language working and in-place array updates.
Interface language for supporting programming styles
Authors: Yang Meng Tan
Venue: Proceedings of the workshop on Interface definition languages (1994)

We suggest a novel application of a formal specification language: we use it to support some programming conventions and encourage certain styles of programming. The Larch/C Interface Language (LCL) is a language for documenting the interfaces of ANSI C programs. It is designed to support a style of c programming where a program is organized around a set of software modules. Even though C does not support abstract data types, LCL supports the specifications of abstract data types, and provides guidelines on how abstract types can be implemented in C. A lint-like program checks for some conformance of C code to its LCL specification.
Schlaer-Mellor object-oriented analysis rules
Authors: Neil Lang
Venue: ACM SIGSOFT Software Engineering Notes (1993)

Shlaer-Mellor Object Oriented Analysis provides a complete and executable description of a problem domain using a set of formal analysis models: an information model, a set of state models, and a set of process models. In this paper we present the conditions that must be satisfied by a valid Shlaer-Mellor Object Oriented Analysis.
Toward tools to support the Gries/Dijkstra design process
Authors: Robert B. Terwilliger
Venue: ACM SIGSOFT Software Engineering Notes (1993)

We are investigating software design processes using a three part approach. For a design method of interest, we first perform walkthroughs on a number of small problems. Second, we construct a simulation program which duplicates the designs produced by the walkthroughs, and third, we construct a process program that supports human application of the method. We have been pursuing this program for the formal design process developed by Dijkstra and Gries. In this paper, we describe our first step towards process programming this method: ISLET, a language-oriented program/proof editor. ISLET supports simple stepwise refinement with proof by automatically generating and mechanically certifying verification conditions. In addition, through ISLET the programmer has access to a library of pre-verified cliches that can be used to create programs more easily. We have constructed a prototype implementation in Prolog and used it to generate a number of example designs.
How does PASCAL-XSC compare to other programming languages with respect to the IEEE standard?
Authors: Pascal Janssens, Annie Cuyt
Venue: ACM SIGPLAN Notices (1993)

In this report we investigate a number of popular programming languages, when used for scientific computation or computational mathematics. The main aim is to investigate the XSC-philosophy that has been launched in the last few years and has resulted in a number of XSC-extensions of existing programming languages. We also focus on details of the IEEE standard which, although a standard, is never followed completely.
Object-oriented simulation of CSMA protocols
Authors: Hossein Saiedian
Venue: ACM SIGSMALL/PC Notes (1992)

We describe the benefits of an object-oriented approach to simulation and describe an object-oriented approach to the simulation of a class of network protocols known as CSMA and discuss the implications of the simulation model with respect to a network of personal computers. A valuable aspect of the model presented here is its similarity to actual networks. While the model reflects three layers of typical network (namely the physical, data link, and the application layers), relative case with which the objects modelling these layers can be modified makes it possible to examine other network characteristics. Additional objects can be added to model other layers in a network without disturbing or requiring detailed knowledge of the existing objects.
Triple Multiplicities for sl(r + 1) and the Spectrum of the Exterior Algebra of the Adjoint Representation
Authors: A. D. Berenstein, A. V. Zelevinsky
Venue: Journal of Algebraic Combinatorics: An International Journal (1992)

A new combinatorial expression is given for the dimension of the space of invariants in the tensor product of three irreducible finite dimensional sl(r + 1)-modules (we call this dimension the triple multiplicity). This expression exhibits a lot of symmetries that are not clear from the classical expression given by the Littlewood&ndash;Richardson rule. In our approach the triple multiplicity is given as the number of integral points of the section of a certain &ldquo;universal&rdquo; polyhedral convex cone by a plane determined by three highest weights. This allows us to study triple multiplicities using ideas from linear programming. As an application of this method, we prove a conjecture of B. Kostant that describes all irreducible constituents of the exterior algebra of the adjoint sl(r + 1)-module.
Hyperspeech
Authors: Barry Arons
Venue: Proceedings of the INTERACT '93 and CHI '93 conference on Human factors in computing systems (1993)

Hyperspeech is a speech-only hypermedia application that explores issues of speech user interfaces, navigation, and system architecture in a purely audio environment without a visual display. The system uses speech recognition input and synthetic speech feedback to aid in navigating through a database of digitally recorded speech segments.
Integrated support for software reuse in Computer-Aided Software Engineering (CASE)
Authors: Jeffrey S. Poulin
Venue: ACM SIGSOFT Software Engineering Notes (1993)

The success and acceptance of reuse tools and libraries depends on their integration into existing software development environments. However, the addition of large libraries of reusable components to software design databases only exacerbates the problem of design data management. Object-oriented databases originated to meet the requirements of design data management that relational databases could not satisfy. This paper describes a semantic data model for an object-oriented database supporting an integrated Computer Aided Software Engineering environment (CASE). The data model promotes reuse by providing objects that match program design requirements to existing components in the reuse library.
Applying text and graphic tools in parallel (abstract): exploring multimedia approaches for accelerating &ldquo;Object Think&rdquo;
Authors: Peter Coad, Jill Nicola
Venue: ACM SIGPLAN OOPS Messenger (1993)

Which is bettertext or graphicsfor exploiting and communicating object-oriented results? Both! To illustrate the desirability, effectiveness, and impact of using both mediums, this demonstration works through a small OOA/OOD model with text and graphicson two large screens, side-by-side, in parallel. The demonstration includes practical insights on how to use both text and graphics for better developing and communicating object-oriented results. It also includes a look at the theories which point to a dramatic need for a more multi-faceted approach. Special emphasis is placed on the theory of seven intelligenceslinguistic, mathematical/logical, spatial, musical, body-kinesthetic, interpersonal, and intrapersonal. Two tools for visualizing objectstext (Smalltalk) and graphics (from the ObjecThink Series)are applied side-by-side, in parallel. Participants experience first-hand the needand the impactof applying multimedia approaches to stimulate more effective object think.
Unrolling lists
Authors: Zhong Shao, John H. Reppy, Andrew W. Appel
Venue: Proceedings of the 1994 ACM conference on LISP and functional programming (1994)

Lists are ubiquitous in functional programs, thus supporting lists efficiently is a major concern to compiler writers for functional languages. Lists are normally represented as linked cons cells, with each cons cell containing a car (the data) and a cdr (the link); this is inefficient in the use of space, because 50% of the storage is used for links. Loops and recursions on lists are slow on modern machines because of the long chains of control dependencies (in checking for nil) and data dependencies (in fetching cdr fields).We present a data structure for &ldquo;unrolled lists&rdquo;, where each cell has several data items (car fields) and one link (cdr). This reduces the memory used for links, and it significantly shortens the length of control-dependence and data-dependence chains in operations on lists.We further present an efficient compile-time analysis that transforms programs written for &ldquo;ordinary&rdquo; lists into programs on unrolled lists. The use of our new representation requires no change to existing programs.We sketch the proof of soundness of our analysis&mdash;which is based on refinement types&mdash;and present some preliminary measurements of our technique.
Dependence relations among autonomous agents (abstract)
Authors: Cristiano Castlefranchi, Maria Miceli, Amedeo Cesta
Venue: ACM SIGOIS Bulletin (1992)

The main thesis of this work is that human interactions are neither unpredictable nor bounded, but they are undertaken autonomously on the grounds of a number of basic principles and conditions. Among these, a crucial role is played by the objective dependence relationships holding among agents. In this paper we report about a first step in providing a computational theory of dependence as a tool for interaction control. We define non social as well as social dependence, and try to show how dependence relationships are organized into complex patterns (such as multiparty, multigoal, unilateral, and bilateral dependence). We then show how a given set of dependence relationships may produce new dependence relationships. Finally, we explore the relationship between dependence and influencing, describing how an agent's dependence on another is predictive of one's goal of influencing the other, as well as of the latter's power of influencing the former.
Logical debugging
Authors: Nachum Dershowitz, Yuh-Jeng Lee
Venue: Journal of Symbolic Computation (1993)

A methodology for reasoning about logic programs and their specifications is applied to program debugging as well as program synthesis. Specifications in the form of an executable model of the desired program are used to generate test cases, locate bugs, and guide bug correction. Both deductive and inductive inference techniques are employed for bug correction and synthesis. The behavior of the automated debugger is demonstrated through several examples.