Hand-drawn metro map illustrations often employ both internal and external labels in a way that they can assign enough information such as textual and image annotations to each landmark. Nonetheless, automatically tailoring the aesthetic layout of both textual and image labels together is still a challenging task, due to the complicated shape of the labeling space available around the metro net...

OBJECTIVE The aim of this study was to study the changes in occurrence of esophageal, stomach and colon cancers (cancers of interest) over the last 30 years in Iran. MATERIAL AND METHODS Cancer cases referred to two main cancer centers in the country (the Shiraz cancer center and the Tehran cancer center) during last 30 years and published by the two centers were utilized. Morbidity odds rati...

In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V,E) (e.g. the railroad network) and a set H of paths in G (e.g. the train lines), we want to draw the paths along the edges of G such that they cross each other as few times as possible. For aesthetic reasons we insist that the relative order of the paths that traverse a ve...

Examining the environmental risk sources of regional subway construction is crucial for ensuring safety and providing guidance future line planning. This study focused on Urumqi’s main urban area used SBAS-InSAR analysis technology to extract settlement rate field within 600 m Urumqi Metro Line 1 investigate these sources. Results showed that affecting in could be classified into four categorie...

Crossing minimization is one of the central problems in graph drawing. Recently, there has been an increased interest in the problem of minimizing crossings between paths in drawings of graphs. This is the metro-line crossing minimization problem (MLCM): Given an embedded graph and a set L of simple paths, called lines, order the lines on each edge so that the total number of crossings is minim...

In the metro-line crossing minimization problem, we are given a plane graph G = (V,E) and a set L of simple paths (or lines) that cover G, that is, every edge e ∈ E belongs to at least one path in L. The problem is to draw all paths in L along the edges of G such that the number of crossings between paths is minimized. This crossing minimization problem arises, for example, when drawing metro m...

IJVM (2013), 7(3):169-175 169 Bacterial contamination of dead-in-shell embryos in ostrich hatcheries and antimicrobial resistance patterns of isolated Escherichia coli Rezaei Far, A., Peighambari, S.M., Sadrzadeh, A., Askari Badouei, M. Department of Avian Diseases, Faculty of Veterinary Medicine, University of Tehran, Tehran, Iran Department of Clinical Sciences, Faculty of Veterinary Medicine...

Rail transit is developing rapidly in major cities of China and has become a key component of urban transport. Nevertheless, the security and reliability in operation are significant issues that cannot be neglected. In this paper, the network and station vulnerabilities of the urban rail transit system were analyzed based on complex network and graph theories. A vulnerability evaluation model w...