Surface determination of the air-earth electrical current density using co-located sensors of different geometry

A vertical conduction current flows in the atmosphere as a result of the global atmospheric electric circuit. The current at the surface consists of the conduction current and a locally generated displacement current, which are often approximately equal in magnitude. A method of separating the two currents using two collectors of different geometry is investigated. The picoammeters connected to the collectors have a RC time constant of approximately 3 s, permitting the investigation of higher frequency air-earth current changes than previously achieved. The displacement current component of the air-earth current derived from the instrument agrees with calculations using simultaneous data from a co-located fast response electric field mill. The mean value of the nondisplacement current measured over 9 h was 1.76 +/- 0.002 pA m(-2). (c) 2006 American Institute of Physics.

The modelling of electrical current NDT methods and its application to weld testing

Discussion of the numerical modeling of NDT methods based on the potential drop and the disruption of power lines to describe the nature, importance and application of modeling. La 1ère partie est consacrée aux applications aux contrôles par courants de Foucault. The first part is devoted to applications for inspection by eddy currents.

The modelling of electrical current NDT methods and its application to weld testing

Control by voltage drop DC. Contrôle par chute de potentiel de courant alternatif. Control by voltage drop AC.

Dynamic load balancing in parallel KD-tree k-means

One among the most influential and popular data mining methods is the k-Means algorithm for cluster analysis. Techniques for improving the efficiency of k-Means have been largely explored in two main directions. The amount of computation can be significantly reduced by adopting geometrical constraints and an efficient data structure, notably a multidimensional binary search tree (KD-Tree). These techniques allow to reduce the number of distance computations the algorithm performs at each iteration. A second direction is parallel processing, where data and computation loads are distributed over many processing nodes. However, little work has been done to provide a parallel formulation of the efficient sequential techniques based on KD-Trees. Such approaches are expected to have an irregular distribution of computation load and can suffer from load imbalance. This issue has so far limited the adoption of these efficient k-Means variants in parallel computing environments. In this work, we provide a parallel formulation of the KD-Tree based k-Means algorithm for distributed memory systems and address its load balancing issue. Three solutions have been developed and tested. Two approaches are based on a static partitioning of the data set and a third solution incorporates a dynamic load balancing policy.