ASU Scholarship Showcase

Land-use mapping is critical for global change research. In Central Arizona, U.S.A., the spatial distribution of land use is important for sustainable land management decisions. The objective of this study was to create a land-use map that serves as a model for the city of Maricopa, an expanding urban region in the Sun Corridor of Arizona. We use object-based image analysis to map six land-use types from ASTER imagery, and then compare this with two per-pixel classifications. Our results show that a single segmentation, combined with intermediary classifications and merging, morphing, and growing image-objects, can lead to an accurate land-use map that is capable of utilizing both spatial and spectral information. We also employ a moving-window diversity assessment to help with analysis and improve post-classification modifications.

We develop a general framework to analyze the controllability of multiplex networks using multiple-relation networks and multiple-layer networks with interlayer couplings as two classes of prototypical systems. In the former, networks associated with different physical variables share the same set of nodes and in the latter, diffusion processes take place. We find that, for a multiple-relation network, a layer exists that dominantly determines the controllability of the whole network and, for a multiple-layer network, a small fraction of the interconnections can enhance the controllability remarkably. Our theory is generally applicable to other types of multiplex networks as well, leading to significant insights into the control of complex network systems with diverse structures and interacting patterns.

Urban environmental measurements and observational statistics should reflect the properties generated over an adjacent area of adequate length where homogeneity is usually assumed. The determination of this characteristic source area that gives sufficient representation of the horizontal coverage of a sensing instrument or the fetch of transported quantities is of critical importance to guide the design and implementation of urban landscape planning strategies. In this study, we aim to unify two different methods for estimating source areas, viz. the statistical correlation method commonly used by geographers for landscape fragmentation and the mechanistic footprint model by meteorologists for atmospheric measurements. Good agreement was found in the intercomparison of the estimate of source areas by the two methods, based on 2-m air temperature measurement collected using a network of weather stations. The results can be extended to shed new lights on urban planning strategies, such as the use of urban vegetation for heat mitigation. In general, a sizable patch of landscape is required in order to play an effective role in regulating the local environment, proportional to the height at which stakeholders’ interest is mainly concerned.

The exploration of environmentally friendly energy resources is one of the major challenges facing society today. The last decade has witnessed rapid developments in renewable energy engineering. Wind and solar power plants with increasing sizes and technological sophistication have been built. Amid this development, meteorological modeling plays an increasingly important role, not only in selecting the sites of wind and solar power plants but also in assessing the environmental impacts of those plants. The permanent land-use changes as a result of the construction of wind farms can potentially alter local climate (Keith et al. [1], Roy and Traiteur [2]). The reduction of wind speed by the presence of wind turbines could affect the preconstruction estimate of wind power potential (e.g., Adams and Keith [3]). Future anthropogenic greenhouse gas emissions are expected to induce changes in the surface wind and cloudiness, which would affect the power production of wind and solar power plants. To quantify these two-way relations between renewable energy production and regional climate change, mesoscale meteorological modeling remains one of the most efficient approaches for research and applications.

Dynamical processes occurring on the edges in complex networks are relevant to a variety of real-world situations. Despite recent advances, a framework for edge controllability is still required for complex networks of arbitrary structure and interaction strength. Generalizing a previously introduced class of processes for edge dynamics, the switchboard dynamics, and exploit- ing the exact controllability theory, we develop a universal framework in which the controllability of any node is exclusively determined by its local weighted structure. This framework enables us to identify a unique set of critical nodes for control, to derive analytic formulas and articulate efficient algorithms to determine the exact upper and lower controllability bounds, and to evaluate strongly structural controllability of any given network. Applying our framework to a large number of model and real-world networks, we find that the interaction strength plays a more significant role in edge controllability than the network structure does, due to a vast range between the bounds determined mainly by the interaction strength. Moreover, transcriptional regulatory networks and electronic circuits are much more strongly structurally controllable (SSC) than other types of real-world networks, directed networks are more SSC than undirected networks, and sparse networks are typically more SSC than dense networks.

We quantified the spatio-temporal patterns of land cover/land use (LCLU) change to document and evaluate the daytime surface urban heat island (SUHI) for five hot subtropical desert cities (Beer Sheva, Israel; Hotan, China; Jodhpur, India; Kharga, Egypt; and Las Vegas, NV, USA). Sequential Landsat images were acquired and classified into the USGS 24-category Land Use Categories using object-based image analysis with an overall accuracy of 80% to 95.5%. We estimated the land surface temperature (LST) of all available Landsat data from June to August for years 1990, 2000, and 2010 and computed the urban-rural difference in the average LST and Normalized Difference Vegetation Index (NDVI) for each city. Leveraging non-parametric statistical analysis, we also investigated the impacts of city size and population on the urban-rural difference in the summer daytime LST and NDVI. Urban expansion is observed for all five cities, but the urbanization pattern varies widely from city to city. A negative SUHI effect or an oasis effect exists for all the cities across all three years, and the amplitude of the oasis effect tends to increase as the urban-rural NDVI difference increases. A strong oasis effect is observed for Hotan and Kharga with evidently larger NDVI difference than the other cities. Larger cities tend to have a weaker cooling effect while a negative association is identified between NDVI difference and population. Understanding the daytime oasis effect of desert cities is vital for sustainable urban planning and the design of adaptive management, providing valuable guidelines to foster smart desert cities in an era of climate variability, uncertainty, and change.

Recent works revealed that the energy required to control a complex network depends on the number of driving signals and the energy distribution follows an algebraic scaling law. If one implements control using a small number of drivers, e.g. as determined by the structural controllability theory, there is a high probability that the energy will diverge. We develop a physical theory to explain the scaling behaviour through identification of the fundamental structural elements, the longest control chains (LCCs), that dominate the control energy. Based on the LCCs, we articulate a strategy to drastically reduce the control energy (e.g. in a large number of real-world networks). Owing to their structural nature, the LCCs may shed light on energy issues associated with control of nonlinear dynamical networks.

Given a complex geospatial network with nodes distributed in a two-dimensional region of physical space, can the locations of the nodes be determined and their connection patterns be uncovered based solely on data? We consider the realistic situation where time series/signals can be collected from a single location. A key challenge is that the signals collected are necessarily time delayed, due to the varying physical distances from the nodes to the data collection centre. To meet this challenge, we develop a compressive-sensing-based approach enabling reconstruction of the full topology of the underlying geospatial network and more importantly, accurate estimate of the time delays. A standard triangularization algorithm can then be employed to find the physical locations of the nodes in the network. We further demonstrate successful detection of a hidden node (or a hidden source or threat), from which no signal can be obtained, through accurate detection of all its neighbouring nodes. As a geospatial network has the feature that a node tends to connect with geophysically nearby nodes, the localized region that contains the hidden node can be identified.

Locating sources of diffusion and spreading from minimum data is a significant problem in network science with great applied values to the society. However, a general theoretical framework dealing with optimal source localization is lacking. Combining the controllability theory for complex networks and compressive sensing, we develop a framework with high efficiency and robustness for optimal source localization in arbitrary weighted networks with arbitrary distribution of sources. We offer a minimum output analysis to quantify the source locatability through a minimal number of messenger nodes that produce sufficient measurement for fully locating the sources. When the minimum messenger nodes are discerned, the problem of optimal source localization becomes one of sparse signal reconstruction, which can be solved using compressive sensing. Application of our framework to model and empirical networks demonstrates that sources in homogeneous and denser networks are more readily to be located. A surprising finding is that, for a connected undirected network with random link weights and weak noise, a single messenger node is sufficient for locating any number of sources. The framework deepens our understanding of the network source localization problem and offers efficient tools with broad applications.

Evolutionary games model a common type of interactions in a variety of complex, networked, natural systems and social systems. Given such a system, uncovering the interacting structure of the underlying network is key to understanding its collective dynamics. Based on compressive sensing, we develop an efficient approach to reconstructing complex networks under game-based interactions from small amounts of data. The method is validated by using a variety of model networks and by conducting an actual experiment to reconstruct a social network. While most existing methods in this area assume oscillator networks that generate continuous-time data, our work successfully demonstrates that the extremely challenging problem of reverse engineering of complex networks can also be addressed even when the underlying dynamical processes are governed by realistic, evolutionary-game type of interactions in discrete time.