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

Ruiqi Ma

dblp:34/5453 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
3since 2021 · last 2027
—ORCID · conflict

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

Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1Databases, data management, data science and information retrieval · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author

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
Immersive interaction · 77% Usability and user experience research · 23%

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

TopicWeightPapersLastEvidence papers
Immersive interaction
virtual environment design
0.112006
Presence, workload and performance effects of synthetic environment design factors · Int. J. Hum. Comput. Stud. 2006
YearPublicationVenuePosition
2027 Thinking fast and slow: How investor group thinking modes influence stock returns
Wen Long, Ruiqi Ma
Inf. Process. Manag.2
2026 A Low-Power Resonate-and-Fire Neuron with Adaptive Refractory Control for RRAM-Based Neuromorphic Computing
Xu Cheng Yong, Ruiqi Ma, Tianze Wu, Ruolun Li, Yanze Xu, Zhichao Tan
ISCAS2
2025 CycleOIE: A Low-Resource Training Framework For Open Information Extraction
abstract
Open Information Extraction (OpenIE) aims to extract structured information in the form of triples from unstructured text, serving as a foundation for various downstream NLP tasks. Despite the success of neural OpenIE models, their dependence on large-scale annotated datasets poses a challenge, particularly in low-resource settings. In this paper, we introduce a novel approach to address the low-resource OpenIE task through two key innovations: (1) we improve the quality of training data by curating small-scale, high-quality datasets annotated by a large language model (GPT-3.5), leveraging both OpenIE principles and few-shot examples to form LSOIE-g principles and LSOIE-g examples; (2) we propose CycleOIE, a training framework that maximizes data efficiency through a cycle-consistency mechanism, enabling the model to learn effectively from minimal data. Experimental results show that CycleOIE, when trained on only 2k+ instances, achieves comparable results to models trained on over 90k instances. Our contributions are further validated through extensive experiments, demonstrating the superior performance of CycleOIE and our curated LSOIE-g datasets in low-resource OpenIE as well as revealing the internal mechanisms of CycleOIE.
Zhihong Jin, Chunhong Zhang, Zheng Hu 0001, Jibin Yu, Ruiqi Ma, Xiaohao Liao, Yanxing Zhang
COLING5
2020 PARS-SR: A scalable flow forwarding scheme based on Segment Routing for massive giant connections in 5G networks
abstract
In 5G networks with SDN architecture, the traffic explosion and the rising of diverse service requirements lead to many challenges for 5G core networks on flexibility and scalability. In order to achieve high-speed forwarding of traffic and diversified transmission requirements in the 5G era, combined with SDN and Segment Routing, we propose a scalable flow forwarding scheme called Segment Routing based on Path Aggregation and Rule sharing (PARS-SR) to solve SDN switch flow table resource shortage problem. Traditional OpenFlow-based or MPLS-based flow forwarding scheme may lead to performance degradation due to flow-table overflowed or heavy MPLS label load incurred. PARS-SR exploits SDN, Segment Routing and intelligent path encoding algorithm to achieve a trade-off between flow table resource and MPLS label load. The proposed PARS-SR can learn the flow path information online to implement path aggregation and rule sharing by aggregating a large number of flows into a small number of flow entries based on the coincidence degree of the flow path. To find the optimal flow path aggregation scheme, we present an intelligent encoding algorithm to maximize the overall cost saving. The simulation results show that PARS-SR can effectively reduce both the number of flow entries and the MPLS label load of the packet.
Ziyong Li, Yuxiang Hu 0004, Tao Hu 0002, Ruiqi Ma
Comput. Commun.4
2006 Presence, workload and performance effects of synthetic environment design factors
Ruiqi Ma, David B. Kaber
Int. J. Hum. Comput. Stud.1