A5079005365- Parallel Computing and Optimization Techniques
- Algorithms and Data Compression
- Advanced Data Storage Technologies
- Distributed and Parallel Computing Systems
- MicroRNA in disease regulation
- Pelvic floor disorders treatments
- Toxoplasma gondii Research Studies
- Herpesvirus Infections and Treatments
- Urinary Bladder and Prostate Research
- RNA Research and Splicing
- Infrastructure Maintenance and Monitoring
- Remote-Sensing Image Classification
- Genome Rearrangement Algorithms
- Sexual function and dysfunction studies
- Flood Risk Assessment and Management
- Genomics and Phylogenetic Studies
- Complexity and Algorithms in Graphs
- Circular RNAs in diseases
- Healthcare and Venom Research
The First People’s Hospital of Lianyungang
2024
Beijing Tian Tan Hospital
2021-2024
Capital Medical University
2021-2024
University of California, Riverside
2022-2023
Xidian University
2021
This paper studies parallel algorithms for the longest increasing subsequence (LIS) problem. Let $n$ be input size and $k$ LIS length of input. Sequentially, is a simple problem that can solved using dynamic programming (DP) in $O(n\log n)$ work. However, parallelizing long-standing challenge. We are unaware any algorithm has optimal work non-trivial parallelism (i.e., $\tilde{O}(k)$ or $o(n)$ span). proposes costs k)$ work, span, $O(n)$ space, much simpler than previous algorithms. also...
To design efficient parallel algorithms, some recent papers showed that many sequential iterative algorithms can be directly parallelized but there are still challenges in achieving work-efficiency and high-parallelism. Work-efficiency hard for certain problems where the number of dependences is asymptotically more than optimal work bound. achieve high-parallelism, we want to process as objects possible parallel. The goal $\tilde{O}(D)$ span a problem with deepest dependence length $D$. We...
Contraction Hierarchies (CH) (Geisberger et al., 2008) is one of the most widely used algorithms for shortest-path queries on road networks. Compared to Dijkstra's algorithm, CH enables orders magnitude faster query performance through a preprocessing phase, which iteratively categorizes vertices into hierarchies and adds shortcuts. However, constructing an expensive task. Existing solutions, including parallel ones, may suffer from long construction time. Especially in our experiments, we...
This paper studies parallel algorithms for the longest increasing subsequence (LIS) problem. Let $n$ be input size and $k$ LIS length of input. Sequentially, is a simple problem that can solved using dynamic programming (DP) in $O(n\log n)$ work. However, parallelizing long-standing challenge. We are unaware any algorithm has optimal work non-trivial parallelism (i.e., $\tilde{O}(k)$ or $o(n)$ span). proposes costs k)$ work, span, $O(n)$ space, much simpler than previous algorithms. also...
After a Hurricane, it is important to do damage assessment, and one way measure the find count damaged buildings manually. However, labor-intensive time-consuming process. To tackle this issue, paper proposed transfer learning model called Hurricane-Net1 based on ResNet50 Xception, which uses satellite imagery data classify between not damaged. obtain higher accuracy advanced generalization ability, bagging Hurricane-Net2 developed. The experimental results demonstrated that achieved 99.02%...