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

Joint Power Allocation and Task Scheduling for Data Offloading in Non-Geostationary Orbit Satellite Networks

学校读者我要写书评

暂无评论

IEEE Transactions on Network and Service Management 2025年

作者： He, Lijun Jia, Ziye Wang, Juncheng Lansard, Erick Han, Zhu Yuen, Chau China University of Mining and Technology School of Information and Control Engineering Xuzhou221116 China Xidian University State Key Laboratory of Integrated Services Networks Shaanxi Xi'an710071 China Nanjing University of Aeronautics and Astronautics College of Electronic and Information Engineering Nanjing211106 China Southeast University National Mobile Communications Research Laboratory Nanjing211111 China Hong Kong Baptist University Department of Computer Science China Nanyang Technological University School of Electrical and Electronics Engineering 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

In Non-Geostationary Orbit Satellite Networks (NGOSNs) with a large number of battery-carrying satellites, proper power allocation and task scheduling are crucial to improving data offloading efficiency. In this work, we jointly optimize power allocation and task scheduling to achieve energy-efficient data offloading in NGOSNs. Our goal is to properly balance the minimization of the total energy consumption and the maximization of the sum weights of tasks. Due to the tight coupling between power allocation and task scheduling, we first derive the optimal power allocation solution to the joint optimization problem with any given task scheduling policy. We then leverage the conflict graph model to transform the joint optimization problem into an Integer Linear Programming (ILP) problem with any given power allocation strategy. We explore the unique structure of the ILP problem to derive an efficient semidefinite relaxation-based solution. Finally, we utilize the genetic framework to combine the above special solutions as a two-layer solution for the original joint optimization problem. Simulation results demonstrate that our proposed solution can properly balance the reduction of total energy consumption and the improvement of the sum weights of tasks, thus achieving superior system performance over the current literature. © 2004-2012 IEEE.

关键词： Geostationary satellites

Leader-Follower Formation Tracking control of Quadrotor UAVs Using Bearing Measurements

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Doodeman, Sander Tang, Zhiqi Jacinto, Marcelo Cunha, Rita Silvestre, Carlos Department of Mechanical Engineering TU/e Eindhoven University of Technology Eindhoven Netherlands Division of Decision and Control Systems KTH Royal Institute of Technology Sweden Instituto Superior Técnico University of Lisbon Portugal Department of Electrical and Computer Engineering Faculty of Science and Technology University of Macau China

This work addresses the practical problem of distributed formation tracking control of a group of quadrotor vehicles in a relaxed sensing graph topology with a very limited sensor set, where only one leader vehicle can access the global position. Other vehicles in the formation are assumed to only have access to inter-agent bearing (direction) measurements and relative velocities with respect to their neighbor agents. A hierarchical control architecture is adopted for each quadrotor, combining a high-gain attitude inner-loop and an outer-loop bearing-based formation controller with collision avoidance augmentation. The proposed method enables a group of quadrotors to track arbitrary bearing persistently exciting desired formations, including time-varying shapes and rotational maneuvers, such that each quadrotor only requires relative measurements to at least one neighboring quadrotor. The effective performance of the control strategy is validated by numerical simulations in MATLAB and real-world experiments with three quadrotors. © 2025, CC BY-NC-ND.

关键词： Unmanned aerial vehicles (UAV)

Multi-Agent Distributed DQN and Transfer Learning for Energy-Efficient Power Management in Solar Energy-Harvested Small-Cell Networks

学校读者我要写书评

暂无评论

IEEE Internet of Things Journal 2025年

作者： Cho, Hyebin Kim, Hyungsub Na, JeeHyeon Lim, Seung-Chan Lee, Howon Hankyong National University School of Electrical Electronic and Control Engineering Anseong17579 Korea Republic of Electronics and Telecommunications Research Institute Daejeon34141 Korea Republic of Hankyong National University School of ICT Robotics and Mechanical Engineering and IITC Anseong17579 Korea Republic of Ajou University Department of Electrical and Computer Engineering Suwon16499 Korea Republic of

The integration of solar energy harvesting into small-cell networks is a promising solution for achieving energy-efficient and sustainable wireless communications. However, the inherent variability and intermittency of solar energy, coupled with precise inter-cell interference management, significantly hinder efficient network operation. To resolve these challenges, we propose a multi-agent distributed deep Q-network (MA-DDQN) framework, where the distributed base stations learn the optimal transmit power control policies. To further enhance adaptability under varying solar conditions, we present a daily model transfer with a fine-tuning approach, enabling efficient deployment without extensive training overhead. Simulation results demonstrate that the proposed methods remarkably improve energy efficiency while maintaining robust adaptability under dynamic solar conditions, revealing their potential for sustainable small-cell network deployments. © 2014 IEEE.

关键词： Solar cell efficiency

Motion planning for highly-dynamic unconditioned reflexes based on chained Signed Distance Functions

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Lin, Ken Ye, Qi Lam, Tin Lun Li, Zhibin Chen, Jiming Li, Gaofeng College of Control Science and Engineering Zhejiang University Hangzhou China Robotics and Artificial Intelligence Laboratory The Chinese University of Hongkong Shenzhen China Department of Computer Science University College London London United Kingdom

The unconditioned reflex (e.g., protective reflex), which is the innate reaction of the organism and usually performed through the spinal cord rather than the brain, can enable organisms to escape harms from environments. Accordingly, it is essential to endow robots the highly-dynamic unconditioned reflexes to humans and/or environments, such that it can work collaboratively with humans or serve people in daily life. Although various sampling-based and optimization-based motion planning methods have been developed for robots, their limited computational speed is not suitable for rapid motion planning in highly-dynamic environments. In this paper, we propose an online, highly-dynamic motion planning algorithm to enable highly-dynamic unconditioned reflexes for manipulators. Our method is based on a chained version of Signed Distance Functions (SDFs), which can be pre-computed and stored. Our proposed algorithm is divided into two stages. In the offline stage, we create 3 groups of local SDFs to store the geometric information of the manipulator and its working environment. The SDFs in the first group are to describe the geometric information of the static environment. The SDFs in the second group are to describe the geometric information of each link. While the SDFs in the last group are to describe the reachability of each link’s end of the manipulator. In the online stage, the precomputed local SDFs are chained together according the configuration of the manipulator, to provide global geometric information about the environment. While the point clouds of the dynamic objects serve as query points to look up these local SDFs for quickly generating escape velocity. Then we propose a modified geometric Jacobian matrix and use the Jacobian-pseudo-inverse method to generate real-time reflex behaviors to avoid the static and dynamic obstacles in the environment. The benefits of our method are validated in both static and dynamic scenarios. In the static scenario, our meth

关键词： Jacobian matrices

A Feature Fusion Attention-based Deep Learning Algorithm for Mammographic Architectural Distortion Classification

学校读者我要写书评

暂无评论

IEEE Journal of Biomedical and Health Informatics 2025年 PP卷 PP页

作者： Rehman, Khalil Ur Jianqiang, Li Yasin, Anaa Bilal, Anas Basheer, Shakila Ullah, Inam Jabbar, Muhammad Kashif Tian, Yibin Shenzhen University College of Mechatronics and Control Engineering Shenzhen518060 China Beijing University of Technology College of Software Engineering Beijing100124 China Hainan Normal University College of Information Science and Technology Hainan Haikou571158 China Princess Nourah Bint Abdulrahman University Department of Information Systems College of Computer and Information Science Riyadh11671 Saudi Arabia Gachon University Department of Computer Engineering Seongnam13120 Korea Republic of Tashkent State University of Economics Department of Artificial Intelligence Tashkent100066 Uzbekistan

Architectural Distortion (AD) is a common abnormality in digital mammograms, alongside masses and microcalcifications. Detecting AD in dense breast tissue is particularly challenging due to its heterogeneous asymmetries and subtle presentation. Factors such as location, size, shape, texture, and variability in patterns contribute to reduced sensitivity. To address these challenges, we propose a novel feature fusion-based Vision Transformer (ViT) attention network, combined with VGG-16, to improve accuracy and efficiency in AD detection. Our approach mitigates issues related to texture fixation, background boundaries, and deep neural network limitations, enhancing the robustness of AD classification in mammograms. Experimental results demonstrate that the proposed model achieves state-of-the-art performance, outperforming eight existing deep learning models. On the PINUM dataset, it attains 0.97 sensitivity, 0.92 F1-score, 0.93 precision, 0.94 specificity, and 0.96 accuracy. On the DDSM dataset, it records 0.93 sensitivity, 0.91 F1-score, 0.94 precision, 0.92 specificity, and 0.95 accuracy. These results highlight the potential of our method for computer-aided breast cancer diagnosis, particularly in low-resource settings where access to high-end imaging technology is limited. By enabling more accurate and timely AD detection, our approach could significantly improve breast cancer screening and early intervention worldwide. © 2013 IEEE.

关键词： Deep neural networks

Data-Driven Nonconvex Reachability Analysis using Exact Multiplication

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhang, Zhen Niazi, M. Umar B Chong, Michelle S. Johansson, Karl H. Alanwar, Amr School of Computation Information and Technology Technical University of Munich Germany Division of Decision and Control Systems Digital Futures School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Department of Mechanical Engineering Eindhoven University of Technology Netherlands

This paper addresses a fundamental challenge in data-driven reachability analysis: accurately representing and propagating non-convex reachable sets. We propose a novel approach using constrained polynomial zonotopes to describe reachable sets for unknown LTI systems. Unlike constrained zonotopes commonly used in existing literature, constrained polynomial zonotopes are closed under multiplication with constrained matrix zonotopes. We leverage this property to develop an exact multiplication method that preserves the non-convex geometry of reachable sets without resorting to approximations. We demonstrate that our approach provides tighter over-approximations of reachable sets for LTI systems compared to conventional methods. © 2025, CC BY.

关键词： Geometry

Topological Dictionary Learning

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Grimaldi, Enrico Battiloro, Claudio Di Lorenzo, Paolo Department of Computer Control and Management Engineering Sapienza University of Rome Via Ariosto 25 Rome00185 Italy Biostatistics Department of Harvard University 655 Huntington Ave BostonMA02115 United States Department of Information Engineering Electronics and Telecommunications Sapienza University of Rome Via Eudossiana 18 Rome00184 Italy

The aim of this paper is to introduce a novel dictionary learning algorithm for sparse representation of signals defined over combinatorial topological spaces, specifically, regular cell complexes. Leveraging Hodge theory, we embed topology into the dictionary structure via concatenated sub-dictionaries, each as a polynomial of Hodge Laplacians, yielding localized spectral topological filter frames. The learning problem is cast to jointly infer the underlying cell complex and optimize the dictionary coefficients and the sparse signal representation. We efficiently solve the problem via iterative alternating algorithms. Numerical results on both synthetic and real data show the effectiveness of the proposed procedure in jointly learning the sparse representations and the underlying relational structure of topological signals. © 2025, CC BY.

关键词： Topology

ESARSA-MRFO-FS: Optimizing Manta-ray Foraging Optimizer using Expected-SARSA reinforcement learning for features selection

学校读者我要写书评

暂无评论

Knowledge-Based Systems 2025年 321卷

作者： AbdulAzeem, Yousry Magdy Balaha, Hossam Bamaqa, Amna Badawy, Mahmoud Elhosseini, Mostafa A. Zewail City of Science and Technology October Gardens 6th of October City Giza12578 Egypt Bioengineering Department J.B. Speed School of Engineering University of Louisville LouisvilleKY United States Computers and Control Systems Engineering Department Mansoura University Faculty of Engineering Mansoura35516 Egypt Department of Computer Science and Information Applied College Taibah University Madinah42353 Saudi Arabia Department of Information Systems College of Computer Science and Engineering Taibah University Yanbu46421 Saudi Arabia

Disease prediction with the help of computers has achieved significant progress in this area;however, it still requires a more accurate identification of each data feature. In the past few years, ML-based medical diagnoses have become increasingly dependent on the datasets rather than the algorithms. Consequently, the more features in a dataset, the more difficult the model training process will be. A feature selection (FS) strategy can be used to eliminate unwanted features before the training in order to improve the model performance. Due to the great increase in the number of features, FS causes a complex combinatorial problem, which is NP-hard. The primary goal of this research is to create a novel framework for improving the Manta-ray Foraging Optimizer (MRFO) algorithm's performance. By the method of exploration–exploitation toggle adjustments, this process becomes the most efficient one by using the Expected State–action-reward-state–action (ESARSA) reinforcement learning strategy. The study employed 12 datasets as well as two classifiers (K-Nearest-Neighbor and Decision-Tree), both with and without hyperparameter adjustment. The study compared the performances of three feature selection methods: no feature selection, the original MRFO algorithm, and the proposed ESARSAMRFO-FS algorithm. The results revealed that ESARSA-MRFO-FS is the most effective of the three algorithms with classifiers and optimization scenarios. Besides, experiments comparing MRFO and ESARSA-MRFO performance on 44 benchmarks are presented in the article. In five functions, ESARSA-MRFO outperforms MRFO. These results confirm that the proposed method is efficient for feature selection in medical diagnosis because of its accuracy and low processing costs. © 2025 Elsevier B.V.

关键词： Nearest neighbor search

Enhancing HBIM-to-VR workflows: Semi-automatic generation of virtual heritage experiences using enriched IFC files

学校读者我要写书评

暂无评论

Digital Applications in Archaeology and Cultural Heritage 2025年 36卷

作者： Fiorenza, Jacopo Rimella, Nicola Calandra, Davide Osello, Anna Lamberti, Fabrizio Department of Control and Computer Engineering Politecnico di Torino Corso Duca degli Abruzzi 24 Turin 10129 Italy Department of Structural Geotechnical and Building Engineering Politecnico di Torino Corso Duca degli Abruzzi 24 Turin 10129 Italy

In recent years, the digitization of Cultural Heritage (CH) has gained momentum, with Historical Building Information Modeling (HBIM) playing a vital role in developing services that enhance the understanding of built heritage. However, current HBIM-to-VR workflows, crucial for Virtual Heritage Experiences (VHEs), often rely on proprietary tools that may limit interoperability. To address this issue, some studies have used the Industry Foundation Classes (IFC) file format which, unfortunately, lacks functionalities for VHE creation, complicating the process for non-IT users. This paper introduces a semi-automated HBIM-to-VR workflow using an enriched IFC file. The process includes a manual phase for preparing the IFC file with metadata and a subsequent automated phase where a VR platform generates a virtual visit. A use case involving the “Hall of Seasons” in Palazzo Carignano, Turin, demonstrates the workflow's potential to improve accessibility and scalability in creating VHEs. © 2024 The Authors

关键词： Cultural heritage Historical building information modeling Industry foundation classes Virtual reality Virtual visits