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

24th COTA International Conference of Transportation Professionals: Resilient, Intelligent, Connected, and Lowcarbon Multimodal Transportation, CICTP 2024

作者： Wang, Guangchen Lu, Guangquan Wang, Jinghua Liu, Miaomiao School of Transportation Science and Engineering Beihang Univ. Beijing China Beijing Key Laboratory for Cooperative Vehicle Infrastructure Systems and Safety Control National Engineering Laboratory for Comprehensive Transportation Big Data Application Technology Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang Univ. Beijing China

ISBN: (数字)9780784485484

ISBN: (纸本)9780784485484

Accurately analyzing and predicting driver lane-changing intentions is of paramount importance, as it significantly enhances the safety of self-driving vehicles in their decision-making processes, holding great promise for the future of intelligent transportation systems. This study extracts fundamental lane-changing characteristic parameters from the Next Generation Simulation (NGSIM) trajectory data set and employs Structural Equation Modeling (SEM) to construct a model that elucidates the factors influencing drivers’ lane-changing intentions. Furthermore, it provides insight into how lane-changing intentions are influenced by lane-changing behavior and explores the intricate connection between intention and associated risks. The results emphasize the substantial negative impact of the longitudinal speed difference between the self-vehicle and the preceding vehicle on lane-changing intentions. Additionally, the consideration of lane-changing risk plays a pivotal role in drivers’ decisions to engage in lane-changing behavior. These findings have significant implications for a deeper comprehension of lane-changing intentions, guiding lane-changing decisions, and enhancing overall traffic safety. © ASCE.

关键词： Autonomous vehicles

来源：评论

学校读者我要写书评

暂无评论

MOEA/D With Spatial–Temporal Topological Tensor Prediction for Evolutionary Dynamic Multiobjective Optimization

引用

IEEE Transactions on Evolutionary Computation 2025年第3期29卷 764-778页

作者： Wang, Xianpeng Zhao, Yumeng Tang, Lixin Yao, Xin Northeastern University National Frontiers Science Center for Industrial Intelligence and Systems Optimization Key Laboratory of Data Analytics and Optimization for Smart Industry Ministry of Education Shenyang110819 China Northeastern University Liaoning Engineering Laboratory of Data Analytics and Optimization for Smart Industry Liaoning Key Laboratory of Manufacturing System and Logistics Optimization Shenyang110819 China Northeastern University National Frontiers Science Center for Industrial Intelligence and Systems Optimization Shenyang110819 China Lingnan University Department of Computing and Decision Sciences Hong Kong University of Birmingham School of Computer Science Birmingham United Kingdom

When solving dynamic multiobjective optimization problems, most evolutionary algorithms (EAs) attempt to predict the initial population in a new environment by mining the relationships between solutions during historical environment changes. However, the complex relationships between solutions and the limited amount of available data often make it difficult to extract useful information efficiently, which may deteriorate the prediction accuracy. To address this problem, this article proposes a spatial–temporal topological tensor-based prediction method to generate the initial population in a new environment under the decomposition framework of MOEA/D. The method relies on the idea that the population distribution in each environment has topological similarity along the time dimension in the objective space, which makes it efficient to represent the population distribution in terms of a tensor and predict new solutions along each decomposition axis in a new environment by an improved tensor-based multishort time series prediction method. Experimental results on various benchmark problems and a real-world problem show that the proposed method is competitive or even superior to state-of-the-art dynamic multiobjective EAs based on prediction strategies. 1997-2012 IEEE.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Multi-View Graph Embedding Learning for Image Co-Segmentation and Co-Localization

引用

IEEE Transactions on Circuits and Systems for Video Technology 2024年第6期34卷 4942-4956页

作者： Huang, Aiping Li, Lijian Zhang, Le Niu, Yuzhen Zhao, Tiesong Lin, Chia-Wen Fuzhou University Fujian Key Laboratory for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering Fuzhou350108 China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou350108 China University of Electronic Science and Technology of China School of Information and Communication Engineering Chengdu611731 China Fuzhou University Fujian Key Laboratory for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering The Fujian Science and Technology Innovation Laboratory for Optoelectronic Information Fuzhou350108 China Institute of Communications Engineering National Tsing Hua University Department of Electrical Engineering Hsinchu30013 Taiwan

Image co-segmentation and co-localization exploit inter-image information to identify and extract foreground objects with a batch mode. However, they remain challenging when confronted with large object variations or complex backgrounds. This paper proposes a multi-view graph embedding (MV-Gem) learning scheme which integrates diversity, robustness and discernibility of object features to alleviate this phenomenon. To encourage the diversity, the deep co-information containing both low-layer general representations and high-layer semantic information is generated to form a multi-view feature pool for comprehensive co-object description. To enhance the robustness, a multi-view adaptive weighted learning is formulated to fuse the deep co-information for feature complementation. To ensure the discernibility, the graph embedding and sparse constraint are embedded into the fusion formulation for feature selection. The former aims to inherit important structures from multiple views, and the latter further selects important features to restrain irrelevant backgrounds. With these techniques, MV-Gem gradually recovers all co-objects through optimization iterations. Extensive experimental results on real-world datasets demonstrate that MV-Gem is capable of locating and delineating co-objects in an image group. © 1991-2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Improved Demonstration-Knowledge Utilization in Reinforcement Learning

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第5期5卷 2139-2150页

作者： Liu, Yanyu Zeng, Yifeng Ma, Biyang Pan, Yinghui Gao, Huifan Zhang, Yuting Xiamen University Xiamen Key Laboratory of Big Data Intelligent Analysis and Decision Department of Automation Xiamen361102 China Northumbria University Department of Computer and Information Sciences NewcastleNE1 8ST United Kingdom Minnan Normal University Department of Computer Science Zhangzhou363000 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China

Reinforcement learning (RL) has made great success in recent years. Generally, the learning process requires a huge amount of interaction with the environment before an agent can achieve acceptable performance. This motivates many techniques, such as incorporating prior knowledge which is usually presented as experts' demonstration, and using a probability distribution to represent state-and-action values, to accelerate the learning process. The methods perform well when the prior knowledge is genuinely correct and no much change occurs to the learning environment. However, the requirement is not perfectly realistic in many complex applications. The demonstration knowledge may not reflect the true environment and even be full of noise. In this article, we introduce a dynamic distribution merging method to improve knowledge utilization in a general RL algorithm, namely Q-learning. The new method adapts a normal distribution to represent state-action values and merges the prior and learned knowledge in a discriminative way. We theoretically analyze the new learning method and demonstrate its empirical performance over multiple problem domains. © 2020 IEEE.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

Dynamic anchor-based tensor learning for incomplete multi-view clustering

引用

Applied Intelligence 2025年第10期55卷 1-33页

作者： Dong, Yao Fu, Yixue Dong, Yongfeng Shi, Jin Guo, Zhihao School of Artificial Intelligence Hebei University of Technology Tianjin China Tianjin International Joint Center for Virtual Reality and Visual Computing Tianjin China Hebei Province Key Laboratory of Big Data Computing Tianjin China

Incomplete multi-view clustering aims to utilize the correlation and complementarity between multiple perspectives to fill in the missing information, thereby improving the accuracy and robustness of clustering. Nevertheless, current researches often need to pay more attention to the divergences and high-order correlated information between views. They also have high computational complexity and memory requirements. To tackle these problems, we propose a novel method called Dynamic Anchor-based Tensor Learning for Incomplete Multi-view Clustering (DATL-IMC). Specifically, DATL-IMC designs a consensus anchor graph learning algorithm to obtain the consensus anchor graph by exploiting dynamic anchor learning and applies the low-rank tensor to optimize the anchors further. Meanwhile, DATL-IMC exploits projection learning to learn the latent representation of each view to get the consensus latent representation. Then, DATL-IMC utilizes graph regularization to collaborate the consensus latent representation and the consensus anchor graph to improve the clustering results. Finally, experiments conducted on nine real-world datasets demonstrate that DATL-IMC surpasses fifteen state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SLMP: A Scientific Literature Management Platform Based on Large Language Models 15

SLMP: A Scientific Literature Management Platform Based on L...

引用

15th IEEE International Conference on Knowledge Graph, ICKG 2024

作者： Guo, Menghao Jiang, Jinling Wu, Fan Sun, Shanxin Zhang, Chen Li, Wenhui Sun, Zeyi Chen, Guangyong Wu, Xindong Research Center for Life Sciences Computing Zhejiang Lab Hangzhou China Research Center for Data Hub and Security Zhejiang Lab Hangzhou China Research Center for High Efficiency Computing System Zhejiang Lab Hangzhou China Hefei University of Technology Key Laboratory of Knowledge Engineering With Big Data Hefei China

ISBN: (纸本)9798331508821

This paper presents a Scientific Literature Management Platform (SLMP, demo link1 ) based on large language models (LLMs). The platform consists of four modules: literature management, literature extraction, literature retrieval, and question answering. The core techniques used to support the four modules across the platform include a fine-tuned model PaperExtractGPT and a continual pre-training model ChatPaperGPT based on ChatGLM2 using the data from scientific research literature, responsible for information extraction and communication, respectively. Due to their powerful capabilities in natural language understanding and generation, LLMs can understand complex scientific concepts based on the provided contexts, and thus generate high-quality texts and conduct in-depth information retrieval and question answering. Our platform can help researchers manage and utilize literature more effectively and efficiently for finding relevant literature, obtaining required information, and generating new knowledge. © 2024 IEEE.

关键词： Question answering

来源：评论

学校读者我要写书评

暂无评论

GCD-Sampling: A General Cross-scale Decoupled Sampling for Point Cloud 39

GCD-Sampling: A General Cross-scale Decoupled Sampling for P...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Dai, Tao Wang, Yanzi Xiong, Jianyu Zha, Yaohua Xia, Shu-Tao Zhu, Zexuan College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Tsinghua Shenzhen International Graduate School Tsinghua University China Shenzhen City Key Laboratory of Embedded System Design Shenzhen China

ISBN: (纸本)157735897X

Sampling strategy (e.g., fixed farthest point sampling) of point cloud has been an essential step for developing practical solutions in 3D computer vision tasks. Previous fixed sampling is simple, but suffer from suboptimal performance for downstream tasks. To adapt to target networks properly, adaptive sampling methods with trainable parameters have been recently developed to enhance the performance. However, existing adaptive sampling methods still suffer from the over-coupling problem of target network, and thus become model-specific, which limits their practical applications. To address this issue, we propose a novel general cross-scale decoupled sampling method (GCD-sampling) for point cloud, which consists of original feature cache, cross-scale feature fusion and convex combination learning for better feature extraction. To reduce the coupling relationship with the target task network, our method only utilizes the point cloud coordinates as the input and output of itself. Besides, we introduce an arbitrary scale structure to enable parameter sharing across multi-scale sampling in point cloud networks. Extensive experiments on different architectures demonstrate the effectiveness of our method over other existing adaptive sampling methods. © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Image Denoising Method Based on Channel Compression and Split-Attention Mechanism 5

Image Denoising Method Based on Channel Compression and Spli...

引用

5th International Conference on Computer engineering and Intelligent Control, ICCEIC 2024

作者： Sun, Hao Qiao, Xiaoyan School of Computer Science and Technology Shandong Technology and Business University Technology and Evaluation Shandong Engineering Research Center Yantai Key Laboratory of Big Data Modeling and Intelligent Computing Immersion Shandong Yantai China

ISBN: (纸本)9798331507992

In the image restoration task, how to make full use of spatial and channel feature information to improve the reconstruction quality of the model without significantly increasing the computational complexity is an important research issue. To address this challenge, this paper proposes a CS module (Channel Compression and Split-Attention) specifically for optimizing image denoising tasks. The module first compresses the features through a preliminary convolution operation, then introduces the split attention convolution mechanism to split the features by channel and dynamically weight them, thereby enhancing the model's adaptive attention to different feature channels and improving feature expression capabilities. Through experiments on multiple image denoising datasets, the results show that the CS module significantly improves the image reconstruction quality, especially in terms of peak signal-to-noise ratio (PSNR). At the same time, the introduction of the CS module does not lead to a significant increase in computational complexity, maintaining a high computational efficiency, which verifies the practicality and superiority of the module in image denoising tasks. © 2024 IEEE.

关键词： Restoration

来源：评论

学校读者我要写书评

暂无评论

Federated Learning in STAR-RIS Aided SAGINs

IEEE Communications Standards Magazine

引用

IEEE Communications Standards Magazine 2025年第2期9卷 23-29页

作者： Wu, Min Guo, Kefeng Dev, Kapal Hamadi, Hussam Al Singh, Keshav Khowaja, Sunder Ali Li, Xingwang Space Engineering University School of Space Information Beijing101407 China Munster Technological University CONNECT Centre Department of Computer Science Ireland College of Engineering and IT University of Dubai United Arab Emirates National Sun Yat-sen University Institute of Communications Engineering Kaohsiung Taiwan Technological University Dublin School of Computing Faculty of Computing Digital and Data Ireland Henan Polytechnic University School of Physics and Electronic Information Engineering Jiaozuo454000 China Jiaozuo Key Laboratory of Crow-Sensing Network Jiaozuo454003 China

Satellite-aerial-ground integrated network (SAGIN) is considered to be an advanced architecture that offers seamless coverage, flexible access, and efficient connectivity. However, several challenges emerge during the construction of SAGINs, which include complex propagation environments and limited spectrum resources. The aforementioned challenges can be addressed in a cost effective manner by integrating simultaneous transmission and reflecting reconfigurable intelligent surfaces (STAR-RISs). The STAR-RISs are capable of reflecting and transmitting the incident signals passively in order to serve users on both sides of the panel. Given the self-organizing nature of STAR-RIS-aided SAGINs, meticulous resource allocation and transmission strategy adaptation are imperative to accommodate changes in multiple communication node environments. Recently, federated learning has been envisioned as a pioneering distributed machine learning (ML) approach for managing the multi-objective optimization problem in STAR-RIS-aided SAGINs. This approach strives to balance the trade-offs between wireless communication performance and model efficiency. In this work, we present the advantages and potential directions for employing federated learning in STAR-RIS-aided SAGINs through multi-objectives optimization. Furthermore, to illustrate the practical application of federated learning in STAR-RIS-aided SAGINs, we present two case studies utilizing federated deep reinforcement learning, based on the non-orthogonal multiple access (NOMA) scheme. © 2017 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：