[1] Patterns of DOC and nitrate (NO3 ) concentrations and fluxes were studied for six storm events across four forested, glaciated, subcatchments (1.6 to 696 ha) in western New York, USA. End-member mixing analysis (EMMA) showed that catchment runoff was composed of shallow groundwater (SGW) discharged at seeps and throughfall (THF) on the rising limb and THF and riparian water (RW) on the rece...

A 2-year study (2010-2011) of fluorides in atmospheric precipitation in the open area and in throughfall in Wielkopolski National Park (west-central Poland) showed their high concentrations, reaching a maximum value of 2 mg/l under the tree crowns. These high values indicate substantial deposition of up to 52 mg/m(2)/year. In 2011, over 51% of open area precipitation was characterized by fluori...

Based on a generalized framework for alias free QMF banks, a theory is developed for the design of uniform QMF banks with real-coefficient analysis filters, such that aliasing can be completely canceled by appropriate choice of real-coefficient synthesis filters. These results are then applied for the derivation of closed-form expressions for the synthesis filters (both FIR and RR), that ensure...

Let b, c be positive integers, x1, x2 be indeterminates over Z and xm,m ∈ Z be rational functions defined by xm−1xm+1 = x b m+1 if m is odd and xm−1xm+1 = x c m+1 if m is even. In this short note, we prove that for any m,k ∈ Z, xk can be expressed as a substraction-free Laurent polynomial in Z[x±1 m , x ±1 m+1]. This proves FominZelevinsky’s positivity conjecture for coefficient-free rank two c...

In this paper, roundoff noise properties of fixed-point IIR polynomial predictors (FIPPs) and polynomial-predictive differentiators (FIPPDs) are investigated. These filters are designed by augmenting the corresponding FIR basis filters with magnitude response shaping feedbacks. Here we use ideally quantized coefficient (coefficient quantization error free) polynomial FIR predictors (PFPs) or pr...

We consider a random graph process in which, at each time step, a new vertex is added with m out-neighbours, chosen with probabilities proportional to their degree plus a strictly positive constant. We show that the expectation of the clustering coefficient of the graph process is asymptotically proportional to log n n . Bollobás and Riordan [3] have previously shown that when the constant is z...

In this paper, we present a detailed analysis of the global clustering coefficient in scale-free graphs. Many observed real-world networks of diverse nature have a power-law degree distribution. Moreover, the observed degree distribution usually has an infinite variance. Therefore, we are especially interested in such degree distributions. In addition, we analyze the clustering coefficient for ...