BACKGROUND AND PURPOSE MR imaging of moving patients can be challenging and motion correction techniques have been proposed though some have associated new artifacts. The objective of this study was to semiquantitatively compare brain MR images of moving patients obtained at 1.5T by using partially radial and rectilinear acquisition techniques. MATERIALS AND METHODS FLAIR, T2-, T1-, and contr...

Objective Voronoi diagrams are important in many fields in a series of sciences. Network Voronoi diagrams are useful to investigate dominance regions in a grid street system or a radial-circular street system. However, all generators may have different effect. To deal with a network Voronoi diagram with varied functions of generators, it must be worth formulating a power network Voronoi diagram...

Abstract. The universe of biochemical reactions in metabolic pathways can be modeled as a complex network structure augmented with domain specific annotations. Based on the functional properties of the involved reactions, metabolic networks are often clustered into so-called pathways inferred from expert knowledge. To support the domain expert in the exploration and analysis process, we follow ...

Given a rectilinear domain P of h pairwise-disjoint rectilinear obstacles with a total of n vertices in the plane, we study the problem of computing bicriteria rectilinear shortest paths between two points s and t in P. Three types of bicriteria rectilinear paths are considered: minimum-link shortest paths, shortest minimum-link paths, and minimum-cost paths where the cost of a path is a non-de...

We consider a setting where we are given a graph G = (R, E), where R = {R1, . . . , Rn} is a set of polygonal regions in the plane. Placing a point pi inside each region Ri turns G into an edge-weighted graph Gp , p = {p1, . . . , pn}, where the cost of (Ri, Rj) ∈ E is the distance between pi and pj . The Shortest Path Problem with Neighborhoods asks, for given Rs and Rt, to find a placement p ...

The fastest exact algorithm (in practice) for the rectilinear Steiner tree problem in the plane uses a two-phase scheme: First a small but suucient set of full Steiner trees (FSTs) is generated and then a Steiner minimum tree is constructed from this set by using simple backtrack search, dynamic programming or an integer programming formulation. FST generation methods can be seen as problem red...

The street garment vendors are playing a significant role in the fields of the economic development through protecting resources (garment products) from such a position where they are treated as wastes; very much less valued products and creating the opportunity for self-employment. This study aimed at showing the economic contribution and the impact of the street vendors to the local community...