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

arXiv 2025年

作者： Wang, Xudong Wang, Jiacheng Feng, Lei Niyato, Dusit Zhang, Ruichen Kang, Jiawen Xiong, Zehui Du, Hongyang Mao, Shiwen State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing100876 China College of Computing and Data Science Nanyang Technological University Singapore School of Automation Guangdong University of Technology Guangzhou510006 China Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore Department of Electrical and Electronic Engineering University of Hong Kong Pok Fu Lam Hong Kong Department of Electrical and Computer Engineering Auburn University Auburn United States

Generative AI (GenAI) is driving the intelligence of wireless communications. Due to data limitations, random generation, and dynamic environments, GenAI may generate channel information or optimization strategies that violate physical laws or deviate from actual real-world requirements. We refer to this phenomenon as wireless hallucination, which results in invalid channel information, spectrum wastage, and low communication reliability but remains underexplored. To address this gap, this article provides a comprehensive concept of wireless hallucinations in GenAI-driven communications, focusing on hallucination mitigation. Specifically, we first introduce the fundamental, analyze its causes based on the GenAI workflow, and propose mitigation solutions at the data, model, and post-generation levels. Then, we systematically examines representative hallucination scenarios in GenAI-enabled communications and their corresponding solutions. Finally, we propose a novel integrated mitigation solution for GenAI-based channel estimation. At the data level, we establish a channel estimation hallucination dataset and employ generative adversarial networks (GANs)-based data augmentation. Additionally, we incorporate attention mechanisms and large language models (LLMs) to enhance both training and inference performance. Experimental results demonstrate that the proposed hybrid solutions reduce the normalized mean square error (NMSE) by 0.19, effectively reducing wireless hallucinations. Copyright © 2025, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Deep multiple instance learning on heterogeneous graph for drug–disease association prediction

引用

computers in Biology and Medicine 2025年 184卷 109403-109403页

作者： Gu, Yaowen Zheng, Si Zhang, Bowen Kang, Hongyu Jiang, Rui Li, Jiao Beijing100020 China Department of Chemistry New York University NY10027 United States Institute for Artificial Intelligence Department of Computer Science and Technology BNRist Tsinghua University Beijing100084 China Beijing StoneWise Technology Co Ltd. Beijing100080 China Ministry of Education Key Laboratory of Bioinformatics Bioinformatics Division at the Beijing National Research Center for Information Science and Technology Center for Synthetic and Systems Biology Department of Automation Tsinghua University Beijing100084 China

Drug repositioning offers promising prospects for accelerating drug discovery by identifying potential drug–disease associations (DDAs) for existing drugs and diseases. Previous methods have generated meta-path-augmented node or graph embeddings for DDA prediction in drug–disease heterogeneous networks. However, these approaches rarely develop end-to-end frameworks for path instance-level representation learning as well as the further feature selection and aggregation. By leveraging the abundant topological information in path instances, more fine-grained and interpretable predictions can be achieved. To this end, we introduce deep multiple instance learning into drug repositioning by proposing a novel method called MilGNet. MilGNet employs a heterogeneous graph neural network (HGNN)-based encoder to learn drug and disease node embeddings. Treating each drug–disease pair as a bag, we designed a special quadruplet meta-path form and implemented a pseudo meta-path generator in MilGNet to obtain multiple meta-path instances based on network topology. Additionally, a bidirectional instance encoder enhances the representation of meta-path instances. Finally, MilGNet utilizes a multi-scale interpretable predictor to aggregate bag embeddings with an attention mechanism, providing predictions at both the bag and instance levels for accurate and explainable predictions. Comprehensive experiments on five benchmarks demonstrate that MilGNet significantly outperforms ten advanced methods. Notably, three case studies on one drug (Methotrexate) and two diseases (Renal Failure and Mismatch Repair Cancer Syndrome) highlight MilGNet's potential for discovering new indications, therapies, and generating rational meta-path instances to investigate possible treatment mechanisms. The source code is available at https://***/gu-yaowen/MilGNet. © 2024 Elsevier Ltd

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

Enabling Real-time Computing and Transmission Services in Large-Scale LEO Satellite Networks

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Guo, Binquan Zhang, Zhou Atapattu, Saman Pan, Miao Yan, Ye Xiong, Zehui Li, Hongyan Xidian University State Key Laboratory of Integrated Services Networks Xi'an710071 China Tianjin300457 China Singapore University of Technology and Design Pillar of Information Systems Technology and Design 487372 Singapore Hunan University College of Computer Science and Electronic Engineering Changsha410012 China University School of Engineering MelbourneVIC3000 Australia University of Houston Department of Electrical and Computer Engineering HoustonTX77204 United States Tianjin Artificial Intelligence Innovation Center Tianjin300387 China

Enhanced by onboard computing resources and inter-satellite links (ISLs), large-scale satellite networks (SNs) can supplement terrestrial networks, facilitating real-time edge computing and transmission in remote areas at low latency. This capability benefits applications such as real-time remote object tracking, vehicular edge computing, and environmental monitoring. However, different from terrestrial vehicular networks, satellite mobility and the intermittent nature of ISLs often render many computing satellites inaccessible, necessitating efficient scheduling scheme for joint computing and communication resource allocation. To meet this requirement, we investigate joint computing and transmission strategy for real-time computing applications over SNs to reduce end-to-end delays. We formulate the real-time computing and transmission problem over time-varying SNs as an integer linear programming problem. The mathematical optimization method has an exponential time complexity of O(2|L⫟| . (4 |V⫟| + 4∣ L⫟|)2|L∣) in the worst case, which grows rapidly with the growth of network sizes. Here, |V⫟| and |L⫟| denote the number of nodes and links, respectively, within the time window {\tau }. Resorting to the designed k-shortest path-based method yields a worst-case complexity of O(|V⫟|! . |V⫟|3). While efficient under common scenarios, its running time is still relatively unstable and may become tens of times longer when computing resources become scarce. To enhance efficiency, we further design a graph-based algorithm that leverages the solution space's unique structure, thereby achieving optimal solutions with polynomial time complexity O(3|L⫟| + (2\log |V⫟|+1) |V⫟|). Extensive evaluations conducted on the world's largest Starlink system validate the efficacy of the designed methods and highlight their potential synergy. © 1967-2012 IEEE.

关键词： Satellite links

来源：评论

学校读者我要写书评

暂无评论

OptiPMB: Enhancing 3D Multi-Object Tracking with Optimized Poisson Multi-Bernoulli Filtering

arXiv

引用

arXiv 2025年

作者： Ding, Guanhua Xia, Yuxuan Guan, Runwei Wu, Qinchen Huang, Tao Ding, Weiping Sun, Jinping Mao, Guoqiang School of Electronic Information Engineering Beihang University Beijing100191 China Department of Automation Shanghai Jiaotong University Shanghai200240 China Department of Computer Science and Engineering The Hong Kong University of Science and Technology Guangzhou511455 China College of Science and Engineering James Cook University SmithfieldQLD4878 Australia School of Artificial Intelligence and Computer Science Nantong University Nantong226019 China Faculty of Data Science City University of Macau 999078 China Research Laboratory of Smart Driving and Intelligent Transportation Systems Southeast University Nanjing210096 China

Accurate 3D multi-object tracking (MOT) is crucial for autonomous driving, as it enables robust perception, navigation, and planning in complex environments. While deep learning-based solutions have demonstrated impressive 3D MOT performance, model-based approaches remain appealing for their simplicity, interpretability, and data efficiency. Conventional model-based trackers typically rely on random vector-based Bayesian filters within the tracking-by-detection (TBD) framework but face limitations due to heuristic data association and track management schemes. In contrast, random finite set (RFS)-based Bayesian filtering handles object birth, survival, and death in a theoretically sound manner, facilitating interpretability and parameter tuning. In this paper, we present OptiPMB, a novel RFS-based 3D MOT method that employs an optimized Poisson multi-Bernoulli (PMB) filter while incorporating several key innovative designs within the TBD framework. Specifically, we propose a measurement-driven hybrid adaptive birth model for improved track initialization, employ adaptive detection probability parameters to effectively maintain tracks for occluded objects, and optimize density pruning and track extraction modules to further enhance overall tracking performance. Extensive evaluations on nuScenes and KITTI datasets show that OptiPMB achieves superior tracking accuracy compared with state-of-the-art methods, thereby establishing a new benchmark for model-based 3D MOT and offering valuable insights for future research on RFS-based trackers in autonomous driving. Copyright © 2025, The Authors. All rights reserved.

关键词： Wiener filtering

来源：评论

学校读者我要写书评

暂无评论

On the reconfiguration of degradable VLSI/WSI arrays

On the reconfiguration of degradable VLSI/WSI arrays

引用

IEEE International Workshop on Defect and Fault Tolerance in VLSI systems, DFT 1993

作者： Low, C.P. Leong, H.W. Algorithms and Design Automation Laboratory Department of Information Systems and Computer Science National University of Singapore Lower Kent Ridge Road Singapore0511 Singapore

ISBN: (纸本)0818635029

This paper consider the problem of reconfiguring VLSI/WSI arrays via the degradation approach. In this approach, all elements are treated uniformly and no elements are dedicated as spares. The goal is to derive a fault-free subarray T from the defective host array such that the dimensions of T are larger than some specified minimum. This problem has been shown to be NP-complete under various switching and routing constraints. However, we show that a special case of the reconfiguration problem with row bypass and column rerouting capabilities, is solvable in polynomial time using network flows. Using this result, a new fast and efficient reconfiguration algorithm is proposed. Empirical study shows that the new algorithm indeed produce good results in terms of the percentages of harvest and degradation of VLSI/WSI arrays. © 1993 IEEE.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Dexterous Manipulation through Imitation Learning: A Survey

arXiv

引用

arXiv 2025年

作者： An, Shan Meng, Ziyu Tang, Chao Zhou, Yuning Liu, Tengyu Ding, Fangqiang Zhang, Shufang Mu, Yao Song, Ran Zhang, Wei Hou, Zeng-Guang Zhang, Hong School of Electrical and Information Engineering Tianjin University Tianjin300072 China School of Control Science and Engineering Shandong University Jinan250061 China State Key Laboratory of General Artificial Intelligence Beijing100086 China Department of Mechanical and Process Engineering ETH Zurich Zurich8092 Switzerland Department of Electronic and Electrical Engineering Southern University of Science and Technology Shenzhen518055 China School of Informatics University of Edinburgh EH8 9AB United Kingdom Department of Computer Science University of Hong Kong 999077 Hong Kong State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing100049 China CASIA-MUST Joint Laboratory of Intelligence Science and Technology Institute of Systems Engineering Macau University of Science and Technology 999078 China

Dexterous manipulation, which refers to the ability of a robotic hand or multi-fingered end-effector to skillfully control, reorient, and manipulate objects through precise, coordinated finger movements and adaptive force modulation, enables complex interactions similar to human hand dexterity. With recent advances in robotics and machine learning, there is a growing demand for these systems to operate in complex and unstructured environments. Traditional model-based approaches struggle to generalize across tasks and object variations due to the high-dimensionality and complex contact dynamics of dexterous manipulation. Although model-free methods such as reinforcement learning (RL) show promise, they require extensive training, large-scale interaction data, and carefully designed rewards for stability and effectiveness. Imitation learning (IL) offers an alternative by allowing robots to acquire dexterous manipulation skills directly from expert demonstrations, capturing fine-grained coordination and contact dynamics while bypassing the need for explicit modeling and large-scale trial-and-error. This survey provides an overview of dexterous manipulation methods based on imitation learning (IL), details recent advances, and addresses key challenges in the field. Additionally, it explores potential research directions to enhance IL-driven dexterous manipulation. Our goal is to offer researchers and practitioners a comprehensive introduction to this rapidly evolving domain. Copyright © 2025, The Authors. All rights reserved.

关键词： Grippers

来源：评论

学校读者我要写书评

暂无评论

A Decode-and-Forward Scheme for LDPC Coded Three-Way Relay Fading Channels

引用

China Communications 2015年第8期12卷 46-54页

作者： YE Xia GAO Feifei Department of Computer Science & Information Management Wenzhou Medical University Department of Automation Tsinghua University State Key Lab of Intelligent Technologies and Systems Tsinghua National Laboratory for Information Science and Technology (TNList)

In this paper a low-density pairwise check(LDPC) coded three-way relay system is considered, where three user nodes desire to exchange messages with the help of one relay node. Since physical-layer network coding is applied, two time slots are sufficient for one round information exchange. In this paper, we present a decode-and-forward(DF) scheme based on joint LDPC decoding for three-way relay channels, where relay decoder partially decodes the network code rather than fully decodes all the user messages. Simulation results show that the new DF scheme considerably outperforms other common schemes in three-way relay fading channels.

关键词： three-way relay channel physicallayer network coding LDPC codes decode-and forward

来源：评论

学校读者我要写书评

暂无评论

Strategic Robust Mixed Model Assembly Line Balancing Based on Scenario Planning

引用

Tsinghua science and Technology 2011年第3期16卷 308-314页

作者：徐炜达肖田元 National Laboratory for Information Science and Technology National Computer Integrated Manufacturing Systems Engineering Research CenterDepartment of AutomationTsinghua University

Assembly line balancing involves assigning a series of task elements to uniform sequential stations with certain restrictions. Decision makers often discover that a task assignment which is optimal with respect to a deterministic or stochastic/fuzzy model yields quite poor performance in reality. In real environments, assembly line balancing robustness is a more appropriate decision selection guide. A robust model based on the α worst case scenario is developed to compensate for the drawbacks of traditional robust criteria. A robust genetic algorithm is used to solve the problem. Comprehensive computational experiments to study the effect of the solution procedure show that the model generates more flexible robust solutions. Careful tuning the value of α allows the decision maker to balance robustness and conservativeness of as- sembly line task element assignments.

关键词： mixed model assembly line balancing robust scenario planning genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Formation control with obstacle avoidance of second-order multi-agent systems under directed communication topology

引用

science China(information sciences) 2019年第9期62卷 144-157页

作者： Guoxing WEN C.L.Philip CHEN Hui DOU Hongli YANG Chunfang LIU College of Science Binzhou University Department of Computer and Information Science Faculty of Science and Technology University of Macau College of Navigation Dalian Maritime University State Key Laboratory of Management and Control for Complex Systems Institute of AutomationChinese Academy of Sciences Mathematics and Systems Science College Shandong University of Science and Technology

This paper addresses the obstacle avoidance problem of formation control for the multi-agent systems modeled by double integrator dynamics under a directed interconnection topology. The control task is finished by a leader-follower formation scheme combined with an artificial potential field(APF) *** leader-follower scheme is carried out by taking the desired trajectory with the desired velocity as virtual leader, while the APF method is carried out by dealing with the obstacles as the high potential points. When the obstacle avoidance tasks are finished, the artificial potential forces degrade the formation performance, so their undesired effects are treated as disturbances, which is analyzed by the robust H∞performance. Based on Lyapunov stability theory, it is proved that the proposed formation approach can realize the control objective. The result is also extended to the switching multi-agent formation. The effectiveness of the proposed formation scheme is further confirmed by simulation studies.

关键词： formation control obstacle avoidance artificial potential field method H_∞ performance second-order multi-agent system directed topology

来源：评论

学校读者我要写书评

暂无评论

On the configuration of degradable VLSI/WSI arrays

On the configuration of degradable VLSI/WSI arrays

引用

IEEE International Symposium on Defect and Fault Tolerance in VLSI systems

作者： C.P. Low H.W. Leong Algorithms and Design Automation Laboratory Department of Information Systems & Computer Science National University of Singapore Singapore

The authors consider the problem of reconfiguring VLSI/WSI arrays via the degradation approach. In this approach, all elements are treated uniformly and no elements are dedicated as spares. The goal is to derive a fault-free subarray T from the defective host array such that the dimensions of T are larger than some specified minimum. This problem has been shown to be NP-complete under various switching and routing constraints. However, it is shown that a special case of the reconfiguration problem with row bypass and column rerouting capabilities, is solvable in polynomial time using network flows. Using this result, a new fast and efficient reconfiguration algorithm is proposed. Empirical study shows that the new algorithm indeed produces good results in terms of the percentages of harvest and degradation of VLSI/WSI arrays.

关键词： Degradation Routing Switches Polynomials Logic arrays design automation Laboratories information systems computer science Turning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：