912 resultados para Routing schemes
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:
Vehicular networks ensure that the information received from any vehicle is promptly and correctly propagated to nearby vehicles, to prevent accidents. A crucial point is how to trust the information transmitted, when the neighboring vehicles are rapidly changing and moving in and out of range. Current trust management schemes for vehicular networks establish trust by voting on the decision received by several nodes, which might not be required for practical scenarios. It might just be enough to check the validity of incoming information. Due to the ephemeral nature of vehicular networks, reputation schemes for mobile ad hoc networks (MANETs) cannot be applied to vehicular ad hoc networks (VANET). We point out several limitations of trust management schemes for VANET. In particular, we identify the problem of information cascading and oversampling, which commonly arise in social networks. Oversampling is a situation in which a node observing two or more nodes, takes into consideration both their opinions equally without knowing that they might have influenced each other in decision making. We show that simple voting for decision making, leads to oversampling and gives incorrect results. We propose an algorithm to overcome this problem in VANET. This is the first paper which discusses the concept of cascading effect and oversampling effects to ad hoc networks. © 2011 IEEE.
Alternate treatments of jacobian singularities in polar coordinates within finite-difference schemes
Resumo:
Jacobian singularities of differential operators in curvilinear coordinates occur when the Jacobian determinant of the curvilinear-to-Cartesian mapping vanishes, thus leading to unbounded coefficients in partial differential equations. Within a finite-difference scheme, we treat the singularity at the pole of polar coordinates by setting up complementary equations. Such equations are obtained by either integral or smoothness conditions. They are assessed by application to analytically solvable steady-state heat-conduction problems.
Resumo:
Incluye Bibliografía
Resumo:
Includes bibliography
Resumo:
Includes bibliography
Resumo:
Two systems of bus driver compensation exist in Santiago, Chile. The majority of drivers are paid per passenger transported, which leads to drivers trying to maximize the number of passengers each one conveys. Some of these effects are beneficial, such as a more active effort to minimize the problem of bus bunching, while others, such as aggressive driving, can be harmful. Drivers are said to "race" and the term "War for the Fare" is commonly used. Drivers also pay freelance workers called "sapos" to provide spacing information. Similar phenomena occur in other Latin American capitals.The other system, a fixed wage, is used by 2 companies holding recently awarded concessions for routes feeding metro stations.This paper discusses, quantitatively and qualitatively, the effects of these two compensation systems on accidents, quality of service, attitudes of both users and drivers, and average waiting times for passengers.
Resumo:
The present study aimed to notify the history of albendazole sulphoxide (ALB-SO) and albendazole (ALBZ) efficacy against Taenia saginata cysticercus (Cysticercus bovis) parasitizing experimentally infected bovines. A total of 11 efficacy trials were performed between the years of 2002 and 2010. In order to perform these trials, animals were individually inoculated with 2 x 104 eggs of T. saginata in each study's day zero (DO). For every trial, a positive control group (untreated infected animals) and a negative control group (animals that were neither infected nor treated) were used. ALB-SO or ALB were administered in the different dosages, in different days of treatments. In a last study with this formulation, this active principle was administered orally, mixed with the mineral supplement, on the 60th DPI, in a dosage of 30 mg/kg. In all trials, on the 100th DPI, all animals were euthanized and submitted to the sequenced slicing of 26 anatomical segments (fragments of approximately five millimeters) for the survey of T. saginata cysticercus. With the obtained results it is possible to verify that in the first trials, conducted in 2002, ALB-SO reached, independently of dosage and treatment scheme, efficacies superior to 98% (arithmetic means). The trials conducted in 2005 (2.5 mg/kg on the 30th, 60th, and 90th DPI) obtained values of efficacy all inferior to 60%. In 2008, the trials with 2.5 and 7.7 mg/kg demonstrated efficacy values inferior to 40%, for both dosages and treatment schemes (30th/60th/90th DPI and 60th DPI). When this formulation was administered orally on the dosage of 30 mg/kg on the 60th DPI, the efficacy against T. saginata cysticercus reached 88.28%. ALB administered orally showed efficacy values of 0.0%, 29.88% and 28.64% in the dosages of 5, 10 and 15 mg/kg, respectively, using the treatment schemes described above for each dosage. Based on the results of these trials, conducted in an eight year period (2002-2010) using the sequenced slicing method for evaluating the efficacy of the aforementioned formulations against T. saginata cysticercus, it is possible to observe that, amongst the few molecules used in the chemotherapic treatment against T. saginata larvae, ALB-SO, administered in varied routes, dosages and treatment schemes, the studies conducted in 2008, 2009, and 2010, have a low therapeutic efficacy against C bovis in Brazil, while ALBZ had insignificant efficacy values against T. saginata larvae parasitizing experimentally infected bovines. However, future studies using molecular biology will be necessary to assess whether the difference on the efficacy of the ALB-SO can be related to strain or another specific factor. (C) 2013 Elsevier Inc. All rights reserved.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Effects of Haematobia irritans infestation on weight gain of 18 to 20 months old non-castrated Nelore calves, were investigated, under field conditions, using different antiparasitic treatments. Sixty animals were divided in three groups, with 20 bovines each: T01 (untreated control); T02 (treated with Cypermethrin 15 g + Chlorpyriphos 25 g + Citronellal 1 g, as a whole body spray, on days 0,30, 60, 90 and 120 post-treatment); and T03 (treated on day zero with an ear tag impregnated with Diazinon 6 g on the left ear). Counts of H. irritans were conducted on day 30, 60, 90, 120 and 150 post-treatment (DPT). On the same experimental dates, animals were individually weighed, seeking to evaluate the effects of parasitism on the development of animals in each group. From this study it is concluded that T03 had significantly higher efficacy (>90%, till 90 DPT), based on H. irritans fly counts, compared to T02 which showed little or no effect. At the specific conditions of the present study, an average of approximately 90 flies (mean difference of flycounts between groups T01 and T03) was associated with a difference of 20 kg/animal in 150 days. (C) 2014 Elsevier B.V. All rights reserved.
Resumo:
A variational analysis of the spiked harmonic oscillator Hamiltonian operator - d2/dx2 + x2 + l(l + 1)/x2 + λ|x| -α, where α is a real positive parameter, is reported in this work. The formalism makes use of the functional space spanned by the solutions of the Schrödinger equation for the linear harmonic oscillator Hamiltonian supplemented by a Dirichlet boundary condition, and a standard procedure for diagonalizing symmetric matrices. The eigenvalues obtained by increasing the dimension of the basis set provide accurate approximations for the ground state energy of the model system, valid for positive and relatively large values of the coupling parameter λ. Additionally, a large coupling perturbative expansion is carried out and the contributions up to fourth-order to the ground state energy are explicitly evaluated. Numerical results are compared for the special case α = 5/2. © 1989 American Institute of Physics.
Resumo:
Survivable traffic grooming (STG) is a promising approach to provide reliable and resource-efficient multigranularity connection services in wavelength-division-multiplexing (WDM) optical networks. In this paper, we study the STG problem in WDM mesh optical networks employing path protection at the connection level. Both dedicated-protection and shared-protection schemes are considered. Given network resources, the objective of the STG problem is to maximize network throughput. To enable survivability under various kinds of single failures, such as fiber cut and duct cut, we consider the general shared-risklink- group (SRLG) diverse routing constraints. We first resort to the integer-linear-programming (ILP) approach to obtain optimal solutions. To address its high computational complexity, we then propose three efficient heuristics, namely separated survivable grooming algorithm (SSGA), integrated survivable grooming algorithm (ISGA), and tabu-search survivable grooming algorithm (TSGA). While SSGA and ISGA correspond to an overlay network model and a peer network model, respectively, TSGA further improves the grooming results from SSGA and ISGA by incorporating the effective tabu-search (TS) method. Numerical results show that the heuristics achieve comparable solutions to the ILP approach, which uses significantly longer running times than the heuristics.
Resumo:
Routing and wavelength assignment (RWA) is an important problem that arises in wavelength division multiplexed (WDM) optical networks. Previous studies have solved many variations of this problem under the assumption of perfect conditions regarding the power of a signal. In this paper, we investigate this problem while allowing for degradation of routed signals by components such as taps, multiplexers, and fiber links. We assume that optical amplifiers are preplaced. We investigate the problem of routing the maximum number of connections while maintaining proper power levels. The problem is formulated as a mixed-integer nonlinear program and two-phase hybrid solution approaches employing two different heuristics are developed