Yong Sun

Yong Sun


Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
26 June 2013 in IEEE Systems Journal
Verified
Journal Article
Closed access
WTWenAn Tan
WenAn Tan
YSYong Sun
Yong Sun
LLLing Xia Li
Ling Xia Li
GLGuangZhen Lu
GuangZhen Lu
TWTong Wang
Tong Wang
Cloud services have been utilized in large-scale distributed environments. As an effective service aggregation methodology, workflow technology has been used to construct composite services. Efficient and dependable workflow scheduling (WFS) is crucial for integrating enterprise systems. While WFS has been widely studied, WFS-related algorithms are mainly focused on optimizing execution time or cost. However, in cloud computing environment, WFS is up against the threats of the inherent uncertainty and unreliability to the applications. Therefore, trust service-oriented strategies must be considered in WFS. As a result, this paper proposes a trust service-oriented workflow scheduling algorithm. The scheduling algorithm adopts a trust metric that combines direct trust and recommendation trust. In addition, we provide balance policies to enable users to balance different requirements, including time, cost, and trust. A case study was conducted to illustrate the value of the proposed algorithm. The experimental results show that the proposed approach is effective and feasible.

28 June 2018 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
LHLi Huang
Li Huang
WTWenan Tan
Wenan Tan
YSYong Sun
Yong Sun

27 February 2015 in Information Systems Frontiers
Verified
Journal Article
Closed access
PDF file
YSYong Sun
Yong Sun
WTWenan Tan
Wenan Tan
LLLingxia Li
Lingxia Li
Weiming ShenWeiming Shen
Weiming Shen
Zhuming BiZhuming Bi
Zhuming Bi
XHXiaoming Hu
Xiaoming Hu

4 July 2019 in Human-centric Computing and Information Sciences
Verified
Journal Article
Open access
PDF file
YSYong Sun
Yong Sun
WTWenan Tan
Wenan Tan
Mobile crowdsourcing has emerged as a promising collaboration paradigm in which each spatial task requires a set of mobile workers in near vicinity to the target location. Considering the desired privacy of the participating mobile devices, trust is considered to be an important factor to enable effective collaboration in mobile crowdsourcing. The main impediment to the success of mobile crowdsourcing is the allocation of trustworthy mobile workers to nearby spatial tasks for collaboration. This process becomes substantially more challenging for large-scale online spatial task allocations in uncertain mobile crowdsourcing systems. The uncertainty can mislead the task allocation, resulting in performance degradation. Moreover, the large-scale nature of real-world crowdsourcing poses a considerable challenge to spatial task allocation in uncertain environments. To address the aforementioned challenges, first, an optimization problem of mobile crowdsourcing task allocation is formulated to maximize the trustworthiness of workers and minimize movement distance costs. Second, for the uncertain crowdsourcing scenario, a Markov decision process-based mobile crowdsourcing model (MCMDP) is formulated to illustrate the dynamic trust-aware task allocation problem. Third, to solve large-scale MCMDP problems in a stable manner, this study proposes an improved deep Q-learning-based trust-aware task allocation (ImprovedDQL-TTA) algorithm that combines trust-aware task allocation and deep Q-learning as an improvement over the uncertain mobile crowdsourcing systems. Finally, experimental results illustrate that the ImprovedDQL-TTA algorithm can stably converge in a number of training iterations. Compared with the reference algorithm, our proposed algorithm achieves effective solutions on the experimental data sets.

14 September 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YSYong Sun
Yong Sun
YLYi Long
Yi Long
Lida XuLida Xu
Lida Xu
WTWenan Tan
Wenan Tan
LHLi Huang
Li Huang
WLWenzhen Liu
Wenzhen Liu
Efficient bipartite graph matching of orders and drivers is a central operational problem in industrial mobility-on-demand (MOD) systems. Traditional studies adopt pure combinatorial optimization models for order-and-driver matching, which do not consider the long-term rewards of the dynamic MOD decision making process. Toward long-term optimization, this article presents a systemic paradigm of online matching with federated neural temporal difference learning (FedTDLearning), which encompasses learning and matching phases. During the learning phase, the long-term matching process is modeled as a Markov decision process, which is typically solved by employing data-driven reinforcement learning in an offline central training scheme. Massive amounts of data would be generated on the network by industrial MOD systems. It is impossible to send all the large-scale industrial data to the cloud server for centralized model training due to network bandwidth limitations and safety concerns. Therefore, a generic and innovative FedTDLearning is proposed to achieve long-term matching in a distributed manner. During the matching phase, a real-time bipartite matching optimization problem is formulated to maximize the learned spatiotemporal value and minimize the pickup distance, which is reducible to the minimum-cost maximum weight bipartite graph matching problem. A distance-learned-value ratio algorithm is proposed to find an optimal matching in the bipartite graph based on the joint optimization of FedTDLearning and the combinatorial fractional programming approach. Furthermore, to pursue optimal computation efficiency, we solve the real-time matching problem by constructing a $k$ -nearest neighbor $(k$ NN) bipartite graph where each order is connected with $k$ NN drivers. Using openly available real-world data, the prototype system and experimental evaluations show that our proposed algorithms have effective problem-solving capability in practice.

1 May 2009
Verified
Conference Paper
Closed access
ZYZhan Ying
Zhan Ying
YSYong Sun
Yong Sun
The paper concentrates on analyzing and discussing data pooling structure, online data pooling partition storage model, structure model of enterprise cloud storage system, proposes the design plans of data control and cloud storage. Storage management control optimized is an effective method that will reduce the working time to large-scale data storage management. Combining Storage devices and control management software will provide system data sharing and system high applicability. With cloud storage management control mechanism being applied, those business enterprises could benefit from this.