898 resultados para cooperative routing
Resumo:
Germanate glasses are of interest for optoelectronic applications because they combine high mechanical strength, high chemical durability and temperature stability with a large transmission window (400 to 4500 nm) and high refractive index (2.0). GeO2-PbO-Bi2O3 glasses doped with Y-b(3+) were fabricated by melting powders in a crucible and then pouring them in a brass mold. Energy Dispersive Spectroscopy showed that the glass composition has a high spatial uniformity and that the Yb concentration in the solid sample is proportional to the Yb concentration in the melt, what was confirmed by absorption measurements. Intense blue emission at 507 nm was observed, corresponding to half of the wavelength of the near infrared region (NIR) emission; besides, a decay lifetime of 0.25 ms was measured and this corresponds to half of the decay lifetime in the infrared region; these are very strong indications of the presence of blue cooperative luminescence. Larger targets have been produced to be sputtered, resulting in thin films for three dimensional (3D) display and waveguide applications. (c) 2006 Elsevier B.V. All rights reserved.
Resumo:
This paper presents an analysis and discussion, based on cooperative game theory, for the allocation of the cost of losses to generators and demands in transmission systems. We construct a cooperative game theory model in which the players are represented by equivalent bilateral exchanges and we search for a unique loss allocation solution, the Core. Other solution concepts, such as the Shapley Value, the Bilateral Shapley Value and the Kernel are also explored. Our main objective is to illustrate why is not possible to find an optimal solution for allocating the cost of losses to the users of a network. Results and relevant conclusions are presented for a 4-bus system and a 14-bus system. (c) 2007 Elsevier B.V. All rights reserved.
Resumo:
We report the observation of cooperative frequency upconversion in a fluoroindate glass. The experiments were performed by exciting Yb3+-Tb3+ codoped samples with an infrared diode laser. The process is monitored through the green fluorescence emitted by Tb3+ ions due to a cooperative energy transfer from a pair of excited Yb3+ ions. © 1998 Elsevier Science B.V. All rights reserved.
Resumo:
Phonon-assisted cooperative energy transfer and frequency upconversion (UC) in Yb3+/Tb3+ codoped fluoroindate glass were investigated. Anti-Stokes quasiresonant excitation of Yb3+ ions was used to study the influence of multiphonon transitions in the UC process. A rate equation model was used to describe the temperature dependence of the UC emission intensities and the theoretical results are in good agreement with the experimental data.
Resumo:
The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required edges under vehicle capacity constraints. There are numerous applications for the CARP, such as street sweeping, garbage collection, mail delivery, school bus routing, and meter reading. A Greedy Randomized Adaptive Search Procedure (GRASP) with Path-Relinking (PR) is proposed and compared with other successful CARP metaheuristics. Some features of this GRASP with PR are (i) reactive parameter tuning, where the parameter value is stochastically selected biased in favor of those values which historically produced the best solutions in average; (ii) a statistical filter, which discard initial solutions if they are unlikely to improve the incumbent best solution; (iii) infeasible local search, where high-quality solutions, though infeasible, are used to explore the feasible/infeasible boundaries of the solution space; (iv) evolutionary PR, a recent trend where the pool of elite solutions is progressively improved by successive relinking of pairs of elite solutions. Computational tests were conducted using a set of 81 instances, and results reveal that the GRASP is very competitive, achieving the best overall deviation from lower bounds and the highest number of best solutions found. © 2011 Elsevier Ltd. All rights reserved.
Resumo:
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.
Resumo:
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.
Resumo:
The transcription process is crucial to life and the enzyme RNA polymerase (RNAP) is the major component of the transcription machinery. The development of single-molecule techniques, such as magnetic and optical tweezers, atomic-force microscopy and single-molecule fluorescence, increased our understanding of the transcription process and complements traditional biochemical studies. Based on these studies, theoretical models have been proposed to explain and predict the kinetics of the RNAP during the polymerization, highlighting the results achieved by models based on the thermodynamic stability of the transcription elongation complex. However, experiments showed that if more than one RNAP initiates from the same promoter, the transcription behavior slightly changes and new phenomenona are observed. We proposed and implemented a theoretical model that considers collisions between RNAPs and predicts their cooperative behavior during multi-round transcription generalizing the Bai et al. stochastic sequence-dependent model. In our approach, collisions between elongating enzymes modify their transcription rate values. We performed the simulations in Mathematica® and compared the results of the single and the multiple-molecule transcription with experimental results and other theoretical models. Our multi-round approach can recover several expected behaviors, showing that the transcription process for the studied sequences can be accelerated up to 48% when collisions are allowed: the dwell times on pause sites are reduced as well as the distance that the RNAPs backtracked from backtracking sites. © 2013 Costa et al.
Resumo:
Based on the literature data from HT-29 cell monolayers, we develop a model for its growth, analogous to an epidemic model, mixing local and global interactions. First, we propose and solve a deterministic equation for the progress of these colonies. Thus, we add a stochastic (local) interaction and simulate the evolution of an Eden-like aggregate by using dynamical Monte Carlo methods. The growth curves of both deterministic and stochastic models are in excellent agreement with the experimental observations. The waiting times distributions, generated via our stochastic model, allowed us to analyze the role of mesoscopic events. We obtain log-normal distributions in the initial stages of the growth and Gaussians at long times. We interpret these outcomes in the light of cellular division events: in the early stages, the phenomena are dependent each other in a multiplicative geometric-based process, and they are independent at long times. We conclude that the main ingredients for a good minimalist model of tumor growth, at mesoscopic level, are intrinsic cooperative mechanisms and competitive search for space. © 2013 Elsevier Ltd.
Resumo:
Includes bibliography
Resumo:
Presenta una propuesta para establecer una red de investigación agrícola cooperativa en el Caribe para servir a los países del CDCC
Resumo:
Comenta aspectos principales sobre los cuales se centro el debate en la reunion.