System configuration, fault detection, location, isolation and restoration: a review on LVDC Microgrid protections

Low voltage direct current (LVDC) distribution has gained the significant interest of research due to the advancements in power conversion technologies. However, the use of converters has given rise to several technical issues regarding their protections and controls of such devices under faulty conditions. Post-fault behaviour of converter-fed LVDC system involves both active converter control and passive circuit transient of similar time scale, which makes the protection for LVDC distribution significantly different and more challenging than low voltage AC. These protection and operational issues have handicapped the practical applications of DC distribution. This paper presents state-of-the-art protection schemes developed for DC Microgrids. With a close look at practical limitations such as the dependency on modelling accuracy, requirement on communications and so forth, a comprehensive evaluation is carried out on those system approaches in terms of system configurations， fault detection, location, isolation and restoration

An analytical performance model for the Spidergon NoC

Networks on chip (NoC) emerged as a promising alternative to bus-based interconnect networks to handle the increasing communication requirements of the large systems on chip. Employing an appropriate topology for a NoC is of high importance mainly because it typically trade-offs between cross-cutting concerns such as performance and cost. The spidergon topology is a novel architecture which is proposed recently for NoC domain. The objective of the spidergon NoC has been addressing the need for a fixed and optimized topology to realize cost effective multi-processor SoC (MPSoC) development [7]. In this paper we analyze the traffic behavior in the spidergon scheme and present an analytical evaluation of the average message latency in the architecture. We prove the validity of the analysis by comparing the model against the results produced by a discreteevent simulator

Resolving structural variability in network models and the brain

Large-scale white matter pathways crisscrossing the cortex create a complex pattern of connectivity that underlies human cognitive function. Generative mechanisms for this architecture have been difficult to identify in part because little is known about mechanistic drivers of structured networks. Here we contrast network properties derived from diffusion spectrum imaging data of the human brain with 13 synthetic network models chosen to probe the roles of physical network embedding and temporal network growth. We characterize both the empirical and synthetic networks using familiar diagnostics presented in statistical form, as scatter plots and distributions, to reveal the full range of variability of each measure across scales in the network. We focus on the degree distribution, degree assortativity, hierarchy, topological Rentian scaling, and topological fractal scaling---in addition to several summary statistics, including the mean clustering coefficient, shortest path length, and network diameter. The models are investigated in a progressive, branching sequence, aimed at capturing different elements thought to be important in the brain, and range from simple random and regular networks, to models that incorporate specific growth rules and constraints. We find that synthetic models that constrain the network nodes to be embedded in anatomical brain regions tend to produce distributions that are similar to those extracted from the brain. We also find that network models hardcoded to display one network property do not in general also display a second, suggesting that multiple neurobiological mechanisms might be at play in the development of human brain network architecture. Together, the network models that we develop and employ provide a potentially useful starting point for the statistical inference of brain network structure from neuroimaging data.Comment: 24 pages, 11 figures, 1 table, supplementary material

A Survey on the Network Models applied in the Industrial Network Optimization

Network architecture design is very important for the optimization of industrial networks. The type of network architecture can be divided into small-scale network and large-scale network according to its scale. Graph theory is an efficient mathematical tool for network topology modeling. For small-scale networks, its structure often has regular topology. For large-scale networks, the existing research mainly focuses on the random characteristics of network nodes and edges. Recently, popular models include random networks, small-world networks and scale-free networks. Starting from the scale of network, this survey summarizes and analyzes the network modeling methods based on graph theory and the practical application in industrial scenarios. Furthermore, this survey proposes a novel network performance metric - system entropy. From the perspective of mathematical properties, the analysis of its non-negativity, monotonicity and concave-convexity is given. The advantage of system entropy is that it can cover the existing regular network, random network, small-world network and scale-free network, and has strong generality. The simulation results show that this metric can realize the comparison of various industrial networks under different models.Comment: 26 pages, 11 figures, Journa

RiskNet: neural risk assessment in networks of unreliable resources

We propose a graph neural network (GNN)-based method to predict the distribution of penalties induced by outages in communication networks, where connections are protected by resources shared between working and backup paths. The GNN-based algorithm is trained only with random graphs generated on the basis of the Barabási–Albert model. However, the results obtained show that we can accurately model the penalties in a wide range of existing topologies. We show that GNNs eliminate the need to simulate complex outage scenarios for the network topologies under study—in practice, the entire time of path placement evaluation based on the prediction is no longer than 4 ms on modern hardware. In this way, we gain up to 12 000 times in speed improvement compared to calculations based on simulations.This work was supported by the Polish Ministry of Science and Higher Education with the subvention funds of the Faculty of Computer Science, Electronics and Telecommunications of AGH University of Science and Technology (P.B., P.C.) and by the PL-Grid Infrastructure (K.R.).Peer ReviewedPostprint (published version

The Minimum Circuity Frontier and the Journey to Work

In an urban context people travel between places of residence and work destinations via transportation networks. Transportation studies that involve measurements of distances between residence and work locations tend to use Euclidean distances rather than Network distances. This is due to the historic difficulty in calculating network distances and based on assumptions that differences between Euclidean distance and network distance tend to be constant. This assumption is true only when variation in the network is minor and when self-selection is not present. In this paper we use circuity, the ratio of network to Euclidean distance, as a tool to better understand the choice of residential location relative to work. This is done using two methods of defining origins and destinations in the Twin Cities metropolitan region. The first method of selection is based on actual choice of residence and work locations. The second is based on a randomly selected dataset of origins and destinations in the same region. The findings of the study show circuity measured through randomly selected origins and destinations differ from circuity measured from actual origins and destinations. Workers tend to reside in areas where the circuity is lower, applying intelligence to their location decisions. We posit this because locators wish to achieve the largest residential lot at the shortest commute time. This finding reveals an important issue related to resident choice and location theory and how resident workers tend to locate in an urban context.Network structure, travel behavior, transport geography, commuting, circuity

A Statistical Approach Reveals Designs for the Most Robust Stochastic Gene Oscillators

The engineering of transcriptional networks presents many challenges due to the inherent uncertainty in the system structure, changing cellular context, and stochasticity in the governing dynamics. One approach to address these problems is to design and build systems that can function across a range of conditions; that is they are robust to uncertainty in their constituent components. Here we examine the parametric robustness landscape of transcriptional oscillators, which underlie many important processes such as circadian rhythms and the cell cycle, plus also serve as a model for the engineering of complex and emergent phenomena. The central questions that we address are: Can we build genetic oscillators that are more robust than those already constructed? Can we make genetic oscillators arbitrarily robust? These questions are technically challenging due to the large model and parameter spaces that must be efficiently explored. Here we use a measure of robustness that coincides with the Bayesian model evidence, combined with an efficient Monte Carlo method to traverse model space and concentrate on regions of high robustness, which enables the accurate evaluation of the relative robustness of gene network models governed by stochastic dynamics. We report the most robust two and three gene oscillator systems, plus examine how the number of interactions, the presence of autoregulation, and degradation of mRNA and protein affects the frequency, amplitude, and robustness of transcriptional oscillators. We also find that there is a limit to parametric robustness, beyond which there is nothing to be gained by adding additional feedback. Importantly, we provide predictions on new oscillator systems that can be constructed to verify the theory and advance design and modeling approaches to systems and synthetic biology