ppxscal/embedding_network huggingface dataset:
Opportunism and Learning
Authors: Kristian Hammond, Timothy Converse, Mitchell Marks, Colleen M. Seifert
Venue: Machine Learning (1993)

There is a tension in the world between complexity and simplicity. On one hand, we are faced with a richness of environment and experience that is at times overwhelming. On the other, we seem to be able to cope and even thrive within this complexity through the use of simple scripts, stereotypical judgements, and habitual behaviors. In order to function in the world, we have idealized and simplified it in a way that makes reasoning about it more tractable. As a group and as individuals, human agents search for and create islands of simplicity and stability within a sea of complexity and change.In this article, we will discuss an approach based on the case-based reasoning paradigm that attempts to resolve this tension. This agency approach embraces, rather than avoids, this paradox of the apparent complexity of the world and the overall simplicity of our methods for dealing with it. It accomplishes this by treating the behavior of intelligent agents as an ongoing attempt to discover, create, and maintain the stability that is necessary for the production of actions that satisfy our goals.
Dynamic Programming Alignment of Sequences Representing Cyclic Patterns
Authors: Jens Gregor, Michael G. Thomason
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

String alignment by dynamic programming is generalized to include cyclic shift and corresponding optimal alignment cost for strings representing cyclic patterns. A guided search algorithm uses bounds on alignment costs to find all optimal cyclic shifts. The bounds are derived from submatrices of an initial dynamic programming matrix. Algorithmic complexity is analyzed for major stages in the search. The applicability of the method is illustrated with satellite DNA sequences and circularly permuted protein sequences.
Dynamic programming algorithms for the knapsack problem
Authors: Moshe Sniedovich
Venue: ACM SIGAPL APL Quote Quad (1994)

The knapsack problem is one of the "classical" problems in Operations Research. In this paper we present a number of APL codes based on the dynamic programming approach to such problems. Although these codes can be used effectively to solve small knapsack problems, they were developed primarily as teaching aids.
Design of a Fault-Tolerant Three-Dimensional Dynamic Random-Access Memory with On-Chip Error-Correcting Circuit
Authors: Pinaki Mazumder
Venue: IEEE Transactions on Computers (1993)

Most current-generation multimegabit dynamic random-access memory (DRAM) chips use three-dimensional storage capacitors where the charge is stored on a vertically integrated trench-type structure and are highly vulnerable to alpha particles, which frequently create plasma shorts between two adjoining trench capacitors on the same word line, resulting in uncorrectable double-bit soft errors. The author presents a systematic study of soft-error related problems and discusses methodologies for correcting single-bit and double-bit memory-cell upsets by using on-chip error-correcting-code (ECC) circuits. By modifying the product code, an effective coding scheme has been designed that can be integrated within a DRAM chip to correct double-bit errors. It is demonstrated that the reliability of a memory chip can be improved by several million times by integrating the proposed circuit. The area and timing overhead are calculated and compared with those of memory chips without any ECC and chips with single-error-correcting (SEC) codes. The ability of the circuit to correct soft errors in the presence of multiple-bit errors is analyzed.
Efficient algorithms for all-to-all communications in multi-port message-passing systems
Authors: Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Derrick Weathersby
Venue: Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures (1994)

We present efficient algorithms for two all-to-all communication operations in message-passing systems: index (or all-to-all personalized communication) and concatenation (or all-to-all broadcast). We assume a model of a fully-connected message-passing system, in which the performance of any point-to-point communication is independent of the sender-receiver pair. We also assume that each processor has k &ge; 1 ports, through which it can send and receive k messages in every communication round. The complexity measures we use are independent of the particular system topology and are based on the communication start-up time and on the communication bandwidth. In the index operation among n processors, initially, each processor has n blocks of data, and the goal is to exchange the i-th block of processor j with the j-th block of processor i. We present a class of index algorithms that is designed for all values of n and that features a trade-off between the communication of start-up time and the data transfer time. This class of algorithms includes two special cases: an algorithm that is optimal with respect to the measure of the start-up time, and an algorithm that is optimal with respect to the measure of the data transfer time. We also present experimental results featuring the performance tuneability of our index algorithms on the IBM SP-1 parallel system. In the concatenation operation among n processors, initially, each processor has one block of data, and the goal is to concatenate the n blocks of data from the n processors and to make the concatenation result known to all the processors. We present a concatenation algorithm that is optimal, for most values of n, in the number of communication rounds and in the amount of data transferred.
Area-efficient upward tree drawings
Authors: Ashim Garg, Michael T. Goodrich, Roberto Tamassia
Venue: Proceedings of the ninth annual symposium on Computational geometry (1993)

Rooted trees are usually drawn planar and upward, i.e., without crossings and with parents placed above their children. In this paper we investigate the area requirement of planar upward drawings of trees, and present optimal algorithms for constructing such drawings.
A linear programming approach to logical inference
Authors: Eberhard U. Stickel
Venue: Proceedings of the 1993 ACM conference on Computer science (1993)

The inference problem in propositional logic is important for expert system and deductive database applications. Although in practice the use of propositional logic is not sufficient it is basic for first order predicate logic and also for inference problems under uncertainty. It is well known that such inference problems may be modelled as mixed integer linear programs. This approach was recently used to build a deductive database system. In this paper we first show that an inference problem in propositionals logic may be rewritten as a standard quadratic program. Thus the use of Wolfe's or Beale's algorithm becomes possible. Moreover we introduce a modification of the simplex method which is very easy to implement and which allows a rather efficient solution of the inference problem. Some empirical results have been included in the paper to give a first idea.
Combined use of languages in object-oriented software construction
Authors: V. Karakostas, L. Pourkashani
Venue: ACM SIGPLAN OOPS Messenger (1994)

This paper argues that a combined use of languages is needed for object-oriented software construction, since no single language can be ideal for all the phases of prototyping, design and implementation. The approach discussed in this paper is based on the combined use of two object-oriented languages. The first of them (Amore), a hybrid object and logic-based language, is used for specifications prototyping, whilst the second one, (C++) is used for the final system construction. An automatic tool transforms Amore specifications to C++ code templates which can be manually modified by the programmer. This approach improves time the consuming and error prone activity of manual translation of specifications into code, whilst at the same time improves the quality of the delivered system.
Concepts of object-oriented programming (abstract)
Authors: Raimund K. Ege
Venue: ACM SIGPLAN OOPS Messenger (1993)

Concepts of Object-Oriented Programming Raimund K. Ege, Florida International University This tutorial defines and teaches the basic concepts of environment, and gives an overview of the features of object-oriented programming, illustrates the object-oriented languages and environments. This advantages of object-oriented techniques over tutorial will let you make an informed decision conventional programming, introduces the about what language/environment will best serve components of an object-oriented programming your programming needs.
Association Schemes and Fusion Algebras (An Introduction)
Authors: Eiichi Bannai
Venue: Journal of Algebraic Combinatorics: An International Journal (1993)

We introduce the concept of fusion algebras at algebraic level, as a purely algebraic concept for the fusion algebras which appear in conformal field theory in mathematical physics. We first discuss the connection between fusion algebras at algebraic level and character algebras, a purely algebraic concept for Bose-Mesner algebras of association schemes. Through this correspondence, we establish the condition when the matrix S of a fusion algebra at algebraic level is unitary or symmetric. We construct integral fusion algebras at algebraic level, from association schemes, in particular from group association schemes, whose matrix S is unitary and symmetric. Finally, we consider whether the modular invariance property is satisfied or not, namely whether there exists a diagonal matrix T satisfying the condition (ST)3 &equals; S2. We prove that this property does not hold for some integral fusion algebras at algebraic level coming from the group association scheme of certain groups of order 64, and we also prove that the (nonintegral) fusion algebra at algebraic level obtained from the Hamming association scheme H(d, q) has the modular invariance property.
Multimodal and multimedia interfaces: an INTERCHI '93 workshop, April 24&ndash;26, Amsterdam
Authors: K.-P. Fähnrich, K.-H. Hanne
Venue: ACM SIGCHI Bulletin (1994)

INTERCHI '93 hosted the workshop on multimodal and multimedia human computer interfaces which was co-initiated and co-sponsored by IFIP TC 13: "Human Computer Interaction".
LogoMedia: a sound-enhanced programming environment for monitoring program behavior
Authors: Christopher J. DiGiano, Ronald M. Baecker, Russell N. Owen
Venue: Proceedings of the INTERACT '93 and CHI '93 conference on Human factors in computing systems (1993)

Even for the programmer, computer software can be a mysterious black box. But what if the programmer were able to give the box a good shake and listen to things rattle inside? Are there tools like the doctor's stethoscope that can help programmers listen to the heartbeat of their software? These are the kinds of questions we decided to explore by building LogoMedia, a sound-enhanced programming environment. LogoMedia supports the ability to associate non-speech audio with program events while the code is being developed. These associations cause subsequent test runs of the program to generate and manipulate sounds which can aid in the comprehension and analysis of the program's behavior.
Parallel Analysis of Clusters in Landscape Ecology
Authors: Michael Berry, Jane Comiskey, Karen Minser
Venue: IEEE Computational Science Engineering (1994)

When ecosystems are fragmented into patches, the whole can be worth less than the sum of its parts. Parallel methods can greatly speed up statistical analysis of clusters, in landscape ecology or other fields. The term 'landscape ecology' refers to the analysis of patterns and heterogeneity in natural landscapes and ecosystems. Computer modeling is used in landscape ecology applications to assess habitat fragmentation and its implications. Researchers in the Environmental Sciences Division at Oak Ridge National Laboratory developed a model called Noyelp that simulates the search, movement, and foraging activities of free-ranging elk and bison on winter range in northern Yellowstone National Park. The model helps to explore how the scale and patterns of fire affect winter foraging and survival of ungulate populations in the diverse, multihabitat landscape of the park. This model, written in Fortran-77, analyzes maps (2D grids) to determine the number, size, and geometry of habitat regions, or clusters, representing landscape patterns, resources, and animals.
Object-oriented software development in a commercial environment: the evolution of ET++
Authors: Andreas Birrer, Walter Bischofberger, Erich Gamma, Bruno Schäffer, André Weinand
Venue: ACM SIGPLAN OOPS Messenger (1993)

The objective of this poster is to show the evolution of the application framework ET++ from a university research project to a seamless platform for commercial application development in a banking environment. The presentation of our recent projects should stimulate the interaction between the ET++ developers and current and future ET++ users, application framework users and developers in general.
Subtyping recursive types
Authors: Roberto M. Amadio, Luca Cardelli
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1993)

We investigate the interactions of subtyping and recursive types, in a simply typed &lgr;-calculus. The two fundamental questions here are whether two (recursive)types are in the subtype relation and whether a term has a type. To address the first question, we relate various definitions of type equivalence and subtyping that are induced by a model, an ordering on infinite trees, an algorithm, and a set of type rules. We show soundness and completeness among the rules, the algorithm, and the tree semantics. We also prove soundness and a restricted form of completeness for the model. To address the second question, we show that to every pair of types in the subtype relation we can associate a term whose denotation is the uniquely determined coercion map between the two types. Moreover, we derive an algorithm that, when given a term with implicit coercions, can infer its least type whenever possible.
The union of balls and its dual shape
Authors: Herbert Edelsbrunner
Venue: Proceedings of the ninth annual symposium on Computational geometry (1993)

Efficient algorithms are described for computing topological, combinatorial, and metric properties of the union of finitely many balls in Rd . These algorithms are based on a simplicial complex dual to a certain decomposition of the union of balls, and on short inclusion-exclusion formulas derived from this complex. The algorithms are most relevant in R3 where unions of finitely many balls are commonly used as models of molecules.
Implicit Curves and Surfaces in CAGD
Authors: Christoph M. Hoffman
Venue: IEEE Computer Graphics and Applications (1993)

The role of implicit curves and surfaces in computer-aided geometric design (CAGD) are described. The ways in which the study of implicit algebraic curves and surfaces draws on algebraic geometry are reviewed. The implicitization of parametric curves and surfaces, parameterization of implicits, and techniques used to circumvent conversions between implicit and parametric representations are discussed.
Generating user interfaces from data models and dialogue net specifications
Authors: Christian Janssen, Anette Weisbecker, Jürgen Ziegler
Venue: Proceedings of the INTERACT '93 and CHI '93 conference on Human factors in computing systems (1993)

A method and a set of supporting tools have been developed for an improved integration of user interface design with software engineering methods and tools. Animated user interfaces for database-oriented applications are generated from an extended data model and a new graphical technique for specifying dialogues. Based on views defined for the data model, an expert system uses explicit design rules derived from existing guidelines for producing the static layout of the user interface. A petri net based technique called dialogue nets is used for specifying the dynamic behaviour. Output is generated for an existing user interface management system. The approach supports rapid prototyping while using the advantages of standard software engineering methods.
A comparison of indexing techniques for Japanese text retrieval
Authors: Hideo Fujii, W. Bruce Croft
Venue: Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval (1993)

A series of Japanese full-text retrieval experiments were conducted using an inference network document retrieval model. The retrieval performance of two major indexing methods, character-based and word-based, were evaluated. Using structured queries, the character-based indexing performed retrieval as well as, or slightly better, than the word-based system. This result has practical significance since the character-based indexing speed is considerably faster than the traditional word-based indexing. All the queries in this experiment were automatically formulated from natural language input.
A Generalized Vandermonde Determinant
Authors: Marshall W. Buck, Raymond A. Coley, David P. Robbins
Venue: Journal of Algebraic Combinatorics: An International Journal (1992)

We prove two determinantal identities that generalize the Vandermonde determinant identity \det \left(x^j_i\right)_{i,j=0,\ldots,m}= \prod\limits_{0\leq i \lt j \leq m}(x_j-x_i). In the first of our identities the set &lcub;0, &hellip;, m&rcub; indexing the rows and columns of the determinant is replaced by an arbitrary finite order ideal in the set of sequences of nonnegative integers which are 0 except for a finite number of components. In the second the index set is replaced by an arbitrary finite order ideal in the set of all partitions.
A multi-theory constraint satisfaction system
Authors: Steven J. Zeil
Venue: Proceedings of the 1993 ACM conference on Computer science (1993)

Constraint satisfaction systems are usually designed to work within a single-theory. This paper presents an approach to multi-theory constraint satisfaction characterized by cooperation among a variety of single-theory specialists. The system consists of three main components: a blackboard, a controlling Refine procedure, and a set of specialists. Two essential techniques used in our system are item propagation and case splitting. Potential applications of this system include software testing and analysis tools.
Optimal Controls of Navier--Stokes Equations
Authors: Mihir Desai, Kazufumi Ito
Venue: SIAM Journal on Control and Optimization (1994)

This paper studies optimal control problems of the fluid flow governed by the Navier--Stokes equations. Two control problems are formulated in the case of the driven cavity and flow through a channel with sudden expansion and solved successfully using a numerical optimization algorithm based on the augmented Lagrangian method. Existence and the first-order optimality condition of the optimal control are established. A convergence result on the augmented Lagrangian method for nonsmooth cost functional is obtained.
Communicating reactive processes
Authors: G. Berry, S. Ramesh, R. K. Shyamasundar
Venue: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1993)

We present a new programming paradigm called Communicating Reactive Processes or CRP that unifies the capabilities of asynchronous and synchronous concurrent programming languages. Asynchronous languages such as CSP, OCCAM, or ADA are well-suited for distributed algorithms; their processes are loosely coupled and communication takes time. The ESTEREL synchronous language is dedicated to reactive systems; its processes are tightly coupled and deterministic, communication being realized by instantaneous broadcasting. Complex applications such as process of robot control require to couple both forms of concurrency, which is the object of CRP. A CRP program consists of independent locally reactive ESTEREL nodes that communicate with each other by CSP rendezvous. CRP faithfully extends both ESTEREL and CSP and adds new possibilities such as precise local watchdogs on rendezvous. We present the design of CRP, its semantics, a translation into classical process calculi for program verification, and application example, and implementation issues.
The Turing test is for the birds
Authors: Gary Fostel
Venue: ACM SIGART Bulletin (1993)

The comments in The Economist re: purpose and value of AI [1] were most refreshing. I cannot resist quoting words to similar effect from my own writing.
Applications of feasible path analysis to program testing
Authors: Allen Goldberg, T. C. Wang, David Zimmerman
Venue: Proceedings of the 1994 ACM SIGSOFT international symposium on Software testing and analysis (1994)

For certain structural testing criteria a significant proportion of tests instances are infeasible in the sense the semantics of the program implies that test data cannot be constructed that meet the test requirement. This paper describes the design and prototype implementation of a structural testing system that uses a theorem prover to determine feasibility of testing requirements and to optimize the number of test cases required to achieve test coverage. Using this approach, we were able to accurately and efficiently determine path feasibility for moderately-sized program units of production code written in a subset of Ada. On these problems, the computer solutions were obtained much faster and with greater accuracy than manual analysis. The paper describes how we formalize test criteria as control flow graph path expressions; how the criteria are mapped to logic formulas; and how we control the complexity of the inference task. It describes the limitations of the system and proposals for its improvement as well as other applications of the analysis.
A distributed artificial intelligence view on general purpose vision systems (abstract)
Authors: Olivier Boissier, Yves Demazeau
Venue: ACM SIGOIS Bulletin (1992)

A General Purpose Vision System (GPVS) is an open and domain-independent system that is able to build, maintain, and use an internal representation of the external world from data provided by physical sensors such as cameras. The experience in constructing the Vision As Process (VAP) and SATURNE systems using a Distributed Artificial Intelligence (DAI) approach has enabled us to compare, from a DAI point of view, these two systems with other major existing GPVS's. As far as we know this work represents the first large-scale comparison between GPVS's at the module and module-integration levels using a DAI formalism. This has lead us to the identification of several basic common features within the systems studied. Furthermore we think these common features are essential for the construction of a GPVS, namely: 1/the distribution of the knowledge representation provides level-agents that denote the same knowledge at a given level of representation 2/the distribution of the knowledge processing provides focus-agents which realize the system's "focus of attention" 3/intersection of level-agents and focus-agents determines the active basic-agents that explicitly or implicitly constitute the system at a given time. The description of GPVSs in terms of basic-agents is a novel feature of our approach and may also be applicable to other domains such as robotics.