Results 1  10
of
4,442
Eventual leader election with weak assumptions on initial knowledge, communication reliability, and synchrony
 In DSN
, 2006
"... This paper considers the eventual leader election problem in asynchronous messagepassing systems where an arbitrary number t of processes can crash (t < n, where n is the total number of processes). It considers weak assumptions both on the initial knowledge of the processes and on the network b ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
This paper considers the eventual leader election problem in asynchronous messagepassing systems where an arbitrary number t of processes can crash (t < n, where n is the total number of processes). It considers weak assumptions both on the initial knowledge of the processes and on the network
Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony
, 2009
"... Abstract This paper considers the eventual leader election problem in asynchronous messagepassing systems where an arbitrary number t of processes can crash (t < n, where n is the total number of processes). It considers weak assumptions both on the initial knowledge of the processes and on the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract This paper considers the eventual leader election problem in asynchronous messagepassing systems where an arbitrary number t of processes can crash (t < n, where n is the total number of processes). It considers weak assumptions both on the initial knowledge of the processes
Strong laws of large numbers under weak assumptions with applications
 IEEE TRANSACTIONS ON
, 2000
"... The employment of ‘Strong Laws of Large Numbers ’ is instrumental to the analysis of system estimation and identification strategies. However, the vast bulk of such laws, as presented in the wider literature, assume independence or at least uncorrelatedness of random components and these assumptions ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
and these assumptions are quite restrictive from an engineering point of view. By way of contrast, this paper shows how to establish strong laws for possibly nonstationary random processes with very general dependence structure. Brief examples are provided that illustrate the utility of the Strong Law of Large Numbers
On the Private Provision of Public Goods
 Journal of Public Economics
, 1986
"... We consider a general model of the noncooperative provision of a public good. Under very weak assumptions there will always exist a unique Nash equilibrium in our model. A small redistribution of wealth among the contributing consumers will not change the equilibrium amount of the public good. Howe ..."
Abstract

Cited by 564 (9 self)
 Add to MetaCart
We consider a general model of the noncooperative provision of a public good. Under very weak assumptions there will always exist a unique Nash equilibrium in our model. A small redistribution of wealth among the contributing consumers will not change the equilibrium amount of the public good
MultiBit Differential Fault Analysis of Grain128 with Very Weak Assumptions
"... Abstract. Very few differential fault attacks (DFA) were reported on Grain128 so far. In this paper we present a generic attack strategy that allows the adversary to challenge the cipher under different multibit fault models with faults at a targeted keystream generation round even if bit arrangem ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Very few differential fault attacks (DFA) were reported on Grain128 so far. In this paper we present a generic attack strategy that allows the adversary to challenge the cipher under different multibit fault models with faults at a targeted keystream generation round even if bit arrangement of the actual cipher device is unknown. Also unique identification of fault locations is not necessary. To the best of our knowledge, this paper assumes the weakest adversarial power ever considered in the open literature for DFA on Grain128 and develops the most realistic attack strategy so far on Grain128. In particular, when a random area within k ∈ {1, 2, 3, 4, 5} neighbourhood bits can only be disturbed by a single fault injection at the first keystream generation round (kneighbourhood bit fault), without knowing the locations or the exact number of bits the injected fault has altered, our attack strategy always breaks the cipher with 5 faults. In a weaker setup even if bit arrangement of the cipher device is unknown, badfaults (at the first keystream generation round) are rejected with probabilities 0.999993, 0.999979, 0.999963, 0.999946 and 0.999921 assuming that the adversary will use only 1, 2, 3, 4 and 5 neighbourhood bit faults respectively for keyIV recovery.
The Cyclical Behavior of Equilibrium Unemployment and Vacancies
 American Economic Review
, 2005
"... This paper argues that a broad class of search models cannot generate the observed businesscyclefrequency fluctuations in unemployment and job vacancies in response to shocks of a plausible magnitude. In the U.S., the vacancyunemployment ratio is 20 times as volatile as average labor productivity ..."
Abstract

Cited by 871 (23 self)
 Add to MetaCart
productivity, while under weak assumptions, search models predict that the vacancyunemployment ratio and labor productivity have nearly the same variance. I establish this claim both using analytical comparative statics in a very general deterministic search model and using simulations of a stochastic version
Blind Signal Separation: Statistical Principles
, 2003
"... Blind signal separation (BSS) and independent component analysis (ICA) are emerging techniques of array processing and data analysis, aiming at recovering unobserved signals or `sources' from observed mixtures (typically, the output of an array of sensors), exploiting only the assumption of mut ..."
Abstract

Cited by 529 (4 self)
 Add to MetaCart
of mutual independence between the signals. The weakness of the assumptions makes it a powerful approach but requires to venture beyond familiar second order statistics. The objective of this paper is to review some of the approaches that have been recently developed to address this exciting problem
A randomized protocol for signing contracts
, 1990
"... Two parties, A and B, want to sign a contract C over a communication network. To do so, they must “simultaneously” exchange their commitments to C. Since simultaneous exchange is usually impossible in practice, protocols are needed to approximate simultaneity by exchanging partial commitments in pie ..."
Abstract

Cited by 599 (11 self)
 Add to MetaCart
commit both parties to the contract given that the other party can, is close to zero. This is true even if A and B have vastly different computing powers, and is proved under very weak cryptographic assumptions. Our protocol has the following additional properties: 4 during the procedure the parties
A calculus of mobile processes, I
, 1992
"... We present the acalculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The ..."
Abstract

Cited by 1184 (31 self)
 Add to MetaCart
indexed by distinctionsi.e., assumptions of inequality among names. These theories are based upon a semantics in terms of a labeled transition system and a notion of strong bisimulation, both of which are expounded in detail in a companion paper. We also report briefly on workinprogress based upon
The DLV System for Knowledge Representation and Reasoning
 ACM Transactions on Computational Logic
, 2002
"... Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely believ ..."
Abstract

Cited by 456 (102 self)
 Add to MetaCart
believed assumptions, DLP is strictly more expressive than normal (disjunctionfree) logic programming, whose expressiveness is limited to properties decidable in NP. Importantly, apart from enlarging the class of applications which can be encoded in the language, disjunction often allows for representing
Results 1  10
of
4,442