Data from the first run of the BABAR detector at the PEP II accelerator are presented. Measurements of many rare B decay modes are now possible using the large data sets currently being collected by BABAR. An overview of analysis techniques and results on data collected in 2000 are described.

BACKGROUND Cluster-randomized trials, in which health interventions are allocated randomly to intact clusters or communities rather than to individual subjects, are increasingly being used to evaluate disease control strategies both in industrialized and in developing countries. Sample size computations for such trials need to take into account between-cluster variation, but field epidemiologis...

The speed of digital circuit is one of the most restricting factors in the deep sub-micron and multigigahertz integrated circuits design. It is directly dependent on the circuit delay. Scaling down the technologies and increasing the operational frequency make the delay problems more important. This paper studies the delay in digital circuits, starting from the design process, scaling down the ...

Dose calculation algorithms in radiation treatment planning systems (RTPSs) play a crucial role in stereotactic body radiation therapy (SBRT) in the lung with heterogeneous media. This study investigated the performance and accuracy of dose calculation for three algorithms: analytical anisotropic algorithm (AAA), pencil beam convolution (PBC) and Acuros XB (AXB) in Eclipse (Varian Medical Syste...

The paper presents algorithms for the fast adaptive calculation of invariant features. These are pattern characteristics that remain unchanged under the action of a transformation group. First it is explained how to construct such features by integrating complex valued functions over the transformation group. Motivated by this technique we devise algorithms for adaptively calculating invariant ...

The paper presents algorithms for the fast adaptive calculation of invariant features. These are pattern characteristics that remain unchanged under the action of a transformation group. First it is explained how to construct such features by integrating complex valued functions over the transformation group. Motivated by this technique we devise algorithms for adaptively calculating invariant ...

We recall that the calculation of homology with integer coefficients of a simplicial complex reduces to the calculation of the Smith Normal Form of the boundary matrices which in general are sparse. We provide a review of several algorithms for the calculation of Smith Normal Form of sparse matrices and compare their running times for actual boundary matrices. Then we describe alternative appro...

The three-dimensional discrete cosine transform (3D DCT) has been used in many 3-D applications such as video coding and compression. Many fast algorithms have been developed for the calculation of 1-D DCT. These algorithms are then used for the calculation of 3-D DCT using the row-column approach. However, 3-D algorithms involve less arithmetic operations and can be faster. In this paper, the ...

k-means has recently been recognized as one of the best algorithms for clustering unsupervised data. Since k-means depends mainly on distance calculation between all data points and the centers, the time cost will be high when the size of the dataset is large (for example more than 500millions of points). We propose a two stage algorithm to reduce the time cost of distance calculation for huge ...

Recently, pairing–based cryptographies have attracted much attention. For fast pairing calculation, not only pairing algorithms but also arithmetic operations in extension field should be efficient. Especially for final exponentiation included in pairing calculation, squaring is more important than multiplication. This paper proposes an efficient squaring algorithm in extension field for Freema...