Some superstring amplitude computations with the non-minimal pure spinor formalism

We use the non-minimal pure spinor formalism to compute in a super-Poincare covariant manner the four-point massless one and two-loop open superstring amplitudes, and the gauge anomaly of the six-point one-loop amplitude. All of these amplitudes are expressed as integrals of ten-dimensional superfields in a pure spinor superspace which involves five theta coordinates covariantly contracted with three pure spinors. The bosonic contribution to these amplitudes agrees with the standard results, and we demonstrate identities which show how the t(8) and epsilon(10) tensors naturally emerge from integrals over pure spinor superspace.

SEMICLASSICAL THEORY OF MAGNETIZATION FOR A 2-DIMENSIONAL NONINTERACTING ELECTRON-GAS

We compute the semiclassical magnetization and susceptibility of non-interacting electrons, confined by a smooth two-dimensional potential and subjected to a uniform perpendicular magnetic field, in the general case when their classical motion is chaotic. It is demonstrated that the magnetization per particle m(B) is directly related to the staircase function N(E), which counts the single-particle levels up to energy E. Using Gutzwiller's trace formula for N, we derive a semiclassical expression for m. Our results show that the magnetization has a non-zero average, which arises from quantum corrections to the leading-order Weyl approximation to the mean staircase and which is independent of whether the classical motion is chaotic or not. Fluctuations about the average are due to classical periodic orbits and do represent a signature of chaos. This behaviour is confirmed by numerical computations for a specific system.

Test systems and mathematical models for transmission network expansion planning

The data of four networks that can be used in carrying out comparative studies with methods for transmission network expansion planning are given. These networks are of various types and different levels of complexity. The main mathematical formulations used in transmission expansion studies-transportation models, hybrid models, DC power flow models, and disjunctive models are also summarised and compared. The main algorithm families are reviewed-both analytical, combinatorial and heuristic approaches. Optimal solutions are not yet known for some of the four networks when more accurate models (e.g. The DC model) are used to represent the power flow equations-the state of the art with regard to this is also summarised. This should serve as a challenge to authors searching for new, more efficient methods.

A Bayesian Analysis of Spectral ARMA Model

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

Stochastic field processes in the mathematical modelling of damped transmission line vibrations

Wind-excited vibrations in the frequency range of 10 to 50 Hz due to vortex shedding often cause fatigue failures in the cables of overhead transmission lines. Damping devices, such as the Stockbridge dampers, have been in use for a long time for supressing these vibrations. The dampers are conveniently modelled by means of their driving point impedance, measured in the lab over the frequency range under consideration. The cables can be modelled as strings with additional small bending stiffness. The main problem in modelling the vibrations does however lay in the aerodynamic forces, which usually are approximated by the forces acting on a rigid cylinder in planar flow. In the present paper, the wind forces are represented by stochastic processes with arbitrary crosscorrelation in space; the case of a Kármán vortex street on a rigid cylinder in planar flow is contained as a limit case in this approach. The authors believe that this new view of the problem may yield useful results, particularly also concerning the reliability of the lines and the probability of fatigue damages. © 1987.

Theoretical approaches to forensic entomology: II. Mathematical model of larval development

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

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.

Mathematical optimisation techniques applied to power system operation and planning

Nowadays, power system operation becomes more complex because of the critical operating conditions resulting from the requirements of a market-driven operation. In this context, efficient methods for optimisation of power system operation and planning become critical to satisfy the operational (technical), financial and economic demands. Therefore, the detailed analysis of modern optimisation techniques as well as their application to the power system problems represent a relevant issue from the scientific and technological points of view. This paper presents a brief overview of the developments on modern mathematical optimisation methods applied to power system operation and planning. Copyright © 2007 Inderscience Enterprises Ltd.

Detection of highways in high resolution images using Mathematical Morphology techniques

This paper seeks to apply a routine for highways detection through the mathematical morphology tools in high resolution image. The Mathematical Morphology theory consists of describing structures geometric presents quantitatively in the image (targets or features). This explains the use of the Mathematical Morphology in this work. As high resolution images will be used, the largest difficulty in the highways detection process is the presence of trees and automobiles in the borders tracks. Like this, for the obtaining of good results through the use of morphologic tools was necessary to choose the structuring element appropriately to be used in the functions. Through the appropriate choice of the morphologic operators and structuring elements it was possible to detect the highways tracks. The linear feature detection using mathematical morphology techniques, can contribute in cartographic applications, as cartographic products updating.

Mathematical decomposition technique applied to the probabilistic power flow problem

In this paper a framework based on the decomposition of the first-order optimality conditions is described and applied to solve the Probabilistic Power Flow (PPF) problem in a coordinated but decentralized way in the context of multi-area power systems. The purpose of the decomposition framework is to solve the problem through a process of solving smaller subproblems, associated with each area of the power system, iteratively. This strategy allows the probabilistic analysis of the variables of interest, in a particular area, without explicit knowledge of network data of the other interconnected areas, being only necessary to exchange border information related to the tie-lines between areas. An efficient method for probabilistic analysis, considering uncertainty in n system loads, is applied. The proposal is to use a particular case of the point estimate method, known as Two-Point Estimate Method (TPM), rather than the traditional approach based on Monte Carlo simulation. The main feature of the TPM is that it only requires resolve 2n power flows for to obtain the behavior of any random variable. An iterative coordination algorithm between areas is also presented. This algorithm solves the Multi-Area PPF problem in a decentralized way, ensures the independent operation of each area and integrates the decomposition framework and the TPM appropriately. The IEEE RTS-96 system is used in order to show the operation and effectiveness of the proposed approach and the Monte Carlo simulations are used to validation of the results. © 2011 IEEE.

A study on automatic methods based on mathematical morphology for Martian dust devil tracks detection

This paper presents three methods for automatic detection of dust devils tracks in images of Mars. The methods are mainly based on Mathematical Morphology and results of their performance are analyzed and compared. A dataset of 21 images from the surface of Mars representative of the diversity of those track features were considered for developing, testing and evaluating our methods, confronting their outputs with ground truth images made manually. Methods 1 and 3, based on closing top-hat and path closing top-hat, respectively, showed similar mean accuracies around 90% but the time of processing was much greater for method 1 than for method 3. Method 2, based on radial closing, was the fastest but showed worse mean accuracy. Thus, this was the tiebreak factor. © 2011 Springer-Verlag.

Peirce's mathematical-logical approach to discrete collections and the premonition of continuity

According to Peirce one of the most important philosophical problems is continuity. Consequently, he set forth an innovative and peculiar approach in order to elucidate at once its mathematical and metaphysical challenges through proper non-classical logical reasoning. I will restrain my argument to the definition of the different types of discrete collections according to Peirce, with a special regard to the phenomenon called premonition of continuity (Peirce, 1976, Vol. 3, p. 87, c. 1897). © 2012 Copyright Taylor and Francis Group, LLC.

Monitoring chronic physical stress using biomarkers, performance protocols and mathematical functions to identify physiological adaptations in rats

This study was undertaken to characterize the effects of monotonous training at lactate minimum (LM) intensity on aerobic and anaerobic performances; glycogen concentrationsin the soleus muscle, the gastrocnemius muscle and the liver; and creatine kinase (CK), free fatty acids and glucose concentrations in rats. The rats were separated into trained (n =10), baseline (n = 10) and sedentary (n=10) groups. The trained group was submitted to the following: 60 min/day, 6 day/week and intensity equivalent to LM during the 12-week training period. The training volume was reduced after four weeks according to a sigmoid function. The total CK (U/L) increased in the trained group after 12 weeks (742.0±158.5) in comparison with the baseline (319.6±40.2) and the sedentary (261.6+42.2) groups. Free fatty acids and glycogen stores (liver, soleus muscle and gastrocnemius muscle) increased after 12 weeks of monotonous training but aerobic and anaerobic performances were unchanged in relation to the sedentary group. The monotonous training at LM increased the level of energy substrates, unchanged aerobic performance, reduced anaerobic capacity and increased the serum CK concentration; however, the rats did not achieve the predicted training volume.