Example 3. How many ways are there to put m balls into n bins. Assume m ≤ n. 1. Balls are distinct and bins are distinct. Every ball has n choices. Hence n. Exercise 2. Why is the answer not m by looking at the opposite argument. 2. Balls are not distinct but bins are distinct. Take m identical balls and n− 1 identical sticks and permute them. Every permutation gives a different arrangement. So...

An occupancy problem with an infinite number of bins and a random probability vector for the locations of the balls is considered. The respective sizes of bins are related to the split times of a Yule process. The asymptotic behavior of the landscape of first empty bins, i.e., the set of corresponding indices represented by point processes, is analyzed and convergences in distribution to mixed ...

This paper proposes a novel polynomial transform to modify the original histogram of the image to adjust the pixel density equally towards the high intensity levels so that uniform distribution of the pixels can be obtained and the image can be enhanced. We have shown the efficient use of this modified histogram for Content Based Image Retrieval. According to the CBIR system described in this p...

Fruit bins infested with diapausing codling moth larvae, Cydia pomonella (L.), are a potential source of reinfestation of orchards and may jeopardize the success of mating disruption programs and other control strategies. Entomopathogenic nematodes (EPNs) were tested as a potential means of control that could be applied at the time bins are submerged in dump tanks. Diapausing cocooned codling m...

A novel method is proposed to improve the performance of independent vector analysis (IVA) for blind signal separation of acoustic mixtures. IVA is a frequency-domain approach that successfully resolves the well-known permutation problem by applying a spherical dependency model to all pairs of frequency bins. The dependency model of IVA is equivalent to a single clique in an undirected graph; a...

In this work, we examine a generic class of simple distributed balls-into-bins algorithms. Exploiting the strong concentration bounds that apply to balls-into-bins games, we provide an iterative method to compute accurate estimates of the remaining balls and the load distribution after each round. Each algorithm is classified by (i) the load that bins accept in a given round, (ii) the number of...

For n particles, the original code requiresO(n) time because at each time step, the apply force function is called for each particle (to be updated) with each other particle. Since interactions are local, one particle is influenced by a few nearby particles. Thus, most of the time, the apply force function is computing a distance and returning after finding this distance to be greater than the ...

Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that the sum of the numbers assigned to each bin does not exceed the bin capacity. We present two improvements to our previous bin-completion algorithm. The first speeds up the constant factor per node generation, and the s...

We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating bins that contain time series subsequences of approximately the same shape. For each bin, we can quickly calculate a lower-bound on the distance between a given query and the most similar element of the bin. This bound ...

By obtaining photometric redshift information, tomography allows us to cross-correlate galaxy ellipticities in different source redshift bins. The cross-correlation is non-vanishing because the different bins share much of the foreground mass distribution from which, over Gpc scales, the lensing signal is built. If the redshift bins are thick enough however, the cross-correlations are insensiti...