Yong Sun
Yong Sun has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Wenan Tan
College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China
4 shared publications Li Huang
Nanjing University of Aeronautics and Astronautics, Nanjing, China
3 shared publicationsShaopan Zhang
China Research and Development Academy of Machinery Equipment (China)
3 shared publicationsGuangzhao Lu
China Research and Development Academy of Machinery Equipment (China)
2 shared publicationsJinqing Zhao
China Research and Development Academy of Machinery Equipment (China)
2 shared publicationsJunqing Cao
China Research and Development Academy of Machinery Equipment (China)
2 shared publications
Latest Publications
- 16 June 2023
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12639, 1263902-126
A radar reconnaissance simulation design method
This paper proposes a radar reconnaissance simulation design method, which consists of radar reconnaissance decision-making simulation, the main controller of radar reconnaissance simulation, radar reconnaissance simulation, frequency matching simulation, visibility analysis simulation, and reconnaissance process simulation. Combined with the actual project, good results have been achieved.
- 16 June 2023
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12639, 1263902-126
A radar reconnaissance simulation design method
This paper proposes a radar reconnaissance simulation design method, which consists of radar reconnaissance decision-making simulation, the main controller of radar reconnaissance simulation, radar reconnaissance simulation, frequency matching simulation, visibility analysis simulation, and reconnaissance process simulation. Combined with the actual project, good results have been achieved.
- 11 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 58 (6) , 5089-5104
An Integrated Collaborative Filtering Framework With Location-Aware Graph Embedding in Intelligent Internet of Things Systems
Reliable Internet of Things (IoT) service discovery is a significant task in intelligent service-oriented IoT systems. Collaborative Filtering (CF) turns out to be an effective solution to IoT service discovery. However, the traditional CF framework is facing the following challenges: inefficiency in learning the high-order interactions between users and IoT services and ineffectively making use of geographical location information. Moreover, deploying a CF framework in real-world distributed IoT systems poses another significant challenge in terms of reliability assurance and privacy protection. For bridging this gap, we propose an innovative Integrated Collaborative Filtering framework (ICF) with incorporating the location-aware quality of IoT services into a heterogeneous graph embedding model. Meanwhile, a Geohash-based privacy-preservation mechanism is introduced to encoding the location information into a short string for protecting the sensitive location information. The proposed ICF framework is an integrated architecture combining advanced graph embedding learning and heterogeneous side information. And a joint objective optimization function is designed in the graph embedding learning to qualify automatic IoT service features. In this way, the hidden user-service interaction information and location-aware quality semantic features can be explored in an effective and reliable way. Furthermore, the learned location-aware quality embedding vector is incorporated to discover the reliable services among all IoT services with the mini-batch online clustering-based CF algorithm. The experimental findings illustrate the significant efficacy and reliability of our proposed ICF framework in large scale IoT service discovery scenarios.
- 11 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 58 (6) , 5089-5104
An Integrated Collaborative Filtering Framework With Location-Aware Graph Embedding in Intelligent Internet of Things Systems
Reliable Internet of Things (IoT) service discovery is a significant task in intelligent service-oriented IoT systems. Collaborative Filtering (CF) turns out to be an effective solution to IoT service discovery. However, the traditional CF framework is facing the following challenges: inefficiency in learning the high-order interactions between users and IoT services and ineffectively making use of geographical location information. Moreover, deploying a CF framework in real-world distributed IoT systems poses another significant challenge in terms of reliability assurance and privacy protection. For bridging this gap, we propose an innovative Integrated Collaborative Filtering framework (ICF) with incorporating the location-aware quality of IoT services into a heterogeneous graph embedding model. Meanwhile, a Geohash-based privacy-preservation mechanism is introduced to encoding the location information into a short string for protecting the sensitive location information. The proposed ICF framework is an integrated architecture combining advanced graph embedding learning and heterogeneous side information. And a joint objective optimization function is designed in the graph embedding learning to qualify automatic IoT service features. In this way, the hidden user-service interaction information and location-aware quality semantic features can be explored in an effective and reliable way. Furthermore, the learned location-aware quality embedding vector is incorporated to discover the reliable services among all IoT services with the mini-batch online clustering-based CF algorithm. The experimental findings illustrate the significant efficacy and reliability of our proposed ICF framework in large scale IoT service discovery scenarios.
- 9 October 2022
- Published by SPIE-Intl Soc Optical Eng
- Vol. 6, 18-116
A design method of typical damage element simulation generator
This paper presents a design method of typical damage element simulation generator, and realizes the software based on this method. This method includes characteristic and structure model sub module, parametric design sub module, power parameter setting sub module, power index analysis sub module and so on. This method can provide damage meta related data for damage effectiveness evaluation and fire plan.
- 9 October 2022
- Published by SPIE-Intl Soc Optical Eng
- Vol. 6, 18-116
A design method of typical damage element simulation generator
This paper presents a design method of typical damage element simulation generator, and realizes the software based on this method. This method includes characteristic and structure model sub module, parametric design sub module, power parameter setting sub module, power index analysis sub module and so on. This method can provide damage meta related data for damage effectiveness evaluation and fire plan.
- Open Access
- 1 October 2022
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 2355 (1) , 012044
Study on a theory and method of detonation control simulation
Detonation control simulation is an important issue in the field of ammunition performance analysis. Extensive research has been carried out at home and abroad, this paper presents a theory and method of detonation control, including detonation control theory and method, initiation point calculation method, guidance error calculation, fuze trigger calculation, coordinate transformation of fuze trigger point start point, recursive calculation of fuze start delay and so on. The accurate starting of fuze and the simulation of ammunition detonation control are realized, combined with practical application, good results have been achieved.
- 1 October 2022
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 2355 (1) , 012044
Open AccessStudy on a theory and method of detonation control simulation
Detonation control simulation is an important issue in the field of ammunition performance analysis. Extensive research has been carried out at home and abroad, this paper presents a theory and method of detonation control, including detonation control theory and method, initiation point calculation method, guidance error calculation, fuze trigger calculation, coordinate transformation of fuze trigger point start point, recursive calculation of fuze start delay and so on. The accurate starting of fuze and the simulation of ammunition detonation control are realized, combined with practical application, good results have been achieved.
- 30 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (2) , 2779-2790
Budgeted Edge Service Selection in Mobile Edge Computing Environment
Mobile edge computing allows end-users to retrieve required services from edge servers with low network latency. However, when massive service instances with the same or interchangeable functionalities are available at the network edge, how to select appropriate service instances for use to minimize the overall latency perceived is a critical problem. This is not trivial due to that: 1) usually multiple service instances are involved to collectively fulfil an end-user's ever-increasing complicated need; 2) the overall cost incurred should not exceed end-user's service recruiting budget. In this article, we formally define the budgeted edge service selection (BESS) problem. Then, we model the BESS problem as a constrained optimization problem and theoretically prove its $\mathcal {NP}$ -hardness. Next, to solve the BESS problem effectively, we propose two approaches named BESS-O and BESS-A, respectively. Specifically, BESS-O is an optimal approach based on nonlinear integer programming. It can find out optimal solutions to BESS problems. Moreover, BESS-A is a greedy approach. It can find out approximate BESS solutions with higher efficiency, which is more useful for dealing with large-scale BESS problems. Finally, we conduct comprehensive experiments to evaluate our approaches against five representative approaches. Experimental results demonstrate that given a specific service usage budget, our approaches proposed in this article can achieve the highest completion ratio and the lowest service delay.
- 30 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (2) , 2779-2790
Budgeted Edge Service Selection in Mobile Edge Computing Environment
Mobile edge computing allows end-users to retrieve required services from edge servers with low network latency. However, when massive service instances with the same or interchangeable functionalities are available at the network edge, how to select appropriate service instances for use to minimize the overall latency perceived is a critical problem. This is not trivial due to that: 1) usually multiple service instances are involved to collectively fulfil an end-user's ever-increasing complicated need; 2) the overall cost incurred should not exceed end-user's service recruiting budget. In this article, we formally define the budgeted edge service selection (BESS) problem. Then, we model the BESS problem as a constrained optimization problem and theoretically prove its $\mathcal {NP}$ -hardness. Next, to solve the BESS problem effectively, we propose two approaches named BESS-O and BESS-A, respectively. Specifically, BESS-O is an optimal approach based on nonlinear integer programming. It can find out optimal solutions to BESS problems. Moreover, BESS-A is a greedy approach. It can find out approximate BESS solutions with higher efficiency, which is more useful for dealing with large-scale BESS problems. Finally, we conduct comprehensive experiments to evaluate our approaches against five representative approaches. Experimental results demonstrate that given a specific service usage budget, our approaches proposed in this article can achieve the highest completion ratio and the lowest service delay.
- 14 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (2) , 1426-1445
Long-Term Matching Optimization With Federated Neural Temporal Difference Learning in Mobility-on-Demand Systems
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.
- 14 September 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (2) , 1426-1445
Long-Term Matching Optimization With Federated Neural Temporal Difference Learning in Mobility-on-Demand Systems
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.
- 17 May 2022
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12259, 99-895
Design and software of a digital model library for JDAM ammunition
As an important ammunition, JDAM ammunition needs to study its trajectory and model characteristics. On the basis of professional theories such as launch dynamics, ballistics, flight stability, vibration theory, multi-body system kinematics, aerodynamics, etc., this paper proposes a design method and system for the JDAM ammunition digital model library. The module library includes the system portal, the ammunition model library, the model calling interface and the knowledge base. The module library are established to complete the construction, calculation and management of the digital models of various types of JDAM ammunition. Combined with the actual project, good results are obtained. JDAM ammunition digital model library can realize the accurate simulation of trajectory, significantly improve the accuracy of trajectory simulation, and then improve the simulation accuracy of aircraft ground fire attack, and provide accurate data for three-dimensional display. For various types of JDAM ammunition, JDAM three-dimensional digital models and related mathematical models with different granularity are constructed to provide support for trajectory solution and model display. In addition, JDAM ammunition digital model library also provides support for relevant simulation and effectiveness evaluation. In the follow-up work, a more accurate ammunition digital model library can be constructed in combination with the actual data.
- 17 May 2022
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12259, 99-895
Design and software of a digital model library for JDAM ammunition
As an important ammunition, JDAM ammunition needs to study its trajectory and model characteristics. On the basis of professional theories such as launch dynamics, ballistics, flight stability, vibration theory, multi-body system kinematics, aerodynamics, etc., this paper proposes a design method and system for the JDAM ammunition digital model library. The module library includes the system portal, the ammunition model library, the model calling interface and the knowledge base. The module library are established to complete the construction, calculation and management of the digital models of various types of JDAM ammunition. Combined with the actual project, good results are obtained. JDAM ammunition digital model library can realize the accurate simulation of trajectory, significantly improve the accuracy of trajectory simulation, and then improve the simulation accuracy of aircraft ground fire attack, and provide accurate data for three-dimensional display. For various types of JDAM ammunition, JDAM three-dimensional digital models and related mathematical models with different granularity are constructed to provide support for trajectory solution and model display. In addition, JDAM ammunition digital model library also provides support for relevant simulation and effectiveness evaluation. In the follow-up work, a more accurate ammunition digital model library can be constructed in combination with the actual data.
- 10 July 2019
- Published by Springer Nature in Information Systems Frontiers
- Vol. 22 (6) , 1447-1465
Combining Spatial Optimization and Multi-Agent Temporal Difference Learning for Task Assignment in Uncertain Crowdsourcing
- 10 July 2019
- Published by Springer Nature in Information Systems Frontiers
- Vol. 22 (6) , 1447-1465
Combining Spatial Optimization and Multi-Agent Temporal Difference Learning for Task Assignment in Uncertain Crowdsourcing
- Open Access
- 4 July 2019
- Published by Springer Nature in Human-centric Computing and Information Sciences
- Vol. 9 (1) , 25
A trust-aware task allocation method using deep q-learning for uncertain mobile crowdsourcing
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.
- 4 July 2019
- Published by Springer Nature in Human-centric Computing and Information Sciences
- Vol. 9 (1) , 25
Open AccessA trust-aware task allocation method using deep q-learning for uncertain mobile crowdsourcing
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.
- 28 June 2018
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 78 (7) , 8711-8722
Collaborative recommendation algorithm based on probabilistic matrix factorization in probabilistic latent semantic analysis
- 28 June 2018
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 78 (7) , 8711-8722
Collaborative recommendation algorithm based on probabilistic matrix factorization in probabilistic latent semantic analysis