An Array Recursive Least-Squares Algorithm With Generic Nonfading Regularization Matrix

We present a novel array RLS algorithm with forgetting factor that circumvents the problem of fading regularization, inherent to the standard exponentially-weighted RLS, by allowing for time-varying regularization matrices with generic structure. Simulations in finite precision show the algorithm`s superiority as compared to alternative algorithms in the context of adaptive beamforming.

Local search multiuser detection

In this work, a wide analysis of local search multiuser detection (LS-MUD) for direct sequence/code division multiple access (DS/CDMA) systems under multipath channels is carried out considering the performance-complexity trade-off. It is verified the robustness of the LS-MUD to variations in loading, E(b)/N(0), near-far effect, number of fingers of the Rake receiver and errors in the channel coefficients estimates. A compared analysis of the bit error rate (BER) and complexity trade-off is accomplished among LS, genetic algorithm (GA) and particle swarm optimization (PSO). Based on the deterministic behavior of the LS algorithm, it is also proposed simplifications over the cost function calculation, obtaining more efficient algorithms (simplified and combined LS-MUD versions) and creating new perspectives for the MUD implementation. The computational complexity is expressed in terms of the number of operations in order to converge. Our conclusion pointed out that the simplified LS (s-LS) method is always more efficient, independent of the system conditions, achieving a better performance with a lower complexity than the others heuristics detectors. Associated to this, the deterministic strategy and absence of input parameters made the s-LS algorithm the most appropriate for the MUD problem. (C) 2008 Elsevier GmbH. All rights reserved.

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.

TonB-dependent outer-membrane proteins and siderophore utilization in Pseudomonas fluorescens Pf-5

The soil bacterium Pseudomonas fluorescens Pf-5 produces two siderophores, a pyoverdine and enantio-pyochelin, and its proteome includes 45 TonB-dependent outer-membrane proteins, which commonly function in uptake of siderophores and other substrates from the environment. The 45 proteins share the conserved beta-barrel and plug domains of TonB-dependent proteins but only 18 of them have an N-terminal signaling domain characteristic of TonB-dependent transducers (TBDTs), which participate in cell-surface signaling systems. Phylogenetic analyses of the 18 TBDTs and 27 TonB-dependent receptors (TBDRs), which lack the N-terminal signaling domain, suggest a complex evolutionary history including horizontal transfer among different microbial lineages. Putative functions were assigned to certain TBDRs and TBDTs in clades including well-characterized orthologs from other Pseudomonas spp. A mutant of Pf-5 with deletions in pyoverdine and enantio-pyochelin biosynthesis genes was constructed and characterized for iron-limited growth and utilization of a spectrum of siderophores. The mutant could utilize as iron sources a large number of pyoverdines with diverse structures as well as ferric citrate, heme, and the siderophores ferrichrome, ferrioxamine B, enterobactin, and aerobactin. The diversity and complexity of the TBDTs and TBDRs with roles in iron uptake clearly indicate the importance of iron in the fitness and survival of Pf-5 in the environment.

Canine visceral leishmaniasis: Performance of a rapid diagnostic test (Kalazar Detect (TM)) in dogs with and without signs of the disease

Current visceral leishmaniasis (VL) control programs in Brazil include the infected dog elimination but, despite this strategy, the incidence of human VL is still increasing. One of the reasons is the long delay between sample collection, analysis, control implementation and the low sensitivity of diagnostic tests. Due to the high prevalence of asymptomatic dogs, the diagnosis of these animals is important considering their vector infection capacity. Hence, a rapid and accurate diagnosis of canine visceral leishmaniasis is essential for an efficient surveillance program. In this study we evaluated the performance of rK39 antigen in an immunochromatographic format to detect symptomatic and asymptomatic Leishmania chagasi infection in dogs and compared the results with those using a crude antigen ELISA. The sensitivity of rK39 dipstick and ELISA were 83% vs. 95%, respectively, while the specificity was both 100%. Our results also demonstrated that the dipstick test was able to detect infected dogs presenting different clinical forms. (C) 2008 Elsevier B.V. All rights reserved.

A new scale-invariant ratio and finite-size scaling for the stochastic susceptible-infected-recovered model

The critical behavior of the stochastic susceptible-infected-recovered model on a square lattice is obtained by numerical simulations and finite-size scaling. The order parameter as well as the distribution in the number of recovered individuals is determined as a function of the infection rate for several values of the system size. The analysis around criticality is obtained by exploring the close relationship between the present model and standard percolation theory. The quantity UP, equal to the ratio U between the second moment and the squared first moment of the size distribution multiplied by the order parameter P, is shown to have, for a square system, a universal value 1.0167(1) that is the same for site and bond percolation, confirming further that the SIR model is also in the percolation class.

New and improved results for packing identical unitary radius circles within triangles, rectangles and strips

The focus of study in this paper is the class of packing problems. More specifically, it deals with the placement of a set of N circular items of unitary radius inside an object with the aim of minimizing its dimensions. Differently shaped containers are considered, namely circles, squares, rectangles, strips and triangles. By means of the resolution of non-linear equations systems through the Newton-Raphson method, the herein presented algorithm succeeds in improving the accuracy of previous results attained by continuous optimization approaches up to numerical machine precision. The computer implementation and the data sets are available at http://www.ime.usp.br/similar to egbirgin/packing/. (C) 2009 Elsevier Ltd, All rights reserved.

Asymptotic Skewness in Exponential Family Nonlinear Models

In this article, we give an asymptotic formula of order n(-1/2), where n is the sample size, for the skewness of the distributions of the maximum likelihood estimates of the parameters in exponencial family nonlinear models. We generalize the result by Cordeiro and Cordeiro ( 2001). The formula is given in matrix notation and is very suitable for computer implementation and to obtain closed form expressions for a great variety of models. Some special cases and two applications are discussed.

On the Derived Categories and Quasitilted Algebras

In this paper, we present some results on the bounded derived category of Artin algebras, and in particular on the indecomposable objects in these categories, using homological properties. Given a complex X*, we consider the set J(X*) = {i is an element of Z vertical bar H(i)(X*) not equal 0} and we define the application l(X*) = maxJ(X*) - minJ(X*) + 1. We give relationships between some homological properties of an algebra and the respective application l. On the other hand, using homological properties again, we determine two subcategories of the bounded derived category of an algebra, which turn out to be the bounded derived categories of quasi-tilted algebras. As a consequence of these results we obtain new characterizations of quasi-tilted and quasi-tilted gentle algebras.

The Gelfand-Kirillov conjecture and Gelfand-Tsetlin modules for finite W-algebras

We address two problems with the structure and representation theory of finite W-algebras associated with general linear Lie algebras. Finite W-algebras can be defined using either Kostant`s Whittaker modules or a quantum Hamiltonian reduction. Our first main result is a proof of the Gelfand-Kirillov conjecture for the skew fields of fractions of finite W-algebras. The second main result is a parameterization of finite families of irreducible Gelfand-Tsetlin modules using Gelfand-Tsetlin subalgebra. As a corollary, we obtain a complete classification of generic irreducible Gelfand-Tsetlin modules for finite W-algebras. (C) 2009 Elsevier Inc. All rights reserved.