A sample size calculation for logistic regression involves complicated formulae. This paper suggests use of sample size formulae for comparing means or for comparing proportions in order to calculate the required sample size for a simple logistic regression model. One can then adjust the required sample size for a multiple logistic regression model by a variance inflation factor. This method re...

As the sizes of food packages and portions have changed rapidly over the past decades, it has become crucial to understand how consumers perceive and respond to changes in size. Existing evidence suggests that consumers make errors when visually estimating package and portion sizes, and these errors significantly influence subsequent food choices and intake. We outline four visual biases (arisi...

Exact power and sample size calculation for bioequivalence studies with high order crossover designs using statistical software nQuery are presented. Such calculation can be very easily performed, and thus provides a convenient tool for practical usage.

The recovery of gold by ore leaching is influenced by the size of the particles and the chemical environment. The effect of particle size on the dissolution of gold is usually studied using mono-size particles as the gold in solution comes from the ore of a unique leached particle size. This paper proposes a method to estimate the gold dissolution as a function of particle size using a bulk ore...

Search engines split large datasets across multiple machines using document distribution. Documents are typically distributed randomly to produce good load balancing. We propose that documents be distributed by their size instead. This can make load balancing more difficult, but it produces immediate improvements in both index size and query throughput. To support our proposal, we show improvem...

BACKGROUND Central to the design of a randomised controlled trial is the calculation of the number of participants needed. This is typically achieved by specifying a target difference and calculating the corresponding sample size, which provides reassurance that the trial will have the required statistical power (at the planned statistical significance level) to identify whether a difference of...

A path partition of a graph is a collection of vertex-disjoint paths that cover all vertices of the graph. The path-partition problem is to find a path partition of minimum size. This paper gives a linear-time algorithm for the path-partition problem in bipartite distance-hereditary graphs.

We study k-partition communication protocols, an extension of the standard two-party best-partition model to k input partitions. The main results are as follows. 1. A strong explicit hierarchy on the degree of non-obliviousness is established by proving that, using k+1 partitions instead of k may decrease the communication complexity from Θ(n) to Θ(log k). 2. Certain linear codes are hard for k...