Measurement of surface roughness slope

Instrument, consisting of isolator, differentiator, absolute value circuit, and integrator, uses output signal from surface texture analyzer profile-amplifier to calculate surface roughness slope. Calculations provide accurate, instantaneous value of the slope. Instrument is inexpensive and applicable to any commerical surface texture analyzer

Sample size calculations for cluster randomised controlled trials with a fixed number of clusters

Background\ud Cluster randomised controlled trials (CRCTs) are frequently used in health service evaluation. Assuming an average cluster size, required sample sizes are readily computed for both binary and continuous outcomes, by estimating a design effect or inflation factor. However, where the number of clusters are fixed in advance, but where it is possible to increase the number of individuals within each cluster, as is frequently the case in health service evaluation, sample size formulae have been less well studied. \ud \ud Methods\ud We systematically outline sample size formulae (including required number of randomisation units, detectable difference and power) for CRCTs with a fixed number of clusters, to provide a concise summary for both binary and continuous outcomes. Extensions to the case of unequal cluster sizes are provided. \ud \ud Results\ud For trials with a fixed number of equal sized clusters (k), the trial will be feasible provided the number of clusters is greater than the product of the number of individuals required under individual randomisation ($n_i$) and the estimated intra-cluster correlation ($\rho$). So, a simple rule is that the number of clusters ($\kappa$) will be sufficient provided: \ud \ud $\kappa$ > $n_i$ x $\rho$\ud \ud Where this is not the case, investigators can determine the maximum available power to detect the pre-specified difference, or the minimum detectable difference under the pre-specified value for power. \ud \ud Conclusions\ud Designing a CRCT with a fixed number of clusters might mean that the study will not be feasible, leading to the notion of a minimum detectable difference (or a maximum achievable power), irrespective of how many individuals are included within each cluster. \ud \u

Control of Visual Selection during Visual Search in the Human Brain

How do we find a target object in a cluttered visual scene? Targets carrying unique salient features can be found in parallel without directing attention, whereas targets defined by feature conjunctions or non-salient features need to be scrutinized in a serial attentional process in order to be identified. In this article, we review a series of experiments in which we used fMRI to probe the neural basis of this active search process in the human brain. In all experiments, we compared the fMRI signal between a difficult and an easy visual search (each performed without eye movements) in order to isolate neural activity reflecting the search process from other components such as stimulus responses and movement-related activity. The difficult search was either a conjunction search or a hard feature search and compared with an easy feature search, matched in visual stimulation and motor requirements. During both, the conjunction search and the hard feature search the frontal eye fields (FEF) and three parietal regions located in the intraparietal sulcus (IPS) were differentially activated: the anterior and posterior part of the intraparietal sulcus (AIPS, PIPS) as well as the junction of the intraparietal with the transverse occipital sulcus (IPTO). Only in PIPS, the modulation strength was most indistinguishable between conjunction and hard feature search. In a further experiment we showed that AIPS and IPTO are involved in visual conjunction search even in the absence of distractors; by contrast, the involvement of PIPS seems to depend on the presence of distractors. Taken together, these findings from these experiments demonstrate that all four key nodes of the human ’frontoparietal attention network’ are generally engaged in the covert selection process of visual search. But they also suggest that these areas play differential roles, perhaps reflecting different sub-processes in active search. We conclude by discussing a number of such sub-processes, such as the direction of spatial attention, visual feature binding, and the active suppression of distractors

Cluster randomised trials in the medical literature: two bibliometric surveys

Background: Several reviews of published cluster randomised trials have reported that about half did not take clustering into account in the analysis, which was thus incorrect and potentially misleading. In this paper I ask whether cluster randomised trials are increasing in both number and quality of reporting. Methods: Computer search for papers on cluster randomised trials since 1980, hand search of trial reports published in selected volumes of the British Medical Journal over 20 years. Results: There has been a large increase in the numbers of methodological papers and of trial reports using the term 'cluster random' in recent years, with about equal numbers of each type of paper. The British Medical Journal contained more such reports than any other journal. In this journal there was a corresponding increase over time in the number of trials where subjects were randomised in clusters. In 2003 all reports showed awareness of the need to allow for clustering in the analysis. In 1993 and before clustering was ignored in most such trials. Conclusion: Cluster trials are becoming more frequent and reporting is of higher quality. Perhaps statistician pressure works

Some comparison theorems for weak nonnegative splittings of bounded operators

AbstractThe comparison of the asymptotic rates of convergence of two iteration matrices induced by two splittings of the same matrix has arisen in the works of many authors. In this paper we derive new comparison theorems for weak nonnegative splittings and weak splittings of bounded operators in a general Banach space and rather general cones, and in a Hilbert space, which extend some of the results obtained by Woźnicki (Japan J. Indust. Appl. Math. 11(1994) 289–342) and Marek and Szyld (Numer. Math. 44(1984) 23–35). Furthermore, we present new theorems also for bounded operator which extend some results by Csordas and Varga (Numer. Math. 44. (1984) 23–35) for weak nonnegative splittings of matrices

Topological properties and fractal analysis of recurrence network constructed from fractional Brownian motions

Many studies have shown that we can gain additional information on time series by investigating their accompanying complex networks. In this work, we investigate the fundamental topological and fractal properties of recurrence networks constructed from fractional Brownian motions (FBMs). First, our results indicate that the constructed recurrence networks have exponential degree distributions; the relationship between $H$ and $$can be represented by a cubic polynomial function. We next focus on the motif rank distribution of recurrence networks, so that we can better understand networks at the local structure level. We find the interesting superfamily phenomenon, i.e. the recurrence networks with the same motif rank pattern being grouped into two superfamilies. Last, we numerically analyze the fractal and multifractal properties of recurrence networks. We find that the average fractal dimension$$ of recurrence networks decreases with the Hurst index $H$ of the associated FBMs, and their dependence approximately satisfies the linear formula $\approx 2 - H$. Moreover, our numerical results of multifractal analysis show that the multifractality exists in these recurrence networks, and the multifractality of these networks becomes stronger at first and then weaker when the Hurst index of the associated time series becomes larger from 0.4 to 0.95. In particular, the recurrence network with the Hurst index $H=0.5$ possess the strongest multifractality. In addition, the dependence relationships of the average information dimension $$and the average correlation dimension$$ on the Hurst index $H$ can also be fitted well with linear functions. Our results strongly suggest that the recurrence network inherits the basic characteristic and the fractal nature of the associated FBM series.Comment: 25 pages, 1 table, 15 figures. accepted by Phys. Rev.

Impact of CONSORT extension for cluster randomised trials on quality of reporting and study methodology : review of random sample of 300 trials, 2000-8

Peer reviewedPublisher PD

Geometric and dynamic perspectives on phase-coherent and noncoherent chaos

Statistically distinguishing between phase-coherent and noncoherent chaotic dynamics from time series is a contemporary problem in nonlinear sciences. In this work, we propose different measures based on recurrence properties of recorded trajectories, which characterize the underlying systems from both geometric and dynamic viewpoints. The potentials of the individual measures for discriminating phase-coherent and noncoherent chaotic oscillations are discussed. A detailed numerical analysis is performed for the chaotic R\"ossler system, which displays both types of chaos as one control parameter is varied, and the Mackey-Glass system as an example of a time-delay system with noncoherent chaos. Our results demonstrate that especially geometric measures from recurrence network analysis are well suited for tracing transitions between spiral- and screw-type chaos, a common route from phase-coherent to noncoherent chaos also found in other nonlinear oscillators. A detailed explanation of the observed behavior in terms of attractor geometry is given.Comment: 12 pages, 13 figure