A systematic design of interval type-2 fuzzy logic system using extreme learning machine for electricity load demand forecasting

This paper presents a novel design of interval type-2 fuzzy logic systems (IT2FLS) by utilizing the theory of extreme learning machine (ELM) for electricity load demand forecasting. ELM has become a popular learning algorithm for single hidden layer feed-forward neural networks (SLFN). From the functional equivalence between the SLFN and fuzzy inference system, a hybrid of fuzzy-ELM has gained attention of the researchers. This paper extends the concept of fuzzy-ELM to an IT2FLS based on ELM (IT2FELM). In the proposed design the antecedent membership function parameters of the IT2FLS are generated randomly, whereas the consequent part parameters are determined analytically by the Moore-Penrose pseudo inverse. The ELM strategy ensures fast learning of the IT2FLS as well as optimality of the parameters. Effectiveness of the proposed design of IT2FLS is demonstrated with the application of forecasting nonlinear and chaotic data sets. Nonlinear data of electricity load from the Australian National Electricity Market for the Victoria region and from the Ontario Electricity Market are considered here. The proposed model is also applied to forecast Mackey-glass chaotic time series data. Comparative analysis of the proposed model is conducted with some traditional models such as neural networks (NN) and adaptive neuro fuzzy inference system (ANFIS). In order to verify the structure of the proposed design of IT2FLS an alternate design of IT2FLS based on Kalman filter (KF) is also utilized for the comparison purposes.

Determining the size of PHEV charging stations powered by commercial grid-integrated PV systems considering reactive power support

Due to low electricity rates at nighttime, home charging for electric vehicles (EVs) is conventionally favored. However, the recent tendency in support of daytime workplace charging that absorbs energy produced by solar photovoltaic (PV) panels appears to be the most promising solution to facilitating higher PV and EV penetration in the power grid. This paper studies optimal sizing of workplace charging stations considering probabilistic reactive power support for plug-in hybrid electric vehicles (PHEVs), which are powered by PV units in medium voltage (MV) commercial networks. In this study, analytical expressions are first presented to estimate the size of charging stations integrated with PV units with an objective of minimizing energy losses. These stations are capable of providing reactive power support to the main grid in addition to charging PHEVs while considering the probability of PV generation. The study is further extended to investigate the impact of time-varying voltage-dependent charging load models on PV penetration. The simulation results obtained on an 18-bus test distribution system show that various charging load models can produce dissimilar levels of PHEV and PV penetration. Particularly, the maximum energy loss and peak load reductions are achieved at 70.17% and 42.95% respectively for the mixed charging load model, where the system accommodates respective PHEV and PV penetration levels of 9.51% and 50%. The results of probabilistic voltage distributions are also thoroughly reported in the paper.

Anomaly detection in wireless sensor networks in a non-stationary environment

Anomaly detection in a WSN is an important aspect of data analysis in order to identify data items that significantly differ from normal data. A characteristic of the data generated by a WSN is that the data distribution may alter over the lifetime of the network due to the changing nature of the phenomenon being observed. Anomaly detection techniques must be able to adapt to a non-stationary data distribution in order to perform optimally. In this survey, we provide a comprehensive overview of approaches to anomaly detection in a WSN and their operation in a non-stationary environment.

An adaptive elliptical anomaly detection model for wireless sensor networks

Wireless Sensor Networks (WSNs) provide a low cost option for monitoring different environments such as farms, forests and water and electricity networks. However, the restricted energy resources of the network impede the collection of raw monitoring data from all the nodes to a single location for analysis. This has stimulated research into efficient anomaly detection techniques to extract information about unusual events such as malicious attacks or faulty sensors at each node. Many previous anomaly detection methods have relied on centralized processing of measurement data, which is highly communication intensive. In this paper, we present an efficient algorithm to detect anomalies in a decentralized manner. In particular, we propose a novel adaptive model for anomaly detection, as well as a robust method for modeling normal behavior. Our evaluation results on both real-life and simulated data sets demonstrate the accuracy of our approach compared to existing methods.

The structure of communities in scale-free networks

Scale-free networks are often used to model a wide range of real-world networks, such as social, technological, and biological networks. Understanding the structure of scale-free networks evolves into a big data problem for business, management, and protein function prediction. In the past decade, there has been a surge of interest in exploring the properties of scale-free networks. Two interesting properties have attracted much attention: the assortative mixing and community structure. However, these two properties have been studied separately in either theoretical models or real-world networks. In this paper, we show that the structural features of communities are highly related with the assortative mixing in scale-free networks. According to the value of assortativity coefficient, scale-free networks can be categorized into assortative, disassortative, and neutral networks, respectively. We systematically analyze the community structure in these three types of scale-free networks through six metrics: node embeddedness, link density, hub dominance, community compactness, the distribution of community sizes, and the presence of hierarchical communities. We find that the three types of scale-free networks exhibit significant differences in these six metrics of community structures. First, assortative networks present high embeddedness, meaning that many links lying within communities but few links lying between communities. This leads to the high link density of communities. Second, disassortative networks exhibit great hubs in communities, which results in the high compactness of communities that nodes can reach each other via short paths. Third, in neutral networks, a big portion of links act as community bridges, so they display sparse and less compact communities. In addition, we find that (dis)assortative networks show hierarchical community structure with power-law-distributed community sizes, while neutral networks present no hierarchy. Understanding the structure of communities from the angle of assortative mixing patterns of nodes can provide insights into the network structure and guide us in modeling information propagation in different categories of scale-free networks.