Non-transposed three-phase line analyses with a single real transformation matrix

In transmission line transient analyses, a single real transformation matrix can obtain exact modes when the analyzed line is transposed. For non-transposed lines, the results are not exact. In this paper, non-symmetrical and non transposed three-phase line samples are analyzed with a single real transformation matrix application (Clarke's matrix). Some interesting characteristics of this matrix application are: single, real, frequency independent, line parameter independent, identical for voltage and current determination. With Clarke's matrix use, mathematical simplifications are obtained and the developed model can be applied directly in programs based on time domain. This model works without convolution procedures to deal with phase-mode transformation. In EMTP programs, Clarke's matrix can be represented by ideal transformers and the frequency dependent line parameters can be represented by modified-circuits. With these representations, the electrical values at any line point can be accessed for phase domain or mode domain using the Clarke matrix or its inverse matrix. For symmetrical and non-transposed lines, the model originates quite small errors. In addition, the application of the proposed model to the non-symmetrical and non-transposed three phase transmission lines is investigated. ©2005 IEEE.

Correction procedure applied to a single real transformation matrix -Untransposed three-phase transmission line cases

Clarke's matrix has been used as an eigenvector matrix for transposed three-phase transmission lines and it can be applied as a phase-mode transformation matrix for transposed cases. Considering untransposed three-phase transmission lines, Clarke's matrix is not an exact eigenvector matrix. In this case, the errors related to the diagonal elements of the Z and Y matrices can be considered negligible, if these diagonal elements are compared to the exact elements in domain mode. The mentioned comparisons are performed based on the error and frequency scan analyses. From these analyses and considering untransposed asymmetrical three-phase transmission lines, a correction procedure is determined searching for better results from the Clarke's matrix use as a phase-mode transformation matrix. Using the Clarke's matrix, the relative errors of the eigenvalue matrix elements can be considered negligible and the relative values of the off-diagonal elements are significant. Applying the corrected transformation matrices, the relative values of the off-diagonal elements are decreased. The comparisons among the results of these analyses show that the homopolar mode is more sensitive to the frequency influence than the two other modes related to three-phase lines. © 2006 IEEE.

Global optimization for the ℋ∞-norm model reduction problem

A branch and bound algorithm is proposed to solve the [image omitted]-norm model reduction problem for continuous and discrete-time linear systems, with convergence to the global optimum in a finite time. The lower and upper bounds in the optimization procedure are described by linear matrix inequalities (LMI). Also proposed are two methods with which to reduce the convergence time of the branch and bound algorithm: the first one uses the Hankel singular values as a sufficient condition to stop the algorithm, providing to the method a fast convergence to the global optimum. The second one assumes that the reduced model is in the controllable or observable canonical form. The [image omitted]-norm of the error between the original model and the reduced model is considered. Examples illustrate the application of the proposed method.

Modal transformation obtained from Clarke's matrix - Asymmetrical three-phase case

Some constant matrices can be used as phase-mode transformation matrices for transposed three-phase transmission lines. Clarke's matrix is one of these options. Its application as a phase-mode transformation matrix for untransposed three-phase transmission lines has been analyzed through error and frequency scan comparisons. Based on an actual untransposed asymmetrical three-phase transmission line example, a correction procedure is applied searching for better results from the Clarke's matrix applicaton as a phase-mode transformation matrix. The error analyses are carried out using Clarke's matrix and the new transformation matrices obtained from the correction procedure. Applying Clarke's matrix, the relative errors of the eigenvalue matrix elements can be considered negligible and the relative values of the off-diagonal elements are significant. If the the corrected transformation matrices are used, the relative values of the off-diagonal elements are decreased. Based on the results of these analyses, the homopolar mode is more sensitive to the frequency influence than the two other modes related to three-phase lines. © 2007 IEEE.

A decomposition heuristic for the maximal covering location problem

This paper proposes a cluster partitioning technique to calculate improved upper bounds to the optimal solution of maximal covering location problems. Given a covering distance, a graph is built considering as vertices the potential facility locations, and with an edge connecting each pair of facilities that attend a same client. Coupling constraints, corresponding to some edges of this graph, are identified and relaxed in the Lagrangean way, resulting in disconnected subgraphs representing smaller subproblems that are computationally easier to solve by exact methods. The proposed technique is compared to the classical approach, using real data and instances from the available literature. © 2010 Edson Luiz França Senne et al.

Kernel polynomials from L-orthogonal polynomials

A positive measure ψ defined on [a,b] such that its moments μn=∫a btndψ(t) exist for n=0,±1,±2,⋯, is called a strong positive measure on [a,b]. If 0≤aeigenvalue problems and numerical evaluation of the nodes and weights of such quadrature rules are also considered. © 2010 IMACS. Published by Elsevier B.V. All rights reserved.

Estabilização de sistemas fuzzy T-S incertos usando realimenta̧ão derivativa

In some practical problems, for instance, in the suppression of vibration in mechanical systems, the state-derivative signals are easier to obtain than the state signals. Thus, a method for state-derivative feedback design applied to uncertain nonlinear systems is proposed in this work. The nonlinear systems are represented by Takagi-Sugeno fuzzy models during the modeling of the problem, allowing to use Linear Matrix Inequalities (LMIs) in the controller design. This type of modeling ease the control design, because, LMIs are easily solved using convex programming technicals. The control design aimed at system stabilisation, with or without bounds on decay rate. The efficiency of design procedure is illustrated through a numerical example.

GRASP with evolutionary path-relinking for the capacitated arc routing problem

The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required edges under vehicle capacity constraints. There are numerous applications for the CARP, such as street sweeping, garbage collection, mail delivery, school bus routing, and meter reading. A Greedy Randomized Adaptive Search Procedure (GRASP) with Path-Relinking (PR) is proposed and compared with other successful CARP metaheuristics. Some features of this GRASP with PR are (i) reactive parameter tuning, where the parameter value is stochastically selected biased in favor of those values which historically produced the best solutions in average; (ii) a statistical filter, which discard initial solutions if they are unlikely to improve the incumbent best solution; (iii) infeasible local search, where high-quality solutions, though infeasible, are used to explore the feasible/infeasible boundaries of the solution space; (iv) evolutionary PR, a recent trend where the pool of elite solutions is progressively improved by successive relinking of pairs of elite solutions. Computational tests were conducted using a set of 81 instances, and results reveal that the GRASP is very competitive, achieving the best overall deviation from lower bounds and the highest number of best solutions found. © 2011 Elsevier Ltd. All rights reserved.

Domain reduction using GRASP construction phase for transmission expansion planning problem

This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed to reduce the domain of the integer variables of the transportation model of the transmission expansion planning (TM-TEP) problem. This problem is a MILP and very difficult to solve specially for large scale systems. The branch and bound (BB) algorithm is used to solve the problem in both full and the reduced search space. The proposed method might be useful to reduce the search space of those kinds of MILP problems that a fast heuristic algorithm is available for finding local optimal solutions. The obtained results using some real test systems show the efficiency of the proposed method. © 2012 Springer-Verlag.

A search for a doubly-charged Higgs boson in pp collisions at √s=7 TeV

A search for a doubly-charged Higgs boson in pp collisions at √s=7 TeV is presented. The data correspond to an integrated luminosity of 4. 9 fb-1, collected by the CMS experiment at the LHC. The search is performed using events with three or more isolated charged leptons of any flavor, giving sensitivity to the decays of pair-produced triplet components Φ++Φ--, and Φ++Φ- from associated production. No excess is observed compared to the background prediction, and upper limits at the 95 % confidence level are set on the Φ++ production cross section, under specific assumptions on its branching fractions. Lower bounds on the Φ++ mass are reported, providing significantly more stringent constraints than previously published limits. © 2012 CERN for the benefit of the CMS collaboration.

An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks

We present a metaheuristic approach which combines constructive heuristics and local searches based on sampling with path relinking. Its effectiveness is demonstrated by an application to the problem of allocating switches in electrical distribution networks to improve their reliability. Our approach also treats the service restoration problem, which has to be solved as a subproblem, to evaluate the reliability benefit of a given switch allocation proposal. Comparisons with other metaheuristics and with a branch-and-bound procedure evaluate its performance. © 2012 Published by Elsevier Ltd.

Effect of ball milling on structural and physicochemical characteristics of cassava and Peruvian carrot starches

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

Estimates of genetic parameters and eigenvector indices for milk production of Holstein cows

The objectives of the present study were to estimate genetic parameters of monthly test-day milk yield (TDMY) of the first lactation of Brazilian Holstein cows using random regression (RR), and to compare the genetic gains for milk production and persistency, derived from RR models, using eigenvector indices and selection indices that did not consider eigenvectors. The data set contained monthly TDMY of 3,543 first lactations of Brazilian Holstein cows calving between 1994 and 2011. The RR model included the fixed effect of the contemporary group (herd-month-year of test days), the covariate calving age (linear and quadratic effects), and a fourth-order regression on Legendre orthogonal polynomials of days in milk (DIM) to model the population-based mean curve. Additive genetic and nongenetic animal effects were fit as RR with 4 classes of residual variance random effect. Eigenvector indices based on the additive genetic RR covariance matrix were used to evaluate the genetic gains of milk yield and persistency compared with the traditional selection index (selection index based on breeding values of milk yield until 305 DIM). The heritability estimates for monthly TDMY ranged from 0.12 ± 0.04 to 0.31 ± 0.04. The estimates of additive genetic and nongenetic animal effects correlation were close to 1 at adjacent monthly TDMY, with a tendency to diminish as the time between DIM classes increased. The first eigenvector was related to the increase of the genetic response of the milk yield and the second eigenvector was related to the increase of the genetic gains of the persistency but it contributed to decrease the genetic gains for total milk yield. Therefore, using this eigenvector to improve persistency will not contribute to change the shape of genetic curve pattern. If the breeding goal is to improve milk production and persistency, complete sequential eigenvector indices (selection indices composite with all eigenvectors) could be used with higher economic values for persistency. However, if the breeding goal is to improve only milk yield, the traditional selection index is indicated. © 2013 American Dairy Science Association.

Limitantes inferiores par ao problema de dimensionamento de lotes em máquinas paralelas

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

Reformulações e relaxação Lagrangiana para o problema de dimensionamento de lotes com várias plantas

Pós-graduação em Matemática - IBILCE