953 resultados para Serres equations
Resumo:
Research on color difference evaluation has been active in recent thirty years. Several color difference formulas were developed for industrial applications. The aims of this thesis are to develop the color density which is denoted by comb g and to propose the color density based chromaticity difference formulas. Color density is derived from the discrimination ellipse parameters and color positions in the xy , xyY and CIELAB color spaces, and the color based chromaticity difference formulas are compared with the line element formulas and CIE 2000 color difference formulas. As a result of the thesis, color density represents the perceived color difference accurately, and it could be used to characterize a color by the attribute of perceived color difference from this color.
Resumo:
"Meta-estética e ética francesa do sentido" é uma análise de alguns conceitos formadores do chamado "pós-estruturalismo" e de certos aspectos de sua seqüência histórica. Através de fontes textuais de pensadores que ocupam um momento significativo da produção filosófica internacional, com Jacques Derrida, Gilles Deleuze, Michel Serres e Jean-Luc Nancy, dos anos sessenta até os noventa, o texto coloca em perspectiva conceitos nevrálgicos e estratégicos ressituados nas suas implicações críticas. A manifestação das convergências ligando os pensamentos desses quatro filósofos permite ressaltar os bastidores especulativos de uma "condição poética do pensamento" (Alain Badiou) delineando os contornos de uma meta-estética do sentido que é ao mesmo tempo uma ética. Essa fusão, bem sintetizada na fórmula de Michel Serres, que diz que "a moral é a física", é determinada pelas elaborações, as experimentações e as conquistas realizadas na filosofia derridiana da desconstrução, na filosofia deleuziana do conceito, na filosofia serresiana da física e na filosofia nancyana da arealidade. Os processos em jogo nesses sistemas tentam descobrir nos estratos aporéticos do pensamento as chances de induzir uma cosmologia paradoxal e inaudita.
Resumo:
ABSTRACT Knowledge of natural water availability, which is characterized by low flows, is essential for planning and management of water resources. One of the most widely used hydrological techniques to determine streamflow is regionalization, but the extrapolation of regionalization equations beyond the limits of sample data is not recommended. This paper proposes a new method for reducing overestimation errors associated with the extrapolation of regionalization equations for low flows. The method is based on the use of a threshold value for the maximum specific low flow discharge estimated at the gauging sites that are used in the regionalization. When a specific low flow, which has been estimated using the regionalization equation, exceeds the threshold value, the low flow can be obtained by multiplying the drainage area by the threshold value. This restriction imposes a physical limit to the low flow, which reduces the error of overestimating flows in regions of extrapolation. A case study was done in the Urucuia river basin, in Brazil, and the results showed the regionalization equation to perform positively in reducing the risk of extrapolation.
Resumo:
The three main topics of this work are independent systems and chains of word equations, parametric solutions of word equations on three unknowns, and unique decipherability in the monoid of regular languages. The most important result about independent systems is a new method giving an upper bound for their sizes in the case of three unknowns. The bound depends on the length of the shortest equation. This result has generalizations for decreasing chains and for more than three unknowns. The method also leads to shorter proofs and generalizations of some old results. Hmelevksii’s theorem states that every word equation on three unknowns has a parametric solution. We give a significantly simplified proof for this theorem. As a new result we estimate the lengths of parametric solutions and get a bound for the length of the minimal nontrivial solution and for the complexity of deciding whether such a solution exists. The unique decipherability problem asks whether given elements of some monoid form a code, that is, whether they satisfy a nontrivial equation. We give characterizations for when a collection of unary regular languages is a code. We also prove that it is undecidable whether a collection of binary regular languages is a code.
Resumo:
The behavior of Petrov-Galerkin formulations for shallow water wave equations is evaluated numerically considering typical one-dimensional propagation problems. The formulations considered here use stabilizing operators to improve classical Galerkin approaches. Their advantages and disadvantages are pointed out according to the intrinsic time scale (free parameter) which has a particular importance in this kind of problem. The influence of the Courant number and the performance of the formulation in dealing with spurious oscillations are adressed.
Resumo:
Stochastic differential equation (SDE) is a differential equation in which some of the terms and its solution are stochastic processes. SDEs play a central role in modeling physical systems like finance, Biology, Engineering, to mention some. In modeling process, the computation of the trajectories (sample paths) of solutions to SDEs is very important. However, the exact solution to a SDE is generally difficult to obtain due to non-differentiability character of realizations of the Brownian motion. There exist approximation methods of solutions of SDE. The solutions will be continuous stochastic processes that represent diffusive dynamics, a common modeling assumption for financial, Biology, physical, environmental systems. This Masters' thesis is an introduction and survey of numerical solution methods for stochastic differential equations. Standard numerical methods, local linearization methods and filtering methods are well described. We compute the root mean square errors for each method from which we propose a better numerical scheme. Stochastic differential equations can be formulated from a given ordinary differential equations. In this thesis, we describe two kind of formulations: parametric and non-parametric techniques. The formulation is based on epidemiological SEIR model. This methods have a tendency of increasing parameters in the constructed SDEs, hence, it requires more data. We compare the two techniques numerically.
Resumo:
In this thesis we examine four well-known and traditional concepts of combinatorics on words. However the contexts in which these topics are treated are not the traditional ones. More precisely, the question of avoidability is asked, for example, in terms of k-abelian squares. Two words are said to be k-abelian equivalent if they have the same number of occurrences of each factor up to length k. Consequently, k-abelian equivalence can be seen as a sharpening of abelian equivalence. This fairly new concept is discussed broader than the other topics of this thesis. The second main subject concerns the defect property. The defect theorem is a well-known result for words. We will analyze the property, for example, among the sets of 2-dimensional words, i.e., polyominoes composed of labelled unit squares. From the defect effect we move to equations. We will use a special way to define a product operation for words and then solve a few basic equations over constructed partial semigroup. We will also consider the satisfiability question and the compactness property with respect to this kind of equations. The final topic of the thesis deals with palindromes. Some finite words, including all binary words, are uniquely determined up to word isomorphism by the position and length of some of its palindromic factors. The famous Thue-Morse word has the property that for each positive integer n, there exists a factor which cannot be generated by fewer than n palindromes. We prove that in general, every non ultimately periodic word contains a factor which cannot be generated by fewer than 3 palindromes, and we obtain a classification of those binary words each of whose factors are generated by at most 3 palindromes. Surprisingly these words are related to another much studied set of words, Sturmian words.
Resumo:
Référence bibliographique : Rol, 58352
Resumo:
Référence bibliographique : Rol, 58353
Resumo:
Référence bibliographique : Rol, 58355
Resumo:
Référence bibliographique : Rol, 58356
Resumo:
Référence bibliographique : Rol, 58357
Resumo:
Référence bibliographique : Rol, 58358
