ppxscal/embedding_network huggingface dataset:
On the CONSISTENCY and COMPLETENESS of an EXTENDED NaDSet
Authors: Paul C. Gilmore
Venue:  (1991)

NaDSet in its extended form has been defined in several previous papers describing its applications. It is a {\underline N}atural {\underline D}eduction based {\underline Set} theory and logic. In this paper the logic is shown to enjoy a form of $\omega$-consistency from which simple consistency follows. The proof uses transfinite induction over the ordinals up to $\varepsilon_0$, in the style of Gentzen''s consistency proof for arithmetic. A completeness proof in the style of Henkin is also given. Finally the cut rule of deduction is shown to be redundant.
Where Do You Want To Go On Holiday
Authors: I. D. Craig
Venue:  (1992)

This paper is about the problem of planning a holiday. We argue that the problem requires different kinds of knowledge for successful solution, and that it often requires previous experience to be taken into account. The domain, we suggest, has the property of sparseness: that is, any realistic agent will have significant gaps in background knowledge and experience, a property that is of considerable interest within Case-Based Reasoning. We then briefly discuss a Case-Based Reasoning program called HOLS that will plan holidays on request. We then argue that holiday planning is often a group activity and discuss concepts from social psychology that are relevant to group problem solving. Following this discussion, we outline a variety of experimental arrangements in which a number of independent Case-Based holiday planning agents cooperate to plan a holiday which is acceptable to all.
Acquisition of mammogram breast border reference data from non-experts
Authors: Ramachandran Chandrasekhar, Yianni Attikiouzel
Venue:  (1999)

Automatic segmentation needs validation by human experts who are few and often very busy. This paper presents an approach to manually acquiring breast border reference data from non-experts using freely available image display and manipulation programs like \texttt{xv} and \texttt{Gimp}. The resulting reference images may then be compared with those from automatic segmentation and the degree of mismatch may be used to quantify the goodness of segmentation. Preliminary results show the feasibility of this approach.
Array-rewriting P systems
Authors: Rodica Ceterchi, Madhu Mutyam, Gheorghe Păun, K. G. Subramanian
Venue: Natural Computing: an international journal (2003)

We consider array languages (sets of pictures consisting of symbols placed in the lattice points of the 2D grid) and the possibility to handle them with P systems. After proving binary normal forms for array matrix grammars (which, even in the case when no appearance checking is used, are known to generate the array languages of arbitrary array grammars), we prove that the P systems with context-free rules (with three membranes and no control on the communication or the use of rules) are computationally universal, able to generate all computable array languages. Some open problems are also formulated.
Optimal Search in Planar Subdivisions
Authors: David G. Kirkpatrick
Venue:  (1981)

A planar subdivision is any partition of the plane into (possibly unbounded) polygonal regions. The subdivision search problem is the following: given a subdivision $S$ with $n$ line segments and a query point $p$, determine which region of $S$ contains $p$. We present a practical algorithm for subdivision search that achieves the same (optimal) worst case complexity bounds as the significantly more complex algorithm of Lipton and Tarjan, namely $O(\log n)$ search time with $O(n)$ storage. Our subdivision search structure can be constructed in linear time from the subdivision representation used in many applications.
Representation, Similarity, and the Chorus of Prototypes
Authors: S. Edelman
Venue:  (1993)

It is proposed to conceive of representation as an emergent phenomenon that is supervenient on patterns of activity of coarsely tuned and highly redundant feature detectors. The present preliminary study appears to indicate that this concept of representation is computationally viable, and is compatible with psychological and neurobiological data. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Robot Vision
Authors: J. P.R. Williams, Mike Alder
Venue:  (1997)

Robot vision refers to providing robots with the capabilities of visual recognition, thus enabling them to ``see'''' what is ``in'''' an image. This project involves the construction of a system to extract the structure from a corridor scene using images taken from a camera. The corridor structure is determined from a camera image. Component tasks performed on the image are pre-processing, line detection and construction of a corridor map. Pre-processing is acheived using Sobel edge detection and thresholding, providing the edges of high contrast. Line detection is implemented using the UpWrite, providing a set of lines from the image. Using the set of lines found in the image, the structure of the corridor is determined using vanishing points and features within this corridor are located using the corridor description. A map of the corridor is the output of the system, representing the location of the corridor with respect to the robot. This process has proven to be effective in describing the corridor structure and locating various features with accuracy dependent upon locating the correct vanishing point to describe the floor. The system provides an overall speed of 3 frames per second on a $320 \times 240$ image and there is good potential for increasing this rate. This system has practical applications in robot navigation, using visual input.
On the Complexity of General Graph Factor Problems
Authors: David G. Kirkpatrick, Hell P.
Venue:  (1981)

For arbitrary graphs G and H, a G-factor of H is a spanning subgraph of H composed of disjoint copies of G. G-factors are natural generalizations of l-factors (or perfect matchings), in which G replaces the complete graph on two vertices. Our results show that the perfect matching problem is essentially the only instance of the G-factor problem that is likely to admit a polynomial time bounded solution. Specifically, if G has any component with three or more vertices then the existence question for G-factors is NP-complete. (In all other cases the question can be resolved in polynomial time.) .br The notion of a G-factor is further generalized by replacing G by an arbitrary family of graphs. This generalization forms the foundation for an extension of the traditional theory of matching. This theory, whose details will be developed elsewhere, includes, in addition to further NP-completeness results, new polynomial algorithms and simple duality results. Some indication of the nature and scope of this theory are presented here.
Semi-Automatic Implementation of Protocols Using an Estelle-C Compiler
Authors: Son T. Vuong, Allen C Lau, Robin I Chan
Venue:  (1987)

In this paper, we present the basic ideas underlying an {\em Estelle-C} compiler, which accepts an {\em Estelle} protocol specification and produces a protocol implementation in C. We discuss our experience gained from using the semi-automatic approach to implement the ISO class 2 transport protocol. A manual implementation of the protocol is performed and compared with the semi-automatic implementation. We find the semi-automatic approach to protocol implementation offers several advantages over the conventional manual one, including correctness and modularity in protocol implementation code, conformance to the specification and reduction in implementation time. Finally, we present our ongoing development of a new {\em Estelle-C} compiler.
A Formalization of Category Theory in NaDSet
Authors: Paul C. Gilmore, George K. Tsiknis
Venue:  (1990)

This paper was presented to the Sixth Workshop on Mathematical Foundations of Programming Semantics held at Queen''s University, May 15-19, 1990. \nBecause of the increasing use of category theory in programming semantics, the formalization of the theory, that is the provision of an effective definition of what constitutes a derivation for category theory, takes on an increasing importance. Nevertheless, no suitable logic within which the theory can be formalized has been provided. The classical set theories of Zermelo-Fraenkel and Godel-Bernays, for example, are not suitable because of the use category theory makes of self-referencing abstractions, such as in the theorem that the set of categories forms a category. In this paper, a formalization of category theory and a proof of the cited theorem is provided within the logic and set theory NaDSet. NaDSet definitions for natural transformations and functor categories are given and an equivalence relation on categories is defined. Additional definitions and discussions on products, comma categories, universals limits and adjoints are presented. They provide evidence that any construct, not only in categories, but also in toposes, sheaves, triples and similar theories can be formalized within NaDSet.
A neural network model based on hermite functions.
Authors: Arkell
Venue:  (1994)

Abstract unavailable. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
OPTIMAL ALLOCATION OF TWO-DIMENSIONAL DATA
Authors: Khaled A. S. Abdel-Ghaffar, Amr El Abbadi
Venue:  (1996)

Efficient browsing and retrieval of geographically referenced information requires the allocation of data on different storage devices for concurrent retrieval. By dividing a two dimensional space into tiles, a system can allow users to specify regions of interest using a query rectangle and then retrieving all information related to tiles overlapping with the query. In this paper, we derive the necessary and sufficient conditions for strictly optimal allocations of two-dimensional data. These methods, when they exist, guarantee that for any query, the minimum number of tiles are assigned the same storage device, and hence ensures maximal retrieval concurrency.
An Active Set Algorithm for Tracing Parametrized Optima
Authors: Joanna Rakowska, Robert T. Haftka, Layne T. Watson
Venue:  (1990)

Optimization problems often depend on parameters that define constraints or objective functions. It is often necessary to know the effect of a change in a parameter on the optimum solution. An algorithm is presented here for tracking paths of optimal solutions of inequality constrained nonlinear programming problems as a function of a parameter. The proposed algorithm employs homotopy zero-curve tracing tecnniques to track segments where the set of active constraints is unchanged. The transition between segments is handled by considering all possible sets of active constraints and eliminating nonoptimal ones based on the signs of the Lagrange multipliers and the derivatives of the optimal solutions with respect to the parameter.
Circular Coinduction
Authors: Grigore Rosu, Joseph Goguen
Venue:  (2000)

Circular coinduction is a new technique for behavioral reasoning that extends coinduction to specifications with circularities. We show that a congruence criterion due to Bidoit and Hennicker follows easily from circular coinduction, and we give some natural examples of circular coinductive proofs. A notation, called BOBJ, appropriate for our style of behavioral specification is also sketched. Finally, everything is conducted in a general framework that in a sense is the gcd of previous behavioral frameworks.
On the Resilience of Broadcasting Strategies in a Failure-Propogating Environment
Authors: Meng Lin, Aleta M Ricciardi, Keith Marzullo
Venue:  (1999)

A process that is under the control of an intruder may masquerade as a legitimate process and, like an arbitrarily faulty process, may not follow the specification that other processes expect it to. Given this similarity, it seems plausible to mask the effects of such compromised processes in the same way that one masks arbitrary failures. One must, however, be able to bound the number of such compromised processes. We examine this problem in the context of multicast protocols. We cast the problem into terms of availability, which is the probability that no more than a certain number of processes are infected. We consider the two questions "what is the availability of the system after having run for some period of time?" and "how long can a system run until the availability is unacceptably low?" We examine how the answers to these questions change as the number of processes grows, as the probability of a message being infective changes, and as different multicast strategies are used.
USING IF-THEN-ELSE DAGs FOR MULTI-LEVEL LOGIC MINIMIZATION
Authors: Kevin Karplus
Venue:  (1988)

This article describes the use of if-then-else DAGs for multi-level logic minimization. A new canonical form for if-then-else DAGs, analogous to Bryant''s canonical form for binary decision diagrams (BDDs), is introduced. Two-cuts are defined for binary decision diagrams, and a relationship is exhibited between general if-then-else expressions and the two-cuts of a BDD for the same function. The canonical form is based on representing the lowest non-trivial two-cut in the corresponding BDD, instead of the highest two-cut, as in Bryant''s canonical form. The definitions of prime and irredundant expressions are extended to if-then-else DAGs. Expressions in Bryant''s canonical form or in the new canonical form can be shown to be prime and irredundant. Objective functions for minimization are discussed, and estimators for predicting the area and delay of the circuit produces after technology mapping are proposed. A brief discussion of methods for applying don''t-care information and for factoring expressions is included.
XS - XILINX 2000/3000 FPGA SIMULATOR
Authors: Jason Zien, Jackson Kong, Pak K. Chan, Martine Schlag
Venue:  (1991)

With the growing complexity of field programmable gate arrays (FPGA), there is the growing need for sophisticated design tools to provide higher level abstractions for managing large designs. It is not enough to be able to create large designs; it is also necessary to test and debug them. Debugging FPGA designs on the circuit board is an awkward task, since the designer can only access the input/output pins of the chip. XS provides the designer with the ability to simulate and debug circuit designs quickly, and with access to all internal nets. XS is a batch-mode, unit-delay, event-driven logic simulator written in Gnu C++ for verification of designs under the unix X-window environment. We exploit certain properties in XILINX XC2000/3000/4000 architectures to enhance the performance as well as the accuracy of the simulator. This report serves the dual purposes of being the USER GUIDE as well as documenting the development of XS.
What to teach about databases
Authors: Amihai Motro
Venue: Proceedings of the 1993 ACM SIGMOD international conference on Management of data (1993)

Lately, there has been increased pressure on universities to place more emphasis on teaching, relative to research. Hence, this is a good time to discuss the state of database instruction in universities. The annual SIGMOD Conference brings together both the &ldquo;producers&rdquo; and the &ldquo;consumers&rdquo; of database education (i.e., university professors, and professionals representing research and development organizations). Hence, this is a good place to hold such a discussion.
The SEQUOIA 2000 storage benchmark
Authors: Michael Stonebraker, Jim Frew, Kenn Gardels, Jeff Meredith
Venue: ACM SIGMOD Record (1993)

This paper presents a benchmark that concisely captures the data base requirements of a collection of Earth Scientists working in the SEQUOIA 2000 project on various aspects of global change research. This benchmark has the novel characteristic that it uses real data sets and real queries that are representative of Earth Science tasks. Because it appears that Earth Science problems are typical of the problems of engineering and scientific DBMS users, we claim that this benchmark represents the needs of this more general community. Also included in the paper are benchmark results for three example DBMSs: GRASS, IPW and POSTGRES.
The 007 Benchmark
Authors: Michael J. Carey, David J. DeWitt, Jeffrey F. Naughton
Venue: Proceedings of the 1993 ACM SIGMOD international conference on Management of data (1993)

The OO7 Benchmark represents a comprehensive test of OODBMS performance. In this paper we describe the benchmark and present performance results from its implementation in three OODBMS systems. It is our hope that the OO7 Benchmark will provide useful insight for end-users evaluating the performance of OODBMS systems; we also hope that the research community will find that OO7 provides a database schema, instance, and workload that is useful for evaluating new techniques and algorithms for OODBMS implementation.
Performance of a riskfree Time Warp operating system
Authors: Steven Bellenot
Venue: Proceedings of the seventh workshop on Parallel and distributed simulation (1993)

Optimistic methods of synchronizing parallel discrete event simulations can be risky by sending (positive) messages (events) before they have been committed. Risky methods often use anti-messages (negative messages) to cancel incorrectly sent positive messages. Riskfree methods are more conservative, they do not send messages until they are known to be correct. The Time Warp Operating System (TWOS) uses anti-messages. Riskfree TWOS is implemented and tested on the standard TWOS benchmarks. Performance of the riskfree TWOS is dependent on the amount of lookahead in the simulation. Good lookahead was required for even reasonable performance. Tracker, a simulation of the riskfree simulation, is used to give idealized best case riskfree performance. BeRisky is an example simulation which has a speedup of n for Time Warp, but only a speedup of 2 for riskfree methods.
Developing a comprehensive need-based curriculum for non-computer science majors (abstract)
Authors: LoriLee M. Sadler
Venue: Proceedings of the 1993 ACM conference on Computer science (1993)

Research aimed at correcting words in text has focussed on three progressively more difficult problems: 1) non-word error detection; 2) isolated-word error correction; and 3) contextdependent word correction. In response to the first problem, efficient pattern matching and n-gram analysis techniques have been developed for detecting strings that do not appear in a given word list. In response to the second problem, a variety of general and application-specific spelling correction techniques have been developed. Some of them were based on detailed studies of spelling error patterns. In response to the third problem, a few experiments using natural language processing tools or statis tical language models have been carried out. This article surveys documented findings on spelling error correction techniques, reviews the state of the art of context-dependent word correction techniques, and discusses research issues related to all three areas of automatic error correction in text. (The Article on which the Talk was based appeared in the December 1992 Issue of Computing Surveys)
A structure for a defense software reuse marketplace
Authors: James W. Moore
Venue: ACM SIGAda Ada Letters (1994)

The paper begins by briefly examining the demand for reusable software components and the characteristics of the defense industry which serve to differentiate its needs from those of a broader commercial reuse industry. The approach of providing a single library for defense reuse is examined and discarded. The bulk of the paper examines how a reuse marketplace might be built upon the existence of multiple libraries. The operations of a reuse marketplace are described and possible specializations of libraries are suggested. Finally, the pioneering contributions of a few current efforts are noted.
The Asymptotic Behavior of Simulated Annealing Processes with Absorption
Authors: Tzuu-Shuh Chiang, Yunshyong Chow
Venue: SIAM Journal on Control and Optimization (1994)

For a large class (satisfying a Perron-Frobenius property) of simulated annealing processes with an absorbing state $a$ and arbitrary cost function, it is shown that there exist constants $h(i) \geq 0, \beta_{ij} > 0$ and $\delta > 0, N \geq 0$, independent of the starting points such that, for nonabsorbing states $i$ and $j$, $$ \lim_{t \rightarrow \infty}\{P(X_{t}=i)\lambda^{h(j)}(t)\}/\{P(X_{t}=j)\lambda^{h(i)}(t)\} = \beta_{ij} $$ and $$ P(X_{t} \neq a) = \exp [- \int_{0}^{t}\delta\lambda^{N}(s)+O(\lambda^{N+1}(s))ds] $$ for $t$ large. Here, $\lambda(t) = \exp(-1/T(t)), T(t) \rightarrow 0$, is the temperature function. As an application, the asymptotic behavior of the expected time of hitting a state (in particular, a global minimum) of a simulated annealing process without absorbing states can be determined.
Cluster analysis for hypertext systems
Authors: Rodrigo A. Botafogo
Venue: Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval (1993)

Identifying nodes of information that are highly related has many applications in any information systems, and in particular in hypertext systems. In this paper we present a technique to identify &ldquo;natural&rdquo; clusters in a hypertext. A natural cluster is a cluster that is not arbitrary, but depends only on intrinsic properties of the hypertext. In our case, the property we will use to identify the clusters is the number of independent paths between nodes. Using the graph theoretic definition of k-edge-components we present an aggregation technique to cluster the nodes. We then use this techniques to cluster three medium sized hypertexts that were developed by different authors for different users, using different methodologies. We also show how to use clustering to improve data display, browsing and retrieval.
Extensible access control for a hierarchy of servers
Authors: Jean Bacon, Richard Hayton, Sai Lai Lo, Ken Moody
Venue: ACM SIGOPS Operating Systems Review (1994)

We discuss the protection requirements of a distributed storage service comprising a two-level hierarchy of storage servers with value-adding service layers above them. A flexible and extensible access control mechanism is required. Our scheme uses Access Control Lists (ACLs) to allow fine grained expression of policy together with capabilities for efficient runtime access after a once-off ACL check. Our capabilities are principal- specific and transient and their design ensures that access to objects is via the correct service hierarchy; for example, a directory object may only be manipulated via a directory service. The implementation of this protection is stateless at the servers above the storage service. The scheme also provides a convenient means to delegate rights for an object, temporarily, to an unprivileged server, for example a print-server. The fact that our capabilities are short-lived alleviates the requirement for selective revocation and crash recovery.
Improved serial algorithms for mutation analysis
Authors: Stewart N. Weiss, Vladimir N. Fleyshgakker
Venue: Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis (1993)

Existing serial algorithms to do mutation analysis are inefficient, and descriptions of parallel mutation systems pre-suppose that these serial algorithms are the best one can do serially. We present a universal mutation analysis data structure and new serial algorithms for both strong and weak mutation analysis that on average should perform much faster than existing ones, and can never do worse. We describe these algorithms as well as the results of our analysis of their run time complexities. We believe that this is the first paper in which analytical methods have been applied to obtain the run time complexities of mutation analysis algorithms.