112 resultados para Variance Bound
Resumo:
A branch and bound (B& B) algorithm using the DC model, to solve the power system transmission expansion planning by incorporating the electrical losses in network modelling problem is presented. This is a mixed integer nonlinear programming (MINLP) problem, and in this approach, the so-called fathoming tests in the B&B algorithm were redefined and a nonlinear programming (NLP) problem is solved in each node of the B& B tree, using an interior-point method. Pseudocosts were used to manage the development of the B&B tree and to decrease its size and the processing time. There is no guarantee of convergence towards global optimisation for the MINLP problem. However, preliminary tests show that the algorithm easily converges towards the best-known solutions or to the optimal solutions for all the tested systems neglecting the electrical losses. When the electrical losses are taken into account, the solution obtained using the Garver system is better than the best one known in the literature.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
The evaluation of the growth of incisor teeth of rats as influenced by colchicine (doses of 25, 50, 100 and 200 μg/kg) injected during 10 and 18 days is performed using a multivariated variance analysis, which allowed a global view of the results, showing that: there are differences in the growth of teeth of control group (untreated rats) and those treated with colchicine, in the measurements made at the 4th, 7th and 10th days of experiment); there is no difference in the growth of the teeth between the groups treated during 10 and 18 days, except in the measurements made at the 7th day; there is no influence of the doses of colchicine in the group treated during 10 days and in the group treated during 18 days - only at the 7th day is observed an influence of the doses used; and there was no significant interaction between treatment and days of measurement, showing the similarity of the groups during the experiment.
Resumo:
The exact formula for the variance of the Index (R) of aggregation of Clark and Evans is derived. Due to the fact that R is a dimensionless number, its variance is independent of population density, being only a function of the sample size and so can be manipulated. © 1985 Springer-Verlag.
Resumo:
We construct the S-matrix for bound state (gauge-invariant) scattering for nonlinear sigma models defined on the manifold SU(n) S(U(p)⊗U(n-p)) with fermions. It is not possible to compute gauge non-singlet matrix elements. In the present language, constraints from higher conservation laws determine the bound state solution. An alternative derivation is also presented. © 1988.
Resumo:
Soluble and bound peroxidases were isolated from the pulp of ripening papaya fruit. During papaya ripening, soluble and bound peroxidase activities increased 2.5- and 4.2-fold, respectively. Soluble peroxidase was purified 59-fold by ammonium sulphate precipitation and chromatography on Sephadex G-25, DEAE-cellulose and Sephadex G-100. Bound peroxidase was purified 140-fold by ammonium sulphate precipitation and chromatography on Sephadex G-100 and DEAE-cellulose. Polyacrylamide gel electrophoresis of the purified preparations revealed that both enzymes were highly purified by the procedures adopted. The soluble and bound forms had a Mr of 41 000 and 54 000, respectively. Soluble and bound peroxidases showed optimum activity at pH 6.0 and 5.5, respectively, and were inhibited by p-chloromercuribenzoate, iodoacetamide, N-ethylmaleimide, potassium cyanide and Fe2+. Soluble peroxidase was activated by ammonium sulphate and this activation was prevented by cyanide. © 1990.
Resumo:
The formation of bound excitons (BE) is investigated for a GaAs/GaAlAs multiple quantum well (QW) system. The photoluminescence (PL) spectra are analysed as a function of the excitation energy. It was found that the carriers photogeneration, either in the barrier or directly in the well, do not play an important role on the BE formation. We conclude that defects localized at interfaces are ionized by of capture charges which in turn bound the free exciton (FE).
Resumo:
It is shown that the appearance of a fixed-point singularity in the kernel of the two-electron Cooper problem is responsible for the formation of the Cooper pair for an arbitrarily weak attractive interaction between two electrons. This singularity is absent in the problem of three and few superconducting electrons at zero temperature on the full Fermi sea. Consequently, such three- and few-electron systems on the full Fermi sea do not form Cooper-type bound states for an arbitrarily weak attractive pair interaction.
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
For the electric polarizability of a bound system in relativistic quantum theory, there are two definitions that have appeared in the literature. They differ depending on whether or not the vacuum background is included in the system. A recent confusion in this connection is clarified. © 1999 American Associations of Physics Teachers.
Resumo:
The lower bound masses of the ground-state relativistic three-boson system in 1 + 1, 2 + 1 and 3 + 1 spacetime dimensions are obtained. We have considered a reduction of the ladder Bethe-Salpeter equation to the lightfront in a model with renormalized two-body contact interaction. The lower bounds are deduced with the constraint of reality of the two-boson subsystem mass. It is verified that, in some cases, the lower bound approaches the ground-state binding energy. The corresponding non-relativistic limits are also verified.
Resumo:
This paper presents the Benders decomposition technique and Branch and Bound algorithm used in the reactive power planning in electric energy systems. The Benders decomposition separates the planning problem into two subproblems: an investment subproblem (master) and the operation subproblem (slave), which are solved alternately. The operation subproblem is solved using a successive linear programming (SLP) algorithm while the investment subproblem, which is an integer linear programming (ILP) problem with discrete variables, is resolved using a Branch and Bound algorithm especially developed to resolve this type of problem.
Resumo:
Variational inequalities and related problems may be solved via smooth bound constrained optimization. A comprehensive discussion of the important features involved with this strategy is presented. Complementarity problems and mathematical programming problems with equilibrium constraints are included in this report. Numerical experiments are commented. Conclusions and directions of future research are indicated.