VUV spectral line emission measurements in the TCABR tokamak

The study of tokamak plasma light emissions in the vacuum ultraviolet (VUV) region is an important subject since many impurity spectral emissions are present in this region. These spectral emissions can be used to determine the plasma ion temperature and density from different species and spatial positions inside plasma according to their temperatures. We have analyzed VUV spectra from 500 Å to 3200 Å wavelength in the TCABR tokamak plasma including higher diffraction order emissions. There have been identified 37 first diffraction order emissions, resulting in 28 second diffraction order, 24 third diffraction order, and 7 fourth diffraction order lines. The emissions are from impurity species such as OII, OIII, OIV, OV, OVI, OVII, CII, CIII, CIV, NIII, NIV, and NV. All the spectra beyond 1900 Å are from higher diffraction order emissions, and possess much better spectral resolution. Each strong and isolated spectral line, as well as its higher diffraction order emissions suitable for plasma diagnostic is identified and discussed. Finally, an example of ion temperature determination using different diffraction order is presented.

Comparison of the Salmonella/Microsome Microsuspension Assay with the new Microplate Fluctuation Protocol for Testing the Mutagenicity of Environmental Samples

The objective of this study was to compare the responses of the Salmonella/microsome microsuspension assay with the new microplate fluctuation protocol (MPF) for the evaluation of the mutagenic activity of environmental samples. Organic extracts of total particulate atmospheric air samples, surface waters, and effluents were tested in dose-response experiments. The assays were performed with strain TA98 in the absence and presence of S9 mix. Both protocols produced similar results, despite the fact that the maximum score of the MPF is limited to 48 wells, whereas in the regular plate assay it is possible to count up to 1,500 colonies using an automatic counter. Similar sensitivities based on the lowest dose that resulted in a positive response were obtained for both assays. The MPF procedure is less laborious (e.g., all-liquid format, use of multi-channel pipettors) and allows for automation of the pipetting and dispensing steps, thus, reducing time of the analysis which is particularly important in environmental quality monitoring programs or in effect-directed analysis. The results show that the MPF procedure is a promising tool to test environmental samples for mutagenic activity. Environ. Mol. Mutagen. 51:31-38, 2010. (C) 2009 Wiley-Liss, Inc.

Jointly multi-user detection and channel estimation with genetic algorithm

This work aims at proposing the use of the evolutionary computation methodology in order to jointly solve the multiuser channel estimation (MuChE) and detection problems at its maximum-likelihood, both related to the direct sequence code division multiple access (DS/CDMA). The effectiveness of the proposed heuristic approach is proven by comparing performance and complexity merit figures with that obtained by traditional methods found in literature. Simulation results considering genetic algorithm (GA) applied to multipath, DS/CDMA and MuChE and multi-user detection (MuD) show that the proposed genetic algorithm multi-user channel estimation (GAMuChE) yields a normalized mean square error estimation (nMSE) inferior to 11%, under slowly varying multipath fading channels, large range of Doppler frequencies and medium system load, it exhibits lower complexity when compared to both maximum likelihood multi-user channel estimation (MLMuChE) and gradient descent method (GrdDsc). A near-optimum multi-user detector (MuD) based on the genetic algorithm (GAMuD), also proposed in this work, provides a significant reduction in the computational complexity when compared to the optimum multi-user detector (OMuD). In addition, the complexity of the GAMuChE and GAMuD algorithms were (jointly) analyzed in terms of number of operations necessary to reach the convergence, and compared to other jointly MuChE and MuD strategies. The joint GAMuChE-GAMuD scheme can be regarded as a promising alternative for implementing third-generation (3G) and fourth-generation (4G) wireless systems in the near future. Copyright (C) 2010 John Wiley & Sons, Ltd.

Study of the discovery potential of light custodians in a clean decay channel at the LHC

Models of warped extra dimensions with custodial symmetry usually predict the existence of a light Kaluza-Klein fermion arising as a partner of the right-handed top quark, sometimes called light custodians which we will denote (b) over tilde (R). The production of these particles at the LHC can give rise to multi-W events which could be observed in same-sign dilepton channels, but its mass reconstruction is challenging. In this paper we study the possibility of finding a signal for the pair production of this new particle at the LHC focusing on a rarer, but cleaner decay mode of a light custodian into a Z boson and a b-quark. In this mode it would be possible to reconstruct the light custodian mass. In addition to the dominant standard model QCD production processes, we include the contribution of a Kaluza-Klein gluon first mode. We find that (b) over tilde (R) stands out from the background as a peak in the bZ invariant mass. However, when taking into account only the electronic and muonic decay modes of the Z boson and b-tagging efficiencies, the LHC will have access only to the very light range of masses, m((b) over tilde) = O(500) GeV.

Efficient bulk-loading on dynamic metric access methods

This paper presents a new technique and two algorithms to bulk-load data into multi-way dynamic metric access methods, based on the covering radius of representative elements employed to organize data in hierarchical data structures. The proposed algorithms are sample-based, and they always build a valid and height-balanced tree. We compare the proposed algorithm with existing ones, showing the behavior to bulk-load data into the Slim-tree metric access method. After having identified the worst case of our first algorithm, we describe adequate counteractions in an elegant way creating the second algorithm. Experiments performed to evaluate their performance show that our bulk-loading methods build trees faster than the sequential insertion method regarding construction time, and that it also significantly improves search performance. (C) 2009 Elsevier B.V. All rights reserved.