No abstract

No abstract

No abstract

No abstract

Given a graph G and a vertex q ∈ G, the community search (CS) problem aims to efficiently find a subgraph of G whose vertices are closely related to q. Communities are prevalent in social and biological networks, and can be used in product advertisement and social event recommendation. In this paper, we study profiled community search (PCS), where CS is performed on a profiled graph. This is a graph in which each vertex has labels arranged in a hierarchical manner. Extensive experiments show that PCS can identify communities with themes that are common to their vertices, and is more effective than existing CS approaches. As a naive solution for PCS is highly expensive, we have also developed a tree index, which facilitate efficient and online solutions for PCS.

No abstract

The behavior of liquids in two-dimensional (2-D) graphene oxide (GO) nanopores is important for developing GObased nanoscience and nanofluidics. Herein, molecular dynamics simulation was carried out to study the equilibrium structures and shear viscosity for water and ethanol confined within 2-D GO nanochannels. It was observed that both species obviously exhibit structured features near GO surfaces. The confined viscosities are anisotropic with axial shear viscosity larger than vertical viscosity. The axial shear viscosities of water and ethanol are greatly enhanced for the 2-D GO nanochannels, wherein the viscosity features a decreased pattern with the pore width. Compared with water molecules, the confinement of GO channels has more effect on the viscosity of ethanol molecules. The confined shear viscosity can be described by combining contributions of the interfacial layer viscosity and the bulk-like viscosity. The influences of oxidation degrees and pore widths on the structure and transport properties have been systematically investigated, in which the interlayer viscosity is the critical determining factor. The confined structures and surface interaction were applied to interpret the transport properties of confined liquids. The enhanced interfacial layer viscosity can be attributed to the surface hydrogen-bonding interaction arising from the oxygen-containing functional groups.

Given a graph G and a query vertex q, the topic of community search (CS), aiming to retrieve a dense subgraph of G containing q, has gained much attention. Most existing works focus on undirected graphs which overlooks the rich information carried by the edge directions. Recently, the problem of community search over directed graphs (or CSD problem) has been studied [Fang et al., 2019b]; it finds a connected subgraph containing q, where the in-degree and out-degree of each vertex within the subgraph are at least k and l, respectively. However, existing solutions are inefficient, especially on large graphs. To tackle this issue, in this paper we propose a novel index called D-Forest, which allows a CSD query to be completed within the optimal time cost. We further propose efficient index construction methods. Extensive experiments on six real large graphs show that our index-based query algorithm is up to two orders of magnitude faster than existing solutions.