We note the condition 0 ≤ w(e) ≤ 1 is given since it is convenient for presenting our theoretical results, although we can define each problem without this condition. We say unweighted dense subgraph problem if w(e) = 1 for each edge. We define the density ∆ of the output subgraph H to be ∆ = 2w(F ) k(k−1) for the non-bipartite case and ∆ = w(F ) m′n′ for the bipartite case. In other words, den...

Tropical forests are a key component of the global carbon cycle and climate change mitigation. Field- or LiDAR-based approaches enable reliable measurements structure above-ground biomass (AGB) tropical forests. Data derived from digital aerial photogrammetry (DAP) on unmanned vehicle (UAV) platform offer several advantages over field- in terms scale efficiency, DAP has been presented as viable...

in order to investigate the effects of  management models on the diversity of wooden species, forests of third series of shiler, the first division mehrbanrud watershed and third and fourth series of eight division of behshahr – neka townships were studied with participatory and governmental management respectively. the diversity of the wooden species have been evaluated by diversity parametric...

This paper presents an integrated aerial system for the identification of Amazonian Moriche palm (Mauritia flexuosa) in dense forests, by analyzing UAV-captured RGB imagery using a Mask R-CNN deep learning approach. The model was trained with 478 labeled palms, transfer technique based on well-known MS COCO framework©. Comprehensive in-field experiments were conducted yielding precision 98%. pr...

The evolution of the prehensile tail illustrates the impact habitat can have on structural traits. Prehensile primates are able to support their entire body weight using only their tail, which opens up new feeding opportunities in their arboreal environments. This trait evolved separately in two families of New World monkeys. A transitional behaviour in its proposed evolutionary mechanism is ta...

Sparse LU factorization with partial pivoting is important for many scienti c applications and delivering high perfor mance for this problem is di cult on distributed memory machines Our previous work has developed an approach called S that incorporates static symbolic factorization supernode partitioning and graph scheduling This paper studies the properties of elimination forests and uses the...

Without access to large compute clusters, building random forests on large datasets is still a challenging problem. This is, in particular, the case if fully-grown trees are desired. We propose a simple yet effective framework that allows to efficiently construct ensembles of huge trees for hundreds of millions or even billions of training instances using a cheap desktop computer with commodity...

The Tutte-Gröthendieck polynomial T (G;x, y) of a graph G encodes numerous interesting combinatorial quantities associated with the graph. Its evaluation in various points in the (x, y) plane give the number of spanning forests of the graph, the number of its strongly connected orientations, the number of its proper k-colorings, the (all terminal) reliability probability of the graph, and vario...

Black carbon (BC), one of the major components of atmosphere aerosol, could be the second dominant driver of climate change. We reconstructed historical trend of BC fluxes in Sanjiang Plain (Northeast China) through peat record to better understand its long-term trend and relationship of this atmosphere aerosol with intensity of human activities. The BC fluxes in peatland were higher than other...