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

On the Connection Between Magnetic-Field Odometry Aided Inertial Navigation and Magnetic-Field SLAM

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Skog, Isaac Kok, Manon Hendeby, Gustaf Huang, Chuan Edridge, Thomas School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Delft Center for Systems and Control Delft University of Technology Delft Netherlands Dept. of Electrical Engineering Linköping University Linköping Sweden

Magnetic-field simultaneous localization and mapping (SLAM) using consumer-grade inertial and magnetometer sensors offers a scalable, cost-effective solution for indoor localization. However, the rapid error accumulation in the inertial navigation process limits the feasible exploratory phases of these systems. Advances in magnetometer array processing have demonstrated that odometry information, i.e., displacement and rotation information, can be extracted from local magnetic field variations and used to create magnetic-field odometry-aided inertial navigation systems. The error growth rate of these systems is significantly lower than that of standalone inertial navigation systems. This study seeks an answer to whether a magnetic-field SLAM system fed with measurements from a magnetometer array can indirectly extract odometry information — without requiring algorithmic modifications — and thus sustain longer exploratory phases. The theoretical analysis and simulation results show that such a system can extract odometry information and indirectly create a magnetic field odometry-aided inertial navigation system during the exploration phases. However, practical challenges related to map resolution and computational complexity remain significant. © 2025, CC BY.

关键词： Inertial navigation systems

CRB-Rate Tradeoff in RSMA-enabled Near-Field Integrated Multi-Target Sensing and Multi-User Communications

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhou, Jiasi Zhou, Cong Sun, Yanjing Tellambura, Chintha School of Medical Information and Engineering Xuzhou Medical University Xuzhou221004 China School of Electronic and Information Engineering Harbin Institute of Technology Harbin150001 China School of Information and Control Engineering China University of Mining and Technology Xuzhou221116 China Department of Electrical and Computer Engineering University of Alberta EdmontonABT6G 2R3 Canada

Extremely large-scale antenna arrays enhance spectral efficiency and spatial resolution in integrated sensing and communication (ISAC) networks while expanding the Rayleigh distance, triggering a shift from conventional far-field plane waves to near-field (NF) spherical waves. However, full-digital beamforming is infeasible due to the need for dedicated radio frequency (RF) chains. To address this, NF-ISAC with a rate-splitting multiple access (RSMA) scheme is developed for advanced interference management, considering fully-connected and partially-connected hybrid analog and digital (HAD) beamforming architectures. Specifically, the Cramér-Rao bound (CRB) for joint distance and angle sensing is derived, and the achievable performance region between the max-min communication rate and the multi-target CRB is defined. To fully characterize the Pareto boundary of the CRB-rate region, a sensing-centric minimization problem is formulated under communication rate constraints for two HAD beamforming architectures. A penalty dual decomposition (PDD)-based double-loop algorithm is developed to optimize fully-connected HAD beamformers. To reduce computational complexity, a two-stage design algorithm for fully connected HAD beamforming is also proposed. Additionally, the PDD-based double-loop algorithm is extended to the partially-connected HAD architecture. Simulations demonstrate the proposed schemes and algorithms: 1) achieve performance comparable to a fully digital beamformer with fewer RF chains, 2) outperform space division multiple access and far-field ISAC, and 3) yield enhanced CRB-rate trade-off performance. Copyright © 2025, The Authors. All rights reserved.

关键词： Cramer-Rao bounds

A Parallel Read-Write Circuit With Fast Amplitude-Adaptive Matching Scheme to Memristor Crossbar Array

学校读者我要写书评

暂无评论

IEEE Transactions on Circuits and Systems I: Regular Papers 2025年

作者： Jiang, Ningye Jiang, Mingxuan Huang, Haoen Yang, Le Huang, Yi Zeng, Zhigang Huazhong University of Science and Technology School of Artificial Intelligence and Automation Key Laboratory of Image Information Processing and Intelligent Control Ministry of Education of China Wuhan430074 China Wuhan Institute of Technology School of Electrical and Information Engineering Wuhan430205 China University of Massachusetts Amherst Department of Electrical and Computer Engineering AmherstMA01003 United States

Memristor crossbar array (MCA) is a computing-in-memory (CIM) module for computational acceleration. However, conventional read-write (R-W) circuits for MCA rely heavily on external components and have shortcoming in long writing times. To address these issues, we propose a parallel R-W circuit with a fast amplitude-adaptive matching (AAM) scheme. The fast AAM scheme is designed to accelerate time of writing memristors in MCA by adaptively adjusting the writing voltage to match an optimal amplitude. The architecture of parallel R-W circuit are outlined with the implementation of R-W processes. The design principles of parallel R-W unit, fast AAM unit, and associated control logic are described for analyzing their functions within the circuit. By integrating the parallel R-W circuit with MCA, a computing block is leveraged in a neural network for classification tasks. The experimental results demonstrate that the neural network with multiple computing blocks maintains high accuracy across various datasets (over 80%). Furthermore, the proposed AAM scheme achieves an average 54% reduction in writing time compared to that one without AAM scheme. Compared to the pulse-width scheme, the parallel R-W circuit exhibits an average 3.05× speedup in adjusting a 5×5 MCA, and the speedup efficiency is higher as the increases of MCA size. © 2025 IEEE.

关键词： Memristors

Service Function Chain Dynamic Scheduling in Space-Air-Ground Integrated Networks

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Jia, Ziye Cao, Yilu He, Lijun Wu, Qihui Zhu, Qiuming Niyato, Dusit Han, Zhu College of Electronic and Information Engineering Nanjing University of Aeronautics and Astronautics Nanjing211106 China State Key Laboratory of ISN Xidian University Xian710071 China School of Information and Control Engineering China University of Mining and Technology Xuzhou221116 China School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore Department of Electrical and Computer Engineering the University of Houston HoustonTX77004 United States Department of Computer Science and Engineering Kyung Hee University Seoul446-701 Korea Republic of

As an important component of the sixth generation communication technologies, the space-air-ground integrated network (SAGIN) attracts increasing attentions in recent years. However, due to the mobility and heterogeneity of the components such as satellites and unmanned aerial vehicles in multilayer SAGIN, the challenges of inefficient resource allocation and management complexity are aggregated. To this end, the network function virtualization technology is introduced and can be implemented via service function chains (SFCs) deployment. However, urgent unexpected tasks may bring conflicts and resource competition during SFC deployment, and how to schedule the SFCs of multiple tasks in SAGIN is a key issue. In this paper, we address the dynamic and complexity of SAGIN by presenting a reconfigurable time extension graph and further propose the dynamic SFC scheduling model. Then, we formulate the SFC scheduling problem to maximize the number of successful deployed SFCs within limited resources and time horizons. Since the problem is in the form of integer linear programming and intractable to solve, we propose the algorithm by incorporating deep reinforcement learning. Finally, simulation results show that the proposed algorithm has better convergence and performance compared to other benchmark algorithms. Copyright © 2025, The Authors. All rights reserved.

关键词： Network function virtualization

Data-Driven Learning and control with Event-Triggered Measurements

学校读者我要写书评

暂无评论

IEEE Transactions on Automatic control 2025年

作者： Feng, Shilun Shi, Dawei Chen, Tongwen Shi, Ling Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex Systems MIIT Key Laboratory of Servo Motion System Drive and Control School of Automation Beijing100081 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 1H9 Canada Hong Kong University of Science and Technology Department of Electronic and Computer Engineering Clear Water Bay Kowloon Hong Kong

Event-triggered control has attracted considerable attention for its effectiveness in resource-restricted applications. To make event-triggered control as an end-to-end solution, a key issue is how to effectively learn unknown system dynamics from event-triggered measurements and consequently, develop a learning-based event-triggered controller. Existing works learn system dynamics based on periodic time-triggered measurements, and it is yet to know how to learn a controller with performance guarantee based on event-triggered measurements. To address this issue, we consider the problem of learning an event-triggered state feedback controller for an unknown linear system based on event-triggered state measurements in this work. In particular, we first analyze the event-triggered measurements within a set-membership framework. We prove that the estimation error belongs to a bounded ellipsoid determined by the historical measurements and the event-triggering condition. Subsequently, we demonstrate that all admissible systems compatible with the collected data samples can be explicitly represented in the form of quadratic matrix inequalities using the state estimates. With the acquired set of admissible systems, a co-design problem for the data-driven controller and event-triggering condition is solved using the linear matrix inequality technique, with guaranteed closed-loop stability and L2-gain performance. Finally, numerical examples and comparisons are provided to illustrate the effectiveness of the proposed event-triggered learning and control approach. © 1963-2012 IEEE.

关键词： Networked control systems

Multiview Integration Network for Multitask Robotic Surgical Scene Analysis

学校读者我要写书评

暂无评论

IEEE Transactions on Instrumentation and Measurement 2025年

作者： Shen, Wenting Wang, Yaonan Liu, Min Wang, Jiazheng Ding, Renjie Zhang, Zhe Meijering, Erik Hunan University College of Electrical and Information Engineering National Engineering Research Center of Robot Visual Perception and Control Technology International Scientific and Technological Innovation Cooperation Base for Biomedical Image Processing Hunan Changsha410082 China University of New South Wales School of Computer Science and Engineering SydneyNSW2052 Australia

Surgical scene analysis holds a pivotal role in robot-assisted surgery. However, existing methods often suffer from single or little views, leading to erroneous scene analysis conclusions. To address these issues, a novel Multiview Integration Network (MVINet) is proposed, which comprehensively analyzes the surgical scene by integrating effective information from multiple views, including global, local, dynamic, and static views. As a multitask scene analysis network, MVINet could simultaneously perform semantic segmentation of surgical instruments and detection of instrument-tissue interaction. By designing a unique Global-Local Spatial Feature Memory module (G-LSFM), the joint information from globally and locally analyzed views following graph analysis simultaneously enhances the accuracy of multitask scene analysis. The Dynamic-Static Visual Feature Memory module (D-SVFM) introduces an innovative approach by simultaneously incorporating temporal feature from consecutive frames and static feature from single frame into the node features of the interaction reasoning network. The multiscale perspective of both features further enhances the ability of the module to analyze the complex scenes. Experimental results on a public and a private dataset demonstrate that our method achieves superior performance compared to other state-of-the-art methods for two crucial tasks in surgical scene analysis. In the instrument segmentation task, MVINet outperforms the second-best method by 1.73% and 0.55% in terms of mIoU scores. For the interaction detection task, MVINet surpasses the second-best method by 10.14% and 5.47% in mAP scores. © 1963-2012 IEEE.

关键词： Semantic Segmentation

Online Joint Power Allocation and Task Scheduling for LEO Satellite Networks

学校读者我要写书评

暂无评论

Online Joint Power Allocation and Task Scheduling for LEO Sa...

IEEE Conference on Wireless Communications and Networking

作者： Zheyuan Li Lijun He Juncheng Wang Ziye Jia Yanting Wang Chau Yuen School of Software Northwestern Polytechnical University China School of Information and Control Engineering China University of Mining and Technology China Department of Computer Science Hong Kong Baptist University China Ministry of Industry and Information Technology Nanjing University of Aeronautics and Astronautics China School of Electrical and Electronics Engineering Nanyang Technological University Singapore

ISBN: (数字)9798350368369

ISBN: (纸本)9798350368376

The excessive proliferation of Low Earth Orbit (LEO) satellites inescapably bring the explosive growth of space data in LEO Satellite Networks (LSNs). Meanwhile, the stochastic arrivals of space data together with the time-varying satellite-ground links in LSNs pose significant challenges for offloading a large volume of space data from LSNs to ground stations. To circumvent these challenges, we systematically study the energy-constrained online data offloading problem to jointly optimize power allocation and task scheduling for LSNs. First, we leverage Lyapunov optimization to decouple our formulated long-term stochastic joint optimization problem into a set of per-time-slot subproblems. Then, each subproblem is decoupled into a task scheduling problem and a power allocation problem. Next, we derive the optimal solution to the power allocation problem and propose a multi-armed bandit based quasi-optimal solution to the task scheduling problem. Finally, extensive simulation results show that our proposed algorithm has superior performance over the state-of-the-art solutions.

关键词： Space vehicles Satellites Simulation Low earth orbit satellites Scheduling Explosives Resource management Optimization Space stations

MKMGCN-DDI: Predicting Drug-Drug Interactions via Magnetic Graph Convolutional Network With Multiple Kernels

学校读者我要写书评

暂无评论

IEEE Transactions on Computational Biology and Bioinformatic...

IEEE Transactions on Computational Biology and Bioinformatics 2025年第2期22卷 469-480页

作者： Ming Chen Yunhan Pan Xiujuan Lei Chunyan Ji Yinglong Dai Yi Pan Department of Artificial Intelligence Hunan Normal University Changsha Hunan China School of Computer Science Shaanxi Normal University Xi’an China Computer Science Department BNU-HKBU United International College Zhuhai China Shenzhen Key Laboratory of Intelligent Bioinformatics Shenzhen Institute of Advanced Technology Shenzhen China Faculty of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen China

Polypharmacy is a common means of clinical treatments, but detecting drug-drug interactions (DDIs) behind unexpected effects can be costly and faces clinical limitations. Recently, graph neural networks (GNNs) have demonstrated encouraging performance in predicting DDIs. However, most studies overlook the comprehensive aspects of DDIs, such as the coexistence of types of pharmacological changes and the asymmetric roles of drugs. In this article, we define new prediction tasks, taking into account both enhancive or depressive changes and the roles of drugs, and then establish spectral GNNs to predict comprehensive information of DDIs. First, we formally define several tasks, including joint prediction tasks designed to leverage both types and directions. These tasks deduce to sub-tasks in previous studies. Then, we propose a unified framework, the MKMGCN-DDI, via introducing two Magnetic Laplacian matrices to encode comprehension information within DDIs, defining multiple graph filters, and designing multiple-kernel based Magnetic graph convolutional networks (MKMGCN). Experiments across three datasets show that it not only has good adaptability to multiple tasks but also significantly improves results on simple tasks. Case studies on breast neoplasms and lung neoplasms verify its feasibility, as over half of top-10 items are supported.

关键词： Drugs Predictive models Magnetic separation Laplace equations Bioinformatics Sodium Market research Graph convolutional networks computer science Computational modeling

MedFILIP: Medical Fine-grained Language-Image Pre-training

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Liang, Xinjie Li, Xiangyu Li, Fanding Jiang, Jie Dong, Qing Wang, Wei Wang, Kuanquan Dong, Suyu Luo, Gongning Li, Shuo School of Computer Science and Technology Harbin Institute of Technology Harbin China Department of Thoracic Surgery at No. 4 Affiliated Hospital Harbin Medical University Harbin China School of Computer Science and Technology Harbin Institute of Technology Shenzhen China College of computer and control engineering Northeast Forestry University Harbin China Computer Electrical and Mathematical Sciences & Engineering Division King Abdullah University of Science and Technology Thuwal Saudi Arabia Department of Biomedical Engineering Department of Computer and Data Science Case Western Reserve University ClevelandOH United States

Medical vision-language pretraining (VLP) that leverages naturally-paired medical image-report data is crucial for medical image analysis. However, existing methods struggle to accurately characterize associations between images and diseases, leading to inaccurate or incomplete diagnostic results. In this work, we propose MedFILIP, a fine-grained VLP model, introduces medical image-specific knowledge through contrastive learning, specifically: 1) An information extractor based on a large language model is proposed to decouple comprehensive disease details from reports, which excels in extracting disease deals through flexible prompt engineering, thereby effectively reducing text complexity while retaining rich information at a tiny cost. 2) A knowledge injector is proposed to construct relationships between categories and visual attributes, which help the model to make judgments based on image features, and fosters knowledge extrapolation to unfamiliar disease categories. 3) A semantic similarity matrix based on fine-grained annotations is proposed, providing smoother, information-richer labels, thus allowing fine-grained image-text alignment. 4) We validate MedFILIP on numerous datasets, e.g., RSNA-Pneumonia, NIH ChestX-ray14, VinBigData, and COVID-19. For single-label, multi-label, and fine-grained classification, our model achieves state-of-the-art performance, the classification accuracy has increased by a maximum of 6.69%. The code is available in https://***/ PerceptionComputingLab/MedFILIP. Copyright © 2025, The Authors. All rights reserved.

关键词： Semantics