Qingxi Li

dblp:35/6642 · DBLP profile ↗
← Back
9ranked-venue papers
2as first author
1since 2021 · last 2025
—ORCID · none

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

Computer networks · 7 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1

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.

Computer networks
6 papers
Transport protocols and congestion control · 76% Internet architecture and protocols · 10% Internet of things and sensor networks · 6%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control
congestion control architecture
0.422015
PCC: Re-architecting Congestion Control for Consistent High Performance · NSDI 2015
Rethinking congestion control architecture: performance-oriented congestion control · SIGCOMM 2014
Transport protocols and congestion control
low-latency transport
0.222011
ASAP: a low-latency transport layer · SIGCOMM 2011
ASAP: a low-latency transport layer · CoNEXT 2011
Transport protocols and congestion control
TCP congestion control
0.212015
Halfback: running short flows quickly and safely · CoNEXT 2015
Transport protocols and congestion control
TCP
0.212014
Rethinking congestion control architecture: performance-oriented congestion control · SIGCOMM 2014
Transport protocols and congestion control
transport layer
0.112011
ASAP: a low-latency transport layer · CoNEXT 2011
Internet of things and sensor networks
wireless sensor network
0.112008
Safety assurance for archeologists using sensor network · SenSys 2008
Transport protocols and congestion control › congestion control fairness
TCP friendliness
0.112015
Halfback: running short flows quickly and safely · CoNEXT 2015
Internet architecture and protocols
domain name system
0.012011
ASAP: a low-latency transport layer · CoNEXT 2011
Internet of things and sensor networks › wireless sensor network
environmental monitoring
0.012008
Safety assurance for archeologists using sensor network · SenSys 2008

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

experimental comparison · 0.2PCC · 0.2
YearPublicationVenuePosition
2025 BERT-DXLMA: Enhanced representation learning and generalization model for english text classification
abstract
In recent years, the rapid development of artificial intelligence technology has significantly improved the performance of BERT-based deep learning models in text classification tasks . However, these models still have shortcomings in capturing the deep semantics of text, emerging text classification , and handling minority class samples in imbalanced data . To address these challenges, we proposed an innovative BERT-DXLMA hybrid model. This model enhances the semantic feature extraction and representation learning capabilities by integrating xLSTM, and uses semantic fusion technology to reduce the information loss caused by the increase in the number of network layers. In addition, we re-improved the loss function based on focal loss to improve the model’s attention to minority class samples and generalization ability . We conducted extensive experiments and in-depth analysis on six public datasets, and the results showed that BERT-DXLMA outperformed multiple baseline methods in terms of precision and overall accuracy, demonstrating its superiority in text classification tasks .
Xingliang Mao, Zhuhao Li, Qingxi Li
Neurocomputing3
2020 Joint Semi-Supervised Feature Auto-Weighting and Classification Model for EEG-Based Cross-Subject Sleep Quality Evaluation
abstract
Measuring the sleep quality is important or even crucial for people who are engaged in dangerous jobs such as the high-speed train drivers. Since the scalp EEG data are generated by the neural activities of the brain cortex, it is collected from subjects with different hours of sleep time (4 hours, 6 hours and 8 hours) to conduct sleep quality evaluation. To suppress the cross-subject variances of EEG data, in this paper, we propose a joint feature auto-weighting and semi-supervised classification model, termed GRLSR, which is formulated by introducing an auto-weighting variable into the least square regression to adaptively and quantitatively measure the importance of each dimension of the feature. Once the model is solved, besides the measurement results, we can use the auto-weighting variable to 1) analyze the importance of each frequency band in sleep quality expression and 2) identify the capacity of different channels connecting to the sleep effect. Therefore, the proposed GRLSR is a pure data-driven computing model for EEG-based cross-subject sleep quality evaluation. Experimental results show its effectiveness.
Yong Peng 0001, Qingxi Li, Wanzeng Kong, Bao-Liang Lu, Andrzej Cichocki
ICASSP2
2015 Halfback: running short flows quickly and safely
abstract
Interactive applications like web browsing are sensitive to latency. Unfortunately, TCP consumes significant time in its start-up phase and loss recovery. Existing sender-side optimizations use more aggressive start-up strategies to reduce latency, but at the same time they harm safety in the sense that they can damage co-existing flows' performance and potentially the network's overall ability to deliver data. In this paper, we experimentally compare existing solutions' latency performance and more importantly, the trade-off between latency and safety at both the flow level and the application level. We argue that existing solutions are still operating away from the sweet spot on this trade-off plane. Based on the diagnosis of existing solutions, we introduce Halfback, a new short-flow transmission mechanism that operates on a better latency-safety trade-off point: Halfback achieves lower latency than the lowest latency previous solution and at the same time significantly better safety. As Halfback is TCP-friendly and requires only sender-side changes, it is feasible to deploy.
Qingxi Li, Mo Dong, Brighten Godfrey
CoNEXT1
2015 PCC: Re-architecting Congestion Control for Consistent High Performance
Mo Dong, Qingxi Li, Doron Zarchy, Brighten Godfrey, Michael Schapira
NSDI2
2014 Rethinking congestion control architecture: performance-oriented congestion control
abstract
After more than two decades of evolution, TCP and its end host based modifications can still suffer from severely degraded performance under real-world challenging network conditions. The reason, as we observe, is due to TCP family's fundamental architectural deficiency, which hardwires packet-level events to control responses and ignores emprical performance. Jumping out of TCP lineage's architectural deficiency, we propose Performance-oriented Congestion Control (PCC), a new congestion control architecture in which each sender controls its sending strategy based on empirically observed performance metrics. We show through preliminary experimental results that PCC achieves consistently high performance under various challenging network conditions.
Mo Dong, Qingxi Li, Doron Zarchy, Brighten Godfrey, Michael Schapira
SIGCOMM2
2012 CARE: content aware redundancy elimination for challenged networks
abstract
This paper presents the design of a novel architecture called CARE (Content-Aware Redundancy Elimination) that enables maximizing the informational value that challenged networks offer their users. We focus on emerging applications for situational awareness in disaster affected regions. Motivated by advances in computer vision algorithms, we propose to incorporate image similarity detection algorithms in the forwarding path of these networks. The purpose is to handle the large generation of redundant content. We outline the many issues involved in such a vision. With a Delay-Tolerant Network (DTN) setup, our simulations demonstrate that CARE can substantially boost the number of unique messages that escape the disaster zone, and it can also deliver them faster. These benefits are achieved despite the energy overhead needed by the similarity detectors.
Udi Weinsberg, Qingxi Li, Nina Taft, Athula Balachandran, Vyas Sekar, Gianluca Iannaccone, Srinivasan Seshan
HotNets2
2011 ASAP: a low-latency transport layer
abstract
For interactive networked applications like web browsing, every round-trip time (RTT) matters. We introduce ASAP, a new naming and transport protocol that reduces latency by shortcutting DNS requests and eliminating TCP's three-way handshake, while ensuring the key security property of verifiable provenance of client requests. ASAP eliminates between one and two RTTs, cutting the delay of small requests by up to two-thirds.
Wenxuan Zhou 0003, Qingxi Li, Matthew Caesar 0001, Brighten Godfrey
CoNEXT2
2011 ASAP: a low-latency transport layer
abstract
For interactive networked applications like web browsing, every round-trip time (RTT) matters. We introduce ASAP, a new naming and transport protocol that reduces latency by shortcutting DNS requests and eliminating TCP's three-way handshake, while ensuring the key security property of verifiable provenance of client requests. ASAP eliminates between one and two RTTs, cutting the delay of small requests by up to two-thirds.
Qingxi Li, Wenxuan Zhou 0003, Matthew Caesar 0001, Brighten Godfrey
SIGCOMM1
2008 Safety assurance for archeologists using sensor network
abstract
No abstract available.
Shan Chang, Qingxi Li, Yong Qi 0001, Jizhong Zhao, Yuan He 0004, Xue (Steve) Liu
SenSys2