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.

Jiying Yin

dblp:268/4756 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

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

Computer networks · 1 · 1 since 2021Theory of computation · 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.

Theoretical computer science
1 paper
Information theory · 87% Mathematical optimization · 13%

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

TopicWeightPapersLastEvidence papers
Information theory › signal processing
signal analysis
0.012004
Nonuniform Sequential Sampling for Signal Analysis · IEEE Trans. Inf. Theory 2004
Information theory › signal processing › sampling theory
signal sampling
0.012004
Nonuniform Sequential Sampling for Signal Analysis · IEEE Trans. Inf. Theory 2004
Mathematical optimization › statistical estimation
bias-variance trade-off
0.012004
Nonuniform Sequential Sampling for Signal Analysis · IEEE Trans. Inf. Theory 2004

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

sampling formula derivation · 0.0
YearPublicationVenuePosition
2026 Efficient information support in LEO SCNs: A multi-layer spatiotemporal cost model and dynamic reallocation algorithm
abstract
To enable global coverage and massive connectivity in the 6G era, space-air-ground integrated networks (SAGINs) rely heavily on low Earth orbit (LEO) satellite constellations, which offer wide-area coverage and autonomous inter-satellite links (ISLs). However, the high mobility, dynamic topology, and uneven resource distribution in LEO networks pose significant challenges to service continuity, efficient scheduling, and resource utilization. This paper proposes an innovative multi-layer spatiotemporal cost graph model that captures the time-varying network dynamics through discretized time windows and layered node representations, transforming complex ISL scheduling into a constrained flow optimization problem. Based on this model, we design a priority-based routing (PBR) algorithm, where mission data volume serves as a priority metric for flow allocation. By periodically updating the spatiotemporal graph and re-executing PBR, the system achieves adaptive scheduling through a system-level feedback mechanism. Evaluations on the Globalstar-2, Iridium Next, and Telesat constellations show that the proposed approach improves throughput by 300%, reduces latency by 50%, and increases mission completion rates by 20%, demonstrating significant gains in inter-satellite resource efficiency.
Bingbing Shi, Xuyang Ma, Jiying Yin
Comput. Networks5
2004 Nonuniform Sequential Sampling for Signal Analysis
abstract
New electronic technologies for signal analysis raise the possibility of sampling very rapidly, with a time-varying density, and determining empirically both the sampling rate and the window width as the signal evolves in time. These opportunities also point to the possibility of sequentially sampling in a time-varying way in more traditional problems. Motivated by these ideas, we establish a sampling formula, valid in cases where both sampling rate and window width may be varied. The formula states that, in terms of the ways in which these quantities should alter with time, optimal performance is achieved when the window width is inversely proportional to squared sampling rate, and sampling rate is directly proportional to squared bias.
Jiying Yin
IEEE Trans. Inf. Theory2