Xuemei Yang

Xuemei Yang

Auto-generated profile, based on publicly available information

Xuemei Yang

School of Computer Science, Beijing University of Posts and Telecommunications, Beijing, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 March 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
XYXuemei Yang
Xuemei Yang
HLHong Luo
Hong Luo
YSYan Sun
Yan Sun
JZJunwei Zou
Junwei Zou
Mohsen GuizaniMohsen Guizani
Mohsen Guizani
Mobile-edge computing (MEC) has been a promising solution for Internet-of-Things (IoT) applications to obtain latency reduction and energy savings. In view of the loosely coupled application, multiple devices can use the same task code and different input parameters to obtain diverse results. This motivates us to study the cooperation between devices for eliminating the repeated data transmission. Leveraging coalitional game theory, we formalize the cooperative offloading process of a reusable task into a coalitional game to maximize the cost savings. In particular, we first propose an efficient coalitional game-based cooperative offloading (CGCO) algorithm for the single-task model, and then expand it into a CGCO-M algorithm for the multiple-task model with jointly applying a two-stage flow shop scheduling approach, which helps to obtain an optimal task schedule. It is proved that our CGCO and CGCO-M can achieve the Nash-stable solution with convergence guarantee, and CGCO can obtain an optimal solution. The simulations show that CGCO is equal to the optimal exhaustive search (ES) method and CGCO-M is close to ES in terms of cost ratios. Cost ratios of CGCO and CGCO-M are significantly down by 41.08% and 83.70% compared to local executions, respectively. Meanwhile, CGCO-M obtains 41.46% and 89.74% reductions when reuse factors are 0.1 and 1, which means CGCO-M can save more cost with higher reuse density.

6 July 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
XYXuemei Yang
Xuemei Yang
HLHong Luo
Hong Luo
YSYan Sun
Yan Sun
Mohsen GuizaniMohsen Guizani
Mohsen Guizani
Applications consisting of a group of modular tasks can be offloaded to the multiaccess edge computing (MEC) for lower delay and energy consumption. In a dynamic MEC system, the fine-grained cooperative and dynamic offloading solution is necessary for the scenario of reusing tasks among devices. Considering the transmission cooperation, shared wireless bandwidth, and changing task queues on devices and edge servers, we formulate a joint offloading optimization problem to minimize the long-term average task execution cost. Although deep reinforcement learning (DRL) is a popular method for the dynamic problem, existing DRL algorithms are not suitable for our problem because of the hybrid discrete-continuous action spaces and constraints among action dimensions. Therefore, we propose a hybrid average reward proximal policy optimization (hybrid-ARPPO) algorithm to jointly optimize the offloading decisions, cooperative transmission ratios, and edge server assignments. First, we decompose our offloading problem into two subproblems. One is a tractable linear programming problem for continuous transmission ratios, and the other is a Markov decision process (MDP) only with discrete actions for offloading decisions and server assignments. Second, we take the expected average reward as the performance measure and deprecate the discount factor, which can reduce the work of tuning algorithms. Third, we design an action mask layer in the policy network of hybrid-ARPPO to filter invalid actions. Extensive experiments show the effectiveness of our hybrid-ARPPO in different system scales and task arrival patterns.

3 February 2025 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
XYXuemei Yang
Xuemei Yang
HLHong Luo
Hong Luo
YSYan Sun
Yan Sun

1 March 2022
Verified
Conference Paper
Closed access
RTRuimeng Tian
Ruimeng Tian
XYXuemei Yang
Xuemei Yang
WDWanqi Dong
Wanqi Dong
HLHong Luo
Hong Luo
When performing emotion recognition on long audio such as speeches, cutting the entire audio into segments that contain only one emotion is the first step. However, current research usually needs a small window to continuously slide along the audio track, spending a lot of time on repetitive modeling. We propose a two-stage fast speech emotion conversion point detection algorithm. In the first stage, we use the speech energy image to obtain the potential conversion point set for reducing the samples needed to be modeled. In the second stage, we perform at most two rounds of search near each potential point by using a sliding dual window based on Kullback-Leibler(KL) divergence distance measurement, which accurately locates the emotion conversion point. Experiment results indicate that our algorithm significantly reduces the search time and improves the detection accuracy compared with the traditional global search algorithm.