936 research outputs found

    Solar System: Sifting through the debris

    Get PDF
    A quadrillion previously unnoticed small bodies beyond Neptune have been spotted as they dimmed X-rays from a distant source. Models of the dynamics of debris in the Solar System's suburbs must now be reworked.Comment: 3 pages, 1 figure; Nature News and Views on Chang et al. 2006, Nature, 442, 660-66

    Efficiently computing Top-K shortest path join

    Full text link
    © 2015, Copyright is with the authors. Driven by many applications, in this paper we study the problem of computing the top-k shortest paths from one set of target nodes to another set of target nodes in a graph, namely the top-k shortest path join (KPJ) between two sets of target nodes. While KPJ is an extension of the problem of computing the top-k shortest paths (KSP) between two target nodes, the existing technique by converting KPJ to KSP has several deficiencies in conducting the computation. To resolve these, we propose to use the best-first paradigm to recursively divide search subspaces into smaller subspaces, and to compute the shortest path in each of the subspaces in a prioritized order based on their lower bounds. Consequently, we only compute shortest paths in subspaces whose lower bounds are larger than the length of the current k-th shortest path. To improve the efficiency, we further propose an iteratively bounding approach to tightening lower bounds of subspaces. Moreover, we propose two index structures which can be used to reduce the exploration area of a graph dramatically; these greatly speed up the computation. Extensive performance studies based on real road networks demonstrate the scalability of our approaches and that our approaches outperform the existing approach by several orders of magnitude. Furthermore, our approaches can be immediately used to compute KSP. Our experiment also demonstrates that our techniques outperform the state-of-the-art algorithm for KSP by several orders of magnitude

    Scalable supergraph search in large graph databases

    Full text link
    © 2016 IEEE. Supergraph search is a fundamental problem in graph databases that is widely applied in many application scenarios. Given a graph database and a query-graph, supergraph search retrieves all data-graphs contained in the query-graph from the graph database. Most existing solutions for supergraph search follow the pruning-and-verification framework, which prunes false answers based on features in the pruning phase and performs subgraph isomorphism testings on the remaining graphs in the verification phase. However, they are not scalable to handle large-sized data-graphs and query-graphs due to three drawbacks. First, they rely on a frequent subgraph mining algorithm to select features which is expensive and cannot generate large features. Second, they require a costly verification phase. Third, they process features in a fixed order without considering their relationship to the query-graph. In this paper, we address the three drawbacks and propose new indexing and query processing algorithms. In indexing, we select features directly from the data-graphs without expensive frequent subgraph mining. The features form a feature-tree that contains all-sized features and both the cost sharing and pruning power of the features are considered. In query processing, we propose a verification-free algorithm, where the order to process features is query-dependent by considering both the cost sharing and the pruning power. We explore two optimization strategies to further improve the algorithm efficiency. The first strategy applies a lightweight graph compression technique and the second strategy optimizes the inclusion of answers. Finally, we conduct extensive performance studies on two real large datasets to demonstrate the high scalability of our algorithms

    Querying cohesive subgraphs by keywords

    Full text link
    © 2018 IEEE. Keyword search problem has been widely studied to retrieve related substructures from graphs for a keyword set. However, existing well-studied approaches aim at finding compact trees/subgraphs containing the keywords, and ignore a critical measure, density, to reflect how strongly and stablely the keyword nodes are connected in the substructure. In this paper, we study the problem of finding a cohesive subgraph containing the query keywords based on the k-Truss model, and formulate it as minimal dense truss search problem, i.e., finding minimal subgraph with maximum trussness covering the keywords. We first propose an efficient algorithm to find the dense truss with the maximum trussness containing keywords based on a novel hybrid KT-Index (Keyword-Truss Index). Then, we develop a novel refinement approach to extract the minimal dense truss based on the anti-monotonicity property of k-Truss. Experimental studies on real datasets show the outperformance of our method

    Optimal Enumeration: Efficient Top-k Tree Matching

    Full text link
    Driven by many real applications, graph pattern matching has attracted a great deal of attention recently. Consider that a twigpattern matching may result in an extremely large number ofmatches in a graph; this may not only confuse users by providing too many results but also lead to high computational costs. In this paper, we study the problem of top-k tree pattern matching; that is, given a rooted tree T, compute its top-k matches in a directed graph G based on the twig-pattern matching semantics. We firstly present a novel and optimal enumeration paradigm based on the principle of Lawler's procedure. We show that our enumeration algorithm runs in O(nT + log k) time in each round where nT is the number of nodes in T. Considering that the time complexity to output a match of T is O(nT) and nT = log k in practice, our enumeration technique is optimal. Moreover, the cost of generating top-1 match of T in our algorithm is O(mR) where mR is the number of edges in the transitive closure of a data graph G involving all relevant nodes to T. O(mR) is also optimal in the worst case without preknowledge of G. Consequently, our algorithm is optimal with the running time O(mR +k(nT +log k)) in contrast to the time complexity O(mR log k+knT (log k+dT)) of the existing technique where dT is the maximal node degree in T. Secondly, a novel priority based access technique is proposed, which greatly reduces the number of edges accessed and results in a significant performance improvement. Finally, we apply our techniques to the general form of top-k graph pattern matching problem (i.e., query is a graph) to improve the existing techniques. Comprehensive empirical studies demonstrate that our techniques may improve the existing techniques by orders of magnitude

    Field-free platform for Majorana-like zero mode in superconductors with a topological surface state

    Get PDF
    Superconducting materials exhibiting topological properties are emerging as an exciting platform to realize fundamentally new excitations from topological quantum states of matter. In this letter, we explore the possibility of a field-free platform for generating Majorana zero energy excitations by depositing magnetic Fe impurities on the surface of candidate topological superconductors, LiFeAs and PbTaSe2. We use scanning tunneling microscopy to probe localized states induced at the Fe adatoms on the atomic scale and at sub-Kelvin temperatures. We find that each Fe adatom generates a striking zero-energy bound state inside the superconducting gap, which do not split in magnetic fields up to 8 T, underlining a nontrivial topological origin. Our findings point to magnetic Fe adatoms evaporated on bulk superconductors with topological surface states for exploring Majorana zero modes and quantum information science under field-free conditions

    Delayed crystallization of ultrathin Gd2O3 layers on Si(111) observed by in situ X-ray diffraction

    Get PDF
    We studied the early stages of Gd2O3 epitaxy on Si(111) in real time by synchrotron-based, high-resolution X-ray diffraction and by reflection high-energy electron diffraction. A comparison between model calculations and the measured X-ray scattering, and the change of reflection high-energy electron diffraction patterns both indicate that the growth begins without forming a three-dimensional crystalline film. The cubic bixbyite structure of Gd2O3 appears only after a few monolayers of deposition
    • …
    corecore