Search Results

Graph pattern mining (GPM) is an important problem in graph processing. There are many parallel frameworks for GPM, many of which suffer from low performance. GPU is a powerful option for accelerating graph processing, but parallel GPM algorithms ...

Graph Edit Distance (GED) is a classical measure of similarity between two graphs, defined as the minimum number of edit operations required to transform one graph into another. Given that computing the exact GED value is an NP-hard problem, ...

This article addresses the problem of observer-based fuzzy proportional-integral-derivative (PID) control for a class of nonlinear systems subject to degraded measurements and randomly perturbed sampling periods (RPSPs). In the existing results, the ...

Given a query graph, top-k subgraph matching finds up to k matches in a data graph with the highest scores according to a user-defined scoring function. It has wide applications across many fields, including knowledge graphs and social networks. Due to ...

Existing deep learning-based models for knowledge base question answering (KBQA) suffer from the high costs of adapting the system to disparate datasets in real-world scenarios (e.g., multi-tenant platform). In this paper, we present ADMUS, a ...

In designing a distributed RDF system, it is quite common to divide an RDF graph into subgraphs, called partitions, which are then distributed. Graph partitioning in general and RDF graph partitioning in particular are challenging problems. In ...

We propose to design vertex encoding for determinations of no-result edge queries that should not be executed. Edge query is one of the core operations in mainstream graph databases, which is to retrieve edges connecting two given vertices. Real-world ...

A regular path query (RPQ) returns node pairs connected by a path whose edge label sequence satisfies the given regular expression. Given a workload of RPQs, selecting the shared subqueries as materialized views to precompute offline can speed up the ...

Partitioning a large graph into smaller subgraphs by minimizing the number of cutting vertices and edges, namely cut size or replication factor, plays a crucial role in distributed graph processing tasks. However, many prior works have primarily focused ...

In this paper, the zonotopic non-fragile set-membership fusion estimation problem is investigated for multi-sensor nonlinear systems under sensor resolution effects. The sensor resolutions, which characterize the smallest change of signals that ...

• A zonotopic set-membership fusion estimation problem is investigated.
• Multi-sensor nonlinear systems under sensor resolution effects are studied.
• The sensor resolutions are considered to reflect the engineering practice.
• A ...

In this paper, a new distributed robust filtering problem is investigated for a class of discrete-time systems subject to parameter uncertainty over sensor networks under the event-based transmission mechanism, where the uncertainty in the target ...

In this article, the problem of observer-based fuzzy proportional–integral–derivative (PID) tracking control is studied for networked nonlinear systems subject to protocol constraints and norm-bounded noises. The nonlinear plant under ...

Regular path query (RPQ) is a basic operation for graph data analysis, and persistent RPQ in streaming graphs is a new-emerging research topic. In this paper, we propose a novel algorithm for persistent RPQ in streaming graphs, named LM-SRPQ. It solves ...

This article investigates the state estimation issue for a nonlinear networked system with network-based communication, where the measurement signals of the system are transmitted in an intermittent manner under the effects of unreliable communication. ...

Map matching of sparse vehicle trajectories is a fundamental problem in location-based services, such as traffic flow analysis and vehicle routing. Existing literature mainly relies on sequence-to-sequence (Seq2Seq) models to capture the <italic>intra-...

SimRank-based similarity joins, which mainly include threshold-based and top-k similarity joins, are important types of all-pair SimRank queries. Although a line of related algorithms have been proposed recently, they still fall short of providing ...

This article investigates the ultimately bounded proportional&#x2013;integral&#x2013;derivative (PID) control problem for a class of discrete-time Takagi&#x2013;Sugeno fuzzy systems subject to unknown-but-bounded noises and protocol constraints. The ...

In this article, we investigate the so-called <inline-formula><tex-math notation="LaTeX">$H_{\infty }$</tex-math></inline-formula> fuzzy proportional-integral observer (PIO) design problem for a class of nonlinear systems subject to relay effects, data ...

There is a growing interest to offload dynamic graph computation to GPU and resort to its high parallel processing ability and larger memory bandwidths compared with CPUs. The existing GPU graph systems usually use compressed sparse row (CSR) as the de-...

Due to the inherent hardness of subgraph isomorphism, the performance is often a bottleneck in various real-world applications. We address this by designing an efficient subgraph isomorphism algorithm leveraging features of GPU architecture. Existing GPU-...