48 resultados para Inversion algorithms
Resumo:
The recipe used to compute the symmetric energy-momentum tensor in the framework of ordinary field theory bears little resemblance to that used in the context of general relativity, if any. We show that if one stal ts fi om the field equations instead of the Lagrangian density, one obtains a unified algorithm for computing the symmetric energy-momentum tensor in the sense that it can be used for both usual field theory and general relativity.
Resumo:
Drosophila sturtevanti (37 strains) showed eighteen inversions, five new and thirteen previously described. Among these strains, 24 were maintained for seven to 21 years under laboratory conditions, eight for less than 1 year, and six were natural samples analysed in the first generation after collection. Flies from natural samples were the most polymorphic in the number of different inversions as well as in the frequency of flies bearing heterozygous inversions. In all cases, chromosome III presented the greatest number of inversions, and most of them occurred in strains from the Amazonian region. The data obtained were consistent with the hypothesis that the inversion variability of a species is proportional to the variability of its habitats.
Resumo:
The usefulness of the application of heuristic algorithms in the transportation model, first proposed by Garver, is analysed in relation to planning for the expansion of transmission systems. The formulation of the mathematical model and the solution techniques proposed in the specialised literature are analysed in detail. Starting with the constructive heuristic algorithm proposed by Garver, an extension is made to the problem of multistage planning for transmission systems. The quality of the solutions found by heuristic algorithms for the transportation model is analysed, as are applications in problems of planning transmission systems.
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:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
This paper analyses the impact of choosing good initial populations for genetic algorithms regarding convergence speed and final solution quality. Test problems were taken from complex electricity distribution network expansion planning. Constructive heuristic algorithms were used to generate good initial populations, particularly those used in resolving transmission network expansion planning. The results were compared to those found by a genetic algorithm with random initial populations. The results showed that an efficiently generated initial population led to better solutions being found in less time when applied to low complexity electricity distribution networks and better quality solutions for highly complex networks when compared to a genetic algorithm using random initial populations.
Resumo:
Cytogenetic studies conduced on a sample of 19 specimens of rainbow trout (Oncorhyncus mykiss) showed that 6 presented two chromosomes with a single subterminal AgNOR on the short arms and 13 presented one chromosome with a single subterminal Ag-NOR and a second chromosome with two small subterminal Ag-NORs. Synaptonemal complex studies showed the presence of a pairing failure involving the two lateral elements (LEs) of the NOR-bearing chromosomes only in those specimens with two different NOR-bearing chromosomes, suggesting that the chromosomes with two Ag-NORs originated from a paracentric inversion involving a terminal segment of the original NOR-bearing chromosome. A comparative analysis between three normal and three heterozygous fishes suggest that in the latter group the LEs of the NOR-bearing chromosomes initiate the synaptic process in a more delayed manner, the synapsis develops more quickly, and the nucleolus stays associated with chromosomes for a longer time.
Resumo:
Piecewise-Linear Programming (PLP) is an important area of Mathematical Programming and concerns the minimisation of a convex separable piecewise-linear objective function, subject to linear constraints. In this paper a subarea of PLP called Network Piecewise-Linear Programming (NPLP) is explored. The paper presents four specialised algorithms for NPLP: (Strongly Feasible) Primal Simplex, Dual Method, Out-of-Kilter and (Strongly Polynomial) Cost-Scaling and their relative efficiency is studied. A statistically designed experiment is used to perform a computational comparison of the algorithms. The response variable observed in the experiment is the CPU time to solve randomly generated network piecewise-linear problems classified according to problem class (Transportation, Transshipment and Circulation), problem size, extent of capacitation, and number of breakpoints per arc. Results and conclusions on performance of the algorithms are reported.
Resumo:
This paper describes two solutions for systematic measurement of surface elevation that can be used for both profile and surface reconstructions for quantitative fractography case studies. The first one is developed under Khoros graphical interface environment. It consists of an adaption of the almost classical area matching algorithm, that is based on cross-correlation operations, to the well-known method of parallax measurements from stereo pairs. A normalization function was created to avoid false cross-correlation peaks, driving to the true window best matching solution at each region analyzed on both stereo projections. Some limitations to the use of scanning electron microscopy and the types of surface patterns are also discussed. The second algorithm is based on a spatial correlation function. This solution is implemented under the NIH Image macro programming, combining a good representation for low contrast regions and many improvements on overall user interface and performance. Its advantages and limitations are also presented.
Resumo:
Three-phase three-wire power flow algorithms, as any tool for power systems analysis, require reliable impedances and models in order to obtain accurate results. Kron's reduction procedure, which embeds neutral wire influence into phase wires, has shown good results when three-phase three-wire power flow algorithms based on current summation method were used. However, Kron's reduction can harm reliabilities of some algorithms whose iterative processes need loss calculation (power summation method). In this work, three three-phase three-wire power flow algorithms based on power summation method, will be compared with a three-phase four-wire approach based on backward-forward technique and current summation. Two four-wire unbalanced medium-voltage distribution networks will be analyzed and results will be presented and discussed. © 2004 IEEE.
Resumo:
An analysis of the performances of three important methods for generators and loads loss allocation is presented. The discussed methods are: based on pro-rata technique; based on the incremental technique; and based on matrices of circuit. The algorithms are tested considering different generation conditions, using a known electric power system: IEEE 14 bus. Presented and discussed results verify: the location and the magnitude of generators and loads; the possibility to have agents well or poorly located in each network configuration; the discriminatory behavior considering variations in the power flow in the transmission lines. © 2004 IEEE.
Resumo:
In this work, the planning of secondary distribution circuits is approached as a mixed integer nonlinear programming problem (MINLP). In order to solve this problem, a dedicated evolutionary algorithm (EA) is proposed. This algorithm uses a codification scheme, genetic operators, and control parameters, projected and managed to consider the specific characteristics of the secondary network planning. The codification scheme maps the possible solutions that satisfy the requirements in order to obtain an effective and low-cost projected system-the conductors' adequate dimensioning, load balancing among phases, and the transformer placed at the center of the secondary system loads. An effective algorithm for three-phase power flow is used as an auxiliary methodology of the EA for the calculation of the fitness function proposed for solutions of each topology. Results for two secondary distribution circuits are presented, whereas one presents radial topology and the other a weakly meshed topology. © 2005 IEEE.
Resumo:
The population inversion of the Tm3+ in GLKZ glass involved in the 1470 nm emission (3H4 → 3F 4) as a function of Tb (or Eu) concentration was calculated by computational simulation for a CW laser pumping at 792 nm. These calculations were performed using the experimental Tm→Tb an Tm→Eu transfer rates and the spectroscopic parameters of the Tm (0.1 mol %) system. The result shows that 0.2 mol % (Tb3+) and 0.4 mol % of Eu3+ ions propitiate best population inversion of Tm3+ (0.1 mol %) maximizing the amplification coefficient of germanate (GLKZ) glass when operating as laser intensity amplification at 1470 nm. Besides the effective deactivation of the 3F4 level, the presence of Tb3+ or Eu 3+ ions introduce a depopulation of the 3H4 emitting level by means of a cross relaxation process with Tm3+ ions. In spite of this, the whole effect is verified to be benefic for using Tm-doped GLKZ glass codoped with Tb3+ or Eu3+ as a suitable material for confectioning optical amplifiers that operates in the S-band for telecommunication.
Resumo:
Until mid 2006, SCIAMACHY data processors for the operational retrieval of nitrogen dioxide (NO2) column data were based on the historical version 2 of the GOME Data Processor (GDP). On top of known problems inherent to GDP 2, ground-based validations of SCIAMACHY NO2 data revealed issues specific to SCIAMACHY, like a large cloud-dependent offset occurring at Northern latitudes. In 2006, the GDOAS prototype algorithm of the improved GDP version 4 was transferred to the off-line SCIAMACHY Ground Processor (SGP) version 3.0. In parallel, the calibration of SCIAMACHY radiometric data was upgraded. Before operational switch-on of SGP 3.0 and public release of upgraded SCIAMACHY NO2 data, we have investigated the accuracy of the algorithm transfer: (a) by checking the consistency of SGP 3.0 with prototype algorithms; and (b) by comparing SGP 3.0 NO2 data with ground-based observations reported by the WMO/GAW NDACC network of UV-visible DOAS/SAOZ spectrometers. This delta-validation study concludes that SGP 3.0 is a significant improvement with respect to the previous processor IPF 5.04. For three particular SCIAMACHY states, the study reveals unexplained features in the slant columns and air mass factors, although the quantitative impact on SGP 3.0 vertical columns is not significant.