We expand our previous deterministic power calculations by calculating the required sample size to detect C in ACE models. The theoretical expected value of the maximum log-likelihood for the AE model was derived using two optimisation methods and these gave near-identical results. Theoretical predictions were verified by computer simulation and the results agreed very well. We have developed a...

In the bin packing problem, we get a sequence of packets of size r 1 ; r 2 ; r 3 ; : : :, each r i 1, and we must place the packets into bins of size 1 using as few bins as possible. The size of a bin is the accumulated size of all packets in the bin, and the free capacity of a bin is 1 minus its size.

Particle filters are key algorithms for object tracking under non-linear, non-Gaussian dynamics. The high computational cost of particle filters, however, hampers their applicability in cases where the likelihood model is costly to evaluate, or where large numbers of particles are required to represent the posterior. We introduce the piecewise constant sequential importance sampling/resampling ...

We present the Generalized Bin Packing Problem (GBPP), a new packing problem where, given a set of items characterized by volume and profit and a set of bins with given volumes and costs, one aims to select the subsets of profitable items and appropriate bins to optimize an objective function which combines the cost of using the bins and the profit yielded by loading the selected items. The GBP...

We study the best achievable performance (in terms of the average queue size and delay) in a stochastic and dynamic version of the bin-packing problem. Items arrive to a queue according to a Poisson process with rate 2ρ, where ρ ∈ (0, 1). The item sizes are independent and identically distributed (i.i.d.) with a uniform distribution in [0, 1]. At each time unit, a single unit-size bin is availa...

In this paper‎, ‎a modern method is presented to solve a class of fractional optimal control problems (FOCPs) indirectly‎. ‎First‎, ‎the necessary optimality conditions for the FOCP are obtained in the form of two fractional differential equations (FDEs)‎. ‎Then‎, ‎the unknown functions are approximated by the hybrid functions‎, ‎including Bernoulli polynomials and Block-pulse functions based o...

A novel approach for selecting an appropriate bin size for cell-based diversity assessment is presented. The method measures the sensitivity of the diversity index as a function of grid resolution, using a box-counting algorithm that is reminiscent of those used in fractal analysis. It is shown that the relative variance of the diversity score (sum of squared cell occupancies) of several common...

To provide feasible primer sets for performing a polymerase chain reaction (PCR) experiment, many primer design methods have been proposed. However, the majority of these methods require a relatively long time to obtain an optimal solution since large quantities of template DNA need to be analyzed. Furthermore, the designed primer sets usually do not provide a specific PCR product size. In rece...