This paper describes the use of histogram modification functions to improve the retrieval efficiency of the content-based image retrieval system based on bins approach. Four different functions explored in this paper used as histogram specification to modify the histograms are; histogram equalization (EQH), polynomial function (POLY), linear equations (LinearEQ1,2,3) and logarithmic function (L...

We demonstrate that a proper control sample correlates linearly with the background parts of its corresponding ChIP sample. In the following examples, we first draw the original ChIP vs control bins counts to show the over-abundance of high ChIP count bins due to binding signals. Then we filter the strong binding signals by calling peaks with SPP (Kharchenko et al., 2008) at FDR 0.1 level and e...

Given a set of n items with weights wi, i = 1, . . . , n, the bin packing (BP) problem consists of finding the minimum number of bins of capacity C necessary to pack the items, without violating the capacity constraint. This formulation also entails another problem (DBP), in which we seek to minimize the capacity of a fixed number m of identical bins, so that all items fit in the m bins without...

Recent research suggests decentralised probabilistic protocols on support for multipeer communication. The protocols scale well and impose an even load on the system. They provide statistical guarantees for the reliability, i.e. an information sent from an arbitrary source will reach all its destinations. Analysing the reliability is based on modelling the propagation of events as an epidemic p...

We analyze the approximation behavior of some of the best-known polynomial-time approximation algorithms for bin-packing under an approximation criterion, called differential ratio, informally the ratio (n − λ(I))/(n − β(I)), where n is the size of the input list, λ(I) is the size of the solution provided by an approximation algorithm and β(I) is the size of the optimal one. This measure has or...

We consider the problem of extending the analysis of balls and bins processes where a ball is placed in the least loaded of d randomly chosen bins to cover deletions. In particular, we are interested in the case where the system maintains a fixed load, and deletions are determined by an adversary before the process begins. We show that with high probability the load in any bin is O(log log n). ...

A number of stylized facts have been documented about the extensive margin of trade— whether to export or not, and, if so, how many products to how many destinations. We note that some of the reported facts would be expected to arise if exports shipments were randomly allocated across categories (e.g., product codes, destination countries). ey are, thus, not informative of the underlying econom...

We consider the well-known problem of randomly allocating m balls into n bins. We investigate various properties of single-choice games as well as multiple-choice games in the context of weighted balls. We are particularly interested in questions that are concerned with the distribution of ball weights, and the order in which balls are allocated. Do any of these parameters influence the maximum...

Recent research suggests decentralised probabilistic protocols on support for multipeer communication. The protocols scale well and impose an even load on the system. They provide statistical guarantees for the reliability, i.e. an information sent from an arbitrary source will reach all its destinations. Analysing the reliability is based on modelling the propagation of events as an epidemic p...

In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bipartite graph with n nodes on each side, we view each node on the left as having balls that it can throw into nodes on the right (bins) to which it is adjacent. If each node on the left throws exactly one ball and each ...