In this paper, the class of random irregular block-hierarchical networks is defined and algorithms for generation and calculation of network properties are described. The algorithms presented for this class of networks are more efficient than known algorithms both in computation time and memory usage and can be used to analyze topological properties of such networks. The algorithms are implemen...

There are an increasing number of radiation therapy patients with hip prosthesis. The common method of minimizing treatment planning inaccuracies is to avoid radiation beams to transit through the prosthesis. However, the beams often exit through them, especially when the patient has a double-prosthesis. Modern treatment planning systems employ algorithms with improved dose calculation accuraci...

Background: In radiation therapy, the peripheral dose is important when anatomical structures with very low dose tolerances are involved. In this study, the two available calculation algorithms of the Varian Eclipse 8.6 treatment planning system(TPS), the anisotropic analytic algorithm (AAA) and pencil-beam convolution (PBC) was used to compare measured and calculated peripheral dose distributi...

Expected improvement algorithms are commonly used in global optimization problems where evaluating the objective function is costly. The Expected Hypervolume Improvement (EHVI) is a recent generalization of these algorithms to multiobjective optimization. The computation of the EHVI is based on a multidimensional integration of a piecewise defined nonlinear function. Exact calculation of the EH...

In this paper, we evaluate the possibility to develop algorithms of adaptation for the applications system of acoustic echo cancellation, while maintaining equilibrium between its reduced calculation complexity and its adaptive performances. We present new algorithms versions of fast recursive least squares numerically stable (NS-FRLS). They are obtained by means of redundant formulas, availabl...

Algorithms that predict the degree of visual discomfort experienced when viewing stereoscopic 3D (S3D) images usually first execute some form of disparity calculation. Following that, features are extracted on these disparity maps to build discomfort prediction models. These features may include, for example, the maximum disparity, disparity range, disparity energy, and other measures of the di...

¥ The first two authors have contributed equally to this work 2 Summary Several improvements to computational algorithms for multipoint linkage analysis are developed. The new algorithms achieve considerable speed-up over previous ones, and allow larger families to be analyzed. The algorithms have been implemented in a computer program, Allegro. Allegro has the same basic functionality as the w...

We present two efficient histogram algorithms designed for NVIDIA’s compute unified device architecture (CUDA) compatible graphics processor units (GPUs). Our algorithm can be used for parallel computation of histograms on large data-sets and for thousands of bins. Traditionally histogram computation has been difficult and inefficient on the GPU. This often means that GPU-based implementation o...

Feature selection is an important data preprocessing step in data mining and pattern recognition. Many algorithms have been proposed in the past for simple patterns that can be characterised by a single feature vector. Unfortunately, these algorithms are hardly applicable to what are referred as complex patterns that have to be described by a finite set of feature vectors. This paper addresses ...