Predicting voltage unbalance impacts of plug-in electric vehicles penetration in residential low-voltage distribution networks

Plug-in electric vehicles will soon be connected to residential distribution networks in high quantities and will add to already overburdened residential feeders. However, as battery technology improves, plug-in electric vehicles will also be able to support networks as small distributed generation units by transferring the energy stored in their battery into the grid. Even though the increase in the plug-in electric vehicle connection is gradual, their connection points and charging/discharging levels are random. Therefore, such single-phase bidirectional power flows can have an adverse effect on the voltage unbalance of a three-phase distribution network. In this article, a voltage unbalance sensitivity analysis based on charging/discharging levels and the connection point of plug-in electric vehicles in a residential low-voltage distribution network is presented. Due to the many uncertainties in plug-in electric vehicle ratings and connection points and the network load, a Monte Carlo-based stochastic analysis is developed to predict voltage unbalance in the network in the presence of plug-in electric vehicles. A failure index is introduced to demonstrate the probability of non-standard voltage unbalance in the network due to plug-in electric vehicles.

Working together-apart : exploring the relationships between formal and informal care networks for people dying at home

Introduction Informal caring networks contribute significantly to end-of-life (EOL) care in the community. However, to ensure that these networks are sustainable, and unpaid carers are not exploited, primary carers need permission and practical assistance to gather networks together and negotiate the help they need. Our aim in this study was to develop an understanding of how formal and informal carers work together when care is being provided in a dying person's home. We were particularly interested in formal providers’ perceptions and knowledge of informal networks of care and in identifying barriers to the networks working together. Methods Qualitative methods, informed by an interpretive approach, were used. In February-July 2012, 10 focus groups were conducted in urban, regional, and rural Australia comprising 88 participants. Findings Our findings show that formal providers are aware, and supportive, of the vital role informal networks play in the care of the dying at home. A number of barriers to formal and informal networks working together more effectively were identified. In particular, we found that the Australian policy of health-promoting palliative is not substantially translating to practice. Conclusion Combinations of formal and informal caring networks are essential to support people and their primary carers. Formal service providers do little to establish, support, or maintain the informal networks although there is much goodwill and scope for them to do so. Further re-orientation towards a health-promoting palliative care and community capacity building approach is suggested.

Mechanics of microfilaments networks : a cross-scales study

The mechanical properties of microfilament networks are systematically summarized at different special scales in this paper. We have presented the mechanical models of single microfilaments and microfilament networks at microscale. By adopting a coarse-grained simulation strategy, the mechanical stability of microfilaments related cellular structures are analysed. Structural analysis is conducted to microfilament networks to understand the stress relaxation under compression. The nanoscale molecular mechanisms of the microfilaments deformation is also summarized from the viewpoint of molecular dynamics simulation. This paper provides the fundaments of multiscale modelling framework for the mechanical behaviours simulation of hierarchical microfilament networks.

Detection of sinkhole attack in wireless sensor networks

Generally wireless sensor networks rely of many-to-one communication approach for data gathering. This approach is extremely susceptible to sinkhole attack, where an intruder attracts surrounding nodes with unfaithful routing information, and subsequently presents selective forwarding or change the data that carry through it. A sinkhole attack causes an important threat to sensor networks and it should be considered that the sensor nodes are mostly spread out in open areas and of weak computation and battery power. In order to detect the intruder in a sinkhole attack this paper suggests an algorithm which firstly finds a group of suspected nodes by analyzing the consistency of data. Then, the intruder is recognized efficiently in the group by checking the network flow information. The proposed algorithm's performance has been evaluated by using numerical analysis and simulations. Therefore, accuracy and efficiency of algorithm would be verified.

L-dopa modulates functional connectivity in striatal cognitive and motor networks: A double-blind placebo-controlled study

Functional connectivity (FC) analyses of resting-state fMRI data allow for the mapping of large-scale functional networks, and provide a novel means of examining the impact of dopaminergic challenge. Here, using a double-blind, placebo-controlled design, we examined the effect of L-dopa, a dopamine precursor, on striatal resting-state FC in 19 healthy young adults.Weexamined the FC of 6 striatal regions of interest (ROIs) previously shown to elicit networks known to be associated with motivational, cognitive and motor subdivisions of the caudate and putamen (Di Martino et al., 2008). In addition to replicating the previously demonstrated patterns of striatal FC, we observed robust effects of L-dopa. Specifically, L-dopa increased FC in motor pathways connecting the putamen ROIs with the cerebellum and brainstem. Although L-dopa also increased FC between the inferior ventral striatum and ventrolateral prefrontal cortex, it disrupted ventral striatal and dorsal caudate FC with the default mode network. These alterations in FC are consistent with studies that have demonstrated dopaminergic modulation of cognitive and motor striatal networks in healthy participants. Recent studies have demonstrated altered resting state FC in several conditions believed to be characterized by abnormal dopaminergic neurotransmission. Our findings suggest that the application of similar experimental pharmacological manipulations in such populations may further our understanding of the role of dopaminergic neurotransmission in those conditions.

Multiple stages classification of Alzheimer’s disease based on structural brain networks using generalized low rank approximations (GLRAM)

To classify each stage for a progressing disease such as Alzheimer’s disease is a key issue for the disease prevention and treatment. In this study, we derived structural brain networks from diffusion-weighted MRI using whole-brain tractography since there is growing interest in relating connectivity measures to clinical, cognitive, and genetic data. Relatively little work has usedmachine learning to make inferences about variations in brain networks in the progression of the Alzheimer’s disease. Here we developed a framework to utilize generalized low rank approximations of matrices (GLRAM) and modified linear discrimination analysis for unsupervised feature learning and classification of connectivity matrices. We apply the methods to brain networks derived from DWI scans of 41 people with Alzheimer’s disease, 73 people with EMCI, 38 people with LMCI, 47 elderly healthy controls and 221 young healthy controls. Our results show that this new framework can significantly improve classification accuracy when combining multiple datasets; this suggests the value of using data beyond the classification task at hand to model variations in brain connectivity.

An Examination of How Entrepreneurs Can Improve Their Position in Relation to Investors

Previous research has been inconclusive regarding the impact of those who invest in entrepreneurs. Consider for a moment how potentially important they are to entrepreneurs. They for example decide who deserves funding, how much time they contribute to their portfolio firms, how they grant entrepreneurs access to their networks, and help entrepreneurs acquire additional funding. In sum, investors potentially have a great impact on the success of entrepreneurs. It is therefore important that we better understand the environment, relationships and context in which parties operate. This thesis contains five articles that explore investors’ and entrepreneurs’ relationships from various viewpoints, in theoretical frameworks, and use a variety of data and research methods. The first article is a literature review that summarises what we know of venture capital, business angel and corporate venture capital funding. The second article studies the entrepreneurs’ investor selection process, its consequences, and identifies key factors that influence the process. Earlier, the common approach has been to concentrate research on the investors’ selection policy, not the entrepreneurs’. The data and conclusions are based on multiple case studies. The article analyses how entrepreneurs can ensure that they get the best possible investor, when it is possible for an entrepreneur to select an investor, and what are the consequences of investor selection. The third article employs power constructs (dependency, power balance/imbalance, power sources) and analyses their applicability in the investor-entrepreneur relationship. Power constructs are extensively studied and utilised in the management and organisation literature. In entrepreneur investor relationships, power aspects are rarely analysed. However, having the ability to “get others to do things they would not otherwise do” is a very common factor in the investor-entrepreneur relationship. Therefore, employing and analysing the applicability of power constructs in this setting is well founded. The article is based on a single case study but suggests that power constructs could be applicable and consequently provide additional insights into the investor-entrepreneur relationship. The fourth article studies the role of advisors in the venture capital investment process and analyses implications for research and practice, particularly from the entrepreneurs’ perspective. The common entrepreneurial finance literature describes the entrepreneur-investor relationship as linear and bilateral. However, it was discovered that advisors may influence the relationship. In this article, the role of advisors, operating procedures and advisors’ impact on different parties is analysed. The fifth article concentrates on investors’ certification effect. The article measures and demonstrates that venture capital investment is likely to increase the credibility (in terms of media attention) of early stage firms, those that most often need additional credibility. Understanding investor certification can affect how entrepreneurs evaluate investment offers and how investors can make their offers appear more lucrative.

Topological analysis of general linear networks

A new method of network analysis, a generalization in several different senses of existing methods and applicable to all networks for which a branch-admittance (or impedance) matrix can be formed, is presented. The treatment of network determinants is very general and essentially four terminal rather than three terminal, and leads to simple expressions based on trees of a simple graph associated with the network and matrix, and involving products of low-order, usually(2 times 2)determinants of tree-branch admittances, in addition to tree-branch products as in existing methods. By comparison with existing methods, the total number of trees and of tree pairs is usually considerably reduced, and this fact, together with an easy method of tree-pair sign determination which is also presented, makes the new method simpler in general. The method can be very easily adapted, by the use of infinite parameters, to accommodate ideal transformers, operational amplifiers, and other forms of network constraint; in fact, is thought to be applicable to all linear networks.

Prediction of Ground Water Levels in the Uplands of a Tropical Coastal Riparian Wetland using Artificial Neural Networks

Artificial Neural Networks (ANNs) have been found to be a robust tool to model many non-linear hydrological processes. The present study aims at evaluating the performance of ANN in simulating and predicting ground water levels in the uplands of a tropical coastal riparian wetland. The study involves comparison of two network architectures, Feed Forward Neural Network (FFNN) and Recurrent Neural Network (RNN) trained under five algorithms namely Levenberg Marquardt algorithm, Resilient Back propagation algorithm, BFGS Quasi Newton algorithm, Scaled Conjugate Gradient algorithm, and Fletcher Reeves Conjugate Gradient algorithm by simulating the water levels in a well in the study area. The study is analyzed in two cases-one with four inputs to the networks and two with eight inputs to the networks. The two networks-five algorithms in both the cases are compared to determine the best performing combination that could simulate and predict the process satisfactorily. Ad Hoc (Trial and Error) method is followed in optimizing network structure in all cases. On the whole, it is noticed from the results that the Artificial Neural Networks have simulated and predicted the water levels in the well with fair accuracy. This is evident from low values of Normalized Root Mean Square Error and Relative Root Mean Square Error and high values of Nash-Sutcliffe Efficiency Index and Correlation Coefficient (which are taken as the performance measures to calibrate the networks) calculated after the analysis. On comparison of ground water levels predicted with those at the observation well, FFNN trained with Fletcher Reeves Conjugate Gradient algorithm taken four inputs has outperformed all other combinations.

DMT of parallel-path and layered networks under the half-duplex constraint

In this paper, we study the diversity-multiplexing-gain tradeoff (DMT) of wireless relay networks under the half-duplex constraint. It is often unclear what penalty if any, is imposed by the half-duplex constraint on the DMT of such networks. We study two classes of networks; the first class, called KPP(I) networks, is the class of networks with the relays organized in K parallel paths between the source and the destination. While we assume that there is no direct source-destination path, the K relaying paths can interfere with each other. The second class, termed as layered networks, is comprised of relays organized in layers, where links exist only between adjacent layers. We present a communication scheme based on static schedules and amplify-and-forward relaying for these networks. We also show that for KPP(I) networks with K >= 3, the proposed schemes can achieve full-duplex DMT performance, thus demonstrating that there is no performance hit on the DMT due to the half-duplex constraint. We also show that, for layered networks, a linear DMT of d(max)(1 - r)(+) between the maximum diversity d(max) and the maximum MG, r(max) = 1 is achievable. We adapt existing DMT optimal coding schemes to these networks, thus specifying the end-to-end communication strategy explicitly.

On interference alignment for symmetrically connected interference networks with line of sight channels at finite powers

In this work, interference alignment for a class of Gaussian interference networks with general message demands, having line of sight (LOS) channels, at finite powers is considered. We assume that each transmitter has one independent message to be transmitted and the propagation delays are uniformly distributed between 0 and (L - 1) (L >; 0). If receiver-j, j ∈{1,2,..., J}, requires the message of transmitter-i, i ∈ {1, 2, ..., K}, we say (i, j) belongs to a connection. A class of interference networks called the symmetrically connected interference network is defined as a network where, the number of connections required at each transmitter-i is equal to ct for all i and the number of connections required at each receiver-j is equal to cr for all j, for some fixed positive integers ct and cr. For such networks with a LOS channel between every transmitter and every receiver, we show that an expected sum-spectral efficiency (in bits/sec/Hz) of at least K/(e+c1-1)(ct+1) (ct/ct+1)ct log2 (1+min(i, j)∈c|hi, j|2 P/WN0) can be achieved as the number of transmitters and receivers tend to infinity, i.e., K, J →∞ where, C denotes the set of all connections, hij is the channel gain between transmitter-i and receiver-j, P is the average power constraint at each transmitter, W is the bandwidth and N0 W is the variance of Gaussian noise at each receiver. This means that, for an LOS symmetrically connected interference network, at any finite power, the total spectral efficiency can grow linearly with K as K, J →∞. This is achieved by extending the time domain interference alignment scheme proposed by Grokop et al. for the k-user Gaussian interference channel to interference networks.

Percolation on networks with antagonistic and dependent interactions

Drawing inspiration from real world interacting systems, we study a system consisting of two networks that exhibit antagonistic and dependent interactions. By antagonistic and dependent interactions we mean that a proportion of functional nodes in a network cause failure of nodes in the other, while failure of nodes in the other results in failure of links in the first. In contrast to interdependent networks, which can exhibit first-order phase transitions, we find that the phase transitions in such networks are continuous. Our analysis shows that, compared to an isolated network, the system is more robust against random attacks. Surprisingly, we observe a region in the parameter space where the giant connected components of both networks start oscillating. Furthermore, we find that for Erdos-Renyi and scale-free networks the system oscillates only when the dependence and antagonism between the two networks are very high. We believe that this study can further our understanding of real world interacting systems.

Cancer classification based on direction-basis-function neural networks

Automatic molecular classification of cancer based on DNA microarray has many advantages over conventional classification based on morphological appearance of the tumor. Using artificial neural networks is a general approach for automatic classification. In this paper, Direction-Basis-Function neuron and Priority-Ordered algorithm are applied to neural networks. And the leukemia gene expression dataset is used as an example to testify the classifier. The result of our method is compared to that of SVM. It shows that our method makes a better performance than SVM.

An Adaptive Policy Management Approach to BGP Convergence

The Border Gateway Protocol (BGP) is the current inter-domain routing protocol used to exchange reachability information between Autonomous Systems (ASes) in the Internet. BGP supports policy-based routing which allows each AS to independently adopt a set of local policies that specify which routes it accepts and advertises from/to other networks, as well as which route it prefers when more than one route becomes available. However, independently chosen local policies may cause global conflicts, which result in protocol divergence. In this paper, we propose a new algorithm, called Adaptive Policy Management Scheme (APMS), to resolve policy conflicts in a distributed manner. Akin to distributed feedback control systems, each AS independently classifies the state of the network as either conflict-free or potentially-conflicting by observing its local history only (namely, route flaps). Based on the degree of measured conflicts (policy conflict-avoidance vs. -control mode), each AS dynamically adjusts its own path preferences—increasing its preference for observably stable paths over flapping paths. APMS also includes a mechanism to distinguish route flaps due to topology changes, so as not to confuse them with those due to policy conflicts. A correctness and convergence analysis of APMS based on the substability property of chosen paths is presented. Implementation in the SSF network simulator is performed, and simulation results for different performance metrics are presented. The metrics capture the dynamic performance (in terms of instantaneous throughput, delay, routing load, etc.) of APMS and other competing solutions, thus exposing the often neglected aspects of performance.