Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xueping Chen

dblp:31/8226 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
4since 2021 · last 2024
0000-0003-0499-0972ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Automata and formal languages · 50% Combinatorics and discrete mathematics · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics
extremal combinatorics
0.512021
Extremal synchronizing circular automata · Inf. Comput. 2021
Automata and formal languages › finite automata
synchronizing automata
0.512021
Extremal synchronizing circular automata · Inf. Comput. 2021
YearPublicationVenuePosition
2024 MRPSO-Loc: Multi-targets UHF RFID localization system based on MRPSO algorithm
Liangbo Xie, Xueping Chen, Chenhui Xia, Ziyue Zhu, Mu Zhou
Ad Hoc Networks2
2022 A note on orthogonal matching pursuit under restricted isometry property
abstract
Abstract The orthogonal matching pursuit (OMP) algorithm is a classical greedy algorithm widely used in compressed sensing. The number of iterations required for the OMP algorithm to perform exact the recovery of sparse signals is a fundamental problem in signal processing. In this work, by investigating the relationship between the iteration number for OMP and the signal estimation error based on the restricted isometry property, the authors obtained tighter bounds on the number of iterations required to approximately recover a sparse signal with noise and exact support recovering for the noiseless cases of OMP.
Xueping Chen, Jianzhong Liu, Xianwen Ding, Hengzhen Huang
IET Signal Process.1
2022 Dynamic Service Migration and Request Routing for Microservice in Multicell Mobile-Edge Computing
abstract
Mobile-edge computing (MEC) sinks computation and storage capacities to network edge, where it is close to users to support delay-sensitive services. However, due to the dynamic and stochastic properties of MEC networks, the deployed services may be frequently migrated among edge servers to follow the mobility of users, which greatly increases the network operational cost. In this article, considering the service migration cost brought by user mobility, we study the joint optimization problem of service deployment and request routing decisions to maximize the long-term network utility of MEC networks. First, we propose a Lyapunov optimization-based online service migration algorithm to decompose the continuous optimization problem into a number of one-slot online optimization problems. Then, to address the NP-hard issue of one-slot optimization, we use a randomized rounding technique to implement service migration and request routing. Furthermore, through a closed-form theoretical analysis, we prove that the proposed algorithm not only greatly meets the local user requests and enables approximate performance guarantees but also adaptively balances the service migration cost and system performance online. Finally, extensive simulations are conducted, which demonstrate that our algorithm can efficiently utilize the storage and computation resources of edge servers, and maximize the long-term network utility while ensuring the stability of service migration cost.
Xiangyi Chen, Yuanguo Bi, Xueping Chen, Hai Zhao 0002, Nan Cheng 0001, Fuliang Li, Wenlin Cheng
IEEE Internet Things J.3
2021 Extremal synchronizing circular automata
Xueping Chen, Shiyuan Sun 0002
Inf. Comput.2
2012 Assessing Web Article Quality by Harnessing Collective Intelligence
Jingyu Han, Xueping Chen, Ke-Jia Chen 0001, Dawei Jiang
DASFAA (1)2