With the growing capacity of distributed renewable energy resources (RERs) integrated into distribution grids, the power flow distribution becomes more complex. Traditional fault diagnosis solutions are proving inadeq...
详细信息
ISBN:
(纸本)9798350373486;9798350373479
With the growing capacity of distributed renewable energy resources (RERs) integrated into distribution grids, the power flow distribution becomes more complex. Traditional fault diagnosis solutions are proving inadequate for the demands of the evolving distribution network, thereby diminishing the reliability and sensitivity of the protection system. To address this challenge, this paper introduces an innovative fault diagnosis approach for distribution networks incorporating RERs, leveraging signal processing techniques and machine learning algorithms. Initially, effective features are obtained from the measured current signals by the Hilbert-Huang transform (HHT). Subsequently, these fault features serve as inputs for training feed-forward neuralnetworks to build fault diagnosis models (including detection, classification, and segment identification). Simulation tests are conducted on a 13-node distribution network with three different types of RERs. Simulation results show that the method can accurately diagnose distribution network faults, and is robust to fault inception angle variations, transition resistance, and noise interference.
We study structured convex optimization problems, with additive objective r := p + q, where r is (mu-strongly) convex, q is L-q-smooth and convex, and p is L-p-smooth, possibly nonconvex. For such a class of problems,...
详细信息
ISBN:
(纸本)9781713871088
We study structured convex optimization problems, with additive objective r := p + q, where r is (mu-strongly) convex, q is L-q-smooth and convex, and p is L-p-smooth, possibly nonconvex. For such a class of problems, we proposed an inexact accelerated gradient sliding method that can skip the gradient computation for one of these components while still achieving optimal complexity of gradient calls of p and q, that is, O(root L-p/mu) and O(root L-q/mu), respectively. This result is much sharper than the classic black-box complexityO(root(L-p + L-q)/mu), especially when the difference between L-p and L-q is large. We then apply the proposed method to solve distributed optimization problems over master-worker architectures, under agents' function similarity, due to statistical data similarity or otherwise. The distributed algorithm achieves for the first time lower complexity bounds on both communication and local gradient calls, with the former having being a longstanding open problem. Finally the method is extended to distributed saddleproblems (under function similarity) by means of solving a class of variational inequalities, achieving lower communication and computation complexity bounds.
In this paper we focus on the development of a convolutional recurrent neuralnetwork (CRNN) to categorize biosignals collected in the Hellenic Trench, generated by two cetacean species, sperm whales (Physeter macroce...
详细信息
Large deep neuralnetwork (DNN) models have demonstrated exceptional performance across diverse downstream tasks. Sharded data parallelism (SDP) has been widely used to reduce the memory footprint of model states. In ...
详细信息
This study explores the application of thermal imaging in breast cancer diagnostics, presenting a novel methodology that integrates pre-processing techniques and Convolutional neuralnetworks (CNN) for the classificat...
详细信息
The binding problem is one of the fundamental challenges that prevent the artificial neuralnetwork (ANNs) from a compositional understanding of the world like human perception, because disentangled and distributed re...
详细信息
ISBN:
(纸本)9781713871088
The binding problem is one of the fundamental challenges that prevent the artificial neuralnetwork (ANNs) from a compositional understanding of the world like human perception, because disentangled and distributed representations of generative factors can interfere and lead to ambiguity when complex data with multiple objects are presented. In this paper, we propose a brain-inspired hybrid neuralnetwork (HNN) that introduces temporal binding theory originated from neuroscience into ANNs by integrating spike timing dynamics (via spiking neuralnetworks, SNNs) with reconstructive attention (by ANNs). Spike timing provides an additional dimension for grouping, while reconstructive feedback coordinates the spikes into temporal coherent states. Through iterative interaction of ANN and SNN, the model continuously binds multiple objects at alternative synchronous firing times in the SNN coding space. The effectiveness of the model is evaluated on synthetic datasets of binary images. By visualization and analysis, we demonstrate that the binding is explainable, soft, flexible, and hierarchical. Notably, the model is trained on single object datasets without explicit supervision on grouping, but successfully binds multiple objects on test datasets, showing its compositional generalization capability. Further results show its binding ability in dynamic situations.
The purpose of this research is to propose a methodology utilizing machine learning techniques to support medical organizations in effectively managing risks. Specifically, the study aims to connect social media data ...
详细信息
The purpose of this research is to propose a methodology utilizing machine learning techniques to support medical organizations in effectively managing risks. Specifically, the study aims to connect social media data to identify and assess potential threats, ultimately enabling healthcare management to make informed decisions for their organizations and clients. The research employs machine learning algorithms to analyze user-generated content on social media platforms, generating comprehensive visual representations of various risk categories and their magnitudes. Additionally, the study utilizes data simplification techniques, including categorization, to streamline data processing and enhance overall efficiency. A computational framework is also developed, incorporating closed-form connections for threat assessment and evaluation. The study further empirically analyses the Consumer Value Stores (CVS) established for medical care in the United States. The findings reveal that prevalent threats within the lower quartile of client messages about CVS services include operational, financial, and technological risks. The severity of these risks is distributed among high risk (21.8%), moderate risk (78%), and minimal risk (0.2%). The research also presents several metrics to demonstrate the robustness of the proposed framework, confirming its effectiveness in effectively identifying and addressing potential threats. This research provides insights that can help healthcare management make informed decisions and foster a safer and more secure environment for their organizations and the people they serve.
Software Defined networking (SDN) has emerged as a promising paradigm offering an unprecedented programmability, scalability and fine-grained control over forwarding elements (FE). Mainly, SDN decouples the forwarding...
详细信息
Software Defined networking (SDN) has emerged as a promising paradigm offering an unprecedented programmability, scalability and fine-grained control over forwarding elements (FE). Mainly, SDN decouples the forwarding plane from the control plane which is moved to a central controller that is in charge of taking routing decisions in the network. However, SDN is rife with vulnerabilities so that several network attacks, especially distributed Denial of Service (DDoS), can be launched from compromised hosts connected to switches. DDoS attacks can easily overload the controller processing capacity and flood switch flow-tables. This paper deals with the security issue in SDN. It proposes a real-time protection against DDoS attacks that is based on a controller-side sliding window rate limiting approach which relies on a weighted abstraction of the underlying network. A weight defines the allowable amount of data that can be transmitted by a node and is dynamically updated according to its contribution to: (1) the queueing capacity of the controller, and (2) the number of flow-rules in the switch. Hence, a new deep learning algorithm, denoted the Parallel Online Deep Learning algorithm (PODL), is defined in order to update weights on the-fly according to both aforementioned constraints simultaneously. Furthermore, the behavior of each host and each switch is evaluated through a measure of trustworthiness which is used to penalize mis-behaving ones by prohibiting new flow requests or PacketIn messages for a period of time. Host trustworthiness is based on their weights while switch trustworthiness is achieved through a computation of the Average Nearest-Neighbor Degree (ANND). Realistic experiments show that the proposed solution succeeds in minimizing the impact of DDoS attacks on both the controllers and the switches regarding the PacketIn arrival rate at the controller, the rate of accepted requests and the flow-table usage.
In this paper, we study the problem of distributed optimization using an arbitrary network of lightweight computing nodes, where each node can only send/receive information to/from its direct neighbors. Decentralized ...
详细信息
In this paper, we study the problem of distributed optimization using an arbitrary network of lightweight computing nodes, where each node can only send/receive information to/from its direct neighbors. Decentralized stochastic gradient descent (SGD) has been shown to be an effective method to train machine learning models in this setting. Although decentralized SGD has been extensively studied, most prior works focus on the error-versus-iterations convergence, without taking into account how the topology affects the communication delay per iteration. For example, a denser (sparser) network topology results in faster (slower) error convergence in terms of iterations, but it incurs more (less) communication time per iteration. We propose MATCHA, an algorithm that can achieve a win-win in this error-runtime trade-off for any arbitrary network topology. The main idea of MATCHA is to communicate more frequently over connectivity-critical links in order to ensure fast convergence, and at the same time minimize the communication delay per iteration by using other links less frequently. It strikes this balance by decomposing the topology into matchings and then optimizing the set of matchings that are activated in each iteration. Experiments on a suite of datasets and deep neuralnetworks validate the theoretical analyses and demonstrate that MATCHA takes up to 5x less time than vanilla decentralized SGD to reach the same training loss. The idea of MATCHA can be applied to any decentralized algorithm that involves a communication step with neighbors in a graph.
Due to the distributed nature of the electrical grid, intelligent, timely control of critical components such as volt-age regulators, capacitor banks and switches in a highly dynamic environment is extremely challengi...
详细信息
暂无评论