Limit weierstrass points on nodal reducible curves

In the 1980s D. Eisenbud and J. Harris posed the following question: What are the limits of Weierstrass points in families of curves degenerating to stable curves not of compact type? In the present article, we give a partial answer to this question. We consider the case where the limit curve has components intersecting at points in general position and where the degeneration occurs along a general direction. For this case we compute the limits of Weierstrass points of any order. However, for the usual Weierstrass points, of order one, we need to suppose that all of the components of the limit curve intersect each other.

Branch and bound algorithm for transmission system expansion planning using a transportation model

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.

Specialised branch-and-bound algorithm for transmission network expansion planning

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.

Peculiar trajectories around the Lagrangian equilateral points

In the present work we analyse the behaviour of a particle under the gravitational influence of two massive bodies and a particular dissipative force. The circular restricted three body problem, which describes the motion of this particle, has five equilibrium points in the frame which rotates with the same angular velocity as the massive bodies: two equilateral stable points (L-4, L-5) and three colinear unstable points (L-1, L-2, L-3). A particular solution for this problem is a stable orbital libration, called a tadpole orbit, around the equilateral points. The inclusion of a particular dissipative force can alter this configuration. We investigated the orbital behaviour of a particle initially located near L4 or L5 under the perturbation of a satellite and the Poynting-Robertson drag. This is an example of breakdown of quasi-periodic motion about an elliptic point of an area-preserving map under the action of dissipation. Our results show that the effect of this dissipative force is more pronounced when the mass of the satellite and/or the size of the particle decrease, leading to chaotic, although confined, orbits. From the maximum Lyapunov Characteristic Exponent a final value of gamma was computed after a time span of 10(6) orbital periods of the satellite. This result enables us to obtain a critical value of log y beyond which the orbit of the particle will be unstable, leaving the tadpole behaviour. For particles initially located near L4, the critical value of log gamma is -4.07 and for those particles located near L-5 the critical value of log gamma is -3.96. (c) 2006 Elsevier B.V. All rights reserved.

Three-body problem, its Lagrangian points and how to exploit them using an alternative transfer to L4 and L5

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

The use of the challenge test to analyse preservative efficiency in non-sterile cosmetic and health products: applications and critical points

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Transmission system expansion planning by a branch-and-bound algorithm

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.

Metabolic acidosis in healthy mules under general anaesthesia with halothane

Objective To report the severe metabolic acidosis identified in a group of 11 healthy mules anaesthetized with halothane for castration.Study design Data generated from a prospective study.Animals Eleven mules aged 2.5-8 years, weighing 230-315 kg and 11 horses aged 1.5-3.5 years, weighing 315-480 kg.Methods Animals were anaesthetized for castration as part of an electroencephalographic study. Preanaesthetic medication was acepromazine (0.03 mg kg(-1)) administered through a preplaced jugular venous catheter. Anaesthesia was induced 30-90 minutes later with intravenous thiopental (10 mg kg(-1)). After orotracheal intubation, anaesthesia was maintained with halothane vaporised in oxygen. The animals' lungs were ventilated to maintain the end-tidal CO(2) concentration between 3.9 and 4.5 kPa (29-34 mmHg). Anaesthetic monitoring included invasive blood pressure measurement via the auricular artery (mules) and submandibular branch of the facial artery (horses). Arterial blood gas samples were drawn from these catheters at three time points during surgery and pH, PaCO(2), base excess (ecf) and HCO(3)(-) were measured. Values were compared between groups using a Mann-Whitney test. p was taken as <0.05. Results are reported as median (range).Results PaCO(2) did not differ between groups but pH was significantly lower in mules [7.178 (7.00-7.29)] compared to horses [7.367 (7.24-7.43)] (p = 0.0002). HCO(3)(-) values were significantly lower in the mules [16.6 (13.0-22.3) mM] compared to horses [23.7 (20.9-23.7) mM] (p = 0.0001), whilst base excess (ecf) was significantly more negative in the mules [-11.4 (-1.27 to -16) mM] compared to horses [-1.3 (-5.8 to +2.4) mM] (p = 0.0004).Conclusion and clinical relevance This study demonstrated severe metabolic acidosis in healthy mules, which may have prompted intervention with drug therapies in a clinical arena. It is probable that the acidosis existed prior to anaesthesia and caused by diet, but other possible causes are considered.

Fixed points and vacuum energy of dynamically broken gauge theories

We show that if a gauge theory with dynamical symmetry breaking has nontrivial fixed points, they will correspond to extrema of the vacuum energy. This relationship provides a different method to determine fixed points.

Uses of QCD sumrules (QCDSR) from different points of view

We support the idea that the baryon, B with mass MB, couples to its current with a coupling λ2 B ∼ 0.71 M6 B from an analysis of magnetic moment sum rules. And we find a sum rule among the experimental magnetic moments which is independent of the parameters of QCDSR. © 1998 Elsevier Science B.V. All rights reserved.

Planejamento de Fontes Reativas em Sistemas de Energia Elétrica utilizando a técnica de Decomposição de Benders e o algoritmo de Branch-and-Bound

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.

A branch-and-bound algorithm for the multi-stage transmission expansion planning

This work presents a branch-and-bound algorithm to solve the multi-stage transmission expansion planning problem. The well known transportation model is employed, nevertheless the algorithm can be extended to hybrid models or to more complex ones such as the DC model. Tests with a realistic power system were carried out in order to show the performance of the algorithm for the expansion plan executed for different time frames. © 2005 IEEE.

In vitro antimicrobial activity of different gutta-percha points and calcium hydroxide pastes

The aim of this study was to evaluate the antimicrobial activity of different trademarks and compositions of gutta-percha points and calcium hydroxide pastes used in endodontic therapy. The evaluated material consisted of gutta-percha points containing calcium hydroxide (Roeko™), gutta-percha points containing chlorhexidine (Roeko™), two convencional gutta-percha points (Endo Points™ and Roeko™) and two calcium hydroxide pastes (Calen™ and Calen/PMCC™). Antimicrobial tests included five species of microorganisms: Escherichia coli (ATCC10538), Staphylococcus epidermidis (ATCC12228), Staphylococcus aureus (ATCC6538), Pseudomonas aeruginosa (ATCC27853), and Micrococcus luteus (ATCC9341). The Agar difusion method was employed. The plates were kept at room temperature for 2 h for prediffusion and then incubated at 37°C for 24 h. The triphenyltetrazolium chloride gel was added for optimization and the zones of inhibition were measured. Statistical evaluation was carried out using analysis of variance and Tukey Test. The obtained results showed that all microbial species used in the study were inhibited by the gutta-percha points containing chlorhexidine and by the calcium hydroxide pastes (Calen™ and Calen/ PMCC™), with similar results (p > 0.05). No antimicrobial activity was observed for the other groups. It was concluded that the gutta-percha points containing chlorhexidine presented antimicrobial activity, whereas the gutta-percha points containing calcium hydroxide did not.

Branch and bound algorithm for transmission network expansion planning using DC model

This paper presents an algorithm to solve the network transmission system expansion planning problem using the DC model which is a mixed non-linear integer programming problem. The major feature of this work is the use of a Branch-and-Bound (B&B) algorithm to directly solve mixed non-linear integer problems. An efficient interior point method is used to solve the non-linear programming problem at each node of the B&B tree. Tests with several known systems are presented to illustrate the performance of the proposed method. ©2007 IEEE.