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.

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.

Distributed generators as providers of reactive power support - A market approach

Traditionally, ancillary services are supplied by large conventional generators. However, with the huge penetration of distributed generators (DGs) as a result of the growing interest in satisfying energy requirements, and considering the benefits that they can bring along to the electrical system and to the environment, it appears reasonable to assume that ancillary services could also be provided by DGs in an economical and efficient way. In this paper, a settlement procedure for a reactive power market for DGs in distribution systems is proposed. Attention is directed to wind turbines connected to the network through synchronous generators with permanent magnets and doubly-fed induction generators. The generation uncertainty of this kind of DG is reduced by running a multi-objective optimization algorithm in multiple probabilistic scenarios through the Monte Carlo method and by representing the active power generated by the DGs through Markov models. The objectives to be minimized are the payments of the distribution system operator to the DGs for reactive power, the curtailment of transactions committed in an active power market previously settled, the losses in the lines of the network, and a voltage profile index. The proposed methodology was tested using a modified IEEE 37-bus distribution test system. © 1969-2012 IEEE.

Ergonomics and interfaces of traditional information systems: packaging

The contemporary world is characterized, among other factors, by the influence of the new computer information systems on the behavior of individuals. However, traditional information systems still have interaction problems with users. The aim of this study was to determine whether the interaction aspects between user versus traditional information systems (particularly the graphics) have been fully studied. To do so, the ergonomic aspects and usability of such systems were reviewed, with emphasis on the problems of visibility, legibility and readability. From that criteria, the evolution of ergonomic studies of information systems was reviewed (bibliometrics technique); and examples of ergonomic and usability problems in packaging were demonstrated (case study). The results confirm that traditional information systems still have problems of interaction between human X system, hindering the effective perception of information.

Comments on Magnetically levitated micro PM motors by two types of active magnetic bearings

This note clarifies the design of proportional derivative (PD) controllers for the magnetic levitation systems of micro PM motors proposed in the above paper. It is shown that the PD controllers cannot stabilize the described levited micro motors because it is necessary to use other values of parameters for these controllers. We present necessary and sufficient conditions for the stability of the controlled systems described in the paper.

The hierarchical model of branch planning with random coefficients

We consider the management branch model where the random resources of the subsystem are given by the exponential distributions. The determinate equivalent is a block structure problem of quadratic programming. It is solved effectively by means of the decomposition method, which is based on iterative aggregation. The aggregation problem of the upper level is resolved analytically. This overcomes all difficulties concerning the large dimension of the main problem.

Calculating the Best Dual Bound for Problems with Multiple Lagrangian Relaxations

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Seasonal variation of Alphitobius diaperinus population in broiler facilities in the center-north region of the state of São Paulo

The seasonality of Alphitobius diaperinus population was studied during different seasons during one year, in broiler facilities located in the center-north region of the State of São Paulo. Parasite counting was weekly carried out by the use of traps adapted from the modified model of Arends. During the experimental period, facilities were not submitted to chemical treatment, and the litter was changed between flocks. A lower number of adults and larvae was observed during autumn, with the peak registered in the summer. There was no significant difference between spring and winter averages (adults and larvae), and between spring and summer averages (adults). Average temperatures in the facilities varied from 23.4ºC (winter) to 27.1ºC (spring). The environmentally controlled systems used by the broiler industry provide an adequate habitat for A. diaperinus development. The continuous monitoring of the population of this parasite is essential for designing control strategies, and this can be accomplished by utilizing the traps used in the present experiment.

Aggregation in the generalized transportation problem

Aggregation disaggregation is used to reduce the analysis of a large generalized transportation problem to a smaller one. Bounds for the actual difference between the aggregated objective and the original optimal value are used to quantify the error due to aggregation and estimate the quality of the aggregation. The bounds can be calculated either before optimization of the aggregated problem (a priori) or after (a posteriori). Both types of the bounds are derived and numerically compared. A computational experiment was designed to (a) study the correlation between the bounds and the actual error and (b) quantify the difference of the error bounds from the actual error. The experiment shows a significant correlation between some a priori bounds, the a posteriori bounds and the actual error. These preliminary results indicate that calculating the a priori error bound is a useful strategy to select the appropriate aggregation level, since the a priori bound varies in the same way that the actual error does. After the aggregated problem has been selected and optimized, the a posteriori bound provides a good quantitative measure for the error due to aggregation.

Aggregation-based decomposition for multi-divisional models

The aggregation theory of mathematical programming is used to study decentralization in convex programming models. A two-level organization is considered and a aggregation-disaggregation scheme is applied to such a divisionally organized enterprise. In contrast to the known aggregation techniques, where the decision variables/production planes are aggregated, it is proposed to aggregate resources allocated by the central planning department among the divisions. This approach results in a decomposition procedure, in which the central unit has no optimization problem to solve and should only average local information provided by the divisions.

Studying properties of Lagrangian bounds for many-to-many assignment problems

Classical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are studied. For the class of many-to-many assignment problems, this property of constraints is used to design a subgradient algorithm for solving the modified dual problem. Numerical results are presented to compare the quality of classical and modified bounds, as well as the properties of the corresponding Lagrangian solutions.

Force patterns of hypoxic myocardium applied to oxygenated muscle preparations: Comparison with effects of regional ischemia on the contraction of non-ischemic myocardium

Objective: To examine the basis for local wall motion abnormalities commonly seen in patients with ischemic heart disease, computer-controlled isolated muscle studies were carried out. Methods: Force patterns of physiologically sequenced contractions (PSCs) from rat left ventricular muscle preparations under well-oxygenated conditions and during periods of hypoxia and reoxygenation were recorded and stored in a computer. Force patterns of hypoxic-reoxygenating and oxygenated myocardium were applied to oxygenated and hypoxic-reoxygenating myocardium, respectively. Results: Observed patterns of shortening and lengthening closely resemble those obtained from ischemic and non-ischemic myocardial segments using ultrasonic crystals in intact dog hearts during coronary occlusion and reperfusion, and are similar to findings reported in angiographic studies of humans with coronary artery disease. Conclusion: The current study, demonstrating motions of oxygenated isolated muscle preparations which are similar to those in perfused segments of intact hearts with regional ischemia, supports the concept that the multiple motions of both ischemic and non-ischemic segments seen in regional myocardial disease can be explained by interactions of strongly and weakly contracting muscle during the physiologic cardiac cycle.

Minimal cross-subsidies approach for loss allocation in distribution networks with open access

Open access philosophy applied by regulatory agencies may lead to a scenario where captive consumers will solely face the responsibility on distribution network's losses even with Independent Energy Producers (also known as Distributed Generation) and Independent Energy Consumers connected to the system. This work proposes the utilization of a loss allocation method in distribution systems where open access is allowed, in which cross-subsidies, that appear due to the influence the generators have over the system losses, are minimized. Thus, guaranteeing to some extent the efficiency and transparency of the economic signals of the market. Results obtained through the Zbus loss allocation method adapted for distribution networks are processed in such a way that the corresponding allocation to the generation buses is divided among the consumer buses, while still considering consumers spatial characteristics. © 2007 IEEE.