Results 1  10
of
6,161
PartialOrder Methods for the Verification of Concurrent Systems  An Approach to the StateExplosion Problem
, 1995
"... Statespace exploration techniques are increasingly being used for debugging and proving correct finitestate concurrent reactive systems. The reason for this success is mainly the simplicity of these techniques. Indeed, they are easy to understand, easy to implement and, last but not least, easy to ..."
Abstract

Cited by 362 (11 self)
 Add to MetaCart
Statespace exploration techniques are increasingly being used for debugging and proving correct finitestate concurrent reactive systems. The reason for this success is mainly the simplicity of these techniques. Indeed, they are easy to understand, easy to implement and, last but not least, easy to use: they are fully automatic. Moreover, the range of properties that they can verify has been substantially broadened thanks to the development of modelchecking methods for various temporal logics. The main limit of statespace exploration verification techniques is the often excessive size of the state space due, among other causes, to the modeling of concurrency by interleaving. However, exploring all interleavings of concurrent events is not a priori necessary for verification: interleavings corresponding to the same concurrent execution contain related information. One can thus hope to be able to verify properties of a concurrent system without exploring all interleavings of its concu...
Are There Universal Aspects in the Structure and Contents of Human Values
 Journal of Social Issues
, 1994
"... This article presents a theory of potentially universal aspects in the content of human values. Ten types of values are distinguished by their motivational goals. ..."
Abstract

Cited by 289 (2 self)
 Add to MetaCart
This article presents a theory of potentially universal aspects in the content of human values. Ten types of values are distinguished by their motivational goals.
Self Organization of a Massive Document Collection
 IEEE Transactions on Neural Networks
"... This article describes the implementation of a system that is able to organize vast document collections according to textual similarities. It is based on the SelfOrganizing Map (SOM) algorithm. As the feature vectors for the documents we use statistical representations of their vocabularies. The m ..."
Abstract

Cited by 256 (14 self)
 Add to MetaCart
This article describes the implementation of a system that is able to organize vast document collections according to textual similarities. It is based on the SelfOrganizing Map (SOM) algorithm. As the feature vectors for the documents we use statistical representations of their vocabularies. The main goal in our work has been to scale up the SOM algorithm to be able to deal with large amounts of highdimensional data. In a practical experiment we mapped 6,840,568 patent abstracts onto a 1,002,240node SOM. As the feature vectors we used 500dimensional vectors of stochastic figures obtained as random projections of weighted word histograms. Keywords Data mining, exploratory data analysis, knowledge discovery, large databases, parallel implementation, random projection, SelfOrganizing Map (SOM), textual documents. I. Introduction A. From simple searches to browsing of selforganized data collections Locating documents on the basis of keywords and simple search expressions is a c...
Inferring activities from interactions with objects
 IEEE Pervasive Computing
, 2004
"... Recognizing and recording activities of daily living is a significant problem in elder care. A new paradigm for ADL inferencing leverages radiofrequencyidentification technology, data mining, and a probabilistic inference engine to recognize ADLs, based on the objects people use. ..."
Abstract

Cited by 253 (14 self)
 Add to MetaCart
Recognizing and recording activities of daily living is a significant problem in elder care. A new paradigm for ADL inferencing leverages radiofrequencyidentification technology, data mining, and a probabilistic inference engine to recognize ADLs, based on the objects people use.
An Adaptive Metropolis algorithm
 Bernoulli
, 1998
"... A proper choice of a proposal distribution for MCMC methods, e.g. for the MetropolisHastings algorithm, is well known to be a crucial factor for the convergence of the algorithm. In this paper we introduce an adaptive Metropolis Algorithm (AM), where the Gaussian proposal distribution is updated al ..."
Abstract

Cited by 216 (8 self)
 Add to MetaCart
A proper choice of a proposal distribution for MCMC methods, e.g. for the MetropolisHastings algorithm, is well known to be a crucial factor for the convergence of the algorithm. In this paper we introduce an adaptive Metropolis Algorithm (AM), where the Gaussian proposal distribution is updated along the process using the full information cumulated so far. Due to the adaptive nature of the process, the AM algorithm is nonMarkovian, but we establish here that it has the correct ergodic properties. We also include the results of our numerical tests, which indicate that the AM algorithm competes well with traditional MetropolisHastings algorithms, and demonstrate that AM provides an easy to use algorithm for practical computation. 1991 Mathematics Subject Classification: 65C05, 65U05. Keywords: adaptive MCMC, comparison, convergence, ergodicity, Markov Chain Monte Carlo, MetropolisHastings algorithm 1 Introduction It is generally acknowledged that the choice of an effective proposal...
Coalitions Among Computationally Bounded Agents
 Artificial Intelligence
, 1997
"... This paper analyzes coalitions among selfinterested agents that need to solve combinatorial optimization problems to operate e ciently in the world. By colluding (coordinating their actions by solving a joint optimization problem) the agents can sometimes save costs compared to operating individua ..."
Abstract

Cited by 202 (26 self)
 Add to MetaCart
This paper analyzes coalitions among selfinterested agents that need to solve combinatorial optimization problems to operate e ciently in the world. By colluding (coordinating their actions by solving a joint optimization problem) the agents can sometimes save costs compared to operating individually. A model of bounded rationality is adopted where computation resources are costly. It is not worthwhile solving the problems optimally: solution quality is decisiontheoretically traded o against computation cost. A normative, application and protocolindependent theory of coalitions among boundedrational agents is devised. The optimal coalition structure and its stability are signi cantly a ected by the agents ' algorithms ' performance pro les and the cost of computation. This relationship is rst analyzed theoretically. Then a domain classi cation including rational and boundedrational agents is introduced. Experimental results are presented in vehicle routing with real data from ve dispatch centers. This problem is NPcomplete and the instances are so large thatwith current technologyany agent's rationality is bounded by computational complexity. 1
from the Jenny and Antti Wihuri Foundation.
, 2015
"... © The Author(s) 2015. This article is published with open access at Springerlink.com Abstract We investigate extensions of dependence logic with generalized quantifiers. We also introduce and investigate the notion of a generalized atom. We define a system of semantics that can accommodate variants ..."
Abstract
 Add to MetaCart
© The Author(s) 2015. This article is published with open access at Springerlink.com Abstract We investigate extensions of dependence logic with generalized quantifiers. We also introduce and investigate the notion of a generalized atom. We define a system of semantics that can accommodate variants of dependence logic, possibly extended with generalized quantifiers and generalized atoms, under the same umbrella framework. The semantics is based on pairs of teams, or double teams. We also devise a gametheoretic semantics equivalent to the double team semantics. We make use of the double team semantics by defining a logic DC2 which canonically fuses together twovariable dependence logic D2 and twovariable logic with counting quantifiers FOC2. We establish that the satisfiability and finite satisfiability problems of DC2 are complete for NEXPTIME.
Quantum Equilibrium and the Origin of Absolute Uncertainty
, 1992
"... The quantum formalism is a "measurement" formalisma phenomenological formalism describing certain macroscopic regularities. We argue that it can be regarded, and best be understood, as arising from Bohmian mechanics, which is what emerges from Schr6dinger's equation for a system of ..."
Abstract

Cited by 166 (52 self)
 Add to MetaCart
The quantum formalism is a "measurement" formalisma phenomenological formalism describing certain macroscopic regularities. We argue that it can be regarded, and best be understood, as arising from Bohmian mechanics, which is what emerges from Schr6dinger's equation for a system of particles when we merely insist that "particles " means particles. While distinctly nonNewtonian, Bohmian mechanics is a fully deterministic theory of particles in motion, a motion choreographed by the wave function. We find that a Bohmian universe, though deterministic, evolves in such a manner that an appearance of randomness emerges, precisely as described by the quantum formalism and given, for example, by "p = IV [ 2.,, A crucial ingredient in our analysis of the origin of this randomness is the notion of the effective wave function of a subsystem, a notion of interest in its own right and of relevance to any discussion of quantum theory. When the quantum formalism is regarded as arising in this way, the paradoxes and perplexities so often associated with (nonrelativistic) quantum theory simply evaporate.
Results 1  10
of
6,161