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.

Behavioral suites mediate group-level foraging dynamics in communities of tropical stingless bees

Competition for floral resources is a key force shaping pollinator communities, particularly among social bees. The ability of social bees to recruit nestmates for group foraging is hypothesized to be a major factor in their ability to dominate rich resources such as mass-flowering trees. We tested the role of group foraging in attaining dominance by stingless bees, eusocial tropical pollinators that exhibit high diversity in foraging strategies. We provide the first experimental evidence that meliponine group foraging strategies, large colony sizes and aggressive behavior form a suite of traits that enable colonies to improve dominance of rich resources. Using a diverse assemblage of Brazilian stingless bee species and an array of artificial ""flowers"" that provided a sucrose reward, we compared species` dominance and visitation under unrestricted foraging conditions and with experimental removal of group-foraging species. Dominance does not vary with individual body size, but rather with foraging group size. Species that recruit larger numbers of nestmates (Scaptotrigona aff. depilis, Trigona hyalinata, Trigona spinipes) dominated both numerically (high local abundance) and behaviorally (controlling feeders). Removal of group-foraging species increased feeding opportunities for solitary foragers (Frieseomelitta varia, Melipona quadrifasciata and Nannotrigona testaceicornis). Trigona hyalinata always dominated under unrestricted conditions. When this species was removed, T. spinipes or S. aff. depilis controlled feeders and limited visitation by solitary-foraging species. Because bee foraging patterns determine plant pollination success, understanding the forces that shape these patterns is crucial to ensuring pollination of both crops and natural areas in the face of current pollinator declines.

BIRD FORAGING IN ANACARDIUM PATCHES IN CENTRAL BRAZILIAN FIRE BREAKS: RELATIONSHIP BETWEEN FLOCK SIZE AND PATCH SIZE

Fire management ran increase the biomass of some plant species at fire breaks in reserves of the Cerrado. For example, numerous and large patches of monkey-nuts (Anacardium humile, Anacardiaceae) provide abundant food resources for wildlife in the lower strata of savanna woodlands managed by fire. The objective of this study was to examine the exploitation of A. humile patches by birds in managed savanna woodlands (fire breaks) at Emas National Park, southwest Brazil. The relationship between flock size and the size of Anacardium patches were also investigated. Fire breaks were sampled in September and October 2006, when fruits and flowers were abundant. Ara ararauna was often recorded exploiting resources of Anacardium patches. This species and other psittacids (Amazona aestiva, Alipiopsittaca xanthops, and Diopsittaca nobilis) consumed seeds usually on the ground around fruiting patches. Members of Aratinga aurea flocks and Ramphastos toco consumed pseudo-fruits. Larger flocks detected were those of A. aurea and A. ararauna. Groups of A. ararauna that exploited larger patches tended to be larger than flocks that exploited smaller patches. This study suggests that intra- and interspecific interactions and characteristics of Anacardium patches and of the surrounding vegetation are involved in the feeding ecology of birds in the lower stratum of managed woodlands. Fruiting Anacardium patches attract numerous frugivorous birds to fire breaks at Emas National Park. Further research is needed to a better understanding of the influence of fire management on birds in the Cerrado. Accepted 31 July 2009.

Exploring Bacterial Diversity of Endodontic Microbiota by Cloning and Sequencing 16S rRNA

Introduction: The characterization of microbial communities infecting the endodontic system in each clinical condition may help on the establishment of a correct prognosis and distinct strategies of treatment. The purpose of this study was to determine the bacterial diversity in primary endodontic infections by 16S ribosomal-RNA (rRNA) sequence analysis. Methods: Samples from root canals of untreated asymptomatic teeth (n = 12) exhibiting periapical lesions were obtained, 165 rRNA bacterial genomic libraries were constructed and sequenced, and bacterial diversity was estimated. Results: A total of 489 clones were analyzed (mean, 40.7 +/- 8.0 clones per sample). Seventy phylotypes were identified of which six were novel phylotypes belonging to the family Ruminococcaceae. The mean number of taxa per canal was 10.0, ranging from 3 to 21 per sample; 65.7% of the cloned sequences represented phylotypes for which no cultivated isolates have been reported. The most prevalent taxa were Atopobium rimae (50.0%), Dialister invisus, Pre-votella oris, Pseudoramibacter alactolyticus, and Tannerella forsythia (33.3%). Conclusions: Although several key species predominate in endodontic samples of asymptomatic cases with periapical lesions, the primary endodontic infection is characterized by a wide bacterial diversity, which is mostly represented by members of the phylum Firmicutes belonging to the class Clostridia followed by the phylum Bacteroidetes. (J Ended 2011;37:922-926)

The pst operon of enteropathogenic Escherichia coli enhances bacterial adherence to epithelial cells

Enteropathogenic Escherichia coli (EPEC) adheres in vivo and in vitro to epithelial cells. Two main adhesins, the bundle-forming pilus and intimin, encoded by the Up operon and eae, respectively, are responsible for the localized and the intimate adherence phenotypes. Deletion of the pst operon of EPEC abolishes the transport of inorganic phosphate through the phosphate-specific transport system and causes the constitutive expression of the PHO regulon genes. In the absence of pst there is a decrease in the expression of the main EPEC adhesins and a reduction in bacterial adherence to epithelial cells in vitro. This effect is not related to PHO constitutivity, because a Delta pst phoB double mutant that is defective in the transcription of the PHO genes also displayed low levels of adherence and expression of adhesins. Likewise, a PHO-constitutive phoR mutation did not affect bacterial adherence. The expression of the per operon, which encodes the Up and ler regulators PerA and PerC, is also negatively affected by the pst deletion. Overall, the data presented here demonstrate that the pst operon of EPEC plays a positive role in the bacterial adherence mechanism by increasing the expression of perA and perC and consequently the transcription of bfp and eae.

Phylogenetic Validation of the Genera Angomonas and Strigomonas of Trypanosomatids Harboring Bacterial Endosymbionts with the Description of New Species of Trypanosomatids and of Proteobacterial Symbionts

We comparatively examined the nutritional, molecular and optical and electron microscopical characteristics of reference species and new isolates of trypanosomatids harboring bacterial endosymbionts. Sequencing of the V7V8 region of the small subunit of the ribosomal RNA (SSU rRNA) gene distinguished six major genotypes among the 13 isolates examined. The entire sequences of the SSU rRNA and glycosomal glyceraldehyde phosphate dehydrogenase (gGAPDH) genes were obtained for phylogenetic analyses. In the resulting phylogenetic trees, the symbiont-harboring species clustered as a major clade comprising two subclades that corresponded to the proposed genera Angomonas and Strigomonas. The genus Angomonas comprised 10 flagellates including former Crithidia deanei and C. desouzai plus a new species. The genus Strigomonas included former Crithidia oncopelti and Blastocrithidia cuiicis plus a new species. Sequences from the internal transcribed spacer of ribosomal DNA (ITS rDNA) and size polymorphism of kinetoplast DNA (kDNA) minicircles revealed considerable genetic heterogeneity within the genera Angomonas and Strigomonas. Phylogenetic analyses based on 16S rDNA and ITS rDNA sequences demonstrated that all of the endosymbionts belonged to the Betaproteobacteria and revealed three new species. The congruence of the phylogenetic trees of trypanosomatids and their symbionts support a co-divergent host-symbiont evolutionary history. (C) 2011 Elsevier GmbH. All rights reserved.

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.

A Mass-Conserving Algorithm for Dynamical Lubrication Problems With Cavitation

A numerical algorithm for fully dynamical lubrication problems based on the Elrod-Adams formulation of the Reynolds equation with mass-conserving boundary conditions is described. A simple but effective relaxation scheme is used to update the solution maintaining the complementarity conditions on the variables that represent the pressure and fluid fraction. The equations of motion are discretized in time using Newmark`s scheme, and the dynamical variables are updated within the same relaxation process just mentioned. The good behavior of the proposed algorithm is illustrated in two examples: an oscillatory squeeze flow (for which the exact solution is available) and a dynamically loaded journal bearing. This article is accompanied by the ready-to-compile source code with the implementation of the proposed algorithm. [DOI: 10.1115/1.3142903]

Improvements on the Porter`s Stemming Algorithm for Portuguese

The amount of textual information digitally stored is growing every day. However, our capability of processing and analyzing that information is not growing at the same pace. To overcome this limitation, it is important to develop semiautomatic processes to extract relevant knowledge from textual information, such as the text mining process. One of the main and most expensive stages of the text mining process is the text pre-processing stage, where the unstructured text should be transformed to structured format such as an attribute-value table. The stemming process, i.e. linguistics normalization, is usually used to find the attributes of this table. However, the stemming process is strongly dependent on the language in which the original textual information is given. Furthermore, for most languages, the stemming algorithms proposed in the literature are computationally expensive. In this work, several improvements of the well know Porter stemming algorithm for the Portuguese language, which explore the characteristics of this language, are proposed. Experimental results show that the proposed algorithm executes in far less time without affecting the quality of the generated stems.

Genetic Algorithm for the Determination of Linear Viscoelastic Relaxation Spectrum from Experimental Data

Conventional procedures employed in the modeling of viscoelastic properties of polymer rely on the determination of the polymer`s discrete relaxation spectrum from experimentally obtained data. In the past decades, several analytical regression techniques have been proposed to determine an explicit equation which describes the measured spectra. With a diverse approach, the procedure herein introduced constitutes a simulation-based computational optimization technique based on non-deterministic search method arisen from the field of evolutionary computation. Instead of comparing numerical results, this purpose of this paper is to highlight some Subtle differences between both strategies and focus on what properties of the exploited technique emerge as new possibilities for the field, In oder to illustrate this, essayed cases show how the employed technique can outperform conventional approaches in terms of fitting quality. Moreover, in some instances, it produces equivalent results With much fewer fitting parameters, which is convenient for computational simulation applications. I-lie problem formulation and the rationale of the highlighted method are herein discussed and constitute the main intended contribution. (C) 2009 Wiley Periodicals, Inc. J Appl Polym Sci 113: 122-135, 2009

Grid job scheduling using Route with Genetic Algorithm support

In 2006 the Route load balancing algorithm was proposed and compared to other techniques aiming at optimizing the process allocation in grid environments. This algorithm schedules tasks of parallel applications considering computer neighborhoods (where the distance is defined by the network latency). Route presents good results for large environments, although there are cases where neighbors do not have an enough computational capacity nor communication system capable of serving the application. In those situations the Route migrates tasks until they stabilize in a grid area with enough resources. This migration may take long time what reduces the overall performance. In order to improve such stabilization time, this paper proposes RouteGA (Route with Genetic Algorithm support) which considers historical information on parallel application behavior and also the computer capacities and load to optimize the scheduling. This information is extracted by using monitors and summarized in a knowledge base used to quantify the occupation of tasks. Afterwards, such information is used to parameterize a genetic algorithm responsible for optimizing the task allocation. Results confirm that RouteGA outperforms the load balancing carried out by the original Route, which had previously outperformed others scheduling algorithms from literature.

An unstructured CVFEM and moving interface algorithm for non-Newtonian Hele-Shaw flows in injection molding

Purpose - The purpose of this paper is to develop a novel unstructured simulation approach for injection molding processes described by the Hele-Shaw model. Design/methodology/approach - The scheme involves dual dynamic meshes with active and inactive cells determined from an initial background pointset. The quasi-static pressure solution in each timestep for this evolving unstructured mesh system is approximated using a control volume finite element method formulation coupled to a corresponding modified volume of fluid method. The flow is considered to be isothermal and non-Newtonian. Findings - Supporting numerical tests and performance studies for polystyrene described by Carreau, Cross, Ellis and Power-law fluid models are conducted. Results for the present method are shown to be comparable to those from other methods for both Newtonian fluid and polystyrene fluid injected in different mold geometries. Research limitations/implications - With respect to the methodology, the background pointset infers a mesh that is dynamically reconstructed here, and there are a number of efficiency issues and improvements that would be relevant to industrial applications. For instance, one can use the pointset to construct special bases and invoke a so-called ""meshless"" scheme using the basis. This would require some interesting strategies to deal with the dynamic point enrichment of the moving front that could benefit from the present front treatment strategy. There are also issues related to mass conservation and fill-time errors that might be addressed by introducing suitable projections. The general question of ""rate of convergence"" of these schemes requires analysis. Numerical results here suggest first-order accuracy and are consistent with the approximations made, but theoretical results are not available yet for these methods. Originality/value - This novel unstructured simulation approach involves dual meshes with active and inactive cells determined from an initial background pointset: local active dual patches are constructed ""on-the-fly"" for each ""active point"" to form a dynamic virtual mesh of active elements that evolves with the moving interface.

FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ`S ATTRACTOR

A novel cryptography method based on the Lorenz`s attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction among the password, message and a chaotic system. It ensures that the algorithm yields a secure codification, even if the nature of the chaotic system is known. The algorithm has been implemented in two versions: one sequential and slow and the other, parallel and fast. Our algorithm assures the integrity of the ciphertext (we know if it has been altered, which is not assured by traditional algorithms) and consequently its authenticity. Numerical experiments are presented, discussed and show the behavior of the method in terms of security and performance. The fast version of the algorithm has a performance comparable to AES, a popular cryptography program used commercially nowadays, but it is more secure, which makes it immediately suitable for general purpose cryptography applications. An internet page has been set up, which enables the readers to test the algorithm and also to try to break into the cipher.

A WAVELET-BASED SPEAKER VERIFICATION ALGORITHM

This paper presents a study on wavelets and their characteristics for the specific purpose of serving as a feature extraction tool for speaker verification (SV), considering a Radial Basis Function (RBF) classifier, which is a particular type of Artificial Neural Network (ANN). Examining characteristics such as support-size, frequency and phase responses, amongst others, we show how Discrete Wavelet Transforms (DWTs), particularly the ones which derive from Finite Impulse Response (FIR) filters, can be used to extract important features from a speech signal which are useful for SV. Lastly, an SV algorithm based on the concepts presented is described.