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

Yinghua Cui

dblp:09/1740 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
2since 2021 · last 2022
—ORCID · conflict

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

Computer networks · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 since 2021Applied, 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.

Artificial intelligence
1 paper
Graph learning · 67% Deep learning architectures and training · 33%
Computer networks
1 paper
Internet of things and sensor networks · 75% Wireless networking · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
attention mechanism
0.612022
g-Inspector: Recurrent Attention Model on Graph · IEEE Trans. Knowl. Data Eng. 2022
Machine learning › Graph learning › graph neural network
graph attention
0.612022
g-Inspector: Recurrent Attention Model on Graph · IEEE Trans. Knowl. Data Eng. 2022
Machine learning › Graph learning
graph classification
0.612022
g-Inspector: Recurrent Attention Model on Graph · IEEE Trans. Knowl. Data Eng. 2022
Machine learning › Graph learning
graph neural network
0.612022
g-Inspector: Recurrent Attention Model on Graph · IEEE Trans. Knowl. Data Eng. 2022
Machine learning › Graph learning › graph classification
interpretable graph classification
0.612022
g-Inspector: Recurrent Attention Model on Graph · IEEE Trans. Knowl. Data Eng. 2022
Machine learning › Deep learning architectures and training › attention mechanism
recurrent attention
0.612022
g-Inspector: Recurrent Attention Model on Graph · IEEE Trans. Knowl. Data Eng. 2022
Internet of things and sensor networks › RFID systems
anti-collision protocol
0.112010
Performance evaluation of a multi-branch tree algorithm in RFID · IEEE Trans. Commun. 2010
Internet of things and sensor networks
RFID systems
0.112010
Performance evaluation of a multi-branch tree algorithm in RFID · IEEE Trans. Commun. 2010
Internet of things and sensor networks › RFID systems › cardinality estimation
tag cardinality estimation
0.112010
Performance evaluation of a multi-branch tree algorithm in RFID · IEEE Trans. Commun. 2010
Wireless networking › multiple access protocols
tree algorithm
0.112010
Performance evaluation of a multi-branch tree algorithm in RFID · IEEE Trans. Commun. 2010

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

shift operation · 0.6attention mechanism · 0.6theoretical analysis · 0.1simulation · 0.1
YearPublicationVenuePosition
2022 The Retrieval of Temperature and Humidity Profiles for FY-3D/MWHTS in the Arctic Region
abstract
Microwave Humidity and Temperature Sounder (MWHTS) is one of the most important payloads on the Fengyun-3 (FY-3) satellite, and it can realize simultaneous detection of atmospheric temperature and humidity profiles. At present, the measurement data from MWHTS is not yet assimilated in the Arctic region. It is helpful to improve the initial field of the assimilation system by evaluating the accuracy of MWHTS atmospheric temperature and humidity profiles retrieval parameters in the Arctic region. In this paper, we propose a deep learning method for atmospheric temperature and humidity profiles retrieval to evaluate the accuracy of MWHTS atmospheric parameters. The results show that the RMSE of temperature profile is less than 2K, and the RMSE of humidity profile is between 10-20%. And the retrieval accuracy of LSTM is slightly better than that of DNN.
Shengru Tie, Yinghua Cui, Lanjie Zhang, Qiurui He 0002
IGARSS2
2022 g-Inspector: Recurrent Attention Model on Graph
abstract
Graph classification problem is becoming one of research hotspots in the realm of graph mining, which has been widely used in cheminformatics, bioinformatics and social network analytics. Existing approaches, such as graph kernel methods and graph Convolutional Neural Network, are facing the challenges of non-interpretability and high dimensionality. To address the problems, we propose a novel recurrent attention model, called g-Inspector, which applies the attention mechanism to investigate the significance of each region to make the results interpretable. It also takes a shift operation to guide the inspector agent to discover the next relevant region, so that the model sequentially loads small regions instead of the entire large graph, to solve the high dimensionality problem. The experiments conducted on standard graph datasets show the effectiveness of our g-Inspector in graph classification problems.
Zhiling Luo, Yinghua Cui, Sha Zhao, Jianwei Yin
IEEE Trans. Knowl. Data Eng.2
2010 A fast zero estimation scheme for RFID systems
Yinghua Cui, Yuping Zhao
Comput. Commun.1
2010 Performance evaluation of a multi-branch tree algorithm in RFID
abstract
Reading efficiency is one of the key factors to evaluate Radio Frequency Identification (RFID) systems. For the system using multi-branch protocols, the performance would be better if the tags are properly divided into multiple groups. This paper firstly gives the closed-form of system efficiency for binary tree algorithm. Based on the theoretical analysis, the optimal branches number is derived. An efficient multi-branch tree (EMBT) algorithm is proposed subsequently, along with a tag number estimation algorithm and performance evaluation. Both theoretical analysis and simulation results indicate that multi-branch tree algorithm has better performance than the conventional binary tree algorithm. System identification efficiency of the proposed method can achieve above 45%, while that of the binary tree algorithm is only 34.8%.
Yinghua Cui, Yuping Zhao
IEEE Trans. Commun.1
2008 Mathematical Analysis for Binary Tree Algorithm in RFID
abstract
The system efficiency is one of the key factors for RFID (Radio Frequency Identification) systems. This paper gives theoretical study on binary tree algorithm that is adopted by the international standard ISO 18000-6B. The close form for calculating system efficiency is derived. Simulation is performed and results agree with theoretical one. In addition, the simplified expression for very large tag number is also provided.
Yinghua Cui, Yuping Zhao
VTC Spring1