Demo Data from EDBT 2026 / reviewers in the wild / expert
Lin Jing
dblp:118/4468
· DBLP profile ↗
7ranked-venue papers
0as first author
5since 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 2021Databases, data management, data science and information retrieval · 3 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 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.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Smart cities and intelligent transportation · 100% | |
| Computer graphics and multimedia
1 paper |
Visualization and visual analytics · 100% | |
| Human-computer interaction and pervasive computing
1 paper |
Interaction techniques and input · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Smart cities and intelligent transportation › urban flow inference
fine-grained urban flow inference |
0.4 | 1 | 2019 | UrbanFM: Inferring Fine-Grained Urban Flows · KDD 2019 |
Smart cities and intelligent transportation
urban computing |
0.4 | 1 | 2019 | UrbanFM: Inferring Fine-Grained Urban Flows · KDD 2019 |
Visualization and visual analytics › scientific visualization
mathematical visualization |
0.1 | 1 | 2012 | KnotPad: Visualizing and Exploring Knot Theory with Fluid Reidemeister Moves · IEEE Trans. Vis. Comput. Graph. 2012 |
Interaction techniques and input
direct manipulation |
0.0 | 1 | 2012 | KnotPad: Visualizing and Exploring Knot Theory with Fluid Reidemeister Moves · IEEE Trans. Vis. Comput. Graph. 2012 |
Methods — techniques the papers use, named apart from their topics
feature extraction · 0.4distributional upsampling · 0.4deep neural network · 0.4topological drawing · 0.3reidemeister moves · 0.3math-aware deformation · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | STFusion: Strided Temporal Feature Fusion for Multi-view 3D Object Detection
Songyan Liu, Lin Jing |
ICIC (1) | 3 |
| 2025 | Scheduling distributed heterogeneous parallel precast flowshop with shared resources via logic-based Benders decomposition
Fuli Xiong, Kaihao Zhou, An Ping, Lin Jing |
Adv. Eng. Informatics | 4 |
| 2025 | Scheduling distributed heterogeneous non-permutation flowshop to minimize the total weighted tardiness
Fuli Xiong, Ningxin Xiong, Lin Jing |
Expert Syst. Appl. | 4 |
| 2025 | Order acceptance and scheduling under eligibility, availability, and budget constraints in distributed heterogeneous flow shop production
Fuli Xiong, Lin Jing, Chengfei Xiang, Yitong Han |
Expert Syst. Appl. | 2 |
| 2024 | Multi-Source and Multi-modal Deep Network Embedding for Cross-Network Node ClassificationabstractIn recent years, to address the issue of networked data sparsity in node classification tasks, cross-network node classification (CNNC) leverages the richer information from a source network to enhance the performance of node classification in the target network, which typically has sparser information. However, in real-world applications, labeled nodes may be collected from multiple sources with multiple modalities (e.g., text, vision, and video). Naive application of single-source and single-modal CNNC methods may result in sub-optimal solutions. To this end, in this article, we propose a model called Multi-source and Multi-modal Cross-network Deep Network Embedding (M 2 CDNE) for cross-network node classification. In M 2 CDNE, we propose a deep multi-modal network embedding approach that combines the extracted deep multi-modal features to make the node vector representations network invariant. In addition, we apply dynamic adversarial adaptation to assess the significance of marginal and conditional probability distributions between each source and target network to make node vector representations label discriminative. Furthermore, we devise to classify nodes in the target network through the related source classifier and aggregate different predictions utilizing respective network weights, corresponding to the discrepancy between each source and target network. Extensive experiments performed on real-world datasets demonstrate that the proposed M 2 CDNE significantly outperforms the state-of-the-art approaches. Weizhe Zhang, Yan Wang 0002, Lin Jing |
ACM Trans. Knowl. Discov. Data | 5 |
| 2019 | UrbanFM: Inferring Fine-Grained Urban FlowsabstractUrban flow monitoring systems play important roles in smart city efforts around the world. However, the ubiquitous deployment of monitoring devices, such as CCTVs, induces a long-lasting and enormous cost for maintenance and operation. This suggests the need for a technology that can reduce the number of deployed devices, while preventing the degeneration of data accuracy and granularity. In this paper, we aim to infer the real-time and fine-grained crowd flows throughout a city based on coarse-grained observations. This task is challenging due to the two essential reasons: the spatial correlations between coarse- and fine-grained urban flows, and the complexities of external impacts. To tackle these issues, we develop a method entitled UrbanFM based on deep neural networks. Our model consists of two major parts: 1) an inference network to generate fine-grained flow distributions from coarse-grained inputs by using a feature extraction module and a novel distributional upsampling module; 2) a general fusion subnet to further boost the performance by considering the influences of different external factors. Extensive experiments on two real-world datasets validate the effectiveness and efficiency of our method, demonstrating its state-of-the-art performance on this problem. Yuxuan Liang 0002, Kun Ouyang, Lin Jing, Sijie Ruan, Ye Liu 0002, Junbo Zhang 0004, David S. Rosenblum, Yu Zheng 0004 |
KDD | 3 |
| 2012 | KnotPad: Visualizing and Exploring Knot Theory with Fluid Reidemeister MovesabstractWe present KnotPad, an interactive paper-like system for visualizing and exploring mathematical knots; we exploit topological drawing and math-aware deformation methods in particular to enable and enrich our interactions with knot diagrams. Whereas most previous efforts typically employ physically based modeling to simulate the 3D dynamics of knots and ropes, our tool offers a Reidemeister move based interactive environment that is much closer to the topological problems being solved in knot theory, yet without interfering with the traditional advantages of paper-based analysis and manipulation of knot diagrams. Drawing knot diagrams with many crossings and producing their equivalent is quite challenging and error-prone. KnotPad can restrict user manipulations to the three types of Reidemeister moves, resulting in a more fluid yet mathematically correct user experience with knots. For our principal test case of mathematical knots, KnotPad permits us to draw and edit their diagrams empowered by a family of interactive techniques. Furthermore, we exploit supplementary interface elements to enrich the user experiences. For example, KnotPad allows one to pull and drag on knot diagrams to produce mathematically valid moves. Navigation enhancements in KnotPad provide still further improvement: by remembering and displaying the sequence of valid moves applied during the entire interaction, KnotPad allows a much cleaner exploratory interface for the user to analyze and study knot equivalence. All these methods combine to reveal the complex spatial relationships of knot diagrams with a mathematically true and rich user experience. Hui Zhang 0006, Jianguang Weng, Lin Jing, Yiwen Zhong |
IEEE Trans. Vis. Comput. Graph. | 3 |