skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Towards shortest path identification on large networks

Authors:
;
Publication Date:
Sponsoring Org.:
USDOE
OSTI Identifier:
1256775
Grant/Contract Number:
4000144962
Resource Type:
Journal Article: Published Article
Journal Name:
Journal of Big Data
Additional Journal Information:
Journal Volume: 3; Journal Issue: 1; Related Information: CHORUS Timestamp: 2016-06-13 08:58:49; Journal ID: ISSN 2196-1115
Publisher:
Springer Science + Business Media
Country of Publication:
Country unknown/Code not available
Language:
English

Citation Formats

Selim, Haysam, and Zhan, Justin. Towards shortest path identification on large networks. Country unknown/Code not available: N. p., 2016. Web. doi:10.1186/s40537-016-0042-7.
Selim, Haysam, & Zhan, Justin. Towards shortest path identification on large networks. Country unknown/Code not available. doi:10.1186/s40537-016-0042-7.
Selim, Haysam, and Zhan, Justin. 2016. "Towards shortest path identification on large networks". Country unknown/Code not available. doi:10.1186/s40537-016-0042-7.
@article{osti_1256775,
title = {Towards shortest path identification on large networks},
author = {Selim, Haysam and Zhan, Justin},
abstractNote = {},
doi = {10.1186/s40537-016-0042-7},
journal = {Journal of Big Data},
number = 1,
volume = 3,
place = {Country unknown/Code not available},
year = 2016,
month = 6
}

Journal Article:
Free Publicly Available Full Text
Publisher's Version of Record at 10.1186/s40537-016-0042-7

Save / Share:
  • A technique for improving the efficiency of shortest path ray tracing (SPR) is presented. The authors analyze situations where SPR fails and provide quantitative measures to assess the performance of SPR ray tracing with varying numbers of nodes. Their improvements include perturbing the ray at interfaces according to Snell's Law, and a method to find correct rays efficiently in regions of low velocity contract. This approach allows the investigator to use fewer nodes in the calculation, thereby increasing the computational efficiency. In two-dimensional (2-D) cross-borehole experiments they find that with their improvements, they need only use 2/3 as many nodes,more » saving up to 60 percent in time. Savings should be even greater in three dimensions. These improvements make SPR more attractive for tomographic applications in three dimensions.« less
  • A partitioned, priority-queue algorithm for solving the single-source best-path problem is defined and evaluated. Finding single-source paths for sparse graphs is notable because of its definite lack of parallelism-no known algorithm are scalable. Qualitatively, they discuss the close relationship between the algorithm and previous work by Quinn, Chikayama, and others. Performance measurements of variations of the algorithm, implemented both in concurrent and imperative programming languages on a shared-memory multiprocessor, are presented. This quantitative analysis of the algorithms provides insights into the tradeoffs between complexity and overhead in graph-searching executed in high-level parallel languages with automatic task scheduling.
  • The shortest-path aggregation in a two-dimensional square lattice is studied numerically. We find universal behavior of the cluster formation when the released particles are weakly correlated, and a distinct universal behavior for clusters generated by a strongly correlated release. In particular, we find the fractal dimension {ital D}=1.20{plus minus}0.01 when the released particles are weakly correlated, while a one-dimensional object is obtained when the correlation is strong. We also find the anisotropic exponent {delta}=1.0 in the weak-correlation region.
  • To identify the disease gene in a large, multiplex family segregating an autosomal dominant form of idiopathic generalized epilepsy (IGE). The IGEs have been recognized for several decades as being genetically determined. However, large pedigrees with a clear Mendelian inheritance are not commonly available. This, and the presence of locus heterogeneity have been obstacles to the identification of linkage in several IGE syndromes. We have identified a large IGE kindred with fifty-eight living individuals, including 26 affecteds, showing a clear autosomal dominant inheritance with incomplete penetrance. Forty-fur informative individuals, including 23 affecteds, were selected for the linkage studies. We havemore » chosen 200 polymorphic microsatellite markers, about 20 cM apart, throughout the human autosomes as a genome-search linkage strategy. To date, 47 markers, representing 30% of the human genome, have been excluded for linkage in the Australian kindred. As our study progresses, we will report up-to-date results.« less