A matrix iteration for dynamic network summaries

We propose a new algorithm for summarizing properties of large-scale time-evolving networks. This type of data, recording connections that come and go over time, is being generated in many modern applications, including telecommunications and on-line human social behavior. The algorithm computes a dynamic measure of how well pairs of nodes can communicate by taking account of routes through the network that respect the arrow of time. We take the conventional approach of downweighting for length (messages become corrupted as they are passed along) and add the novel feature of downweighting for age (messages go out of date). This allows us to generalize widely used Katz-style centrality measures that have proved popular in network science to the case of dynamic networks sampled at non-uniform points in time. We illustrate the new approach on synthetic and real data.

Fault tolerant decentralised K-Means clustering for asynchronous large-scale networks

The K-Means algorithm for cluster analysis is one of the most influential and popular data mining methods. Its straightforward parallel formulation is well suited for distributed memory systems with reliable interconnection networks, such as massively parallel processors and clusters of workstations. However, in large-scale geographically distributed systems the straightforward parallel algorithm can be rendered useless by a single communication failure or high latency in communication paths. The lack of scalable and fault tolerant global communication and synchronisation methods in large-scale systems has hindered the adoption of the K-Means algorithm for applications in large networked systems such as wireless sensor networks, peer-to-peer systems and mobile ad hoc networks. This work proposes a fully distributed K-Means algorithm (EpidemicK-Means) which does not require global communication and is intrinsically fault tolerant. The proposed distributed K-Means algorithm provides a clustering solution which can approximate the solution of an ideal centralised algorithm over the aggregated data as closely as desired. A comparative performance analysis is carried out against the state of the art sampling methods and shows that the proposed method overcomes the limitations of the sampling-based approaches for skewed clusters distributions. The experimental analysis confirms that the proposed algorithm is very accurate and fault tolerant under unreliable network conditions (message loss and node failures) and is suitable for asynchronous networks of very large and extreme scale.

Online modeling with tunable RBF network

In this paper, we propose a novel online modeling algorithm for nonlinear and nonstationary systems using a radial basis function (RBF) neural network with a fixed number of hidden nodes. Each of the RBF basis functions has a tunable center vector and an adjustable diagonal covariance matrix. A multi-innovation recursive least square (MRLS) algorithm is applied to update the weights of RBF online, while the modeling performance is monitored. When the modeling residual of the RBF network becomes large in spite of the weight adaptation, a node identified as insignificant is replaced with a new node, for which the tunable center vector and diagonal covariance matrix are optimized using the quantum particle swarm optimization (QPSO) algorithm. The major contribution is to combine the MRLS weight adaptation and QPSO node structure optimization in an innovative way so that it can track well the local characteristic in the nonstationary system with a very sparse model. Simulation results show that the proposed algorithm has significantly better performance than existing approaches.

Fractional order modeling of large three-dimensional RC networks

An incidence matrix analysis is used to model a three-dimensional network consisting of resistive and capacitive elements distributed across several interconnected layers. A systematic methodology for deriving a descriptor representation of the network with random allocation of the resistors and capacitors is proposed. Using a transformation of the descriptor representation into standard state-space form, amplitude and phase admittance responses of three-dimensional random RC networks are obtained. Such networks display an emergent behavior with a characteristic Jonscher-like response over a wide range of frequencies. A model approximation study of these networks is performed to infer the admittance response using integral and fractional order models. It was found that a fractional order model with only seven parameters can accurately describe the responses of networks composed of more than 70 nodes and 200 branches with 100 resistors and 100 capacitors. The proposed analysis can be used to model charge migration in amorphous materials, which may be associated to specific macroscopic or microscopic scale fractal geometrical structures in composites displaying a viscoelastic electromechanical response, as well as to model the collective responses of processes governed by random events described using statistical mechanics.

The real-time optimisation of DNO owned storage devices on the LV network for peak reduction

Energy storage is a potential alternative to conventional network reinforcementof the low voltage (LV) distribution network to ensure the grid’s infrastructure remainswithin its operating constraints. This paper presents a study on the control of such storagedevices, owned by distribution network operators. A deterministic model predictive control (MPC) controller and a stochastic receding horizon controller (SRHC) are presented, wherethe objective is to achieve the greatest peak reduction in demand, for a given storagedevice specification, taking into account the high level of uncertainty in the prediction of LV demand. The algorithms presented in this paper are compared to a standard set-pointcontroller and bench marked against a control algorithm with a perfect forecast. A specificcase study, using storage on the LV network, is presented, and the results of each algorithmare compared. A comprehensive analysis is then carried out simulating a large number of LV networks of varying numbers of households. The results show that the performance of each algorithm is dependent on the number of aggregated households. However, on a typical aggregation, the novel SRHC algorithm presented in this paper is shown to outperform each of the comparable storage control techniques.

A peak reduction scheduling algorithm for storage devices on the low voltage network

Reinforcing the Low Voltage (LV) distribution network will become essential to ensure it remains within its operating constraints as demand on the network increases. The deployment of energy storage in the distribution network provides an alternative to conventional reinforcement. This paper presents a control methodology for energy storage to reduce peak demand in a distribution network based on day-ahead demand forecasts and historical demand data. The control methodology pre-processes the forecast data prior to a planning phase to build in resilience to the inevitable errors between the forecasted and actual demand. The algorithm uses no real time adjustment so has an economical advantage over traditional storage control algorithms. Results show that peak demand on a single phase of a feeder can be reduced even when there are differences between the forecasted and the actual demand. In particular, results are presented that demonstrate when the algorithm is applied to a large number of single phase demand aggregations that it is possible to identify which of these aggregations are the most suitable candidates for the control methodology.

Acceleration and visualization of Dynamic Network Optimization

With the emerging prevalence of smart phones and 4G LTE networks, the demand for faster-better-cheaper mobile services anytime and anywhere is ever growing. The Dynamic Network Optimization (DNO) concept emerged as a solution that optimally and continuously tunes the network settings, in response to varying network conditions and subscriber needs. Yet, the DNO realization is still at infancy, largely hindered by the bottleneck of the lengthy optimization runtime. This paper presents the design and prototype of a novel cloud based parallel solution that further enhances the scalability of our prior work on various parallel solutions that accelerate network optimization algorithms. The solution aims to satisfy the high performance required by DNO, preliminarily on a sub-hourly basis. The paper subsequently visualizes a design and a full cycle of a DNO system. A set of potential solutions to large network and real-time DNO are also proposed. Overall, this work creates a breakthrough towards the realization of DNO.

Ungulate behavioral responses to the heterogeneous road-network of a touristic protected area in Africa

Understanding how wildlife responds to road and traffic is essential for effective conservation. Yet, not many studies have evaluated how roads influence wildlife in protected areas, particularly within the large iconic African National Parks where tourism is mainly based on sightings from motorized vehicles with the consequent development and intense use of roads. To reduce this knowledge gap, we studied the behavioral response and local spatial distribution of impala Aepyceros melampus along the heterogeneous (with variation in road surface type and traffic intensity) road-network of Kruger National Park (KNP, South Africa). We surveyed different types of roads (paved and unpaved) recording the occurrence of flight responses among sighted impala and describing their local spatial distribution (in relation to the roads). We observed relatively few flight responses (19.5% of 118 observations), suggesting impalas could be partly habituated to vehicles in KNP. In addition, impala local distribution is apparently unaffected by unpaved roads, yet animals seem to avoid the close proximity of paved roads. Overall, our results suggest a negative, albeit small, effect of traffic intensity, and of presence of pavement on roads on the behavior of impala at KNP. Future studies would be necessary to understand how roads influence other species, but our results show that even within a protected area that has been well-visited for a long time, wildlife can still be affected by roads and traffic. This result has ecological (e.g., changes in spatial distribution of fauna) and management implications (e.g., challenges of facilitating wildlife sightings while minimizing disturbance) for protected areas where touristic activities are largely based on driving.

Using Africa’s protected area network to estimate the global population of a threatened and declining species: a case study of the critically endangered White-headed Vulture Trigonoceps occipitalis

The White-headed Vulture Trigonoceps occipitalis (WhV) is uncommon and largely restricted to protected areas across its range in sub-Saharan Africa. We used the World Database on Protected Areas to identify protected areas (PAs) likely to contain White-headed Vultures. Vulture occurrence on road transects in Southern, East, and West Africa was adjusted to nests per km2 using data from areas with known numbers of nests and corresponding road transect data. Nest density was used to calculate the number of WhV nests within identified PAs and from there extrapolated to estimate the global population. Across a fragmented range, 400 PAs are estimated to contain 1893 WhV nests. Eastern Africa is estimated to contain 721 nests, Central Africa 548 nests, Southern Africa 468 nests, and West Africa 156 nests. Including immature and nonbreeding birds, and accounting for data deficient PAs, the estimated global population is 5475 - 5493 birds. The identified distribution highlights are alarming: over 78% (n = 313) of identified PAs contain fewer than five nests. A further 17% (n = 68) of PAs contain 5 - 20 nests and 4% (n = 14) of identified PAs are estimated to contain >20 nests. Just 1% (n = 5) of PAs are estimated to contain >40 nests; none is located in West Africa. Whilst ranging behavior of WhVs is currently unknown, 35% of PAs large enough to hold >20 nests are isolated by more than 100 km from other PAs. Spatially discrete and unpredictable mortality events such as poisoning pose major threats to small localized vulture populations and will accelerate ongoing local extinctions. Apart from reducing the threat of poisoning events, conservation actions promoting linkages between protected areas should be pursued. Identifying potential areas for assisted re-establishment via translocation offers the potential to expand the range of this species and alleviate risk.

A fast adaptive tunable RBF network for nonstationary systems

This paper describes a novel on-line learning approach for radial basis function (RBF) neural network. Based on an RBF network with individually tunable nodes and a fixed small model size, the weight vector is adjusted using the multi-innovation recursive least square algorithm on-line. When the residual error of the RBF network becomes large despite of the weight adaptation, an insignificant node with little contribution to the overall system is replaced by a new node. Structural parameters of the new node are optimized by proposed fast algorithms in order to significantly improve the modeling performance. The proposed scheme describes a novel, flexible, and fast way for on-line system identification problems. Simulation results show that the proposed approach can significantly outperform existing ones for nonstationary systems in particular.