Winter wheat seedtime is important for wheat growth. It affects the wheat yield and quality. The objective of this study is monitoring the winter wheat seedtime through remote sensing imagery. Two HJ-1B images and one Landsat5 TM image were used in this study. Three Vegetation Indices, DVI, SAVI and RDVI were calculated. The correlation about the wheat seedtime and VIs were analyzed. The result...

Recently published research has identified that the use of a ‘wine-like’ 15% ethanol extraction method when analysing grape tannins provides a strong indication of tannin concentration that is likely to result when those grapes are made into wine. The AWRI has developed a rapid and practical method for determining extractable tannins in red grapes, which involves gentle crushing of grapes by ha...

Apple scab causes significant losses in the production of this fruit. A timely and more site-specific monitoring and spraying of the disease could reduce the number of applications of fungicides in the fruit industry. The aim of this leaf-scale study therefore lies in the early detection of apple scab infections in a non-invasive and non-destructive way. In order to attain this objective, fluor...

Let us start with the well-known graph theorem of Turán that determines the largest number of edges in a graph on n vertices containing no complete graph on k + 1 vertices. If 1 ≤ k ≤ n are integers, define the graph T (n, k) whose vertex set is V1 ∪ V2 ∪ . . . ∪ Vk where the Vis are pairwise disjoint and their sizes are either ⌊ n k ⌋ or ⌈ n k ⌉ and two vertices are adjacent if and only if the...

This paper presents a novel method for computing visibility in 2.5D environments based on a novel theoretical result: the visibility from a region can be conservatively estimated by computing the visibility from a point using appropriately “shrunk” occluders and occludees. We show how approximate, yet conservative, shrunk objects can be efficiently computed in an urban environment. The techniqu...

Let Km −H be the graph obtained from Km by removing the edges set E(H) of H where H is a subgraph of Km. In this paper, we characterize the potentially K5 − P3, K5 − A3, K5 −K3 and K5 − K1,3-graphic sequences where A3 is P2 ∪ K2. Moreover, we also characterize the potentially K5 − 2K2-graphic sequences where pK2 is the matching consisted of p edges.

A sequence of nonnegative integers π is graphic if it is the degree sequence of some graph G. In this case we say that G is a realization of π, and we write π = π(G). A graphic sequence π is potentially H-graphic if there is a realization of π that contains H as a subgraph. Given nonincreasing graphic sequences π1 = (d1, . . . , dn) and π2 = (s1, . . . , sn), we say that π1 majorizes π2 if di ≥...

objective(s) due to increasing emergence of drug-resistance in helicobacter pylori isolates, traditional plants are potentially valuable sources of novel anti-h. pylori agents. in this research, anti-h. pylori activity of the organic extracts of twenty native iranian plants was determined against ten clinical isolates of h. pylori. materials and methods disc diffusion was used to determine the ...

Given a graph H, a graphic sequence π is potentially H-graphic if there is some realization of π that contains H as a subgraph. In 1991, Erdős, Jacobson and Lehel posed the following question: Determine the minimum even integer σ(H,n) such that every n-term graphic sequence with sum at least σ(H,n) is potentially H-graphic. This problem can be viewed as a “potential” degree sequence relaxation ...

h