Transmission-expansion planning using the DC model and nonlinear-programming technique

The paper presents a constructive heuristic algorithm (CHA) for solving directly the long-term transmission-network-expansion-planning (LTTNEP) problem using the DC model. The LTTNEP is a very complex mixed-integer nonlinear-programming problem and presents a combinatorial growth in the search space. The CHA is used to find a solution for the LTTNEP problem of good quality. A sensitivity index is used in each step of the CHA to add circuits to the system. This sensitivity index is obtained by solving the relaxed problem of LTTNEP, i.e. considering the number of circuits to be added as a continuous variable. The relaxed problem is a large and complex nonlinear-programming problem and was solved through the interior-point method (IPM). Tests were performed using Garver's system, the modified IEEE 24-Bus system and the Southern Brazilian reduced system. The results presented show the good performance of IPM inside the CHA.

INFLUENCE of HIP EXTERNAL ROTATION on HIP ADDUCTOR and RECTUS FEMORIS MYOELECTRIC ACTIVITY DURING A DYNAMIC PARALLEL SQUAT

Pereira, GR, Leporace, G, Chagas, DV, Furtado, LFL, Praxedes, J, and Batista, LA. Influence of hip external rotation on hip adductor and rectus femoris myoelectric activity during a dynamic parallel squat. J Strength Cond Res 24(10): 27492754, 2010-This study sought to compare the myoelectric activity of the hip adductors (HAs) and rectus femoris (RF) when the hip was in a neutral position or externally rotated by 30 degrees or 50 degrees (H0, H30, and H50, respectively) during a parallel squat. Ten healthy subjects performed 10 repetitions of squats in each of the 3 hip positions and the myoelectric activities of the HAs and RF were recorded. The signal was then divided into categories representing concentric (C) and eccentric (E) contractions in the following ranges of motion: 0-30 degrees (C1 and E1), 30-60 degrees (C2 and E2), and 60-90 degrees (C3 and E3) of knee flexion. From those signals, an root mean square (RMS) value for each range of motion in each hip position was obtained. All values were normalized to those obtained during maximum voluntary isometric contraction. We found that HAs showed a significant increase in myoelectric activity during C3 and E3 in the H30 and H50 positions, as compared with H0. Meanwhile, RF activity did not significantly differ between hip positions. Both muscles showed higher activation during 60-90 degrees (C3 and E3) of knee flexion, as compared with 0-30 degrees (C1 and E1) and 30-60 degrees (C2 and E2). The results suggest that if the aim is to increase HA activity despite the low percentage of muscle activation, squats should be performed with 30 degrees of external rotation and at least 90 degrees of knee flexion.

The Use of Etoricoxib and Celecoxib for Pain Prevention After Periodontal Surgery: A Double-Masked, Parallel-Group, Placebo-Controlled, Randomized Clinical Trial

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

Influence of Wood Moisture Content on the Modulus of Elasticity in Compression Parallel to the Grain

Brazilian Standard ABNT NBR7190:1997 for timber structures design, adopts a first degree equation to describe the influence of wood moisture content. Periodically, when necessary, the referred standard is revised in order to analyze inconsistencies and to adopt considerations according new realities verified. So, the present paper aims to examine the adequacy of its equation which corrects to 12% of moisture the values of rigidity properties obtained on experimental tests. To quantify the moisture influence on modulus of elasticity, it was applied tests of compression parallel to the grain for six specimens of different strength classes, considering nominal moisture of 12; 20; 25; 30%. As results, modulus of elasticity in the moisture range 25-30% showed statistically equivalents, and was obtained a first degree equation to correlate the studied variables which leads to statically equivalent estimations when compared with results by ABNT NBR7190:1997 equation. However, it was indicated to maintain the current expression for the next text of the referred document review, without prejudice to statistical significance of the estimates.

Harmonic identification using parallel neural networks in single-phase systems

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

A thermodynamics description of the system with N massive parallel rigid wires

In this work, the behaviour of the system with N massive parallel rigid wires is analysed. The aim is to explore its resemblance to a system of multiple cosmic strings. Assuming that it behaves like a 'gas' of massive rigid wires, we use a thermodynamics approach to describe this system. We obtain a constraint relating the linear mass density of the massive wires, the number of the massive wires in the system and the dispersion velocity of the system. © 1996 IOP Publishing Ltd.

Towards an intelligent graphical interface for linear programming modelling

The increase of computing power of the microcomputers has stimulated the building of direct manipulation interfaces that allow graphical representation of Linear Programming (LP) models. This work discusses the components of such a graphical interface as the basis for a system to assist users in the process of formulating LP problems. In essence, this work proposes a methodology which considers the modelling task as divided into three stages which are specification of the Data Model, the Conceptual Model and the LP Model. The necessity for using Artificial Intelligence techniques in the problem conceptualisation and to help the model formulation task is illustrated.

Amplitude ratios and the approach to bulk criticality in parallel plate geometries

We present analytical and numerical results for the specific heat and susceptibility amplitude ratios in parallel plate geometries. The results are derived using field-theoretic techniques suitable to describe the system in the bulk limit, i.e., (L/ξ±)≫ 1, where L is the distance between the plates and ξ± is the correlation length above (+) and below (-) the bulk critical temperature. Advantages and drawbacks of our method are discussed in the light of other approaches previously reported in the literature.

Optimality conditions for pareto nonsmooth nonconvex programming in banach spaces

In this paper, we consider a vector optimization problem where all functions involved are defined on Banach spaces. We obtain necessary and sufficient criteria for optimality in the form of Karush-Kuhn-Tucker conditions. We also introduce a nonsmooth dual problem and provide duality theorems.

Design of microirrigation systems in sloping lands using linear programming

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

VAr planning using genetic algorithm and linear programming

A combined methodology consisting of successive linear programming (SLP) and a simple genetic algorithm (SGA) solves the reactive planning problem. The problem is divided into operating and planning subproblems; the operating subproblem, which is a nonlinear, ill-conditioned and nonconvex problem, consists of determining the voltage control and the adjustment of reactive sources. The planning subproblem consists of obtaining the optimal reactive source expansion considering operational, economical and physical characteristics of the system. SLP solves the optimal reactive dispatch problem related to real variables, while SGA is used to determine the necessary adjustments of both the binary and discrete variables existing in the modelling problem. Once the set of candidate busbars has been defined, the program implemented gives the location and size of the reactive sources needed, if any, to maintain the operating and security constraints.

On the solution of mathematical programming problems with equilibrium constraints

Mathematical programming problems with equilibrium constraints (MPEC) are nonlinear programming problems where the constraints have a form that is analogous to first-order optimality conditions of constrained optimization. We prove that, under reasonable sufficient conditions, stationary points of the sum of squares of the constraints are feasible points of the MPEC. In usual formulations of MPEC all the feasible points are nonregular in the sense that they do not satisfy the Mangasarian-Fromovitz constraint qualification of nonlinear programming. Therefore, all the feasible points satisfy the classical Fritz-John necessary optimality conditions. In principle, this can cause serious difficulties for nonlinear programming algorithms applied to MPEC. However, we show that most feasible points do not satisfy a recently introduced stronger optimality condition for nonlinear programming. This is the reason why, in general, nonlinear programming algorithms are successful when applied to MPEC.