An investigation of the accuracy of numerical solutions of Boltzmann's equations for electron swarms in gases with large inelastic cross sections

Copyright @ 1979 CSIROA Monte Carlo simulation technique has been used to test the accuracy of electron energy distribution functions and transport coefficients calculated using conventional numerical solutions of Boltzmann's equation based on a two-term approximation. The tests have been applied to a number of model gases, some of which have characteristics close to those of real gases, and include cases where the scattering is anisotropic. The results show that, in general, previous application of the numerical solution to real gases has been valid

Comparison of two-dimensional binned data distributions using the energy test

For the purposes of monitoring HEP experiments, comparison is often made between regularly acquired histograms of data and reference histograms which represent the ideal state of the equipment. With the larger experiments now starting up, there is a need for automation of this task since the volume of comparisons would overwhelm human operators. However, the two-dimensional histogram comparison tools currently available in ROOT have noticeable shortcomings. We present a new comparison test for 2D histograms, based on the Energy Test of Aslan and Zech, which provides more decisive discrimination between histograms of data coming from different distributions

Tree Contraction, Connected Components, Minimum Spanning Trees: a GPU Path to Vertex Fitting

Standard parallel computing operations are considered in the context of algorithms for solving 3D graph problems which have applications, e.g., in vertex finding in HEP. Exploiting GPUs for tree-accumulation and graph algorithms is challenging: GPUs offer extreme computational power and high memory-access bandwidth, combined with a model of fine-grained parallelism perhaps not suiting the irregular distribution of linked representations of graph data structures. Achieving data-race free computations may demand serialization through atomic transactions, inevitably producing poor parallel performance. A Minimum Spanning Tree algorithm for GPUs is presented, its implementation discussed, and its efficiency evaluated on GPU and multicore architectures

The two-dimensional Kolmogorov-Smirnov test

Goodness-of-fit statistics measure the compatibility of random samples against some theoretical probability distribution function. The classical one-dimensional Kolmogorov-Smirnov test is a non-parametric statistic for comparing two empirical distributions which defines the largest absolute difference between the two cumulative distribution functions as a measure of disagreement. Adapting this test to more than one dimension is a challenge because there are 2d −1 independent ways of defining a cumulative distribution function when d dimensions are involved. In this paper three variations on the Kolmogorov-Smirnov test for multi-dimensional data sets are surveyed: Peacock’s test [1] that computes in O(n3); Fasano and Franceschini’s test [2] that computes in O(n2); Cooke’s test that computes in O(n2). We prove that Cooke’s algorithm runs in O(n2), contrary to his claims that it runs in O(nlgn). We also compare these algorithms with ROOT’s version of the Kolmogorov-Smirnov test

Corrigendum to: An investigation of the accuracy of numerical solutions of Boltzmann's equation for electron swarms in gases with large inelastic cross sections

Copyright @ 1982 CSIROAn error has been found in the computer codes used in the Monte Carlo simulations. The correction for this error alters some of the values of Dol by up to several per cent. The conclusions presented in the paper are however not affected

Muonium addition reactions in the gas phase: Quantum tunneling in Mu + C2H4 and Mu + C2D4

Copyright © 1990 American Institute of Physics.The reaction kinetics for the addition of the muonium (Mu=μ+e−) atom to C2H4 and C2D4 have been measured over the temperature range 150–500 K at (N2) moderator pressures near 1 atm. A factor of about 8 variation in moderator pressure was carried out for C2H4, with no significant change seen in the apparent rate constant kapp, which is therefore taken to be at the high pressure limit, yielding the bimolecular rate constant kMu for the addition step. This is also expected from the nature of the μSR technique employed, which, in favorable cases, gives kapp=kMu at any pressure. Comparisons with the H atom data of Lightfoot and Pilling, and Sugawara et al. and the D atom data of Sugawara et al. reveal large isotope effects. Only at the highest temperatures, near 500 K, is kMu/kH given by its classical value of 2.9, from the mean velocity dependence of the collision rate but at the lowest temperatures kMu/kH≳30/1 is seen, reflecting the pronounced tunneling of the much lighter Mu atom (mμ=1/9 mp). The present Mu results should provide accurate tests of reaction theories on currently available ab initio surfaces.NSERC (Canada), the Canada Council for their awarding of a Killam Research Fellowship and the Meson Science Institute, Faculty of Science, University of Tokyo

MonoSLAM: Real-time single camera SLAM

Published versio

Double differential cross sections for electron ejection from helium by fast protons.

Measurements of the angular and energy distributions of electrons ejected from helium atoms by protons with energies between 20 and 100 keV are presented in tabular and graphical form. The electron energy range is between 5 and 100 eV and the angular range is between 0 and 100 degrees. The distributions have been converted to double differential cross sections by normalisation against other published data. An analysis of the accuracy of the results is presented

Parallel monte carlo search for hough transform

We investigate the problem of line detection in digital image processing and in special how state of the art algorithms behave in the presence of noise and whether CPU e ciency can be improved by the combination of a Monte Carlo Tree Search, hierarchical space decomposition, and parallel computing. The starting point of the investigation is the method introduced in 1962 by Paul Hough for detecting lines in binary images. Extended in the 1970s to the detection of space forms, what came to be known as Hough Transform (HT) has been proposed, for example, in the context of track tting in the LHC ATLAS and CMS projects. The Hough Transform transfers the problem of line detection, for example, into one of optimization of the peak in a vote counting process for cells which contain the possible points of candidate lines. The detection algorithm can be computationally expensive both in the demands made upon the processor and on memory.Additionally, it can have a reduced e ectiveness in detection in the presence of noise. Our rst contribution consists in an evaluation of the use of a variation of the Radon Transform as a form of improving thee ectiveness of line detection in the presence of noise. Then, parallel algorithms for variations of the Hough Transform and the Radon Transform for line detection are introduced. An algorithm for Parallel Monte Carlo Search applied to line detection is also introduced. Their algorithmic complexities are discussed. Finally, implementations on multi-GPU and multicore architectures are discussed.Lopes, Reid and Hobson are members of the GridPP collaboration and wish to acknowledge funding from the Science and Technology Facilities Council, UK