Lanjun Wan

Orcid: 0000-0001-7236-3589

According to our database1, Lanjun Wan authored at least 21 papers between 2014 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Solving Large-Scale Open Shop Scheduling Problem via Link Prediction Based on Graph Convolution Network.
Proceedings of the Advanced Intelligent Computing Technology and Applications, 2023

2022
A Novel Remaining Useful Life Prediction Method Based on CEEMDAN-IFTC-PSR and Ensemble CNN/BiLSTM Model for Cutting Tool.
IEEE Access, 2022

2021
An Adaptive Density-Sensitive Similarity Measure Based Spectral Clustering Algorithm and Its Parallelization.
IEEE Access, 2021

HCE: A Runtime System for Efficiently Supporting Heterogeneous Cooperative Execution.
IEEE Access, 2021

Efficient Inter-Device Task Scheduling Schemes for Multi-Device Co-Processing of Data-Parallel Kernels on Heterogeneous Systems.
IEEE Access, 2021

A Novel Bearing Fault Diagnosis Method Using Spark-Based Parallel ACO-K-Means Clustering Algorithm.
IEEE Access, 2021

An Improved PixelHop Framework and its Application in Rolling Bearing Fault Diagnosis.
IEEE Access, 2021

Rolling Bearing Fault Diagnosis Method Based on Parallel QPSO-BPNN Under Spark-GPU Platform.
IEEE Access, 2021

An Efficient Rolling Bearing Fault Diagnosis Method Based on Spark and Improved Random Forest Algorithm.
IEEE Access, 2021

Ensemble Pruning of RF via Multi-Objective TLBO Algorithm and Its Parallelization on Spark.
IEEE Access, 2021

2020
Rolling-Element Bearing Fault Diagnosis Using Improved LeNet-5 Network.
Sensors, 2020

Research on Fault Diagnosis of Wind Power Generator Blade Based on SC-SMOTE and kNN.
J. Inf. Process. Syst., 2020

2019
SSF: Sentence Similar Function Based on word3vector Similar Elements.
J. Inf. Process. Syst., 2019

2016
A novel cooperative accelerated parallel two-list algorithm for solving the subset-sum problem on a hybrid CPU-GPU cluster.
J. Parallel Distributed Comput., 2016

Efficient CPU-GPU cooperative computing for solving the subset-sum problem.
Concurr. Comput. Pract. Exp., 2016

Novel heuristic speculative execution strategies in heterogeneous distributed environments.
Comput. Electr. Eng., 2016

2015
A cost-optimal parallel algorithm for the 0-1 knapsack problem and its performance on multicore CPU and GPU implementations.
Parallel Comput., 2015

GPU implementation of a parallel <i>two-list</i> algorithm for the subset-sum problem.
Concurr. Comput. Pract. Exp., 2015

2014
Optimization of quasi-diagonal matrix-vector multiplication on GPU.
Int. J. High Perform. Comput. Appl., 2014

A Novel CPU-GPU Cooperative Implementation of A Parallel Two-List Algorithm for the Subset-Sum Problem.
Proceedings of the 2014 PPOPP International Workshop on Programming Models and Applications for Multicores and Manycores, 2014

Efficient Parallelization of a Two-List Algorithm for the Subset-Sum Problem on a Hybrid CPU/GPU Cluster.
Proceedings of the Sixth International Symposium on Parallel Architectures, 2014


  Loading...