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

A Brief Overview of ChatGPT:The History,Status Quo and Potential Future Development

IEEE/CAA Journal of Automatica Sinica 2023年第5期10卷 1122-1136页

作者： Tianyu Wu Shizhu He Jingping Liu Siqi Sun Kang Liu Qing-Long Han Yang Tang the Key Laboratory of Smart Manufacturing in Energy Chemical Process East China University of Science and TechnologyShanghai 200237China the Laboratory of Cognition and Decision Intelligence for Complex Systems Institute of AutomationChinese Academy of SciencesBeijing 100190 the School of Artificial Intelligence University of Chinese Academy of SciencesBeijing 100049China the School of Information Science and Engineering East China University of Science and TechnologyShanghai 200237China the Research Institute of Intelligent Complex Systems Fudan UniversityShanghai 200437China the School of Science Computing and Engineering TechnologiesSwinburne University of TechnologyMelbourne VIC 3122Australia

ChatG PT,an artificial intelligence generated content (AIGC) model developed by OpenAI,has attracted worldwide attention for its capability of dealing with challenging language understanding and generation tasks in the form of *** paper briefly provides an overview on the history,status quo and potential future development of ChatGPT,helping to provide an entry point to think about ***,from the limited open-accessed resources,we conclude the core techniques of ChatGPT,mainly including large-scale language models,in-context learning,reinforcement learning from human feedback and the key technical steps for developing *** further analyze the pros and cons of ChatGPT and we rethink the duality of ChatGPT in various *** it has been widely acknowledged that ChatGPT brings plenty of opportunities for various fields,mankind should still treat and use ChatG PT properly to avoid the potential threat,e.g.,academic integrity and safety ***,we discuss several open problems as the potential development of ChatGPT.

关键词： AIGC ChatGPT GPT-3 GPT-4 human feedback large language models

来源：评论

学校读者我要写书评

暂无评论

Multiscale Bilateral Attention Fusion Network for Pansharpening

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第11期5卷 5828-5843页

作者： Guo, Zhongyuan Li, Jiawei Lei, Jia Liu, Jinyuan Zhou, Shihua Wang, Bin Kasabov, Nikola K. Dalian University Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education School of Software Engineering Dalian116622 China University of the Science and Technology Beijing School of Computer and Communication Engineering Beijing100083 China Dalian University of Technology School of Mechanical Engineering Dalian116024 China Auckland University of Technology Knowledge Engineering and Discovery Research Institute Auckland1061 New Zealand University of Ulster Intelligent Systems Research Center LondonderryBT48 7JL United Kingdom Bulgarian Academy of Sciences IICT Sofia1000 Bulgaria

High-resolution multispectral (HRMS) images combine spatial and spectral information originating from panchromatic (PAN) and reduced-resolution multispectral (LRMS) images. Pansharpening performs well and is widely used to obtain HRMS images. However, most pansharpening approaches determine the ratio of PAN and LRMS images through direct interpolation, which may introduce artifacts and distort the color of the fused results. To address this issue, an unsupervised progressive pansharpening framework, MSBANet, is proposed, which adopts a multistage fusion strategy. Each stage contains an attention interactive extraction module (AIEM) and a multiscale bilateral fusion module (MBFM). The AIEM extracts spatial and spectral features from input images and captures the correlations between features. The MBFM can efficiently integrate information from the AIEM and improve MSBANet context awareness. We design a hybrid loss function that enhances the ability of the fusion network to store spectral and texture details. In qualitative and quantitative experimental studies on four datasets, MSBANet outperformed state-of-the-art pansharpening techniques. The code will be released. © 2024 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-aware Superpoint Graph Transformer for Weakly Supervised 3D Semantic Segmentation

引用

IEEE Transactions on Fuzzy systems 2025年第6期33卷 1899-1912页

作者： Fan, Yan Wang, Yu Zhu, Pengfei Hui, Le Xie, Jin Hu, Qinghua Tianjin University College of Intelligence and Computing Tianjin300350 China Ministry of Education of the People's Republic of China Engineering Research Center of City Intelligence and Digital Governance China Haihe Laboratory of Itai Tianjin China Northwestern Polytechnical University School of Electronics and Information Shaanxi Key Laboratory of Information Acquisition and Processing China Nanjing University of Science and Technology Pca Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education China Nanjing University State Key Laboratory for Novel Software Technology Nanjing China

Weakly supervised 3D semantic segmentation has successfully mitigated the labor-intensive and time-consuming task of annotating 3D point clouds. However, reliably utilizing the minimal point-wise annotations for unlabeled data in complex and large-scale scenes is still challenging, such as only 20 points labeled in 2 million points. To tackle this challenge, we propose a new Uncertainty-aware Superpoint Graph Transformer (UaSGT) framework that utilizes minimal annotations for unlabeled data learning through reliable long-range supervision propagation from labeled superpoints to unlabeled superpoints. First, we propose a superpoint graph transformer to achieve long-range supervision propagation along the attention-based fuzzy subsets defined on superpoints. The attention-based fuzzy subset measures the membership of unlabeled superpoints to clusters centered on labeled superpoints. Second, we employ an uncertainty-aware membership rectification technique on the fuzzy subset to ensure reliable propagation among superpoints within the same category. This technique integrates an uncertainty prediction module to mask the influence of unreliable membership and a spatial prior refinement module to reduce uncertainty in intra-class membership degrees. Finally, experimental results on two large-scale benchmarks S3DIS and ScanNet-V2 demonstrate the superiority of our approach compared to the state-of-the-art with at least 90% annotation reduction, and our method also achieves comparable performance to fully supervised methods with less than 0.1% labeled points. Our code is available at https://***/fanyan0411/UaSGT. © 2025 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Generalized-Extended-State-Observer and Equivalent-Input-Disturbance Methods for Active Disturbance Rejection: Deep Observation and Comparison

引用

IEEE/CAA Journal of Automatica Sinica 2023年第4期10卷 957-968页

作者： Jinhua She Kou Miyamoto Qing-Long Han Min Wu Hiroshi Hashimoto Qing-Guo Wang School of Engineering Tokyo University of TechnologyHachiojiTokyo 192-0982Japan K.Miyamoto is with the Institute of Technology Shimizu CorporationKotoTokyo 135-0044Japan School of Science Computing and Engineering TechnologiesSwinburne University of TechnologyMelbourneVIC 3122Australia School of Automation China University of GeosciencesWuhan 430074 Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of EducationWuhan 430074China School of Industrial Technology Advanced Institute of Industrial TechnologyTokyo 140-0011Japan Institute of Artificial Intelligence and Future Networks Beijing Normal UniversityZhuhai 519087 Guangdong Key Lab of AI and Multi-Modal Data Processing Guangdong Provincial Key Laboratory of Interdisciplinary Research and Application for Data Science BNUHKBU United International College Zhuhai 519087China

Active disturbance-rejection methods are effective in estimating and rejecting disturbances in both transient and steady-state *** paper presents a deep observation on and a comparison between two of those methods:the generalized extended-state observer(GESO)and the equivalent input disturbance(EID)from assumptions,system configurations,stability conditions,system design,disturbance-rejection performance,and extensibility.A time-domain index is introduced to assess the disturbance-rejection performance.A detailed observation of disturbance-suppression mechanisms reveals the superiority of the EID approach over the GESO method.A comparison between these two methods shows that assumptions on disturbances are more practical and the adjustment of disturbance-rejection performance is easier for the EID approach than for the GESO method.

关键词： Active disturbance-rejection control(ADRC) disturbance observer(DOB) equivalent input disturbance(EID) extendedstate observer(ESO) generalized extended-state observer(GESO)

来源：评论

学校读者我要写书评

暂无评论

Transcriptomic analysis of Andrias davidianus meat and experimental validation for exploring its bioactive components as functional foods

引用

Food science and Human Wellness 2024年第1期13卷 166-172页

作者： Changge Guan Zhenglin Tan Shucheng Li Yi Wang Naoyuki Yamamoto Chong Zhang Songjun Wang Junjie Chen Xinhui Xing Key Laboratory for Industrial Biocatalysis Ministry of Education of ChinaDepartment of Chemical EngineeringTsinghua UniversityBeijing 100084China School of Life Science and Technology Tokyo Institute of TechnologyYokohama 226-0026Japan Sensing System Research Center National Institute of Advanced Industrial Science and TechnologyTsukuba 305-8565Japan Center for Synthetic and Systems Biology Tsinghua UniversityBeijing 100084China Henan Giant Salamander Protection and Development Association Luoyang 471000China Intelligent Computing Research Center Harbin Institute of TechnologyShenzhen 518071China Institute of Biopharmaceutical and Health Engineering Tsinghua Shenzhen International Graduate SchoolShenzhen 518055China Institute of Biomedical Health Technology and Engineering Shenzhen Bay LaboratoryShenzhen 518067China

Andrias davidianus(Chinese giant salamander,CGS)is the largest and oldest extant amphibian species in the world and is a source of prospective functional food in ***,the progress of functional peptides mining was slow due to lack of reference genome and protein sequence *** this study,we illustrated full-length transcriptome sequencing to interpret the proteome of CGS meat and obtain 10703 coding DNA *** functional annotation and amino acid composition analysis,we have discovered various genes related to signal transduction,and 16 genes related to *** have also found vast variety of functional peptides through protein coding sequence(CDS)analysis by comparing the data obtained with the functional peptide ***-Pro-Ile predicted by the CDS analysis was released from the CGS meat through enzymatic hydrolysis,suggesting that our approach is *** study suggested that transcriptomic analysis can be used as a reference to guide polypeptide mining in CGS meat,thereby providing a powerful mining strategy for the bioresources with unknown genomic and proteomic sequences.

关键词： Chinese giant salamander Transcriptomic analysis Bioactive components Functional peptides mining

来源：评论

学校读者我要写书评

暂无评论

Nested Named Entity Recognition: A Survey of Latest research

引用

Expert systems 2025年第7期42卷

作者： Ji, Lixia Dang, Yiping Du, Yunlong Gao, Wenzhao Zhang, Han School of Cyber Science and Engineering Zhengzhou University Zhengzhou China College of Computer Science Sichuan University Chengdu China Intelligent Systems Research Centre School of Computing Engineering & Intelligent Systems Ulster University Belfast United Kingdom Intelligent Policing Key Laboratory of Sichuan Province Sichuan Police College Luzhou China

The research on nested named entity recognition (NER) is conducive to providing richer semantic representations and capturing the nested structure among entities, which is crucial for the execution of downstream tasks. This paper aims to summarise the nested NER methods that have been combined with emerging technologies in recent years. We summarise the nested NER methods that are integrated with emerging technologies from three dimensions: model, framework, and data. Additionally, we explore the research progress of nested NER in two scenarios: cross-lingual modality and multi-modal in different modalities. Furthermore, we discuss the practical applications of NER technology in five fields: biomedicine, justice, finance, media, and e-commerce. Through this review, we can clearly see the development trends of nested NER technology under emerging technologies and different modalities, as well as its broad application prospects in various fields. This provides a reference for future exploration directions in nested NER. © 2025 John Wiley & Sons Ltd.

关键词： application fields modal nested named entity recognition new technologies

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges

arXiv

引用

arXiv 2025年

作者： Zhou, Xiaotian Zehmakan, Ahad N. Zhang, Zhongzhi Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China Research Institute of Intelligent Complex Systems Fudan University Shanghai200433 China School of Computing Australian National University Canberra Australia

The Kirchhoff index, which is the sum of the resistance distance between every pair of nodes in a network, is a key metric for gauging network performance, where lower values signify enhanced performance. In this paper, we study the problem of minimizing the Kirchhoff index by adding edges. We first provide a greedy algorithm for solving this problem and give an analysis of its quality based on the bounds of the submodularity ratio and the curvature. Then, we introduce a gradient-based greedy algorithm as a new paradigm to solve this problem. To accelerate the computation cost, we leverage geometric properties, convex hull approximation, and approximation of the projected coordinate of each point. To further improve this algorithm, we use pre-pruning and fast update techniques, making it particularly suitable for large networks. Our proposed algorithms have nearly-linear time complexity. We provide extensive experiments on ten real networks to evaluate the quality of our algorithms. The results demonstrate that our proposed algorithms outperform the state-of-the-art methods in terms of efficiency and effectiveness. Moreover, our algorithms are scalable to large graphs with over 5 million nodes and 12 million edges. Copyright © 2025, The Authors. All rights reserved.

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Semantic Pre-Extraction for Energy-Efficient AoI Minimization in UAV-Assisted Wireless Networks

Semantic Pre-Extraction for Energy-Efficient AoI Minimizatio...

引用

IEEE Conference on Wireless Communications and Networking

作者： Yusi Long Gary C.F. Lee Lanhua Li Shimin Gong Sumei Sun Dusit Niyato School of Intelligent Systems Engineering Shenzhen Campus of Sun Yat-sen University China Guangdong Provincial Key Laboratory of Fire Science and Intelligent Emergency Technology China Institute for Infocomm Research (IR) A*STAR Singapore College of Computing and Data Science Nanyang Technological University Singapore

ISBN: (数字)9798350368369

ISBN: (纸本)9798350368376

This paper investigates an unmanned aerial vehicle (UAV)-assisted semantic communication network. The energy-limited ground users (GUs) provide semantic services to periodically generated raw data and a UAV relays the extracted semantic information to a base station (BS). Semantic extraction enhances data responsiveness and reduces the age-of-information (AoI) by transmitting only the most essential information. However, more complex semantic extraction increases energy consumption, making it easier for the GUs to deplete their energy. Therefore, we introduce a novel energy-efficient AoI (EAoI) metric to capture both information freshness and energy consumption of the GUs. We formulate a time-averaged EAoI minimization problem by jointly optimizing the GUs' scheduling, pre-extraction strategy, semantic control, computing resource allocation, and the UAV's trajectory. We further propose a semantic-aware joint pre-extraction and trajectory planning (Sem-JPT) algorithm to decompose the complex optimization problem into three subproblems, which are solved by a series of approximation methods. Simulation results demonstrate that semantic communication can reduce the overall EAoI by more than 18% compared with conventional bit-based communication. Moreover, the proposed Sem-JPT algorithm can maintain information freshness and prolong the GUs' lifetimes, outperforming existing baselines.

关键词： Energy consumption Trajectory planning Processor scheduling Wireless networks Semantic communication Minimization Information age Energy efficiency Trajectory Data mining

来源：评论

学校读者我要写书评

暂无评论

TeFF: Tracking-enhanced Forgetting-free Few-shot 3D LiDAR Semantic Segmentation

TeFF: Tracking-enhanced Forgetting-free Few-shot 3D LiDAR Se...

引用

IEEE/RSJ International Conference on intelligent Robots and systems (IROS)

作者： Junbao Zhou Jilin Mei Pengze Wu Liang Chen Fangzhou Zhao Xijun Zhao Yu Hu Research Center for Intelligent Computing Systems Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China China North Artificial Intelligence & Innovation Research Institute Collective Intelligence & Collaboration Laboratory (CIC)

ISBN: (数字)9798350377705

ISBN: (纸本)9798350377712

In autonomous driving, 3D LiDAR plays a crucial role in understanding the vehicle’s surroundings. However, the newly emerged, unannotated objects presents few-shot learning problem for semantic segmentation. This paper addresses the limitations of current few-shot semantic segmentation by exploiting the temporal continuity of LiDAR data. Employing a tracking model to generate pseudo-ground-truths from a sequence of LiDAR frames, our method significantly augments the dataset, enhancing the model’s ability to learn on novel classes. However, this approach introduces a data imbalance biased to novel data that presents a new challenge of catastrophic forgetting. To mitigate this, we incorporate LoRA, a technique that reduces the number of trainable parameters, thereby preserving the model’s performance on base classes while improving its adaptability to novel classes. This work represents a significant step forward in few-shot 3D LiDAR semantic segmentation for autonomous driving. Our code is available at https://***/BowmanChow/Track-no-forgetting.

关键词： Adaptation models Laser radar Three-dimensional displays Codes Semantic segmentation Few shot learning Autonomous vehicles intelligent robots

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：