Evaluation of light transmission through translucent and opaque posts

Objectives: The transmission of light through translucent posts was observed, and the microhardness of light-cured cement used to secure these posts was evaluated at different depths. Methods: Fifteen single-rooted standard bovine teeth, 16 mm in size, were used. The root canals were prepared using #3 drills Light-Post (five teeth) and Aestheti Post (five teeth) systems (BISCO), with a working-length of 12 mm. In five teeth, translucent posts were cemented (Light-Post #2), while another five teeth received opaque posts (Aestheti Post #2). The roots were painted with black nail varnish to prevent the passage of light through the lateral walls of the roots. The root canals of all the specimens were treated with the All-Bond 2 adhesive system (BISCO) and cemented with light-cured cement (Enforce, Dentsply). All the roots were transversally cut to obtain six specimens 1.5 mm thick. Every two sections corresponded to a specific region of the root (cervical, middle, apical), making it possible to observe the cement microhardness at different levels. The groups (n=10) were defined as: G1: translucent post (TP)/cervical region; G2: TP/middle region; G3: TP/apical region; G4: Opaque post (OP)/cervical region; G5: OP/middle region; G6: PO/apical region. Five root canals were only filled with cement for use as a control (G7). Then, Vickers microhardness analyses were performed. Results: In G3, G5 and G6, the cement was not sufficiently hard to allow for microhardness analysis. When submitted to the ANOVA test, G1 (35.07), G2 (24.28) and G4 (28.64) presented no statistical differences. When the previous groups were compared to G7 (51.00) using the Kruskal-Wallis test, a statistical difference was found. Conclusion: Translucent posts allow cement polymerization up to the middle portion of the root.

Evaluation of economic impact of external eauivalent models used in reactive OPF studies for interconnected systems

Reactive-optimisation procedures are responsible for the minimisation of online power losses in interconnected systems. These procedures are performed separately at each control centre and involve external network representations. If total losses can be minimised by the implementation of calculated local control actions, the entire system benefits economically, but such control actions generally result in a certain degree of inaccuracy, owing to errors in the modelling of the external system. Since these errors are inevitable, they must at least be maintained within tolerable limits by external-modelling approaches. Care must be taken to avoid unrealistic loss minimisation, as the local-control actions adopted can lead the system to points of operation which will be less economical for the interconnected system as a whole. The evaluation of the economic impact of the external modelling during reactive-optimisation procedures in interconnected systems, in terms of both the amount of losses and constraint violations, becomes important in this context. In the paper, an analytical approach is proposed for such an evaluation. Case studies using data from the Brazilian South-Southeast system (810 buses) have been carried out to compare two different external-modelling approaches, both derived from the equivalent-optimal-power-flow (EOPF) model. Results obtained show that, depending on the external-model representation adopted, the loss representation can be flawed. Results also suggest some modelling features that should be adopted in the EOPF model to enhance the economy of the overall system.

A metaheuristic to solve the transmission expansion planning

In this letter, a genetic algorithm (GA) is applied to solve - the static and multistage transmission expansion planning (TEP) problem. The characteristics of the proposed GA to solve the TEP problem are presented. Results using some known systems show that the proposed GA solves a smaller number of linear programming problems in order to find the optimal solutions and obtains a better solution for the multistage TEP problem.

Constructive heuristic algorithm for the DC model in network transmission expansion planning

A novel constructive heuristic algorithm to the network expansion planning problem is presented the basic idea comes from Garver's work applied to the transportation model, nevertheless the proposed algorithm is for the DC model. Tests results with most known systems in the literature are carried out to show the efficiency of the method.

Electrical and micro structural properties of (Zn, Nb, Fe)-doped SnO2 varistor systems

The electrical and microstructural properties of SnO2-based varistors with the addition of 0.025 and 0.050 mol% of Fe2O3 have been characterised. Electric field (E) versus current density (J) curves showed that the effect of Fe2O3 addition is to increase both the non-linear coefficient and the breakdown voltage. Variations in the potential barrier height were inferred from impedance spectroscopy (IS) analysis. Through transmission electron microscopy (TEM), the presence of precipitates of secondary phases was confirmed. Samples with precipitates displayed poor electrical properties. (c) 2004 Elsevier Ltd and Techna Group S.r.l. All rights reserved.

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.

Z(bus) transmission network cost allocation

This paper addresses the problem of allocating the cost of the transmission network to generators and demands. A physically-based network usage procedure is proposed. This procedure exhibits desirable apportioning properties and is easy to implement and understand. A case study based on the IEEE 24-bus system is used to illustrate the working of the proposed technique. Some relevant conclusions are finally drawn.

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.

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.

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.

Comparative studies on non-convex optimization methods for transmission network expansion planning

We have investigated and extensively tested three families of non-convex optimization approaches for solving the transmission network expansion planning problem: simulated annealing (SA), genetic algorithms (GA), and tabu search algorithms (TS). The paper compares the main features of the three approaches and presents an integrated view of these methodologies. A hybrid approach is then proposed which presents performances which are far better than the ones obtained with any of these approaches individually. Results obtained in tests performed with large scale real-life networks are summarized.

Parallel simulated annealing applied to long term transmission network expansion planning

The simulated annealing optimization technique has been successfully applied to a number of electrical engineering problems, including transmission system expansion planning. The method is general in the sense that it does not assume any particular property of the problem being solved, such as linearity or convexity. Moreover, it has the ability to provide solutions arbitrarily close to an optimum (i.e. it is asymptotically convergent) as the cooling process slows down. The drawback of the approach is the computational burden: finding optimal solutions may be extremely expensive in some cases. This paper presents a Parallel Simulated Annealing, PSA, algorithm for solving the long term transmission network expansion planning problem. A strategy that does not affect the basic convergence properties of the Sequential Simulated Annealing algorithm have been implementeded and tested. The paper investigates the conditions under which the parallel algorithm is most efficient. The parallel implementations have been tested on three example networks: a small 6-bus network, and two complex real-life networks. Excellent results are reported in the test section of the paper: in addition to reductions in computing times, the Parallel Simulated Annealing algorithm proposed in the paper has shown significant improvements in solution quality for the largest of the test networks.

Allocation of the costs of transmission losses

An analysis of the performance of six major methods of loss allocation for generators and demands was conducted, based on pro-rata (two), on incremental factors (two), on proportional sharing (PS) (one), and on electric circuit theory (one). Using relatively simple examples which can easily be checked, the advantages and disadvantages of each were ascertained and the results confirmed using a larger sample system (IEEE-118). The discussion considers the location and size of generators and demands, as well as the merits of the location of these agents for each configuration based on an analysis of the effect of various network modifications. Furthermore, an application in the South-Southeastern Brazilian Systems is performed. Conclusions and recommendations are presented. (C) 2004 Elsevier B.V. All rights reserved.