68 resultados para Proximal 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:
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:
Background: Treatment of deep-vein thrombosis (DVT) with a once-daily regimen of enoxaparin, rather than a continuous infusion of unfractionated heparin (UFH) is more convenient and allows for home care in some patients. This study was designed to compare the efficacy and safety of these two regimens for the treatment of patients with proximal lower limb DVT. Methods: 201 patients with proximal lower limb DVT from 13 centers in Brazil were randomized in an open manner to receive either enoxaparin [1.5 mg/kg subcutaneous (s.c.) OD] or intravenous (i.v.) UFH (adjusted to aPTT 1.5-2.5 times control) for 5-10 days. All patients also received warfarin (INR 2-3) for at least 3 months. The primary efficacy endpoint Was recurrent DVT (confirmed by venography or ultrasonography), and safety endpoints included bleeding and serious adverse events. The rate of pulmonary embolism (PE) was also collected. Hospitalization was at the physician's discretion. Results: Baseline patient characteristics were comparable between groups. The duration of hospital stay was significantly shorter with enoxaparin than with UFH (3 versus 7 days). In addition, 36% of patients receiving enoxaparin did not need to be hospitalized, whereas all of the patients receiving UFH were! hospitalized. The treatment duration was slightly longer with enoxaparin (8 versus 7 days). There was a nonsignificant trend toward a reduction in the rate of recurrent DVT with enoxaparin versus UFH, and similar safety. Conclusions: A once-daily regimen of enoxaparin 1.5 mg/kg subcutaneous is at least as effective and safe as conventional treatment with a continuous intravenous infusion of UFH. However, the once daily enoxaparin regimen is easier to administer (subcutaneous versus intravenous), does not require aPTT monitoring, and leads to both a reduced number of hospital admissions and an average 4-day-shorter hospital stay. (C) 2004 Elsevier Ltd. All rights reserved.
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:
The influence of parietal cell vagotomy (PCV) on esophagogastric high pressure zone (HPZ) (pressure and length) was studied in 30 dogs. The animals were divided in 3 groups: group 1, 10 dogs submitted to PCV with gastric denervation until the esophagogastric junction; group 2, 10 dogs submitted to PCV with gastric denervation into esophagogastric junction and 3 cm above this; group 3 (control), 10 dogs submitted to laparotomy only. In the postoperative period (immediate and later) it wasn't observed any alteration of pressure and length of esophagogastric HPZ in three studied groups.
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:
Objective: This study evaluated the effectiveness of proximal contacts in Class II restorations using two types of matrix bands (steel and polyester) with two different restoration techniques (incremental and with prepolymerized particles). Method and materials: Eighty-eight Class II adjacent restorations using Prodigy resin composite were performed: 44 with the incremental technique (22 with steel matrix bands, 22 with polyester matrix bands) and 44 utilizing prepolymerized resin particles (22 steel matrix, 22 polyester matrix). The restorations were clinically evaluated at baseline and at 6, 12, and 18 months. Proximal contacts obtained immediately after restoration procedure in all restorations were satisfactory. Results: No statistically significant alterations were found in 18 months of evaluation. Conclusion: Regardless of the utilized resin composite, there were no differences in the amount of proximal contact variations with respect to tested techniques and matrices.