This is the first report on analysis of habitat complexity and heterogeneity of the Pantanal wetland. The Pantanal encompasses a peculiar mosaic of environments, being important to evaluate and monitor this area concerning conservation of biodiversity. Our objective was to indirectly measure the habitat complexity and heterogeneity of the mosaic forming the sub-regions of the Pantanal, by means...

many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. in this paper we discuss integrity and its properties in vulnerability calculation. the integrity of a graph g, i(g), is defined t...

The aim of the research work is to mine the data set available with each custodian in a semi honest model, securely without disclosure of any data amongst various custodians involved. No custodian discloses any information. In the proposed scheme in order to reduce the computational complexity, the data partitioning has been done in the horizontal way. The proposed research work consists of a w...

To reduce the implementation complexity of a belief propagation (BP) based low-density parity-check (LDPC) decoder, shuffled BP decoding schedules, which serialize the decoding process by dividing a complete parallel message-passing iteration into a sequence of sub-iterations, have been proposed. The so-called group horizontal shuffled BP algorithm partitions the check nodes of the code graph i...

Loading of water bodies with dissolved organic carbon (DOC) and dissolved total nitrogen (DTN) affects their integrity and functioning. Microbial interactions mitigate the negative effects of high nutrient loads in these ecosystems. Despite numerous studies on how biodiversity mediates ecosystem functions, whether and how diversity and complexity of microbial food webs (horizontal, vertical) an...

Given a set T of n points in IR, a Manhattan Network G is a network with all its edges horizontal or vertical segments, such that for all p, q ∈ T , in G there exists a path (named a Manhattan path) of the length exactly the Manhattan distance between p and q. The Minimum Manhattan Network problem is to find a Manhattan network of the minimum length, i.e., the total length of the segments of th...

Humans are a true force of nature and human actions have taken their place alongside the biosphere, lithosphere, hydrosphere, and atmosphere as defining processes shaping the global landscape (Ellis & Haff, 2009). Much like forecasting the weather and trends in the economy, the interactions of humans and complex ecosystems (such as a food web in a tropical rainforest) are fraught with complexit...

The need for scalable algorithms to solve least squares and eigenvalue problems is becoming increasingly important given the rising complexity of modern machines. We address this concern by presenting a new scalable QR factorization algorithm intended to accelerate these problems for rectangular matrices. Our contribution is a communication-avoiding distributed-memory parallelization of an exis...