Benzoapyrene (B[a]P) pollution poses a threat to the environment and food chain consequently human health. However, alleviation of harmful effects B[a]P in perennial ryegrass ( Lolium perenne L.) by application exogenous nitric oxide (NO) has been ignored. Thus, this paper sodium nitroprusside (SNP, NO donor) on growth, photosynthetic fluorescence characteristics, antioxidant enzyme activity ex...

Intuitively, if two strings S1 and S2 are sufficiently similar and we already have an FM-index for S1 then, by storing a little extra information, we should be able to reuse parts of that index in an FM-index for S2. We formalize this intuition and show that it can lead to significant space savings in practice, as well as to some interesting theoretical problems.

It has been argued that the relative position of spectral envelopes along frequency axis serves as a cue for musical instrument size (e.g., violin vs viola) and shape envelope encodes family identity (violin flute). is further known fundamental (F0), F0-register specific instruments, dynamic level strongly affect properties acoustical sounds. However, associations between these factors have not...

Extended Abstract. Suppose n i.i.d. observations, X1, …, Xn, are available from the unknown distribution F(.), goodness-of-fit tests refer to tests such as H0 : F(x) = F0(x) against H1 : F(x) $neq$ F0(x). Some nonparametric tests such as the Kolmogorov--Smirnov test, the Cramer-Von Mises test, the Anderson-Darling test and the Watson test have been suggested by comparing empirical ...

The use of appropriate plant spacing in the canopy is an important and cost-free agrotechnical factor for increasing seed yield. Proper row sowing density are maintaining adequate light, ensuring good physiological processes, influencing nutritional status plants. As a consequence, this leads to better productivity while economic profitability. A four-year field experiment with white lupine was...

Let F0 be a fixed k-uniform hypergraph. The problem of finding the integer F0-packing number νF0 (H) of a k-uniform hypergraph H is an NP-hard problem. Finding the fractional F0-packing number ν∗ F0 (H) however can be done in polynomial time. In this paper we give a lower bound for the integer F0-packing number νF0 (H) in terms of ν∗ F0 (H) and show that νF0 (H) ≥ ν∗ F0 (H)− o(|V (H)| k).