952 resultados para Derivative Expansion
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Here we study the effect of the nonminimal coupling j(mu)epsilon(munualpha)partial derivative(nu)A(alpha) on the static potential in multiflavor QED(3). Both cases of four and two components fermions are studied separately at leading order in the 1/N expansion. Although a nonlocal Chern-Simons term appears, in the four components case the photon is still massless leading to a confining logarithmic potential similar to the classical one. In the two components case, as expected, the parity breaking fermion mass term generates a traditional Chern-Simons term which makes the photon massive and we have a screening potential which vanishes at large intercharge distance. The extra nonminimal couplings have no important influence on the static potential at large intercharge distances. However, interesting effects show up at finite distances. In particular, for strong enough nonminimal coupling we may have a new massive pole in the photon propagator, while in the opposite limit there may be no poles at all in the irreducible case. We also found that, in general, the nonminimal couplings lead to a finite range repulsive force between charges of opposite signs.
Resumo:
The paper presents an extended genetic algorithm for solving the optimal transmission network expansion planning problem. Two main improvements have been introduced in the genetic algorithm: (a) initial population obtained by conventional optimisation based methods; (b) mutation approach inspired in the simulated annealing technique, the proposed method is general in the sense that it does not assume any particular property of the problem being solved, such as linearity or convexity. Excellent performance is reported in the test results section of the paper for a difficult large-scale real-life problem: a substantial reduction in investment costs has been obtained with regard to previous solutions obtained via conventional optimisation methods and simulated annealing algorithms; statistical comparison procedures have been employed in benchmarking different versions of the genetic algorithm and simulated annealing methods.
Resumo:
In this paper, an efficient genetic algorithm (GA) is presented to solve the problem of multistage and coordinated transmission expansion planning. This is a mixed integer nonlinear programming problem, difficult for systems of medium and large size and high complexity. The GA presented has a set of specialized genetic operators and an efficient form of generation of the initial population that finds high quality suboptimal topologies for large size and high complexity systems. In these systems, multistage and coordinated planning present a lower investment than static planning. Tests results are shown in one medium complexity system and one large size high complexity system.
Resumo:
A combinatorial mathematical model in tandem with a metaheuristic technique for solving transmission network expansion planning (TNEP) using an AC model associated with reactive power planning (RPP) is presented in this paper. AC-TNEP is handled through a prior DC model while additional lines as well as VAr-plants are used as reinforcements to cope with real network requirements. The solution of the reinforcement stage can be obtained by assuming all reactive demands are supplied locally to achieve a solution for AC-TNEP and by neglecting the local reactive sources, a reactive power planning (RPP) will be managed to find the minimum required reactive power sources. Binary GA as well as a real genetic algorithm (RCA) are employed as metaheuristic optimization techniques for solving this combinatorial TNEP as well as the RPP problem. High quality results related with lower investment costs through case studies on test systems show the usefulness of the proposal when working directly with the AC model in transmission network expansion planning, instead of relaxed models. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
We present a bilevel model for transmission expansion planning within a market environment, where producers and consumers trade freely electric energy through a pool. The target of the transmission planner, modeled through the upper-level problem, is to minimize network investment cost while facilitating energy trading. This upper-level problem is constrained by a collection of lower-level market clearing problems representing pool trading, and whose individual objective functions correspond to social welfare. Using the duality theory the proposed bilevel model is recast as a mixed-integer linear programming problem, which is solvable using branch-and-cut solvers. Detailed results from an illustrative example and a case study are presented and discussed. Finally, some relevant conclusions are drawn.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Blends of poly(vinylidene fluoride), PVDF, and poly(o-methoxyaniline), POMA doped with toluene sulfonic acid, TSA, were prepared by casting at various compositions and studied by scanning electron microscopy, X-ray diffraction and differential scanning calorimetry. The blend composition has a great influence on the morphology obtained. As the concentration of POMA-TSA is increased in the blend an interconnecting fibrillar-like morphology is formed and the spherulites characteristic of pure PVDF are destroyed. The variation of blend morphology is further discussed based on X-ray diffraction and differential scanning calorimetry analysis. (C) 1998 Elsevier B.V. Ltd. All rights reserved.