We present a comprehensive critical review of well-established satellite remote sensing water indices and offer novel, robust Augmented Normalized Difference Water Index (ANDWI). ANDWI employs an expanded set spectral bands, RGB, NIR, SWIR1-2, to maximize the contrast between non-water pixels. Further, we implement dynamic thresholding method, Otsu algorithm, enhance ANDWI's performance. Applie...

As a standard to by which characterize the ability of ships ascend rapidly, rapid suppression hydraulic index is main indicator regulatory effect and an important component channel engineering research. This study reviewed current determination methods forms expression revealed that existing comprehensive indices unit energy have obvious disadvantages, such as critical standards not being unifi...

BACKGROUND Reducing health inequalities involves the identification and characterization of social and exposure factors and the way they accumulate in a given area. The areas of accumulation then allow for prioritization of interventions. The present study aims to build spatial composite indicators based on the aggregation of environmental, social and health indicators and their inter-relations...

Several variants of Bryant’s ordered binary decision diagrams have been suggested in the literature to reason about discrete functions. In this paper, we introduce a generic notion of weighted decision diagrams that captures many of them and present criteria for canonicity. As a special instance of such weighted diagrams, we introduce a new BDD-variant for real-valued functions, called normaliz...

The problem of relating the eigenvalues of the normalized Laplacian for a weighted graph G and G − H, for H a subgraph of G is considered. It is shown that these eigenvalues interlace and that the tightness of the interlacing is dependent on the number of nonisolated vertices of H. Weak coverings of a weighted graph are also defined and interlacing results for the normalized Laplacian for such ...

The problem of relating the eigenvalues of the normalized Laplacian for a weighted graph G and G − H, for H a subgraph of G is considered. It is shown that these eigenvalues interlace and that the tightness of the interlacing is dependent on the number of nonisolated vertices of H. Weak coverings of a weighted graph are also defined and interlacing results for the normalized Laplacian for such ...