Relief grating induced by photo-expansion in Ga-Ge-S and Ga-Ge-As-S glasses

We report the fabrication of relief diffraction gratings recorded on a surface of photosensitive Ga10Ge25S65 and Ga5Ge25As5S65 glasses by means of interference of two UV laser beams at 351 nm. The diffraction efficiency (eta) of first diffraction order was measured. Atomic-force-microscope (AFM) was used to perform a 3D imaging analysis of the sample surface topography that shows the superposition of an imprinted grating over the topography of the glass. The change in the absorption edge and the refractive index has been evaluated and a structural approach of the relief grating on the glass surface has been discussed.

EXPANSION OF THE DISTURBING FUNCTION FOR HIGH ECCENTRICITY AND LARGE-AMPLITUDE OF LIBRATION

Following some ideas, developed by Woltjer (1928), Message (1989), Yokoyama (1988, 1989) and Duriez (1990) an expansion of the disturbing function is given for high values of the eccentricity and large amplitude of libration. The classical expansion can be obtained as a particular case of the present model. Several asteroids with high eccentricity and large amplitude of libration are tested and the results are much better than those obtained from the classical theory.

Transmission network expansion planning with security constraints

A mathematical model and a methodology to solve the transmission network expansion planning problem with security constraints are presented. The methodology allows one to find an optimal and reliable transmission network expansion plan using a DC model to represent the electrical network. The security (n-1) criterion is used. The model presented is solved using a genetic algorithm designed to solve the reliable expansion planning in an efficient way. The results obtained for several known systems from literature show the excellent performance of the proposed methodology. A comparative analysis of the results obtained with the proposed methodology is also presented.

Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planning

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.

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.

Light-induced relief gratings and a mechanism of metastable light-induced expansion in chalcogenide glasses

We report on a metastable light-induced volume expansion in Ge25+xGa10-xS65 glasses under irradiation with band gap (UV) light, which can result in recording of relief gratings on their surface in the case of irradiation with two interfering beams. We propose a mechanism for the expansion, which is based on the light-induced change in the polarizability of secondary (van der Waals type) bonds and the effect of this change on primary (covalent type) bonds of the glass. The effect is suggested to be due to an interference of electrons, which belong to a chalcogen atom and participate in the formation of secondary and primary bonds, respectively. We suggest that a minimum point of the Lennard-Jones potential, which corresponds to the equilibrium position of a chalcogen atom is shifted in the course of irradiation to a larger interatomic distance. This shift causes a volume expansion and allows a diffusion of chalcogen atoms into the irradiated area. We show that light-induced polymerization of the glass network is an important attribute of the light-induced volume expansion.

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.

Efficient linear programming algorithm for the transmission network expansion planning problem

The transmission network planning problem is a non-linear integer mixed programming problem (NLIMP). Most of the algorithms used to solve this problem use a linear programming subroutine (LP) to solve LP problems resulting from planning algorithms. Sometimes the resolution of these LPs represents a major computational effort. The particularity of these LPs in the optimal solution is that only some inequality constraints are binding. This task transforms the LP into an equivalent problem with only one equality constraint (the power flow equation) and many inequality constraints, and uses a dual simplex algorithm and a relaxation strategy to solve the LPs. The optimisation process is started with only one equality constraint and, in each step, the most unfeasible constraint is added. The logic used is similar to a proposal for electric systems operation planning. The results show a higher performance of the algorithm when compared to primal simplex methods.

Power system transmission network expansion planning using AC model

An optimisation technique to solve transmission network expansion planning problem, using the AC model, is presented. This is a very complex mixed integer nonlinear programming problem. A constructive heuristic algorithm aimed at obtaining an excellent quality solution for this problem is presented. An interior point method is employed to solve nonlinear programming problems during the solution steps of the algorithm. Results of the tests, carried out with three electrical energy systems, show the capabilities of the method and also the viability of using the AC model to solve the problem.

The high-eccentricity asymmetric expansion of the disturbing function for non-planar resonant problems

In this paper we present an extension to the nonplanar case of the asymmetric expansion of the averaged resonant disturbing function of Ferraz-Mello & Sato (1989, A&A 225, 541-547). Comparions with the exact averaged disturbing function are also presented. The expansion gives a good approximation of the exact function in a wide region around the center of expansion.

Bone healing in drill hole defects in spontaneously hypertensive male and female rats' femurs. A histological and histometric study

Objective: the aim of this study was to evaluate the bone healing in spontaneously hypertensive rats (SHR) and compare the results with normotensive rats, evaluating male and female animals.Methods: A bone drill defect was created in the left femur of 24 SHR (12 males and 12 females) and 24 normotensive rats (12 males and 12 females). The animals were divided into two groups and sacrificed 7 and 21 days after the surgical procedure. After the routine laboratory processing, histological and histometric analysis were carried out and data were submitted to ANOVA and Tukey's test (5%).Results: Males and females from the same group had similar histological characteristics. After seven days, all animals presented irregular bone trabeculae. The periosteal osteoblasts were flattened in SHR, and presented a cuboid shape in normotensive animals. After 21 days, the bone defects of all specimens showed a linear closure in all the superficial extension. In addition, SHR presented flattened osteoblasts surrounding the bone trabeculae, while normotensive ones showed cuboidal cells. Statistical analysis of the histometric data indicated similar means between the male and female groups, except for normotensive rats on day 7. In addition, a larger amount of new bone formation was observed in hypertensive when compared to normotensive rats on day 27, in males as well as females.Conclusion: We conclude that bone healing in SHR was more significant than in normotensive ones, as shown by the histological and histometric evaluation 21 days after surgery.

Transmission network expansion planning considering uncertainty in demand

This paper presents two mathematical models and one methodology to solve a transmission network expansion planning problem considering uncertainty in demand. The first model analyzed the uncertainty in the system as a whole; then, this model considers the uncertainty in the total demand of the power system. The second one analyzed the uncertainty in each load bus individually. The methodology used to solve the problem, finds the optimal transmission network expansion plan that allows the power system to operate adequately in an environment with uncertainty. The models presented are solved using a specialized genetic algorithm. The results obtained for several known systems from literature show that cheaper plans can be found satisfying the uncertainty in demand.