This paper considers a multistage balls-and-bins problem with optimal stopping connected the job allocation model. There are N steps. The player drops balls (tasks) randomly one at time into available bins (servers). game begins only empty bin. At each step, new bin can appear probability p. step n (n = 1, . ,N), choose to stop and receive payoff or continue process move next step. If stops, th...

Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin. We give an algorithm for Online Bin Stretching with a stretching factor of 1.5 for any number of bins. We build o...

Objectives: Monitoring development in infancy results in early detection of developmental delay, and early intervention can prevent sever complications of developmental disorders. The purpose of this study was to determine quality of developmental screening of 3-12 months infants referred to Tehran Health Centers, through comparing with screening by Bayley Infant Neurodevelopmental Screener II ...

In this paper we present a new accurate steganalysis method for the LSBreplacement steganography. The suggested method is based on the changes that occur in thehistogram of an image after the embedding of data. Every pair of neighboring bins of ahistogram are either inter-related or unrelated depending on whether embedding of a bit ofdata in the image could affect both bins or not. We show that...

A Monte Carlo method was developed to simulate multicomponent aerosol dynamics, specifically with simultaneous coagulation and fast condensation where the sectional method suffers from numerical diffusion. This method captures both composition and size distributions of the aerosols. In other words, the composition distribution can be obtained as a function of particle size. In this method, part...

We study the following load balancing problem on paths (PB). There is a path containing n vertices. Every vertex i has an initial load hi, and every edge (j, j + 1) has an initial load wj that it needs to distribute among the two vertices that are its endpoints. The goal is to distribute the load of the edges over the vertices in a way that will make the loads of the vertices as balanced as pos...