65 resultados para Bus terminals
Resumo:
A molecular phylogenetic analysis of the Hyla pulchella species group was performed to test its monophyly, explore the interrelationships of its species, and evaluate the validity of the taxa that were considered subspecies of H. pulchella. Approximately 2.8 kb from the mitochondrial genes 12s, tRNA valine, 16s, and Cytochrome b were sequenced. The analysis included 50 terminals representing 10 of the 14-15 species currently recognized in the H. pulchella group, including samples from several localities for some taxa, several outgroups, as well as two species previously suspected to be related with the group (Hyla guentheri and Hyla hischoffi). The results show that the H. pulchella and Hyla circumdata groups are distantly related, and, therefore, should be recognized as separate groups. As currently defined, the H. pulchella group is paraphyletic with respect to the Hyla polytaenia group; therefore, we recognize the Hyla polytaenia clade in the H. pulchella group. Two subspecies of H. pulchella recognized by some authors are considered full species including Hyla pulchella riojana because it is only distantly related to H. pulchella, and Hyla pulchella cordobae because molecular and non-molecular evidence suggests that it is specifically distinct. With the inclusion of the H. polytaenia clade, H. guentheri, and H. bischoffi, and the recognition of the two former subspecies of H. pulchella as distinct species, the H. pulchella group now comprises 25 described species. All representatives of the H. pulchella group with an Andean distribution are monophyletic and nested within a clade from the Atlantic forest from south-southeastern Brazil/northeastern Argentina, and Cerrado gallery forest from central Brazil. (C) 2004 Elsevier B.V. All rights reserved.
Resumo:
This paper presents two mathematical models and one methodology to solve a transmission network expansion planning problem considering uncertainty in demand. The first model analyzed the uncertainty in the system as a whole; then, this model considers the uncertainty in the total demand of the power system. The second one analyzed the uncertainty in each load bus individually. The methodology used to solve the problem, finds the optimal transmission network expansion plan that allows the power system to operate adequately in an environment with uncertainty. The models presented are solved using a specialized genetic algorithm. The results obtained for several known systems from literature show that cheaper plans can be found satisfying the uncertainty in demand.
Resumo:
The simulated annealing optimization technique has been successfully applied to a number of electrical engineering problems, including transmission system expansion planning. The method is general in the sense that it does not assume any particular property of the problem being solved, such as linearity or convexity. Moreover, it has the ability to provide solutions arbitrarily close to an optimum (i.e. it is asymptotically convergent) as the cooling process slows down. The drawback of the approach is the computational burden: finding optimal solutions may be extremely expensive in some cases. This paper presents a Parallel Simulated Annealing, PSA, algorithm for solving the long term transmission network expansion planning problem. A strategy that does not affect the basic convergence properties of the Sequential Simulated Annealing algorithm have been implementeded and tested. The paper investigates the conditions under which the parallel algorithm is most efficient. The parallel implementations have been tested on three example networks: a small 6-bus network, and two complex real-life networks. Excellent results are reported in the test section of the paper: in addition to reductions in computing times, the Parallel Simulated Annealing algorithm proposed in the paper has shown significant improvements in solution quality for the largest of the test networks.
Resumo:
This paper presents a new algorithm for optimal power flow problem. The algorithm is based on Newton's method which it works with an Augmented Lagrangian function associated with the original problem. The function aggregates all the equality and inequality constraints and is solved using the modified-Newton method. The test results have shown the effectiveness of the approach using the IEEE 30 and 638 bus systems.
Resumo:
The complete nucleotide sequence of the genomic RNA 1 (8745 nt) and RNA 2 (4986 nt) of Citrus leprosis virus cytoplasmic type (CiLV-C) was determined using cloned cDNA. RNA 1 contains two open reading frames (ORFs), which correspond to 286 and 29 kDa proteins. The 286 kDa protein is a polyprotein putatively involved in virus replication, which contains four conserved domains: methyltransferase, protease, helicase and polymerase. RNA 2 contains four ORFs corresponding to 15, 61, 32 and 24 kDa proteins, respectively. The 32 kDa protein is apparently involved in cell-to-cell movement of the virus, but none of the other putative proteins exhibit any conserved domain. The 5' regions of the two genomic RNAs contain a 'cap' structure and poly(A) tails were identified in the 3'-terminals. Sequence analyses and searches for structural and non-structural protein similarities revealed conserved domains with members of the genera Furovirus, Bromovirus, Tobravirus and Tobamovirus, although phylogenetic analyses strongly suggest that CiLV-C is a member of a distinct, novel virus genus and family, and definitely demonstrate that it does not belong to the family Rhabdoviridae, as previously proposed. Based on these results it was proposed that Citrus leprosis virus be considered as the type member of a new genus of viruses, Cilevirus.