Equações diferenciais implícitas com descontinuidade

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

The sigma-isotypic decomposition and the sigma-index of reversible-equivariant systems

This work is concerned with dynamical systems in presence of symmetries and reversing symmetries. We describe a construction process of subspaces that are invariant by linear Gamma-reversible-equivariant mappings, where Gamma is the compact Lie group of all the symmetries and reversing symmetries of such systems. These subspaces are the sigma-isotypic components, first introduced by Lamb and Roberts in (1999) [10] and that correspond to the isotypic components for purely equivariant systems. In addition, by representation theory methods derived from the topological structure of the group Gamma, two algebraic formulae are established for the computation of the sigma-index of a closed subgroup of Gamma. The results obtained here are to be applied to general reversible-equivariant systems, but are of particular interest for the more subtle of the two possible cases, namely the non-self-dual case. Some examples are presented. (C) 2011 Elsevier BM. All rights reserved.

On global linearization of planar involutions

Let phi: a"e(2) -> a"e(2) be an orientation-preserving C (1) involution such that phi(0) = 0. Let Spc(phi) = {Eigenvalues of D phi(p) | p a a"e(2)}. We prove that if Spc(phi) aS, a"e or Spc(phi) a (c) [1, 1 + epsilon) = a... for some epsilon > 0, then phi is globally C (1) conjugate to the linear involution D phi(0) via the conjugacy h = (I + D phi(0)phi)/2,where I: a"e(2) -> a"e(2) is the identity map. Similarly, we prove that if phi is an orientation-reversing C (1) involution such that phi(0) = 0 and Trace (D phi(0)D phi(p) > - 1 for all p a a"e(2), then phi is globally C (1) conjugate to the linear involution D phi(0) via the conjugacy h. Finally, we show that h may fail to be a global linearization of phi if the above conditions are not fulfilled.

Constraint qualifications in convex vector semi-infinite optimization

Convex vector (or multi-objective) semi-infinite optimization deals with the simultaneous minimization of finitely many convex scalar functions subject to infinitely many convex constraints. This paper provides characterizations of the weakly efficient, efficient and properly efficient points in terms of cones involving the data and Karush–Kuhn–Tucker conditions. The latter characterizations rely on different local and global constraint qualifications. The results in this paper generalize those obtained by the same authors on linear vector semi-infinite optimization problems.

Visualization of flow fields in the web platform

Visualization of vector fields plays an important role in research activities nowadays -- Web applications allow a fast, multi-platform and multi-device access to data, which results in the need of optimized applications to be implemented in both high-performance and low-performance devices -- Point trajectory calculation procedures usually perform repeated calculations due to the fact that several points might lie over the same trajectory -- This paper presents a new methodology to calculate point trajectories over highly-dense and uniformly-distributed grid of points in which the trajectories are forced to lie over the points in the grid -- Its advantages rely on a highly parallel computing architecture implementation and in the reduction of the computational effort to calculate the stream paths since unnecessary calculations are avoided, reusing data through iterations -- As case study, the visualization of oceanic currents through in the web platform is presented and analyzed, using WebGL as the parallel computing architecture and the rendering Application Programming Interface

The four-element Chua`s circuit

A new circuit configuration, linearly conjugate to the standard Chua`s circuit, is presented. Its distinctive feature is that the equations now admit an additional parameter, which controls the dissipation in the network connected to the Chua diode. In the limiting case we obtain the simplest chaotic circuit, consisting of a piecewise-linear resistor and three lossless elements.

Spectral properties of chaotic signals generated by the skew tent map

Chaotic signals have been considered potentially attractive in many signal processing applications ranging from wideband communication systems to cryptography and watermarking. Besides, some devices as nonlinear adaptive filters and phase-locked loops can present chaotic behavior. In this paper, we derive analytical expressions for the autocorrelation sequence, power spectral density and essential bandwidth of chaotic signals generated by the skew tent map. From these results, we suggest possible applications in communication systems. (C) 2009 Elsevier B.V. All rights reserved.

A Nonstationary Model of Newborn EEG

The detection of seizure in the newborn is a critical aspect of neurological research. Current automatic detection techniques are difficult to assess due to the problems associated with acquiring and labelling newborn electroencephalogram (EEG) data. A realistic model for newborn EEG would allow confident development, assessment and comparison of these detection techniques. This paper presents a model for newborn EEG that accounts for its self-similar and non-stationary nature. The model consists of background and seizure sub-models. The newborn EEG background model is based on the short-time power spectrum with a time-varying power law. The relationship between the fractal dimension and the power law of a power spectrum is utilized for accurate estimation of the short-time power law exponent. The newborn EEG seizure model is based on a well-known time-frequency signal model. This model addresses all significant time-frequency characteristics of newborn EEG seizure which include; multiple components or harmonics, piecewise linear instantaneous frequency laws and harmonic amplitude modulation. Estimates of the parameters of both models are shown to be random and are modelled using the data from a total of 500 background epochs and 204 seizure epochs. The newborn EEG background and seizure models are validated against real newborn EEG data using the correlation coefficient. The results show that the output of the proposed models has a higher correlation with real newborn EEG than currently accepted models (a 10% and 38% improvement for background and seizure models, respectively).

Biaxial failure model for fiber reinforced concrete

Steel fiber reinforced concrete (SFRC) is widely applied in the construction industry. Numerical elastoplastic analysis of the macroscopic behavior is complex. This typically involves a piecewise linear failure curve including corner singularities. This paper presents a single smooth biaxial failure curve for SFRC based on a semianalytical approximation. Convexity of the proposed model is guaranteed so that numerical problems are avoided. The model has sufficient flexibility to closely match experimental results. The failure curve is also suitable for modeling plain concrete under biaxial loading. Since this model is capable of simulating the failure states in all stress regimes with a single envelope, the elastoplastic formulation is very concise and simple. The finite element implementation is developed to demonstrate the conciseness and the effectiveness of the model. The computed results display good agreement with published experimental data.

A new MILP based approach for unit commitment in power production planning

This paper presents a complete, quadratic programming formulation of the standard thermal unit commitment problem in power generation planning, together with a novel iterative optimisation algorithm for its solution. The algorithm, based on a mixed-integer formulation of the problem, considers piecewise linear approximations of the quadratic fuel cost function that are dynamically updated in an iterative way, converging to the optimum; this avoids the requirement of resorting to quadratic programming, making the solution process much quicker. From extensive computational tests on a broad set of benchmark instances of this problem, the algorithm was found to be flexible and capable of easily incorporating different problem constraints. Indeed, it is able to tackle ramp constraints, which although very important in practice were rarely considered in previous publications. Most importantly, optimal solutions were obtained for several well-known benchmark instances, including instances of practical relevance, that are not yet known to have been solved to optimality. Computational experiments and their results showed that the method proposed is both simple and extremely effective.

Complete synchronization and delayed synchronization in couplings

We consider a general coupling of two identical chaotic dynamical systems, and we obtain the conditions for synchronization. We consider two types of synchronization: complete synchronization and delayed synchronization. Then, we consider four different couplings having different behaviors regarding their ability to synchronize either completely or with delay: Symmetric Linear Coupled System, Commanded Linear Coupled System, Commanded Coupled System with delay and symmetric coupled system with delay. The values of the coupling strength for which a coupling synchronizes define its Window of synchronization. We obtain analytically the Windows of complete synchronization, and we apply it for the considered couplings that admit complete synchronization. We also obtain analytically the Window of chaotic delayed synchronization for the only considered coupling that admits a chaotic delayed synchronization, the commanded coupled system with delay. At last, we use four different free chaotic dynamics (based in tent map, logistic map, three-piecewise linear map and cubic-like map) in order to observe numerically the analytically predicted windows.

Complete synchronization and delayed synchronization in couplings

We consider a general coupling of two identical chaotic dynamical systems, and we obtain the conditions for synchronization. We consider two types of synchronization: complete synchronization and delayed synchronization. Then, we consider four different couplings having different behaviors regarding their ability to synchronize either completely or with delay: Symmetric Linear Coupled System, Commanded Linear Coupled System, Commanded Coupled System with delay and symmetric coupled system with delay. The values of the coupling strength for which a coupling synchronizes define its Window of synchronization. We obtain analytically the Windows of complete synchronization, and we apply it for the considered couplings that admit complete synchronization. We also obtain analytically the Window of chaotic delayed synchronization for the only considered coupling that admits a chaotic delayed synchronization, the commanded coupled system with delay. At last, we use four different free chaotic dynamics (based in tent map, logistic map, three-piecewise linear map and cubic-like map) in order to observe numerically the analytically predicted windows.

Experimental and numerical approaches for structural assessment in new footbridge designs (SFRSCC–GFPR hybrid structure)

Within the civil engineering field, the use of the Finite Element Method has acquired a significant importance, since numerical simulations have been employed in a broad field, which encloses the design, analysis and prediction of the structural behaviour of constructions and infrastructures. Nevertheless, these mathematical simulations can only be useful if all the mechanical properties of the materials, boundary conditions and damages are properly modelled. Therefore, it is required not only experimental data (static and/or dynamic tests) to provide references parameters, but also robust calibration methods able to model damage or other special structural conditions. The present paper addresses the model calibration of a footbridge bridge tested with static loads and ambient vibrations. Damage assessment was also carried out based on a hybrid numerical procedure, which combines discrete damage functions with sets of piecewise linear damage functions. Results from the model calibration shows that the model reproduces with good accuracy the experimental behaviour of the bridge.

Inverse Problems for multiple invariant curves

Planar polynomial vector fields which admit invariant algebraic curves, Darboux integrating factors or Darboux first integrals are of special interest. In the present paper we solve the inverse problem for invariant algebraic curves with a given multiplicity and for integrating factors, under generic assumptions regarding the (multiple) invariant algebraic curves involved. In particular we prove, in this generic scenario, that the existence of a Darboux integrating factor implies Darboux integrability. Furthermore we construct examples where the genericity assumption does not hold and indicate that the situation is different for these.

Renormalization and α-limit set for expanding Lorenz maps

We establish a one-to-one correspondence between the renormalizations and proper totally invariant closed sets (i.e., α-limit sets) of expanding Lorenz map, which enable us to distinguish periodic and non-periodic renormalizations. We describe the minimal renormalization by constructing the minimal totally invariant closed set, so that we can define the renormalization operator. Using consecutive renormalizations, we obtain complete topological characteriza- tion of α-limit sets and nonwandering set decomposition. For piecewise linear Lorenz map with slopes ≥ 1, we show that each renormalization is periodic and every proper α-limit set is countable.