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

Xiaoli Zeng

dblp:52/7831 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
3since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 2 since 2021Computer networks · 3 · 2 first-authorSecurity and privacy · 1Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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.

Human-computer interaction and pervasive computing
1 paper
Learning and educational technologies · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computing education · 100%
Artificial intelligence
1 paper
Multi-agent systems · 100%

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

TopicWeightPapersLastEvidence papers
Computing education › educational technology
educational content generation
1.012026
A Compress-Expand Framework for Automatic Lesson Plan Generation · AAAI 2026
Learning and educational technologies
educational content generation
1.012026
COMA: A Collaborative Multi-Role Agent Framework for Automated Lesson Plan Generation · WWW 2026

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

large language model · 3.0multi-role agent framework · 2.0retrieval-augmented generation · 1.0
YearPublicationVenuePosition
2026 A Compress-Expand Framework for Automatic Lesson Plan Generation
abstract
Creating a well-structured lesson plan is essential for improving classroom efficiency, yet it is often a labor-intensive process. Recently, many studies have leveraged large language models (LLMs) to generate lesson plans automatically. However, existing methods heavily rely on LLMs that are pre-trained on large-scale universal corpora, which often lack critical educational theory and textbook-specific information. This can lead to inconsistencies and misalignments with textbook content. To address these challenges, we propose CE-LessonPlan, a novel compress-expand framework to generate lesson plans by effectively combining external lesson plan references and textbook information. The framework consists of two key components: a compressor, which synthesizes multiple retrieved references into a cohesive document, and an expander, which integrates textbook-specific information with the parametric knowledge of LLMs to produce another enriched lesson plan. The outputs of the compressor and expander are then seamlessly integrated to create a comprehensive golden context, further enhancing the lesson plan generation process with LLMs. We conduct extensive experiments to demonstrate that CE-LessonPlan outperforms existing methods for generating lesson plans.
Shuyan Huang, Ying Zheng 0010, Xiaoli Zeng, Zitao Liu 0001
AAAI3
2026 COMA: A Collaborative Multi-Role Agent Framework for Automated Lesson Plan Generation
Xiaoli Zeng, Ying Zheng 0010, Shuyan Huang, Zitao Liu 0001, Mi Tian 0008, Mingliang Hou, Jiaqi Zheng 0012, Wenzhou Dou
WWW1
2023 Knowledge Distillation with Feature Enhancement Mask
Longye Wang, Xiaoli Zeng
ICANN (8)4
2017 An Efficient and Secure Range Query Scheme for Encrypted Data in Smart Grid
Xiaoli Zeng, Nuo Yu, Xiaohua Jia
MSN1
2017 A lightweight privacy-preserving scheme for metering data collection in smart grid
abstract
In smart grids, smart meters are the metering devices that are responsible for collecting users' information about their electricity consumption. Smart meters provide an effective means for control center (CC) to monitor the power supply and consumption in a timely and accurate fashion. However, the collection of users' metering reports through an untrusted public network raises a serious privacy concern of users. Even though a lot of privacy-preserving approaches that have been proposed in the literature for secure data transmission, they are not directly applicable to the scenario of collecting metering reports in smart grids due to the limited computational resources of smart meters and the networking environment of smart grids. In this paper, we propose a lightweight privacy-preserving scheme for metering data collection in smart grids. There are three advantages of our proposed scheme: 1) Lightweight. There is no need for users' metering devices to carry out intensive encryption and decryption operations. 2) No need of a trusted third party for key generation and key management. 3) Scalability. Our scheme can cater for large scale of users connected via public networks. Experiment results show that the proposed scheme is efficiently and lightweight and is suitable for privacy-preserving data collection in smart grids.
Xiaoli Zeng, Qin Liu 0003, Hejiao Huang, Xiaohua Jia
WoWMoM1
2016 Solving Dynamic Vehicle Routing Problem with Soft Time Window by iLNS and hPSO
Xiaohan He, Xiaoli Zeng, Hejiao Huang, Hongwei Du 0001
COCOA2
2016 Families of asymmetric sequence pair set with zero-correlation zone via interleaved technique
abstract
An asymmetric zero‐correlation zone (A‐ZCZ) sequence pair set is a ZCZ sequence pair set consisting of multiple ZCZ sequence pair subsets. Two arbitrary sequence pairs which belong to different subsets should have a large zero cross‐correlation zone (ZCCZ) in the A‐ZCZ sequence pair set. Additionally, each subset is a typical ZCZ sequence pair set. The proposed A‐ZCZ sequence pair sets can be generated based on interleaved technique from perfect sequence or perfect sequence pair of length P = Nmk with N ≥ 1, m ≥ 1, k > 1. The new A‐ZCZ sequence pair sets are applied to quasi‐synchronous code‐division multiple‐access (QS‐CDMA) systems and it can hypothetically achieve larger ZCCZ than typical ZCZ sequence pair sets, as well as eliminating both multiple access and multipath interference in the QS‐CDMA system.
Longye Wang, Xiaoli Zeng, Hong Wen 0001
IET Commun.2
2014 A Novel Construction of Asymmetric Sequence Pairs Set with Zero-Correlation Zone
Longye Wang, Xiaoli Zeng, Hong Wen 0001
SETA2