( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A fully decoupled numerical method for Cahn-Hilliard-Navier-Stokes-Darcy equations based on auxiliary variable approaches.

, , , и . J. Comput. Appl. Math., (января 2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Yali Gao

Yali Lu

Yali Liu

Yali Yuan

Yali Wang

 

Другие публикации лиц с тем же именем

Grouped pair-wise comparison for subjective sound quality evaluation, , , и . CHINESE JOURNAL OF ACOUSTICS, (2006)The Removal of Wall Components in Doppler Ultrasound Signals by Using the Empirical Mode Decomposition Algorithm., , , , и . IEEE Trans. Biomed. Eng., 54 (9): 1631-1642 (2007)A High Accuracy and Adaptive Anomaly Detection Model With Dual-Domain Graph Convolutional Network for Insider Threat Detection., , , , , , и . IEEE Trans. Inf. Forensics Secur., (2023)A weak Galerkin finite element method for a coupled Stokes-Darcy problem on general meshes., , , и . J. Comput. Appl. Math., (2018)A Crank-Nicolson discontinuous finite volume element method for a coupled non-stationary Stokes-Darcy problem., , , и . J. Comput. Appl. Math., (2019)Construction of Optimal Trees for Maximizing Aggregation Information in Deadline- and Energy-Constrained Unreliable Wireless Sensor Networks., , , и . IEEE Access, (2018)HinCTI: A Cyber Threat Intelligence Modeling and Identification System Based on Heterogeneous Information Network., , , , и . IEEE Trans. Knowl. Data Eng., 34 (2): 708-722 (2022)A Graph Convolution model considering label co-occurrence LC_GCN., , и . ACAI, стр. 23:1-23:6. ACM, (2020)Info-Trust: A Multi-Criteria and Adaptive Trustworthiness Calculation Mechanism for Information Sources., , , , и . IEEE Access, (2019)Distributed and Efficient Minimum-Latency Data Aggregation Scheduling for Multichannel Wireless Sensor Networks., , , и . IEEE Internet of Things Journal, 6 (5): 8482-8495 (2019)