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

An Opposition-Based Learning Adaptive Chaotic Particle Swarm Optimization Algorithm

Journal of Bionic engineering 2024年第6期21卷 3076-3097页

作者： Chongyang Jiao Kunjie Yu Qinglei Zhou State Key Laboratory of Mathematical Engineering and Advanced Computing PLA Strategic Support Force Information Engineering UniversityZhengzhou450001China Henan Information Engineering School Zhengzhou Vocational College of Industrial SafetyZhengzhou450000China School of Electrical and Information Engineering Zhengzhou UniversityZhengzhou450001China School of Computer and Artificial Intelligence Zhengzhou UniversityZhengzhou450001China

To solve the shortcomings of Particle Swarm Optimization(PSO)algorithm,local optimization and slow convergence,an Opposition-based Learning Adaptive Chaotic PSO(LCPSO)algorithm was *** chaotic elite opposition-based learning process was applied to initialize the entire population,which enhanced the quality of the initial individuals and the population diversity,made the initial individuals distribute in the better quality areas,and accelerated the search efficiency of the *** inertia weights were adaptively customized during evolution in the light of the degree of premature convergence to balance the local and global search abilities of the algorithm,and the reverse search strategy was introduced to increase the chances of the algorithm escaping the local *** LCPSO algorithm is contrasted to other intelligent algorithms on 10 benchmark test functions with different characteristics,and the simulation experiments display that the proposed algorithm is superior to other intelligence algorithms in the global search ability,search accuracy and convergence *** addition,the robustness and effectiveness of the proposed algorithm are also verified by the simulation results of engineering design problems.

关键词： PSO Opposition-based learning Chaotic motion Inertia weight Intelligent algorithm

来源：评论

学校读者我要写书评

暂无评论

Deep Learning in Medical Image Registration: Magic or Mirage? 38

Deep Learning in Medical Image Registration: Magic or Mirage...

引用

38th Conference on Neural information Processing systems, NeurIPS 2024

作者： Jena, Rohit Sethi, Deeksha Chaudhari, Pratik Gee, James C. Computer and Information Science United States Electrical and Systems Engineering United States Radiology United States Penn Image Computing and Science Laboratory United States

Classical optimization and learning-based methods are the two reigning paradigms in deformable image registration. While optimization-based methods boast generalizability across modalities and robust performance, learning-based methods promise peak performance, incorporating weak supervision and amortized optimization. However, the exact conditions for either paradigm to perform well over the other are shrouded and not explicitly outlined in the existing literature. In this paper, we make an explicit correspondence between the mutual information of the distribution of per-pixel intensity and labels, and the performance of classical registration methods. This strong correlation hints to the fact that architectural designs in learning-based methods is unlikely to affect this correlation, and therefore, the performance of learning-based methods. This hypothesis is thoroughly validated with state-of-the-art classical and learning-based methods. However, learning-based methods with weak supervision can perform high-fidelity intensity and label registration, which is not possible with classical methods. Next, we show that this high-fidelity feature learning does not translate to invariance to domain shift, and learning-based methods are sensitive to such changes in the data distribution. We reassess and recalibrate performance expectations from classical and DLIR methods under access to label supervision, training time, and its generalization capabilities under minor domain shifts. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-Scale Time Series Segmentation Network Based on Eddy Current Testing for Detecting Surface Metal Defects

引用

IEEE/CAA Journal of Automatica Sinica 2025年第3期12卷 528-538页

作者： Xiaorui Li Xiaojuan Ban Haoran Qiao Zhaolin Yuan Hong-Ning Dai Chao Yao Yu Guo Mohammad S.Obaidat George Q.Huang the School of Intelligence Science and Technology University of Science and Technology Beijing the Beijing Advanced Innovation Center for Materials Genome Engineering the Key Laboratory of Intelligent Bionic Unmanned Systems and the Institute of Materials Intelligent Technology Liaoning Academy of Materials IEEE the Department of Computer Science Hong Kong Baptist University the School of Computer and Communication Engineering Key Laboratory of Advanced Materials and Devices for Post-Moore Chips Ministry of Education University of Science and Technology Beijing the Beijing Advanced Innovation Center for Materials Genome Engineering University of Science and Technology Beijing the School of Computer and Communication Engineering University of Science and Technology Beijing the King Abdullah Ⅱ School of Information Technology The University of Jordan the Department of Computational Intelligence the School of Computing SRM University the School of Engineering The Amity University The Hong Kong Polytechnic University

In high-risk industrial environments like nuclear power plants, precise defect identification and localization are essential for maintaining production stability and safety. However, the complexity of such a harsh environment leads to significant variations in the shape and size of the defects. To address this challenge, we propose the multivariate time series segmentation network(MSSN), which adopts a multiscale convolutional network with multi-stage and depth-separable convolutions for efficient feature extraction through variable-length templates. To tackle the classification difficulty caused by structural signal variance, MSSN employs logarithmic normalization to adjust instance distributions. Furthermore, it integrates classification with smoothing loss functions to accurately identify defect segments amid similar structural and defect signal subsequences. Our algorithm evaluated on both the Mackey-Glass dataset and industrial dataset achieves over 95% localization and demonstrates the capture capability on the synthetic dataset. In a nuclear plant's heat transfer tube dataset, it captures 90% of defect instances with75% middle localization F1 score.

关键词： Eddy current testing nondestructive testing semantic segmentation time series analysis

来源：评论

学校读者我要写书评

暂无评论

Edge-Driven Industrial computing Power Networks: Digital Twin-Empowered Service Provisioning by Hybrid Soft Actor-Critic

引用

IEEE Transactions on Vehicular Technology 2025年第5期74卷 8095-8109页

作者： Zhang, Long Song, Deng-Ao Zhang, Hongliang Tian, Ni Zhuang, Zirui Niyato, Dusit Han, Zhu Hebei University of Engineering School of Information and Electrical Engineering Handan056038 China Peking University State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Beijing100871 China Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing100876 China Nanyang Technological University College of Computing and Data Science 639798 Singapore University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446-701 Korea Republic of

With the proliferation of data-intensive industrial applications, the collaboration of computing powers among standalone edge servers is vital to provision such services for smart devices. In this paper, we propose an edge-driven industrial computing power network (CPN) by orchestrating the computing and network resources of edge servers through the centralized resource scheduling and decentralized task computing. However, efficient task offloading and collaborative processing is challenging, which requires higher degrees of network automation and intelligence. Therefore, we incorporate digital twins (DTs) into the edge-driven CPN architecture, where the DTs are created as the digital replicas to assist both the computation offloading and collaborative processing. A joint optimization problem of the computing power assignment, service association, task partition, and transmit power control is formulated for maximizing the system average weighted utility. Due to the temporal-spatial variability of tasks and the resulted dynamic environment, we transform the original problem as a Markov decision process aiming at maximizing the long-term average weighted utility. To efficiently handle the high-dimensional discrete-continuous action space, a hybrid soft actor-critic based deep reinforcement learning algorithm is developed for optimizing the joint design. Simulation results validate the superiority of our proposed algorithm over the benchmarks, showing the significant gains obtained by integrating DTs into the edge-driven CPN. © 1967-2012 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Interest Points Analysis for Internet Forum Based on Long-Short Windows Similarity

引用

computers, Materials & Continua 2022年第8期72卷 3247-3267页

作者： Xinghai Ju Jicang Lu Xiangyang Luo Gang Zhou Shiyu Wang Shunhang Li Yang Yang State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001China School of Computing and Information Systems Singapore Management University188065Singapore College of Computer Science and Big Data Fuzhou UniversityFuzhou350116China

For Internet forum Points of Interest(PoI),existing analysis methods are usually lack of usability analysis under different conditions and ignore the long-term variation,which lead to blindness in method *** address this problem,this paper proposed a PoI variation prediction framework based on similarity analysis between long and short *** on the framework,this paper presented 5 PoI analysis algorithms which can be categorized into 2 types,i.e.,the traditional sequence analysis methods such as autoregressive integrated moving average model(ARIMA),support vector regressor(SVR),and the deep learning methods such as convolutional neural network(CNN),long-short term memory network(LSTM),Transformer(TRM).Specifically,this paper firstly divides observed data into long and short windows,and extracts key words as PoI of each ***,the PoI similarities between long and short windows are calculated for training and ***,series of experiments is conducted based on real Internet forum *** results show that,all the 5 algorithms could predict PoI variations well,which indicate effectiveness of the proposed *** the length of long window is small,traditional methods perform better,and SVR is the *** the contrary,the deep learning methods show superiority,and LSTM performs *** results could provide beneficial references for PoI variation analysis and prediction algorithms selection under different parameter configurations.

关键词： Point of interest(PoI)analysis long and short windows sequential analysis deep learning

来源：评论

学校读者我要写书评

暂无评论

Deep learning in medical image registration: magic or mirage? 24

Deep learning in medical image registration: magic or mirage...

引用

Proceedings of the 38th International Conference on Neural information Processing systems

作者： Rohit Jena Deeksha Sethi Pratik Chaudhari James C. Gee Computer and Information Science and Penn Image Computing and Science Laboratory Computer and Information Science Computer and Information Science and Electrical and Systems Engineering Computer and Information Science and Radiology and Penn Image Computing and Science Laboratory

ISBN: (纸本)9798331314385

关键词：

来源：评论

学校读者我要写书评

暂无评论

Chemical environment adaptive learning for optical band gap prediction of doped graphitic carbon nitride nanosheets

引用

Neural computing and Applications 2025年第5期37卷 3287-3301页

作者： Chen, Chen Xu, Enze Yang, Defu Yan, Chenggang Wei, Tao Chen, Hanning Wei, Yong Chen, Minghan Intelligent Information Processing Laboratory Hangzhou Dianzi University Hangzhou China Department of Computer Science Wake Forest University Winston-SalemNC United States Department of Chemical Engineering Howard University WashingtonDC United States Texas Advanced Computing Center University of Texas at Austin AustinTX United States Department of Computer Science & Information Systems University of North Georgia DahlonegaGA United States

This study presents a new machine learning algorithm, named Chemical Environment Graph Neural Network (ChemGNN), designed to accelerate materials property prediction and advance new materials discovery. Graphitic carbon nitride (g-C3N4) and its doped variants have gained significant interest for their potential as optical materials. Accurate prediction of their band gaps is crucial for practical applications;however, traditional quantum simulation methods are computationally expensive and challenging to explore the vast space of possible doped molecular structures. The proposed ChemGNN leverages the learning ability of current graph neural networks (GNNs) to satisfactorily capture the characteristics of atoms' chemical environment underlying complex molecular structures. Our experimental results demonstrate more than 100% improvement in band gap prediction accuracy over existing GNNs on g-C3N4. Furthermore, the general ChemGNN model can precisely foresee band gaps of various doped g-C3N4 structures, making it a valuable tool for performing high-throughput prediction in materials design and development. © The Author(s) 2024.

关键词： Graphitic Carbon Nitride

来源：评论

学校读者我要写书评

暂无评论

Performance Optimization for Vehicular Cooperative Sensing: A Graph Attention Based Reinforcement Learning Approach

Performance Optimization for Vehicular Cooperative Sensing: ...

引用

2024 IEEE Global Communications Conference, GLOBECOM 2024

作者： Li, Xuefei Chen, Mingzhe Liu, Danpu Zhang, Zhilong Quek, Tony Q. S. Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing100876 China University of Miami Department of Electrical and Computer Engineering Institute for Data Science and Computing Coral GablesFL33146 United States Information Systems Technology and Design Pillar Singapore University of Technology and Design 487372 Singapore

ISBN: (纸本)9798350351255

In this paper, the problem of collaborative vehicle sensing is investigated. In the considered model, a set of cooperative vehicles provide sensing information to sensing request vehicles with limited sensing and communication resources. A base station (BS) determines the subset of sensing request vehicles that each cooperative vehicle will serve and the sub-regions that each cooperative vehicle will detect. We formulate an optimization problem aiming to maximize the number of successfully detected sub-regions of sensing request vehicles while satisfying the cooperative sensing energy requirement by jointly determining the cooperative vehicle association and the sensing sub-region selection. To solve this problem, we propose a graph attention based reinforcement learning (RL) algorithm that can generate the graph information vectors based on the correlation between each cooperative vehicle and each sensing request vehicle. Using the learned graph information, the joint cooperative vehicle association and sensing sub-region selection strategy will be determined. Simulation results show that the proposed scheme can improve the number of successfully detected sub-regions of sensing request vehicles by up to 12.5% compared to the conventional RL algorithm without using graph attention networks (GANs). © 2024 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Modeling and Clustering of Parabolic Granular Data

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第7期5卷 3728-3742页

作者： Tang, Yiming Gao, Jianwei Pedrycz, Witold Hu, Xianghui Xi, Lei Ren, Fuji Hu, Min Hefei University of Technology Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer and Information Hefei230601 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6R 2V4 Canada Hefei University of Technology School of Computer and Information Hefei230601 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada Polish Academy of Sciences Systems Research Institute Warsaw00-901 Poland Istinye University Research Center of Performance and Productivity Analysis Istanbul34010 Turkey Southeast University School of Computer Science and Engineering Nanjing211189 China University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China

At present, there exist some problems in granular clustering methods, such as lack of nonlinear membership description and global optimization of granular data boundaries. To address these issues, in this study, revolving around the parabolic granular data, we propose an overall architecture for parabolic granular modeling and clustering. To begin with, novel coverage and specificity functions are established, and then a parabolic granular data structure is proposed. The fuzzy c-means (FCM) algorithm is used to obtain the numeric prototypes, and then particle swarm optimization (PSO) is introduced to construct the parabolic granular data from the global perspective under the guidance of principle of justifiable granularity (PJG). Combining the advantages of FCM and PSO, we propose the parabolic granular modeling and optimization (PGMO) method. Moreover, we put forward attribute weights and sample weights as well as a distance measure induced by the Gaussian kernel similarity, and then come up with the algorithm of weighted kernel fuzzy clustering for parabolic granularity (WKFC-PG). In addition, the assessment mechanism of parabolic granular clustering is discussed. In summary, we set up an overall architecture including parabolic granular modeling, clustering, and assessment. Finally, comparative experiments on artificial, UCI, and high-dimensional datasets validate that our overall architecture delivers a good improvement over previous strategies. The parameter analysis and time complexity are also given for WKFC-PG. In contrast with related granular clustering algorithms, it is observed that WKFC-PG performs better than other granular clustering algorithms and has superior stability in handling outliers, especially on high-dimensional datasets. © 2020 IEEE.

关键词： Fuzzy clustering

来源：评论

学校读者我要写书评

暂无评论

Pushing AI to wireless network edge: an overview on integrated sensing, communication, and computation towards 6G

引用

Science China(information Sciences) 2023年第3期66卷 7-25页

作者： Guangxu ZHU Zhonghao LYU Xiang JIAO Peixi LIU Mingzhe CHEN Jie XU Shuguang CUI Ping ZHANG Shenzhen Research Institute of Big Data Future Network of Intelligence Institute (FNii) The Chinese University of Hong Kong (Shenzhen) School of Science and Engineering (SSE) The Chinese University of Hong Kong (Shenzhen) State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Peking University Department of Electrical and Computer Engineering and Institute for Data Science and Computing University of Miami Peng Cheng Laboratory State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications

Pushing artificial intelligence(AI) from central cloud to network edge has reached board consensus in both industry and academia for materializing the vision of artificial intelligence of things(AIoT) in the sixth-generation(6G) era. This gives rise to an emerging research area known as edge intelligence, which concerns the distillation of human-like intelligence from the vast amount of data scattered at the wireless network edge. Typically, realizing edge intelligence corresponds to the processes of sensing, communication,and computation, which are coupled ingredients for data generation, exchanging, and processing, ***, conventional wireless networks design the three mentioned ingredients separately in a task-agnostic manner, which leads to difficulties in accommodating the stringent demands of ultra-low latency, ultra-high reliability, and high capacity in emerging AI applications like auto-driving and metaverse. This thus prompts a new design paradigm of seamlessly integrated sensing, communication, and computation(ISCC) in a taskoriented manner, which comprehensively accounts for the use of the data in downstream AI tasks. In view of its growing interest, this study provides a timely overview of ISCC for edge intelligence by introducing its basic concept, design challenges, and enabling techniques, surveying the state-of-the-art advancements, and shedding light on the road ahead.

关键词： sixth-generation (6G) edge intelligence artificial intelligence of things (AIoT) integrated sensing communication and computation (ISCC)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：