Security constrained optimal active power flow via network model and interior point method

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

Interior point algorithm for linear programming used in transmission network synthesis

This article presents a well-known interior point method (IPM) used to solve problems of linear programming that appear as sub-problems in the solution of the long-term transmission network expansion planning problem. The linear programming problem appears when the transportation model is used, and when there is the intention to solve the planning problem using a constructive heuristic algorithm (CHA), ora branch-and-bound algorithm. This paper shows the application of the IPM in a CHA. A good performance of the IPM was obtained, and then it can be used as tool inside algorithm, used to solve the planning problem. Illustrative tests are shown, using electrical systems known in the specialized literature. (C) 2005 Elsevier B.V. All rights reserved.

Reactive power dispatch and planning using a non-linear branch-and-bound algorithm

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Continuation load flow using automatically determined branch megawatt losses as parameters

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.

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.

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.

Assessment of branch outage contingencies using the continuation method

This paper provides a contribution to the contingency analysis of electric power systems under steady state conditions. An alternative methodology is presented for static contingency analyses that only use continuation methods and thus provides an accurate determination of the loading margin. Rather than starting from the base case operating point, the proposed continuation power flow obtains the post-contingency loading margins starting from the maximum loading and using a bus voltage magnitude as a parameter. The branch selected for the contingency evaluation is parameterised using a scaling factor, which allows its gradual removal and assures the continuation power flow convergence for the cases where the method would diverge for the complete transmission line or transformer removal. The applicability and effectiveness of the proposed methodology have been investigated on IEEE test systems (14, 57 and 118 buses) and compared with the continuation power flow, which obtains the post-contingency loading margin starting from the base case solution. In general, for most of the analysed contingencies, few iterations are necessary to determine the post-contingency maximum loading point. Thus, a significant reduction in the global number of iterations is achieved. Therefore, the proposed methodology can be used as an alternative technique to verify and even to obtain the list of critical contingencies supplied by the electric power systems security analysis function. © 2013 Elsevier Ltd. All rights reserved.

Procedimento híbrido envolvendo os métodos primal-dual de pontos interiores e branch and bound em problemas multiobjetivo de aproveitamento de resíduos de cana-de-açúcar

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Planejamento de reativos em sistemas de energia elétrica através de um algoritmo de Branch-and-Bound não linear

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Shoreline movement investigations report : Portuguese Point to the Mexican border (1852-1982) : Coast of California storm and tidal waves study /

Mode of access: Internet.

One-year outcome of bevacizumab therapy for chronic macular edema in central and branch retinal vein occlusions in real-world clinical practice in the UK

Background: The purpose of this study was to investigate the 12-month outcome of macular edema secondary to both chronic and new central and branch retinal vein occlusions treated with intravitreal bevacizumab in the real-life clinical setting in the UK. Methods: Retrospective case notes analysis of consecutive patients with retinal vein occlusions treated with bevacizumab in 2010 to 2012. Outcome measures were visual acuity (measured with Snellen, converted into logMAR [logarithm of the minimum angle of resolution] for statistical calculation) and central retinal thickness at baseline, 4 weeks post-loading phase, and at 1 year. Results: There were 56 and 100 patients with central and branch retinal vein occlusions, respectively, of whom 62% had chronic edema and received prior therapies and another 32% required additional laser treatments post-baseline bevacizumab. Baseline median visual acuity was 0.78 (interquartile range [IQR] 0.48–1.22) in the central group and 0.6 (IQR 0.3–0.78) in the branch group. In both groups, visual improvement was statistically significant from baseline compared to post-loading (P,0.001 and P=0.03, respectively), but was not significant by month 12 (P=0.058 and P=0.166, respectively); 30% improved by at least three lines and 44% improved by at least one line by month 12. Baseline median central retinal thickness was 449 μm (IQR 388–553) in the central group and 441 µm (IQR 357–501) in the branch group. However, the mean reduction in thickness was statistically significant at post-loading (P,0.001) and at the 12-month time point (P,0.001) for both groups. The average number of injections in 1 year was 4.2 in the central group and 3.3 in the branch group. Conclusion: Our large real-world cohort results indicate that bevacizumab introduced to patients with either new or chronic edema due to retinal vein occlusion can result in resolution of edema and stabilization of vision in the first year.

Rigid and non-rigid point-based medical image registration

The primary goal of this dissertation is to develop point-based rigid and non-rigid image registration methods that have better accuracy than existing methods. We first present point-based PoIRe, which provides the framework for point-based global rigid registrations. It allows a choice of different search strategies including (a) branch-and-bound, (b) probabilistic hill-climbing, and (c) a novel hybrid method that takes advantage of the best characteristics of the other two methods. We use a robust similarity measure that is insensitive to noise, which is often introduced during feature extraction. We show the robustness of PoIRe using it to register images obtained with an electronic portal imaging device (EPID), which have large amounts of scatter and low contrast. To evaluate PoIRe we used (a) simulated images and (b) images with fiducial markers; PoIRe was extensively tested with 2D EPID images and images generated by 3D Computer Tomography (CT) and Magnetic Resonance (MR) images. PoIRe was also evaluated using benchmark data sets from the blind retrospective evaluation project (RIRE). We show that PoIRe is better than existing methods such as Iterative Closest Point (ICP) and methods based on mutual information. We also present a novel point-based local non-rigid shape registration algorithm. We extend the robust similarity measure used in PoIRe to non-rigid registrations adapting it to a free form deformation (FFD) model and making it robust to local minima, which is a drawback common to existing non-rigid point-based methods. For non-rigid registrations we show that it performs better than existing methods and that is less sensitive to starting conditions. We test our non-rigid registration method using available benchmark data sets for shape registration. Finally, we also explore the extraction of features invariant to changes in perspective and illumination, and explore how they can help improve the accuracy of multi-modal registration. For multimodal registration of EPID-DRR images we present a method based on a local descriptor defined by a vector of complex responses to a circular Gabor filter.

Rigid and Non-rigid Point-based Medical Image Registration

The primary goal of this dissertation is to develop point-based rigid and non-rigid image registration methods that have better accuracy than existing methods. We first present point-based PoIRe, which provides the framework for point-based global rigid registrations. It allows a choice of different search strategies including (a) branch-and-bound, (b) probabilistic hill-climbing, and (c) a novel hybrid method that takes advantage of the best characteristics of the other two methods. We use a robust similarity measure that is insensitive to noise, which is often introduced during feature extraction. We show the robustness of PoIRe using it to register images obtained with an electronic portal imaging device (EPID), which have large amounts of scatter and low contrast. To evaluate PoIRe we used (a) simulated images and (b) images with fiducial markers; PoIRe was extensively tested with 2D EPID images and images generated by 3D Computer Tomography (CT) and Magnetic Resonance (MR) images. PoIRe was also evaluated using benchmark data sets from the blind retrospective evaluation project (RIRE). We show that PoIRe is better than existing methods such as Iterative Closest Point (ICP) and methods based on mutual information. We also present a novel point-based local non-rigid shape registration algorithm. We extend the robust similarity measure used in PoIRe to non-rigid registrations adapting it to a free form deformation (FFD) model and making it robust to local minima, which is a drawback common to existing non-rigid point-based methods. For non-rigid registrations we show that it performs better than existing methods and that is less sensitive to starting conditions. We test our non-rigid registration method using available benchmark data sets for shape registration. Finally, we also explore the extraction of features invariant to changes in perspective and illumination, and explore how they can help improve the accuracy of multi-modal registration. For multimodal registration of EPID-DRR images we present a method based on a local descriptor defined by a vector of complex responses to a circular Gabor filter.

GPX - Gardens Point XML Information Retrieval at INEX 2004

Traditional information retrieval (IR) systems respond to user queries with ranked lists of relevant documents. The separation of content and structure in XML documents allows individual XML elements to be selected in isolation. Thus, users expect XML-IR systems to return highly relevant results that are more precise than entire documents. In this paper we describe the implementation of a search engine for XML document collections. The system is keyword based and is built upon an XML inverted file system. We describe the approach that was adopted to meet the requirements of Content Only (CO) and Vague Content and Structure (VCAS) queries in INEX 2004.