检索结果-内蒙古大学图书馆

SSRN 2023年

作者： Wu, Juping Xv, Huikai Jin, Min Gong, Guoliang Chen, Gang Mao, Wenyu Lu, Huaxiang Chen, Tianxiang Institute of Semiconductors CAS Beijing100083 China University of Chinese Academy of Sciences Beijing China Semiconductor Neural Network Intelligent Perception and Computing Technology Beijing Key Laboratory Beijing China Collage of Microelectronics University of Chinese Academy of Sciences Beijing China Materials and Optoelectronics Research Center University of Chinese Academy of Sciences Beijing China Tianjin University of Science and Technology Tianjin300457 China College of Nuclear Technology and Automation Engineering Chengdu University of Technology Chengdu610059 China

High impedance fault(HIF), especially tree contact single-phase-to-ground fault(TSF), often occurs in resonant grounding systems and are difficult to detect. Therefore, there is an urgent need for an effective TSF detection technology. In this paper, by analyzing the equivalent circuits of different impedance faults in resonant grounding system, and analyzing the transient zero-sequence components of underdamped state and overdamped state under different impedance, the conclusion is drawn: When a TSF occurs, the transient zero-sequence voltage will have a unique " Beat frequency " characteristic, and the problem of covering this phenomenon due to the imbalance of distribution network is effectively solved by fast independent component analysis(FastICA). Based on this conclusion, A fault detection method for TSF based on FastICA is proposed. Finally, the study conducted real experiments using two different impedance trees, bamboo and pine, to verify the proposed detection method. The results of the experiment found clear support for that the detection method is accurate and effective. © 2023, The Authors. All rights reserved.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Text Information Mining in Cyberspace: An Information Extraction Method Based on T5 and keyBERT

Text Information Mining in Cyberspace: An Information Extrac...

引用

IEEE International Conference on data science in Cyberspace (DSC)

作者： Kuan Liu Yumei Li Yuanhua Qi Ning Qi Mengran Zhai Information Research Institute of Shandong Academy of Sciences Qilu University of Technology (Shandong Academy of Sciences) Jinan China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Shandong Institute of Economy and Informatization Development Jinan China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China SHANDONG SCICOM Information and Economy Research Institute Co. Ltd Jinan China Shandong Institute of Economy and Informatization Development Jinan China

ISBN: (数字)9798350391367

ISBN: (纸本)9798350391374

With the development of the digital economy and the advent of the big data era, the rapid growth of textual information in cyberspace has placed higher demands on information processing technology. This paper proposes an information extraction technique based on the Text-to-Text Transfer Transformer, known as T5, and keyBERT models, aiming to efficiently distill the key content from textual information in cyberspace. This method combines automatic summarization and keyword extraction to form information briefs. The experiments selected representative policy documents related to data elements as input data and employed information entropy and ROUGE scores as metrics to evaluate the automatic summarization model. The results were compared with the outputs of similar models. Experimental results indicate that the T5 model outperforms other models in terms of summarization effectiveness, and the proposed information extraction method shows significant advantages in readability and processing efficiency, demonstrating practical application value.

关键词： Measurement Biological system modeling Cyberspace Text summarization Information processing Information retrieval Transformers data models data mining Information entropy

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Collaborative Federated Learning Design: A Graph Neural network based Approach

Energy Efficient Collaborative Federated Learning Design: A ...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Nuocheng Yang Sihua Wang Mingzhe Chen Christopher G. Brinton Changchuan Yin Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral Gables FL USA School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

In this paper, we consider the design of an energy efficient collaborative federated learning (CFL) methodology where devices exchange their local FL parameters with a subset of their neighbors without reliance on a parameter server. In the considered model, mobile devices implement the designed CFL to train their local FL models using their own datasets over a realistic wireless network. Due to the limited wireless resources and user movements, each device may not be able to transmit its FL parameters with all neighboring devices. Therefore, each device must select a subset of devices to share its FL parameters and optimize the transmit power. This problem is formulated as an optimization problem, whose goal is to minimize CFL training energy consumption while satisfying the delay and CFL training loss requirements. To solve this problem, a two-stage solution is proposed. At the first stage, a graph neural network (GNN) based algorithm is proposed, which enables each device to individually determine the subset of devices to transmit FL parameters using its neighboring devices' location and connection information. Compared to standard iterative algorithms that need to iteratively optimize device connections and transmit power, the proposed GNN based method can directly obtain the optimal device connections without iterative optimization. Given the optimal device connections, at the second stage, each device can directly obtain the optimal transmit power. Simulation results show that the proposed algorithm can decrease energy consumption by up to 46% compared to the algorithm where each device will directly connect to its first and second nearest neighbors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

从信号到知识——基于人工智能的医学影像裸数据诊断价值初探

引用

Engineering 2024年第3期34卷 60-69页

作者： Bingxi He Yu Guo Yongbei Zhu Lixia Tong Boyu Kong Kun Wang Caixia Sun Hailin Li Feng Huang Liwei Wu Meng Wang Fanyang Meng Le Dou Kai Sun Tong Tong Zhenyu Liu Ziqi Wei Wei Mu Shuo Wang Zhenchao Tang Shuaitong Zhang Jingwei Wei Lizhi Shao Mengjie Fang Juntao Li Shouping Zhu Lili Zhou Shuo Wang Di Dong Huimao Zhang Jie Tian Beijing Advanced Innovation Center for Big Data-Based Precision Medicine School of Engineering MedicineBeihang UniversityBeijing 100191China Key Laboratory of Big Data-Based Precision Medicine Beihang UniversityMinistry of Industry and Information TechnologyBeijing 100191China CAS Key Laboratory of Molecular Imaging Institute of AutomationChinese Academy of SciencesBeijing 100190China Department of Radiology The First Hospital of Jilin UniversityChangchun 130021China Neusoft Medical Systems Co.Ltd. Shenyang 110167China Neusoft Research of Intelligent Healthcare Technology Co.Ltd. Shenyang 110167China School of Life Science and Technology Xidian UniversityXi’an 710126China Engineering Research Center of Molecular and Neuro Imaging Ministry of EducationXi’an 710126China School of Artificial Intelligence University of Chinese Academy of SciencesBeijing 100049China

Encouraging and astonishing developments have recently been achieved in image-based diagnostic *** medical care and imaging technology are becoming increasingly ***,the current diagnosis pattern of signal to image to knowledge inevitably leads to information distortion and noise introduction in the procedure of image reconstruction(from signal to image).Artificial intelligence(AI)technologies that can mine knowledge from vast amounts of data offer opportunities to disrupt established *** this prospective study,for the first time,we develop an AI-based signal-toknowledge diagnostic scheme for lung nodule classification directly from the computed tomography(CT)raw data(the signal).We find that the raw data achieves almost comparable performance with CT,indicating that it is possible to diagnose diseases without reconstructing ***,the incorporation of raw data through three common convolutional network structures greatly improves the performance of the CT models in all cohorts(with a gain ranging from 0.01 to 0.12),demonstrating that raw data contains diagnostic information that CT does not *** results break new ground and demonstrate the potential for direct signal-to-knowledge domain analysis.

关键词： Computed tomography Diagnosis Deep learning Lung cancer Raw data

来源：评论

学校读者我要写书评

暂无评论

A Privacy Preserving and Byzantine Robust Collaborative Federated Learning Method Design

A Privacy Preserving and Byzantine Robust Collaborative Fede...

引用

IEEE International Conference on Communications (ICC)

作者： Nuocheng Yang Sihua Wang Mingzhe Chen Changchuan Yin Christopher G. Brinton Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral Gables FL USA School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

Collaborative federated learning (CFL) enables device cooperation in training shared machine learning models without reliance on a parameter server. However, the absence of a parameter server also impacts vulnerabilities associated with adversarial attacks, including privacy inference and Byzantine attacks. In this context, this paper introduces a novel CFL framework that enables each device to individually determine the subset of devices to transmit FL parameters to over the wireless network, based on its neighboring devices' location, current loss, and connection information, to achieve privacy protection and robust aggregation. This is formulated as an optimization problem whose goal is to minimize CFL training loss while satisfying the privacy preservation, robust aggregation, and transmission delay requirements. To solve this problem, a proximal policy optimization (PPO)-based reinforcement learning (RL) algorithm integrated with a graph neural network (GNN) is proposed. Compared to traditional algorithms that use global information with high computational complexity, the proposed GNN-RL method can be deployed on devices based on neighboring information with lower computational overhead. Simulation results show that the proposed algorithm can protect data privacy and increase identification accuracy by 15% compared to an algorithm in which devices are partially clustered for model aggregation.

关键词： Training Privacy Federated learning Simulation Collaboration Clustering algorithms Propagation losses

来源：评论

学校读者我要写书评

暂无评论

Field test of twin-field quantum key distribution through sending-or-not-sending over 428 km

arXiv

引用

arXiv 2021年

作者： Liu, Hui Jiang, Cong Zhu, Hao-Tao Zou, Mi Yu, Zong-Wen Hu, Xiao-Long Xu, Hai Ma, Shizhao Han, Zhiyong Chen, Jiu-Peng Dai, Yunqi Tang, Shi-Biao Zhang, Weijun Li, Hao You, Lixing Wang, Zhen Zhou, Fei Zhang, Qiang Wang, Xiang-Bin Chen, Teng-Yun Pan, Jian-Wei Hefei National Laboratory for Physical Sciences at Microscale Department of Modern Physics University of Science and Technology ofChina HefeiAnhui230026 China CAS Center for Excellence in Quantum Information and Quantum Physics University of Science and Technology of China HefeiAnhui230026 China Jinan Institute of Quantum Technology JinanShandong250101 China State Key Laboratory of Low Dimensional Quantum Physics Department of Physics Tsinghua University Beijing100084 China Data Communication Science and Technology Research Institute Beijing100191 China QuantumCTek Corporation Limited HefeiAnhui230088 China State Key Laboratory of Functional Materials for Informatics Shanghai Institute of Microsystem and Information Technology Chinese Academy of Sciences Shanghai200050 China

Quantum key distribution endows people with information-theoretical security in communications. Twin-field quantum key distribution (TF-QKD) has attracted considerable attention because of its outstanding key rates over long distances. Recently, several demonstrations of TF-QKD have been realized. Nevertheless, those experiments are implemented in the laboratory, remaining a critical question about whether the TF-QKD is feasible in real-world circumstances. Here, by adopting the sending-or-not-sending twin-field QKD (SNS-TF-QKD) with the method of actively odd parity pairing (AOPP), we demonstrate a field-test QKD over 428 km deployed commercial fiber and two users are physically separated by about 300 km in a straight line. To this end, we explicitly measure the relevant properties of the deployed fiber and develop a carefully designed system with high stability. The secure key rate we achieved breaks the absolute key rate limit of repeater-less QKD. The result provides a new distance record for the field test of both TF-QKD and all types of fiber-based QKD systems. Our work bridges the gap of QKD between laboratory demonstrations and practical applications, and paves the way for intercity QKD network with high-speed and measurement-device-independent security. Copyright © 2021, The Authors. All rights reserved.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

An enhanced MinHash encryption scheme for encrypted deduplication

An enhanced MinHash encryption scheme for encrypted deduplic...

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Qiaowen Jia Guanxiong Ha Hanwei Wang Haoyu Ma Hang Chen State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China College of Cyber Science Nankai University Tianjin China Tianjin Key Laboratory of Network and Data Security Technology Tianjin China Zhejiang Lab Hangzhou China The School of Cyber Engineering Xidian University Xi’an China

The encrypted deduplication can provide both storage savings and data confidentiality for cloud storage systems. Convergent encryption (CE) is a well-known solution for encrypted deduplication, but it brings huge computation and storage overheads for key management. MinHash encryption is an effective solution to this issue. It reduces the number of keys by grouping multiple consecutive chunks into segments and generating one key for each segment. However, MinHash encryption does not take full advantage of the segment similarity, which can be used to further reduce the overhead for key management. To this end, we augment MinHash encryption with Bloom filter and Locality Sensitivity Hash (LSH) to design an enhanced MinHash encryption scheme. Firstly, our scheme generates a sketch for each segment based on the Bloom filter, and projects sketches to the points in a hash table through LSH functions. Secondly, we detect the segment similarity by the distance between points, and similar segments are grouped into super-segments. Finally, we combine MinHash encryption and server-aided message-locked encryption to encrypt the super-segments for achieving encrypted deduplication. We conduct trace-driven experiments using a realworld dataset. Compared with MinHash encryption, our scheme has higher storage efficiency and better encryption performance.

关键词： Privacy Maximum likelihood estimation data privacy Cloud computing Sensitivity Encryption

来源：评论

学校读者我要写书评

暂无评论

Identifying Crashing Fault Residence Based on Cross Project Model

Identifying Crashing Fault Residence Based on Cross Project ...

引用

International Symposium on Software Reliability Engineering (ISSRE)

作者： Zhou Xu Tao Zhang Yifeng Zhang Yutian Tang Jin Liu Xiapu Luo Jacky Keung Xiaohui Cui School of Computer Science Wuhan University China Department of Computing The Hong Kong Polytechnic University China College of Computer Science and Technology Harbin Engineering University China Key Laboratory of Network Assessment Technology Institute of Information Engineering Chinese Academy of Sciences China Department of Computer Science City University of Hong Kong China School of Cyber Science and Engineering Wuhan University China

ISBN: (纸本)9781728149837

Analyzing the crash reports recorded upon software crashes is a critical activity for software quality assurance. Predicting whether or not the fault causing the crash (crashing fault for short) resides in the stack traces of crash reports can speed-up the program debugging process and determine the priority of the debugging efforts. Previous work mostly collected label information from bug-fixing logs, and extracted crash features from stack traces and source code to train classification models for the Identification of Crashing Fault Residence (ICFR) of newly-submitted crashes. However, labeled data are not always fully available in real applications. Hence the classifier training is not always feasible. In this work, we make the first attempt to develop a cross project ICFR model to address the data scarcity problem. This is achieved by transferring the knowledge from external projects to the current project via utilizing a state-of-the-art Balanced Distribution Adaptation (BDA) based transfer learning method. BDA not only combines both marginal distribution and conditional distribution across projects but also assigns adaptive weights to the two distributions for better adjusting specific cross project pair. The experiments on 7 software projects show that BDA is superior to 9 baseline methods in terms of 6 indicators overall.

关键词： feature extraction learning (artificial intelligence) pattern classification program debugging project management software fault tolerance software quality source code (software) Debugging Crash software fault tolerance software quality Pattern recognition Project management Feature extraction SQA management of resources

来源：评论

学校读者我要写书评

暂无评论

High-Frequency Stereo Matching network

High-Frequency Stereo Matching Network

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Haoliang Zhao Huizhou Zhou Yongjun Zhang Jie Chen Yitong Yang Yong Zhao Text Computing & Cognitive Intelligence Engineering Research Center of National Education Ministry State Key Laboratory of Public Big Data College of Computer Science and Technology Institute of Artificial Intelligence Guizhou University Guiyang Guizhou China Ghost-Valley AI Technology Shenzhen Guangdong China School of Physics and Optoelectronic Engineering Guangdong University of Technology Guangzhou China The Key Laboratory of Integrated Microsystems Shenzhen Graduate School Peking University China

In the field of binocular stereo matching, remarkable progress has been made by iterative methods like RAFT-Stereo and CREStereo. However, most of these methods lose information during the iterative process, making it difficult to generate more detailed difference maps that take full advantage of high-frequency information. We propose the Decouple module to alleviate the problem of data coupling and allow features containing subtle details to transfer across the iterations which proves to alleviate the problem significantly in the ablations. To further capture high-frequency details, we propose a Normalization Refinement module that unifies the disparities as a proportion of the disparities over the width of the image, which address the problem of module failure in cross-domain scenarios. Further, with the above improvements, the ResNet-like feature extractor that has not been changed for years becomes a bottleneck. Towards this end, we proposed a multi-scale and multi-stage feature extractor that introduces the channel-wise self-attention mechanism which greatly addresses this bottleneck. Our method (DLNR) ranks 1st on the Middlebury leaderboard, significantly outperforming the next best method by 13.04%. Our method also achieves SOTA performance on the KITTI-2015 benchmark for D1-fg. Code and demos are available at: https://***/David-Zhao-1997/High-frequency-Stereo-Matching-network.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learning converged propagations with deep prior ensemble for image enhancement

arXiv

引用

arXiv 2018年

作者： Liu, Risheng Ma, Long Wang, Yiyang Zhang, Lei DUT-RU International School of Information Science & Engineering Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province Dalian University of Technology Dalian China State Key Laboratory of Integrated Services Networks Xidian University Xi'an China Institute of Atmospheric Sciences Fudan University Shanghai Institute of Meteorological Science Shanghai China Department of Computing Hong Kong Polytechnic University Hong Kong

Enhancing visual qualities of images plays very important roles in various vision and learning applications. In the past few years, both knowledge-driven maximum a posterior (MAP) with prior modelings and fully data-dependent convolutional neural network (CNN) techniques have been investigated to address specific enhancement tasks. In this paper, by exploiting the advantages of these two types of mechanisms within a complementary propagation perspective, we propose a unified framework, named deep prior ensemble (DPE), for solving various image enhancement tasks. Specifically, we first establish the basic propagation scheme based on the fundamental image modeling cues and then introduce residual CNNs to help predicting the propagation direction at each stage. By designing prior projections to perform feedback control, we theoretically prove that even with experience-inspired CNNs, DPE is definitely converged and the output will always satisfy our fundamental task constraints. The main advantage against conventional optimization-based MAP approaches is that our descent directions are learned from collected training data, thus are much more robust to unwanted local minimums. While, compared with existing CNN type networks, which are often designed in heuristic manners without theoretical guarantees, DPE is able to gain advantages from rich task cues investigated on the bases of domain knowledges. Therefore, DPE actually provides a generic ensemble methodology to integrate both knowledge and data-based cues for different image enhancement tasks. More importantly, our theoretical investigations verify that the feed-forward propagations of DPE are properly controlled toward our desired solution. Experimental results demonstrate that the proposed DPE outperforms state-of-the-arts on a variety of image enhancement tasks in terms of both quantitative measure and visual perception quality. Copyright © 2018, The Authors. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：