f t value of the 0(+)-> 0(+) beta(+) decay of (32)Ar: A measurement of isospin symmetry breaking in a superallowed decay

We determined the absolute branch of the T=2 superallowed decay of (32)Ar by detecting the beta(+)-delayed protons and gamma decays of the daughter state. We obtain b(SA)(beta)=(22.71 +/- 0.16)%, which represents the first determination of a proton branch to better than 1%. Using this branch along with the previously determined (32)Ar half-life and energy release, we determined ft=(1552 +/- 12) s for the superallowed decay. This ft value, together with the corrected Ft value extracted from previously known T=1 superallowed decays, yields a measurement of the isospin symmetry breaking correction in (32)Ar decay delta(exp)(C)=(2.1 +/- 0.8)%. This can be compared to a theoretical calculation delta(C)=(2.0 +/- 0.4)%. As by-products of this work, we determined the gamma and proton branches for the decay of the lowest T=2 state of (32)Cl, made a precise determination of the total proton branch and relative intensities of proton groups that leave (31)S in its first excited state and deduced an improved value for the (32)Cl mass.

Exploring the emission intensities of ICP OES aided by chemometrics in the geographical discrimination of mineral waters

A rapid method for classification of mineral waters is proposed. The discrimination power was evaluated by a novel combination of chemometric data analysis and qualitative multi-elemental fingerprints of mineral water samples acquired from different regions of the Brazilian territory. The classification of mineral waters was assessed using only the wavelength emission intensities obtained by inductively coupled plasma optical emission spectrometry (ICP OES), monitoring different lines of Al, B, Ba, Ca, Cl, Cu, Co, Cr, Fe, K, Mg, Mn, Na, Ni, P, Pb, S, Sb, Si, Sr, Ti, V, and Zn, and Be, Dy, Gd, In, La, Sc and Y as internal standards. Data acquisition was done under robust (RC) and non-robust (NRC) conditions. Also, the combination of signal intensities of two or more emission lines for each element were evaluated instead of the individual lines. The performance of two classification-k-nearest neighbor (kNN) and soft independent modeling of class analogy (SIMCA)-and preprocessing algorithms, autoscaling and Pareto scaling, were evaluated for the ability to differentiate between the various samples in each approach tested (combination of robust or non-robust conditions with use of individual lines or sum of the intensities of emission lines). It was shown that qualitative ICP OES fingerprinting in combination with multivariate analysis is a promising analytical tool that has potential to become a recognized procedure for rapid authenticity and adulteration testing of mineral water samples or other material whose physicochemical properties (or origin) are directly related to mineral content.

Sequential decision making with partially ordered preferences

This paper presents new insights and novel algorithms for strategy selection in sequential decision making with partially ordered preferences; that is, where some strategies may be incomparable with respect to expected utility. We assume that incomparability amongst strategies is caused by indeterminacy/imprecision in probability values. We investigate six criteria for consequentialist strategy selection: Gamma-Maximin, Gamma-Maximax, Gamma-Maximix, Interval Dominance, Maximality and E-admissibility. We focus on the popular decision tree and influence diagram representations. Algorithms resort to linear/multilinear programming; we describe implementation and experiments. (C) 2010 Elsevier B.V. All rights reserved.

Ciratefi: An RST-invariant template matching with extension to color images

Template matching is a technique widely used for finding patterns in digital images. A good template matching should be able to detect template instances that have undergone geometric transformations. In this paper, we proposed a grayscale template matching algorithm named Ciratefi, invariant to rotation, scale, translation, brightness and contrast and its extension to color images. We introduce CSSIM (color structural similarity) for comparing the similarity of two color image patches and use it in our algorithm. We also describe a scheme to determine automatically the appropriate parameters of our algorithm and use pyramidal structure to improve the scale invariance. We conducted several experiments to compare grayscale and color Ciratefis with SIFT, C-color-SIFT and EasyMatch algorithms in many different situations. The results attest that grayscale and color Ciratefis are more accurate than the compared algorithms and that color-Ciratefi outperforms grayscale Ciratefi most of the time. However, Ciratefi is slower than the other algorithms.

Improving the tracking capability of adaptive filters via convex combination

As is well known, Hessian-based adaptive filters (such as the recursive-least squares algorithm (RLS) for supervised adaptive filtering, or the Shalvi-Weinstein algorithm (SWA) for blind equalization) converge much faster than gradient-based algorithms [such as the least-mean-squares algorithm (LMS) or the constant-modulus algorithm (CMA)]. However, when the problem is tracking a time-variant filter, the issue is not so clear-cut: there are environments for which each family presents better performance. Given this, we propose the use of a convex combination of algorithms of different families to obtain an algorithm with superior tracking capability. We show the potential of this combination and provide a unified theoretical model for the steady-state excess mean-square error for convex combinations of gradient- and Hessian-based algorithms, assuming a random-walk model for the parameter variations. The proposed model is valid for algorithms of the same or different families, and for supervised (LMS and RLS) or blind (CMA and SWA) algorithms.

The choice of the best among the shortest routes in transparent optical networks

This work introduces the problem of the best choice among M combinations of the shortest paths for dynamic provisioning of lightpaths in all-optical networks. To solve this problem in an optimized way (shortest path and load balance), a new fixed routing algorithm, named Best among the Shortest Routes (BSR), is proposed. The BSR`s performance is compared in terms of blocking probability and network utilization with Dijkstra`s shortest path algorithm and others algorithms proposed in the literature. The evaluated scenarios include several representative topologies for all-optical networking and different wavelength conversion architectures. For all studied scenarios, BSR achieved superior performance. (C) 2010 Elsevier B.V. All rights reserved.

SKAN: Skin Scanner - System for Skin Cancer Detection Using Adaptive Techniques

SKAN: Skin Scanner - System for Skin Cancer Detection Using Adaptive Techniques - combines computer engineering concepts with areas like dermatology and oncology. Its objective is to discern images of skin cancer, specifically melanoma, from others that show only common spots or other types of skin diseases, using image recognition. This work makes use of the ABCDE visual rule, which is often used by dermatologists for melanoma identification, to define which characteristics are analyzed by the software. It then applies various algorithms and techniques, including an ellipse-fitting algorithm, to extract and measure these characteristics and decide whether the spot is a melanoma or not. The achieved results are presented with special focus on the adaptive decision-making and its effect on the diagnosis. Finally, other applications of the software and its algorithms are presented.

HLA-G polymorphisms in women with squamous intraepithelial lesions harboring human papillomavirus

Human papillomavirus (HPV) infection is etiologically associated with low-(LSIL) and high-grade squamous intraepithelial lesions (HSIL) and with cervical cancer. The progression or regression of the lesions may depend, among other factors, on the host heritable immune response. Because human leukocyte antigen (HLA)-G molecules are involved in the modulation of innate and adaptive immune responses, and because no previous studies have evaluated HLA-G polymorphism in patients with SIL, we conducted a study to assess the association between HLA-G polymorphisms and cervical lesions harboring HPV infection. Cervico-vaginal scrapings and blood samples were collected from 125 women with SIL (68 LSIL and 57 HSIL) and from 94 healthy women without HPV infection and cytological abnormalities. HPV type and HLA-G polymorphisms in exons 2, 3 and 8 (14 bp insertion/deletion) were evaluated by PCR methodology, and digested with restriction endonucleases. The Genepop software and the EM and PHASE algorithms were used for statistical analysis. A significant protective association was observed between the presence of the G*0103 allele and SIL and between the G0101/G0104 genotype and HSIL in the group of patients compared to control. The presence of the G0104/+14 bp and G0104/-14 bp haplotypes conferred susceptibility to SIL compared to control. In addition, patients possessing the G0104/+14 bp haplotype and harboring HPV-16 and -18 co-infections were particularly associated with HSIL. These findings suggest that HLA-G polymorphisms may be associated with HPV infection and SIL, consequently representing a profile of predisposition to cervical cancer. Modern Pathology (2009) 22, 1075-1082; doi: 10.1038/modpathol.2009.67; published online 1 May 2009

The anti-MMP activity of benzalkonium chloride

Objective: This study evaluated the ability of benzalkonium chloride (BAC) to bind to dentine and to inhibit soluble recombinant MMPs and bound dentine matrix metalloproteinases (MMPs). Methods: Dentine powder was prepared from extracted human molars. Half was left mineralized; the other half was completely demineralized. The binding of BAG to dentine powder was followed by measuring changes in the supernatant concentration using UV spectrometry. The inhibitory effects of BAC on rhMMP-2, -8 and -9 were followed using a commercially available in vitro proteolytic assay. Matrix-bound endogenous MMP-activity was evaluated in completely demineralized beams. Each beam was either dipped into BAG and then dropped into 1 mL of a complete medium (CM) or they were placed in 1 mL of CM containing BAG for 30 days. After 30 days, changes in the dry mass of the beams or in the hydroxyproline (HYP) content of hydrolysates of the media were quantitated as indirect measures of matrix collagen hydrolysis by MMPs. Results: Demineralized dentine powder took up 10-times more BAG than did mineralized powder. Water rinsing removed about 50% of the bound BAC, whilst rinsing with 0.5 M NaCl removed more than 90% of the bound BAG. BAG concentrations 0.5 wt% produced 100% inhibition of soluble recombinant MMP-2, -8 or -9, and inhibited matrix-bound MMPs between 55 and 66% when measured as mass loss or 76-81% when measured as solubilization of collagen peptide fragments. Conclusions: BAC is effective at inhibiting both soluble recombinant MMPs and matrix-bound dentine MMPs in the absence of resins. (C) 2010 Elsevier Ltd. All rights reserved.

Efficiency issues of evolutionary k-means

One of the top ten most influential data mining algorithms, k-means, is known for being simple and scalable. However, it is sensitive to initialization of prototypes and requires that the number of clusters be specified in advance. This paper shows that evolutionary techniques conceived to guide the application of k-means can be more computationally efficient than systematic (i.e., repetitive) approaches that try to get around the above-mentioned drawbacks by repeatedly running the algorithm from different configurations for the number of clusters and initial positions of prototypes. To do so, a modified version of a (k-means based) fast evolutionary algorithm for clustering is employed. Theoretical complexity analyses for the systematic and evolutionary algorithms under interest are provided. Computational experiments and statistical analyses of the results are presented for artificial and text mining data sets. (C) 2010 Elsevier B.V. All rights reserved.

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.

On the efficiency of evolutionary fuzzy clustering

This paper tackles the problem of showing that evolutionary algorithms for fuzzy clustering can be more efficient than systematic (i.e. repetitive) approaches when the number of clusters in a data set is unknown. To do so, a fuzzy version of an Evolutionary Algorithm for Clustering (EAC) is introduced. A fuzzy cluster validity criterion and a fuzzy local search algorithm are used instead of their hard counterparts employed by EAC. Theoretical complexity analyses for both the systematic and evolutionary algorithms under interest are provided. Examples with computational experiments and statistical analyses are also presented.

Two-level network design with intermediate facilities: An application to electrical distribution systems

We consider the two-level network design problem with intermediate facilities. This problem consists of designing a minimum cost network respecting some requirements, usually described in terms of the network topology or in terms of a desired flow of commodities between source and destination vertices. Each selected link must receive one of two types of edge facilities and the connection of different edge facilities requires a costly and capacitated vertex facility. We propose a hybrid decomposition approach which heuristically obtains tentative solutions for the vertex facilities number and location and use these solutions to limit the computational burden of a branch-and-cut algorithm. We test our method on instances of the power system secondary distribution network design problem. The results show that the method is efficient both in terms of solution quality and computational times. (C) 2010 Elsevier Ltd. All rights reserved.

Transfer reactions in the investigation of light-nuclei nucleosynthesis

Cross sections for the (6)Li(p,gamma)(7)Be, (7)Li(n,gamma)(8)Li (8)Li(n,gamma)(9)Li and (8)Li(p,gamma)(9)Be capture reactions have been investigated in the framework of the potential model. The main ingredients of the potential model are the potentials used to generate the continuum and bound-state wave functions and spectroscopic factors of the corresponding bound systems. The spectroscopic factors for the (7)Li circle times n=(8)Li(gs), (8)Li circle times n=(9)Li(gs) bound systems were obtained from a FR-DWBA analysis of neutron transfer reactions induced by (8)Li radioactive beam on a (9)Be target, while spetroscopic factor for the (8)Li circle times n=(9)Be(gs) bound system were obained from a proton transfer reaction. From the obtained capture reaction cross section, reaction rate for the (8)Li(n,gamma)(9)Li and (8)Li(p,gamma)(9)Be direct neutron and proton capture were determined and compared with other experimental and calculated values.

Near threshold vibrational excitation of molecules by positron impact: A projection operator approach

We report vibrational excitation (v(i) = 0 -> v(f) = 1) cross-sections for positron scattering by H(2) and model calculations for the (v(i) = 0 -> v(f) = 1) excitation of the C-C symmetric stretch mode of C(2)H(2). The Feshbach projection operator formalism was employed to vibrationally resolve the fixed-nuclei phase shifts obtained with the Schwinger multichannel method. The near threshold behavior of H(2) and C(2)H(2) significantly differ in the sense that no low lying singularity (either virtual or bound state) was found for the former, while a e(+)-acetylene virtual state was found at the equilibrium geometry (this virtual state becomes a bound state upon stretching the molecule). For C(2)H(2), we also performed model calculations comparing excitation cross-sections arising from virtual (-i kappa(0)) and bound (+i kappa(0)) states symmetrically located around the origin of the complex momentum plane (i.e. having the same kappa(0)). The virtual state is seen to significantly couple to vibrations, and similar cross-sections were obtained for shallow bound and virtual states. (c) 2007 Elsevier B.V. All rights reserved.