Xiaomei Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Xiaomei Zhang has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Guohong Cao
The Pennsylvania State University
2 shared publications - Albert Y. Zomaya
The University of Sydney
1 shared publication Guohong Cao
Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA, USA
1 shared publication- Haibo Li1 shared publication
Hao Hu
1 shared publication- Hao-Fan Wang
Guangdong Provincial Key Laboratory of Fuel Cell Technology School of Chemistry and Chemical Engineering South China University of Technology Guangzhou China
1 shared publication
Latest Publications
- 26 March 2024
- Published by Elsevier in Pervasive and Mobile Computing
- Vol. 100
Feasibility and reliability of peercloud in vehicular networks: A comprehensive study
- 26 March 2024
- Published by Elsevier in Pervasive and Mobile Computing
- Vol. 100
Feasibility and reliability of peercloud in vehicular networks: A comprehensive study
- Open Access
- 25 October 2023
- Published by Sissa Medialab Srl
- Vol. 434, 027
Distributed Data Management System at IHEP
A distributed grid data management system has been established at the Institute of High Energy Physics (IHEP) since 2014, leveraging the DIRAC data management system. This system has been effectively utilized by the BESIII, JUNO, and CEPC experiments. To address the diverse data scales and intricate data management requirements associated with data production, IHEP developers have embarked on endeavors to create a more adaptable and experiment-oriented grid data management system based on Rucio, owing to its proven reliability, scalability, and automation capabilities. As a result, a production system for Monte Carlo (MC) data production has been implemented, relying on the DIRAC Data Management System (DMS) solution. Furthermore, work is underway to develop Rucio data transfer daemon plugins to facilitate non-grid data transfer for upcoming experiments at IHEP. Supporting infrastructure for distributed data management has also been established, encompassing StoRM and EOS storage elements, an IAM authentication service, as well as a third-party-copy active probing system.
- 25 October 2023
- Published by Sissa Medialab Srl
- Vol. 434, 027
Open AccessDistributed Data Management System at IHEP
A distributed grid data management system has been established at the Institute of High Energy Physics (IHEP) since 2014, leveraging the DIRAC data management system. This system has been effectively utilized by the BESIII, JUNO, and CEPC experiments. To address the diverse data scales and intricate data management requirements associated with data production, IHEP developers have embarked on endeavors to create a more adaptable and experiment-oriented grid data management system based on Rucio, owing to its proven reliability, scalability, and automation capabilities. As a result, a production system for Monte Carlo (MC) data production has been implemented, relying on the DIRAC Data Management System (DMS) solution. Furthermore, work is underway to develop Rucio data transfer daemon plugins to facilitate non-grid data transfer for upcoming experiments at IHEP. Supporting infrastructure for distributed data management has also been established, encompassing StoRM and EOS storage elements, an IAM authentication service, as well as a third-party-copy active probing system.
- Open Access
- 1 February 2023
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 2438 (1) , 012048
The JSUB task submission and management software
In near future, new high energy physics experiments with challenging data volume are coming into operations or are planned in IHEP, China. A DIRAC-based distributed computing system is being enabled to process the huge amount of data to be obtained in these experiments. To encourage better utilization of computing resources, it’s essential to give users handy tools that saves them from troubles of mastering various technical details of distributed computing and let them have comfortable control over their tasks. In this conference, we present the design and development of a extensible task submission and management system called JSUB, which provides users from different experiments with consistent solutions of managing massive jobs. JSUB covers functionalities including user interface, task creation and submission, run-time workflow control, task monitoring and management. Major features of this software include friendliness with extensions into different user scenarios, flexible task setting, and parametric job submission. Currently, the JSUB software has been developed and put into use for JUNO and CEPC experiments. The software is also highly extensible to other HEP experiments. The designs and techniques could be interesting to other experiments which also use DIRAC as workload management system. The software has only been previously reported inside JUNO collaboration, and this is the first time to be presented to a wider audience.
- 1 February 2023
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 2438 (1) , 012048
Open AccessThe JSUB task submission and management software
In near future, new high energy physics experiments with challenging data volume are coming into operations or are planned in IHEP, China. A DIRAC-based distributed computing system is being enabled to process the huge amount of data to be obtained in these experiments. To encourage better utilization of computing resources, it’s essential to give users handy tools that saves them from troubles of mastering various technical details of distributed computing and let them have comfortable control over their tasks. In this conference, we present the design and development of a extensible task submission and management system called JSUB, which provides users from different experiments with consistent solutions of managing massive jobs. JSUB covers functionalities including user interface, task creation and submission, run-time workflow control, task monitoring and management. Major features of this software include friendliness with extensions into different user scenarios, flexible task setting, and parametric job submission. Currently, the JSUB software has been developed and put into use for JUNO and CEPC experiments. The software is also highly extensible to other HEP experiments. The designs and techniques could be interesting to other experiments which also use DIRAC as workload management system. The software has only been previously reported inside JUNO collaboration, and this is the first time to be presented to a wider audience.
- 1 February 2021
- Published by Elsevier in Computer Communications
- Vol. 168, 1-11
Enhancing mobile cloud with social-aware device-to-device offloading
- 1 February 2021
- Published by Elsevier in Computer Communications
- Vol. 168, 1-11
Enhancing mobile cloud with social-aware device-to-device offloading
- 1 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 387-391
Real-time virtual UR5 robot imitation of human motion based on 3D camera
Human robot interaction is playing significant roles in many industries, in which humans are allowed to corporate with robots or control robots to complete some tasks. Achieving realtime control of robots by demonstrating human arm motion is one of the effective methods to improve the quality of human robot interaction. In this paper, a new method to accomplish human skeleton key points extraction is proposed and a system for controlling a virtual UR5 robot (which is modeling in Unity 3D) is developed to imitate human motions. A sequential architecture composed of convolutional networks is used to identify the 2D coordinates; the depth information from Kinect v2 sensor is used to obtain the actual 3D coordinates and the result of the proposed method is used for joint angles calculation. The appropriate mapping relationships between human arm and UR5 robots are built by transforming the arm angel to UR5's degrees of freedom. The performance of this method is measured by the degree of real-time simulation of human hand trajectory. Further, the comparison between the method in this paper and other method is implemented. The experimental results indicate that the developed system and proposed method are reliable and efficient to accomplish human motion imitation.
- 1 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 387-391
Real-time virtual UR5 robot imitation of human motion based on 3D camera
Human robot interaction is playing significant roles in many industries, in which humans are allowed to corporate with robots or control robots to complete some tasks. Achieving realtime control of robots by demonstrating human arm motion is one of the effective methods to improve the quality of human robot interaction. In this paper, a new method to accomplish human skeleton key points extraction is proposed and a system for controlling a virtual UR5 robot (which is modeling in Unity 3D) is developed to imitate human motions. A sequential architecture composed of convolutional networks is used to identify the 2D coordinates; the depth information from Kinect v2 sensor is used to obtain the actual 3D coordinates and the result of the proposed method is used for joint angles calculation. The appropriate mapping relationships between human arm and UR5 robots are built by transforming the arm angel to UR5's degrees of freedom. The performance of this method is measured by the degree of real-time simulation of human hand trajectory. Further, the comparison between the method in this paper and other method is implemented. The experimental results indicate that the developed system and proposed method are reliable and efficient to accomplish human motion imitation.
- 25 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 20 (3) , 1001-1016
Expertise-Aware Truth Analysis and Task Allocation in Mobile Crowdsourcing
In mobile crowdsourcing, the accuracy of the collected data is usually hard to ensure. Researchers have proposed techniques to identify truth from noisy data by inferring and utilizing the reliability of mobile users, and allocate tasks to users with higher reliability. However, they neglect the fact that a user may only have expertise on some problems (in some domains), but not others, and hence causing two problems: low estimation accuracy in truth analysis and ineffective task allocation. To address these problems, we propose Expertise-aware Truth Analysis and Task Allocation (ETA2), which can effectively infer user expertise, and then estimate truth and allocate tasks based on the inferred expertise. ETA2 relies on a novel semantic analysis method to identify the expertise, and an expertise-aware truth analysis method to find the truth. For expertise-aware task allocation in ETA2, we formalize and solve two problems based on the optimization objectives: max-quality task allocation which maximizes the probability for tasks to be allocated to users with high expertise and min-cost task allocation which minimizes the cost of task allocation while ensuring high-quality data are collected. Experimental results based on two real-world datasets and one synthetic dataset demonstrate that ETA2 significantly outperforms existing solutions.
- 25 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 20 (3) , 1001-1016
Expertise-Aware Truth Analysis and Task Allocation in Mobile Crowdsourcing
In mobile crowdsourcing, the accuracy of the collected data is usually hard to ensure. Researchers have proposed techniques to identify truth from noisy data by inferring and utilizing the reliability of mobile users, and allocate tasks to users with higher reliability. However, they neglect the fact that a user may only have expertise on some problems (in some domains), but not others, and hence causing two problems: low estimation accuracy in truth analysis and ineffective task allocation. To address these problems, we propose Expertise-aware Truth Analysis and Task Allocation (ETA2), which can effectively infer user expertise, and then estimate truth and allocate tasks based on the inferred expertise. ETA2 relies on a novel semantic analysis method to identify the expertise, and an expertise-aware truth analysis method to find the truth. For expertise-aware task allocation in ETA2, we formalize and solve two problems based on the optimization objectives: max-quality task allocation which maximizes the probability for tasks to be allocated to users with high expertise and min-cost task allocation which minimizes the cost of task allocation while ensuring high-quality data are collected. Experimental results based on two real-world datasets and one synthetic dataset demonstrate that ETA2 significantly outperforms existing solutions.
- 1 June 2019
- Published by Elsevier in Future Generation Computer Systems
- Vol. 95, 601-614
GoSharing: An intelligent incentive framework based on users’ association for cooperative content sharing in mobile edge networks
- 1 June 2019
- Published by Elsevier in Future Generation Computer Systems
- Vol. 95, 601-614
GoSharing: An intelligent incentive framework based on users’ association for cooperative content sharing in mobile edge networks
- 21 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 68 (2) , 1903-1915
Proactively Placing Static Relays With Social-Link Awareness in Mobile Social Networks
Mobile social networks have been exploited for data forwarding due to its low cost and better robustness. Existing data forwarding strategies in mobile social networks rely on the pairwise contacts among mobile users. However, these pairwise contacts only provide limited forwarding capabilities and most data fail to be delivered before the expiration time. In this paper, we improve the performance of data forwarding by proactively placing low-cost static relays to increase the opportunistic contacts among the mobile nodes. Based on this idea, an important question is where to place the static relays in the network to best facilitate data forwarding among nodes. To answer this question, we first analyze four real-world datasets of mobile social networks, and identify that data forwarding only appears in a small group of social links. Then, we formalize the problem of static relay placement as an optimization problem, and propose a heuristic based solution to improve the data forwarding performance along these social links. Considering the fact that the social links may evolve over time, we also propose an efficient relay replacement algorithm which replaces the outdated relays with new relays to further improve the data forwarding performance. Evaluation results show that the proposed relay based solutions can significantly improve the performance of data forwarding in mobile social networks.
- 21 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 68 (2) , 1903-1915
Proactively Placing Static Relays With Social-Link Awareness in Mobile Social Networks
Mobile social networks have been exploited for data forwarding due to its low cost and better robustness. Existing data forwarding strategies in mobile social networks rely on the pairwise contacts among mobile users. However, these pairwise contacts only provide limited forwarding capabilities and most data fail to be delivered before the expiration time. In this paper, we improve the performance of data forwarding by proactively placing low-cost static relays to increase the opportunistic contacts among the mobile nodes. Based on this idea, an important question is where to place the static relays in the network to best facilitate data forwarding among nodes. To answer this question, we first analyze four real-world datasets of mobile social networks, and identify that data forwarding only appears in a small group of social links. Then, we formalize the problem of static relay placement as an optimization problem, and propose a heuristic based solution to improve the data forwarding performance along these social links. Considering the fact that the social links may evolve over time, we also propose an efficient relay replacement algorithm which replaces the outdated relays with new relays to further improve the data forwarding performance. Evaluation results show that the proposed relay based solutions can significantly improve the performance of data forwarding in mobile social networks.
- 7 June 2018
- Published by Springer Nature
- p. 2013-2019
Research on Non-contact Angle Measurement Based on AMR Effect
- 7 June 2018
- Published by Springer Nature
- p. 2013-2019
Research on Non-contact Angle Measurement Based on AMR Effect
- Open Access
- 9 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 25 (5) , 2829-2843
Transient Community Detection and Its Application to Data Forwarding in Delay Tolerant Networks
Community detection has received considerable attention because of its applications to many practical problems in mobile networks. However, when considering temporal information associated with a community (i.e., transient community), most existing community detection methods fail due to their aggregation of contact information into a single weighted or unweighted network. In this paper, we propose a contact-burst-based clustering method to detect transient communities by exploiting pairwise contact processes. In this method, we formulate each pairwise contact process as a regular appearance of contact bursts, during which most contacts between the pair of nodes happen. Based on this formulation, we detect transient communities by clustering the pairs of nodes with similar contact bursts. Since it is difficult to collect global contact information at individual nodes, we further propose a distributed method to detect transient communities. In addition to transient community detection, we also propose a new data forwarding strategy for delay tolerant networks, in which transient communities serve as the data forwarding unit. Evaluation results show that our strategy can achieve a much higher data delivery ratio than traditional community-based strategies with comparable network overhead.
- 9 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 25 (5) , 2829-2843
Open AccessTransient Community Detection and Its Application to Data Forwarding in Delay Tolerant Networks
Community detection has received considerable attention because of its applications to many practical problems in mobile networks. However, when considering temporal information associated with a community (i.e., transient community), most existing community detection methods fail due to their aggregation of contact information into a single weighted or unweighted network. In this paper, we propose a contact-burst-based clustering method to detect transient communities by exploiting pairwise contact processes. In this method, we formulate each pairwise contact process as a regular appearance of contact bursts, during which most contacts between the pair of nodes happen. Based on this formulation, we detect transient communities by clustering the pairs of nodes with similar contact bursts. Since it is difficult to collect global contact information at individual nodes, we further propose a distributed method to detect transient communities. In addition to transient community detection, we also propose a new data forwarding strategy for delay tolerant networks, in which transient communities serve as the data forwarding unit. Evaluation results show that our strategy can achieve a much higher data delivery ratio than traditional community-based strategies with comparable network overhead.