On S-matrix factorization of the Landau-Lifshitz model

We consider the three-particle scattering S-matrix for the Landau-Lifshitz model by directly computing the set of the Feynman diagrams up to the second order. We show, following the analogous computations for the non-linear Schrdinger model [1, 2], that the three-particle S-matrix is factorizable in the first non-trivial order.

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.

The r-matrix of the Alday-Arutyunov-Frolov model

We investigate the classical integrability of the Alday-Arutyunov-Frolov model, and show that the Lax connection can be reduced to a simpler 2 x 2 representation. Based on this result, we calculate the algebra between the L-operators and find that it has a highly non-ultralocal form. We then employ and make a suitable generalization of the regularization technique proposed by Mail let for a simpler class of non-ultralocal models, and find the corresponding r- and s-matrices. We also make a connection between the operator-regularization method proposed earlier for the quantum case, and the Mail let's symmetric limit regularization prescription used for non-ultralocal algebras in the classical theory.

Virtual-bound, filamentary and layered states in a box-shaped quantum dot of square potential form the exact numerical solution of the effective mass Schrodinger equation

The effective mass Schrodinger equation of a QD of parallelepipedic shape with a square potential well is solved by diagonalizing the exact Hamiltonian matrix developed in a basis of separation-of-variables wavefunctions. The expected below bandgap bound states are found not to differ very much from the former approximate calculations. In addition, the presence of bound states within the conduction band is confirmed. Furthermore, filamentary states bounded in two dimensions and extended in one dimension and layered states with only one dimension bounded, all within the conduction band which are similar to those originated in quantum wires and quantum wells coexist with the ordinary continuum spectrum of plane waves. All these subtleties are absent in spherically shaped quantum dots, often used for modeling.

Ground and Electronic Excited States from Pairing Matrix Fluctuation and Particle-Particle Random Phase Approximation

The accurate description of ground and electronic excited states is an important and challenging topic in quantum chemistry. The pairing matrix fluctuation, as a counterpart of the density fluctuation, is applied to this topic. From the pairing matrix fluctuation, the exact electron correlation energy as well as two electron addition/removal energies can be extracted. Therefore, both ground state and excited states energies can be obtained and they are in principle exact with a complete knowledge of the pairing matrix fluctuation. In practice, considering the exact pairing matrix fluctuation is unknown, we adopt its simple approximation --- the particle-particle random phase approximation (pp-RPA) --- for ground and excited states calculations. The algorithms for accelerating the pp-RPA calculation, including spin separation, spin adaptation, as well as an iterative Davidson method, are developed. For ground states correlation descriptions, the results obtained from pp-RPA are usually comparable to and can be more accurate than those from traditional particle-hole random phase approximation (ph-RPA). For excited states, the pp-RPA is able to describe double, Rydberg, and charge transfer excitations, which are challenging for conventional time-dependent density functional theory (TDDFT). Although the pp-RPA intrinsically cannot describe those excitations excited from the orbitals below the highest occupied molecular orbital (HOMO), its performances on those single excitations that can be captured are comparable to TDDFT. The pp-RPA for excitation calculation is further applied to challenging diradical problems and is used to unveil the nature of the ground and electronic excited states of higher acenes. The pp-RPA and the corresponding Tamm-Dancoff approximation (pp-TDA) are also applied to conical intersections, an important concept in nonadiabatic dynamics. Their good description of the double-cone feature of conical intersections is in sharp contrast to the failure of TDDFT. All in all, the pairing matrix fluctuation opens up new channel of thinking for quantum chemistry, and the pp-RPA is a promising method in describing ground and electronic excited states.

Mathematical study of complex networks : brain, internet, and power grid

The dissertation is concerned with the mathematical study of various network problems. First, three real-world networks are considered: (i) the human brain network (ii) communication networks, (iii) electric power networks. Although these networks perform very different tasks, they share similar mathematical foundations. The high-level goal is to analyze and/or synthesis each of these systems from a “control and optimization” point of view. After studying these three real-world networks, two abstract network problems are also explored, which are motivated by power systems. The first one is “flow optimization over a flow network” and the second one is “nonlinear optimization over a generalized weighted graph”. The results derived in this dissertation are summarized below.

Brain Networks: Neuroimaging data reveals the coordinated activity of spatially distinct brain regions, which may be represented mathematically as a network of nodes (brain regions) and links (interdependencies). To obtain the brain connectivity network, the graphs associated with the correlation matrix and the inverse covariance matrix—describing marginal and conditional dependencies between brain regions—have been proposed in the literature. A question arises as to whether any of these graphs provides useful information about the brain connectivity. Due to the electrical properties of the brain, this problem will be investigated in the context of electrical circuits. First, we consider an electric circuit model and show that the inverse covariance matrix of the node voltages reveals the topology of the circuit. Second, we study the problem of finding the topology of the circuit based on only measurement. In this case, by assuming that the circuit is hidden inside a black box and only the nodal signals are available for measurement, the aim is to find the topology of the circuit when a limited number of samples are available. For this purpose, we deploy the graphical lasso technique to estimate a sparse inverse covariance matrix. It is shown that the graphical lasso may find most of the circuit topology if the exact covariance matrix is well-conditioned. However, it may fail to work well when this matrix is ill-conditioned. To deal with ill-conditioned matrices, we propose a small modification to the graphical lasso algorithm and demonstrate its performance. Finally, the technique developed in this work will be applied to the resting-state fMRI data of a number of healthy subjects.

Communication Networks: Congestion control techniques aim to adjust the transmission rates of competing users in the Internet in such a way that the network resources are shared efficiently. Despite the progress in the analysis and synthesis of the Internet congestion control, almost all existing fluid models of congestion control assume that every link in the path of a flow observes the original source rate. To address this issue, a more accurate model is derived in this work for the behavior of the network under an arbitrary congestion controller, which takes into account of the effect of buffering (queueing) on data flows. Using this model, it is proved that the well-known Internet congestion control algorithms may no longer be stable for the common pricing schemes, unless a sufficient condition is satisfied. It is also shown that these algorithms are guaranteed to be stable if a new pricing mechanism is used.

Electrical Power Networks: Optimal power flow (OPF) has been one of the most studied problems for power systems since its introduction by Carpentier in 1962. This problem is concerned with finding an optimal operating point of a power network minimizing the total power generation cost subject to network and physical constraints. It is well known that OPF is computationally hard to solve due to the nonlinear interrelation among the optimization variables. The objective is to identify a large class of networks over which every OPF problem can be solved in polynomial time. To this end, a convex relaxation is proposed, which solves the OPF problem exactly for every radial network and every meshed network with a sufficient number of phase shifters, provided power over-delivery is allowed. The concept of “power over-delivery” is equivalent to relaxing the power balance equations to inequality constraints.

Flow Networks: In this part of the dissertation, the minimum-cost flow problem over an arbitrary flow network is considered. In this problem, each node is associated with some possibly unknown injection, each line has two unknown flows at its ends related to each other via a nonlinear function, and all injections and flows need to satisfy certain box constraints. This problem, named generalized network flow (GNF), is highly non-convex due to its nonlinear equality constraints. Under the assumption of monotonicity and convexity of the flow and cost functions, a convex relaxation is proposed, which always finds the optimal injections. A primary application of this work is in the OPF problem. The results of this work on GNF prove that the relaxation on power balance equations (i.e., load over-delivery) is not needed in practice under a very mild angle assumption.

Generalized Weighted Graphs: Motivated by power optimizations, this part aims to find a global optimization technique for a nonlinear optimization defined over a generalized weighted graph. Every edge of this type of graph is associated with a weight set corresponding to the known parameters of the optimization (e.g., the coefficients). The motivation behind this problem is to investigate how the (hidden) structure of a given real/complex valued optimization makes the problem easy to solve, and indeed the generalized weighted graph is introduced to capture the structure of an optimization. Various sufficient conditions are derived, which relate the polynomial-time solvability of different classes of optimization problems to weak properties of the generalized weighted graph such as its topology and the sign definiteness of its weight sets. As an application, it is proved that a broad class of real and complex optimizations over power networks are polynomial-time solvable due to the passivity of transmission lines and transformers.

Transmission matrices and lumped parameter models for continuous systems

The use of transmission matrices and lumped parameter models for describing continuous systems is the subject of this study. Non-uniform continuous systems which play important roles in practical vibration problems, e.g., torsional oscillations in bars, transverse bending vibrations of beams, etc., are of primary importance.

A new approach for deriving closed form transmission matrices is applied to several classes of non-uniform continuous segments of one dimensional and beam systems. A power series expansion method is presented for determining approximate transmission matrices of any order for segments of non-uniform systems whose solutions cannot be found in closed form. This direct series method is shown to give results comparable to those of the improved lumped parameter models for one dimensional systems.

Four types of lumped parameter models are evaluated on the basis of the uniform continuous one dimensional system by comparing the behavior of the frequency root errors. The lumped parameter models which are based upon a close fit to the low frequency approximation of the exact transmission matrix, at the segment level, are shown to be superior. On this basis an improved lumped parameter model is recommended for approximating non-uniform segments. This new model is compared to a uniform segment approximation and error curves are presented for systems whose areas very quadratically and linearly. The effect of varying segment lengths is investigated for one dimensional systems and results indicate very little improvement in comparison to the use of equal length segments. For purposes of completeness, a brief summary of various lumped parameter models and other techniques which have previously been used to approximate the uniform Bernoulli-Euler beam is a given.

Eigenvalue analyses for non-transposed three-phase transmission line considering non-implicit ground wires

This paper presents a method for analyzing electromagnetic transients using real transformation matrices in three-phase systems considering the presence of ground wires. So, for the Z and Y matrices that represent the transmission line, the characteristics of ground wires are not implied in the values related to the phases. A first approach uses a real transformation matrix for the entire frequency range considered in this case. This transformation matrix is an approximation to the exact transformation matrix. For those elements related to the phases of the considered system, the transformation matrix is composed of the elements of Clarke's matrix. In part related to the ground wires, the elements of the transformation matrix must establish a relationship with the elements of the phases considering the establishment of a single homopolar reference in the mode domain. In the case of three-phase lines with the presence of two ground wires, it is unable to get the full diagonalization of the matrices Z and Y in the mode domain. This leads to the second proposal for the composition of real transformation matrix: obtain such transformation matrix from the multiplication of two real and constant matrices. In this case, the inclusion of a second matrix had the objective to minimize errors from the first proposal for the composition of the transformation matrix mentioned. © 2012 IEEE.

Análise de transitórios eletromagnéticos utilizando matrizes de transformação reais-sistemas trifásicos com a presença de cabos pára-raios

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

Integrable Models: from Dynamical Solutions to String Theory

We review the status of integrable models from the point of view of their dynamics and integrability conditions. A few integrable models are discussed in detail. We comment on the use it is made of them in string theory. We also discuss the SO(6) symmetric Hamiltonian with SO(6) boundary. This work is especially prepared for the 70th anniversaries of Andr, Swieca (in memoriam) and Roland Koberle.

Erratum: Suppression of localization in kronig-penney models with correlated disorder (Vol. 49, PG 147, 1994)

We consider the electron dynamics and transport properties of one-dimensional continuous models with random, short-range correlated impurities. We develop a generalized Poincare map formalism to cast the Schrodinger equation for any potential into a discrete set of equations, illustrating its application by means of a specific example. We then concentrate on the case of a Kronig-Penney model with dimer impurities. The previous technique allows us to show that this model presents infinitely many resonances (zeroes of the reflection coefficient at a single dimer) that give rise to a band of extended states, in contradiction with the general viewpoint that all one-dimensional models with random potentials support only localized states. We report on exact transfer-matrix numerical calculations of the transmission coefFicient, density of states, and localization length for various strengths of disorder. The most important conclusion so obtained is that this kind of system has a very large number of extended states. Multifractal analysis of very long systems clearly demonstrates the extended character of such states in the thermodynamic limit. In closing, we brieBy discuss the relevance of these results in several physical contexts.

Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction

Regenerating codes are a class of distributed storage codes that allow for efficient repair of failed nodes, as compared to traditional erasure codes. An [n, k, d] regenerating code permits the data to be recovered by connecting to any k of the n nodes in the network, while requiring that a failed node be repaired by connecting to any d nodes. The amount of data downloaded for repair is typically much smaller than the size of the source data. Previous constructions of exact-regenerating codes have been confined to the case n = d + 1. In this paper, we present optimal, explicit constructions of (a) Minimum Bandwidth Regenerating (MBR) codes for all values of [n, k, d] and (b) Minimum Storage Regenerating (MSR) codes for all [n, k, d >= 2k - 2], using a new product-matrix framework. The product-matrix framework is also shown to significantly simplify system operation. To the best of our knowledge, these are the first constructions of exact-regenerating codes that allow the number n of nodes in the network, to be chosen independent of the other parameters. The paper also contains a simpler description, in the product-matrix framework, of a previously constructed MSR code with [n = d + 1, k, d >= 2k - 1].

Matrix Processors Using p-adic Arithmetic for Exact Linear Computations

A unique code (called Hensel's code) is derived for a rational number by truncating its infinite p-adic expansion. The four basic arithmetic algorithms for these codes are described and their application to rational matrix computations is demonstrated by solving a system of linear equations exactly, using the Gaussian elimination procedure.

Matrix metalloproteinase-9 of tubular and macrophage origin contributes to the pathogenesis of renal fibrosis via macrophage recruitment through osteopontin cleavage

A pro-fibrotic role of matrix metalloproteinase-9 (MMP-9) in tubular cell epithelial-mesenchymal transition (EMT) is well established in renal fibrosis; however studies from our group and others have demonstrated some previously unrecognized complexity of MMP-9 that has been overlooked in renal fibrosis. Therefore, the aim of this study was to determine the expression pattern, origin and the exact mechanism underlying the contribution of MMP-9 to unilateral ureteral obstruction (UUO), a well-established model of renal fibrosis via MMP-9 inhibition. Renal MMP-9 expression in BALB/c mice with UUO was examined on day 1, 3, 5, 7, 9, 11 and 14. To inhibit MMP-9 activity, MMP-2/9 inhibitor or MMP-9-neutralizing antibody was administered daily for 4 consecutive days from day 0-3, 6-9 or 10-13 and tissues harvested at day 14. In UUO, there was a bi-phasic early- and late-stage upregulation of MMP-9 activity. Interestingly, tubular epithelial cells (TECs) were the predominant source of MMP-9 during early stage, whereas TECs, macrophages and myofibroblasts produced MMP-9 during late-stage UUO. Early- and late-stage inhibition of MMP-9 in UUO mice significantly reduced tubular cell EMT and renal fibrosis. Moreover, MMP-9 inhibition caused a significant reduction in MMP-9-cleaved osteopontin and macrophage infiltration in UUO kidney. Our in vitro study showed MMP-9-cleaved osteopontin enhanced macrophage transwell migration and MMP-9 of both primary TEC and macrophage induced tubular cell EMT. In summary, our result suggests that MMP-9 of both TEC and macrophage origin may directly or indirectly contribute to the pathogenesis of renal fibrosis via osteopontin cleavage, which, in turn further recruit macrophage and induce tubular cell EMT. Our study also highlights the time dependency of its expression and the potential of stage-specific inhibition strategy against renal fibrosis.

A frame-invariant scheme for the geometrically exact beam using rotation vector parametrization

While frame-invariant solutions for arbitrarily large rotational deformations have been reported through the orthogonal matrix parametrization, derivation of such solutions purely through a rotation vector parametrization, which uses only three parameters and provides a parsimonious storage of rotations, is novel and constitutes the subject of this paper. In particular, we employ interpolations of relative rotations and a new rotation vector update for a strain-objective finite element formulation in the material framework. We show that the update provides either the desired rotation vector or its complement. This rules out an additive interpolation of total rotation vectors at the nodes. Hence, interpolations of relative rotation vectors are used. Through numerical examples, we show that combining the proposed update with interpolations of relative rotations yields frame-invariant and path-independent numerical solutions. Advantages of the present approach vis-a-vis the updated Lagrangian formulation are also analyzed.