Tachyon condensation in superstring field theory

It has been conjectured that at the stationary point of the tachyon potential for the D-brane-anti-D-brane pair or for the non-BPS D-brane of superstring theories, the negative energy density cancels the brane tensions. We study this conjecture using a Wess-Zumino-Witten-like open superstring field theory free of contact term divergences and recently shown to give 60% of the vacuum energy by condensation of the tachyon field alone. While the action is non-polynomial, the multiscalar tachyon potential to any fixed level involves only a finite number of interactions. We compute this potential to level three, obtaining 85% of the expected vacuum energy, a result consistent with convergence that can also be viewed as a successful test of the string field theory. The resulting effective tachyon potential is bounded below and has two degenerate global minima. We calculate the energy density of the kink solution interpolating between these minima finding good agreement with the tension of the D-brane of one lower dimension. © 2000 Elsevier Science B.V.

Jacobi script v sign-functions and discrete Fourier transforms

Properties of the Jacobi script v sign3-function and its derivatives under discrete Fourier transforms are investigated, and several interesting results are obtained. The role of modulo N equivalence classes in the theory of script v sign-functions is stressed. An important conjecture is studied. © 2006 American Institute of Physics.

Discrete-time sliding mode control of input-delay systems applied on a power generation system

This paper presents two discrete sliding mode control (SMC) design. The first one is a discrete-time SMC design that doesn't take into account the time-delay. The second one is a discrete-time SMC design, which takes in consideration the time-delay. The proposed techniques aim at the accomplishment simplicity and robustness for an uncertainty class. Simulations results are shown and the effectiveness of the used techniques is analyzed. © 2006 IEEE.

3-Dimensional hopf bifurcation via averaging theory

We consider the Lorenz system ẋ = σ(y - x), ẏ = rx - y - xz and ż = -bz + xy; and the Rössler system ẋ = -(y + z), ẏ = x + ay and ż = b - cz + xz. Here, we study the Hopf bifurcation which takes place at q± = (±√br - b,±√br - b, r - 1), in the Lorenz case, and at s± = (c+√c2-4ab/2, -c+√c2-4ab/2a, c±√c2-4ab/2a) in the Rössler case. As usual this Hopf bifurcation is in the sense that an one-parameter family in ε of limit cycles bifurcates from the singular point when ε = 0. Moreover, we can determine the kind of stability of these limit cycles. In fact, for both systems we can prove that all the bifurcated limit cycles in a neighborhood of the singular point are either a local attractor, or a local repeller, or they have two invariant manifolds, one stable and the other unstable, which locally are formed by two 2-dimensional cylinders. These results are proved using averaging theory. The method of studying the Hopf bifurcation using the averaging theory is relatively general and can be applied to other 3- or n-dimensional differential systems.

Classification of masses in mammographic image using wavelet domain features and polynomial classifier

Breast cancer is the most common cancer among women. In CAD systems, several studies have investigated the use of wavelet transform as a multiresolution analysis tool for texture analysis and could be interpreted as inputs to a classifier. In classification, polynomial classifier has been used due to the advantages of providing only one model for optimal separation of classes and to consider this as the solution of the problem. In this paper, a system is proposed for texture analysis and classification of lesions in mammographic images. Multiresolution analysis features were extracted from the region of interest of a given image. These features were computed based on three different wavelet functions, Daubechies 8, Symlet 8 and bi-orthogonal 3.7. For classification, we used the polynomial classification algorithm to define the mammogram images as normal or abnormal. We also made a comparison with other artificial intelligence algorithms (Decision Tree, SVM, K-NN). A Receiver Operating Characteristics (ROC) curve is used to evaluate the performance of the proposed system. Our system is evaluated using 360 digitized mammograms from DDSM database and the result shows that the algorithm has an area under the ROC curve Az of 0.98 ± 0.03. The performance of the polynomial classifier has proved to be better in comparison to other classification algorithms. © 2013 Elsevier Ltd. All rights reserved.

Equivalent representation of mutual coupling in transmission lines by discrete element

This paper describes a computational model based on lumped elements for the mutual coupling between phases in transmission lines without the explicit use of modal transformation matrices. The self and mutual parameters and the coupling between phases are modeled using modal transformation techniques. The modal representation is developed from the intrinsic consideration of the modal transformation matrix and the resulting system of time-domain differential equations is described as state equations. Thus, a detailed profile ofthe currents and the voltages through the line can be easily calculated using numerical or analytical integration methods. However, the original contribution of the article is the proposal of a time-domain model without the successive phase/mode transformations and a practical implementation based on conventional electrical circuits, without the use of electromagnetic theory to model the coupling between phases. © 2003-2012 IEEE.

Limit Cycles for a Class of Continuous and Discontinuous Cubic Polynomial Differential Systems

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

Limit cycles of cubic polynomial differential systems with rational first integrals of degree 2

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

A new transmission model in cognitive radio based on cyclic generalized polynomial codes for bandwidth reduction

The frequency spectrums are inefficiently utilized and cognitive radio has been proposed for full utilization of these spectrums. The central idea of cognitive radio is to allow the secondary user to use the spectrum concurrently with the primary user with the compulsion of minimum interference. However, designing a model with minimum interference is a challenging task. In this paper, a transmission model based on cyclic generalized polynomial codes discussed in [2] and [15], is proposed for the improvement in utilization of spectrum. The proposed model assures a non interference data transmission of the primary and secondary users. Furthermore, analytical results are presented to show that the proposed model utilizes spectrum more efficiently as compared to traditional models.

Characterization of the nonlinear behavior of a F-16 aircraft using discrete-time Volterra series

The linearity assumption in the structural dynamics analysis is a severe practical limitation. Further, in the investigation of mechanisms presented in fighter aircrafts, as for instance aeroelastic nonlinearity, friction or gaps in wing-load-payload mounting interfaces, is mandatory to use a nonlinear analysis technique. Among different approaches that can be used to this matter, the Volterra theory is an interesting strategy, since it is a generalization of the linear convolution. It represents the response of a nonlinear system as a sum of linear and nonlinear components. Thus, this paper aims to use the discrete-time version of Volterra series expanded with Kautz filters to characterize the nonlinear dynamics of a F-16 aircraft. To illustrate the approach, it is identified and characterized a non-parametric model using the data obtained during a ground vibration test performed in a F-16 wing-to-payload mounting interfaces. Several amplitude inputs applied in two shakers are used to show softening nonlinearities presented in the acceleration data. The results obtained in the analysis have shown the capability of the Volterra series to give some insight about the nonlinear dynamics of the F-16 mounting interfaces. The biggest advantage of this approach is to separate the linear and nonlinear contributions through the multiple convolutions through the Volterra kernels.

Representation of transmission lines: comparison of models and parameters distributed discrete parameters

A transmission line is characterized by the fact that its parameters are distributed along its length. This fact makes the voltages and currents along the line to behave like waves and these are described by differential equations. In general, the differential equations mentioned are difficult to solve in the time domain, due to the convolution integral, but in the frequency domain these equations become simpler and their solutions are known. The transmission line can be represented by a cascade of π circuits. This model has the advantage of being developed directly in the time domain, but there is a need to apply numerical integration methods. In this work a comparison of the model that considers the fact that the parameters are distributed (Universal Line Model) and the fact that the parameters considered concentrated along the line (π circuit model) using the trapezoidal integration method, and Simpson's rule Runge-Kutta in a single-phase transmission line length of 100 km subjected to an operation power. © 2003-2012 IEEE.

Connections between the Sznajd model with general confidence rules and graph theory

The Sznajd model is a sociophysics model that is used to model opinion propagation and consensus formation in societies. Its main feature is that its rules favor bigger groups of agreeing people. In a previous work, we generalized the bounded confidence rule in order to model biases and prejudices in discrete opinion models. In that work, we applied this modification to the Sznajd model and presented some preliminary results. The present work extends what we did in that paper. We present results linking many of the properties of the mean-field fixed points, with only a few qualitative aspects of the confidence rule (the biases and prejudices modeled), finding an interesting connection with graph theory problems. More precisely, we link the existence of fixed points with the notion of strongly connected graphs and the stability of fixed points with the problem of finding the maximal independent sets of a graph. We state these results and present comparisons between the mean field and simulations in Barabasi-Albert networks, followed by the main mathematical ideas and appendices with the rigorous proofs of our claims and some graph theory concepts, together with examples. We also show that there is no qualitative difference in the mean-field results if we require that a group of size q > 2, instead of a pair, of agreeing agents be formed before they attempt to convince other sites (for the mean field, this would coincide with the q-voter model).

A rationale for long-lived quarks and leptons at the LHC: low energy flavour theory

In the framework of gauged flavour symmetries, new fermions in parity symmetric representations of the standard model are generically needed for the compensation of mixed anomalies. The key point is that their masses are also protected by flavour symmetries and some of them are expected to lie way below the flavour symmetry breaking scale(s), which has to occur many orders of magnitude above the electroweak scale to be compatible with the available data from flavour changing neutral currents and CP violation experiments. We argue that, actually, some of these fermions would plausibly get masses within the LHC range. If they are taken to be heavy quarks and leptons, in (bi)-fundamental representations of the standard model symmetries, their mixings with the light ones are strongly constrained to be very small by electroweak precision data. The alternative chosen here is to exactly forbid such mixings by breaking of flavour symmetries into an exact discrete symmetry, the so-called proton-hexality, primarily suggested to avoid proton decay. As a consequence of the large value needed for the flavour breaking scale, those heavy particles are long-lived and rather appropriate for the current and future searches at the LHC for quasi-stable hadrons and leptons. In fact, the LHC experiments have already started to look for them.

A graded subring of an inverse limit of polynomial rings

We study the power series ring R= K[[x1,x2,x3,...]]on countably infinitely many variables, over a field K, and two particular K-subalgebras of it: the ring S, which is isomorphic to an inverse limit of the polynomial rings in finitely many variables over K, and the ring R', which is the largest graded subalgebra of R. Of particular interest are the homogeneous, finitely generated ideals in R', among them the generic ideals. The definition of S as an inverse limit yields a set of truncation homomorphisms from S to K[x1,...,xn] which restrict to R'. We have that the truncation of a generic I in R' is a generic ideal in K[x1,...,xn]. It is shown in Initial ideals of Truncated Homogeneous Ideals that the initial ideal of such an ideal converge to the initial ideal of the corresponding ideal in R'. This initial ideal need no longer be finitely generated, but it is always locally finitely generated: this is proved in Gröbner Bases in R'. We show in Reverse lexicographic initial ideals of generic ideals are finitely generated that the initial ideal of a generic ideal in R' is finitely generated. This contrast to the lexicographic term order. If I in R' is a homogeneous, locally finitely generated ideal, and if we write the Hilbert series of the truncated algebras K[x1,...,xn] module the truncation of I as qn(t)/(1-t)n, then we show in Generalized Hilbert Numerators that the qn's converge to a power series in t which we call the generalized Hilbert numerator of the algebra R'/I. In Gröbner bases for non-homogeneous ideals in R' we show that the calculations of Gröbner bases and initial ideals in R' can be done also for some non-homogeneous ideals, namely those which have an associated homogeneous ideal which is locally finitely generated. The fact that S is an inverse limit of polynomial rings, which are naturally endowed with the discrete topology, provides S with a topology which makes it into a complete Hausdorff topological ring. The ring R', with the subspace topology, is dense in R, and the latter ring is the Cauchy completion of the former. In Topological properties of R' we show that with respect to this topology, locally finitely generated ideals in R'are closed.

Discrete Event Systems based Design Patterns for Diagnosability Analysis of Automated Manufacturing Systems

The main goal of this thesis is to facilitate the process of industrial automated systems development applying formal methods to ensure the reliability of systems. A new formulation of distributed diagnosability problem in terms of Discrete Event Systems theory and automata framework is presented, which is then used to enforce the desired property of the system, rather then just verifying it. This approach tackles the state explosion problem with modeling patterns and new algorithms, aimed for verification of diagnosability property in the context of the distributed diagnosability problem. The concepts are validated with a newly developed software tool.