ppxscal/embedding_network huggingface dataset:
Using Active Constructs in User-Interfaces to Object-Oriented Databases
Authors: Kenneth J. Mitchell, Jessie B. Kennedy, Peter J. Barclay
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

Abstract-- This paper examines the use of active constructs in the definition of user-interfaces to object-oriented databases. A development environment for user-interfaces to databases is presented which features the interactive use of active features of an object oriented data language through visual programming facilities. Examples are provided highlighting the salient issues of this approach, including dynamic query interfaces and complex event management.
Routing Through the Mist: Privacy Preserving Communication in Ubiquitous Computing Environments
Authors: Jalal Al-Muhtadi, Roy Campbell, Apu Kapadia, M. Dennis Mickunas, Seung Yi
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Ubiquitous computing is poised to revolutionize the way we compute and interact with each other. However, unless privacy concerns are taken into account early in the design process, we will end up creating a very effective distributed surveillance system, which would be adream come true for electronic stalkers and "big brothers."We present a protocol, which preserves the privacy of users and keeps their communication anonymous. In effect, we create a "mist" that conceals users from the system and other users. Yet, users will still be able to enjoy seamless interaction with services and other entities that wander within the ubiquitous computing environment.
An Excursion to the Zoo of Dynamic Coterie-Based Replication Schemes
Authors: Oliver Theel, Thomas Strauβ
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

Dynamic replication schemes offer very high read and write operation availabilities by repeatedly modifying the configuration of the scheme as failure patterns dictate at run-time. In this paper, we describe a dynamic replication scheme framework which automatically transforms specifications of static replication schemes into their dynamic counterpart. We apply the framework to a wide variety of replication schemes, thereby obtaining novel dynamic schemes which have not been analyzed or reported in literature before. The new dynamic replication schemes are compared and an outlook on future work is given.
The Construction of Consistent Possibility and Necessity Measures
Authors: K. D Jamison, Weldon A. Lodwick
Venue:  (2001)

Given a general measure mu (finite or infinite), we develop possibility and necessity measures as upper and lower estimators of mu. We provide a method for constructing such fuzzy measures and show that the measure can be approximated with arbitrary closeness using fuzzy measures constructed this way. Using the extension principle, these consistent possibility and necessity measures are used to produce possibility and necessity measures on the range space of a measurable function which are consistent with the measure on the range space induced by the measurable function. This induced measure can be approximated with arbitrary closeness by extending consistent
Intelligent meaning creation in a clumpy world helps communication
Authors: Andrew D. M. Smith
Venue: Artificial Life (2003)

This article investigates the problem of how language learners decipher what words mean. In many recent models of language evolution, agents are provided with innate meanings a priori and explicitly transfer them to each other as part of the communication process. By contrast, I investigate how successful communication systems can emerge without innate or transferable meanings, and show that this is dependent on the agents developing highly synchronized conceptual systems. I present experiments with various cognitive, communicative, and environmental factors which affect the likelihood of agents achieving meaning synchronization and demonstrate that an intelligent meaning creation strategy in a clumpy world leads to the highest level of meaning similarity between agents.
A Prospective on Mathematics and Artificial Intelligence: Problem Solving = Modeling + Theorem Proving
Authors: Harvey J. Greenberg
Venue:  (2000)

This is a prospective on the research in the intersection of mathematics and artificial intelligence that I see as having been the most important over the past 10 years and that I think should be pursued vigorously during this decade. Part of this is drawn from my personal research agenda, part is from vast readings, and part is from my editorial position with \textit{Annals of Mathematics and Artificial Intelligence.
Standard Cell Placement by Quadrasection
Authors: R P Suaris, Gershon Kedem
Venue:  (1986)

In this paper we describe a new placement technique based on hypergraph quadrasection. We developed a standard cell placement procedure based on recursively dividing the netlist into four parts, while minimizing the division cost. We have extended the {\em Min-Cut Bisection} algorithm to handle quadrasection. We discuss the implementation details and our results show our implementation to be superior to the simulated annealing code TimberWolf.
Chords of longest circuits in 3-connected graphs
Authors: Xuechao Li, Cun-Quan Zhang
Venue: Discrete Mathematics (2003)

Thomassen conjectured that every longest circuit of a 3-connected graph has a chord. The conjecture is verified in this paper for projective planar graphs with minimum degree at least 4.
The Complexity of Adding Failsafe Fault-Tolerance
Authors: Sandeep S. Kulkarni, Ali Ebnenasir
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) program. A failsafe fault-tolerant program satisfies its specification (including safety and liveness) in the absence of faults. And, in the presence of faults, it satisfies its safety specification. We present a somewhat unexpected result that, in general, the problem of adding failsafe fault-tolerance in distributed programs is NP-hard. Towards this end, we reduce the 3-SAT problem to the problem of adding failsafe fault-tolerance. We also identify a class of specifications, monotonic specifications and a class of programs, monotonic programs. Given a (positive) monotonic specification and a (negative) monotonic program, we show that failsafe fault-tolerance can be added in polynomial time. We note that the monotonicity restrictions are met for commonlyencountered problems such as Byzantine agreement, distributed consensus, and atomic commitment. Finally, we argue that the restrictions on the specifications and programs are necessary to add failsafe fault-tolerance in polynomial time; we prove that if only one of these conditions is satisfied, the addition of failsafe fault-tolerance is still NP-hard.
Social learning mechanisms compared in a simple environment
Authors: Jason Noble, Daniel W. Franks
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Social learning can be adaptive, but little is known about the underlying mechanisms. Many researchers have focused on imitation but this may have led to simpler mechanisms being underestimated. We demonstrate in simulation that imitative learning is not always the best strategy for a group-living animal, and that the effectiveness of any such strategy will depend on details of the environment and the animal's lifestyle. We show that observations of behavioural convergence or "traditions" might suggest effective social learning, but are meaningless considered alone.
Domination of Graphs with Maximum Degree Three
Authors: David C. Fisher, Kathryn Fraughnaugh, Suzanne M. Seager
Venue:  (1996)

We show that a graph with $n$ nodes, $e$ edges, $i$ isolated nodes, and maximum degree 3 or less has domination number at most $\frac14(3n-e+i)$. This overlaps a result of Reed that an $n$-node graph with minimum degree 3 has domination number at most $\frac38n$.
Importing Isabelle Formal Mathematics into NuPRL
Authors: Pavel Naumov
Venue:  (1999)

Isabelle and NuPRL are two theorem proving environments that are written in different dialects of ML using different formula syntaxes and different logical foundations. In spite of this, they have similar sets of basic theories, representing the same mathematical concepts. This paper presents the design of an automated converter from Isabelle into NuPRL that allows sharing formal knowledge between these two provers. Such sharing eliminates the need for re-proving the same results in different systems and opens door for joint work on large verification projects. The paper starts with an overview of the problem and of the related works. The second part outlines the embedding of Isabelle syntax into NuPRL and technical details of the converter design. In the third section logical soundness of this embedding is shown.
SvPablo: A Multi-Language Architecture-Independent Performance Analysis System
Authors: Luiz A. de Rose, Daniel A. Reed
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

In this paper we present the design of SvPablo, a language independent performance analysis and visualization system that can be easily extended to new contexts with minimal changes to the software infrastructure. At present, SvPablo supports analysis of applications written in C, Fortran 77, Fortran 90, and HPF on a variety of sequential and parallel systems. In addition to capturing application data via software instrumentation, SvPablo also exploits hardware performance counters to capture the interaction of software and hardware. Both hardware and software performance data are summarized during program execution, enabling measurement of programs that execute for hours or days on hundreds of processors. This performance data is stored in a format designed to be language transparent and portable. We demonstrate the usefulness of SvPablo for tuning application programs with a case study running on an SGI Origin 2000.
Object Localization by Bayesian Correlation
Authors: J. Sullivan, A. Blake, M. Isard, J. MacCormick
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

Maximization of cross-correlation is a commonly used principle for intensity-based object localization that gives a single estimate of location. However, to facilitate sequential inference (eg over time or scale) and to allow the representation of ambiguity, it is desirable to represent an entire probability distribution for object location. Although the cross-correlation itself (or some function of it) has sometimes been treated as a probability distribution, this is not generally justifiable.Bayesian correlation achieves a consistent probabilistic treatment by combining several developments. The first is the interpretation of correlation matching functions in probabilistic terms, as observation likelihoods. Second, probability distributions of filter-bank responses are learned from training examples. Inescapably, response-learning also demands statistical modeling of background intensities, and there are links here with image coding and Independent Component Analysis. Lastly, multi-scale processing is achieved, in a Bayesian context, by means of a new algorithm, layered sampling, for which asymptotic properties are derived.
Tool Support for Testing Concurrent Java Components
Authors: Brad Long, Daniel Hoffman, Paul Strooper
Venue: IEEE Transactions on Software Engineering (2003)

Concurrent programs are hard to test due to the inherent nondeterminism. This paper presents a method and tool support for testing concurrent Java components. Tool support is offered through ConAn (Concurrency Analyser), a tool for generating drivers for unit testing Java classes that are used in a multithreaded context. To obtain adequate controllability over the interactions between Java threads, the generated driver contains threads that are synchronized by a clock. The driver automatically executes the calls in the test sequence in the prescribed order and compares the outputs against the expected outputs specified in the test sequence. The method and tool are illustrated in detail on an asymmetric producer-consumer monitor. Their application to testing over 20 concurrent components, a number of which are sourced from industry and were found to contain faults, is presented and discussed.
Checking the Convexity of Polytopes and the Planarity of Subdivisions
Authors: Olivier Devillers, Giuseppe Liotta, Franco P. Preparata, Roberto Tamassia
Venue:  (1997)

This paper studies the problem of verifying the correctness of geometric structures. In particular, we design optimal checkers for convex polytopes in two and higher dimensions, and for various types of planar subdivisions, such as triangulations, Delaunay triangulations, and convex subdivisions. Our checkers are simpler and more general than the ones previously described in the literature. Their performance is studied also in terms of the degree, which characterizes the arithmetic precision required.
RTGEN: An Algorithm for Automatic Generation of Reservation Tables from Architectural Descriptions
Authors: Peter Grun, Ashok Halambi, Nikil Dutt, Alex Nicolau
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

Reservation Tables (RTs) have long been used to detect conflicts between operations that simultaneously access the same architectural resource. Traditionally, these RTs have been specified explicitly by the designer. However, the increasing complexity of modern processors makes the manual specification of RTs cumbersome and error-prone. Furthermore, manual specification of such conflict information is infeasible for supporting rapid architectural exploration. In this paper we present an algorithm to automatically generate RTs from a high-level processor description, with the goal of avoiding manual specification of RTs, resulting in more concise architectural specifications and also supporting faster turn-around time in Design Space Exploration. We demonstrate the utility of our approach on a set of experiments using the TI C6201 VLIW DSP and DLX processor architectures, and a suite of multimedia and scientific applications.
Packaging Reusable Components Using Patterns and Hypermedia
Authors: Mônica Ferreira da Silva, Cláudia Maria Lima Werner
Venue: Proceedings of the 4th International Conference on Software Reuse (1996)

Reuse is the key paradigm for increasing productivity and quality in large scale software development. To become systematic, reuse needs supporting tools, among these, the packaging tools. To reuse a complex component, it is necessary to understand its objectives, its architecture and how to use it. Therefore, a reusable component should be packaged with all the documentation necessary to enhance its comprehension and use. Hypermedia can help making the documentation of a component more attractive. The technology of Patterns, describing a problem, its solution and the context within which it works, can structure the data for packaging the component. This paper describes an architecture of a packaging tool for reusable components based on Hypermedia and Patterns technologies.
A Torus Assignment for an Interconnection Network Recursive Diagonal Torus
Authors: Qin Fan, Yulu Yang, Akira Funahashi, Hideharu Amano
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

Recursive Diagonal Torus (RDT) is a class of interconnection network consisting of recursively overlaid two-dimensional square diagonal tori for massively parallel computers with up to $2^{16}$ nodes. Connection structures of the RDT vary according to the assignment of upper rank diagonal tori into a node. Although traditional simple assignment called RDT(2,4,1)/$\alpha$ shows enough performance under the uniform traffic, the congestion of low rank tori degrades the performance when local communication is dominant.In this paper, RDT(2,4,1)/$\beta$ torus assignment is proposed, focusing on improving the performance for local communication. With a simplified simulation algorithm, result shows that RDT(2,4,1)/$\beta$ improves the average distance compared with RDT(2,4,1)/$\alpha$ assignment when considering local area.
Promising Directions in Hardware Design Verification
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

Ensuring the functional correctness of hardware early in the design cycle is crucial for both economic and methodological reasons. However, current verification techniques are inadequate for industrial deisgns. Formal verification techniques are exhaustive but do not scale. Partial verification techniques based on simulation scale well but are not exhaustive. We believe that both classes of techniques will be important in the future of hardware design verification. This paper discusses promising approaches for improving the scalability of formal verification and comprehensiveness of partial verification. 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
Locating faults in a systematic manner in a large heterogeneous network
Authors: S. Paul, R. E. Miller
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

Presents several techniques for locating faults in a network which is modeled as an undirected graph. The novelty of these techniques lies in combining the process of collecting status information (from each network element) with the process of locating a fault, which is completely different from the existing techniques in which fault location begins after all the status information has been collected. The techniques presented in the paper have different characteristics and hence they are applicable in different networking environments. However, an intelligent combination of the techniques can be used in a large scale heterogeneous network in an efficient manner for locating faults.
Difference Graphs
Authors: Boros E., Gurvich V., Meshulam R.
Venue:  (2000)

Intersection and measured intersection graphs are quite common in the literature. In this paper we introduce the analogous concept of measured difference graphs: Given an arbitrary hypergraph $\cH = \{H_1,...,H_n\}$, let us associate to it a graph on vertex set $[n]=\{1,2,...,n\}$ in which $(i,j)$ is an edge iff the corresponding sets $H_i$ and $H_j$ are ``sufficiently different''''. More precisely, given an integer threshold $k$, we consider three definitions, according to which $(i,j)$ is an edge iff (1) $|H_i \setminus H_j| + |H_j \setminus H_i| \geq 2k$, (2) $max\{|H_i \setminus H_j|,|H_j \setminus H_i|\} \geq k$, and (3) $min\{|H_i \setminus H_j|,|H_j \setminus H_i|\} \geq k$. It is not difficult to see that each of the above define hereditary graph classes, which are monotone with respect to $k$. We show that for every graph $G$ there exists a large enough $k$ such that $G$ arises with any of the definitions above. We prove that with the first two definitions one may need $k=\Omega(\log n)$ in any such realizations of certain graphs on $n$ vertices. However, we do not know a graph $G$ which could not be realized by the last definition with $k=2$.
Taggers for Parsers
Authors: Eugene Charniak, Glenn Carroll, John Adcock, Anthony Cassandra, Yoshihiko Gotoh, Jeremy Katz, Michael Littman, John McCann
Venue:  (1994)

We consider what tagging models are most appropriate as front ends for probabilistic context-free-grammar parsers. In particular we ask if using a tagger that returns more than one tag, a ``multple tagger,'''' improves parsing performance. Our conclusion is somewhat surprising: single tag Markov-model taggers are quite adequate for the task. First of all, parsing accuracy, as measured by the correct assignment of parts of speech to words, does not increase significantly when parsers select the tags themselves. In addition, the work required to parse a sentence goes up with increasing tag ambiguity, though not as much as one might expect. Thus, for the moment, single taggers are the best taggers.
On-Line Signature Verification: Fusion of a Hidden Markov Model and a Neural Network via a Support Vector Machine
Authors: Marc Fuentes, Sonia Garcia-Salicetti, Bernadette Dorizzi
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

We propose in this work to perform on-line signature verification by the fusion of two complementary verification modules. The first one considers a signature as a sequence of points and models the genuine signatures of a given signer by a Hidden Markov Model (HMM). Forgeries are used to compute a decision threshold. In the second module, global parameters of a signature are the inputs of a two-classes neural network trained for each signer on both the genuine and "other" signatures (genuine signatures of other signers). Fusion of the scores given by these two experts through a Support Vector Machine (SVM), allows improving the results over those of each module, on Philips' Database.
Mutation Testing Applied to Validate Specifications Based on Statecharts
Authors: Sandra Camargo Pinto Ferraz Fabbri, José Carlos Maldonado, Tatiana Sugeta, Paulo Cesar Masiero
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

The establishment of a low-cost, effective testing and validation strategy has been pursued by many researchers at the program level as well as at the specification level. The application of Mutation Testing for validating specifications based on Statecharts is proposed. A mutation operator set for Statecharts ? one of the crucial points for effectively applying Mutation Testing ? is defined; in this scope these operators can be taken as a fault model. We also provide strategies to abstract the statecharts components according to different Statecharts features that may comprise the testing and validation activity aims, providing is this way mechanisms for the establishment of an incremental, hierarchical, mutation-based testing strategy. Implementation and functional aspects of PROTEUM/ST, a tool currently under development, are also presented.
Closed-Form Expressions for Irradiance from Non-Uniform Lambertian Luminaires Part I: Linearly-Varying Radiant Exitance
Authors: Min Chen, James Arvo
Venue:  (2000)

We present a closed-form expression for the irradiance at a point on a surface due to an arbitrary polygonal Lambertian lurninaire with linearly-varying radiant exitance. The solution consists of elementary functions and a single well-behaved special function that can be either approximated directly or computed exactly in terms of classical special functions such as Clausen''s integral or the closely related dilogarithm. We first provide a general boundary integral that applies to all planar luminaires and then derive the closed-form expression that applies to arbitrary polygons, which is the result most relevant for global illumination. Our approach is to express the problem as an integral of a simple class of rational functions over regions of the sphere, and to convert the surface integral to a boundary integral using a generalization of irradiance tensors. The result extends the class of available closed-form expressions for computing direct radiative transfer from finite areas to differential areas. We provide an outline of the derivation, a detailed proof of the resulting formula, and complete pseudo-code of the resulting algorithm. Finally, we demonstrate the validity of our algorithm by comparison with Monte Carlo. While there are direct applications of this work, it is primarily of theoretical interest as it introduces much of the machinery needed to derive closed-form solutions for the general case of luminaires with radiance distributions that vary polynomially in both position and direction.