• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 29
  • 24
  • 2
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 64
  • 14
  • 13
  • 10
  • 9
  • 8
  • 7
  • 6
  • 6
  • 6
  • 6
  • 6
  • 6
  • 6
  • 5
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
51

Lehmer Numbers with at Least 2 Primitive Divisors

Juricevic, Robert January 2007 (has links)
In 1878, Lucas \cite{lucas} investigated the sequences $(\ell_n)_{n=0}^\infty$ where $$\ell_n=\frac{\alpha^n-\beta^n}{\alpha-\beta},$$ $\alpha \beta$ and $\alpha+\beta$ are coprime integers, and where $\beta/\alpha$ is not a root of unity. Lucas sequences are divisibility sequences; if $m|n$, then $\ell_m|\ell_n$, and more generally, $\gcd(\ell_m,\ell_n)=\ell_{\gcd(m,n)}$ for all positive integers $m$ and $n$. Matijasevic utilised this divisibility property of Lucas sequences in order to resolve Hilbert's 10th problem. \noindent In 1930, Lehmer \cite{lehmer} introduced the sequences $(u_n)_{n=0}^\infty$ where \begin{eqnarray*} u_n& = & \frac{\alpha^{n}-\beta^n}{\alpha^{\epsilon(n)}-\beta^{\epsilon(n)}},\\ \epsilon(n)&=&\left\{\begin{array}{ll} 1, \hspace{.1in}\mbox{if}\hspace{.1in}n\equiv 1 \pmod 2;\\ 2, \hspace{.1in}\mbox{if}\hspace{.1in}n\equiv 0\pmod 2;\end{array}\right. \end{eqnarray*} $\alpha \beta$ and $(\alpha +\beta)^2$ are coprime integers, and where $\beta/\alpha$ is not a root of unity. The sequences $(u_n)_{n=0}^\infty$ are known as Lehmer sequences, and the terms of these sequences are known as Lehmer numbers. Lehmer showed that his sequences had similar divisibility properties to those of Lucas sequences, and he used them to extend the Lucas test for primality. \noindent We define a prime divisor $p$ of $u_n$ to be a primitive divisor of $u_n$ if $p$ does not divide $$(\alpha^2-\beta^2)^2u_3\cdots u_{n-1}.$$ Note that in the list of prime factors of the first $n-1$ terms of the sequence $(u_n)_{n=0}^\infty$, a primitive divisor of $u_n$ is a new prime factor. \noindent We let \begin{eqnarray*} \kappa& = & k(\alpha \beta\max\{(\alpha-\beta)^2,(\alpha+\beta)^2\}),\\ \eta & = & \left\{\begin{array}{ll}1\hspace{.1in}\mbox{if}\hspace{.1in}\kappa\equiv 1\pmod 4,\\ 2\hspace{.1in}\mbox{otherwise},\end{array}\right. \end{eqnarray*} where $k(\alpha \beta \max\{(\alpha-\beta)^2,(\alpha+\beta)^2\})$ is the squarefree kernel of $\alpha \beta \max\{(\alpha-\beta)^2,(\alpha+\beta)^2\}$. On the one hand, building on the work of Schinzel \cite{schinzelI}, we prove that if $n>4$, $n\neq 6$, $n/(\eta \kappa)$ is an odd integer, and the triple $(n,\alpha,\beta)$, in case $(\alpha-\beta)^2>0$, is not equivalent to a triple $(n,\alpha,\beta)$ from an explicit table, then the $n$th Lehmer number $u_n$ has at least two primitive divisors. Moreover, we prove that if $n\geq 1.2\times 10^{10}$, and $n/(\eta \kappa)$ is an odd integer, then the $n$th Lehmer number $u_n$ has at least two primitive divisors. On the other hand, building on the work of Stewart \cite{stewart77}, we prove that there are only finitely many triples $(n,\alpha,\beta)$, where $n>6$, $n\neq 12$, and $n/(\eta \kappa)$ is an odd integer, such that the $n$th Lehmer number $u_n$ has less than two primitive divisors, and that these triples may be explicitly determined. We determine all of these triples $(n,\alpha,\beta)$ up to equivalence explicitly when $6<n\leq 30$, $n\neq 12$, and $n/(\eta \kappa)$ is an odd integer, and we tabulate the triples $(n,\alpha,\beta)$ we discovered, up to equivalence, for $30<n\leq 500$. Finally, we show that the conditions $n>6$, $n\neq 12$, are best possible, subject to the truth of two plausible conjectures.
52

Otimização de um modelo de propagação com múltiplos obstáculos na troposfera utilizando algoritmo genético / Otimization of a propagation model with multiple obstacles on troposphere using genetic algorithms

Vilanova, Antonio Carlos 01 February 2013 (has links)
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / This thesis presents an evaluation methodology to optimize parameters in a model of propagation of electromagnetic waves in the troposphere. The propagation model is based on parabolic equations solved by Split-Step Fourier. This propagation model shows good efficiency and rough terrain situations where the refractivity varies with distance. The search for optimal parameters in models involving electromagnetic waves requires a large computational cost, especially in large search spaces. Aiming to reduce the computational cost in determining the parameter values that maximize the field strength at a given position of the observer was developed an application called EP-AG. The application has two main modules. The first is the propagation module that estimates the value of the electric field in the area of a given terrain irregularities and varying with the refractivity with distance. The second is the optimization module which finds the optimum antenna height and frequency of operation that lead the field to the maximum value of the land in a certain position. Initially performed only the propagation module using different profiles of land and refractivity. The results shown by contours and profile field shown the efficiency of the model. Subsequently to evaluate the optimization by genetic algorithms were used two different settings as well as the irregularity of the terrain, refractivity profile and size of the search space. In each of these settings picked up a point observation in which the value of the electric field served as a metric for comparison. At this point, we determined the optimal values of the parameters by the brute force method and the genetic algorithm optimization. The results showed that for small search spaces virtually no reduction of the computational cost, however for large search spaces, the decrease was very significant and relative errors much smaller than those obtained by the method of brute force. / Esta tese apresenta uma avaliação metodológica para otimizar parâmetros em um modelo de propagação de ondas eletromagnéticas na troposfera. O modelo de propagação é baseado em equações parabólicas resolvidas pelo Divisor de Passos de Fourier. Esse modelo de propagação apresenta boa eficiência em terrenos irregulares e situações em que a refratividade varia com a distância. A busca de parâmetros ótimos em modelos que envolvem ondas eletromagnéticas demanda um grande custo computacional, principalmente em grandes espaços de busca. Com o objetivo de diminuir o custo computacional na determinação dos valores dos parâmetros que maximizem a intensidade de campo em uma determinada posição do observador, foi desenvolvido um aplicativo denominado EP-AG. O aplicativo possui dois módulos principais. O primeiro é o módulo de propagação, que estima o valor do campo elétrico na área de um determinado terreno com irregularidades e com a refratividade variando com a distância. O segundo é o módulo de otimização, que encontra o valor ótimo da altura da antena e da frequência de operação que levam o campo ao valor máximo em determinada posição do terreno. Inicialmente, executou-se apenas o módulo de propagação utilizando diferentes perfis de terrenos e de refratividade. Os resultados apresentados através de contornos e de perfis de campo mostraram a eficiência do modelo. Posteriormente, para avaliar a otimização por algoritmos genéticos, foram utilizadas duas configurações bem diferentes quanto à irregularidade do terreno, perfil de refratividade e tamanho de espaço de busca. Em cada uma dessas configurações, escolheu-se um ponto observação no qual o valor do campo elétrico serviu de métrica para comparação. Nesse ponto, determinou-se os valores ótimos dos parâmetros pelo método da força bruta e pela otimização por algoritmo genético. Os resultados mostraram que, para pequenos espaços de busca, praticamente não houve redução do custo computacional, porém, para grandes espaços de busca, a redução foi muito significativa e com erros relativos bem menores do que os obtidos pelo método da força bruta. / Doutor em Ciências
53

Annuity Divisors

Helmersson, Madeleine January 2017 (has links)
This paper studies the differences and similarities between the discrete annuity divisor of the income pension compared to the continuous annuity divisor of the premium pension in Sweden. First discrete and continuous annuity divisors are compared and found to be equivalent given the same underlying mortality. The income divisor is based on observed mortality in a period setting while the premium divisor which is based on projected mortality in a cohort setting. The expected performance of the two methods is studied by constructing prediction intervals based on Lee-Carter models with either a Binomial or Poisson distribution. Prediction intervals are constructed using either residual bootstrap or parametric bootstrap. The premium annuity divisor is found to outperform the income annuity divisor, there is a large risk that the latter underestimates the future mortality. / Den här uppsatsen studerar skillnader och likheter mellan inkomstpensionens diskreta delningstal och premiepensionens kontinuerliga delningstal i Sverige. Först jämförs diskreta och kontinuerliga delningstal och finns vara likvärdiga när de baseras på samma dödlighet. Inkomstpensionens delningstal är baserad på observerad period-dödlighet medan premiepensionens delningstal är baserad på projekterad kohort-dödlighet. Prediktionsintervall används för att skatta hur bra de två metoderna är. Med hjälp av Lee-Carter-modellen baserad på antingen poissonfördelning eller binomialfördelning konstrueras prediktionsintervall. Bootstrap, antingen parametrisk eller baserad på residualerna, används för att skapa prediktionsintervallen. Premiumpensionens delningstal stämmer väl överens med prediktionsintervallen medan det för inkomstpensionens delningstal finns en stor risk att framtida dödlighet underskattas.
54

Non-selfadjoint operator functions

Torshage, Axel January 2017 (has links)
Spectral properties of linear operators and operator functions can be used to analyze models in nature. When dispersion and damping are taken into account, the dependence of the spectral parameter is in general non-linear and the operators are not selfadjoint. In this thesis non-selfadjoint operator functions are studied and several methods for obtaining properties of unbounded non-selfadjoint operator functions are presented. Equivalence is used to characterize operator functions since two equivalent operators share many significant characteristics such as the spectrum and closeness. Methods of linearization and other types of equivalences are presented for a class of unbounded operator matrix functions. To study properties of the spectrum for non-selfadjoint operator functions, the numerical range is a powerful tool. The thesis introduces an optimal enclosure of the numerical range of a class of unbounded operator functions. The new enclosure can be computed explicitly, and it is investigated in detail. Many properties of the numerical range such as the number of components can be deduced from the enclosure. Furthermore, it is utilized to prove the existence of an infinite number of eigenvalues accumulating to specific points in the complex plane. Among the results are proofs of accumulation of eigenvalues to the singularities of a class of unbounded rational operator functions. The enclosure of the numerical range is also used to find optimal and computable estimates of the norm of resolvent and a corresponding enclosure of the ε-pseudospectrum.
55

El acoplador direccional en cristales fotónicos planares

Cuesta Soto, Francisco 07 May 2008 (has links)
La denominada sociedad de la información en la que nos encontramos actualmente ha sido posible gracias a la revolución tecnológica derivada del desarrollo espectacular de la microelectrónica desde hace poco más de medio siglo. Desde la aparición del transistor como componente básico la evolución tecnológica ha seguido una trayectoria de miniaturización considerable. El número de componentes que pueden ser insertados en un chip se ha doblado cada 18 meses según las predicciones que en los años setenta realizó G. Moore. En la actualidad se ha llegado a una frontera tecnológica de escala nanométrica donde se han originado graves problemas, derivados de la alta integración, que han frenado este ritmo de evolución. Con vistas a la superación de los problemas surgidos en la microelectrónica se ha venido proponiendo el empleo de los fotones, más rápidos y con menos disipación de energía, para continuar el desarrollo tecnológico. Avances en esta dirección favorecerían el desarrollo de las redes ópticas dentro del campo de las telecomunicaciones al dotarlas de funcionalidades que permitan eliminar los "cuellos de botella" generados en los conversores optoelectrónicos. Además hay otros campos de investigación que se verían beneficiados como por ejemplo la computación o los sensores fotónicos. Surge un complejo y vasto campo conocido como la Nanofotónica. En esta tesis se estudian los cristales fotónicos planares como una de las tecnologías incluidas dentro del campo de la Nanofotónica. Concretamente se estudia la implementación de un acoplador direccional en cristales fotónicos. Esta estructura es básica en todo tipo de aplicaciones ya que permite la implementación de funcionalidades básicas tan importantes como son los divisores de potencia, multiplexores y demultiplexores, interferómetros Mach-Zehnder o incluso conmutadores. A lo largo de toda la tesis se abordan temas que van desde el modelado de las estructuras de cristal fotónico y el diseño teórico del acoplador direcci / Cuesta Soto, F. (2007). El acoplador direccional en cristales fotónicos planares [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/2004 / Palancia
56

Hypereliptické křivky a jejich aplikace v kryptografii / Hyperelliptic curves and their application in cryptography

Perzynová, Kateřina January 2010 (has links)
Cílem této práce je zpracovat úvod do problematiky hypereliptických křivek s důrazem na konečná pole. T práci je dále popsán úvod do teorie divizorů na hypereliptických křivkách, jejich reprezentace, aritmetika nad divizory a jejich využití v kryptografii. Teorie je hojně demonstrována příklady a výpočty v systému Mathematica.
57

Eigenvalues of Matrices and Graphs

Thüne, Mario 27 February 2013 (has links)
The interplay between spectrum and structure of graphs is the recurring theme of the three more or less independent chapters of this thesis. The first chapter provides a method to relate the eigensolutions of two matrices, one being the principal submatrix of the other, via an arbitrary annihilating polynomial. This is extended to lambda-matrices and to matrices the entries of which are rational functions in one variable. The extension may be interpreted as a possible generalization of other known techniques which aim at reducing the size of a matrix while preserving the spectral information. Several aspects of an application in order to reduce the computational costs of ordinary eigenvalue problems are discussed. The second chapter considers the straightforward extension of the well known concept of equitable partitions to weighted graphs, i.e. complex matrices. It provides a method to divide the eigenproblem into smaller parts corresponding to the front divisor and its complementary factor in an easy and stable way with complexity which is only quadratic in matrix size. The exploitation of several equitable partitions ordered by refinement is discussed and a suggestion is made that preserves hermiticity if present. Some generalizations of equitable partitions are considered and a basic procedure for finding an equitable partition of complex matrices is given. The third chapter deals with isospectral and unitary equivalent graphs. It introduces a construction for unitary equivalent graphs which contains the well known GM-switching as a special case. It also considers an algebra of graph matrices generated by the adjacency matrix that corresponds to the 1-dimensional Weisfeiler-Lehman stabilizer in a way that mimics the correspondence of the coherent closure and the 2-dimensional Weisfeiler-Lehman stabilizer. The algebra contains the degree matrix, the (combinatorial, signless and normalized) Laplacian and the Seidel matrix. An easy construction produces graph pairs that are simultaneously unitary equivalent w.r.t. that algebra.
58

Content Algebras and Zero-Divisors / Inhaltsalgebren und Nullteiler

Nasehpour, Peyman 10 February 2011 (has links)
This thesis concerns two topics. The first topic, that is related to the Dedekind-Mertens Lemma, the notion of the so-called content algebra, is discussed in chapter 2. Let $R$ be a commutative ring with identity and $M$ be a unitary $R$-module and $c$ the function from $M$ to the ideals of $R$ defined by $c(x) = \cap \lbrace I \colon I \text{~is an ideal of~} R \text{~and~} x \in IM \rbrace $. $M$ is said to be a \textit{content} $R$-module if $x \in c(x)M $, for all $x \in M$. The $R$-algebra $B$ is called a \textit{content} $R$-algebra, if it is a faithfully flat and content $R$-module and it satisfies the Dedekind-Mertens content formula. In chapter 2, it is proved that in content extensions, minimal primes extend to minimal primes, and zero-divisors of a content algebra over a ring which has Property (A) or whose set of zero-divisors is a finite union of prime ideals are discussed. The preservation of diameter of zero-divisor graph under content extensions is also examined. Gaussian and Armendariz algebras and localization of content algebras at the multiplicatively closed set $S^ \prime = \lbrace f \in B \colon c(f) = R \rbrace$ are considered as well. In chapter 3, the second topic of the thesis, that is about the grade of the zero-divisor modules, is discussed. Let $R$ be a commutative ring, $I$ a finitely generated ideal of $R$, and $M$ a zero-divisor $R$-module. It is shown that the $M$-grade of $I$ defined by the Koszul complex is consistent with the definition of $M$-grade of $I$ defined by the length of maximal $M$-sequences in I$. Chapter 1 is a preliminarily chapter and dedicated to the introduction of content modules and also locally Nakayama modules.
59

Effective divisors on moduli spaces of pointed stable curves

Müller, Fabian 19 December 2013 (has links)
Diese Arbeit untersucht verschiedene Fragen hinsichtlich der birationalen Geometrie der Modulräume $\Mbar_g$ und $\Mbar_{g,n}$, mit besonderem Augenmerk auf der Berechnung effektiver Divisorklassen. In Kapitel 2 definieren wir für jedes $n$-Tupel ganzer Zahlen $\d$, die sich zu $g-1$ summieren, einen geometrisch bedeutsamen Divisor auf $\Mbar_{g,n}$, der durch Zurückziehen des Thetadivisors einer universellen Jacobi-Varietät mittels einer Abel-Jacobi-Abbildung erhalten wird. Er ist eine Verallgemeinerung verschiedener in der Literatur verwendeten Arten von Divisoren. Wir berechnen die Klasse dieses Divisors und zeigen, dass er für bestimmte $\d$ irreduzibel und extremal im effektiven Kegel von $\Mbar_{g,n}$ ist. Kapitel 3 beschäftigt sich mit einem birationalen Modell $X_6$ von $\Mbar_6$, das durch quadrische Hyperebenenschnitte auf der del-Pezzo-Fläche vom Grad $5$ erhalten wird. Wir berechnen die Klasse des großen Divisors, der die birationale Abbildung $\Mbar_6 \dashrightarrow X_6$ induziert, und erhalten so eine obere Schranke an die bewegliche Steigung von $\Mbar_6$. Wir zeigen, dass $X_6$ der letzte nicht-triviale Raum im log-minimalen Modellprogramm für $\Mbar_6$ ist. Weiterhin geben wir einige Resultate bezüglich der Unirationalität der Weierstraßorte auf $\Mbar_{g,1}$. Für $g = 6$ hängen diese mit der del-Pezzo-Konstruktion zusammen, die benutzt wurde, um das Modell $X_6$ zu konstruieren. Kapitel 4 konzentriert sich auf den Fall $g = 0$. Castravet and Tevelev führten auf $\Mbar_{0,n}$ kombinatorisch definierte Hyperbaumdivisoren ein, die für $n = 6$ zusammen mit den Randdivisoren den effektiven Kegel erzeugen. Wir berechnen die Klasse des Hyperbaumdivisors auf $\Mbar_{0,7}$, der bis auf Permutation der markierten Punkte eindeutig ist. Wir geben eine geometrische Charakterisierung für ihn an, die zu der von Keel und Vermeire für den Fall $n = 6$ gegebenen analog ist. / This thesis investigates various questions concerning the birational geometry of the moduli spaces $\Mbar_g$ and $\Mbar_{g,n}$, with a focus on the computation of effective divisor classes. In Chapter 2 we define, for any $n$-tuple $\d$ of integers summing up to $g-1$, a geometrically meaningful divisor on $\Mbar_{g,n}$ that is essentially the pullback of the theta divisor on a universal Jacobian variety under an Abel-Jacobi map. It is a generalization of various kinds of divisors used in the literature, for example by Logan to show that $\Mbar_{g,n}$ is of general type for all $g \geq 4$ as soon as $n$ is big enough. We compute the class of this divisor and show that for certain choices of $\d$ it is irreducible and extremal in the effective cone of $\Mbar_{g,n}$. Chapter 3 deals with a birational model $X_6$ of $\Mbar_6$ that is obtained by taking quadric hyperplane sections of the degree $5$ del Pezzo surface. We compute the class of the big divisor inducing the birational map $\Mbar_6 \dashrightarrow X_6$ and use it to derive an upper bound on the moving slope of $\Mbar_6$. Furthermore we show that $X_6$ is the final non-trivial space in the log minimal model program for $\Mbar_6$. We also give a few results on the unirationality of Weierstraß loci on $\Mbar_{g,1}$, which for $g = 6$ are related to the del Pezzo construction used to construct the model $X_6$. Finally, Chapter 4 focuses on the case $g = 0$. Castravet and Tevelev introduced combinatorially defined hypertree divisors on $\Mbar_{0,n}$ that for $n = 6$ generate the effective cone together with boundary divisors. We compute the class of the hypertree divisor on $\Mbar_{0,7}$, which is unique up to permutation of the marked points. We also give a geometric characterization of it that is analogous to the one given by Keel and Vermeire in the $n = 6$ case.
60

Impacto das Áreas de Preservação Permanente sobre a erosão hídrica na bacia hidrográfica do Rio da Prata, Castelo-ES / Impact of Permanent Preservation Areas on water erosion in the watershed of River Silver, Castelo-ES

Coutinho, Luciano Melo 08 September 2010 (has links)
Made available in DSpace on 2016-12-23T13:51:50Z (GMT). No. of bitstreams: 1 Dissertacao Luciano Melo Coutinho.pdf: 3367778 bytes, checksum: 40800cad5c76869e0227b5f438c91f96 (MD5) Previous issue date: 2010-09-08 / A watershed is the primary unit of water resource management, because their behavior affects the hydrological occurrence and magnitude of water erosion. Hydrologic simulation models, which allow to estimate the hydrology and water erosion, consisting of important management tool to minimize environmental degradation in these units. The Permanent Preservation Areas (PPA) are defined for protection of natural resources by density of vegetation. The aim of the present work was undertaken, in Silver Basin (Castelo ES) studies relief (guided by different sources of elevation data and interpolation procedures) and quantification of the annual erosion (under different scenarios of land use). This end, we worked in an environment of Geographic Information Systems, data relief (topographic maps and radar images) and land use (aerial photography), which allowed the manipulation of data and generation of factors of interest on the proposed procedures, and: a) evaluate the delimitation of the Silver Bowl from different digital elevation models; b) classify the forms of natural cover and use and land cover; c) delimit the areas considered as PPA; d) apply Universal Soil Loss Equation (USLE) the scenarios of land use and occupancy with respect to PPA. The delineation manual, generated by the topographical map of Castelo-ES and interpolation by interpolating isolines Topo to Raster , supported consisted hydrography, respectively, the method delimitation and interpolating the best performance the delimitation of basin, therefore, alternatives adopted for subsequent studies. The main physical characteristics of the River Plate basin are drainage area 132.28 Km², average elevation 593m and mean slope 39.77%. Pastures are the main form of land use in the basin, clean pasture (24.01%) and dirty pasture (6.62%), followed by permanent crops (27.26%). The portion corresponding to PPA equivalent to 55.48% of the basin (73.39 km²). The average annual erosion are 85.43 ton/ha/ year actual use of soil and 27.50 ton/ha/ year when adopting PPA, difference of 32.20% / A bacia hidrográfica consiste na principal unidade de gestão de recursos hídricos, pois seu comportamento hidrológico condiciona a ocorrência e magnitude da erosão hídrica. Modelos de simulação hidrológica, que permitem estimar o comportamento hidrológico e a erosão hídrica, consistem em importante ferramenta de gestão para minimizar a degradação ambiental nestas unidades territoriais. As Áreas de Preservação Permanente (APP) são delimitadas para proteção dos recursos naturais pelo adensamento da vegetação. Objetivou-se, no presente trabalho, desenvolver, na bacia da Prata (Castelo-ES), estudos do relevo (pautados em diferentes fontes de dados altimétricos e procedimentos de interpolação) e quantificação da erosão anual (sob diferentes cenários de uso do solo). Para tanto, foram trabalhados, em ambiente de Sistemas de Informação Geográfica, os dados de relevo (carta topográfica e imagens de radar) e de uso do solo (aerofotos), os quais permitiram a manipulação de dados e a geração dos fatores de interesse diante os procedimentos propostos, sendo: a) avaliar a delimitação da bacia da Prata a partir de diferentes modelos digitais de elevação; b) classificar as formas de cobertura natural e de uso e ocupação do solo; c) delimitar as áreas consideradas como APP s; e d) aplicar da Equação Universal de Perdas de Solos (EUPS) nos cenários de ocupação do solo e ocupação com respeito às APP s. A delimitação manual, gerada por intermédio de carta topográfica de Castelo-ES, e a interpolação de isolinhas pelo interpolador Topo to Raster , com suporte de hidrografia consistiram, respectivamente, no método de delimitação e interpolador de melhor desempenho na delimitação da bacia, sendo, portanto, as alternativas adotadas para os estudos subsequentes. As principais características físicas da bacia do rio da Prata são área de drenagem de 132,28 km², altitude média 593m e declividade média 39,77%. As pastagens são a principal forma de uso do solo na bacia, pasto limpo (24,01%) e pasto sujo (6,62%), seguido das culturas permanentes (27,26%). A porção correspondente à APP equivale a 55,48% da bacia (73,39 km²). Os valores médios de erosão anual são de 85,43 ton/ha/ano pelo uso real do solo e de 27,50 ton/ha/ano quando da adoção de APP, diferença de 32,20%

Page generated in 0.0245 seconds