Forest’s ecosystem is one of the most important carbon sink of the terrestrial ecosystem. Remote sensing technology provides robust techniques to estimate biomass and solve challenges in forest resource assessment. The present study explored the potential of Sentinel-2 bands to estimate biomass and comparatively analyzed of red-edge band based and broadband derived vegetation indices. Broadband...

Canopy chlorophyll content (Chl) closely relates to plant photosynthetic capacity, nitrogen status and productivity. The goal of this study is to develop remote sensing techniques for accurate estimation of canopy Chl during the entire growing season without re-parameterization of algorithms for two contrasting crop species, maize and soybean. These two crops represent different biochemical mec...

We present a picosecond Fe K-edge absorption study of photoexcited ferrous and ferric hexacyanide in water under 355 and 266 nm excitation. Following 355 nm excitation, the transient spectra for the ferrous and ferric complexes exhibit a red shift of the edge reflecting an increased electron density at the Fe atom. For the former, an enhanced pre-edge transition is also observed. These observat...

Although relatively rare, the symptom complex of intermittent acral warmth, pain, and erythema that defines erythromelalgia (EM) has been well documented in the medical literature for over 150 years (Graves, 1838). Despite an extended awareness of this phenomenon, the cause and underlying mechanisms have until recently been completely obscure. Part of the difficulty in understanding EM has been...

A 1-plane graph is a graph embedded in the plane such that each edge is crossed at most once. A 1-plane graph is optimal if it has maximum edge density. A red-blue edge coloring of an optimal 1-plane graph G partitions the edge set of G into blue edges and red edges such that no two blue edges cross each other and no two red edges cross each other. We prove the following: (i) Every optimal 1-pl...

In this paper, we introduce a natural variation of the problem of computing all bichromatic intersections between two sets of segments. Given two sets R and B of n points in the plane defining two sets of segments, say red and blue, we present an O(n) time and space algorithm for solving the problem of reporting the set of segments of each color intersected by segments of the other color. We al...