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

STARS Assisted Semi-Grant-Free NOMA Communications

IEEE Transactions on Wireless Communications 2025年

作者： Xie, Jin Yue, Xinwei Zhao, Jingjing Zou, Yixuan Liu, Yuanwei Liu, Rongke Ding, Zhiguo Key Laboratory of Information and Communication Systems China Beijing Information Science and Technology University Key Laboratory of Modern Measurement and Control Technology Ministry of Education Beijing100101 China Beihang University School of Electronic and Information Engineering Beijing100191 China Queen Mary University of London School of Electronic Engineering and Computer Science LondonE1 4NS United Kingdom The University of Hong Kong Department of Electrical and Electronic Engineering Hong Kong Hong Kong Kyung Hee University Department of Electronic Engineering Gyeonggi-do Yongin-si17104 Korea Republic of Khalifa University Department of Computer and Information Engineering Abu Dhabi United Arab Emirates

This paper investigates the performance of simultaneously transmitting and reflecting surface (STARS) assisted semi-grant-free non-orthogonal multiple access network with randomly distributed users. By deploying STARS, the transmit signals of grant-based user (GBU) and grant-free users (GFUs) can be exquisitely adjusted to reduce interference. We propose a maximum channel scheduling (MCS) protocol that allows a GFU to access GBU’s channel with the assistance of STARS. In particular, the impacts of perfect/imperfect successive interference cancellation (pSIC/ipSIC) on MCS protocol are taken into account. To characterize the performance of STARS aided MCS (STARS-MCS) network, we derive the expressions of outage probability for GBU and GFU with pSIC/ipSIC. By applying convolution theorem and Laplace transform, the asymptotic expressions of outage probability and diversity orders for GBU and GFU are attained. We further design a STARS-based power control (SPC) strategy to eliminate the outage probability error floor and improve the outage performance. Numerical results show that: 1) The performance of STARS-MCS outperforms the existing benchmarks in terms of outage probability and system throughput;2) The SPC strategy can effectively improve the performance of the STARS-MCS network and eliminate the outage probability error floor at high signal-to-noise ratios;and 3) By adjusting reflection and transmission coefficients of STARS, the outage performance of GBU and GFU can be greatly enhanced. © 2025 IEEE. All rights reserved.

关键词： Laplace transforms

来源：评论

学校读者我要写书评

暂无评论

Joint Optimization of Power Allocation and Beamforming for UAV-RIS Communication System

引用

IEEE Wireless Communications Letters 2025年

作者： Guo, Xinying Liu, Longfei Zhang, Jiankang Chen, Sheng Ministry of Education Key Laboratory of Grain Information Processing and Control Henan University of Technology China Henan University of Technology College of Information Science and Engineering Zhengzhou450001 China Bournemouth University Department of Computing and Informatics BH12 5BB United Kingdom University of Southampton School of Electronics and Computer Science SouthamptonSO17 1BJ United Kingdom

This paper considers the communication system assisted by a fixed-trajectory unmanned aerial vehicle (UAV), which is equipped with a reconfigurable intelligent surface (RIS). For this UAV-RIS assisted system, we jointly optimize the power allocation and active beamforming at the base station (BS) and the passive beamforming at the RIS, by a novel phase block coordinate descent algorithm framework aimed at maximizing the system sum-rate. Specifically, the joint optimization problem is decomposed into two phases, and we propose two optimization algorithms: one for BS power allocation using fractional programming (FP) and the other for jointly optimizing active and passive beamforming using FP-manifold, which alternately optimize two phases. Simulation results not only highlight the rapid convergence and evident superiority of our proposed framework but also reveal that the optimal UAV-RIS placement is related to the flight height. © 2012 IEEE.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Tumor Cellularity Assessment Using Artificial Intelligence Trained on Immunohistochemistry-Restained Slides Improves Selection of Lung Adenocarcinoma Samples for Molecular Testing

引用

American Journal of Pathology 2025年第5期195卷 907-922页

作者： Gertych, Arkadiusz Zurek, Natalia Piaseczna, Natalia Szkaradnik, Kamil Cui, Yujie Zhang, Yi Nurzynska, Karolina Pyciński, Bartłomiej Paul, Piotr Bartczak, Artur Chmielik, Ewa Walts, Ann E. Faculty of Biomedical Engineering Silesian University of Technology Zabrze Poland Department of Pathology and Laboratory Medicine Cedars-Sinai Medical Center Los Angeles California United States Department of Surgery Cedars-Sinai Medical Center Los Angeles California United States F. Widjaja Inflammatory Bowel Disease Institute Cedars-Sinai Medical Center Los Angeles California United States Biostatistics Shared Resource Cedars-Sinai Medical Center Los Angeles California United States Biobank and Research Pathology Resource Cedars-Sinai Medical Center Los Angeles California United States Faculty of Automatic Control Electronics and Computer Science Silesian University of Technology Gliwice Poland Tumor Pathology Department Maria Sklodowska-Curie National Research Institute of Oncology Gliwice Branch Gliwice Poland Hospital for Lung Diseases “Rebirth ” Zakopane Poland

Tumor cellularity (TC) in lung adenocarcinoma slides submitted for molecular testing is important in identifying actionable mutations, but lack of best practice guidelines results in high interobserver variability in TC assessments. An artificial intelligence (AI)–based pipeline developed to assess TC in hematoxylin and eosin (H&E) whole slide images (WSIs) and in tumor areas (TAs) within WSIs includes a new model (CaBeSt-Net) trained to mask cancer cells, benign epithelial cells, stroma in H&E WSIs using immunohistochemistry-restained slides, and a model to detect all cell nuclei. High masking accuracy (>91%) by CaBeSt-Net computed using 1024 H&E regions of interest and intraclass correlation coefficient >0.97 assessing TC assessments reliability by one pathologist and AI in 20 test regions of interest supported the pipeline's applicability to TC assessment in 50 study H&E WSIs. Using the pipeline, TCs assessed in TAs and WSIs were compared with those by three pathologists. Reliabilities of these ratings by the pathologists supported by the pipeline were good (intraclass correlation coefficient >0.82, P < 0.0001). The consistency of sample categorizations as inadequate or adequate (TC ≤ 20% cut point) for molecular testing among the pathologists assessing TCs without AI support was moderate in TAs (κ = 0.410, P < 0.0001) and slight in WSIs (κ = 0.132, nonsignificant). With AI support, the consistency was substantial in both WSIs (κ = 0.602, P < 0.0001) and TAs (κ = 0.704, P < 0.0001). By visualizing cancer and measuring TC in the sample, this novel AI-based pipeline assists pathologists in selecting samples for molecular testing. © 2025 American Society for Investigative Pathology

关键词： artificial intelligence computational pathology immunohistochemical staining lung adenocarcinoma restained slides tumor burden tumor cellularity assessment

来源：评论

学校读者我要写书评

暂无评论

EAVFormer: an end-to-end audio and visual emotion recognition network based on transformers

引用

Multimedia Systems 2025年第3期31卷 1-22页

作者： Liu, Haoran Sun, Zijian Li, Haibin Li, Yaqian Zhang, Wenming Song, Tao School of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Special Fiber and Fiber Sensor of Hebei Province Yanshan University Qinhuangdao China Key Lab of Industrial Computer Control Engineering of Hebei Province Yanshan University Qinhuangdao China Shenzhen Research Institute of Yanshan University Shenzhen China Key Lab of Measurement Technology & Instrumentation of Hebei Province School of Electrical Engineering Yanshan University Qinhuangdao China

Audio-visual emotion recognition, integrating information from various sources, enhances the comprehensive understanding and analysis of human emotions. However, existing methods in this field primarily focus on feature fusion, often overlooking the equally crucial stage of feature extraction. Typically, these methods employ pre-trained models to extract features during the initial phase, complicating modality-specific feature extraction and increasing system complexity and coordination challenges, which hinder effective audio-visual feature fusion. To address these issues, we propose an end-to-end audio-visual emotion recognition model, EAVFormer. For the audio modality, we input raw audio signals along with a mix of mel spectrograms and Mel Frequency Cepstral Coefficients (MFCCs), employing a hierarchical transformer technique that facilitates both shallow local and deep global feature extraction to fully harness complementary acoustic information, significantly enhancing the acoustic modality’s contribution. For the visual modality, we input raw video frames and employ a hierarchical transformer feature extraction method that integrates three-dimensional convolution and spatio-temporal self-attention mechanisms to address spatial and temporal redundancies and dependencies, thereby enhancing the expression of dynamic visual information. In the modal fusion stage, we construct dual-modality representations and encode inter-modal information while preserving modality-specific and meaningful intra-modal features. Testing on three popular datasets RAVDESS, CREMA-D, and CMU-MOSEI demonstrates that EAVFormer surpasses existing state-of-the-art methods in audio-visual emotion recognition accuracy, achieving rates of 95.17%, 86.13%, and 78.22%, respectively.

关键词： Image coding

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on automatic control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-c/2) network cumulative constraint violation bound, where T is the number of rounds and c∈ (0,1) is a user-defined trade-off parameter. When Slater's condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T1-c). Moreover, if the loss functions are strongly convex, then static network regret bound is reduced to O(log (T)), and the network cumulative constraint violation bound is reduced to O(√log (T)T) and O(log (T)) without and with Slater's condition, respectively. To the best of our knowledge, this paper is the first to achieve tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Adaptive ELM-Based Time-Constrained control of Uncertain Robotic Manipulators With Minimum Learning Computation

引用

IEEE Transactions on Emerging Topics in Computing 2025年

作者： Jin, Xiaozheng Hou, Yuhan Wu, Xiaoming Chi, Jing Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Shandong Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Jinan250013 China Qilu Institute of Technology School of Intelligent Manufacturing and Control Engineering Shandong Jinan250200 China Shandong University of Finance and Economics School of Computing and Artificial Intelligence Shandong Jinan250014 China

This paper studies the extreme learning machine (ELM)-based time-constrained trajectory tracking control of a class of robotic manipulator systems with model/input uncertainties, matched and mismatched disturbances. A uniform robust exact differentiator (URED) is developed to construct a multi-layer virtual control framework of the robotic manipulator system. Under the control framework, adaptive ELM-based control strategies are proposed to suppress the influence of the uncertainties and disturbances layer-by-layer, combining with the minimum learning parameter (MLP) technique which is employed to reduce the calculation complexity of ELM parameters. The significance of this study is that general model/input uncertainties, matched and mismatched disturbances can be effectively compensated within a limited time, so that bounded trajectory tracking of the robotic manipulator can be achieved avoiding the complexity explosion issue. The time-constrained stability of the closed-loop robotic error systems is proved through Lyapunov stability theory. Finally, comparative simulations are employed to display the feasibility and superiority of the designed robust adaptive ELM-based control schemes of a robotic manipulator system. © 2013 IEEE.

关键词： Robust control

来源：评论

学校读者我要写书评

暂无评论

Distributed Constrained Online Nonconvex Optimization with Compressed Communication

arXiv

引用

arXiv 2025年

作者： Zhang, Kunpeng Xu, Lei Yi, Xinlei Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Mechanical Engineering University of Victoria VictoriaBCV8W 2Y2 Canada Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Shanghai201210 China Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online nonconvex optimization with time-varying inequality constraints over a network of agents. For a time-varying graph, we propose a distributed online primal–dual algorithm with compressed communication to efficiently utilize communication resources. We show that the proposed algorithm establishes an O(T max{1−θ1,θ1}) network regret bound and an O(T 1−θ1/2) network cumulative constraint violation bound, where T is the number of iterations and θ1 ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints at all iterations), the network cumulative constraint violation bound is reduced to O(T 1−θ1). These bounds are comparable to the state-of-the-art results established by existing distributed online algorithms with perfect communication for distributed online convex optimization with (time-varying) inequality constraints. Finally, a simulation example is presented to validate the theoretical results. Copyright © 2025, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

A Survey on Network Management for xANET: Evolution, Challenges, Future Directions

引用

IEEE Communications Surveys and Tutorials 2025年

作者： Li, Tong Yang, Chungang Wang, Yao Cai, Lin Anpalagan, Alagan Han, Zhu Xidian University State Key Laboratory of Integrated Services Networks Xi'an710071 China National Key Laboratory of Multi-domain Data Collaborative Processing and Control Xi'an710068 China Hangzhou Institute of Technology of Xidian University Hangzhou311231 China University of Victoria Department of Electrical and Computer Engineering VictoriaBCV8P 5C2 Canada Ryerson University Department of Electrical and Computer Engineering TorontoONM5B 2K3 Canada University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446701 Korea Republic of

The x ad hoc network (xANET) termed as a family of ad hoc networks, including mobile ad hoc network (MANET), vehicular ad hoc network (VANET), flying ad hoc network (FANET) and satellite ad hoc network (SANET), has found a wide range of applications in providing ubiquitous wireless services. Despite its broad utility, the dynamic nature and lack of a centralized controller pose significant challenges to effective and flexible network management for xANET. Conventional network management protocols face challenges such as scalability, security vulnerabilities, configuration complexity, robustness, and performance resilience. Recent efforts have presented different approaches, focusing on policy-based network management (PBNM) and intent-driven network management (IDNM). However, there is no comprehensive survey to clarify their concepts and classifications. This paper presents a survey of the network management evolution for xANET, covering configuration-based, policy-based and the latest intent-driven approaches. We first introduce the characteristics and applications of xANET. Meanwhile, we investigate the network management concepts and challenges. Moreover, we survey the evolution of management protocols for xANET, including simple network management protocol (SNMP), PBNM, and IDNM. Then, we follow the detailed network management of xANET from configuration-based to policy-based and intent-driven approaches. Through comparative analysis, it is found that IDNM employs a more intelligent management protocol, demonstrating higher efficiency and flexibility in handling complex tasks and dynamic network management. This makes it better suited to addressing the challenges of xANET management. Finally, we summarize the remaining challenges and possible future research directions. © 2025 IEEE.

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

NFV-Enabled Service Recovery in Space-Air-Ground Integrated Networks: A Matching Game Based Approach

arXiv

引用

arXiv 2025年

作者： Jia, Ziye Cao, Yilu He, Lijun Li, Guangxia Zhou, Fuhui Wu, Qihui 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 Department of Electrical and Computer Engineering University of Houston HoustonTX77004 United States Department of Computer Science and Engineering Kyung Hee University Seoul446-701 Korea Republic of

To achieve ubiquitous connectivity of the sixth generation communication, the space-air-ground integrated network (SAGIN) is a popular topic. However, the dynamic nodes in SAGIN such as satellites and unmanned aerial vehicles, may be fragile and out of operation, which can potentially cause service failure. Therefore, the research on service recovery in SAGIN under situations of resource failure is critical. In order to facilitate the flexible resource utilization of SAGIN, the network function virtualization technology (NFV) is proposed to be employed. Firstly, the task management is transformed into the deployment of service function chains (SFCs). Then, we design an NFV-based SFC recovery model in SAGIN in the face of resource failure, so that tasks can quickly select alternative resources to complete deployments. Moreover, the problem of SFC recovery is formulated to minimize the total time consumption for all completed SFCs. Since it is an NP-hard integer linear programming problem, we propose the efficient recovery algorithm based on the matching game. Finally, via various simulations, the effectiveness of the proposed algorithm and its advantages are verified, where the total time consumption is optimized by about 25%, compared with other benchmark methods. Copyright © 2025, The Authors. All rights reserved.

关键词： Network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Method of programming of sequential control systems using LabVIEW environment

引用

IFAC-PapersOnLine 2016年第25期49卷 476-481页

作者： Wcislik, Miroslaw Suchenia, Karol Laskawski, Michal S. Faculty of Electric Engineering Automatic Control and Computer Science Kielce University of Technology Poland

The paper deals with the new methodology of programming of sequential control systems in Lab VIEW language. By similarity to the SFC language and use of only a few defined blocks and connections, the proposed approach makes it easy to construct and analyze program of control system. The methodology uses only basic elements of the Lab VIEW language. That is why it may be used in wide variety of control devices including FPGA. © 2016

关键词： control systems Flip flop circuits Block diagrams decoders Graphical languages LabViEW Sequence control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：