Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
24works
0followers
24topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

24 published item(s)

preprint2026arXiv

DiLA: Disentangled Latent Action World Models

Latent Action Models (LAMs) enable the learning of world models from unlabeled video by inferring abstract actions between consecutive frames. However, LAMs face a fundamental trade-off between action abstraction and generation fidelity. Existing methods typically circumvent this issue by using two-stage training with pre-trained world models or by limiting predictions to optical flow. In this paper, we introduce DiLA, a novel Disentangled Latent Action world model that aims to resolve this trade-off via content-structure disentanglement. Our key insight is that disentanglement and latent action learning are co-evolving: the predictive bottleneck inherent in latent action learning serves as a driving force for disentanglement, compelling the model to distill spatial layouts into the structure pathway while offloading visual details to a separate content pathway for generation. This synergy yields a continuous, semantically structured latent action space without compromising generative quality. DiLA achieves superior results in video generation quality, action transfer, visual planning, and manifold interpretability. These findings establish DiLA as a unified framework that simultaneously achieves high-level action abstraction and high-fidelity generation, advancing the frontier of self-supervised world model learning.

preprint2026arXiv

Pinching Antennas in Blockage-Aware Environments: Modeling, Design, and Optimization

Pinching-antenna (PA) systems have recently emerged as a promising member of the flexible-antenna family due to their ability to dynamically establish line-of-sight (LoS) links. While most existing studies assume ideal environments without obstacles, practical indoor deployments are often obstacle-rich, where LoS blockage significantly degrades performance. This paper investigates pinching-antenna systems in blockage-aware environments by developing a deterministic model for cylinder-shaped obstacles that precisely characterizes LoS conditions without relying on stochastic approximations. Based on this model, a special case is first studied where each PA serves a single user and can only be deployed at discrete positions along the waveguide. In this case, the waveguide-user assignment is obtained via the Hungarian algorithm, and PA positions are refined using a surrogate-assisted block-coordinate search. Then, a general case is considered where each PA serves all users and can be continuously placed along the waveguide. In this case, beamforming and PA positions are jointly optimized by a weighted minimum mean square error integrated deep deterministic policy gradient (WMMSE-DDPG) approach to address non-smooth LoS transitions. Simulation results demonstrate that the proposed algorithms significantly improve system throughput and LoS connectivity compared with benchmark methods. Moreover, the results reveal that pinching-antenna systems can effectively leverage obstacles to suppress co-channel interference, converting potential blockages into performance gains.

preprint2026arXiv

Time Travel Engine: A Shared Latent Chronological Manifold Enables Historical Navigation in Large Language Models

Time functions as a fundamental dimension of human cognition, yet the mechanisms by which Large Language Models (LLMs) encode chronological progression remain opaque. We demonstrate that temporal information in their latent space is organized not as discrete clusters but as a continuous, traversable geometry. We introduce the Time Travel Engine (TTE), an interpretability-driven framework that projects diachronic linguistic patterns onto a shared chronological manifold. Unlike surface-level prompting, TTE directly modulates latent representations to induce coherent stylistic, lexical, and conceptual shifts aligned with target eras. By parameterizing diachronic evolution as a continuous manifold within the residual stream, TTE enables fluid navigation through period-specific "zeitgeists" while restricting access to future knowledge. Furthermore, experiments across diverse architectures reveal topological isomorphism between the temporal subspaces of Chinese and English-indicating that distinct languages share a universal geometric logic of historical evolution. These findings bridge historical linguistics with mechanistic interpretability, offering a novel paradigm for controlling temporal reasoning in neural networks.

preprint2025arXiv

Emergent disorder and sub-ballistic dynamics in quantum simulations of the Ising model using Rydberg atom arrays

Rydberg atom arrays with Van der Waals interactions provide a controllable path to simulate the locally connected transverse-field Ising model (TFIM), a prototypical model in statistical mechanics. Remotely operating the publicly accessible Aquila Rydberg atom array, we experimentally investigate the physics of TFIM far from equilibrium and uncover significant deviations from the theoretical predictions. Rather than the expected ballistic spread of correlations, the Rydberg simulator exhibits a subballistic spread, along with a logarithmic scaling of entanglement entropy in time - all while the system mostly retains its initial magnetization. By modeling the atom motion, we trace these effects to an emergent disorder in Rydberg atom arrays, which we characterize with a minimal random spin model. We further experimentally explore the different dynamical regimes hosted in the system by varying the lattice spacing and the Rabi frequency. Our findings highlight the crucial role of atom motion in the many-body dynamics of Rydberg atom arrays at the TFIM limit, and propose simple benchmark measurements to test for its presence in future experiments.

preprint2023arXiv

AI of Brain and Cognitive Sciences: From the Perspective of First Principles

Nowadays, we have witnessed the great success of AI in various applications, including image classification, game playing, protein structure analysis, language translation, and content generation. Despite these powerful applications, there are still many tasks in our daily life that are rather simple to humans but pose great challenges to AI. These include image and language understanding, few-shot learning, abstract concepts, and low-energy cost computing. Thus, learning from the brain is still a promising way that can shed light on the development of next-generation AI. The brain is arguably the only known intelligent machine in the universe, which is the product of evolution for animals surviving in the natural environment. At the behavior level, psychology and cognitive sciences have demonstrated that human and animal brains can execute very intelligent high-level cognitive functions. At the structure level, cognitive and computational neurosciences have unveiled that the brain has extremely complicated but elegant network forms to support its functions. Over years, people are gathering knowledge about the structure and functions of the brain, and this process is accelerating recently along with the initiation of giant brain projects worldwide. Here, we argue that the general principles of brain functions are the most valuable things to inspire the development of AI. These general principles are the standard rules of the brain extracting, representing, manipulating, and retrieving information, and here we call them the first principles of the brain. This paper collects six such first principles. They are attractor network, criticality, random network, sparse coding, relational memory, and perceptual learning. On each topic, we review its biological background, fundamental property, potential application to AI, and future development.

preprint2022arXiv

Aerial Computing: A New Computing Paradigm, Applications, and Challenges

In existing computing systems, such as edge computing and cloud computing, several emerging applications and practical scenarios are mostly unavailable or only partially implemented. To overcome the limitations that restrict such applications, the development of a comprehensive computing paradigm has garnered attention in both academia and industry. However, a gap exists in the literature owing to the scarce research, and a comprehensive computing paradigm is yet to be systematically designed and reviewed. This study introduces a novel concept, called aerial computing, via the amalgamation of aerial radio access networks and edge computing, which attempts to bridge the gap. Specifically, first, we propose a novel comprehensive computing architecture that is composed of low-altitude computing, high-altitude computing, and satellite computing platforms, along with conventional computing systems. We determine that aerial computing offers several desirable attributes: global computing service, better mobility, higher scalability and availability, and simultaneity. Second, we comprehensively discuss key technologies that facilitate aerial computing, including energy refilling, edge computing, network softwarization, frequency spectrum, multi-access techniques, artificial intelligence, and big data. In addition, we discuss vertical domain applications (e.g., smart cities, smart vehicles, smart factories, and smart grids) supported by aerial computing. Finally, we highlight several challenges that need to be addressed and their possible solutions.

preprint2022arXiv

Character varieties and algebraic surfaces for the topology of quantum computing

It is shown that the representation theory of some finitely presented groups thanks to their $SL_2(\mathbb{C})$ character variety is related to algebraic surfaces. We make use of the Enriques-Kodaira classification of algebraic surfaces and the related topological tools to make such surfaces explicit. We study the connection of $SL_2(\mathbb{C})$ character varieties to topological quantum computing (TQC) as an alternative to the concept of anyons. The Hopf link $H$, whose character variety is a Del Pezzo surface $f_H$ (the trace of the commutator), is the kernel of our view of TQC. Qutrit and two-qubit magic state computing, derived from the trefoil knot in our previous work, may be seen as TQC from the Hopf link. The character variety of some two-generator Bianchi groups as well as that of the fundamental group for the singular fibers $\tilde{E}_6$ and $\tilde{D}_4$ contain $f_H$. A surface birationally equivalent to a $K_3$ surface is another compound of their character varieties.

preprint2022arXiv

Exploiting Anyonic Behavior of Quasicrystals for Topological Quantum Computing

We show that quasicrystals exhibit anyonic behavior that can be used for topological quantum computing. In particular, we study a correspondence between the fusion Hilbert spaces of the simplest non-abelian anyon, the Fibonacci anyons, and the tiling spaces of a class of quasicrystals, which includes the one dimensional Fibonacci chain and the two dimensional Penrose tiling. A possible encoding on tiling spaces of topological quantum information processing is also discussed.

preprint2022arXiv

FragmGAN: Generative Adversarial Nets for Fragmentary Data Imputation and Prediction

Modern scientific research and applications very often encounter "fragmentary data" which brings big challenges to imputation and prediction. By leveraging the structure of response patterns, we propose a unified and flexible framework based on Generative Adversarial Nets (GAN) to deal with fragmentary data imputation and label prediction at the same time. Unlike most of the other generative model based imputation methods that either have no theoretical guarantee or only consider Missing Completed At Random (MCAR), the proposed FragmGAN has theoretical guarantees for imputation with data Missing At Random (MAR) while no hint mechanism is needed. FragmGAN trains a predictor with the generator and discriminator simultaneously. This linkage mechanism shows significant advantages for predictive performances in extensive experiments.

preprint2022arXiv

How Does Knowledge Graph Embedding Extrapolate to Unseen Data: A Semantic Evidence View

Knowledge Graph Embedding (KGE) aims to learn representations for entities and relations. Most KGE models have gained great success, especially on extrapolation scenarios. Specifically, given an unseen triple (h, r, t), a trained model can still correctly predict t from (h, r, ?), or h from (?, r, t), such extrapolation ability is impressive. However, most existing KGE works focus on the design of delicate triple modeling function, which mainly tells us how to measure the plausibility of observed triples, but offers limited explanation of why the methods can extrapolate to unseen data, and what are the important factors to help KGE extrapolate. Therefore in this work, we attempt to study the KGE extrapolation of two problems: 1. How does KGE extrapolate to unseen data? 2. How to design the KGE model with better extrapolation ability? For the problem 1, we first discuss the impact factors for extrapolation and from relation, entity and triple level respectively, propose three Semantic Evidences (SEs), which can be observed from train set and provide important semantic information for extrapolation. Then we verify the effectiveness of SEs through extensive experiments on several typical KGE methods. For the problem 2, to make better use of the three levels of SE, we propose a novel GNN-based KGE model, called Semantic Evidence aware Graph Neural Network (SE-GNN). In SE-GNN, each level of SE is modeled explicitly by the corresponding neighbor pattern, and merged sufficiently by the multi-layer aggregation, which contributes to obtaining more extrapolative knowledge representation. Finally, through extensive experiments on FB15k-237 and WN18RR datasets, we show that SE-GNN achieves state-of-the-art performance on Knowledge Graph Completion task and performs a better extrapolation ability. Our code is available at https://github.com/renli1024/SE-GNN.

preprint2022arXiv

Model Averaging for Generalized Linear Models in Fragmentary Data Prediction

Fragmentary data is becoming more and more popular in many areas which brings big challenges to researchers and data analysts. Most existing methods dealing with fragmentary data consider a continuous response while in many applications the response variable is discrete. In this paper we propose a model averaging method for generalized linear models in fragmentary data prediction. The candidate models are fitted based on different combinations of covariate availability and sample size. The optimal weight is selected by minimizing the Kullback-Leibler loss in the com?pleted cases and its asymptotic optimality is established. Empirical evidences from a simulation study and a real data analysis about Alzheimer disease are presented.

preprint2022arXiv

Optimal Model Averaging of Support Vector Machines in Diverging Model Spaces

Support vector machine (SVM) is a powerful classification method that has achieved great success in many fields. Since its performance can be seriously impaired by redundant covariates, model selection techniques are widely used for SVM with high dimensional covariates. As an alternative to model selection, significant progress has been made in the area of model averaging in the past decades. Yet no frequentist model averaging method was considered for SVM. This work aims to fill the gap and to propose a frequentist model averaging procedure for SVM which selects the optimal weight by cross validation. Even when the number of covariates diverges at an exponential rate of the sample size, we show asymptotic optimality of the proposed method in the sense that the ratio of its hinge loss to the lowest possible loss converges to one. We also derive the convergence rate which provides more insights to model averaging. Compared to model selection methods of SVM which require a tedious but critical task of tuning parameter selection, the model averaging method avoids the task and shows promising performances in the empirical studies.

preprint2021arXiv

A Survey on Blockchain for Big Data: Approaches, Opportunities, and Future Directions

Big data has generated strong interest in various scientific and engineering domains over the last few years. Despite many advantages and applications, there are many challenges in big data to be tackled for better quality of service, e.g., big data analytics, big data management, and big data privacy and security. Blockchain with its decentralization and security nature has the great potential to improve big data services and applications. In this article, we provide a comprehensive survey on blockchain for big data, focusing on up-to-date approaches, opportunities, and future directions. First, we present a brief overview of blockchain and big data as well as the motivation behind their integration. Next, we survey various blockchain services for big data, including blockchain for secure big data acquisition, data storage, data analytics, and data privacy preservation. Then, we review the state-of-the-art studies on the use of blockchain for big data applications in different vertical domains such as smart city, smart healthcare, smart transportation, and smart grid. For a better understanding, some representative blockchain-big data projects are also presented and analyzed. Finally, challenges and future directions are discussed to further drive research in this promising area.

preprint2021arXiv

Comparison of explicit and mean-field models of cytoskeletal filaments with crosslinking motors

In cells, cytoskeletal filament networks are responsible for cell movement, growth, and division. Filaments in the cytoskeleton are driven and organized by crosslinking molecular motors. In reconstituted cytoskeletal systems, motor activity is responsible for far-from-equilibrium phenomena such as active stress, self-organized flow, and spontaneous nematic defect generation. How microscopic interactions between motors and filaments lead to larger-scale dynamics remains incompletely understood. To build from motor-filament interactions to predict bulk behavior of cytoskeletal systems, more computationally efficient techniques for modeling motor-filament interactions are needed. Here we derive a coarse-graining hierarchy of explicit and continuum models for crosslinking motors that bind to and walk on filament pairs. We compare the steady-state motor distribution and motor-induced filament motion for the different models and analyze their computational cost. All three models agree well in the limit of fast motor binding kinetics. Evolving a truncated moment expansion of motor density speeds the computation by $10^3$--$10^6$ compared to the explicit or continuous-density simulations, suggesting an approach for more efficient simulation of large networks. These tools facilitate further study of motor-filament networks on micrometer to millimeter length scales.

preprint2020arXiv

A Survey of Multi-Access Edge Computing in 5G and Beyond: Fundamentals, Technology Integration, and State-of-the-Art

Driven by the emergence of new compute-intensive applications and the vision of the Internet of Things (IoT), it is foreseen that the emerging 5G network will face an unprecedented increase in traffic volume and computation demands. However, end users mostly have limited storage capacities and finite processing capabilities, thus how to run compute-intensive applications on resource-constrained users has recently become a natural concern. Mobile edge computing (MEC), a key technology in the emerging fifth generation (5G) network, can optimize mobile resources by hosting compute-intensive applications, process large data before sending to the cloud, provide the cloud computing capabilities within the radio access network (RAN) in close proximity to mobile users, and offer context-aware services with the help of RAN information. Therefore, MEC enables a wide variety of applications, where the real-time response is strictly required, e.g., driverless vehicles, augmented reality, robotics, and immerse media. Indeed, the paradigm shift from 4G to 5G could become a reality with the advent of new technological concepts. The successful realization of MEC in the 5G network is still in its infancy and demands for constant efforts from both academic and industry communities. In this survey, we first provide a holistic overview of MEC technology and its potential use cases and applications. Then, we outline up-to-date researches on the integration of MEC with the new technologies that will be deployed in 5G and beyond. We also summarize testbeds and experimental evaluations, and open source activities, for edge computing. We further summarize lessons learned from state-of-the-art research works as well as discuss challenges and potential future directions for MEC research.

preprint2020arXiv

Collisional spin transfer in an atomic heteronuclear spinor Bose gas

We observe spin transfer within a non-degenerate heteronuclear spinor atomic gas comprised of a small $^7$Li population admixed with a $^{87}$Rb bath, with both elements in their $F=1$ hyperfine spin manifolds and at temperatures of 10's of $μ$K. Prepared in a non-equilibrium initial state, the $^7$Li spin distribution evolves through incoherent spin-changing collisions toward a steady-state distribution. We identify and measure the cross-sections of all three types of spin-dependent heteronuclear collisions, namely the spin-exchange, spin-mixing, and quadrupole-exchange interactions, and find agreement with predictions of heteronuclear $^7$Li-$^{87}$Rb interactions at low energy. Moreover, we observe that the steady state of the $^7$Li spinor gas can be controlled by varying the composition of the $^{87}$Rb spin bath with which it interacts.

preprint2020arXiv

Cross-dimensional relaxation of $^7$Li-$^{87}$Rb atomic gas mixtures in a spherical-quadrupole magnetic trap

We measure the interspecies interaction strength between $^7$Li and $^{87}$Rb atoms through cross-dimensional relaxation of two-element gas mixtures trapped in a spherical quadrupole magnetic trap. We record the relaxation of an initial momentum-space anisotropy in a lithium gas when co-trapped with rubidium atoms, with both species in the $|F=1, m_F = -1\rangle$ hyperfine state. Our measurements are calibrated by observing cross-dimensional relaxation of a $^{87}$Rb-only trapped gas. Through Monte Carlo simulations, we compare the observed relaxation to that expected given the theoretically predicted energy-dependent differential cross section for $^7$Li-$^{87}$Rb collisions. The experimentally observed relaxation occurs significantly faster than predicted theoretically, a deviation that appears incompatible with other experimental data characterising the $^7$Li-$^{87}$Rb molecular potential.

preprint2020arXiv

Energy-Efficient Design of IRS-NOMA Networks

Combining intelligent reflecting surface (IRS) and non-orthogonal multiple access (NOMA) is an effective solution to enhance communication coverage and energy efficiency. In this paper, we focus on an IRS-assisted NOMA network and propose an energy-efficient algorithm to yield a good tradeoff between the sum-rate maximization and total power consumption minimization. We aim to maximize the system energy efficiency by jointly optimizing the transmit beamforming at the BS and the reflecting beamforming at the IRS. Specifically, the transmit beamforming and the phases of the low-cost passive elements on the IRS are alternatively optimized until the convergence. Simulation results demonstrate that the proposed algorithm in IRS-NOMA can yield superior performance compared with the conventional OMA-IRS and NOMA with a random phase IRS.

preprint2020arXiv

Energy-Efficient Resource Allocation for NOMA enabled MEC Networks with Imperfect CSI

The combination of non-orthogonal multiple access (NOMA) and mobile edge computing (MEC) can significantly improve the spectrum efficiency beyond the fifth-generation network. In this paper, we mainly focus on energy-efficient resource allocation for a multi-user, multi-BS NOMA assisted MEC network with imperfect channel state information (CSI), in which each user can upload its tasks to multiple base stations (BSs) for remote executions. To minimize the energy consumption, we consider jointly optimizing the task assignment, power allocation and user association. As the main contribution, with imperfect CSI, the optimal closed-form expressions of task assignment and power allocation are analytically derived for the two-BS case. Specifically, the original formulated problem is nonconvex. We first transform the probabilistic problem into a non-probabilistic one. Subsequently, a bilevel programming method is proposed to derive the optimal solution. In addition, by incorporating the matching algorithm with the optimal task and power allocation, we propose a low complexity algorithm to efficiently optimize user association for the multi-user and multi-BS case. Simulations demonstrate that the proposed algorithm can yield much better performance than the conventional OMA scheme but also the identical results with lower complexity from the exhaustive search with the small number of BSs.

preprint2020arXiv

HIN: Hierarchical Inference Network for Document-Level Relation Extraction

Document-level RE requires reading, inferring and aggregating over multiple sentences. From our point of view, it is necessary for document-level RE to take advantage of multi-granularity inference information: entity level, sentence level and document level. Thus, how to obtain and aggregate the inference information with different granularity is challenging for document-level RE, which has not been considered by previous work. In this paper, we propose a Hierarchical Inference Network (HIN) to make full use of the abundant information from entity level, sentence level and document level. Translation constraint and bilinear transformation are applied to target entity pair in multiple subspaces to get entity-level inference information. Next, we model the inference between entity-level information and sentence representation to achieve sentence-level inference information. Finally, a hierarchical aggregation approach is adopted to obtain the document-level inference information. In this way, our model can effectively aggregate inference information from these three different granularities. Experimental results show that our method achieves state-of-the-art performance on the large-scale DocRED dataset. We also demonstrate that using BERT representations can further substantially boost the performance.

preprint2020arXiv

Intelligent User Clustering and Robust Beamforming Design for UAV-NOMA Downlink

In this work, we consider a downlink NOMA network with multiple single-antenna users and multi-antenna UAVs. In particular, the users are spatially located in several clusters by following the Poisson Cluster Process and each cluster is served by a hovering UAV with NOMA. For practical considerations, we assume that only imperfect CSI of each user is available at the UAVs. Based on this model, the problem of joint user clustering and robust beamforming design is formulated to minimize the sum transmission power, and meanwhile, guarantee the QoS requirements of users. Due to the integer variables of user clustering, coupling effects of beamformers, and infinitely many constraints caused by the imperfect CSI, the formulated problem is challenging to solve. For computational complexity reduction, the original problem is divided into user clustering subproblem and robust beamforming design subproblem. By utilizing the users' position information, we propose a k-means++ based unsupervised clustering algorithm to first deal with the user clustering problem. Then, we focus on the robust beamforming design problem. To attain insights on solving the robust beamforming design problem, we firstly investigate the problem with perfect CSI, and the associated problem is shown can be solved optimally. Secondly, for the problem in the general case with imperfect CSI, an SDR based method is proposed to produce a suboptimal solution efficiently. Moreover, we provide a sufficient condition under which the SDR based approach can guarantee to obtain an optimal rank-one solution, which is theoretically analyzed. Finally, an alternating direction method of multipliers based algorithm is proposed to allow the UAVs to perform robust beamforming design in a decentralized fashion efficiently. Simulation results demonstrate the efficacy of the proposed algorithms and transmission scheme.

preprint2020arXiv

Joint Optimization of Beamforming, Phase-Shifting and Power Allocation in a Multi-cluster IRS-NOMA Network

The combination of non-orthogonal multiple access (NOMA) and intelligent reflecting surface (IRS) is an efficient solution to significantly enhance the energy efficiency of the wireless communication system. In this paper, we focus on a downlink multi-cluster NOMA network, where each cluster is supported by one IRS. We aim to minimize the transmit power by jointly optimizing the beamforming, the power allocation and the phase shift of each IRS. The formulated problem is non-convex and challenging to solve due to the coupled variables, i.e., the beamforming vector, the power allocation coefficient and the phase shift matrix. To address this non-convex problem, we propose an alternating optimization based algorithm. Specifically, we divide the primal problem into the two subproblems for beamforming optimization and phase shifting feasiblity, where the two subproblems are solved iteratively. Moreover, to guarantee the feasibility of the beamforming optimization problem, an iterative algorithm is proposed to search the feasible initial points. To reduce the complexity, we also propose a simplified algorithm based on partial exhaustive search for this system model. Simulation results demonstrate that the proposed alternating algorithm can yield a better performance gain than the partial exhaustive search algorithm, OMA-IRS, and NOMA with random IRS phase shift.

preprint2020arXiv

Optimal Resource Allocation for Delay Minimization in NOMA-MEC Networks

Multi-access edge computing (MEC) can enhance the computing capability of mobile devices, while non-orthogonal multiple access (NOMA) can provide high data rates. Combining these two strategies can effectively benefit the network with spectrum and energy efficiency. In this paper, we investigate the task delay minimization in multi-user NOMA-MEC networks, where multiple users can offload their tasks simultaneously through the same frequency band. We adopt the partial offloading policy, in which each user can partition its computation task into offloading and locally computing parts. We aim to minimize the task delay among users by optimizing their tasks partition ratios and offloading transmit power. The delay minimization problem is first formulated, and it is shown that it is a nonconvex one. By carefully investigating its structure, we transform the original problem into an equivalent quasi-convex. In this way, a bisection search iterative algorithm is proposed in order to achieve the minimum task delay. To reduce the complexity of the proposed algorithm and evaluate its optimality, we further derive closed-form expressions for the optimal task partition ratio and offloading power for the case of two-user NOMA-MEC networks. Simulations demonstrate the convergence and optimality of the proposed algorithm and the effectiveness of the closed-form analysis.

preprint2020arXiv

Riemann-Hilbert method and N-soliton solutions for the mixed Chen-Lee-Liu derivative nonlinear Schrödinger equation

In this paper, we aim to investigate the mixed Chen-Lee-Liu derivative nonlinear Schrödinger(CLL-NLS) equation via the Riemann-Hilbert(RH) method. we construct a RH problem base on the Jost solution of the Lax pair. By solving this RH problem corresponding to the non reflection case, the N-soliton solution of CLL-NLS equation is obtained, which expression is the ratio of $(2N+1)\times(2N+1)$ determinant and $2N\times2N$ determinant.