A5101406699- Graph Theory and Algorithms
- Advanced Graph Neural Networks
- Parallel Computing and Optimization Techniques
- Cloud Computing and Resource Management
- Model-Driven Software Engineering Techniques
- Caching and Content Delivery
- Advanced Data Storage Technologies
- Distributed systems and fault tolerance
- Software Engineering Research
- Robotic Path Planning Algorithms
- Digital Image Processing Techniques
- Geoscience and Mining Technology
- Mobile Crowdsensing and Crowdsourcing
- Control and Dynamics of Mobile Robots
- Advanced Decision-Making Techniques
- Human Mobility and Location-Based Analysis
- Mobile and Web Applications
- Interconnection Networks and Systems
- Atmospheric and Environmental Gas Dynamics
- Software Testing and Debugging Techniques
- Logic, programming, and type systems
- Smart Parking Systems Research
- Distributed and Parallel Computing Systems
- Service-Oriented Architecture and Web Services
- Point processes and geometric inequalities
Wuhan University of Science and Technology
2022
China University of Petroleum, East China
2021
National Institute of Informatics
2016-2020
The Graduate University for Advanced Studies, SOKENDAI
2016-2020
Nanyang Polytechnic
2018
Shanghai Jiao Tong University
2013-2015
Fueled by the widespread adoption of sensor-enabled smartphones, mobile crowdsourcing is an area rapid innovation. Many crowd-powered sensor systems are now part our daily life -- for example, providing highway congestion information. However, participation in these can easily expose users to a significant drain on already limited battery resources. For instance, energy burden sampling certain sensors (such as WiFi or GPS) quickly accumulate levels unwilling bear. Crowd system designers must...
With the rapid expansion of data storages and increasing risk failures, triple Disk Failure Tolerant arrays (3DFTs) become popular widely used. They achieve high fault tolerance via erasure codes. One class codes called Maximum Distance Separable (MDS) codes, which aims to offer protection with minimal storage overhead, is a typical choice enhance reliability systems. However, existing 3DFTs based on MDS are inefficient in terms update complexity, results poor write performance. In this...
Graphs play a key role in data analytics. and the software systems used to work with them are highly diverse. Algorithms interact hardware different ways which graph solution works best on given platform changes structure of graph. This makes it difficult decide programming framework is for situation. In this paper, we try make sense diverse landscape. We evaluate five frameworks analytics: SuiteS-parse GraphBLAS, Galois, NWGraph library, Graph Kernel Collection, GraphIt. use GAP Benchmark...
This paper presents a practical study of Time-Elastic-Band (TEB) path planner for driverless vehicle autoparking. TEB is dynamic optimization that can plan subject to vehicle's kinematic constraints. Since the basic form algorithm cannot generate desired trajectory an autonomous auto-parking, we propose two-stage planning method integrating navigation and auto-parking seamlessly. After generated by planner, adopt two PID controllers (accelerator brake) with hysteresis velocity control. We...
Language designers usually need to implement parsers and printers. Despite being two intimately related programs, in practice they are often designed separately, then be revised kept consistent as the language evolves. It will more convenient if parser printer can unified developed one single program, with their consistency guaranteed automatically.
In large storage systems, erasure codes is a primary technique to provide high reliability with low monetary cost. Among various codes, major category called XORbased uses purely XOR operations generate redundant data and offer computational complexity. These are conventionally implemented via matrix based method or several specialized non-matrix methods. However, these approaches insufficient on decoding performance, which affects the availability of systems. To address problem, in this...
Pregel is a popular distributed computing model for dealing with large-scale graphs. However, it can be tricky to implement graph algorithms correctly and efficiently in Pregel's vertex-centric model, especially when the algorithm has multiple computation stages, complicated data dependencies, or even communication over dynamic internal structures. Some domain-specific languages (DSLs) have been proposed provide more intuitive ways algorithms, but due lack of support remote access ---...
This paper presents a new distributed-memory algorithm called FastSV for finding connected components in an undirected graph. Our simplifies the classic Shiloach-Vishkin and employs several novel efficient hooking strategies faster convergence. We map different steps of to linear algebraic operations implement them with help scalable graph libraries. uses sparse avoid redundant work optimized MPI communication bottlenecks. The resultant shows high-performance scalability as it can find...
Pregel's vertex-centric model allows us to implement many interesting graph algorithms, where optimization plays an important role in making it practically useful. Although optimizations have been developed for dealing with different performance issues, is hard compose them together optimize complex we deal multiple issues at the same time. In this paper, propose a new approach composing optimizations, by use of channel interface, as replacement message passing and aggregator mechanism,...
Pregel's vertex-centric model allows us to implement many interesting graph algorithms, where optimization plays an important role in making it practically useful. Although optimizations have been developed for dealing with different performance issues, is hard compose them together optimize complex we deal multiple issues at the same time. In this paper, propose a new approach composing optimizations, by use of \emph{channel} interface, as replacement message passing and aggregator...
We prove a conjecture of Bernstein that the superconvexity heat kernel on hyperbolic space holds in all dimensions and, hence, there is an analog Huisken's monotonicity formula for mean curvature flow dimensions.
According to the Outer Space Treaty of United Nations, "Space exploration shall be common domain all mankind," and mankind should share outer space resources. With continuous advancement science technology, gap in comprehensive strength between countries is increasing, there a acquisition resources countries. In order measure fair distribution this resource, we quantify fairness formulate relevant policies by collecting data build model.