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

Yihao Yan

dblp:269/9604 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
3since 2021 · last 2024
—ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 3 since 2021Software engineering, systems software and programming languages · 1Theory 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
Automated reasoning and model checking · 56% Automata and formal languages · 28% Logic in computer science · 17%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages › omega-automata
büchi automata
0.412020
Action-Based Model Checking: Logic, Automata, and Reduction · CAV (2) 2020
Automated reasoning and model checking
model checking
0.412020
Action-Based Model Checking: Logic, Automata, and Reduction · CAV (2) 2020
Automated reasoning and model checking › model checking › state space reduction
partial order reduction
0.412020
Action-Based Model Checking: Logic, Automata, and Reduction · CAV (2) 2020
Logic in computer science › temporal logic
linear temporal logic
0.112020
Action-Based Model Checking: Logic, Automata, and Reduction · CAV (2) 2020
Logic in computer science
temporal logic
0.112020
Action-Based Model Checking: Logic, Automata, and Reduction · CAV (2) 2020

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

partial order reduction · 0.4automata transformation · 0.4
YearPublicationVenuePosition
2024 Multilevel Laser-Induced Pain Measurement with Wasserstein Generative Adversarial Network - Gradient Penalty Model
abstract
Pain is an experience of unpleasant sensations and emotions associated with actual or potential tissue damage. In the global context, billions of people are affected by pain disorders. There are particular challenges in the measurement and assessment of pain, and the commonly used pain measuring tools include traditional subjective scoring methods and biomarker-based measures. The main tools for biomarker-based analysis are electroencephalography (EEG), electrocardiography and functional magnetic resonance. The EEG-based quantitative pain measurements are of immense value in clinical pain management and can provide objective assessments of pain intensity. The assessment of pain is now primarily limited to the identification of the presence or absence of pain, with less research on multilevel pain. High power laser stimulation pain experimental paradigm and five pain level classification methods based on EEG data augmentation are presented. First, the EEG features are extracted using modified S-transform, and the time-frequency information of the features is retained. Based on the pain recognition effect, the 20-40[Formula: see text]Hz frequency band features are optimized. Afterwards the Wasserstein generative adversarial network with gradient penalty is used for feature data augmentation. It can be inferred from the good classification performance of features in the parietal region of the brain that the sensory function of the parietal lobe region is effectively activated during the occurrence of pain. By comparing the latest data augmentation methods and classification algorithms, the proposed method has significant advantages for the five-level pain dataset. This research provides new ways of thinking and research methods related to pain recognition, which is essential for the study of neural mechanisms and regulatory mechanisms of pain.
Jiancai Leng, Jianqun Zhu, Yihao Yan, Yitai Lou, Yanbing Liu 0009, Licai Gao, Tianzheng He, Qingbo Yang, Chao Feng 0003, Dezheng Wang, Yang Zhang 0111, Fangzhou Xu
Int. J. Neural Syst.3
2023 Self-Supervised EEG Representation Learning with Contrastive Predictive Coding for Post-Stroke Patients
abstract
Stroke patients are prone to fatigue during the EEG acquisition procedure, and experiments have high requirements on cognition and physical limitations of subjects. Therefore, how to learn effective feature representation is very important. Deep learning networks have been widely used in motor imagery (MI) based brain-computer interface (BCI). This paper proposes a contrast predictive coding (CPC) framework based on the modified s-transform (MST) to generate MST-CPC feature representations. MST is used to acquire the temporal-frequency feature to improve the decoding performance for MI task recognition. EEG2Image is used to convert multi-channel one-dimensional EEG into two-dimensional EEG topography. High-level feature representations are generated by CPC which consists of an encoder and autoregressive model. Finally, the effectiveness of generated features is verified by the k-means clustering algorithm. It can be found that our model generates features with high efficiency and a good clustering effect. After classification performance evaluation, the average classification accuracy of MI tasks is 89% based on 40 subjects. The proposed method can obtain effective feature representations and improve the performance of MI-BCI systems. By comparing several self-supervised methods on the public dataset, it can be concluded that the MST-CPC model has the highest average accuracy. This is a breakthrough in the combination of self-supervised learning and image processing of EEG signals. It is helpful to provide effective rehabilitation training for stroke patients to promote motor function recovery.
Fangzhou Xu, Yihao Yan, Jianqun Zhu, Licai Gao, Yanbing Liu 0009, Weiyou Shi, Yitai Lou, Wei Wang 0504, Jiancai Leng, Yang Zhang 0111
Int. J. Neural Syst.2
2022 Deep Convolution Generative Adversarial Network-Based Electroencephalogram Data Augmentation for Post-Stroke Rehabilitation with Motor Imagery
abstract
The motor imagery brain-computer interface (MI-BCI) system is currently one of the most advanced rehabilitation technologies, and it can be used to restore the motor function of stroke patients. The deep learning algorithms in the MI-BCI system require lots of training samples, but the electroencephalogram (EEG) data of stroke patients is quite scarce. Therefore, the expansion of EEG data has become an important part of stroke clinical rehabilitation research. In this paper, a deep convolution generative adversarial network (DCGAN) model is proposed to generate artificial EEG data and further expand the scale of the stroke dataset. First, multichannel one-dimensional EEG data is converted into a two-dimensional EEG spectrogram using EEG2Image based on the modified S-transform. Then, DCGAN is used to artificially generate EEG data based on MI. Finally, the validity of the generated artificial EEG data is proved. This paper preliminarily indicates that generating artificial stroke data is a promising strategy, which contributes to the further development of stroke clinical rehabilitation.
Fangzhou Xu, Gege Dong, Qingbo Yang, Lei Wang 0060, Yanna Zhao, Yihao Yan, Jinzhao Zhao, Shaopeng Pang, Dongju Guo, Jiancai Leng
Int. J. Neural Syst.7
2020 Action-Based Model Checking: Logic, Automata, and Reduction
abstract
Stutter invariant properties play a special role in state-based model checking: they are the properties that can be checked using partial order reduction (POR), an indispensable optimization. There are algorithms to decide whether an LTL formula or Büchi automaton (BA) specifies a stutter-invariant property, and to convert such a BA to a form that is appropriate for on-the-fly POR-based model checking. The interruptible properties play the same role in action-based model checking that stutter-invariant properties play in the state-based case. These are the properties that are invariant under the insertion or deletion of “invisible” actions. We present algorithms to decide whether an LTL formula or BA specifies an interruptible property, and show how a BA can be transformed to an interrupt normal form that can be used in an on-the-fly POR algorithm. We have implemented these algorithms in a new model checker named McRERS , and demonstrate their effectiveness using the RERS 2019 benchmark suite.
Stephen F. Siegel, Yihao Yan
CAV (2)2