A koan is an enigmatic, and often senseless, question posed as an aid to meditation in Zen Buddhism. By “chi-square”, we mean Pearson’s general scheme of a p-value, or tail, statistic that is constructed as a sum of independent random variables, each of which is the square of a normal deviate N(0, 1) (or at least approximately so). Such a statistic is distributed according to the familiar χ2I d...

A new grayscale image authentication method with a pixel-level self-recovering capability for tampered region repairing is proposed. By dividing the grayscale range into bins, a 3-bit bin code is generated as the authentication signal for each pixel in the input cover image. The authentication signals then are embedded randomly into the image pixels for the double purposes of tampering localiza...

We consider a special case of the generalized Pólya’s urn model introduced in [3]. Given a finite connected graph G, place a bin at each vertex. Two bins are called a pair if they share an edge of G. At discrete times, a ball is added to each pair of bins. In a pair of bins, one of the bins gets the ball with probability proportional to its current number of balls. A question of essential inter...

We consider the problem of packing squares into bins which are unit squares, where the goal is to minimize the number of bins used. We present an algorithm for this problem with an absolute worst-case ratio of 2, which is optimal provided P ≠ NP. 2000 Mathematics Subject Classification: 68W25, 68W4

We consider the problem of packing squares into bins which are unit squares, where the goal is to minimize the number of bins used. We present an algorithm for this problem with an absolute worst-case ratio of 2, which is optimal provided P 6= NP.

software tool that bins genomic fragments that have first undergone limited preassembly into contigs. Their strategy uses a variational Bayesian approach combining sequence composition and correlated abundance across multiple samples to produce sequence assignments. CONCOCT bins genomes with high precision and recall in simulated and real data, providing higher coverage than can typically be re...

We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles have to be packed nonoverlapping and orthogonal, i.e., axis-parallel. We present an algorithm for this problem with an absolute worst-case ratio of 2, which is optimal provided P 6= NP.

In this paper an attempt has been made to develop an appropriate storage and collection plan based on optimal routing model using Geologic Information System in one of the wards of the Singanallur, Coimbatore city, India. The ward map is digitized and georeferenced. The collection bins are attributed and collection routes of the MSW are optimized for degradable and recyclable wastes separately....

This paper presents and evaluates uncoordinated on-line algorithms for simultaneous storage and replication load-balancing in DHTbased peer-to-peer systems. We compare our approach with the classical balls into bins model, and point out both the similarities as well as the differences which call for new load-balancing mechanisms specifically targeted at P2P systems. Some of the peculiarities of...