XNXuyun Nie

Xuyun Nie

*This is an algorithmically generated author record based on publicly available information.

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


Xuyun Nie has a total of 61 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Pre-trained transformer with contrastive learning and regression constraints for remaining useful life prediction

    by Yifei Tang, Pengfei Gou, Xuyun Nie, Mengjuan Liu

    Condition-based maintenance (CBM) aims to plan maintenance activities through continuous monitoring and prognostics of equipment operating conditions, thereby reducing maintenance costs and downtime. remaining useful life (RUL) prediction is one of the core enabling technologies of CBM, and data-driven approaches have become a major research focus in this field. To overcome the limitations of existing methods in learning effective health representations, this paper proposes a pre-training and fine-tuning Transformer framework based on contrastive learning with regression constraints, designed to learn continuous and highly predictable health representations. During the pre-training phase, this method introduces RUL regression constraints on top of supervised contrastive learning to prevent the model from relying solely on relative relationships between samples, thereby ignoring the absolute numerical differences in health status along the lifespan dimension. Additionally, we employ an attention-based pooling mechanism to aggregate features from multiple time steps, allowing the model to adaptively emphasize time-step features that are most relevant to the current degradation state, thus obtaining more comprehensive representations of the global health status. Experimental results on the turbofan engine datasets C-MAPSS and N-CMAPSS demonstrate that our proposed method outperforms existing baseline models on multiple evaluation metrics, proving its effectiveness in the RUL prediction task. All codes have been made available on GitHub: https://github.com/ZeyU1999/RUL-Prediction/tree/master .

  • Open Access

    Real-time Bidding Strategy in Display Advertising: An Empirical Analysis

    by Mengjuan Liu, Zhengning Hu, Zhi Lai, Daiwei Zheng, Xuyun Nie

    Bidding strategies that help advertisers determine bidding prices are receiving increasing attention as more and more ad impressions are sold through real-time bidding systems. This paper first describes the problem and challenges of optimizing bidding strategies for individual advertisers in real-time bidding display advertising. Then, several representative bidding strategies are introduced, especially the research advances and challenges of reinforcement learning-based bidding strategies. Further, we quantitatively evaluate the performance of several representative bidding strategies on the iPinYou dataset. Specifically, we examine the effects of state, action, and reward function on the performance of reinforcement learning-based bidding strategies. Finally, we summarize the general steps for optimizing bidding strategies using reinforcement learning algorithms and present our suggestions.

  • Privacy-Preserving Encrypted Traffic Inspection With Symmetric Cryptographic Techniques in IoT

    by Dajiang Chen, Hao Wang, Ning Zhang, Xuyun Nie, Hong-Ning Dai, Kuan Zhang, Kim-Kwang Raymond Choo

    To ensure the security of Internet of Things (IoT) communications, one can use deep packet inspection (DPI) on network middleboxes to detect and mitigate anomalies and suspicious activities in network traffic of IoT, although doing so over encrypted traffic is challenging. Therefore, in this article, an efficient and privacy-preserving encrypted traffic detection scheme is proposed. The scheme uses only lightweight cryptographic operations (i.e., symmetric encryption, hash functions, and pseudorandom functions) to achieve both privacy and security within an inspection round. A dispute resolution mechanism is also designed to address potential disputes between client(s) and server(s). We also present the corresponding security proof and experimental evaluation, which demonstrate that our proposed scheme achieves strong security and privacy preservation and good performance.


  • Open Access

    Traditional and Hybrid Access Control Models: A Detailed Survey

    by Muhammad Umar Aftab, Ali Hamza, Ariyo Oluwasanmi, Xuyun Nie, Muhammad Shahzad Sarfraz, Danish Shehzad, Zhiguang Qin, Ammar Rafiq

    Access control mechanisms define the level of access to the resources among specified users. It distinguishes the users as authorized or unauthorized based on appropriate policies. Several traditional and hybrid access control models have been proposed in previous researches over the last few decades. In this study, we provide a detailed survey of access control models and compare the traditional and hybrid access control models based on their access control criteria. This survey focuses on the growing literature of access control models and summarizes it through comparative analysis, identifying limitations and illustrating the advantages of both traditional and hybrid models. This study will help the researchers to get a deep understanding of the traditional and hybrid access control models.


  • Privacy-Preserving Bilateral Fine-Grained Access Control for Cloud-Enabled Industrial IoT Healthcare

    by Jianfei Sun, Yu Yuan, MingJian Tang, Xiaochun Cheng, Xuyun Nie, Muhammad Umar Aftab

    The expeditious development in cloud-enabled industrial Internet of Things (IIoT) healthcare has significantly reduced the costs to monitor and protect people at home while notably improving the quality of human healthcare. Despite its considerable convenience and benefits, it confronts some security and privacy challenges in the aspects of bilateral fine-grained access control, the authenticity and tamper resistance of shared health data. To tackle these constraints, a secure privacy-preserving bilateral access control scheme with fine granularity (PBAC-FG) is proposed in this article. Our PBAC-FG exploits fine-grained access control and matchmaking encryption technologies to ensure both participants (e.g., patients and healthcare providers) can specify their respective fine-grained access control over the encrypted health data, such that only authorized counterparts can efficiently access the health data. Besides, the correct rigorous security proofs are indicated to verify that our PBAC-FG is indeed secure. We carry out comprehensive performance evaluations and comparisons to demonstrate the efficiency and practicality of the PBAC-FG for IIoT healthcare applications.


  • Open Access

    Secure and dynamic access control for the Internet of Things (IoT) based traffic system

    by Muhammad Umar Aftab, Ariyo Oluwasanmi, Abdullah Alharbi, Osama Sohaib, Xuyun Nie, Zhiguang Qin, Son Tung Ngo

    Today, the trend of the Internet of Things (IoT) is increasing through the use of smart devices, vehicular networks, and household devices with internet-based networks. Specifically, the IoT smart devices and gadgets used in government and military are crucial to operational success. Communication and data sharing between these devices have increased in several ways. Similarly, the threats of information breaches between communication channels have also surged significantly, making data security a challenging task. In this context, access control is an approach that can secure data by restricting unauthorized users. Various access control models exist that can effectively implement access control yet, and there is no single state-of-the-art model that can provide dynamicity, security, ease of administration, and rapid execution all at once. In combating this loophole, we propose a novel secure and dynamic access control (SDAC) model for the IoT networks (smart traffic control and roadside parking management). Our proposed model allows IoT devices to communicate and share information through a secure means by using wired and wireless networks (Cellular Networks or Wi-Fi). The effectiveness and efficiency of the proposed model are demonstrated using mathematical models and discussed with many example implementations.


  • A Privacy-Aware and Traceable Fine-Grained Data Delivery System in Cloud-Assisted Healthcare IIoT

    by Jianfei Sun, Dajiang Chen, Ning Zhang, Guowen Xu, Mingjian Tang, Xuyun Nie, Mingsheng Cao

    The emerging of healthcare Industrial Internet of Things (HealthIIoT) cannot only facilitate high-quality care services for patients but also enable efficient telemedicine platform for healthcare practitioners. However, it faces several fundamental security and privacy challenges, such as secure fine-grained data delivery, privacy preserving keyword-based ciphertext retrieval, malicious key delegation, and efficiency of the system. To combat these issues, we propose a privacy-aware and traceable fine-grained system (PTFS) for secure data delivery in cloud-assisted HealthIIoT. Compared to the existing solutions that only implement some of the preceding features, the proposed solution enables secure fine-grained data delivery, privacy-preserving data retrieval, efficient encryption and decryption operations, and trace of malicious key delegation simultaneously. For security analysis, rigorous proofs of the proposed scheme are provided to prove its security. In addition, extensive simulations and experiments are conducted for performance evaluation, which demonstrate the feasibility and effectiveness of PTFS.


  • Open Access

    A Dynamic Bidding Strategy Based on Model-Free Reinforcement Learning in Display Advertising

    by Mengjuan Liu, Li Jiaxing, Zhengning Hu, Jinyu Liu, Xuyun Nie

    Real-time bidding (RTB) is one of the most striking advances in online advertising, where the websites can sell each ad impression through a public auction, and the advertisers can participate in bidding the impression based on its estimated value. In RTB, the bidding strategy is an essential component for advertisers to maximize their revenues (e.g., clicks and conversions). However, most existing bidding strategies may not work well when the RTB environment changes dramatically between the historical and the new ad delivery periods since they regard the bidding decision as $\boldsymbol {a}$ static optimization problem and derive the bidding function only based on historical data. Thus, the latest research suggests using the reinforcement learning (RL) framework to learn the optimal bidding strategy suitable for the highly dynamic RTB environment. In this paper, we focus on using model-free reinforcement learning to optimize the bidding strategy. Specifically, we divide an ad delivery period into several time slots. The bidding agent decides each impression's bidding price depending on its estimated value and the bidding factor of its arriving time slot. Therefore, the bidding strategy is simplified to solve each time slot's optimal bidding factor, which can adapt dynamically to the RTB environment. We exploit the Twin Delayed Deep Deterministic policy gradient (TD3) algorithm to learn each time slot's optimal bidding factor. Finally, the empirical study on a public dataset demonstrates the superior performance and high efficiency of the proposed bidding strategy compared with other state-of-the-art baselines.