Avoiding Divergence in the Shalvi-Weinstein Algorithm

The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the Shalvi-Weinstein algorithm (SWA). It is well-known that SWA presents a higher convergence rate than CMA. at the expense of higher computational complexity. If the forgetting factor is not sufficiently close to one, if the initialization is distant from the optimal solution, or if the signal-to-noise ratio is low, SWA can converge to undesirable local minima or even diverge. In this paper, we show that divergence can be caused by an inconsistency in the nonlinear estimate of the transmitted signal. or (when the algorithm is implemented in finite precision) by the loss of positiveness of the estimate of the autocorrelation matrix, or by a combination of both. In order to avoid the first cause of divergence, we propose a dual-mode SWA. In the first mode of operation. the new algorithm works as SWA; in the second mode, it rejects inconsistent estimates of the transmitted signal. Assuming the persistence of excitation condition, we present a deterministic stability analysis of the new algorithm. To avoid the second cause of divergence, we propose a dual-mode lattice SWA, which is stable even in finite-precision arithmetic, and has a computational complexity that increases linearly with the number of adjustable equalizer coefficients. The good performance of the proposed algorithms is confirmed through numerical simulations.

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.

Hardware/firmware implementation of a soft sensor using an improved version of a fuzzy identification algorithm

This paper presents the design and implementation of an embedded soft sensor, i. e., a generic and autonomous hardware module, which can be applied to many complex plants, wherein a certain variable cannot be directly measured. It is implemented based on a fuzzy identification algorithm called ""Limited Rules"", employed to model continuous nonlinear processes. The fuzzy model has a Takagi-Sugeno-Kang structure and the premise parameters are defined based on the Fuzzy C-Means (FCM) clustering algorithm. The firmware contains the soft sensor and it runs online, estimating the target variable from other available variables. Tests have been performed using a simulated pH neutralization plant. The results of the embedded soft sensor have been considered satisfactory. A complete embedded inferential control system is also presented, including a soft sensor and a PID controller. (c) 2007, ISA. Published by Elsevier Ltd. All rights reserved.

The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm

This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound algorithm is proposed. Lower bounds and pruning rules that exploit properties of the problem are introduced. The proposed approach is examined through a computational comparative study with 280 problems involving different due date scenarios. In addition, the values of optimal solutions for small problems from a known benchmark are provided.

Histopathological Changes in the Placentas and Fetuses of Mice Infected with Trypanosoma cruzi Isolated from the Myotis nigricans nigricans Bat

Histopathological changes and placental transmission were studied in the late stages of pregnancy in mice infected with a strain of Trypanosoma cruzi, isolated from a Myolis nigricans nigricans bat. Large amastigote nests were observed in uterine muscles, as well as in decidual and endothelial placental cells. In addition, persistent coagulative and fibrotic Vascular degeneration was observed. Large amastigote burdens were found in giant cells, spongioblasts and endothelial cells within the labyrinthine layer. Transplacental transmission was confirmed in 30% of the fetuses examined, in which amastrigote nests were seen only in striated muscle. During tire acute phase, intrauterine development was impaired as the result of parasitic invasion of the placenta, and fetal mortality rose to 10%. (C) 2008 Elsevier Ltd. All rights reserved.

A spectral clustering algorithm for manufacturing cell formation

A graph clustering algorithm constructs groups of closely related parts and machines separately. After they are matched for the least intercell moves, a refining process runs on the initial cell formation to decrease the number of intercell moves. A simple modification of this main approach can deal with some practical constraints, such as the popular constraint of bounding the maximum number of machines in a cell. Our approach makes a big improvement in the computational time. More importantly, improvement is seen in the number of intercell moves when the computational results were compared with best known solutions from the literature. (C) 2009 Elsevier Ltd. All rights reserved.

Assessment of immediate conservative breast surgery reconstruction: A classification system of defects revisited and an algorithm for selecting the appropriate technique

Background: Although various techniques have been used for breast conservation surgery reconstruction, there are few studies describing a logical approach to reconstruction of these defects. The objectives of this study were to establish a classification system for partial breast defects and to develop a reconstructive algorithm. Methods: The authors reviewed a 7-year experience with 209 immediate breast conservation surgery reconstructions. Mean follow-up was 31 months. Type I defects include tissue resection in smaller breasts (bra size A/B), including type IA, which involves minimal defects that do not cause distortion; type III, which involves moderate defects that cause moderate distortion; and type IC, which involves large defects that cause significant deformities. Type II includes tissue resection in medium-sized breasts with or without ptosis (bra size C), and type III includes tissue resection in large breasts with ptosis (bra size D). Results: Eighteen percent of patients presented type I, where a lateral thoracodorsal flap and a latissimus dorsi flap were performed in 68 percent. Forty-five percent presented type II defects, where bilateral mastopexy was performed in 52 percent. Thirty-seven percent of patients presented type III distortion, where bilateral reduction mammaplasty was performed in 67 percent. Thirty-five percent of patients presented complications, and most were minor. Conclusions: An algorithm based on breast size in relation to tumor location and extension of resection can be followed to determine the best approach to reconstruction. The authors` results have demonstrated that the complications were similar to those in other clinical series. Success depends on patient selection, coordinated planning with the oncologic surgeon, and careful intraoperative management.

Vaccinating the vampire bat Desmodus rotundus against rabies

The objective of this study was to extend the previous work of indirect oral rabies immunization of vampire bats (Desmodus rotundus) maintained in captivity, which demonstrated the immunogenicity of the V-RG vaccine (Vaccinia-Rabies Glycoprotein) and indicated that although the results had been encouraging, a new method for concentrating the vaccine should be tested in order to avoid vaccine loss and increase the survival proportion of bats after rabies challenge. In this study, three groups of seven bats each were tested with vaccine concentrated by ultrafiltration through a cellulose membrane. The vaccine was homogenized in Vaseline paste and applied to the back of one vector bat, which was then reintroduced into its group. A dose of 10(5.0) MICLD50 rabies virus was used by intramuscular route to challenge the bats postvaccination. The survival proportion in the three groups after the challenge was 71.4%, 71.4% and 100%. (c) 2008 Elsevier B.V. All rights reserved.

A method for simultaneous detection and identification of Brazilian dog- and vampire bat-related rabies virus by reverse transcription loop-mediated isothermal amplification assay

At present, the sporadic occurrence of human rabies in Brazil can be attributed primarily to dog- and vampire bat-related rabies viruses. Reverse transcription loop-mediated isothermal amplification (RT-LAMP) was employed as a simultaneous detection method for both rabies field variants within 60 min. Vampire bat-related rabies viruses could be distinguished from dog variants by digesting amplicons of the RT-LAMP reaction using the restriction enzyme Alwl. Amplification and digestion could both be completed within 120 min after RNA extraction. In addition, the RI-LAMP assay also detected rabies virus in isolates from Brazilian frugivorous bats and Ugandan dog, bovine and goat samples. In contrast, there were false negative results from several Brazilian insectivorous bats and all of Chinese dog, pig, and bovine samples using the RI-LAMP assay. This study showed that the RT-LAMP assay is effective for the rapid detection of rabies virus isolates from the primary reservoir in Brazil. Further improvements are necessary so that the RT-LAMP assay can be employed for the universal detection of genetic variants of rabies virus in the field. (C) 2010 Elsevier B.V. All rights reserved.

Carios fonsecai sp nov (Acari, Argasidae), a bat tick from the central-western region of Brazil

Males, females, and larvae of Carios fonsecai sp. nov. are described from free-living ticks collected in a cave at Bonito, state of Mato Grosso do Sul, Brazil. The presence of cheeks and legs with micromammillate cuticle makes adults of C. fonsecai morphologically related to a group of argasid species (mostly bat-associated) formerly classified into the subgenus Alectorobius, genus Ornithodoros. Examination of larvae indicates that C. fonsecai is clearly distinct from most of the previously described Carios species formerly classified into the subgenus Alectorobius, based primarily on its larger body size, dorsal setae number, dorsal plate shape, and hypostomal morphology. On the other hand, the larva of C. fonsecai is most similar to Carios peropteryx, and Carios peruvianus, from which differences in dorsal plate length and width, tarsal setae, and hypostome characteristics are useful for morphological differentiation. The mitochondrial 16S rDNA sequence of C. fonsecai showed to be closest (85-88% identity) to several corresponding sequences of different Carios species available in GenBank. Bats identified as Peropteryx macrotis and Desmodus rotundus were found infested by C. fonsecai larvae in the same cave where the type series was collected. C. fonsecai showed to be aggressive to humans in the laboratory.

The SARS algorithm: detrending CoRoT light curves with Sysrem using simultaneous external parameters

Surveys for exoplanetary transits are usually limited not by photon noise but rather by the amount of red noise in their data. In particular, although the CoRoT space-based survey data are being carefully scrutinized, significant new sources of systematic noises are still being discovered. Recently, a magnitude-dependant systematic effect was discovered in the CoRoT data by Mazeh et al. and a phenomenological correction was proposed. Here we tie the observed effect to a particular type of effect, and in the process generalize the popular Sysrem algorithm to include external parameters in a simultaneous solution with the unknown effects. We show that a post-processing scheme based on this algorithm performs well and indeed allows for the detection of new transit-like signals that were not previously detected.

Genetic algorithm inversion of the average 1D crustal structure using local and regional earthquakes

Knowing the best 1D model of the crustal and upper mantle structure is useful not only for routine hypocenter determination, but also for linearized joint inversions of hypocenters and 3D crustal structure, where a good choice of the initial model can be very important. Here, we tested the combination of a simple GA inversion with the widely used HYPO71 program to find the best three-layer model (upper crust, lower crust, and upper mantle) by minimizing the overall P- and S-arrival residuals, using local and regional earthquakes in two areas of the Brazilian shield. Results from the Tocantins Province (Central Brazil) and the southern border of the Sao Francisco craton (SE Brazil) indicated an average crustal thickness of 38 and 43 km, respectively, consistent with previous estimates from receiver functions and seismic refraction lines. The GA + HYPO71 inversion produced correct Vp/Vs ratios (1.73 and 1.71, respectively), as expected from Wadati diagrams. Tests with synthetic data showed that the method is robust for the crustal thickness, Pn velocity, and Vp/Vs ratio when using events with distance up to about 400 km, despite the small number of events available (7 and 22, respectively). The velocities of the upper and lower crusts, however, are less well constrained. Interestingly, in the Tocantins Province, the GA + HYPO71 inversion showed a secondary solution (local minimum) for the average crustal thickness, besides the global minimum solution, which was caused by the existence of two distinct domains in the Central Brazil with very different crustal thicknesses. (C) 2010 Elsevier Ltd. All rights reserved.

The modularity of seed dispersal: differences in structure and robustness between bat- and bird-fruit networks

In networks of plant-animal mutualisms, different animal groups interact preferentially with different plants, thus forming distinct modules responsible for different parts of the service. However, what we currently know about seed dispersal networks is based only on birds. Therefore, we wished to fill this gap by studying bat-fruit networks and testing how they differ from bird-fruit networks. As dietary overlap of Neotropical bats and birds is low, they should form distinct mutualistic modules within local networks. Furthermore, since frugivory evolved only once among Neotropical bats, but several times independently among Neotropical birds, greater dietary overlap is expected among bats, and thus connectance and nestedness should be higher in bat-fruit networks. If bat-fruit networks have higher nestedness and connectance, they should be more robust to extinctions. We analyzed 1 mixed network of both bats and birds and 20 networks that consisted exclusively of either bats (11) or birds (9). As expected, the structure of the mixed network was both modular (M = 0.45) and nested (NODF = 0.31); one module contained only birds and two only bats. In 20 datasets with only one disperser group, bat-fruit networks (NODF = 0.53 +/- A 0.09, C = 0.30 +/- A 0.11) were more nested and had a higher connectance than bird-fruit networks (NODF = 0.42 +/- A 0.07, C = 0.22 +/- A 0.09). Unexpectedly, robustness to extinction of animal species was higher in bird-fruit networks (R = 0.60 +/- A 0.13) than in bat-fruit networks (R = 0.54 +/- A 0.09), and differences were explained mainly by species richness. These findings suggest that a modular structure also occurs in seed dispersal networks, similar to pollination networks. The higher nestedness and connectance observed in bat-fruit networks compared with bird-fruit networks may be explained by the monophyletic evolution of frugivory in Neotropical bats, among which the diets of specialists seem to have evolved from the pool of fruits consumed by generalists.

Investigation of a new GRASP-based clustering algorithm applied to biological data

A large amount of biological data has been produced in the last years. Important knowledge can be extracted from these data by the use of data analysis techniques. Clustering plays an important role in data analysis, by organizing similar objects from a dataset into meaningful groups. Several clustering algorithms have been proposed in the literature. However, each algorithm has its bias, being more adequate for particular datasets. This paper presents a mathematical formulation to support the creation of consistent clusters for biological data. Moreover. it shows a clustering algorithm to solve this formulation that uses GRASP (Greedy Randomized Adaptive Search Procedure). We compared the proposed algorithm with three known other algorithms. The proposed algorithm presented the best clustering results confirmed statistically. (C) 2009 Elsevier Ltd. All rights reserved.

Infeasibility handling in genetic algorithm using nested domains for production planning

In this paper we present a genetic algorithm with new components to tackle capacitated lot sizing and scheduling problems with sequence dependent setups that appear in a wide range of industries, from soft drink bottling to food manufacturing. Finding a feasible solution to highly constrained problems is often a very difficult task. Various strategies have been applied to deal with infeasible solutions throughout the search. We propose a new scheme of classifying individuals based on nested domains to determine the solutions according to the level of infeasibility, which in our case represents bands of additional production hours (overtime). Within each band, individuals are just differentiated by their fitness function. As iterations are conducted, the widths of the bands are dynamically adjusted to improve the convergence of the individuals into the feasible domain. The numerical experiments on highly capacitated instances show the effectiveness of this computational tractable approach to guide the search toward the feasible domain. Our approach outperforms other state-of-the-art approaches and commercial solvers. (C) 2009 Elsevier Ltd. All rights reserved.