Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ying Xie 0008

dblp:51/6470-8 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
6since 2021 · last 2026
0000-0001-8382-2656ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 4 · 3 first-author · 4 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Trustworthy machine learning · 100%
Theoretical computer science
1 paper
Automated reasoning and model checking · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
neural network verification
1.012026
QAV-FT: Quadratic Approximation-Based Neural Network Verification via Fourier Series and Taylor Truncation · CAV (2) 2026
Machine learning › Trustworthy machine learning
robustness
1.012026
QAV-FT: Quadratic Approximation-Based Neural Network Verification via Fourier Series and Taylor Truncation · CAV (2) 2026
Automated reasoning and model checking
neural network verification
1.012026
QAV-FT: Quadratic Approximation-Based Neural Network Verification via Fourier Series and Taylor Truncation · CAV (2) 2026

Methods — techniques the papers use, named apart from their topics

taylor truncation · 2.0quadratic abstraction · 2.0lagrange remainder · 2.0fourier series · 2.0
YearPublicationVenuePosition
2026 QAV-FT: Quadratic Approximation-Based Neural Network Verification via Fourier Series and Taylor Truncation
abstract
Abstract Formal verification is paramount for neural networks in safety-critical domains yet remains constrained by the trade-off between precision and scalability, especially with modern high frequency activation functions. However, the inherent NP-hardness of the problem forces a fundamental trade-off between scalability and precision in existing methods, which fail to adequately capture the high-frequency nonlinearities of modern activations. To address this, Quadratic Approximation based Verification via Fourier series and Taylor truncation (QAV-FT) is proposed as a framework unifying Fourier-enhanced quadratic approximation and Taylor remainder-aware error control. Specifically: (i) A Fourier-based quadratic abstraction is formulated for arbitrary activations, with a rigorous error bound established via Jackson’s theorem and Lebesgue constant analysis; (ii) A second-order propagation scheme utilizing Lagrange remainder theory is devised to analytically derive sound, tight bounds with reduced symbolic complexity; and (iii) These mechanisms are integrated into a scalable full-network verification algorithm. Empirical results on MNIST-FC and other benchmarks demonstrate that QAV-FT achieves an average certification accuracy of 96.8% across complex activations like Swish, GELU, and Mish, with favorable accuracy and efficiency over comparable methods on partial models.
Han Wang 0044, Xuyang Ding, Ying Xie 0008, Yakun Sheng
CAV (2)3
2026 An Intrusion Feature Selection Method Based on Feature Distribution and Gini Impurity
abstract
Intrusion detection systems (IDS) can effectively monitor network traffic and accurately detect malicious behaviors. In Internet of Things (IoT) environments, the massive influx of heterogeneous, resource-constrained devices introduces more complex security challenges, making IDS even more crucial for maintaining network security. However, the presence of redundant or irrelevant features in network traffic can significantly degrade the detection performance of IDS. To address this issue, this paper proposes a Feature distribution and Gini Impurity Filter-based intrusion feature selection method (FGIF). It combines the cardinality and Gini impurity distributions of features within a dataset to construct a multi-parameter evaluation framework, which is used to define efficient feature filtering rules that eliminate redundant and irrelevant features. Theoretical analysis demonstrates that, compared to entropy-based methods, FGIF mitigates selection bias during the feature selection process and significantly reduces computational overhead. Experiments conducted on six widely used IDS benchmark datasets and five commonly adopted classification models further confirm its effectiveness. FGIF significantly reduces feature dimensionality while maintaining detection performance comparable to that of the full feature set. Moreover, compared to existing state-of-the-art methods, FGIF achieves a superior balance between dimensionality reduction and model performance.
Ying Xie 0008, Qianni Zhang, Xuyang Ding, Yongzhao Zhang, Jie Yang 0003
IEEE Internet Things J.1
2024 Versatile Remote Data Checking Scheme for Cloud-Assisted Internet of Things
abstract
Internet of Things (IoT) revolutionizes data collection, especially in e-healthcare, where patients data from wearables and sensors improves medical services. However, IoT’s limitations in computing and storage require cloud outsourcing. Combining IoT with the cloud has potential but raises concerns about data security. Leveraging cloud storage presents an attractive solution for accommodating the substantial volume of data outsourced by IoT devices. As the outsourcing of real-time data to cloud storage becomes commonplace, the adoption of data auditing schemes emerges as a means to ensure data integrity. To curtail operational expenses, various deduplication techniques are commonly employed on outsourced data, effectively sidestepping redundant data and resulting in storage and bandwidth efficiencies. Although real-time data typically remains distinct due to its diverse origins, scenarios, such as data sharing or trading in data-driven services and datamarkets, can lead to data redundancy. Moreover, in order to fortify against any potential information leakage, encryption is implemented prior to deduplication. Convergent encryption (CE) stands as a prominent exemplar of this approach. Effectively integrating data auditing, deduplication, and encryption for wireless sensor devices is no trivial task. To efficiently and securely accommodate data while authenticating them through a heterogeneous framework, we present a novel remote data checking scheme, denoted as the VRDC scheme. This scheme empowers IoT data to be encrypted, updated, deduplicated, and audited, aligning with the imperatives of security, privacy, and efficiency. Through comprehensive security analysis, we establish that our VRDC scheme is fortified against potential threats. Our experimental findings highlight the efficiency of our approach in the realms of auditing, deduplication, and updates. Furthermore, the evidence highlights the potential for optimization within our scheme when compared to related works. This is achieved through the careful management of dynamic update scales within a file.
Ying Xie 0008, Ke Huang 0002, Sheng Yuan, Xiong Li 0002, Fagen Li
IEEE Internet Things J.1
2024 A majority affiliation based under-sampling method for class imbalance problem
Ying Xie 0008, Fagen Li, Xuyang Ding
Inf. Sci.1
2023 Nondeterministic Evaluation Mechanism for User Recruitment in Mobile Crowd-Sensing
abstract
Based on the Internet of Behavior (IoB), mobile crowd-sensing (MCS) utilizes the Internet of Things (IoT) to recruit users by analyzing behavioral patterns. MCS is widely used in numerous large-scale and complex monitoring services, but it cannot provide stable and high-quality services due to nondeterministic user mobility and behaviors, which has a vital impact on recruiting high-quality users. In this article, a stochastic semi-algebraic hybrid system (SSAHS) model is constructed to characterize the user mobility and behaviors of the MCS systems. Based on the definition of probabilistic path and task execution rate, a nondeterministic evaluation mechanism is proposed to measure nondeterministic user mobility and behaviors and to give the probability of the user completing the MCS task under the specified time bound and space conditions. The greater the probability is, the higher the quality of the user. Furthermore, a user recruitment scheme based on a nondeterministic evaluation mechanism (NUR) is developed. The NUR employs historical user data to predict user mobility and behaviors; high-quality users are recruited to quickly upload reliable sensing data. We conduct simulation experiments based on a real-world user trace dataset, Geolife.The results show that compared with competing recruitment strategies, NUR achieves a higher quality of service for the same MCS sensing tasks.
Ying Xie 0008, Mohammad S. Obaidat, Xiong Li 0002, Pandi Vijayakumar
ACM Trans. Sens. Networks1
2022 A Lightweight Anonymous Authentication Protocol for Resource-Constrained Devices in Internet of Things
abstract
With the rapid development of Internet of Things (IoT) in recent years, the security of IoT becomes more and more prominent. To protect data privacy and device availability, identity authentication technology has been applied to the IoT environment. However, although scholars have designed a variety of authentication protocols for the IoT environment, the resource costs of these protocols are still expensive for resource-constrained devices. In particular, when the frequent upgrade of computer hardware has led to a gradual increase in the key length of the cryptosystem, IoT devices are hard to keep up with the upgrade speed because of the balance between cost and tasks. Although the storage space has increased in recent years, the computational and communication capabilities are still limited by some physical factors, such as energy, power, and communication link bandwidth. To improve the situation, this article proposes an anonymous authentication protocol suitable for IoT devices with current hardware performance, which is based on elliptic curve and signcryption techniques. Compared to other protocols, our protocol further reduces the communication and computing cost of the client devices while ensuring security requirements. Thus, we formally prove its theoretical security under the random oracle model and use simulation experiments to verify that the protocol can effectively reduce the resource requirements.
Xuyang Ding, Xiaoxiang Wang, Ying Xie 0008, Fagen Li
IEEE Internet Things J.3