arXiv subjects

Xuehua Li

Publications and source records attributed to Xuehua Li.

14 recordsLinked to original sources

arXiv2026

Towards Accurate and Fast Clinical Body Composition: A Resource-Efficient Hierarchical Segmentation Framework for Multi-Source CT

Background: Automated 3D segmentation of muscles and adipose tissue from CT is vital for body composition analysis, but multi-source data heterogeneity and high CPU memory demands hinder clinical deployment. Methods: We propose a coarse-to-fine hierarchical framework to segment ten tissue structures. Efficiency is optimized using Dynamic Spacing and Anisotropic Patching, a Group Inference mechanism for low-memory sliding-window processing, and Topology-Aware Asymmetric Resampling for fast post-processing. Results: The framework was trained on 1,558 CT volumes from seven public and two private datasets, and evaluated on an independent test cohort (N=105), per-structure Dice coefficients ranged from 0.924 to 0.982. Eight major structures met the +-10% relative error clinical acceptance limit. On a 12-core CPU workstation, the GPU-free pipeline averaged 44.5 seconds per volume with 4.73 GB peak memory. Conclusion: This framework balances accuracy and efficiency, enabling robust, large-scale body composition analysis on standard CPU workstations.

eess.IV↗

arXiv2025

An inverse-free fixed-time stable dynamical system and its forward-Euler discretization for solving generalized absolute value equations

An inverse-free dynamical system is proposed to solve the generalized absolute value equation (GAVE) with a fixed time convergence, where the time of convergence is finite and is uniformly bounded for all initial points. Moreover, an iterative method obtained by using the forward-Euler discretization of the proposed dynamic model is developed and sufficient conditions which guarantee that the discrete iteration globally converge to an arbitrarily small neighborhood of the unique solution of GAVE within a finite number of iterative steps are given. Numerical results illustrate the effectiveness of the proposed methods.

math.NA↗

arXiv2025

A generalization of the relaxation-based matrix splitting iterative method for solving the system of generalized absolute value equations

By incorporating a new matrix splitting and the momentum acceleration into the relaxed-based matrix splitting (RMS) method \cite{soso2023}, a generalization of the RMS (GRMS) iterative method for solving the generalized absolute value equations (GAVEs) is proposed. On the one hand, unlike some existing methods, by using the Cauchy's convergence principle we give some sufficient conditions for the existence and uniqueness of the solution to GAVEs and prove that our method can converge to the unique solution of GAVEs. On the other hand, we obtain a few new and weaker convergence conditions for some existing methods. Moreover, we establish comparison theorems between GRMS method and some existing methods. Preliminary numerical experiments show that the proposed method is efficient.

math.NA↗

arXiv2025

Solutions for Underdetermined Generalized Absolute Value Equations

An underdetermined generalized absolute value equation (GAVE) may have no solution, one solution, finitely many or infinitely many solutions. This paper is concerned with sufficient conditions that guarantee the existence of solutions to an underdetermined GAVE. Particularly, sufficient conditions are established for an underdetermined GAVE to have infinitely many solutions with no zero entry that possess a particular or any given sign pattern. Iterative methods are proposed for the case when the underdetermined GAVE does have a solution. Some existing results for square GAVE are also extended.

math.NA↗

arXiv2024

Performance Analysis of Double Reconfigurable Intelligent Surfaces Assisted NOMA Networks

This paper introduces double cascaded reconfigurable intelligent surfaces (RISs) to non-orthogonal multiple access (NOMA) networks over cascaded Rician fading and Nakagami-$m$ fading channels, where two kinds of passive RIS (PRIS) and active RIS (ARIS) are taken into consideration, called PRIS-ARIS-NOMA networks. Additionally, new closed-form and asymptotic expressions for outage probability and ergodic data rate of two non-orthogonal users are derived with the imperfect/perfect successive interference cancellation schemes. The scenario is modelled around two non-orthogonal users and focuses on analyzing their communication characteristics. Based on the approximate results, the diversity orders and ergodic data rate slopes of two users are obtained in the high signal-to-noise ratios. In addition, the system throughput of PRIS-ARIS-NOMA in delay-limited mode and delay-tolerant mode are discussed according to the outage probability and ergodic data rate. The simulation results verify the correctness of the formulas and yields the following insights: 1) The outage behaviors of PRIS-ARIS-NOMA outperforms than that of PRIS-ARIS assisted orthogonal multiple access (OMA); 2)Use of PRIS-ARIS-NOMA is better than use of PRIS-ARIS-OMA in small transmit power threshold scenarios 3) By increasing the number of reflecting elements of RISs, the PRIS-ARIS-NOMA is able to achieve the enhanced outage performance; and 4) The PRIS-ARIS-NOMA has the higher ergodic data rate and system throughput than double PRISs-NOMA.

math.NA↗

arXiv2024

Beamforming Design for Secure MC-NOMA Empowered ISAC Systems with an Active Eve

As the integrated sensing and communication(ISAC) technology emerges as a promising component of sixth generation (6G), the study of its physical layer security has become a key concern for researchers. Specifically, in this work, we focus on the security issues over a multi-carrier (MC)-non-orthogonal multiple access (NOMA) assisted ISAC system, considering imperfect channel state information (CSI) of an active Eve and graded confidentiality demands for users. To this end, the subcarrier allocation, the information, and artificial noise beamforming are designed to maximize the minimum communication rate, while ensuring diverse confidentiality and sensing performance demands. An effective security strategy is devised via the Lagrangian dual transformation and successive convex approximation methods. Simulations confirm the validity and robustness of the proposed scheme in terms of the security performance.

cs.IT↗

arXiv2024

Secrecy Outage Probability Analysis for Downlink RIS-NOMA Networks with On-Off Control

Reconfigurable intelligent surface (RIS) has been regarded as a promising technology since it has ability to create the favorable channel conditions. This paper investigates the secure communications of RIS assisted non-orthogonal multiple access (NOMA) networks, where both external and internal eavesdropping scenarios are taken into consideration. More specifically, novel approximate and asymptotic expressions of secrecy outage probability (SOP) for the k-th legitimate user (LU) are derived by invoking imperfect successive interference cancellation (ipSIC) and perfect successive interference cancellation (pSIC). To characterize the secrecy performance of RIS-NOMA networks, the diversity order of the k-th LU with ipSIC/pSIC is obtained in the high signal-to-noise ratio region. The secrecy system throughput of RIS-NOMA networks is discussed in delay-limited transmission mode. Numerical results are presented to verify theoretical analysis that: i) The SOP of RIS-NOMA networks is superior to that of RIS assisted orthogonal multiple access (OMA) and conventional cooperative communication schemes; ii) As the number of reflecting elements increases, the RIS-NOMA networks are capable of achieving the enhanced secrecy performance; and iii) The RIS-NOMA networks have better secrecy system throughput than that of RIS-OMA networks and conventional cooperative communication schemes.

cs.IT↗

arXiv2024

Secure Communication of Active RIS Assisted NOMA Networks

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.

cs.IT↗

arXiv2023

A generalization of the Newton-based matrix splitting iteration method for generalized absolute value equations

A generalization of the Newton-based matrix splitting iteration method (GNMS) for solving the generalized absolute value equations (GAVEs) is proposed. Under mild conditions, the GNMS method converges to the unique solution of the GAVEs. Moreover, we can obtain a few weaker convergence conditions for some existing methods. Numerical results verify the effectiveness of the proposed method.

math.NA↗

arXiv2022

Multi-Agent Deep Reinforcement Learning Based Resource Management in SWIPT Enabled Cellular Networks with H2H/M2M Co-Existence

Machine-to-Machine (M2M) communication is crucial in developing Internet of Things (IoT). As it is well known that cellular networks have been considered as the primary infrastructure for M2M communications, there are several key issues to be addressed in order to deploy M2M communications over cellular networks. Notably, the rapid growth of M2M traffic dramatically increases energy consumption, as well as degrades the performance of existing Human-to-Human (H2H) traffic. Sustainable operation technology and resource management are efficacious ways for solving these issues. In this paper, we investigate a resource management problem in cellular networks with H2H/M2M coexistence. First, considering the energy-constrained nature of machine type communication devices (MTCDs), we propose a novel network model enabled by simultaneous wireless information and power transfer (SWIPT), which empowers MTCDs with the ability to simultaneously perform energy harvesting (EH) and information decoding. Given the diverse characteristics of IoT devices, we subdivide MTCDs into critical and tolerable types, further formulating the resource management problem as an energy efficiency (EE) maximization problem under divers Quality-of-Service (QoS) constraints. Then, we develop a multi-agent deep reinforcement learning (DRL) based scheme to solve this problem. It provides optimal spectrum, transmit power and power splitting (PS) ratio allocation policies, along with efficient model training under designed behaviour-tracking based state space and common reward function. Finally, we verify that with a reasonable training mechanism, multiple M2M agents successfully work cooperatively in a distributed way, resulting in network performance that outperforms other intelligence approaches in terms of convergence speed and meeting the EE and QoS requirements.

cs.NI↗

arXiv2022

A fixed-time inverse-free dynamical system for solving the system of absolute value equations

In this paper, an inverse-free dynamical system with fixed-time convergence is presented to solve the system of absolute value equations (AVEs). Under a mild condition, it is proved that the solution of the proposed dynamical system converges to the solution of the AVEs. Moreover, in contrast to the existing inverse-free dynamical system \cite{chen2021}, a conservative settling-time of the proposed method is given. Numerical simulations illustrate the effectiveness of the new method.

math.DS↗

arXiv2020

Outage Behaviors of NOMA-based Satellite Network over Shadowed-Rician Fading Channels

This paper investigates the application of non-orthogonal multiple access (NOMA) to satellite communication network over Shadowed-Rician fading channels. The impact of imperfect successive interference cancellation (ipSIC) on NOMA-based satellite network is taken into consideration from the perspective of practical scenarios. We first derive new exact expressions of outage probability for the p-th terrestrial user and provide the corresponding asymptotic analysis results. The diversity order of zero and p are achieved by the p-th terrestrial user with ipSIC and perfect successive interference cancellation (pSIC), respectively. Finally, the presented simulation results show that: 1) On the condition of pSIC, the outage behaviors of NOMA-based satellite network are superior to that of orthogonal multiple access; 2) With the value of residual interference increasing, the outage performance of terrestrial users with ipSIC is becoming worse seriously; and 3) Infrequent light shadowing of Shadowed-Rician fading brings the better outage probability compared to frequent heavy and average shadowing.

cs.IT↗

arXiv2019

Secure Communications in a Unified Non-Orthogonal Multiple Access Framework

This paper investigates the impact of physical layer secrecy on the performance of a unified non-orthogonal multiple access (NOMA) framework, where both external and internal eavesdropping scenarios are examined. The spatial locations of legitimate users (LUs) and eavesdroppers are modeled by invoking stochastic geometry. To characterize the security performance, new exact and asymptotic expressions of secrecy outage probability (SOP) are derived for both code-domain NOMA (CD-NOMA) and power-domain NOMA (PD-NOMA), in which imperfect successive interference cancellation (ipSIC) and perfect SIC (pSIC) are taken into account. For the external eavesdropping scenario, the secrecy diversity orders by a pair of LUs (the n-th user and m-th user) for CD/PD-NOMA are obtained. Analytical results make known that the diversity orders of the $n$-th user with ipSIC/pSIC for CD-NOMA and PD-NOMA are equal to zero/K and zero/one, respectively. The diversity orders of the m-th user are equal to K/one for CD/PD-NOMA. For the internal eavesdropping scenario, we examine the analysis of secrecy diversity order and observe that the m-th user to wiretap the n-th user with ipSIC/pSIC for CD-NOMA and PD-NOMA provide the diversity orders of zero/K and zero/one, respectively, which is consistent with external eavesdropping scenario. Numerical results are present to confirm the accuracy of the analytical results developed and show that: i) The secrecy outage behavior of the $n$-th user is superior to that of the m-th user; ii) By increasing the number of subcarriers, CD-NOMA is capable of achieving a larger secrecy diversity gain compared to PD-NOMA.

cs.IT↗

arXiv2006

Comparison Theorems of Kolmogorov Type for Classes Defined by Cyclic Variation Diminishing Operators and Their Application

Using present a unified approach, we establish a Kolmogorov type comparison theorem for the classes of $2π$-periodic functions defined by a special class of operators having certain oscillation properties, which includes the classical Sobolev class of functions with 2$π$-periodic, the Achieser class, and the Hardy-Sobolev class as its special examples. Then, using these results, we prove a Taikov type inequality, and calculate the exact values of Kolmogorov, Gel$'$fand, linear and information $n$--widths of this class of functions in some space $L_{q}$, which is the classical Lebesgue integral space of 2$π$--periodic with the usual norm.

math.NA↗