Search results for "Random"

Conclusions: Take-Home Messages

2014

In this chapter, which mainly consists of headlines, the take-home messages of the lecture notes are presented.

Communication complexity in a 3-computer model

1996

It is proved that the probabilistic communication complexity of the identity function in a 3-computer model isO(√n).

Combining finite learning automata with GSAT for the satisfiability problem

2010

A large number of problems that occur in knowledge-representation, learning, very large scale integration technology (VLSI-design), and other areas of artificial intelligence, are essentially satisfiability problems. The satisfiability problem refers to the task of finding a satisfying assignment that makes a Boolean expression evaluate to True. The growing need for more efficient and scalable algorithms has led to the development of a large number of SAT solvers. This paper reports the first approach that combines finite learning automata with the greedy satisfiability algorithm (GSAT). In brief, we introduce a new algorithm that integrates finite learning automata and traditional GSAT use…

Conjunction, Disjunction and Iterated Conditioning of Conditional Events

2013

Starting from a recent paper by S. Kaufmann, we introduce a notion of conjunction of two conditional events and then we analyze it in the setting of coherence. We give a representation of the conjoined conditional and we show that this new object is a conditional random quantity, whose set of possible values normally contains the probabilities assessed for the two conditional events. We examine some cases of logical dependencies, where the conjunction is a conditional event; moreover, we give the lower and upper bounds on the conjunction. We also examine an apparent paradox concerning stochastic independence which can actually be explained in terms of uncorrelation. We briefly introduce the…

Robustness and Randomness

2008

The study of robustness problems for computational geometry algorithms is a topic that has been subject to intensive research efforts from both computer science and mathematics communities. Robustness problems are caused by the lack of precision in computations involving floating-point instead of real numbers. This paper reviews methods dealing with robustness and inaccuracy problems. It discusses approaches based on exact arithmetic, interval arithmetic and probabilistic methods. The paper investigates the possibility to use randomness at certain levels of reasoning to make geometric constructions more robust.

Optimal Resource Discovery Paths of Gnutella2

2008

This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal query paths for the peer-to-peer resource discovery problem. Global knowledge of the topology and the resources from the peer-to-peer network are required as an input to the algorithm. The algorithm provides an objective measure for defining how good local search algorithms are. The performance is evaluated in simulated peer-to-peer scenarios and in the measured Gnutella2 P2P network topology with four local search algorithms: breadth-first search, self-avoiding random walker, highest degree search and Dynamic Query …

Aging effects in simple models for glassy relaxation

2006

Aging effects in the two-time correlation function and the response function after a quench from a high temperature to some low temperature are considered for a simple kinetic random energy model exhibiting stretched exponential relaxation. Because the system reaches thermal equilibrium for long times after the quench, all aging effect are of a transient nature. In particular, the violations of the fluctuation-dissipation theorem are considered and it is found that the relation between the response and the two-time correlation function depends on another function, the so-called asymmetry. This asymmetry vanishes in equilibrium but cannot be neglected in the aging regime. It is found that pl…

Methods for evaluating causality in observational studies.

2019

BACKGROUND: In clinical medical research, causality is demonstrated by randomized controlled trials (RCTs). Often, however, an RCT cannot be conducted for ethical reasons, and sometimes for practical reasons as well. In such cases, knowledge can be derived from an observational study instead. In this article, we present two methods that have not been widely used in medical research to date. METHODS: The methods of assessing causal inferences in observational studies are described on the basis of publications retrieved by a selective literature search. RESULTS: Two relatively new approaches—regression-discontinuity methods and interrupted time series—can be used to demonstrate a causal relat…

PCV5 Thromboembolisms with Thrombopoietin Receptor Agonists: Systematic Review and Meta-Analysis of Randomized Controlled Trials

2011

Early Response to treatment in Eating Disorders: A Systematic Review and a Diagnostic Test Accuracy Meta-Analysis

2016

Objective: Early response to eating disorders treatment is thought to predict a later favourable outcome. A systematic review of the literature and meta-analyses examined the robustness of this concept. Method: The criteria used across studies to define early response were summarised following the Preferred Reporting Items for Systematic Reviews and Meta-Analyses guidelines. Diagnostic Test Accuracy methodology was used to estimate the size of the effect. Results: Findings from 24 studies were synthesized and data from 14 studies were included in the meta-analysis. In Anorexia Nervosa, the odds ratio of early response predicting remission was 4.85(95%CI: 2.94–8.01) and the summary Area Unde…