964 resultados para Discrete function theory
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Some problems of Calculus of Variations do not have solutions in the class of classic continuous and smooth arcs. This suggests the need of a relaxation or extension of the problem ensuring the existence of a solution in some enlarged class of arcs. This work aims at the development of an extension for a more general optimal control problem with nonlinear control dynamics in which the control function takes values in some closed, but not necessarily bounded, set. To achieve this goal, we exploit the approach of R.V. Gamkrelidze based on the generalized controls, but related to discontinuous arcs. This leads to the notion of generalized impulsive control. The proposed extension links various approaches on the issue of extension found in the literature.
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Pós-graduação em Física - IFT
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
We consider a N - S box system consisting of a rectangular conductor coupled to a superconductor. The Green functions are constructed by solving the Bogoliubov-de Gennes equations at each side of the interface, with the pairing potential described by a step-like function. Taking into account the mismatch in the Fermi wave number and the effective masses of the normal metal - superconductor and the tunnel barrier at the interface, we use the quantum section method in order to find the exact energy Green function yielding accurate computed eigenvalues and the density of states. Furthermore, this procedure allow us to analyze in detail the nontrivial semiclassical limit and examine the range of applicability of the Bohr-Sommerfeld quantization method.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
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.
Resumo:
A radial basis function network (RBFN) circuit for function approximation is presented. Simulation and experimental results show that the network has good approximation capabilities. The RBFN was a squared hyperbolic secant with three adjustable parameters amplitude, width and center. To test the network a sinusoidal and sine function,vas approximated.
Resumo:
Function approximation is a very important task in environments where the computation has to be based on extracting information from data samples in real world processes. So, the development of new mathematical model is a very important activity to guarantee the evolution of the function approximation area. In this sense, we will present the Polynomials Powers of Sigmoid (PPS) as a linear neural network. In this paper, we will introduce one series of practical results for the Polynomials Powers of Sigmoid, where we will show some advantages of the use of the powers of sigmiod functions in relationship the traditional MLP-Backpropagation and Polynomials in functions approximation problems.
Resumo:
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.
Resumo:
Pós-graduação em Física - IFT
Resumo:
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).