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

Detecting Duplicate Contributions in Pull-Based Model CombiningTextual and Change Similarities

Journal of computer science & technology 2021年第1期36卷 191-206页

作者： Zhi-Xing Li Yue Yu Tao Wang Gang Yin Xin-Jun Mao Huai-Min Wang Key Laboratory of Parallel and Distributed Computing College of ComputerNational University of Defense Technology Changsha 410073China Laboratory of Software Engineering for Complex Systems College of ComputerNational University of Defense TechnologyChangsha 410073China

Communication and coordination between OSS developers who do not work physically in the same location have always been the challenging *** pull-based development model,as the state-of-art collaborative development mechanism,provides high openness and transparency to improve the visibility of contributors'***,duplicate contributions may still be submitted by more than one contributors to solve the same problem due to the parallel and uncoordinated nature of this *** not detected in time,duplicate pull-requests can cause contributors and reviewers to waste time and energy on redundant *** this paper,we propose an approach combining textual and change similarities to automatically detect duplicate contributions in pull-based model at submission *** a new-arriving contribution,we first compute textual similarity and change similarity between it and other existing *** then our method returns a list of candidate duplicate contributions that are most similar with the new contribution in terms of the combined textual and change *** evaluation shows that 83.4%of the duplicates can be found in average when we use the combined textual and change similarity compared to 54.8%using only textual similarity and 78.2%using only change similarity.

关键词： Pull-request Duplicate detection textual similarity change similarity

来源：评论

学校读者我要写书评

暂无评论

A Novel Evaluation Strategy to Artificial Neural Network Model Based on Bionics

引用

Journal of Bionic Engineering 2022年第1期19卷 224-239页

作者： Sen Tian Jin Zhang Xuanyu Shu Lingyu Chen Xin Niu You Wang School of Mathematics and Statistics Hunan Normal UniversityChangsha410081China College of Information Science and Engineering Hunan Normal UniversityChangsha410081China School of Computer and Communication Engineering Changsha University of Science and TechnologyChangsha410114China Key Laboratory of Industrial Control Technology Zhejiang UniversityHangzhou310058China Science and Technology on Parallel and Distributed Laboratory College of ComputerNational University of Defense TechnologyChangsha410199China Key Laboratory of Industrial Control Technology Institute of Cyber Systems and ControlZhejiang UniversityHangzhou310027China

With the continuous deepening of Artificial Neural Network(ANN)research,ANN model structure and function are improving towards diversification and ***,the model is more evaluated from the pros and cons of the problem-solving results and the lack of evaluation from the biomimetic aspect of imitating neural networks is not inclusive ***,a new ANN models evaluation strategy is proposed from the perspective of bionics in response to this problem in the ***,four classical neural network models are illustrated:Back Propagation(BP)network,Deep Belief Network(DBN),LeNet5 network,and olfactory bionic model(KIII model),and the neuron transmission mode and equation,network structure,and weight updating principle of the models are analyzed *** analysis results show that the KIII model comes closer to the actual biological nervous system compared with other models,and the LeNet5 network simulates the nervous system in ***,evaluation indexes of ANN are constructed from the perspective of bionics in this paper:small-world,synchronous,and chaotic ***,the network model is quantitatively analyzed by evaluation indexes from the perspective of *** experimental results show that the DBN network,LeNet5 network,and BP network have synchronous *** the DBN network and LeNet5 network have certain chaotic characteristics,but there is still a certain distance between the three classical neural networks and actual biological neural *** KIII model has certain small-world characteristics in structure,and its network also exhibits synchronization characteristics and chaotic *** with the DBN network,LeNet5 network,and the BP network,the KIII model is closer to the real biological neural network.

关键词： Artificial neural network(ANN) Back Propagation(BP)network Deep Belief Network(DBN) LeNet5 network Olfactory bionic model(KIII model) Small world Chaos Synchronous

来源：评论

学校读者我要写书评

暂无评论

Transformer in reinforcement learning for decision-making:a survey

引用

Frontiers of Information technology & Electronic Engineering 2024年第6期25卷 763-790页

作者： Weilin YUAN Jiaxing CHEN Shaofei CHEN Dawei FENG Zhenzhen HU Peng LI Weiwei ZHAO College of Information and Communication National University of Defense TechnologyWuhan 430014China College of Intelligence Science and Technology National University of Defense TechnologyChangsha 410072China Laboratory for Parallel and Distributed Processing National University of Defense TechnologyChangsha 410072China

Reinforcement learning(RL)has become a dominant decision-making paradigm and has achieved notable success in many real-world ***,deep neural networks play a crucial role in unlocking RL’s potential in large-scale decision-making *** by current major success of Transformer in natural language processing and computer vision,numerous bottlenecks have been overcome by combining Transformer with RL for *** paper presents a multiangle systematic survey of various Transformer-based RL(TransRL)models applied in decision-making tasks,including basic models,advanced algorithms,representative implementation instances,typical applications,and known *** work aims to provide insights into problems that inherently arise with the current RL approaches,and examines how we can address them with better TransRL *** our knowledge,we are the first to present a comprehensive review of the recent Transformer research developments in RL for *** hope that this survey provides a comprehensive review of TransRL models and inspires the RL community in its pursuit of future *** keep track of the rapid TransRL developments in the decision-making domains,we summarize the latest papers and their open-source implementations at https://***/williamyuanv0/Transformer-in-Reinforcement-Learning-for-Decision-Making-A-Survey.

关键词： Transformer Reinforcement learning(RL) Decision-making(DM) Deep neural network(DNN) Multi-agent reinforcement learning(MARL) Meta-reinforcement learning(Meta-RL)

来源：评论

学校读者我要写书评

暂无评论

Graph Structure Learning via Transfer Entropy for Multivariate Time Series Anomaly Detection

Graph Structure Learning via Transfer Entropy for Multivaria...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Mingyu Liu Yijie Wang Xiaohui Zhou Yongjun Wang National Key Laboratory of Parallel and Distributed Computing College of Computer Science and Technology National University of Defense Technology Changsha China College of Computer Science and Technology National University of Defense Technology Changsha China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Multivariate time series anomaly detection (MTAD) poses a challenge due to temporal and feature dependencies. The critical aspects of enhancing the detection performance lie in accurately capturing the dependencies between variables within the sliding window and effectively leveraging them. Existing studies rely on domain knowledge to pre-set the window size, and overlook the strength of dependencies while calculating direction based on variable similarity. This paper proposes GSLTE, a graph structure learning method for MTAD. GSLTE employs Fast Fourier Transform to conduct iterative segmentation of the whole series, selecting the dominant Fourier frequency as the window size for each subsequence within the minimum interval. GSLTE quantifies the direction and strength of the dependencies based on variable-lag transfer entropy which is achieved through Dynamic Time Warping method to learn asymmetric links between variables. Extensive experiments show that GNN-based MTAD methods applying GSLTE can further improve anomaly detection performance while outperforming state-of-the-art competitors.

关键词： Learning systems Time-frequency analysis Fast Fourier transforms Time series analysis Signal processing Feature extraction Entropy Iterative methods Speech processing Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Jammer Localization for Wireless Sensor Networks

引用

Chinese Journal of Electronics 2023年第4期20卷 735-738页

作者： SUN Yanqiang WANG Xiaodong ZHOU Xingming National Key Laboratory for Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha China

Jamming attack can severely affect the performance of Wireless sensor networks (WSNs) due to the broadcast nature of wireless medium. In order to localize the source of the attacker, we in this paper propose a jammer localization algorithm named as Minimum-circle-covering based localization (MCCL). Comparing with the existing solutions that rely on the wireless propagation parameters, MCCL only depends on the location information of sensor nodes at the border of the jammed region. MCCL uses the plane geometry knowledge, especially the minimum circle covering technique, to form an approximate jammed region, and hence the center of the jammed region is treated as the estimated position of the jammer. Simulation results showed that MCCL is able to achieve higher accuracy than other existing solutions in terms of jammer's transmission range and sensitivity to nodes' density.

关键词： Location awareness Wireless communication Geometry Wireless sensor networks Sensitivity Simulation Jamming

来源：评论

学校读者我要写书评

暂无评论

Optimizing Batched Small Matrix Multiplication on Multi-core DSP Architecture 22

Optimizing Batched Small Matrix Multiplication on Multi-core...

引用

22nd IEEE International Symposium on parallel and distributed Processing with Applications, ISPA 2024

作者： Zuo, Xiaohan Xiao, Chunhua Wang, Qinglin Shi, Chen Chongqing University College of Computer Science Chongqing China Ministry of Education Key Laboratory of Dependable Service Computing in Cyber Physical Society China National University of Defense Technology National Key Laboratory of Parallel and Distributed Computing Changsha410073 China National University of Defense Technology Laboratory of Digitizing Software for Frontier Equipment Changsha410073 China

ISBN: (纸本)9798331509712

General Matrix Multiplication (GEMM) is a critical computational operation in scientific computing and machine learning domains. While traditional GEMM performs well on large matrices, it is inefficient in terms of data transfer and computation for small matrices. Many High-Performance Computing (HPC) tasks can be decomposed into large batches of small matrix multiplication operations. Multi-core Digital Signal Processors (DSPs) are commonly used to accelerate high-performance computing. We present a design for batched fusion small matrix multiplication (BFMM) tailored for multi-core DSP architecture. To address the inefficiencies and redundancy in storage and computational operations associated with batch small matrix multiplications, we designed several strategies. We design a matrix fusion concatenation strategy, an access coordination mechanism, and a mechanism for fragment aggregation. BFMM supports an efficient K-dimension multi-core parallelization strategy. The parameter constraint model makes BFMM highly portable. BFMM also includes a performance evaluation model that facilitates assessment and verification. Experimental results demonstrate that, compared to traditional GEMM (TGEMM) on multi-core DSP and traditional GEMM with concatenated data access (TGEMM Op), BFMM exhibits superior performance. For large batches of small matrices, our design achieves 1.21x to 18x higher performance than TGEMM Op on single-core DSP, while on multi-core DSP, it outperforms TGEMM Op by 1.14x to 18.1x. © 2024 IEEE.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Highly parallelized Reinforcement Learning Training with Relaxed Assignment Dependencies

arXiv

引用

arXiv 2025年

作者： He, Zhouyu Qiao, Peng Li, Rongchun Dou, Yong Tan, Yusong College of Computer Science and Technology National University of Defense Technology China National Key Laboratory of Parallel and Distributed Computing National University of Defense Technology China

As the demands for superior agents grow, the training complexity of Deep Reinforcement Learning (DRL) becomes higher. Thus, accelerating training of DRL has become a major research focus. Dividing the DRL training process into subtasks and using parallel computation can effectively reduce training costs. However, current DRL training systems lack sufficient parallelization due to data assignment between subtask components. This assignment issue has been ignored, but addressing it can further boost training efficiency. Therefore, we propose a high-throughput distributed RL training system called TianJi. It relaxes assignment dependencies between subtask components and enables event-driven asynchronous communication. Meanwhile, TianJi maintains clear boundaries between subtask components. To address convergence uncertainty from relaxed assignment dependencies, TianJi proposes a distributed strategy based on the balance of sample production and consumption. The strategy controls the staleness of samples to correct their quality, ensuring convergence. We conducted extensive experiments. TianJi achieves a convergence time acceleration ratio of up to 4.37 compared to related comparison systems. When scaled to eight computational nodes, TianJi shows a convergence time speedup of 1.6 and a throughput speedup of 7.13 relative to XingTian, demonstrating its capability to accelerate training and scalability. In data transmission efficiency experiments, TianJi significantly outperforms other systems, approaching hardware limits. TianJi also shows effectiveness in on-policy algorithms, achieving convergence time acceleration ratios of 4.36 and 2.95 compared to RLlib and XingTian. TianJi is accessible at https://***/HiPRL/***. © 2025, CC BY.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Highly parallelized Reinforcement Learning Training with Relaxed Assignment Dependencies 39

Highly Parallelized Reinforcement Learning Training with Rel...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

ISBN: (纸本)157735897X

As the demands for superior agents grow, the training complexity of Deep Reinforcement Learning (DRL) becomes higher. Thus, accelerating training of DRL has become a major research focus. Dividing the DRL training process into subtasks and using parallel computation can effectively reduce training costs. However, current DRL training systems lack sufficient parallelization due to data assignment between subtask components. This assignment issue has been ignored, but addressing it can further boost training efficiency. Therefore, we propose a high-throughput distributed RL training system called TianJi. It relaxes assignment dependencies between subtask components and enables event-driven asynchronous communication. Meanwhile, TianJi maintains clear boundaries between subtask components. To address convergence uncertainty from relaxed assignment dependencies, TianJi proposes a distributed strategy based on the balance of sample production and consumption. The strategy controls the staleness of samples to correct their quality, ensuring convergence. We conducted extensive experiments. TianJi achieves a convergence time acceleration ratio of up to 4.37 compared to related comparison systems. When scaled to eight computational nodes, TianJi shows a convergence time speedup of 1.6 and a throughput speedup of 7.13 relative to XingTian, emonstrating its capability to accelerate training and scalability. In data transmission efficiency experiments, TianJi significantly outperforms other systems, approaching hardware limits. TianJi also shows effectiveness in on-policy algorithms, achieving convergence time acceleration ratios of 4.36 and 2.95 compared to RLlib and XingTian. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Hemo-FS-SAM2: Few-Shot Tuning on Hemorrhage Segmentation of Segment Anything Model 2

Hemo-FS-SAM2: Few-Shot Tuning on Hemorrhage Segmentation of ...

引用

Advanced Algorithms and Control Engineering (ICAACE), International Conference on

作者： Xi Wang Peng Qiao Yong Dou National Key Laboratory of Parallel and Distributed Computing College of Computer Science and Technology National University of Defense Technology National University of Defense Technology Changsha China

ISBN: (数字)9798331535087

ISBN: (纸本)9798331535094

Surgical hemorrhage is a common occurrence in surgeries. Accurate segmentation of hemorrhage regions is important for surgical navigation and post-operative assessment. Some segmentation models focused on medical images, but its performance on hemorrhage data is limited. Besides, there is an essential challenge to annotate a large number of hemorrhage data, and previous segmentation methods struggle with complex hemorrhage characteristics like unclear boundaries and scattered targets. The Segment Anything Model 2 (SAM2) shows an significant zero-shot ability in general image segmentation, and is generalizable to fine-tuned on downstream tasks. However, it often faces limitations in hemorrhage segmentation task that lacking annotations. This paper proposes a fine-tuning approach for SAM2, significantly improving its performance on hemorrhage segmentation tasks with limited data. Our method provides better segmentation performance on few-shot hemorrhage data than SAM and SAM2 based models.

关键词： Image segmentation Adaptation models Accuracy Annotations Shape Surgery Data models Hemorrhaging Tuning Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

Smoothing Point Adjustment-Based Evaluation of Time Series Anomaly Detection

Smoothing Point Adjustment-Based Evaluation of Time Series A...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Mingyu Liu Yijie Wang Hongzuo Xu Xiaohui Zhou Bin Li Yongjun Wang Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha China

Anomalies in time series appear consecutively, forming anomaly segments. Applying the classical point-based evaluation metrics to evaluate the detection performance of segments leads to considerable underestimation, so most related studies resort to point adjustment. This operation treats all points as true positives within a segment equally when only one individual point alarms, resulting in significant overestimation and creating an illusion of superior performance. This paper proposes smoothing point adjustment, a novel range-based evaluation protocol for time series anomaly detection. Our protocol reflects detection performance impartially by carefully considering the specific location and frequency of alarms in the raw results. It is achieved by smoothly determining the adjustment range and rewarding early detection via a ranging function and a rewarding function. Compared with other evaluation metrics, experiments on different datasets show that our protocol can yield a performance ranking of various methods more consistent with the desired situation.

关键词： Protocols Smoothing methods Time series analysis Detectors Signal processing Distance measurement Acoustics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：