In this paper we first intend to examine the probability of falling into the realm of child labor by using conditional probability theorem. Furthermore, we will compare the extent of each factor’s effect on boys and girls using a TOBIT regression model. Finally we will analyze aspects of Iran’s labor market to assess the future ahead of the children who work at present. As the results will show...

We show that several versions of Floyd and Rivest’s algorithm Select for finding the kth smallest of n elements require at most n+min{k, n− k}+ o(n) comparisons on average and with high probability. This rectifies the analysis of Floyd and Rivest, and extends it to the case of nondistinct elements. Our computational results confirm that Select may be the best algorithm in practice.

Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower bounds which are reached with high probability. We prove bounds for all values of m(n) ≥ n/polylog(n) by using the simple and well-known method of the first and second moment.

We show that several versions of Floyd and Rivest’s improved algorithm Select for finding the kth smallest of n elements require at most n + min{k, n − k} + O(n1/2 ln n) comparisons on average and with high probability. This rectifies the analysis of Floyd and Rivest, and extends it to the case of nondistinct elements. Encouraging computational results on large median-finding problems are repor...

In this paper we address the problem of estimating the number of stations in a wireless network. Under the assumption that each station can detect collisions, we show that it is possible to estimate the number stations in the network within a factor 2 from the correct value in time O(log n log log n). We further show that if no station can detect collisions, the same task can be accomplished wi...

Consider an election between k candidates in which each voter votes randomly (but not necessarily independently) and suppose that there is a single candidate that every voter prefers (in the sense that each voter is more likely to vote for this special candidate than any other candidate). Suppose we have a voting rule that takes all of the votes and produces a single outcome and suppose that ea...

Let p be an unknown and arbitrary probability distribution over [0, 1). We consider the problem of density estimation, in which a learning algorithm is given i.i.d. draws from p and must (with high probability) output a hypothesis distribution that is close to p. The main contribution of this paper is a highly efficient density estimation algorithm for learning using a variable-width histogram,...

due to the nature of the sediment data, selection of appropriate methods for processing the data before entering them to the artificial intelligence models can enhance the reliability of simulations results. in this study, the effects of sediment data processing procedures on ann and anfis models outputs in 7 dez basin stations were evaluated. accordingly, three scenarios were considered: in th...

The complete proof is to be found in Vieille [4],[5]. The general idea of the proof is to deÞne a class of sets, the solvable sets, which can safely be thought of as absorbing states, and to construct ε-equilibrium proÞles such that the induced play reaches one of these sets with high probability, and remains there. Solvable sets are deÞned in Section 1. The organization of the proof is present...

We show that with high probability a random subset of {1, . . . , n} of size Θ(n) contains two elements a and a + d, where d is a positive integer. As a consequence, we prove an analogue of the Sárközy-Fürstenberg theorem for a random subset of {1, . . . , n}.