ppxscal/embedding_network huggingface dataset:
Agents and the algebra of emotion
Authors: S S. Nemani, V. H. Allan
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Using NAMS (Negotiating Agents and Marital Stability), a couple who is considering marriage is aided in evaluating their compatibility. Using a vector of fundamental emotions, our algebra of emotion allows us to model self-generating emotions (such an interest or anger), have history-sensitive interactions, and accommodate gender differences.
Data Mining of Weak Functional Decompositions
Authors: Szymon Jaroszewicz, Dan A. Simovici
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

A weak decomposition of an incompletely specified function is a decomposition of some completion of the function. Using a graph-theoretical characterization of functions that admit such decompositions, we present a technique derived from the Apriori algorithm that allows a data mining approach to identifying these decompositions.
Introducing the notion of processes to hardware
Authors: Jan L. A. van de Snepscheut
Venue: ACM SIGARCH Computer Architecture News (1979)

A simple multiplexing technique is shown to lead to a starvation-free process-dispatching strategy without making any assumptions about the behaviour of a process. A strong implementation of semaphores is presented using associative hardware.
Hysteresis in phase-field models with thermal memory
Authors: Gianni Gilardi, Pavel Krejci, Juergen Sprekels
Venue:  (1999)

Phase-field systems as mathematical models for phase transitions have drawn increasing attention in recent years. However, while capable of capturing many of the experimentally observed phenomena, they are only of restricted value in modelling hysteresis effects occurring during phase transition processes. To overcome this shortcoming, a new approach has recently been proposed by the last two authors which is based on the mathematical theory of hysteresis operators developed in the past fifteen years. In this paper this approach is extended to cases where the material exhibits an additional thermal memory, i.e., where the heat flux contains a time convolution of the spatial gradient of temperature. It is shown that the corresponding system of field equations admits a unique strong solution that depends continuously on the data of the system. EMAIL:: gilardi@dimat.unipv.it KEYWORDS:: Hysteresis, phase-field models, memory
GLADE: A Framework for Building Large Object-Oriented Real-Time Distributed Systems
Authors: Laurent Pautet, Samuel Tardieu
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

This paper describes how GLADE, our implementation of the Ada 95 Distributed Systems Annex, can be used to build large object-oriented real-time distributed systems. In addition to the powerful distribution features included in the Ada 95 language itself, we provide extensions to help the programmer build robust and failsafe distributed applications.
Time Series Generation by Recurrent Neural Networks
Authors: A. Priel, I. Kanter
Venue: Annals of Mathematics and Artificial Intelligence (2003)

The properties of time series, generated by continuous valued feed-forward networks in which the next input vector is determined from past output values, are studied. Asymptotic solutions developed suggest that the typical stable behavior is (quasi) periodic with attractor dimension that is limited by the number of hidden units, independent of the details of the weights. The results are robust under additive noise, except for expected noise-induced effects &ndash; attractor broadening and loss of phase coherence at large times. These effects, however, are moderated by the size of the network N.
Predicting Timeliness of Reactive Systems under Flexible Scheduling
Authors: Giacomo Bucci, Andrea Fedeli, Enrico Vicario
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

A modeling and validation approach extending the formalism of Time Petri Nets for the analysis of real time systems with flexible scheduling capabilities is introduced. The new formalism is called AdaptiveTPNs. State space analysis of the model supports exhaustive prediction of the time needed to complete critical functions, and permits automatic identification of loading conditions which determine the reduction of the quality of produced results.
Undecidable Boundedness Problem For Datalog Program
Authors: Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, Moshe Y. Vardi
Venue:  (1992)

A given Datalog program is bounded if its depth of recursion is independent of the input database. Deciding boundedness is a basic task for the analysis of database logic programs. The undecidability of Datalog boundedness was first demonstrated by Gaifman et al. We introduce new techniques for proving the undecidability of various kinds of boundedness, which allow us to considerably strengthen the results of Gaifman et al. In particular: (1) We use a new generic reduction technique to show that program boundedness is undecidable for arity 2 predicates, even with linear rules. (2) We use the mortality problem of Turing machines to show that uniform boundedness is undecidable for arity 3 predicates and for arity 1 predicates when $\ne$ is also allowed. (3) We use a single rule polymorphically to show that program (resp., predicate) boundedness is undecidable for two linear rules (resp., one rule and a projection), one initialization rule and small arity predicates.
Measuring Software Dependability by Robustness Benchmarking
Authors: Arup Mukherjee, Daniel P. Siewiorek
Venue:  (1994)

Inability to identify weaknesses or to quantify advancements in software system robustness frequently hinders the development of robust software systems. Efforts have been made to develop benchmarks of software robustness to address this problem, but they all suffer from significant shortcomings. This paper presents the various features that are desirable in a benchmark of system robustness,and evaluates some existing benchmarks according to these features. A new hierarchically structured approach to building robustness benchmarks, which overcomes many deficiencies of past efforts, is also presented. This approach has been applied to building a hierarchically structured benchmark that tests part of the Unix file and virtual memory systems. The resultant benchmark has successfully been used to identify new response class stuctures that were not detected in a similar situation by other less organized techniques.
Building block filtering and mixing
Authors: Cees H.M. Kemenade
Venue:  (1998)

A three-stage evolutionary method, the BBF-GA is introduced. BBF-GA is an acronym for building block filtering genetic algorithm. During the first stage, an ensemble of fast evolutionary algorithms is used to explore the search space. The best individual found by each of these evolutionary algorithms is propagated to the next phase. During the second stage, building block filtering is used to extract the essential parts of each of these local optimal strings, and masks these essential parts. During the third stage, a single evolutionary algorithm is used to find the global optimum by recombining the masked strings. For this purpose we use a special recombination operator that exploits the information stored in the masks. Given an appropriate basis, such that partial solutions can be discovered and evaluated in parallel and be combined afterwards, a recombination-based evolutionary algorithm can be very efficient. Therefore, learning of the structure of problem-spaces is important to make a more efficient recombination possible. The BBF-GA is a first step along this line for binary search spaces and problems that adhere to the building block hypothesis.
Inexact Agreement: Accuracy, Precision, and Graceful Degradation
Authors: Stephen R. Mahaney, Fred B. Schneider
Venue:  (1985)

An Inexact Agreement protocol alows processors that each have a value approximating $\hat{\nu}$ to compute new values that are closer to each other and close to $\hat{\nu}$. Two fault-tolerant protocols for Inexact Agreement are described. As long as fewer than 1/3 of the processors are faulty, the protocols give the required convergence; they also permit iteration and thus convergence to any desired precision. When between 1/3 and 2/3 of the processors are faulty, the protocols may not converge. However, then processors either detect that too many faults have occurred or the new values computed by processors remain close to each other and to $\hat{\nu}$. In this case, the divergence is bounded. Use of the protocols for clock synchronization in a distributed system is explained.
Location Transparent Distributed Scripts and their Execution System on D'Agent
Authors: Osamu Honda, Harumasa Tada, Masahiro Higuchi
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

Ease of programming is the main merit of script languages. In distributed computing environment, programmers need to be aware of locations of resources and need to write additional codes for using remote resources in scripts. This makes scripts more complicated than those which use only local resources and cancels out the merit of script languages. In this paper, we propose a virtual single computer model on which programmers needn't be aware of locations of resources. Programmers write scripts which use remote resources and scripts which use only local resources in the same way. We developed a prototype system which executes such scripts. The system is implemented on the existing mobile agent system called D'Agent. We evaluated the system through an experiment and demonstrated its usefulness.
Using XML with Legacy Business Applications
Authors: Michael C. Rawlins
Venue:  (2003)

From the Book:Some day most business applications will be able to read and write XML files. Until that happens, you are probably going to need techniques and utilities like those presented in this book. This book is for people who use business applications that don't currently support XML, and for people who develop those applications and want to build XML support into them. It is designed to provide a tool kit of techniques and utilities that can help you to perform common EAI, B2B, and EDI data conversion operations using XML.Nothing in this book is rocket science. Any good programmer with experience in the relevant technologies could develop any of these techniques and utilities. The point of this book is that I've done it so that you don't have to. As is often said, good programmers develop good programs. Better programmers steal what they can and modify it. Steal this code.If you are a user of a business application and already have or can afford to procure a capable EAI or EDI software package, you probably don't need this book. However, if you only have some simple needs that don't justify the purchase of such a package, or if for some other reason you don't want to or can't afford to spend thousands of dollars to purchase one, then this book is for you. In addition, if you are interested in an open, nonproprietary, standards based, and portable approach to data conversion, then this book is for you, too.
A Novel Approach to Fast Discrete Hartley Transform
Authors: J. G. Liu, F. H. Y. Chan, F. K. Lam, H. F. Li
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

Discrete Hartley transform (DHT) is an important tool in digital signal processing. In this present paper, we propose a novel approach to perform DHT. We transform DHT into a form expressed in discrete moments via a modular mapping and truncating Taylor series expansion and present a completely new formula for computing DHT. We extend the use of our systolic array for fast computation of moments without any multiplications to one that computes DHT with only a few multiplications and without any evaluations of triangular functions. The multiplication number used in our method is O(Nlog2N/log2log2N) superior to O(Nlog2N) in the conventional FDT. The execution time of the systolic array is only O(N log2N/log2log2N) for 1-D DHT and O(Nk) for k-D DHT(k2). The systolic array consists of very simple processing elements and hence it implies an easy and potential hardware/VLSI implementation. The approach is also applicable to DHT inverses.
Foundry's Perspective of System Integration: Quality Design and Time-to-Volume
Authors: Fred Wang
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

Component development with complicated system integration faces great new challenges in today's disintegrated IC industry. Designers have to collaborate with different vendors of EDA tools, design flows, library, IP, and manufacturing process globally who all have different views of quality and deliverable. The purpose of this paper is to demonstrate how foundry can support the design community by setting up standards and methodologies from process technology development to design infrastructure development. Using the integrated services with common roots, designers can enjoy the highest quality and best time-to-volume for system integration. 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
Fault-Free Hamiltonian Cycles in Faulty Butterfly Graphs
Authors: Shien-Ching Hwang, Gen-Huey Chen
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

The butterfly graphs were originally defined as the underlying graphs of FFT networks, which can perform the fast Fourier, transform (FFT) very efficiently. Since butterfly graphs are regular of degree four, it can tolerate at most two edge faults in the worst case in order to establish a Hamiltonian cycle. In this paper, we show that butterfly graphs contain a fault-free Hamiltonian cycle even if it has two random edge faults.
Japanese Cultural and Digital Art Resources on the Internet
Venue: Proceedings of the International Conference on Information Visualisation (2000)

I had been engaged to develop information resources for network business and about five years ago, the Internet spread globally. My research on human communication via the Internet had discovered several domestic problems in Japan. If we want to promote Internet business and culture communication by WWW, we should consider bumped experiences though; looking forward for such, experiences were not accidental. We should be able to estimate our experience towards a specific destiny. This paper tries to address some of the experiences on communication via the Internet within Japanese culture. Using case studies, this research paper points out very important guideline for digital drawing. The author examines various computer-generated products based on cross-cultural interactions. The data used in this research was compiled data from surveys of approximately 1,000 subjects and considered about seven digital products. We believe that the emerging field of digital art would have much to gain from improved cross-cultural communications, eventually giving rise to art works comparable to those created by Van Gogh, Picasso, or Magritte.
The role of high-level and low-level features in semi-automated retrieval and generation of multimedia presentations
Authors: F. Nack, Menzo A. Windhouwer, E. J. Pauwels, M. W.J.H. Huijberts, Lynda Hardman
Venue:  (2001)

In this article we argue that for the automatic generation of adaptive multimedia presentations we are in need of expandable, adaptable style descriptions which provide both high-level conceptual and low-level feature extraction information. Only the combination of both facilitates the retrieval of adequate material and its user-centred presentation. We discuss the requirements for an adaptable Web-based environment for museums presenting visual artefacts. We then present the framework of our prototype multimedia generation environment which transforms a high-level user query into a concrete multimedia final-form encoding that is playable on an end-users'' platform. We describe the underlying architecture and provide a working example.
Recursive Definitions in Type Theory
Authors: Robert L. Constable, N. P. Mendler
Venue:  (1985)

The type theories we consider are adequate for the foundations of mathematics and computer science. Recursive type definitions are important practical ways to organize data, and they express powerful axioms about the termination of procedures. In the theory examined here, the demands of practicality arising from our implemented system, Nuprl, suggest an approach to recursive types that significantly increases the proof theoretic power of the theory and leads to insights into computational semantics. We offer a new account of recursive definitions for both types and partial functions. The computational requirements of the theory restrict recursive type definitions involving the total function-space constructor ($\rightarrow$) to those with only positive occurrences of the defined type. But we show that arbitrary recursive definitions with respect to the partial function-space constructor are sensible. The partial function-space constructor allows us to express reflexive types of Scott''s domain theory (as needed to model the lambda calculus) and thereby reconcile parts of domain theory with constructive type theory.
A Wigner Measure Analysis of the Dufort-Frankel Scheme for the Schroedinger Equation
Authors: Peter A. Markowich, Paola Pietra, Carsten Pohl, Hans P Stimming
Venue:  (2000)

We apply the Wigner transform techniques to the analysis of the Dufort-Frankel difference scheme for the Schroedinger equation in the case of a small (scaled) Planck constant (semiclassical regime). In this way we are able to obtain sharp conditions on the spatial temporal grid which guarantee convergence for the average value of observables when the Planck constant tends to zero. The theory developed in this paper is not based on local and global error estimates and does not depend whether caustics develop or not. Numerical tests are presented to help to interpret the theory and to compare the Dufort-Frankel scheme with other difference schemes for the Schroedinger equation
Self-Healing Networks
Venue: Queue (2003)

The obvious advantage to wireless communication over wired is, as they say in the real estate business, location, location, location. Individuals and industries choose wireless because it allows flexibility of location--whether that means mobility, portability, or just ease of installation at a fixed point. The challenge of wireless communication is that, unlike the mostly error-free transmission environments provided by cables, the environment that wireless communications travel through is unpredictable. Environmental radio-frequency (RF) "noise" produced by powerful motors, other wireless devices, microwaves--and even the moisture content in the air--can make wireless communication unreliable.
Perfect Dominating Sets of Grids
Authors: Dejter Italo J.
Venue:  (2000)

Let m and n be positive integers. The algorithmic search for perfect dominating sets of the rectangular grid G(m,n) with an initial condition S'' defined as an admissible subset of a side G(m,1) of G(m,n) is considered. A binary decision algorithm that generates all perfect dominating sets of G(m,n) satisfying (or containing) such S'' is presented, and some related questions and conjectures are posed, leading to consideration of their periodic extendibility to the plane lattice as well as to extremal properties of the grid depth n for a fixed grid width m under the presence of such dominating sets.
Approximation Algorithms for Curvature Constrained Shortest Paths
Authors: Hongyan Wang, K P Agarwal
Venue:  (1996)

Let $B$ be a point robot in the plane, whose path is constrained to have curvature of at most $1$, and let $\Omega$ be a set of polygonal obstacles with $n$ vertices. We study the collision-free, optimal path-planning problem for $B$. Given a parameter $arepsilon$, we present an $O(n^2/arepsilon^4 \log n)$-time algorithm for computing a collision-free, curvature-constrained path between two given positions, whose length is at most $(1 arepsilon)$ times the length of an optimal robust path (a path is robust if it remains collision-free even if certain positions on the path are perturbed). Our algorithm thus runs significantly faster than the previously best known algorithm by Jacobs and Canny whose running time is $\oldtime$, where $L$ is the total edge length of the obstacles. More importantly, the running time of our algorithm does not depend on the size of obstacles. The path returned by this algorithm is not necessarily robust. We present an $O(n^{2.5}/arepsilon^4 \log n)$-time algorithm that returns a robust path whose length is at most $(1 arepsilon)$ times We also give a stronger characterization of curvature-constrained shortest paths, which, apart from being crucial for our algorithm, is interesting in its own right. Roughly speaking, we prove that, except in some special cases, a shortest path touches obstacles at points that have a visible vertex nearby.
Distributed data mining of probabilistic knowledge
Authors: W. Lam, A. M. Segre
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

We present a distributed approach to data mining of a knowledge representation scheme known as Bayesian belief networks which are capable of dealing with uncertain knowledge. We make use of a machine learning paradigm and a distributed asynchronous search technique to achieve the task of distributed knowledge discovery from data. Our approach boasts a number of features, including dynamic load balancing and fault tolerance. Empirical experiments have been conducted to illustrate its feasibility, solving large scale Bayesian network discovery problems with multiple workstations.
A Formal Approach to Testing Lustre Specifications
Authors: Ioannis Parissis
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

Lustre is a synchronous declarative language designed to specify and to implement reactive software. One of its main advantages is that it can be used as a temporal logic to express software invariant properties. The satisfaction of the latter can be proven by model-checking, using Lesar, a verification tool designed for Lustre programs. In this paper, we address two important problems related to this verification process. First, developing the specifications of a synchronous software is a difficult and error-prone task. Before attempting to formally prove their satisfaction, one should validate them. We propose random automatic animation as a means to validate such formal specifications. Second, due to the often huge required memory and time amounts, proof may not be applicable, in which case the specification work is wasted. To cope with this problem, we propose testing techniques which reuse the software specifications to formally test the software.