ASU Scholarship Showcase

Research has shown that construction projects in Saudi Arabia have exhibited poor performance for the past three decades. The traditional risk management practices have been ineffective at helping contractors deliver projects on time and within budget while meeting quality expectations. Studies have identified that client decision making is one of the main causes of risks that occur on projects in Saudi Arabia. This paper proposes a new risk management model that can minimize client decision making, and enable the client to utilize expertise, thereby improving project quality and performance. The model is derived from the Information Measurement Theory (IMT) and Performance Information Procurement System (PIPS), both developed at Arizona State University in the United States (U.S.). The model has been tested over 1800 times in both construction and non-construction projects, showing a decrease in required management by owner by up to 80% and an increase in efficiency up to 40%.

Brazil has had issues in efficiently providing the required amount of electricity to its citizens at a low cost. One of the main causes to the decreasing performance of energy is due to reoccurring droughts that decrease the power generated by hydroelectric facilities. To compensate for the decrease, Brazil brought into use thermal power plants. The power plants being on average 23.7% more expensive than hydroelectric. Wind energy is potentially an alternative source of energy to compensate for the energy decrease during droughts. Brazil has invested in wind farms recently, but, due to issues with the delivery method, only 34% of wind farms are operational. This paper reviews the potential benefit Brazil could receive from investing more resources into developing and operating wind farms. It also proposes that utilization of the best value approach in delivering wind farms could produce operational wind farms quicker and more efficiently than previously experienced.

Delays are a major cause for concern in the construction industry in Saudi Arabia. This paper identifies the main causes of delay in infrastructure projects in Mecca, Saudi Arabia, and compares these with projects around the country and other Gulf countries. Data was obtained from 49 infrastructure projects undertaken by the owner and were analyzed quantitatively to understand the severity and causes of delay. 10 risk factors were identified and were grouped into four categories. Average delay in infrastructure projects in Mecca was found to be 39%. The most severe cause of delay was found to be the land acquisition factor. This highlights the critical land ownership and acquisition issues that are prevailing in the city. Additionally, other factors that contribute to delay include contractors’ lack of expertise, re-designing, and haphazard underground utilities (line services). It is concluded that the majority of project delays were caused from the owner's side as compared to contractors, consultants, and other project's stakeholders. This finding matched with the research findings of the Gulf Countries Construction (GCC) Industry's literature. This study fills an important practice and research gap for improving the efficiency in delivering infrastructure projects in the holy city of Mecca and Gulf countries at large.

This paper is part of doctoral research to improve the current Saudi Arabian (SA) procurement system. SA has the largest construction market in the Middle East. However, the use of the traditional procurement system in SA has been identified as one of the causes for poor performance in the delivery of construction. The system has been identified as a major risk to the SA government, due to consistent increased costs and delays of up to 70% on projects. A survey was conducted with 1396 participants including engineers, buyers, contractors, consultants, academics, and architects. The purpose of the survey was to identify the validity of the recent claims that the procurement system in SA is broken. The participants work in both the private and government sectors. The survey results showed that the procurement system is a major risk to projects, affects construction projects negatively, and is in need of improvement.

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.

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.

A challenging problem in network science is to control complex networks. In existing frameworks of structural or exact controllability, the ability to steer a complex network toward any desired state is measured by the minimum number of required driver nodes. However, if we implement actual control by imposing input signals on the minimum set of driver nodes, an unexpected phenomenon arises: due to computational or experimental error there is a great probability that convergence to the final state cannot be achieved. In fact, the associated control cost can become unbearably large, effectively preventing actual control from being realized physically. The difficulty is particularly severe when the network is deemed controllable with a small number of drivers. Here we develop a physical controllability framework based on the probability of achieving actual control. Using a recently identified fundamental chain structure underlying the control energy, we offer strategies to turn physically uncontrollable networks into physically controllable ones by imposing slightly augmented set of input signals on properly chosen nodes. Our findings indicate that, although full control can be theoretically guaranteed by the prevailing structural controllability theory, it is necessary to balance the number of driver nodes and control cost to achieve physical control.

Network reconstruction is a fundamental problem for understanding many complex systems with unknown interaction structures. In many complex systems, there are indirect interactions between two individuals without immediate connection but with common neighbors. Despite recent advances in network reconstruction, we continue to lack an approach for reconstructing complex networks with indirect interactions. Here we introduce a two-step strategy to resolve the reconstruction problem, where in the first step, we recover both direct and indirect interactions by employing the Lasso to solve a sparse signal reconstruction problem, and in the second step, we use matrix transformation and optimization to distinguish between direct and indirect interactions. The network structure corresponding to direct interactions can be fully uncovered. We exploit the public goods game occurring on complex networks as a paradigm for characterizing indirect interactions and test our reconstruction approach. We find that high reconstruction accuracy can be achieved for both homogeneous and heterogeneous networks, and a number of empirical networks in spite of insufficient data measurement contaminated by noise. Although a general framework for reconstructing complex networks with arbitrary types of indirect interactions is yet lacking, our approach opens new routes to separate direct and indirect interactions in a representative complex system.

Controlling complex networks has become a forefront research area in network science and engineering. Recent efforts have led to theoretical frameworks of controllability to fully control a network through steering a minimum set of driver nodes. However, in realistic situations not every node is accessible or can be externally driven, raising the fundamental issue of control efficacy: if driving signals are applied to an arbitrary subset of nodes, how many other nodes can be controlled? We develop a framework to determine the control efficacy for undirected networks of arbitrary topology. Mathematically, based on non-singular transformation, we prove a theorem to determine rigorously the control efficacy of the network and to identify the nodes that can be controlled for any given driver nodes. Physically, we develop the picture of diffusion that views the control process as a signal diffused from input signals to the set of controllable nodes. The combination of mathematical theory and physical reasoning allows us not only to determine the control efficacy for model complex networks and a large number of empirical networks, but also to uncover phenomena in network control, e.g., hub nodes in general possess lower control centrality than an average node in undirected networks.

In spite of the recent interest and advances in linear controllability of complex networks, controlling nonlinear network dynamics remains an outstanding problem. Here we develop an experimentally feasible control framework for nonlinear dynamical networks that exhibit multistability. The control objective is to apply parameter perturbation to drive the system from one attractor to another, assuming that the former is undesired and the latter is desired. To make our framework practically meaningful, we consider restricted parameter perturbation by imposing two constraints: it must be experimentally realizable and applied only temporarily. We introduce the concept of attractor network, which allows us to formulate a quantifiable controllability framework for nonlinear dynamical networks: a network is more controllable if the attractor network is more strongly connected. We test our control framework using examples from various models of experimental gene regulatory networks and demonstrate the beneficial role of noise in facilitating control.