Federated learning (FL) is a decentralized machine learning framework that prioritizes privacy by allowing clients to train statistical models without sharing their private data, thus eliminating the impact of data fo...
Federated learning (FL) is a decentralized machine learning framework that prioritizes privacy by allowing clients to train statistical models without sharing their private data, thus eliminating the impact of data fortresses. However, the presence of Byzantine attacks, such as data poisoning and backdoor attack, threatens the robustness of FL schemes. Currently, existing mainstream defense methods are susceptible to multiple adaptive attacks, some of which even violate the privacy principle of FL. Furthermore, these defense schemes become less robust when subjected to targeted poisoning attacks with highly non-IID data distributions. In this work, we propose FedNAT, a novel Byzantine-robust FL framework for whittling away these limitations mentioned above. Specifically, FedNAT first performs a privacy-respecting attention refinement on the activation layer outputs of the local uploads. Then, the server scores the local attentions by calculating their Wasserstein distances and clusters them through the k-median algorithm for global attention aggregation, thus rejecting poisoned local attentions for untargeted attacks. After this process, the global attention is transferred to local attention through the FedNAT loss function, which erases backdoors through the distillation concept. We conduct a comprehensive experimental evaluation to demonstrate that FedNAT significantly outperforms existing robust FL schemes in defending against Byzantine poisoning attacks under both IID and highly non-IID data proportions.
With the popularization of automobile and the progress of computer vision detection technology, intelligent license plate detection technology has gradually become an important part of intelligent traffic management. ...
详细信息
With the popularization of automobile and the progress of computer vision detection technology, intelligent license plate detection technology has gradually become an important part of intelligent traffic management. License plate detection is used to segment vehicle image and obtain license plate area for follow-up recognition system to screen. It is widely used in intelligent traffic management, vehicle video monitoring and other fields. In this paper, two license plate detection methods are studied, one is based on Sobel edge detection and the other is based on morphological gradient detection. Basing on OpenCV and visual studio 2012 under Windows system, two methods of license plate detection are implemented, and the two algorithms are compared in detail from the aspects of license plate detection accuracy. These methods have high efficiency and good interactivity, which provide a reference for later license plate recognition.
Computational methods are nowadays ubiquitous in the field of bioinformatics and biomedicine. Besides established fields like molecular dynamics, genomics or neuroimaging, new emerging methods rely heavily on large sc...
详细信息
Computational methods are nowadays ubiquitous in the field of bioinformatics and biomedicine. Besides established fields like molecular dynamics, genomics or neuroimaging, new emerging methods rely heavily on large scale computational resources. These new methods need to manage Tbytes or Pbytes of data with large-scale structural and functional relationships, TFlops or PFlops of computing power for simulating highly complex models, or many-task processes and workflows for processing and analyzing data. Today, many areas in Life Sciences are facing these challenges. This special issue contains papers showing existing solutions and latest developments in Life Sciences and Computing Sciences to collaboratively explore new ideas and approaches to successfully apply distributed IT-systems in translational research, clinical intervention, and decision-making. (C) 2020 Published by Elsevier B.V.
This paper introduces the principle of the three classical and widely applied local value methods, including Otsu method, maximum entropy method and iterative method. It runs on VS2010 (Microsoft Visual Studio 2010) p...
详细信息
Fault simulation is a time-consuming process that requires customized methods and techniques to accelerate it. Multi-threading and Multi-core approaches are two promising techniques that can be exploited to accelerate...
详细信息
Fault simulation is a time-consuming process that requires customized methods and techniques to accelerate it. Multi-threading and Multi-core approaches are two promising techniques that can be exploited to accelerate the fault simulation process by using different parts of the hardware at the same time. However, an efficient parallelization is obtained only by the refinement of software with respect to the hardware platform. In this paper, a parallel multi-thread fault simulation technique is proposed to accelerate the simulation process on multi-core platforms. In this approach, the gate input values are independently assigned to each thread. Each input value carries the information of several parallel simulation processes. This provides a multithread parallel fault simulation environment. The experimental results show that the proposed technique can efficiently use the hardware platform. In a single-core platform, the proposed technique can reduce the time by 25% while in a dual-core increasing the thread approximately halves the execution time.
We consider the decentralised consensus optimisation problem arising from in-situ seismic tomography in large-scale sensor networks. Unlike traditional seismic imaging performed in a centralised location, each node in...
详细信息
We consider the decentralised consensus optimisation problem arising from in-situ seismic tomography in large-scale sensor networks. Unlike traditional seismic imaging performed in a centralised location, each node in this setting privately holds an objective function and partial data. The goal of each node is to obtain the optimal solution of the whole seismic image, while communicating only with its immediate neighbours. We present a fast decentralised gradient descent method and prove that this novel method can reach optimal convergence rate ofO(1/k(2))wherekis the number of communication/iteration rounds. A gossip-based asynchronous version is also proposed which is preferable when there is a divergence on the processing speed of the nodes. Extensive numerical experiments on synthetic and real-world sensor network seismic data demonstrate that the proposed algorithms significantly outperform existing methods. [GRAPHICS] .
Defect detection aims to locate the accurate position of defects in images, which is of great significance to quality inspection in the industrial product manufacturing. Currently, many defect detection methods rely o...
详细信息
Defect detection aims to locate the accurate position of defects in images, which is of great significance to quality inspection in the industrial product manufacturing. Currently, many defect detection methods rely on deep neural networks to extract features. Although the accuracy of these methods is relatively high, it is computationally intensive, making the methods difficult to deploy in resource-limited edge devices. In order to solve these problems, a lightweight defect detection model for the industrial edge environment is proposed, termed the efficient defect detection network (EDDNet). EfficientNet-B0 is used as the feature extraction backbone, extracting feature maps from feature layers of different depths of the network and fusing multilevel features by multilevel feature fusion (MFF). To obtain more information, we redesign the attention mechanism in MBConv blocks, taking the encoding space (ES) attention mechanism as a new module, which solves the problem that the defective image spatial information is ignored. The experimental results on the NEU-DET and DAGM2007 datasets and PCB defect datasets demonstrate the effectiveness of the proposed EDDNet and its possibility for application in industrial edge device.
This work is devoted to establishing a comparatively accurate classification model between symptoms, constitutions, and regimens for traditional Chinese medicine (TCM) constitution analysis to provide preliminary scre...
详细信息
This work is devoted to establishing a comparatively accurate classification model between symptoms, constitutions, and regimens for traditional Chinese medicine (TCM) constitution analysis to provide preliminary screening and decision support for clinical diagnosis. However, for the analysis of massive distributed medical data in a cloud platform, the traditional data mining methods have the problems of low mining efficiency and large memory consumption, and long tuning time, an association rules method for TCM constitution analysis (ARA-TCM) is proposed that based on FP-growth algorithm and the open-source distributed file system in Hadoop framework (HDFS) to make full use of its powerful parallelprocessing capability. Firstly, the proposed method was used to explore the association rules between the 9 kinds of TCM constitutions and symptoms, as well as the regimen treatment plans, so as to discover the rules of typical clinical symptoms and treatment rules of different constitutions and to conduct an evidence-based medical evaluation of TCM effects in constitution-related chronic disease health management. Secondly, experiments were applied on a self-built TCM clinical records database with a total of 30,071 entries and it is found that the top three constitutions are mid constitution (42.3%), hot and humid constitution (31.3%), and inherited special constitution (26.2%), respectively. What is more, there are obvious promotions in the precision and recall rate compared with the Apriori algorithm, which indicates that the proposed method is suitable for the classification of TCM constitutions. This work is mainly focused on uncovering the rules of "disease symptoms constitution regimen" in TCM medical records, but tongue image and pulse signal are also very important to TCM constitution analysis. Therefore, this additional information should be considered into further studies to be more in line with the actual clinical needs.
Class-imbalance Learning is one of the hot research issues in machine learning. In the practical application of distributed class-imbalance learning, data continues to arrive, which often leads to classimbalance situa...
详细信息
ISBN:
(纸本)9783030602482;9783030602475
Class-imbalance Learning is one of the hot research issues in machine learning. In the practical application of distributed class-imbalance learning, data continues to arrive, which often leads to classimbalance situations. The imbalance problem in the distributed scenario is particular: the imbalanced state of different nodes may be complementary. The imbalanced states of different nodes may be complementary. Using this complementary relationship to do oversampling to change the imbalanced state is a valuable method. However, the data island limits data sharing in this case between the nodes. To this end, we propose DOS-GAN, which can take turns to use the data of one same class data on multiple nodes to train the global GAN model, and then use this GAN generator to oversampling the class without the original data being exchanged. Extensive experiments confirm that DOS-GAN outperforms the combination of traditional methods and achieves classification accuracy closes to the method of data aggregating.
Scaling up model sizes can lead to fundamentally new capabilities in many machine learning (ML) tasks. However, training big models requires strong distributed system expertise to carefully design model-parallel execu...
ISBN:
(纸本)9781713871088
Scaling up model sizes can lead to fundamentally new capabilities in many machine learning (ML) tasks. However, training big models requires strong distributed system expertise to carefully design model-parallel execution strategies that suit the model architectures and cluster setups. In this paper, we develop AMP, a framework that automatically derives such strategies. AMP identifies a valid space of model parallelism strategies and efficiently searches the space for high-performed strategies, by leveraging a cost model designed to capture the heterogeneity of the model and cluster specifications. Unlike existing methods, AMP is specifically tailored to support complex models composed of uneven layers and cluster setups with more heterogeneous accelerators and bandwidth. We evaluate AMP on popular models and cluster setups from public clouds and show that AMP returns parallel strategies that match the expert-tuned strategies on typical cluster setups. On heterogeneous clusters or models with heterogeneous architectures, AMP finds strategies with 1.54× and 1.77× higher throughput than state-of-the-art model-parallel systems, respectively.
暂无评论