Contexto tectônico dos granitóides neoproterozóicos da faixa de dobramentos paraguai, MS e MT

The Neoproterozoic Granitic Province from the southeast of Mato Grosso and Mato Grosso do Sul region is constituted by seven distinctive granitic bodies, emplaced in the epimetamorphic rocks of the Cuiabá Group and related to the evolution of Paraguai Folded Belt. The Northern portion crops out in Mato Grosso State and is constituted by São Vicente, Araguaiana and Lajinha batholiths; the Southern portion crops out in the Mato Grosso do Sul State and is represented the Sonora, Coxim Rio Negro and Taboco massifs. The structural evolution is evidenced by the presence of three deformational phases, the first one is characterized by axial planar foliation (S 1), parallel or sub parallel to S 0, with attitude N60E/70NW; the second constitutes the most important phase for the tectonic arrangement and is defined by a slaty and/or crenulation cleavages (S 2), with attitude N10W/30SW and contact metamorphism associated to the emplacement of granitic bodies, the third phase is characterized by a weak retrometamorphic cleavage (S 3) with attitude N10E/ 80NW, that evolves local and gradually to strike-slip shear zones. The geological data suggest that this province was formed syn- to post tectonic to the D2 deformational set associated to the end of the collisional event in the Southeastern of the Amazonian Craton.

Application of ontologies in peer-to-peer database with routing queries based on ant colony algorithm

A significant set of information stored in different databases around the world, can be shared through peer-topeer databases. With that, is obtained a large base of knowledge, without the need for large investments because they are used existing databases, as well as the infrastructure in place. However, the structural characteristics of peer-topeer, makes complex the process of finding such information. On the other side, these databases are often heterogeneous in their schemas, but semantically similar in their content. A good peer-to-peer databases systems should allow the user access information from databases scattered across the network and receive only the information really relate to your topic of interest. This paper proposes to use ontologies in peer-to-peer database queries to represent the semantics inherent to the data. The main contribution of this work is enable integration between heterogeneous databases, improve the performance of such queries and use the algorithm of optimization Ant Colony to solve the problem of locating information on peer-to-peer networks, which presents an improve of 18% in results. © 2011 IEEE.

Architecture for peer-to-peer databases with routing queries using ant colony algorithm and semantic support

In a peer-to-peer network, the nodes interact with each other by sharing resources, services and information. Many applications have been developed using such networks, being a class of such applications are peer-to-peer databases. The peer-to-peer databases systems allow the sharing of unstructured data, being able to integrate data from several sources, without the need of large investments, because they are used existing repositories. However, the high flexibility and dynamicity of networks the network, as well as the absence of a centralized management of information, becomes complex the process of locating information among various participants in the network. In this context, this paper presents original contributions by a proposed architecture for a routing system that uses the Ant Colony algorithm to optimize the search for desired information supported by ontologies to add semantics to shared data, enabling integration among heterogeneous databases and the while seeking to reduce the message traffic on the network without causing losses in the amount of responses, confirmed by the improve of 22.5% in this amount. © 2011 IEEE.

Comparative study of algorithms for mining association rules: Traditional approach versus multi-relational approach

The multi-relational Data Mining approach has emerged as alternative to the analysis of structured data, such as relational databases. Unlike traditional algorithms, the multi-relational proposals allow mining directly multiple tables, avoiding the costly join operations. In this paper, is presented a comparative study involving the traditional Patricia Mine algorithm and its corresponding multi-relational proposed, MR-Radix in order to evaluate the performance of two approaches for mining association rules are used for relational databases. This study presents two original contributions: the proposition of an algorithm multi-relational MR-Radix, which is efficient for use in relational databases, both in terms of execution time and in relation to memory usage and the presentation of the empirical approach multirelational advantage in performance over several tables, which avoids the costly join operations from multiple tables. © 2011 IEEE.

Multi-relational algorithm for mining association rules in large databases

Multi-relational data mining enables pattern mining from multiple tables. The existing multi-relational mining association rules algorithms are not able to process large volumes of data, because the amount of memory required exceeds the amount available. The proposed algorithm MRRadix presents a framework that promotes the optimization of memory usage. It also uses the concept of partitioning to handle large volumes of data. The original contribution of this proposal is enable a superior performance when compared to other related algorithms and moreover successfully concludes the task of mining association rules in large databases, bypass the problem of available memory. One of the tests showed that the MR-Radix presents fourteen times less memory usage than the GFP-growth. © 2011 IEEE.

Optimization of algorithm to identification of duplicate tuples through similarity phonetic based on multithreading

Aiming to ensure greater reliability and consistency of data stored in the database, the data cleaning stage is set early in the process of Knowledge Discovery in Databases (KDD) and is responsible for eliminating problems and adjust the data for the later stages, especially for the stage of data mining. Such problems occur in the instance level and schema, namely, missing values, null values, duplicate tuples, values outside the domain, among others. Several algorithms were developed to perform the cleaning step in databases, some of them were developed specifically to work with the phonetics of words, since a word can be written in different ways. Within this perspective, this work presents as original contribution an optimization of algorithm for the detection of duplicate tuples in databases through phonetic based on multithreading without the need for trained data, as well as an independent environment of language to be supported for this. © 2011 IEEE.

Optimization of query results in peer-to-peer database supported by semantics

The development of new technologies that use peer-to-peer networks grows every day, with the object to supply the need of sharing information, resources and services of databases around the world. Among them are the peer-to-peer databases that take advantage of peer-to-peer networks to manage distributed knowledge bases, allowing the sharing of information semantically related but syntactically heterogeneous. However, it is a challenge to ensure the efficient search for information without compromising the autonomy of each node and network flexibility, given the structural characteristics of these networks. On the other hand, some studies propose the use of ontology semantics by assigning standardized categorization of information. The main original contribution of this work is the approach of this problem with a proposal for optimization of queries supported by the Ant Colony algorithm and classification though ontologies. The results show that this strategy enables the semantic support to the searches in peer-to-peer databases, aiming to expand the results without compromising network performance. © 2011 IEEE.

Spatial clustering applied to health area

The significant volume of work accidents in the cities causes an expressive loss to society. The development of Spatial Data Mining technologies presents a new perspective for the extraction of knowledge from the correlation between conventional and spatial attributes. One of the most important techniques of the Spatial Data Mining is the Spatial Clustering, which clusters similar spatial objects to find a distribution of patterns, taking into account the geographical position of the objects. Applying this technique to the health area, will provide information that can contribute towards the planning of more adequate strategies for the prevention of work accidents. The original contribution of this work is to present an application of tools developed for Spatial Clustering which supply a set of graphic resources that have helped to discover knowledge and support for management in the work accidents area. © 2011 IEEE.

Scheduler simulation using iSPD, an iconic-based computer grid simulator

Increased accessibility to high-performance computing resources has created a demand for user support through performance evaluation tools like the iSPD (iconic Simulator for Parallel and Distributed systems), a simulator based on iconic modelling for distributed environments such as computer grids. It was developed to make it easier for general users to create their grid models, including allocation and scheduling algorithms. This paper describes how schedulers are managed by iSPD and how users can easily adopt the scheduling policy that improves the system being simulated. A thorough description of iSPD is given, detailing its scheduler manager. Some comparisons between iSPD and Simgrid simulations, including runs of the simulated environment in a real cluster, are also presented. © 2012 IEEE.

Electronic structure and magnetic properties of FeWO 4 nanocrystals synthesized by the microwave-hydrothermal method

This communication reports that FeWO 4 nanocrystals were successfully synthesized by the microwave-hydrothermal method at 443 K for 1 h. The structure and shape of these nanocrystals were characterized by X-ray diffraction, Rietveld refinement, and transmission electron microscopy. The experimental results and first principles calculations were combined to explain the electronic structure and magnetic properties. Experimental data were obtained by magnetization measurements for different applied magnetic fields. Theoretical calculations revealed that magnetic properties of FeWO 4 nanocrystals can be assigned to two magnetic orderings with parallel or antiparallel spins in adjacent chains. These factors are crucial to understanding of competition between ferro- and antiferromagnetic behavior. © 2012 Elsevier Inc.

Estratégias para produção de mudas de tomateiro utilizando paclobutrazol

The modern tomato production, either for fruit table production or for processing, has required quality seedlings, able to withstand environmental adversities after planting and maintaining the standard genotype productive. The aim of this study was to evaluate the effect of three concentrations of PBZ (0, 50 and 100 mg L-1) and two methods of application (seed treatment and watering seedlings) on seedling emergence and seedling production of tomato growth indeterminate. We adopted a completely randomized in a 2x3 factorial scheme with four replications. We evaluated the seedling emergence, the rate of speed of emergence, seedling height and diameter of hypocotyl and their absolute growth rate (TCA), leaf area, dry weight of shoots, roots and total, and reason leaf area (RAF). Results were subjected to analysis of variance and the mean levels of the factor methods of application compared by Tukey test at 5% and the mean levels of the factor concentrations subjected to regression analysis. The application of paclobutrazol via seedlings watering did not affect seedling emergence, significantly reduced the rate of seedling growth and, consequently, the size of the seedlings without affecting the diameter of hypocotyl, plus allow accumulation of dry roots. A concentration of 50 mg L-1 was shown to be sufficient to obtain seedlings more compact, subject to leaf area, the application via watering, beyond allowing an increase of about 37% in dry weight of roots.

Alocação de canais em sistemas de comunicação celular empregando algoritmo genético distribuído

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Desenvolvimento e implementação de um sistema para detecção de falhas em estruturas usando microcontrolador

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Times assíncronos inicializadores para o planejamento da expansão da transmissão de energia elétrica baseados no modelo híbrido linear

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Geração de algoritmos de escalonamento para simulação de grades computacionais

Pós-graduação em Ciência da Computação - IBILCE