VLDB 2026 Research / reviewers in the wild / expert
Jian Wang 0039
dblp:39/449-39
· DBLP profile ↗
35ranked-venue papers
20as first author
29since 2021 · last 2026
0000-0003-2909-5456ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 21 · 13 first-author · 18 since 2021Artificial intelligence and machine learning · 5 · 2 first-author · 5 since 2021Security and privacy · 4 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | SHAPE: An APT detection framework fusing semantic understanding and heterogeneous modeling
Xiaodan Huang, Guosheng Zhao, Jian Wang 0039, Kaiwen Lou, Zixuan Wan |
Comput. Secur. | 3 |
| 2026 | Collaborative defense model for crowdsensing networks based on incomplete Information differential gamesabstractAbstract Crowdsensing networks face complex security threats due to their open architecture and distributed collaboration model. However, existing defense methods neglect the heterogeneity of sensing nodes and information asymmetry between attackers and defenders, resulting in traditional static defense strategies that struggle to adapt to dynamic adversarial environments. To address this challenge, this paper proposes a dynamic collaborative defense model driven by incomplete information differential games. Firstly, a dynamic differential equation system with random perturbation factors is established to characterize the security state evolution process of sensing nodes. Subsequently, an incomplete information differential game model is constructed to analyze attack and defense behaviors, with a Bayesian strategy inference method designed to infer potential strategy preferences of attackers through real-time attack-defense interaction results and node states. This approach overcomes the limitations of static belief updates in traditional incomplete information games. Finally, a defense decision-making algorithm is designed based on optimal control theory. Simulation results demonstrate that the proposed model accurately characterizes strategic interactions between attackers and defenders while providing real-time defensive strategies based on the inference method, improving defense success rates by 24.2%. Additionally, the model exhibits strong adaptability in dynamic network environments, enhancing network availability by 22.3%. Kaiwen Lou, Guosheng Zhao, Jian Wang 0039, Xiaodan Huang, Zixuan Wan |
Cybersecur. | 3 |
| 2026 | Adversarial sample generation via dual-channel Ghost U-shaped network
Guosheng Zhao, Jian Wang 0039, Mengchen Wang, Yinglong Pi |
Eng. Appl. Artif. Intell. | 3 |
| 2026 | Adapting to the environment: An energy-;efficient dual-synapse spiking model for mobile micro-learning environmental forecasting
Delei Zhao, Jian Wang 0039, Guosheng Zhao |
Neurocomputing | 2 |
| 2026 | Speciation relations-inspired adaptive node aggregation and data reasoning in Sparse Mobile Crowdsensing
Jia Liu 0085, Jian Wang 0039, Guosheng Zhao, Guanzhi He |
Knowl. Based Syst. | 2 |
| 2025 | A Dual-Path Multiple Instance Learning Network Guided by Image Quality Assessment for Cervical Whole Slide Image ClassificationabstractThe existing cervical whole slide image classification methods ignore the influence of image quality, resulting in low classification accuracy. To address this, we propose a dual-path multiple instance learning classification method guided by image quality assessment. Specifically, a pre-trained quality assessment model assigns quality scores to patches, splitting them into high- and low-quality paths. In the high-quality path, patch features are weighted by their quality scores to emphasize reliable diagnostic regions. In the low-quality path, a key instance is selected using clustering and feature distance matching. Finally, a cross-attention module fuses features across quality levels. Our method achieves 94.64% accuracy and 91.74% AUC on a dataset of 2,434 WSIs collected from five medical centers, outperforming state-of-the-art methods. Lanlan Kang, Jian Wang 0039, Yongjun He 0002, Bo Ding 0003 |
IEEE Signal Process. Lett. | 2 |
| 2025 | Incremental Survivability Enhancement in Mobile Crowdsensing SystemsabstractMobile crowdsensing (MCS) is a sensing paradigm that leverages the collaboration of mobile devices to collect and process data, and it has been widely applied in domains such as transportation, environmental monitoring, and public safety. However, its open nature and reliance on cooperative networks render it vulnerable to threats such as malicious nodes, link attacks, and data tampering. Given that MCS systems heavily depend on user participation and a stable network topology, these threats are not only difficult to fully mitigate but may also lead to service interruptions, degradation in data quality, or even system-wide failures—particularly in resource-constrained or unstable network environments. To address these challenges, a method to enhance the survivability of MCS systems is proposed. Firstly, to capture the complex interaction patterns among sensing devices in an MCS system, a neighbor interaction encoding scheme is proposed. This scheme learns the temporal node sensing representation of the dynamic graph by considering not only the information of nodes, edges, and time intervals but also the interactions between neighboring devices. Then, by integrating node-specific attribute information with betweenness centrality, the goal is to predict the importance of nodes in the dynamic graph and classify their roles accordingly. Finally, hierarchical threat response strategies are devised for nodes of varying importance, with adaptive topology reconstruction then performed based on predictions of future links between devices. Simulation experiments were conducted on eight real-world datasets, where the average AP and AUC-ROC under three sampling strategies were 88.84 and 87.86, respectively. These results represent average improvements of 6.24% and 4.35% compared to the baseline methods. Additionally, the effectiveness of the proposed method was validated through a mitigation effect evaluation experiment. Jian Wang 0039, Delei Zhao, Guosheng Zhao |
IEEE Trans. Netw. Serv. Manag. | 1 |
| 2024 | Tag-based self-learning task recommendation for mobile crowdsensing via collaborative multi-expert system
Jian Wang 0039, Guosheng Zhao |
Comput. Commun. | 1 |
| 2024 | A method of user recruitment and adaptation degree improvement via community collaboration in sparse mobile crowdsensing systems
Jian Wang 0039, Xiuying Zhan, Yuping Yan, Guosheng Zhao |
Eng. Appl. Artif. Intell. | 1 |
| 2024 | Sparse Region Prediction and Interpretability Analysis for Mobile CrowdsensingabstractExisting task allocation methods do not consider the uneven distribution of sensing users and ignore the sparse sensing region. This leads to the problem of low sensing coverage of the whole sensing task. In this paper, a method of sparse region prediction and interpretability analysis for mobile crowdsensing is proposed. Firstly, the spatio-temporal graph neural network is used to establish a prediction model for the sensing user’s flow distribution. The model considers the spatial dependency and the influence of sensing user flow on the long-term, medium-term, and short-term prediction results. Next, the prediction results are interpreted in terms of both edges and nodes using GNNExplainer. Then, the sensing range is divided into sparse and non-sparse sensing regions based on the prediction results. Finally, the sensing coverage is maximized with reduced movement. Experimental results under different datasets show that our method effectively reduces movement costs and improves sensing coverage compared to other baseline methods. Jian Wang 0039, Yuping Yan, Guosheng Zhao |
IEEE Internet Things J. | 1 |
| 2024 | Conscious Task Recommendation via Cognitive Reasoning Computing in Mobile Crowd SensingabstractMobile Crowd Sensing is a human-based data collection model, and the approach taken to recommend data collection tasks to users in order to maximize task acceptance rates is an important part of this research. Existing task recommendation methods are based only on intuitive data for unconscious analysis and decision-making, and lack the embodiment of cognitive intelligence. To address the above problem, a conscious task recommendation based on cognitive reasoning computing in Mobile Crowd Sensing has been proposed, using knowledge from cognitive science to simulate the human thinking process in order to achieve warm learning and conscious recommendation of sensing tasks. First, the task attributes are segmented into positive and negative attributes using a Kernel Density Estimation method based on bandwidth self-selection. Then, the user's attribute preferences are diagnosed by the Cognitive Diagnostic Method to obtain the user's preference vector. Finally, get the overall preference trend of users based on the Drift Diffusion Model, and make decisions according to whether the current task drift direction is consistent with the user preference trend. Simulation experiments were conducted using the Taobao dataset, MTurk dataset, and synthetic dataset, it was ultimately proven that conscious task recommendation combined with user cognitive ability effectively reduced RMSE and improved task acceptance rate. RMSE was 10.5%∼70.8% lower than other methods, and the task acceptance rate was basically over 80%, with most of the results being over 90%. Jia Liu 0085, Jian Wang 0039, Guosheng Zhao |
ACM Trans. Internet Techn. | 2 |
| 2024 | Malicious Participants and Fake Task Detection Incorporating Gaussian BiasabstractMobile crowdsensing (MCS) is a combination of crowdsourcing ideas and mobile sensing devices, designed to enable rational allocation of resources at scale. However, the MCS platform is highly vulnerable to injection attacks from malicious participants and fake tasks that interfere with platform service capabilities and sensing activities. To this end, the participant and task submission process is modeled as a multivariate time series, and a detection model for malicious participants and fake tasks (MP-FTD) with a Gaussian prior on the attentional mechanism and a two-stage adversarial training process is proposed. The attention mechanism was corrected using Gaussian bias, and then the corrected attention mechanism was used to obtain the correlation discrepancies between the data. Using the adversarial training method of Generative Adversarial Networks (GAN), the output of the correlation discrepancy reconstruction phase is transformed into a focus score, to amplify the reconstruction error in the output of the focus score reconstruction phase, and to improve the differentiation between the injected data and normal data of malicious attackers. The detection of these malicious attackers will effectively improve the robustness of the sensing platform. Experiments on six real-world datasets showed that the average F1-score reached 93.44%, outperforming the current baseline method, and resulting in an average 12.07% improvement in participant assignment accuracy and an average 12.25% improvement in task assignment accuracy in task assignment experiments. Jian Wang 0039, Delei Zhao, Guosheng Zhao |
ACM Trans. Internet Techn. | 1 |
| 2024 | Task Recommendation via Heterogeneous Multi-modal Features and Decision Fusion in Mobile CrowdsensingabstractIn the decision-making process of the behavior of mobile crowdsensing, using a single view to learn a user's preference will lead to a mismatch between the user's wishes and the final task recommendation list, resulting in the low efficiency of the model recommendation. Aiming at the lack of perceptual representation and cognitive fusion of multimodal coupled information, a task recommendation method based on heterogeneous multimodal features and decision fusion is proposed. According to the content characteristics of multi-source data in the user's historical task set, several task-task similarity matrices are constructed to align feature dimensions and feature semantics. Using the improved similarity network fusion algorithm, networks composed of multiple content similarity matrices are effectively fused into a similarity network. Considering the influence of the time factor, the tasks that have had interest drift are filtered out from the set of tasks that the user has participated in. Finally, the updated similarity network is clustered to predict the current preference of the user for new tasks. Experimental results based on simulation and real datasets show that the proposed method can effectively improve the accuracy and efficiency of task assignments while improving user satisfaction. Jian Wang 0039, Xiao Wang 0066, Guosheng Zhao |
ACM Trans. Multim. Comput. Commun. Appl. | 1 |
| 2023 | Credible nodes selection in mobile crowdsensing based on GAN
Jian Wang 0039, Jia Liu 0085, Guosheng Zhao |
Appl. Intell. | 1 |
| 2023 | Trusted user selection for fusion of multimodal cognition in self-organizing pattern of mobile crowdsensing
Jian Wang 0039, Jia Liu 0085, Guosheng Zhao |
Comput. Networks | 1 |
| 2023 | Task Recommendation Method Combining Multimodal Cognition and Collaboration in Mobile Crowdsensing Systems
Jian Wang 0039, Yuping Yan, Guosheng Zhao |
Comput. Networks | 1 |
| 2023 | Task recommendation method for fusion of multi-view social relationship learning and reasoning in the mobile crowd sensing system
Jian Wang 0039, Guosheng Zhao |
Comput. Commun. | 1 |
| 2023 | A crowd cooperative defense model for mitigating DDoS attacks in Mobile Crowdsensing networks
Guosheng Zhao, Ming Gao 0017, Jian Wang 0039 |
Comput. Commun. | 3 |
| 2023 | Three-way decision based participants selection optimization model in sparse mobile crowdsensing
Jian Wang 0039, Guosheng Zhao, Huijie Ge |
Inf. Sci. | 1 |
| 2023 | A task allocation method based on data fusion of multimodal trajectory in mobile crowd sensing
Jia Liu 0085, Jian Wang 0039, Yuping Yan, Guosheng Zhao |
Peer Peer Netw. Appl. | 2 |
| 2023 | CSSA-based collaborative optimization recommendation of users in mobile crowdsensing
Jian Wang 0039, Guosheng Zhao |
Peer Peer Netw. Appl. | 1 |
| 2023 | A lightweight block encryption algorithm for narrowband internet of things
Guosheng Zhao, Jian Wang 0039 |
Peer Peer Netw. Appl. | 3 |
| 2023 | IoT intrusion detection model based on gated recurrent unit and residual network
Guosheng Zhao, Cai Ren, Jian Wang 0039, Yuyan Huang |
Peer Peer Netw. Appl. | 3 |
| 2023 | Task recommendation for mobile crowd sensing system based on multi-view user dynamic behavior prediction
Guosheng Zhao, Xiao Wang 0066, Jian Wang 0039, Jia Liu 0085 |
Peer Peer Netw. Appl. | 3 |
| 2023 | Two-phased Participant Selection Method Based on Partial Transfer Learning in Mobile CrowdsensingabstractTo solve the problem of sensing data redundancy and missing data caused by the uneven distribution of resources in mobile crowd sensing, a two-phased participant selection method based on partial transfer learning is proposed. Firstly, the data is preprocessed. On the one hand, the sensing task features are extracted to analyze the correlation between the source task and the target task feature space. On the other hand, users are divided into active users and passive users according to the historical movement law of sensing users. Secondly, the participant selection in the first stage is carried out. According to the similarity of feature space between the source task and the target task, part of the user resources of the source task are migrated to the target subtask with a similar distribution of its feature space. As a result, the target task can select participants efficiently and accurately. Finally, the participant selection in the second stage is carried out. For the target subtask not covered, the passive users in the subtask area are taken as the assignment object. Simulation results based on real data sets show that this method can effectively improve the task coverage and reduce the perceived excitation cost. Jian Wang 0039, Guosheng Zhao |
ACM Trans. Sens. Networks | 1 |
| 2022 | Dynamic link prediction method of task and user in Mobile Crowd Sensing
Jian Wang 0039, Jia Liu 0085, Guosheng Zhao |
Comput. Commun. | 1 |
| 2022 | Two-attribute privacy protection method of MCS based on blockchain smart contract
Jian Wang 0039, Guosheng Zhao |
Comput. Commun. | 1 |
| 2021 | Diffusion Analysis and Incentive Method for Mobile Crowdsensing User Based on Knowledge Graph ReasoningabstractAiming at the problem that the mobile crowdsensing (MCS) system relies on a specific platform with a large user group presupposed, this paper proposes a sensing user diffusion analysis and incentive method based on knowledge graph reasoning. We consider motivating users to participate under the constraint of limited budget so that the platform and users can get the most benefits. In this paper, we focus on socially aware users represented by self-organizing social networks, combine the knowledge graph to establish a knowledge graph for the crowdsensing system, use rules to derive user influence, and optimize user contributions. With the goal of maximizing social welfare, we propose a social awareness reverse auction (SARA) mechanism, in which the total contribution of users is the key to select winners, and the winners are paid based on critical prices. Through experimental simulations, we verify that SARA is close to the optimal social welfare under budget constraints. Jian Wang 0039, Shanshan Cui, Guosheng Zhao |
Secur. Commun. Networks | 1 |
| 2021 | A task recommendation framework for heterogeneous mobile crowdsensing
Jian Wang 0039, Guosheng Zhao |
J. Supercomput. | 1 |
| 2020 | Dynamic resource virtualisation method for survivability enhancement based on SDNabstractTo enhance system survivability when the original mapping scheme fails caused by the change of underlying infrastructures, a dynamic resource virtualisation method based on software definition network (SDN) is proposed. First of all, modelling and formalisation of dynamic resource remapping under SDN environment are constructed, which make the entity resources controlled in the network. Then, resource constraints and evaluation objectives of mapping are considered, and the remapping procedures of nodes and links are described in the case of failure of physical resources. During the process, the detachment factor is introduced as the index to evaluate whether the virtual nodes and links need to be separated, and further be allocated by the greedy algorithm reasonably and dynamically, to realise the virtual network requests. Finally, the simulation experiments are carried out and show that the proposed method is superior to other related methods in virtual request acceptance rate, resource utilisation and average waiting time of service; as a result, improving survivability under the condition that the underlying physical resources change in real time. Jian Wang 0039, Guosheng Zhao |
IET Inf. Secur. | 1 |
| 2020 | The active learning multi-task allocation method in mobile crowd sensing based on normal cloud model
Jian Wang 0039, Guosheng Zhao |
Pervasive Mob. Comput. | 1 |
| 2020 | A prediction model of cloud security situation based on evolutionary functional network
Baowen Xie, Guosheng Zhao, Mianxing Chao, Jian Wang 0039 |
Peer-to-Peer Netw. Appl. | 4 |
| 2019 | Location protection method for mobile crowd sensing based on local differential privacy preference
Jian Wang 0039, Guosheng Zhao |
Peer-to-Peer Netw. Appl. | 1 |
| 2019 | Analysis of vulnerability propagation for the all-optical network based on Bio-PEPA
Jian Wang 0039, Hong-Wei Guo |
Wirel. Networks | 2 |
| 2008 | A Strategy Selection Model for Network Survivability Based on Fuzzy Matrix GameabstractSurvivability has emerged as a new phase for the development of network security technique, and how to improve the system survivability using effective strategy is an important problem. In this paper, by analyzing the fuzzy matrix game (FMG) theory and network survivability mechanism, a novel strategy selection model for network survivability based on FMG theory and its dynamic analysis method are presented from the macroscopically view. The result of instance analysis and validation show that the proposed method can provide guarantee conditions for network survivability effectively. Guosheng Zhao, Jian Wang 0039 |
WAIM | 3 |