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.

Use of a semantically grained database system for distribution and control within design environments

This paper presents a technique to share the data stored in an object-oriented database aimed at designing environments. This technique shares data between two related databases, called the Original and Product databases, and is composed of three processes: data separation, evolution and integration. Whenever a block of data needs to be shared, it is spread into both databases, resulting in a block on the original database, and another into the Product database, with special links between them controlled by the Object Manager. These blocks do not need to be maintained identical during the evolution phase of the sharing process. Six types of links were defined, and by choosing one, the designer control the evolution and reintegration of the block in both databases. This process uses the composite object concept as the unit of control. The presented concepts can be applied to any data model with support to composite objects.

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.

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.

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.

Transcription profiling of signal transduction-related genes in sugarcane tissues

A collection of 237,954 sugarcane ESTs was examined in search of signal transduction genes. Over 3,500 components involved in several aspects of signal transduction, transcription, development, cell cycle, stress responses and pathogen interaction were compiled into the Sugarcane Signal Transduction (SUCAST) Catalogue. Sequence comparisons and protein domain analysis revealed 477 receptors, 510 protein kinases, 107 protein phosphatases, 75 small GTPases, 17 G-proteins, 114 calcium and inositol metabolism proteins, and over 600 transcription factors. The elements were distributed into 29 main categories subdivided into 409 sub-categories. Genes with no matches in the public databases and of unknown function were also catalogued. A cDNA microarray was constructed to profile individual variation of plants cultivated in the field and transcript abundance in six plant organs (flowers, roots, leaves, lateral buds, and 1(st) and 4(th) internodes). From 1280 distinct elements analyzed, 217 (17%) presented differential expression in two biological samples of at least one of the tissues tested. A total of 153 genes (12%) presented highly similar expression levels in all tissues. A virtual profile matrix was constructed and the expression profiles were validated by real-time PCR. The expression data presented can aid in assigning function for the sugarcane genes and be useful for promoter characterization of this and other economically important grasses.

On developing efficient applications using conservative distributed simulation paradigm

This paper aims to present, using a set of guidelines, how to apply the conservative distributed simulation paradigm (CMB protocol) to develop efficient applications. Using these guidelines, even a user with little experience on distributed simulation and computer architecture can have good performance on distributed simulations using conservative synchronization protocols for parallel processes.The set of guidelines is focus on a specific application domain, the performance evaluation of computer systems, considering models with coarse granularity and few logical processes and running over two platforms: parallel (high performance communication environment) and distributed (low performance communication environment).

Multi-objective evolutionary particle swarm optimization in the assessment of the impact of distributed generation

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Time-series-based maximization of distributed wind power generation integration

Energy policies and technological progress in the development of wind turbines have made wind power the fastest growing renewable power source worldwide. The inherent variability of this resource requires special attention when analyzing the impacts of high penetration on the distribution network. A time-series steady-state analysis is proposed that assesses technical issues such as energy export, losses, and short-circuit levels. A multiobjective programming approach based on the nondominated sorting genetic algorithm (NSGA) is applied in order to find configurations that maximize the integration of distributed wind power generation (DWPG) while satisfying voltage and thermal limits. The approach has been applied to a medium voltage distribution network considering hourly demand and wind profiles for part of the U.K. The Pareto optimal solutions obtained highlight the drawbacks of using a single demand and generation scenario, and indicate the importance of appropriate substation voltage settings for maximizing the connection of MPG.

ALGORITHM FOR PROBABILISTIC ANALYSIS of DISTRIBUTION SYSTEMS WITH DISTRIBUTED GENERATION

In this paper an efficient algorithm for probabilistic analysis of unbalanced three-phase weakly-meshed distribution systems is presented. This algorithm uses the technique of Two-Point Estimate Method for calculating the probabilistic behavior of the system random variables. Additionally, the deterministic analysis of the state variables is performed by means of a Compensation-Based Radial Load Flow (CBRLF). Such load flow efficiently exploits the topological characteristics of the network. To deal with distributed generation, a strategy to incorporate a simplified model of a generator in the CBRLF is proposed. Thus, depending on the type of control and generator operation conditions, the node with distributed generation can be modeled either as a PV or PQ node. To validate the efficiency of the proposed algorithm, the IEEE 37 bus test system is used. The probabilistic results are compared with those obtained using the Monte Carlo method.

Cryptic sexual populations account for genetic diversity and ecological success in a widely distributed, asexual fungus-growing ant

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Evaluating distributed generation impacts with a multiobjective index

Evaluating the technical impacts associated with connecting distributed generation to distribution networks is a complex activity requiring a wide range of network operational and security effects to be qualified and quantified. One means of dealing with such complexity is through the use of indices that indicate the benefit or otherwise of connections at a given location and which could be used to shape the nature of the contract between the utility and distributed generator. This paper presents a multiobjective performance index for distribution networks with distributed generation which considers a wide range of technical issues. Distributed generation is extensively located and sized within the IEEE-34 test feeder, wherein the multiobjective performance index is computed for each configuration. The results are presented and discussed.

THEORY OF ELECTRICAL CHARACTERISTICS OF A SCHOTTKY-BARRIER HAVING EXPONENTIALLY DISTRIBUTED IMPURITY STATES AND METAL-INSULATOR METAL STRUCTURES

The metal-insulator or metal-amorphous semiconductor blocking contact is still not well understood. Here, we discuss the steady state characteristics of a non-intimate metal-insulator Schottky barrier. We consider an exponential distribution (in energy) of impurity states in addition to impurity states at a single energy level within the depletion region. We present analytical expressions for the electrical potential, field, thickness of depletion region, capacitance, and charge accumulated in the depletion region. We also discuss ln I versus V(ap) data. Finally, we compare the characteristics in three cases: (i) impurity states at only a single energy level; (ii) uniform energy distribution of impurity states; and (iii) exponential energy distribution of impurity states.In general, the electrical characteristics of Schottky barriers and metal-insulator-metal structures with Schottky barriers depend strongly on the energy distribution of impurity states.

THEORY OF NON-STEADY-STATE ELECTRICAL CHARACTERISTICS OF METAL-INSULATOR-METAL STRUCTURES WITH SCHOTTKY BARRIERS AND UNIFORMLY DISTRIBUTED INTERFACE IMPURITY STATES

The metal-insulator (or amorphous semiconductor) blocking contact is still not well understood. In the present paper, we discuss the non steady state characteristics of Metal-lnsulator-Metal Structure with non-intimate blocking contacts (i.e. Metal-Oxide-Insulator-Metal Structure). We consider a uniform distribution (in energy) of impurity states in addition to impurity states at a single energy level within the depletion region. We discuss thermal as well as isothermal characteristics and present expressions for the temperature of maximum current (T-m) and a method to calculate the density of uniformly distributed impurity states. The variation of mobility with electrical field has also been considered. Finally we plot the theoretical curves under different conditions. The present results are closing into available experimental results.