Reliability analysis of static and dynamic fault-tolerant systems subject to probabilistic

On Reichenbach’s common cause principle and

, there is no reason why Markov networks should be the only representation of choice for symmetric dependence structures. Here we discuss the case when relationships are postulated to exist due to hidden common causes. We discuss how the resulting graphical model differs from Markov networks, and how it describes

According to Reichenbach’s principle of common cause, positive statistical correlations for which no straightforward causal explanation is available should be explained by invoking the action of a hidden conjunctive common cause. Hofer-Szabó and Rédei’s notion of a Reichenbachian common cause

SUMMARY An analysis of 50000 patients ' medical records was made to determine the commonest causes of blindness in Zaire. It was found that the commonest causes of blindness in order of frequency were glaucoma (31%), cataract (18-4%), optic atrophy (16.3%), onchocerciasis (4.9%), and corneal

In my view … it is impossible to understand this crisis without reference to the global imbalances in trade and capital flows that began in the latter half of the 1990s.

International macroeconomics is a field replete with truly perplexing puz-zles, and we generally have five to ten (or more) alternative answers to each of them. These answers are typically very clever but far from thor-oughly convincing, and so the puzzles remain. Why do people seem to

Abstract. I study the interplay between stochastic dependence and causal relations within the setting of Bayesian networks and in terms of information theory. The application of a recently defined causal information flow measure provides a quantitative refinement of Reichenbach’s common cause

to that of the rest of the population. Speculations on the causes of these individuals ' extraordinary abilities and performance are as old as the first records of their achievements. Early accounts commonly attribute these individuals' outstanding performance to divine intervention, such as the

This paper describes a new replication algorithm that is able to tolerate Byzantine faults. We believe that Byzantinefault-tolerant algorithms will be increasingly important in the future because malicious attacks and software errors are increasingly common and can cause faulty nodes to exhibit