503 research outputs found

    Assessment of nutrient entry pathways and dominating hydrological processes in lowland catchments

    No full text
    International audienceThe achievement of a good water quality in all water bodies until 2015 is legally regulated since December 2000 for all European Union member states by the European Water Framework Directive (EU, 2000). The aim of this project is to detect nutrient entry pathways and to assess the dominating hydrological processes in complex mesoscale catchments. The investigated Treene catchment is located in Northern Germany as a part of a lowland area. Sandy, loamy and peat soils are characteristic for this area. Land use is dominated by agriculture and pasture. Drainage changed the natural water balance. In a nested approach we examined two catchment areas: a) Treene catchment 517 km2, b) Kielstau catchment 50 km2. The nested approach assists to improve the process understanding by using data of different scales. Therefore these catchments serve not only as an example but the results are transferable to other lowland catchment areas. In a first step the river basin scale model SWAT (Soil and Water Assessment Tool, Arnold et al., 1998) was used successfully to model the water balance. Furthermore the water quality was analysed to distinguish the impact of point and diffuse sources. The results show that the tributaries in the Kielstau catchment contribute high amounts of nutrients, mainly nitrate and ammonium. For the parameters nitrate, ammonium and phosphorus it was observed as a tendency that the annual loads were increasing along the river profile of the Kielstau

    Functions holomorphic along holomorphic vector fields

    Full text link
    The main result of the paper is the following generalization of Forelli's theorem: Suppose F is a holomorphic vector field with singular point at p, such that F is linearizable at p and the matrix is diagonalizable with the eigenvalues whose ratios are positive reals. Then any function ϕ\phi that has an asymptotic Taylor expansion at p and is holomorphic along the complex integral curves of F is holomorphic in a neighborhood of p. We also present an example to show that the requirement for ratios of the eigenvalues to be positive reals is necessary

    Phase noise and jitter modeling for fractional-N PLLs

    Get PDF
    We present an analytical phase noise model for fractional-N phase-locked loops (PLL) with emphasis on integrated RF synthesizers in the GHz range. The noise of the crystal reference, the voltage-controlled oscillator (VCO), the loop filter, the charge pump, and the sigma-delta modulator (SDM) is filtered by the PLL operation. We express the rms phase error (jitter) in terms of phase noise of the reference, the VCO phase noise and the third-order loop filter parameters. In addition, we consider OFDM systems, where the PLL phase noise is reduced by digital signal processing after down-conversion of the RF signal to baseband. The rms phase error is discussed as a function of the loop parameters. Our model drastically simplifies the noise optimization of the PLL loop dynamics

    Modus D5.1 Definition of use cases

    Get PDF
    Within the Modus project, one of the main goals is to analyse how the performance of the overall European transport system can be optimized by considering the entire door-to-door journey holistically and considering air transport within an integrated, multimodal approach. In this regard, it is essential to identify the main barriers in achieving European (air) mobility goals and how air transport can evolve by efficiently connecting information and services with other transport modes to achieve a seamless journey experience for passengers. For this particular purposes, a set of use cases is identified and defined within this deliverable D5.1

    Field theoretic approach to the counting problem of Hamiltonian cycles of graphs

    Full text link
    A Hamiltonian cycle of a graph is a closed path that visits each site once and only once. I study a field theoretic representation for the number of Hamiltonian cycles for arbitrary graphs. By integrating out quadratic fluctuations around the saddle point, one obtains an estimate for the number which reflects characteristics of graphs well. The accuracy of the estimate is verified by applying it to 2d square lattices with various boundary conditions. This is the first example of extracting meaningful information from the quadratic approximation to the field theory representation.Comment: 5 pages, 3 figures, uses epsf.sty. Estimates for the site entropy and the gamma exponent indicated explicitl

    Entropy of chains placed on the square lattice

    Full text link
    We obtain the entropy of flexible linear chains composed of M monomers placed on the square lattice using a transfer matrix approach. An excluded volume interaction is included by considering the chains to be self-and mutually avoiding, and a fraction rho of the sites are occupied by monomers. We solve the problem exactly on stripes of increasing width m and then extrapolate our results to the two-dimensional limit to infinity using finite-size scaling. The extrapolated results for several finite values of M and in the polymer limit M to infinity for the cases where all lattice sites are occupied (rho=1) and for the partially filled case rho<1 are compared with earlier results. These results are exact for dimers (M=2) and full occupation (\rho=1) and derived from series expansions, mean-field like approximations, and transfer matrix calculations for some other cases. For small values of M, as well as for the polymer limit M to infinity, rather precise estimates of the entropy are obtained.Comment: 6 pages, 7 figure

    The Generation of Fullerenes

    Full text link
    We describe an efficient new algorithm for the generation of fullerenes. Our implementation of this algorithm is more than 3.5 times faster than the previously fastest generator for fullerenes -- fullgen -- and the first program since fullgen to be useful for more than 100 vertices. We also note a programming error in fullgen that caused problems for 136 or more vertices. We tabulate the numbers of fullerenes and IPR fullerenes up to 400 vertices. We also check up to 316 vertices a conjecture of Barnette that cubic planar graphs with maximum face size 6 are hamiltonian and verify that the smallest counterexample to the spiral conjecture has 380 vertices.Comment: 21 pages; added a not
    corecore