94 resultados para GIANT BRANCH STARS
Resumo:
The conventional Newton's method is considered to be inadequate for the computation of the maximum loading point (MLP) of power systems since: (i) it encounters difficulties in the vicinity of the MLP: and (ii) the load flow Jacobian matrix becomes singular at the MLP. It is well known that continuation methods are powerful and useful tools that are able to trace the solution PV curve without experiencing such diffculties. However, continuation methods require a parameterisation so that a modified, well conditioned set of load flow equations is obtained. In particular, the Jacobian matrix associated with this modified set of equations should not be singular at the MLP. The authors propose that the actual power losses in transmission branches (lines and transformers) are used to parameterise the approach. Specific procedures for the automatic determination of the most appropriate parameter (branch) are proposed. Such procedures include the utilisation of fast voltage-stability indices. Simulation results are presented to show that the proposed method is able to trace the whole solution PV curve very efficiently.
Resumo:
A constructive heuristic algorithm to solve the transmission system expansion planning problem is proposed with the aim of circumventing some critical problems of classical heuristic algorithms that employ relaxed mathematical models to calculate a sensitivity index that guides the circuit additions. The proposed heuristic algorithm is in a branch-and-bound algorithm structure, which can be used with any planning model, such as Transportation model, DC model, AC model or Hybrid models. Tests of the proposed algorithm are presented on real Brazilian systems.
Resumo:
The photospheres of stars hosting planets have larger metallicity than stars lacking planets. This could be the result of a metallic star contamination produced by the bombarding of hydrogen-deficient solid bodies. In the present work we study the possibility of an earlier metal enrichment of the photospheres by means of impacting planetesimals during the first 20-30 Myr. Here we explore this contamination process by simulating the interactions of an inward migrating planet with a disc of planetesimal interior to its orbit. The results show the percentage of planetesimals that fall on the star. We identified the dependence of the planet's eccentricity (e(p)) and time-scale of migration (tau) on the rate of infalling planetesimals. For very fast migrations (tau= 10(2) and 10(3) yr) there is no capture in mean motion resonances, independently of the value of e(p). Then, due to the planet's migration the planetesimals suffer close approaches with the planet and more than 80 per cent of them are ejected from the system. For slow migrations (tau= 10(5)and 10(6) yr) the percentage of collisions with the planet decreases with the increase of the planet's eccentricity. For e(p) = 0 and 0.1 most of the planetesimals were captured in the 2:1 resonance and more than 65 per cent of them collided with the star. Whereas migration of a Jupiter mass planet to very short pericentric distances requires unrealistic high disc masses, these requirements are much smaller for smaller migrating planets. Our simulations for a slowly migrating 0.1 M-Jupiter planet, even demanding a possible primitive disc three times more massive than a primitive solar nebula, produces maximum [Fe/H] enrichments of the order of 0.18 dex. These calculations open possibilities to explain hot Jupiter exoplanet metallicities.
Resumo:
A method for optimal transmission network expansion planning is presented. The transmission network is modelled as a transportation network. The problem is solved using hierarchical Benders decomposition in which the problem is decomposed into master and slave subproblems. The master subproblem models the investment decisions and is solved using a branch-and-bound algorithm. The slave subproblem models the network operation and is solved using a specialised linear program. Several alternative implementations of the branch-and-bound algorithm have been rested. Special characteristics of the transmission expansion problem have been taken into consideration in these implementations. The methods have been tested on various test systems available in the literature.
Resumo:
An algorithm is presented that finds the optimal plan long-term transmission for till cases studied, including relatively large and complex networks. The knowledge of optimal plans is becoming more important in the emerging competitive environment, to which the correct economic signals have to be sent to all participants. The paper presents a new specialised branch-and-bound algorithm for transmission network expansion planning. Optimality is obtained at a cost, however: that is the use of a transportation model for representing the transmission network, in this model only the Kirchhoff current law is taken into account (the second law being relaxed). The expansion problem then becomes an integer linear program (ILP) which is solved by the proposed branch-and-bound method without any further approximations. To control combinatorial explosion the branch- and bound algorithm is specialised using specific knowledge about the problem for both the selection of candidate problems and the selection of the next variable to be used for branching. Special constraints are also used to reduce the gap between the optimal integer solution (ILP program) and the solution obtained by relaxing the integrality constraints (LP program). Tests have been performed with small, medium and large networks available in the literature.
Resumo:
A giant anteater (Myrmecophaga tridactyla) was found with closed comminuted fractures on the fight radius and ulna and left humerus he duration of which was unknown. The animal was unable to use either of he thoracic limbs. The fractures were stabilized with 3.5-mm titanium plates and a commercially available mixture of micro lyophilized bovine cortical osseous and bovine BMP (Gen-tech(R), Baumer, Brazil) was implanted into the fractures sites. Postoperative radiographic evaluations were performed every 30 days and after four months. Bone healing was observed in all of he fractures. The animal was able to be reintroduced into its natural habitat. From his case we conclude that despite he low metabolic fate of the giant anteater, which is an inherent characteristic of this species, he treatment of radius, ulna and humerus fractures by means of plates and screws, associated with BMP on the Myrmecophaga tridactyla, was a success.
Resumo:
Multinucleated giant cells (MGC) are characteristic cells in granulomatous disorders such as paracoccidioidomycosis (PCM) and also are formed in vitro from peripheral blood mononuclear cells by several stimuli. In this study, the authors investigated in vitro formation of MGC derived from monocytes of healthy individuals, stimulated with Paracoccidioides brasiliensis antigen (PbAg), compared with other stimuli such as IFN-gamma and supernatant of Con-A-stimulated peripheral blood mononuclear cells (CM-ConA). Besides, the fungicidal activity of monocytes and monocyte-derived MGC challenged with P. brasiliensis were compared, at a ratio of one fungus per 50 monocytes. Results demonstrated that PbAg, IFN-gamma, and CM-ConA stimuli were able to induce MGC generation, with fusion indices significantly higher than control cultures. Striking results were observed when MGC induced by PbAg and IFN-gamma presented higher fungicidal activity than monocytes, submitted to the same stimuli, showing a better capacity of these cells to kill P. brasiliensis. In summary, the results suggest that PbAg is able to induce MGC generation, and these cells presented higher fungicidal activity against P. brasiliensis than monocytes.
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:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Recent experimental data on first-forbidden charge-exchange resonances are discussed in the framework of a schematic model. We also evaluate the screening of the weak coupling constants induced by both the giant resonances and the Δ-isobar. It is shown that the last effect does not depend on the multipolarity of the one-particle moment. Due to the same reason, the fraction of the reaction strength pushed up into the Δ-resonance region is always the same regardless of the quantum numbers carried by the excitation. Simple expressions are derived for the dependence of the excitation energies of the first-forbidden giant resonances on the mass number and isospin of the target. The model reproduces consistently both the Gamow-Teller and the first-forbidden resonances. © 1983.