Investigation of AIMD based charging strategies for EVs connected to a low-voltage distribution network

In this paper we consider charging strategies that mitigate the impact of domestic charging of EVs on low-voltage distribution networks and which seek to reduce peak power by responding to time-ofday pricing. The strategies are based on the distributed Additive Increase and Multiplicative Decrease (AIMD) charging algorithms proposed in [5]. The strategies are evaluated using simulations conducted on a custom OpenDSS-Matlab platform for a typical low voltage residential feeder network. Results show that by using AIMD based smart charging 50% EV penetration can be accommodated on our test network, compared to only 10% with uncontrolled charging, without needing to reinforce existing network infrastructure. © Springer-Verlag Berlin Heidelberg 2013.

On-off based charging strategies for EVs connected to a Low Voltage distributon network

The development of appropriate Electric Vehicle (EV) charging strategies has been identified as an effective way to accommodate an increasing number of EVs on Low Voltage (LV) distribution networks. Most research studies to date assume that future charging facilities will be capable of regulating charge rates continuously, while very few papers consider the more realistic situation of EV chargers that support only on-off charging functionality. In this work, a distributed charging algorithm applicable to on-off based charging systems is presented. Then, a modified version of the algorithm is proposed to incorporate real power system constraints. Both algorithms are compared with uncontrolled and centralized charging strategies from the perspective of both utilities and customers. © 2013 IEEE.

MIMO cooperative communication network design with relay selection and CSI feedback

In this paper, we investigate an amplify-and-forward (AF) multiple-input multiple-output - spatial division multiplexing (MIMO-SDM) cooperative wireless networks, where each network node is equipped with multiple antennas. In order to deal with the problems of signal combining at the destination and cooperative relay selection, we propose an improved minimum mean square error (MMSE) signal combining scheme for signal recovery at the destination. Additionally, we propose two distributed relay selection algorithms based on the minimum mean squared error (MSE) of the signal estimation for the cases where channel state information (CSI) from the source to the destination is available and unavailable at the candidate nodes. Simulation results demonstrate that the proposed combiner together with the proposed relay selection algorithms achieve higher diversity gain than previous approaches in both flat and frequency-selective fading channels.

Two-Stage Orthogonal Least Squares Methods for Neural Network Construction

A number of neural networks can be formulated as the linear-in-the-parameters models. Training such networks can be transformed to a model selection problem where a compact model is selected from all the candidates using subset selection algorithms. Forward selection methods are popular fast subset selection approaches. However, they may only produce suboptimal models and can be trapped into a local minimum. More recently, a two-stage fast recursive algorithm (TSFRA) combining forward selection and backward model refinement has been proposed to improve the compactness and generalization performance of the model. This paper proposes unified two-stage orthogonal least squares methods instead of the fast recursive-based methods. In contrast to the TSFRA, this paper derives a new simplified relationship between the forward and the backward stages to avoid repetitive computations using the inherent orthogonal properties of the least squares methods. Furthermore, a new term exchanging scheme for backward model refinement is introduced to reduce computational demand. Finally, given the error reduction ratio criterion, effective and efficient forward and backward subset selection procedures are proposed. Extensive examples are presented to demonstrate the improved model compactness constructed by the proposed technique in comparison with some popular methods.

Neural Network Based Attack on a Masked Implementation of AES

Masked implementations of cryptographic algorithms are often used in commercial embedded cryptographic devices to increase their resistance to side channel attacks. In this work we show how neural networks can be used to both identify the mask value, and to subsequently identify the secret key value with a single attack trace with high probability. We propose the use of a pre-processing step using principal component analysis (PCA) to significantly increase the success of the attack. We have developed a classifier that can correctly identify the mask for each trace, hence removing the security provided by that mask and reducing the attack to being equivalent to an attack against an unprotected implementation. The attack is performed on the freely available differential power analysis (DPA) contest data set to allow our work to be easily reproducible. We show that neural networks allow for a robust and efficient classification in the context of side-channel attacks.

A spatial approach to network generation for three properties:Degree distribution, clustering coefficient and degree assortativity

Social networks generally display a positively skewed degree distribution and higher values for clustering coefficient and degree assortativity than would be expected from the degree sequence. For some types of simulation studies, these properties need to be varied in the artificial networks over which simulations are to be conducted. Various algorithms to generate networks have been described in the literature but their ability to control all three of these network properties is limited. We introduce a spatially constructed algorithm that generates networks with constrained but arbitrary degree distribution, clustering coefficient and assortativity. Both a general approach and specific implementation are presented. The specific implementation is validated and used to generate networks with a constrained but broad range of property values. © Copyright JASSS.

Task sharing within a managed clinical network to improve child health in Malawi

BACKGROUND: Eighty per cent of Malawi's 8 million children live in rural areas, and there is an extensive tiered health system infrastructure from village health clinics to district hospitals which refers patients to one of the four central hospitals. The clinics and district hospitals are staffed by nurses, non-physician clinicians and recently qualified doctors. There are 16 paediatric specialists working in two of the four central hospitals which serve the urban population as well as accepting referrals from district hospitals. In order to provide expert paediatric care as close to home as possible, we describe our plan to task share within a managed clinical network and our hypothesis that this will improve paediatric care and child health.

PRESENTATION OF THE HYPOTHESIS: Managed clinical networks have been found to improve equity of care in rural districts and to ensure that the correct care is provided as close to home as possible. A network for paediatric care in Malawi with mentoring of non-physician clinicians based in a district hospital by paediatricians based at the central hospitals will establish and sustain clinical referral pathways in both directions. Ultimately, the plan envisages four managed paediatric clinical networks, each radiating from one of Malawi's four central hospitals and covering the entire country. This model of task sharing within four hub-and-spoke networks may facilitate wider dissemination of scarce expertise and improve child healthcare in Malawi close to the child's home.

TESTING THE HYPOTHESIS: Funding has been secured to train sufficient personnel to staff all central and district hospitals in Malawi with teams of paediatric specialists in the central hospitals and specialist non-physician clinicians in each government district hospital. The hypothesis will be tested using a natural experiment model. Data routinely collected by the Ministry of Health will be corroborated at the district. This will include case fatality rates for common childhood illness, perinatal mortality and process indicators. Data from different districts will be compared at baseline and annually until 2020 as the specialists of both cadres take up posts.

IMPLICATIONS OF THE HYPOTHESIS: If a managed clinical network improves child healthcare in Malawi, it may be a potential model for the other countries in sub-Saharan Africa with similar cadres in their healthcare system and face similar challenges in terms of scarcity of specialists.

Feature Study on a Programmable Network Traffic Classifier

Monitoring and tracking of IP traffic flows are essential for network services (i.e. packet forwarding). Packet header lookup is the main part of flow identification by determining the predefined matching action for each incoming flow. In this paper, an improved header lookup and flow rule update solution is investigated. A detailed study of several well-known lookup algorithms reveals that searching individual packet header field and combining the results achieve high lookup speed and flexibility. The proposed hybrid lookup architecture is comprised of various lookup algorithms, which are selected based on the user applications and system requirements.

Comparison of module detection algorithms in protein networks and investigation of the biological meaning of predicted modules

Background
It is generally acknowledged that a functional understanding of a biological system can only be obtained by an understanding of the collective of molecular interactions in form of biological networks. Protein networks are one particular network type of special importance, because proteins form the functional base units of every biological cell. On a mesoscopic level of protein networks, modules are of significant importance because these building blocks may be the next elementary functional level above individual proteins allowing to gain insight into fundamental organizational principles of biological cells.
Results
In this paper, we provide a comparative analysis of five popular and four novel module detection algorithms. We study these module prediction methods for simulated benchmark networks as well as 10 biological protein interaction networks (PINs). A particular focus of our analysis is placed on the biological meaning of the predicted modules by utilizing the Gene Ontology (GO) database as gold standard for the definition of biological processes. Furthermore, we investigate the robustness of the results by perturbing the PINs simulating in this way our incomplete knowledge of protein networks.
Conclusions
Overall, our study reveals that there is a large heterogeneity among the different module prediction algorithms if one zooms-in the biological level of biological processes in the form of GO terms and all methods are severely affected by a slight perturbation of the networks. However, we also find pathways that are enriched in multiple modules, which could provide important information about the hierarchical organization of the system