ppxscal/embedding_network huggingface dataset:
A generic projection operator for partial cylindrical algebraic decomposition
Authors: Andreas Seidl, Thomas Sturm
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

This paper provides a starting point for generic quantifier elimination by partial cylindrical algebraic decomposition pcad. On input of a first-order formula over the reals generic pcad outputs a theory and a quantifier-free formula. The theory is a set of negated equations in the free variables of the input formula. The quantifier-free formula is equivalent to the input for all parameter values satisfying the theory. For obtaining this generic elimination procedure, we derive a generic projection operator from the standard Collins--Hong projection operator. Our operator particularly addresses formulas with many parameters thus filling a gap in the applicability of pcad. It restricts decomposition to a reasonable subset of the entire space. The above-mentioned theory describes this subset. The approach is compatible with other improvements in the framework of pcad. It turns out that the theory contains assumptions that are easily interpretable and that are most often non-degeneracy conditions. The applicability of our generic elimination procedure significantly extends that of the corresponding regular procedure. Our procedure is implemented in the computer logic system redlog.
A symmetric approach to compilation and decompilation
Authors: Mads Sig Ager, Olivier Danvy, Mayer Goldberg
Venue: The essence of computation: complexity, analysis, transformation (2002)

Just as an interpreter for a source language can be turned into a compiler from the source language to a target language, we observe that an interpreter for a target language can be turned into a compiler from the target language to a source language. In both cases, the key issue is the choice of whether to perform an evaluation or to emit code that represents this evaluation.We substantiate this observation with two source interpreters and two target interpreters. We first consider a source language of arithmetic expressions and a target language for a stack machine, and then the λ-calculus and the SECD-machine language. In each case, we prove that the target-to-source compiler is a left inverse of the source-to-target compiler, i.e., that it is a decompiler.In the context of partial evaluation, the binding-time shift of going from a source interpreter to a compiler is classically referred to as a Futamura projection. By symmetry, it seems logical to refer to the binding-time shift of going from a target interpreter to a compiler as a Futamura embedding.
Engineering Look-Ahead in Distributed Conversations
Authors: Paul Ezhilchelvan, Alexander Romanovsky
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

This paper investigates the effects of relaxing the synchronisation embedded in "classical" conversation schemes. Look-ahead conversation scheme [4] enables the synchronisation mandated by conversations to be performed concurrently to other normal system activities, and thereby provides scope for enhancing system performance. In this paper, we take the view that permitting look-ahead must guarantee that executions with and without look-ahead be equivalent for identical inputs and run-time conditions. We identify and formulate the necessary condition for meeting this objective. We then present two schemes for realising this condition. The first scheme is based on piggybacking extra information onto ongoing messages, and the second one is a message passing protocol requiring each participant to send one message to every other participant of the conversation. These schemes do not require a conversation participant to know a priori all participants of the conversation, but only those it is designed to interact with, during the conversation.
Design and Implementation of the Process Stream Protocol
Authors: R J Davin
Venue:  (1985)

Design and implementation details are presented for a communication protocol that abandons the connection endpoint as the focus of the user interface in favor of the network resource to which communication is to provide access. The protocol interface models a remote resource as an executing process, so that it is adequate to a wide variety of resource types. A review of communications terms and concepts is followed by a specification of the design, notes on its implementation, protocol state tables, brief remarks on related work, and discussion of the merits and shortcomings of the project. 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
An Application of Zero-Inflated Poisson Regression for Software Fault Prediction
Authors: Taghi Khoshgoftaar, Kehan Gao, Robert M. Szabo
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

Poisson regression model is widely used in software quality modeling. When the response variable of a data set includes a large number of zeros, Poisson regression model will underestimate the probability of zeros.A zero-inflated model changes the mean structureof the pure Poisson model. The predictive quality is therefore improved.In this paper, we examine a full-scale in-dustrial software system and develop two models, Poisson regression and zero-inflated Poisson regression. To our knowledge, this is the first study that introduces the zero-inflated Poisson regression model in software reliability.Comparing thepredictivequalities of the two competing models, we conclude that for this system, thezero-inflated Poisson regression model is more appropriate in theory and practice.
ATM switches with bifurcated input queueing
Authors: G. Thomas, V. Veludandi
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

Bifurcated queueing has been shown to be a very practical means to exceed the classical upper bound of 0.568 for throughput of input-queued ATM switches. We report the results from a simulation study of the associated improvements in the average cell delay. Our results indicate sharp reductions in the average cell delays, and our simulations include cases of both uncorrelated and correlated traffic.
Basic Prolog Schemata
Authors: S T Gegg-Harrison
Venue:  (1989)

The notion of most specific generalization of first-order logical formulas is extended to produce second-order schemata and an improved algorithm is presented. This notion is applied to a large number of simple recursive list processing Prolog programs to create a hierarchy of Prolog schemata. Central to this Prolog Schema Hierarchy are fourteen basic level schemata which are sufficient for representing a vast number of common simple recursive list processing programs. A Prolog Tutoring System is proposed which uses an ``annotated'''' version of the Prolog Schema Hierarchy as its underlying knowledge structure. 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
Convergence of a Stochastic Rootfinding Procedure
Authors: Burton Simon
Venue:  (1998)

We consider an exponential queueing system with multiple stations, each of which has an infinite number of servers. Each station has a dedicated arrival stream of jobs. In addition, there is an arrival stream of jobs that choose a station based on the state of the system. In this paper we describe two heavy traffic approximations for the stationary joint probability mass function of the number of busy servers at each station. One of the approximations involves state-space collapse and is accurate for large traffic loads. The state-space in the second approximation does not collapse. It provides an accurate estimate of the stationary behavior of the system over a wide range of traffic loads. 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
An Open QoS Architecture for CORBA Applications
Authors: Frank Siqueira, Vinny Cahill
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

Distributed application programmers rely on middleware such as CORBA in order to handle the complexity that arises from the distributed and heterogeneous nature of the underlying computing platform. CORBA, in particular, provides a media streaming mechanism that can be used for media streaming and for associating QoS requirements with media streams. Despite defining the interfaces of the media streaming mechanism, the corresponding specification does not prescribe how QoS is enforced at low-level by the middleware. This paper describes the design and implementation of a QoS architecture, called Quartz, which has been integrated with CORBA in order to provide a framework that allows applications to transfer real-time media in open systems. This framework is employed to model and simulate a pattern recognition mechanism for use in an automated manufacturing cell, which is also described and analyzed in this paper.
Rate Equations for the Growth of Cu Islands on Cu(001)
Authors: Ofer Biham, G. T. Barkema, M. Breeman
Venue:  (1994)

The kinetics of island nucleation and growth during deposition of Cu atoms on Cu(001) is studied using rate equations. The equations are derived using microscopic calculations of the energy landscape on the surface, previously used in Monte Carl (MC) simulations. This allows a quantitative comparison between the rate equations and the MC results. Our rate equations take into account atoms that fall on the bare substrate as well as on top of existing islands, the mobility of single atoms and small islands, the coalescence of adjacent islands and the possible separation of atoms from island edges. The rate equations are used to explore the island size distribution and island density as a function of the coverage and deposition rates. These rate equations provide a useful and flexible tool that allows to easily modify particular microscopic properties of the system such as the mobility of small islands or the rate of coalescence and examine their effect while leaving all other features intact.
On the Role of Words and Phrases in Automatic Text Analysis
Authors: Gerard Salton, A. Wong
Venue:  (1975)

One of the most crucial operations in automatic information retrieval is the assignment to written texts and documents of appropriate identifiers, capable of representing information content for search and retrieval purposes. This operation known as automatic indexing normally consists in assigning to the documents either single terms, or more specific entities such as phrases, or more general entities such as term classes. A model, known as discrimination value analysis is introduced which assigns an appropriate role in the indexing operation to the terms, term phrases, and thesaurus classes. The model is used to determine effectiveness criteria for the content identifiers and to generate useful indexing policies. Experimental evidence is given to validate the theory.
A mobile videophone image codec using wavelets and classified vector quantisation for mobile radio speech channels
Authors: L. D. Scargall, S. S. Dlay
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

A bandwidth efficient image codec is offered as a direct replacement for mobile radio speech codecs in second generation wireless systems, such as the Pan European GSM system. The image codec is contrived for Quarter Common Intermediate Format (QCIF) videophone sequences, and uses the 2D orthogonal wavelet transform to decompose the Displaced Frame Difference (DFD), into a four band structure using Quadrature Mirror Filters (QMF). The transformed coefficients are then compressed using classified vector quantisation (CVQ) and then multiplexed to a time division multiple access (TDMA) slot and modulated using Pilot Symbol Assisted Quadrature Amplitude Modulation (PSAQAM). The proposed image codec does not suffer from blocking effects that are visually disjointed and has therefore a major advantage over current discrete cosine transform (DCT) methods. A further advantage of using wavelet based transforms is that they require less hardware and are simpler to implement on a DSP chip than Fourier based methods. The method proposed is suitable for implementation in VLSI technology.
POND: an Excel spreadsheet to obtain structural attitudes of planes from oriented drillcore
Authors: C. R. Stanley, J. J. Hooper
Venue: Computers Geosciences (2003)

The Planes from Oriented and Navigated Drillcore (POND) Excel® spreadsheet allows determination and presentation of the attitudes of planes intersected in 'oriented' and 'navigated' diamond drillcore. Two drillcore navigation measurements (azimuth and plunge from a deviation log), and two plane-to-drillcore angular measurements (angle to core axis, and angle between orientation mark and intersection ellipse) are required to obtain a solution. All possible drillcore orientations are supported and multiple plane orientations can be determined simultaneously. Graphical results are presented on a stereonet as poles to the intersected planes. Numerical results are presented in a matrix to allow clipping into stereonet programs for contouring and more formal and involved structural analysis and display.
Student learning experience with an industry certification course at university
Authors: Andy Simmonds
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

This is an analysis of the computer generated feedback from an industry certification course, as taught as part of a university unit. A method for extracting useful information from the available course evaluation data is proposed, and the method is shown to be effective and reasonable. Conclusions for the particular unit are drawn. In particular it is shown that the unit was successful in giving a large cohort of students a good learning experience and that there is a high degree of correlation between student enjoyment and the professionalism of the instructor.
Finding Regions Fast: Single Entry Single Exit and Control Regions in Linear Time
Authors: Richard Johnson, David Pearson, Keshav Pingali
Venue:  (1993)

Many compilation problems require computing the control dependence equivalence relation which divides nodes in a control flow graph into equivalence classes such that nodes are in the same class if and only if they have the same set of control dependences. In this paper, we show that this relation can be computed in O(E) time by reducing it to a naturally stated graph problem: in a strongly connected component, divide nodes into equivalence classes such that every cycle passes through all or none of the nodes in an equivalence class. Our algorithm does not require the computation of the control dependence relation or of the postdominator relation -in fact, it runs faster in practice than the best algorithm for either of these problems. We also show that our algorithm can be used to determine the single entry single exit regions of a control flow graph in O(E) time.
Utilizing Scatter for Pixel Subspace Selection
Authors: Haim Schweitzer
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

Measures of scatter are used in statistical pattern recognition to identify and select important features, computed as linear combinations of the given features. Examples include principal components and linear discriminants. The classic computational procedures require eigenvector decomposition of large matrices, and in the case of images they are only practical for identifying a low dimensional feature subspace.We investigate the case in which the selected features are required to be a subset of the given features. It is shown that the same scatter measures used in the general case can also be used in this discrete selection case, but the computational procedure no longer involves matrix eigenvector decomposition.Instead, the selection of pixels that optimize scatter measures can be accomplished by a very simple and efficient discrete optimization technique that runs in linear time regardless of the subspace size. Applications to clustering and content based indexing are discussed.
Eudaemonic Computing ('underwearables')
Authors: Steve Mann
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

I present a framework for wearable computing, based on the principle that it be unobtrusive, and that it be integrated into ordinary clothing. This design philosophy, called `eudaemonic computing' (named in honor of the group of physicists who designed the first truly unobtrusive wearable computers with vibrotactile displays) is reduced to practice through the `underwearable computer' (`underwearable' for short). The `underwearable' is a computer system that is meant to be worn within or under ordinary clothing. The first `underwearables' were built in the early 1980s, and have evolved into a form that very much resembles a tank-top. There were three reasons for the tank structure: (1) weight is evenly and comfortably distributed over the body, and bulk is distributed unobtrusively; (2) it provides privacy by situating the apparatus within the corporeal boundary we consider our own (personal) space, and others also so-regard; and (3) proximity to the body affords capability to both sense biological signal quantities (such as respiration and heart signals which are both accessible to a vest-based device), as well as produce output that we can sense, unobtrusively. The vibrotactile output modality (VibraVest) was explored as a means of assisting the visually challenged (to avoid bumping into objects through an ability to `feel' objects at a distance). The success of VibraVest suggests other possibilities for similar unobtrusive devices that can be worn over an extended period of time, in all facets of day-to-day life.
Evolution and Evaluation of Software Quality Models
Authors: C. V. Ramamoorthy
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Complex systems, services and enterprises are very dependent on computer-communication technology and in particular to their supporting and controlling software systems. This paper describes aspects of software system quality from different points of view. It provides a historical overview of the evolution of software quality and the means and methods used to achieve and enhance it. The traditional software quality models trace their origins to the well-established manufacturing industries. Since quality of a product consists of many attributes, we identify the commonly accepted established entities that conform to our vision of good quality. Notions and meanings of quality vary across disciplines and application domains. The quality of product is a concern of several stakeholders or participants which include users, designers, maintainers, marketing and sales people, the enterprise owners, etc. Their views of quality would differ from perspectives and their intentions. Quality is a dynamic attribute which keeps on changing over the life time of the product, product line and product family. 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 Suffix Tree Construction with Large Alphabets
Authors: Martin Farach
Venue:  (1996)

The suffix tree of a string is the fundamental data structure of combinatorial pattern matching. In this paper, we present a novel, deterministic algorithm for the construction of suffix trees. We settle the main open problem in the construction of suffix trees: we build suffix trees in linear time for integer alphabet.
Overcoming agent delusion
Authors: Olayide Olorunleke, Gordon McCalla
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Agent models are internal representations held by an agent of itself and of other agents in its environment. Agent modelling is necessary for coordinating and individualizing the actions of agents. An important goal is that agents not be deluded about each other, that is, that there is no incompatibility between an agent's models and the actual properties of the agents being modeled. This paper is about overcoming such delusion, in particular with strategies that rely on interactions and gossip between an agent and other agents. We present a number of studies of the effectiveness of these strategies and the trade-offs among them. These studies have been carried out using an agent architecture and a simulation environment both specifically designed to allow exploration of agent modelling issues.
Applying Synthesis Principles to Create Responsive Software Systems
Authors: U C Smith
Venue:  (1986)

The engineering of new software systems is a process of iterative refinement. Each refinement step involves understanding the problem, creating the proposed solution, describing or representing it, and assessing its viability. The assessment includes evaluating its correctness, its feasibility, and its preferability (when there are alternatives). Many factors affect preferability, such as maintainability, responsiveness, reliability, usability, etc. This discussion focuses on only one, the {\em responsiveness} of the software: that is, the response time or throughput as seen by the users. The understanding, creation, representation, and assessment steps are repeated until the proposed product of the refinement step ``passes'''' the assessment.