This article is about teaching probability to students of philosophy who don’t aim do primarily formal work in their research. These are unlikely seek out classes or epistemology for various reasons, example because they realize that this knowledge would be useful them intimidated by the material. However, most areas now contain debates incorporate probability, and basic it essential even philo...

Probability answer set programming [Saad and Pontelli, 2006; Saad, 2006; Saad, 2007a] is a declarative programming that has been shown effective for representing and reasoning about a variety of probability reasoning tasks [Saad, 2008a; Saad, 2011; Saad, 2007b; Saad, 2009; Saad, 2008b]. However, the lack of probability aggregates, e.g. expected values, in the language of disjunctive hybrid prob...

The intuition of chance and probability develops at very early ages.1 However, a formal, precise definition of the probability is elusive. If the experiment can be repeated potentially infinitely many times, then the probability of an event can be defined through relative frequencies. For instance, if we rolled a die repeatedly, we could construct a frequency distribution table showing how many...

the aim of this study was to evaluate suicide probability in iranian males with substance abuse or dependence disorder and to investigate the predictors of suicide probability based on trait mindfulness, reasons for living and severity of general psychiatric symptoms.participants were 324 individuals with substance abuse or dependence in an outpatient setting and prison. reasons for living ques...

In this paper, we consider the determination methods of maximum entropy multivariate distributions with given prior under the constraints, that the marginal distributions or the marginals and covariance matrix are prescribed. Next, some numerical solutions are considered for the cases of unavailable closed form of solutions. Finally, these methods are illustrated via some numerical examples.

In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...