Introduction Conclusions References

A data warehouse stores materialized views over data from one or more sources in order to provide fast access to the integrated data, regardless of the availability of the data sources. Warehouse views need to be maintained in response to changes to the base data in the sources. Except for very simple views, maintaining a warehouse view requires access to data that is not available in the view ...

The ability to classify the biological condition of unsurveyed streams accurately would be an asset to the conservation and management of streams. We compared the ability of 5 modeling methods (classification and regression trees, conditional inference trees, random forests [RF], conditional random forests [cRF], and ordinal logistic regression) to predict stream biological condition (very poor...

Deforestation and climate change heavily impact the ecosystem of the Amazon rainforest threatening its resilience and the sustainability of many human activities. Land protection may prevent ecosystems and their services to deteriorate from the pressures of agricultural expansion, population growth and wood harvesting. In the Brazilian Amazon land protection occurs in several forms such as envi...

Over the last decade a number of states and cities in America have successfully established spatial data infrastructures that incorporate core spatial data such as the physical infrastructure layers, topography, road and rail networks and critical administrative databases like land parcel and administrative boundaries. New York City built its digital photogrammetric base map (NYCMap) from 1996 ...

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...

A graph G is called a pairwise compatibility graph (PCG) if there exists an edge weighted tree T and two non-negative real numbers dmin and dmax such that each leaf lu of T corresponds to a vertex u ∈ V and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (lu, lv) ≤ dmax where dT (lu, lv) is the sum of the weights of the edges on the unique path from lu to lv in T . In this paper we analyze...

Strain is an important parameter for assessing the potential impacts resulting from mine subsidence movements. However, strain resulting from mine subsidence is also one of the most difficult parameters to predict accurately. A number of methods can be used to predict strain, from simple empirical relationships, to more complex statistical approaches. This paper looks at some of these predictio...

A graph G = (V, E) is called a pairwise compatibility graph (PCG) if there exists a tree T , a positive edge-weight function w on T , and two non-negative real numbers dmin and dmax, dmin ≤ dmax, such that V coincides with the set of leaves of T , and there is an edge (u, v) ∈ E if and only if dmin ≤ dT,w(u, v) ≤ dmax where dT,w(u, v) is the sum of the weights of the edges on the unique path fr...

This paper describes a Web-based query system for semantically heterogeneous geospatial data. Our goal is to provide DBMS type query capabilities to a proposed statewide land information system. One of the main problems in querying distributed local data sources is the difference in semantics describing the characteristics (attributes) of spatial objects between various jurisdictions. To addres...