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.

Jingyi Song

dblp:127/3090 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
2since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 1Computer networks · 1Security and privacy · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 1 · 1 first-authorApplied, interdisciplinary, general and emerging 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.

Databases, data mining, and information retrieval
1 paper
Graph data management · 67% Information retrieval · 33%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 50% Algorithms and data structures · 50%
Software engineering, system software, and programming languages
1 paper
Software maintenance and evolution · 77% Program synthesis and code generation · 23%

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

TopicWeightPapersLastEvidence papers
Software maintenance and evolution › software updates
backporting
1.012026
PortGPT: Towards Automated Backporting Using Large Language Models · SP 2026
Graph data management › path query
connectivity query
0.812024
On Querying Historical Connectivity in Temporal Graphs · Proc. ACM Manag. Data 2024
Information retrieval
indexing
0.812024
On Querying Historical Connectivity in Temporal Graphs · Proc. ACM Manag. Data 2024
Graph data management
temporal graph
0.812024
On Querying Historical Connectivity in Temporal Graphs · Proc. ACM Manag. Data 2024
Algorithms and data structures › dynamic algorithms › dynamic graph algorithms
dynamic connectivity
0.812024
On Querying Historical Connectivity in Temporal Graphs · Proc. ACM Manag. Data 2024
Graph algorithms and graph theory
graph algorithms
0.812024
On Querying Historical Connectivity in Temporal Graphs · Proc. ACM Manag. Data 2024
Program synthesis and code generation
code generation with language models
0.312026
PortGPT: Towards Automated Backporting Using Large Language Models · SP 2026

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

two-hop cover · 1.5forest-based index · 1.5large language model · 1.0
YearPublicationVenuePosition
2026 PortGPT: Towards Automated Backporting Using Large Language Models
Zheng Yu 0003, Jingyi Song, Meng Xu 0025, Dongliang Mu
SP3
2024 On Querying Historical Connectivity in Temporal Graphs
abstract
We study the historical connectivity query in temporal graphs where edges continuously arrive. Given an arbitrary time window, and two query vertices, the problem aims to identify if two vertices are connected by a path in the snapshot of the window. The state-of-the-art method designs an index based on the two-hop cover, and updating the index is costly when new edges arrive. In this paper, we propose a new framework and design a novel forest-based index for historical connectivity queries. The index enables us to answer queries by searching if two vertices are connected in the forest. We update the index by modifying a forest structure. Our techniques also work for connectivity query processing in a sliding window of temporal graphs. Extensive experiments have been conducted to show the considerable advantages of our approach compared with the state-of-the-art methods in both historical connectivity queries and sliding-window connectivity queries.
Jingyi Song, Dong Wen 0001, Lantian Xu 0002, Lu Qin 0001, Wenjie Zhang 0001, Xuemin Lin 0001
Proc. ACM Manag. Data1
2020 Construction worker hardhat-wearing detection based on an improved BiFPN
abstract
Work in the construction site is considered to be one of the occupations with the highest safety risk factor. Therefore, safety plays an important role in construction site. One of the most fundamental safety rules in construction site is to wear a hardhat. To strengthen the safety of the construction site, most of the current methods use multi-stage method for hardhat-wearing detection. These methods have limitations in terms of adaptability and generalizability. In this paper, we propose a one-stage object detection method based on convolutional neural network. We present a multi-scale strategy that selects the high-resolution feature maps of DarkNet-53 to effectively identify small-scale hardhats. In addition, we propose an improved weighted bi-directional feature pyramid network (BiFPN), which could fuse more semantic features from more scales. The proposed method can not only detect hardhat-wearing, but also identify the color of the hardhat. Experimental results show that the proposed method achieves a mAP of 87.04%, which outperforms several state-of-the-art methods on a public dataset.
Jingyi Song, Yaoyue Zheng
ICPR3
2020 A Multiscale-Based Adjustable Convolutional Neural Network for Multiple Organ Segmentation
abstract
Accurate segmentation ofs organs-at-risk (OARs) in computed tomography (CT) is the key to planning treatment in radiation therapy (RT). Manually delineating OARs over hundreds of images of a typical CT scan can be time-consuming and error-prone. Deep convolutional neural networks with specific structures like U-Net have been proven effective for medical image segmentation. In this work, we propose an end-to-end deep neural network for multiorgan segmentation with higher accuracy and lower complexity. Compared with several state-of-the-art methods, the proposed accuracy-complexity adjustment module (ACAM) can increase segmentation accuracy and reduce the model complexity and memory usage simultaneously. An attention-based multiscale aggregation module (MAM) is also proposed for further improvement. Experiment results on chest CT datasets show that the proposed network achieves competitive Dice similarity coefficient results with fewer float-point operations (FLOPs) for multiple organs, which outperforms several state-of-the-art methods.
Jingyi Song, Xiaohui Tian, Zhong Shi, Xiaofu Yu
Wirel. Commun. Mob. Comput.2
2015 Monitoring and Analysis of Multiplicative Characteristic Variations for Adhesive Electrode by Using Self-Electrocardiogram Signals
abstract
This study proposes a flexible method to track and quantify the ac-coupled gain variations in electrode to tissue interface (ETI) of adhesive/reusable electrodes. Particularly, this study focuses on the effects of multiplicative motion artifacts (MMA) on ETIs and proposes a continuously monitoring technique to assess ETI multiplicative variations. The proposed method only requires one additional channel of self electrocardiogram (self-ECG). Both gel-covered and foam-based adhesive electrodes were tested. Empirical results show that the ETI multiplicative variations can be characterized by the proposed convenient method. Meanwhile, we successfully demonstrate different characteristics for two types of electrodes under five motion postures including suppress motion, fist/stretch palm, twist, bent inward and arm lift, Furthermore, The long-term degradation experiment illustrates that the average characteristics variation of ETI is less than 6% within 3-day of use.
Jingyi Song, Chun-Shu Wei, Tzyy-Ping Jung
SMC1