Conquer Fear. By John Langdon-Davies. Feature Books Ltd., London, 1948. pp. 173. 5s. This little book, by an experienced popular writer on science and on contemporary problems, will contribute something to mental hygiene. It has been read by the reviewer in as naive a frame of mind as possible to try and find the places that might jar. There are not many, despite my prejudice against the slight...

Near-real time altimetry products from ENVISAT RA2, Jason 1 and Topex/Poseidon tandem mission are validated for the North Sea and Baltic Sea region to assess the feasibility of using the data for operational purposes. The coverage of the satellite data shows that all Jason 1 and Topex/Poseidon observations in the Baltic Sea are currently discarded in the processing of the data. The spatial scal...

In 1977 Hartwig and Luh asked whether an element a in a Dedekind-finite ring R satisfying aR = a2R also satisfies Ra = Ra2. In this paper, we answer this question in the negative. We also prove that if a is an element of a Dedekind-finite exchange ring R and aR = a2R, then Ra = Ra2. This gives an easier proof of Dischinger’s theorem that left strongly π-regular rings are right strongly π-regula...

Inducing rules from very large datasets is one of the most challenging areas in data mining. Several approaches exist to scaling up classification rule induction to large datasets, namely data reduction and the parallelisation of classification rule induction algorithms. In the area of parallelisation of classification rule induction algorithms most of the work has been concentrated on the Top ...

The parity based divide and conquer recursion trees are introduced where the sizes of the tree do not grow monotonically as n grows. These non-monotonic recursive functions called fogk(n) and f̃ogk(n) are strictly less than linear, o(n) but greater than logarithm, Ω(logn). Properties of fogk(n) such as non-monotonicity, upper and lower bounds, etc. are examined and proven. These functions are us...

Bondeli, S_, Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations, Parallel Comput ing 17 (1991) 419-434_ We describe a divide and conquer algorithm which solves linear tridiagonal systems with one right-hand side, especially suited for parallel computers. The algorithm is flexible, permits multiprocessing or a combinat ion of vector and multipro...