A scalable, reusable, and broad-coverage unified material knowledge representation shows its importance and will bring great benefits to data sharing among materials communities. A knowledge graph (KG) for materials terminology, which is a formal collection of term entities and relationships, is conceptually important to achieve this goal. In this work, we propose a KG for materials terminology, named Materials Genome Engineering Database Knowledge Graph (MGED-KG), which is automatically constructed from text corpus via natural language processing. MGED-KG is the most comprehensive KG for materials terminology in both Chinese and English languages, consisting of 8,660 terms and their explanations. It encompasses 11 principal categories, such as Metals, Composites, Nanomaterials, each with two or three levels of subcategories, resulting in a total of 235 distinct category labels. For further application, a knowledge web system based on MGED-KG is developed and shows its great power in improving data sharing efficiency from the aspects of query expansion, term, and data recommendation.

The trip graph, which can model the residents’ taxi demands, consists of vertices used to indicate trips and edges used to indicate the follow-up relationships between trips. A trip $$v_j$$v j is a tight follow-up trip of another trip $$v_i$$v i , if a taxi can arrive at the departure location of $$v_j$$v j within a time threshold $$\delta$$δ after it finishes $$v_i$$v i . However, for big cities, there are a large amount of trips every day and it is time consuming to construct a trip graph. In this paper, we propose efficient algorithms to construct trip graphs for big cities. When constructing a trip graph, the most expensive step is to connect the vertices if the tight follow-up relationships exist. To find out the tight follow-up trips fast, we design an index considering both spatial and temporal constraints. To designate appropriate search areas, we propose efficient methods to determine the distance-based search areas and the traffic-based search areas. We conduct experiments on real datasets, i.e., the taxi trajectories of Shanghai in 2015. The experimental results show that our algorithm can construct the trip graph about 40 times faster than the straightforward method. We also demonstrate the usages of the trip graph in green transportation applications, i.e., the minimum fleet analysis and the minimum total “idle” mileage analysis.

In this paper, we propose the fine-grained geospatial knowledge graph (FineGeoKG), which can capture the neighboring relations between geospatial objects. We call such neighboring relations strong geospatial relations (SGRs) and define six types of SGRs. In FineGeoKG, the vertices (or entities) are geospatial objects. The edges (or relations) can have “sgr” labels together with properties, which are used to quantify SGRs in both topological and directional aspects. FineGeoKG is different from WorldKG, Yago2Geo, and other existing geospatial knowledge graphs, since its edges can capture the spatial coherence among geospatial objects. To construct FineGeoKG efficiently, the crucial problem is to find out SGRs. We improve the existing geospatial interlinking algorithm in order to find out SGRs faster. To answer SGR queries efficiently, we design an index to organize the SGR edges and improve the binary join method for subgraph matching. We conduct experiments on the real datasets and the experimental results show that the proposed algorithm is more efficient than the baseline algorithms. We also demonstrate the usefulness of FineGeoKG by presenting the results of complicated spatial queries which focus on structural and semantic information. Such queries can help researchers (for example, ecologists) find groups of objects following specific spatial patterns.

Ride-hailing platforms allow people to request rides, but sometimes they do not respond quickly enough. Due to the complex urban transportation system and the large geographical area of the city, the imbalance between supply and demand becomes a common problem. To solve this problem, many studies have proposed taxi repositioning methods. However, each of two mainstream methods (region-based and taxi-based) has its own advantages and disadvantages. In this paper, we propose the RSTR model, which is a two-layer model that takes advantages of the two mainstream methods. We model the problem as a partially observable Markov decision process and design the optimization objective. To generate more accurate repositioning strategies and improve model training outcomes, we propose a many-to-many scheduling mode and demonstrate its effectiveness. Extensive experiments on real-world datasets show that RSTR can effectively balance supply and demand and outperform other baseline methods.