Effects of raster terrain representation on GIS shortest path analysis

Spatial analysis extracts meaning and insights from spatially referenced data, where the results are highly dependent on the quality of the data used and the manipulations on the data when preparing it for analysis. Users should understand the impacts that data representations may have on their results in order to prevent distortions in their outcomes. We study the consequences of two common data preparations when locating a linear feature performing shortest path analysis on raster terrain data: 1) the connectivity of the network generated by connecting raster cells to their neighbors, and 2) the range of the attribute scale for assigning costs. Such analysis is commonly used to locate transmission lines, where the results could have major implications on project cost and its environmental impact. Experiments in solving biobjective shortest paths show that results are highly dependent on the parameters of the data representations, with exceedingly variable results based on the choices made in reclassifying attributes and generating networks from the raster. Based on these outcomes, we outline recommendations for ensuring geographic information system (GIS) data representations maintain analysis results that are accurate and unbiased.

Explore the Protective Role of Obesity in the Progression of Myocardial Infarction

Obesity has been shown as a risk factor to increase the incidence of myocardial infarction (MI). However, obesity has also been linked to the decreased mortality of acute MI with unknown mechanisms. Here, we firstly used large-scale literature data mining to identify obesity downstream targets and MI upstream regulators with polarity, based on which an obesity-MI regulatory network was constructed. Then, a gene set enrichment analysis was conducted to explore the functional profile of the genes involved in the obesity-MI regulatory networks. After that, a mega-analysis using MI RNA expression datasets was conducted to test the expression of obesity-specific genes in MI patients, followed by a shortest-path analysis to explore any potential gene-MI association. Our results suggested that obesity could inhibit 11 MI promoters, including NPPB, NPPA, IRS1, SMAD3, MIR155, ADRB1, AVP, MAPK14, MC3R, ROCK1, and COL3A1, which were mainly involved in blood pressure-related pathways. Our study suggested that obesity could influence MI progression by driving multiple genes associated with blood pressure regulation. Moreover, PTH could be a novel obesity driven gene associated with the pathogenesis of MI, which needs further validation.

The Depth-First Optimal Strategy Path Generation Algorithm for Passengers in a Metro Network

Passenger behavior analysis is a key issue in passenger assignment research, in which the path choice is a fundamental component. A highly complex transit network offers multiple paths for each origin–destination (OD) pair and thus resulting in more flexible choices for each passenger. To reflect a passenger’s flexible choice for the transit network, the optimal strategy was proposed by other researchers to determine passenger choice behavior. However, only strategy links have been searched in the optimal strategy algorithm and these links cannot complete the whole path. To determine the paths for each OD pair, this study proposes the depth-first path generation algorithm, in which a strategy node concept is newly defined. The proposed algorithm was applied to the Beijing metro network. The results show that, in comparison to the shortest path and the K-shortest path analysis, the proposed depth-first optimal strategy path generation algorithm better represents the passenger behavior more reliably and flexibly.

A Python Algorithm for Shortest-Path River Network Distance Calculations Considering River Flow Direction

Vector based shortest path analysis in geographic information system (GIS) is well established for road networks. Even though these network algorithms can be applied to river layers, they do not generally consider the direction of flow. This paper presents a Python 3.7 program (upstream_downstream_shortests_path_dijkstra.py) that was specifically developed for river networks. It implements multiple single-source (one to one) weighted Dijkstra shortest path calculations, on a list of provided source and target nodes, and returns the route geometry, the total distance between each source and target node, and the total upstream and downstream distances for each shortest path. The end result is similar to what would be obtained by an “all-pairs” weighted Dijkstra shortest path algorithm. Contrary to an “all-pairs” Dijkstra, the algorithm only operates on the source and target nodes that were specified by the user and not on all of the nodes contained within the graph. For efficiency, only the upper distance matrix is returned (e.g., distance from node A to node B), while the lower distance matrix (e.g., distance from nodes B to A) is not. The program is intended to be used in a multiprocessor environment and relies on Python’s multiprocessing package.