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

Secure Communication of Active RIS Assisted NOMA Networks

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Li, Xuehua Pei, Yingjie Yue, Xinwei Liu, Yuanwei Ding, Zhiguo The Key Laboratory of Information and Communication Systems Ministry of Information Industry The Key Laboratory of Modern Measurement & Control Technology Ministry of Education Beijing Information Science and Technology University Beijing100101 China The School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China The School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom Department of Electrical Engineering and Computer Science Khalifa University Abu Dhabi United Arab Emirates

As a revolutionary technology, reconfigurable intelligent surface (RIS) has been deemed as an indispensable part of the 6th generation communications due to its inherent ability to regulate the wireless channels. However, passive RIS (PRIS) still suffers from some pressing issues, one of which is that the fading of the entire reflection link is proportional to the product of the distances from the base station to the PRIS and from the PRIS to the users, i.e., the productive attenuation. To tackle this problem, active RIS (ARIS) has been proposed to reconfigure the wireless propagation condition and alleviate the productive attenuation. In this paper, we investigate the physical layer security of the ARIS assisted non-orthogonal multiple access (NOMA) networks with the attendance of external and internal eavesdroppers. To be specific, the closed-form expressions of secrecy outage probability (SOP) and secrecy system throughput are derived by invoking both imperfect successive interference cancellation (ipSIC) and perfect SIC. The secrecy diversity orders of legitimate users are obtained at high signal-to-noise ratios. Numerical results are presented to verify the accuracy of the theoretical expressions and indicate that: i) The SOP of ARIS assisted NOMA networks exceeds that of PRIS-NOMA, ARIS/PRIS-assisted orthogonal multiple access (OMA);ii) Due to the balance between the thermal noise and residual interference, introducing excess reconfigurable elements at ARIS is not helpful to reduce the SOP;and iii) The secrecy throughput performance of ARIS-NOMA networks outperforms that of PRIS-NOMA and ARIS/PRIS-OMA networks. Copyright © 2024, The Authors. All rights reserved.

关键词： Signal to noise ratio

Event-aided Semantic Scene Completion

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Guo, Shangwei Shi, Hao Wang, Song Yin, Xiaoting Yang, Kailun Wang, Kaiwei State Key Laboratory of Extreme Photonics and Instrumentation Zhejiang University Hangzhou310027 China School of Robotics the National Engineering Research Center of Robot Visual Perception and Control Technology Hunan University Changsha410082 China College of Computer Science and Technology Zhejiang University Hangzhou310027 China

Autonomous driving systems rely on robust 3D scene understanding. Recent advances in Semantic Scene Completion (SSC) for autonomous driving underscore the limitations of RGB-based approaches, which struggle under motion blur, poor lighting, and adverse weather. Event cameras, offering high dynamic range and low latency, address these challenges by providing asynchronous data that complements RGB inputs. We present DSEC-SSC, the first real-world benchmark specifically designed for event-aided SSC, which includes a novel 4D labeling pipeline for generating dense, visibility-aware labels that adapt dynamically to object motion. Our proposed RGB-Event fusion framework, EvSSC, introduces an Event-aided Lifting Module (ELM) that effectively bridges 2D RGB-Event features to 3D space, enhancing view transformation and the robustness of 3D volume construction across SSC models. Extensive experiments on DSEC-SSC and simulated SemanticKITTI-E demonstrate that EvSSC is adaptable to both transformer-based and LSS-based SSC architectures. Notably, evaluations on SemanticKITTI-C demonstrate that EvSSC achieves consistently improved prediction accuracy across five degradation modes and both In-domain and Out-of-domain settings, achieving up to a 52.5% relative improvement in mIoU when the image sensor partially fails. Additionally, we quantitatively and qualitatively validate the superiority of EvSSC under motion blur and extreme weather conditions, where autonomous driving is challenged. The established datasets and our codebase will be made publicly at https://***/Pandapan01/EvSSC. Copyright © 2025, The Authors. All rights reserved.

关键词： Image enhancement

A Cyclic Small Phase Theorem

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Chen, Chao Chen, Wei Zhao, Di Chen, Jianqi Qiu, Li KU Leuven Leuven3001 Belgium The Department of Mechanics and Engineering Science State Key Laboratory for Turbulence and Complex Systems Peking University Beijing100871 China The Department of Control Science and Engineering Shanghai Institute of Intelligent Science and Technology Tongji University Shanghai200092 China The Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology Hong Kong

This paper introduces a brand-new phase definition called the segmental phase for multi-input multi-output linear time-invariant systems. The underpinning of the definition lies in the matrix segmental phase which, as its name implies, is graphically based on the smallest circular segment covering the matrix normalized numerical range in the unit disk. The matrix segmental phase has the crucial product eigen-phase bound, which makes itself stand out from several existing phase notions in the literature. The proposed bound paves the way for stability analysis of a cyclic feedback system consisting of multiple subsystems. A cyclic small phase theorem is then established as our main result, which requires the loop system phase to lie between −π and π. The proposed theorem complements a cyclic version of the celebrated small gain theorem. In addition, a generalization of the proposed theorem is made via the use of angular scaling techniques for reducing conservatism. Copyright © 2023, The Authors. All rights reserved.

关键词： Linear time-invariant system

Polyp Segmentation Neural Network with Simple Encoding Structure and Reverse Attention Module

学校读者我要写书评

暂无评论

Polyp Segmentation Neural Network with Simple Encoding Struc...

IEEE International Symposium on Information (IT) in Medicine and Education, ITME

作者： Jie Wang Zuoyong Li Haiping Xu Xuesong Cheng Shenghua Teng College of Electronic and Information Engineering Shandong University of Science and Technology Qingdao China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Control Engineering Minjiang University Fuzhou China Fujian Key Laboratory of Medical Big Data Engineering Fujian Provincial Hospital Fuzhou China College of Mathematics and Data Science Minjiang University Fuzhou China

Colorectal cancer is a common malignancy. In colonoscopy images, computer-assisted polyp segmentation helps doctors diagnose and treat disorders more precisely. In recent years, some methods based on deep convolutional neural networks have made significant breakthroughs in this task. However, only a few algorithms explicitly consider the effect of light intensity on segmentation performance, which results in algorithms needing to be more robust for complex samples. This paper proposes a neural network combining a simple encoding structure with a reverse attention module. Specifically, the model uses HarDNet68 as the backbone network, adds a camouflage identification module (CIM) to enhance the capture of polyp details on the underlying features, and finally utilizes adaptive feature fusion with the reverse attention module (RAM). The proposed model effectively addresses the challenge of poor segmentation quality in colonoscopy images caused by inconsistent illumination. Extensive experiments on five datasets show that the proposed model performs well in polyp segmentation.

关键词：

A stabilizing reinforcement learning approach for sampled systems with partially unknown models

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Beckenbach, Lukas Osinenko, Pavel Streif, Stefan The Laboratory for Automatic Control and System Dynamics Technische Universität Chemnitz Chemnitz09107 Germany The Digital Engineering Center Skolkovo Institute of Science and Technology Moscow121205 Russia

Reinforcement learning is commonly associated with training of reward-maximizing (or cost-minimizing) agents, in other words, controllers. It can be applied in model-free or model-based fashion, using a priori or online collected system data to train involved parametric architectures. In general, online reinforcement learning does not guarantee closed loop stability unless special measures are taken, for instance, through learning constraints or tailored training rules. Particularly promising are hybrids of reinforcement learning with "classical" control approaches. In this work, we suggest a method to guarantee practical stability of the system-controller closed loop in a purely online learning setting, i. e., without offline training. Moreover, we assume only partial knowledge of the system model. To achieve the claimed results, we employ techniques of classical adaptive control. The implementation of the overall control scheme is provided explicitly in a digital, sampled setting. That is, the controller receives the state of the system and computes the control action at discrete, specifically, equidistant moments in time. The method is tested in adaptive traction control and cruise control where it proved to significantly reduce the *** Codes 93D15 © 2022, CC BY-NC-ND.

关键词： Reinforcement learning

Analysis and Forecasting of Temperature Based on Temporal Fusion Transformer Model: A Case Study of Urumqi

学校读者我要写书评

暂无评论

Analysis and Forecasting of Temperature Based on Temporal Fu...

Artificial Intelligence and computer engineering (ICAICE), International Conference on

作者： Xinjun Song Haiyang Sun Shiyang Zhan Jin Ran Di Hou School of Traffic and Transportation Engineering Xinjiang University Xinjiang China School of Computer Science and Technology Xinjiang University Xinjiang China Xinjiang Key Laboratory of Green Construction and Smart Traffic Control of Transportation Infrastructure Xinjiang University Urumqi China

ISBN: (数字)9798331528911

ISBN: (纸本)9798331528928

Accurate temperature forecasting is important in many fields such as environmental engineering, disaster prevention and monitoring. This study aims to use the TFT model to predict the daily maximum, minimum and average air temperatures in Urumqi city. It was trained and optimized based on the screened and integrated temperature datasets collected from public databases such as CBE Clima, Weather Spark, and NOAA, and the performance of the TFT model in the temperature data was also investigated. Based on the MAE error criterion and the comparison between the predicted and historical true values of temperature in Urumqi city from May 4, 2024 to May 8, 2024, it is found that the TFT model can predict the short-term temperature accurately with less training set training. It is an important research step in the field of temperature analysis and prediction for finding models with better prediction performance, which will also contribute to the related decision making process.

关键词： Training Temperature distribution Analytical models Accuracy Computational modeling Urban areas Predictive models Data models Thin film transistors Forecasting

Prediction of piRNA-mRNA interactions based on an interactive inference network

学校读者我要写书评

暂无评论

Prediction of piRNA-mRNA interactions based on an interactiv...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Yajun Liu Ru Li Aimin Li Rong Fei Xie Guo Fang-Xiang Wu Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an University of Technology Xi'an China Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an University of Technology Xi'an China Department of Computer Science Department of Mechanical Engineering Division of Biomedical Engineering University of Saskatchewan Saskatoon Canada

As the largest class of small non-coding RNAs, piRNAs primarily present in the reproductive cells of mammals, which influence post-transcriptional processes of mRNAs in multiple ways. Effective methods for predicting piRNA and mRNA target relationships can help identify piRNA functions, investigate the possibility of piRNAs as biomarkers and therapeutic targets. In this study, we propose a computational approach for classifying the relationships of piRNA-mRNA pairs based on an interactive inference network (IIN). First, we gather piRNA-mRNA target data, collect sequence data by position alignment, and construct a benchmark dataset. Furthermore, a reliable negative set is constructed by positive-unlabeled learning. Finally, we view a piRNA and a mRNA sequence as a premise and hypothesis sentence, respectively, and IIN model is used to predict the relationship between them. The experiments demonstrate that our method effectively characterizes piRNA-mRNA interaction and could be beneficial for researchers to investigate piRNA functions.

关键词：

Research on Path Planning Algorithm Based on D* Search

学校读者我要写书评

暂无评论

Research on Path Planning Algorithm Based on D* Search

Ocean Studies (ICOS), International Conference on

作者： Jiajun Leng Li Fu Lingling Wang Ning Tang Laboratory of Science and Technology on Marine Navigation and Control China State Shipbuilding Corporation Beijing 100036 China Tianjin Navigation Instruments Research Institute Tianjin China School of Automation Science and Electrical Engineering Beihang University Beijing China Department of Automatic control systems Bauman Moscow State Technical University Moscow Russia

Path planning algorithms are current research hotspots. Heuristic algorithms that can solve dynamic environment problems are gradually becoming the mainstream research direction. The D* algorithm, as one of the new heuristic algorithms, has the advantages of being more computationally efficient than the A * algorithm and being able to solve dynamic problems, and has played an important role in two-dimensional path planning projects such as the NASA Mars rover. But its theoretical research and practical application in 3D environment are very rare. In this context, this paper carries out an in-depth study of the path planning problem based on the D* algorithm, and completes the theoretical derivation and simulation process in 2D and 3D environments. In this paper, a complex random 2D map is established by random generation, and the simulation of D* algorithm is realized on the map with the help of Python language, which realizes the finding of the relative optimal path. Then, in order to study the feasibility of D* solving in 3D environment, the simulation of D* algorithm under 3D map is realized with the help of Python and Unity3d. The research results show that the simulation results are good, which is valuable for the theoretical research and practical application of heuristic algorithms, and plays a role in the application of robot path planning algorithms.

关键词：

Multi-fleet platoon matching: A game-theoretic approach

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Johansson, Alexander Nekouei, Ehsan Johansson, Karl Henrik Mårtensson, Jonas Integrated Transport Research Lab Department of Automatic Control School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden StockholmSE-100 44 Sweden

We consider the platoon matching problem for a set of trucks with the same origin, but different destinations. It is assumed that the vehicles benefit from traveling in a platoon for instance through reduced fuel consumption. The vehicles belong to different fleet owners and their strategic interaction is modeled as a non-cooperative game where the vehicle actions are their departure times. Each truck has a preferred departure time and its utility function is defined as the difference between its benefit from platooning and the cost of deviating from its preferred departure time. We show that the platoon matching game is an exact potential game. An algorithm based on best response dynamics is proposed for finding a Nash equilibrium of the game. At a Nash equilibrium, vehicles with the same departure time are matched to form a platoon. Finally, the total fuel reduction at the Nash equilibrium is studied and compared with that of a cooperative matching solution where a common utility function for all vehicles is optimized. Copyright © 2022, The Authors. All rights reserved.

关键词： Game theory