Dingjiu Yu

dblp:133/0284 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

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

Graphics, 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.

Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory
graph sampling
0.712023
Cluster-preserving sampling algorithm for large-scale graphs · Sci. China Inf. Sci. 2023
Data mining › structured data mining › graph mining
scalable graph mining
0.212023
Cluster-preserving sampling algorithm for large-scale graphs · Sci. China Inf. Sci. 2023

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

sampling · 1.3
YearPublicationVenuePosition
2023 Cluster-preserving sampling algorithm for large-scale graphs
Hongchang Chen, Dingjiu Yu, Yulong Pei
Sci. China Inf. Sci.3
2015 Robust joint beamforming and artificial noise design for amplify-and-forward multi-antenna relay systems
abstract
In this paper, we address physical layer security for amplify-and-forward (AF) multi-antenna relay systems in the presence of multiple eavesdroppers. A robust joint design of cooperative beamforming (CB) and artificial noise (AN) is proposed with imperfect channel state information (CSI) of both the destination and the eavesdroppers. We aim to maximize the worst-case secrecy rate subject to the sum power and the per-antenna power constraints at the relay. Such joint design problem is non-convex. By utilizing the semidefinite relaxation (SDR) technique, S-procedure and the successive convex approximation (SCA) algorithm, the original non-convex optimization problem is recast into a series of semidefinite programs (SDPs) which can be efficiently solved using interior-methods. Simulation results are presented to verify the effectiveness of the proposed design.
Lijian Zhang, Wenyu Luo, Yanqun Tang, Dingjiu Yu
ICASSP5
2015 Robust Artificial Noise Aided Transmit Method for Multicast MISO Wiretap Channels with Imperfect Covariance-Based CSI
abstract
In this work, a robust artificial noise (AN) aided transmit method is proposed for a multicast multiple-input single-output (MISO) system in the presence of multiple single-antenna eavesdroppers. With the imperfect covariance-based channel state information (CSI), we aim to minimize the transmit power at the transmitter under the multicast secrecy rate constraint and the maximum transmit power constraint. The resulting optimization problem involves the joint optimization of the beamforming vector and AN covariance matrix. After using the semidefinite relaxation (SDR) technique, we derive the exact reformulation of the original optimization through the Lagrange duality. Then this non-convex problem is transformed into a one-variable optimization problem, which can be handled by solving a series of semidefinite programs (SDPs). Simulation results demonstrate the effectiveness of the proposed robust transmit method.
Lijian Zhang, Wenyu Luo, Zhou Zhong, Dingjiu Yu
VTC Spring5
2003 Research of VLR mobility database failure recovery and performance analysis for cdma2000 system
abstract
This paper presents a VLR database failure recovery scheme for cdma2000 system. We propose to backup the mobility database periodically. When failure occurs, VLR reloads the database from the backup file. However, if there is any new event (MS moving in or out) before recovery, the new information will not appear in the recovered VLR. The MS moving-in problem can be solved by autonomous registration, but the MS moving-out may result in obsolete information, we propose to periodically scan the database and remove the obsolete entries. The proposed scheme can also eliminate failure expansion and recover failures caused by radio troubles. The ratio of database backup period to scan period is analyzed.
Dingjiu Yu, Honglin Qiu, Jiangxing Wu 0001
PIMRC2