A5101862707- Graph Theory and Algorithms
- Interconnection Networks and Systems
- Algorithms and Data Compression
- Geophysics and Gravity Measurements
- Complexity and Algorithms in Graphs
- GNSS positioning and interference
- Parallel Computing and Optimization Techniques
- Caching and Content Delivery
- Bone and Joint Diseases
- Inertial Sensor and Navigation
- Dermatological and COVID-19 studies
- Advanced Algorithms and Applications
- Hematological disorders and diagnostics
- Cloud Computing and Resource Management
- Distributed and Parallel Computing Systems
- Advanced Sensor and Control Systems
- Web Data Mining and Analysis
- Data Management and Algorithms
- Oceanographic and Atmospheric Processes
- Infrared Thermography in Medicine
- Space Satellite Systems and Control
- Extracellular vesicles in disease
- Advanced Graph Neural Networks
- Stochastic Gradient Optimization Techniques
- Foot and Ankle Surgery
University of California, Riverside
2021-2025
Hunan University
2019-2024
Wuhan City Chinese Medicine Hospital
2013-2021
Huaihua University
2019
Zhongnan University of Economics and Law
2010
Institute of Refrigeration
2005
Shanghai Astronomical Observatory
2001-2004
Chinese Academy of Sciences
1999-2001
National Astronomical Observatories
2001
Coronavirus disease 2019 (COVID-19) is a disaster in human medical history and glucocorticoids remain the most promising therapy. Osteonecrosis caused by reduced intraosseous blood flow to bones joints, which will rapidly induce joint destruction. Approximately one-third patients with severe acute respiratory syndrome (SARS) who received high cumulative doses long treatment durations of occurred osteonecrosis. Considering similarity SARS COVID-19 on their pathogen, clinical characteristics,...
Abstract Exosomes were found to exert a therapeutic effect in the treatment of osteonecrosis femoral head (ONFH), while miR‐135b was shown play an important role development ONFH. In this study, we investigated effects concomitant administration exosomes and on A rat mode ONFH established. TEM, Western blotting nanoparticle analysis used characterize collected from human‐induced pluripotent stem cell–derived mesenchymal cells (hiPS‐MSC‐Exos). Micro‐CT observe trabecular bone structure head....
All major findings of the paper were reproduced. Unfortunately, due to privacy concerns, authors could not share their code on GitHub.
In this paper, we study the single-source shortest-path (SSSP) problem with positive edge weights, which is a notoriously hard in parallel context. practice, $\Delta$-stepping algorithm proposed by Meyer and Sanders has been widely adopted. However, no known worst-case bounds for general graphs. The performance of also highly relies on parameter $\Delta$. There have lots algorithms theoretical bounds, such as Radius-stepping, but they either implementations available or are much slower than...
Abstract This article describes an "absolute" calibration of TOPEX/POSEIDON (T/P) altimeter bias using UK tide gauges equipped with Global Positioning System (GPS) receivers. The method is extension earlier work the Newhaven gauge in English Channel. However, present analysis extends research to a number around and incorporates several improvements. time-averaged TOPEX POSEIDON biases are obtained precision approximately 2 3 cm, respectively. complements on determination by other groups T/P...
Computing strongly connected components (SCC) is among the most fundamental problems in graph analytics. Given large size of today's real-world graphs, parallel SCC implementation increasingly important. challenging setting and particularly hard on large-diameter graphs. Many existing implementations can be even slower than Tarjan's sequential algorithm To tackle this challenge, we propose an efficient using a new reachability approach. Our solution based novel idea referred to as vertical...
This article describes an "absolute" calibration of Jason-1 (J-1) altimeter sea surface height bias using a method developed for TOPEX/Poseidon (T/P) determination reported previously. The makes use U.K. tide gauges equipped with Global Positioning System (GPS) receivers to measure heights at the same time, and in geocentric reference frame, as altimetric recorded nearby ocean. main time-dependent components observed altimeter-minus-gauge height-difference time series are due slightly...
Integer sorting is a fundamental problem in computer science. This paper studies parallel integer sort both theory and practice. In theory, we show tighter bounds for class of existing practical algorithms, which provides solid theoretical foundation their widespread usage practice strong performance. practice, design new algorithm, DovetailSort, that theoretically-efficient has good
In this paper, we introduce PASGAL (Parallel And Scalable Graph Algorithm Library), a parallel graph library that scales to variety of types, many processors, and large sizes. One special focus is the efficiency on \textit{large-diameter graphs}, which common challenge for existing processing systems: systems can be even slower than standard sequential algorithm large-diameter graphs due lack parallelism. Such performance degeneration caused by high overhead in scheduling synchronizing...
Biconnectivity is one of the most fundamental graph problems. The canonical parallel biconnectivity algorithm Tarjan-Vishkin algorithm, which has $O(n+m)$ optimal work (number operations) and polylogarithmic span (longest dependent on a with $n$ vertices $m$ edges. However, not widely used in practice. We believe reason space-inefficiency (it generates an auxiliary $O(m)$ edges). In practice, existing implementations are based breath-first search (BFS). Since BFS proportional to diameter...
In this paper, we propose a parallel strongly connected components (SCC) implementation that is efficient on wide range of graphs. Our speedup comes from two novel techniques: vertical granularity control (VGC) and hash bag.
Semisort is a fundamental algorithmic primitive widely used in the design and analysis of efficient parallel algorithms. It takes input as an array records function extracting \emph{key} per record, reorders them so that with equal keys are contiguous. Since many applications only require collecting values, but not fully sorting input, semisort broadly applicable, e.g., string algorithms, graph analytics, geometry processing, among other domains. However, despite dozens recent papers use...
Given two strings $A[1..n]$ and $B[1..m]$, a set of operations allowed to edit the strings, distance between $A$ $B$ is minimum number required transform into $B$. Sequentially, standard Dynamic Programming (DP) algorithm solves with $\Theta(nm)$ cost. In many real-world applications, be compared are similar have small distances. To achieve highly practical implementations, we focus on output-sensitive parallel edit-distance algorithms, i.e., asymptotically better cost bounds than when...
Integer sorting is a fundamental problem in computer science. This paper studies parallel integer sort both theory and practice. In theory, we show tighter bounds for class of existing practical algorithms, which provides solid theoretical foundation their widespread usage practice strong performance. practice, design new algorithm, \textsf{DovetailSort}, that theoretically-efficient has good particular, \textsf{DovetailSort} overcomes common challenge the difficulty detecting taking...
Computing a Single-Linkage Dendrogram (SLD) is key step in the classic single-linkage hierarchical clustering algorithm. Given an input edge-weighted tree $T$, SLD of $T$ binary dendrogram that summarizes $n-1$ clusterings obtained by contracting edges order weight. Existing algorithms for computing all require $\Omega(n\log n)$ work where $n = |T|$. Furthermore, to best our knowledge no prior provides parallel algorithm obtaining non-trivial speedup this problem. In paper, we design faster...
A fundamental building block in any graph algorithm is a container - data structure used to represent the graph. Ideally, enables efficient access underlying graph, has low space usage, and supports updating efficiently. In this paper, we conduct an extensive empirical evaluation of containers designed support running algorithms on large graphs. To our knowledge, first apples-to-apples comparison rather than overall systems, which include confounding factors such as differences...
A fundamental building block in any graph algorithm is a container - data structure used to represent the graph. Ideally, enables efficient access underlying graph, has low space usage, and supports updating efficiently. In this paper, we conduct an extensive empirical evaluation of containers designed support running algorithms on large graphs. To our knowledge, first apples-to-apples comparison rather than overall systems, which include confounding factors such as differences...
The rapid progress in biomedical imaging technology has generated considerable interest new non-invasive photoacoustic endoscopy techniques. This emerging offers significant benefits, including high spectral specificity, strong tissue penetration, and real-time multidimensional high-resolution capabilities, which enhance clinical diagnosis treatment of prostate cancer. paper delivers a thorough review current cancer screening techniques, the core principles imaging, latest research on its...
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...