Na Xie
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
Na Xie has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Lu Zhao
School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing, China
3 shared publications - Li Huang
Jiangsu Open University, Nanjing, China
2 shared publications - Lida Xu
Department of Mechanical and Electrical Engineering School of Intelligent Manufacturing Xiamen University Xiamen China
2 shared publications - Wenan Tan
College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China
2 shared publications - Yong Sun
China Research and Development Academy of Machinery Equipment (China)
2 shared publications Li Huang
Nanjing University of Aeronautics and Astronautics, Nanjing, China
1 shared publication
Latest Publications
- 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.
- 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.
- 25 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 10 (3) , 1381-1393
Crisis Assessment Oriented Influence Maximization in Social Networks
Influence maximization (IM) aims to find a subset of k nodes that can maximize the final active node set under an information diffusion model. With the development and popularity of social networks, the IM problem plays an essential role in various applications, such as public opinion analysis, viral marketing, and rumor early warning. However, most of the existing IM solutions have not accessed the risk of negative information from nodes in the future. In reality, a company may face economic loss when negative information breaks out of its spokesman. Therefore, a crisis assessment oriented and topic-based IM problem (TIM-CA) is proposed, which is utilized to model the IM problem by considering the crisis assessment (CA) and topics of users. To solve this problem, we propose a maximum influence arborescence model-based algorithm for TIM-CA, namely, MIA-TIM-CA. The proposed algorithm consists of crisis degree calculation, topic relevance calculation, and influence spread evaluation. More importantly, as for crisis degree calculation, it considers self-, topology-, and topic-based crisis degrees for each node. At the influence spread evaluation stage, MIA-TIM-CA proposes two functions to evaluate the node's importance and node influence spread. Extensive experiments on two real-world social networks demonstrate that our MIA-TIM-CA outperforms all comparison algorithms on influence spread, crisis score, and running time.
- 25 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 10 (3) , 1381-1393
Crisis Assessment Oriented Influence Maximization in Social Networks
Influence maximization (IM) aims to find a subset of k nodes that can maximize the final active node set under an information diffusion model. With the development and popularity of social networks, the IM problem plays an essential role in various applications, such as public opinion analysis, viral marketing, and rumor early warning. However, most of the existing IM solutions have not accessed the risk of negative information from nodes in the future. In reality, a company may face economic loss when negative information breaks out of its spokesman. Therefore, a crisis assessment oriented and topic-based IM problem (TIM-CA) is proposed, which is utilized to model the IM problem by considering the crisis assessment (CA) and topics of users. To solve this problem, we propose a maximum influence arborescence model-based algorithm for TIM-CA, namely, MIA-TIM-CA. The proposed algorithm consists of crisis degree calculation, topic relevance calculation, and influence spread evaluation. More importantly, as for crisis degree calculation, it considers self-, topology-, and topic-based crisis degrees for each node. At the influence spread evaluation stage, MIA-TIM-CA proposes two functions to evaluate the node's importance and node influence spread. Extensive experiments on two real-world social networks demonstrate that our MIA-TIM-CA outperforms all comparison algorithms on influence spread, crisis score, and running time.
- 31 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 14 (3) , 3904-3915
Crowd-Based Cooperative Task Allocation via Multicriteria Optimization and Decision-Making
As a new computing paradigm, crowd-based cooperative computing aims at effective management and the coordinated use of crowd resources. In crowd-based cooperative task allocation (CBCTA), it is necessary to ensure the suitability and high-quality collaboration of resources for computer supported cooperative work. Generally, the high matching rate between resource and task requirements can achieve the optimal parameter configuration, whereas high-quality collaboration ensures the quality and success rates of crowd-based cooperative task. This article proposes a methodology to optimize the resource allocation model for solving CBCTA problems in a cost-efficient, requirements adapted fashion. Specifically, the proposed methodology hinges on evolutionary heuristics to find proper resources that optimally balance matching rate and collaborative quality. We also present suitable metrics to quantify the aforementioned targets. Furthermore, the obtained solutions are ranked based on multicriteria decision making to provide a flexible design choice for decision-makers. Different scales of CBCTA problems are conducted to illustrate the value of the proposed methodology. The experimental results show that the proposed methodology is effective and feasible.
- 31 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 14 (3) , 3904-3915
Crowd-Based Cooperative Task Allocation via Multicriteria Optimization and Decision-Making
As a new computing paradigm, crowd-based cooperative computing aims at effective management and the coordinated use of crowd resources. In crowd-based cooperative task allocation (CBCTA), it is necessary to ensure the suitability and high-quality collaboration of resources for computer supported cooperative work. Generally, the high matching rate between resource and task requirements can achieve the optimal parameter configuration, whereas high-quality collaboration ensures the quality and success rates of crowd-based cooperative task. This article proposes a methodology to optimize the resource allocation model for solving CBCTA problems in a cost-efficient, requirements adapted fashion. Specifically, the proposed methodology hinges on evolutionary heuristics to find proper resources that optimally balance matching rate and collaborative quality. We also present suitable metrics to quantify the aforementioned targets. Furthermore, the obtained solutions are ranked based on multicriteria decision making to provide a flexible design choice for decision-makers. Different scales of CBCTA problems are conducted to illustrate the value of the proposed methodology. The experimental results show that the proposed methodology is effective and feasible.