PURPOSE Arterial spin labeling perfusion imaging (ASL-PI) is a non-invasive perfusion imaging method that can be used for evaluation and quantification of cerebral blood flow (CBF). Aim of our study was to evaluating the efficiency of ASL in histopathological grade estimation of glial tumors and comparing findings with dynamic susceptibility contrast perfusion imaging (DSC-PI) method. METHODS...

The purpose of this paper is to illustrate a general framework for network location problems, based on column generation and branch-andprice. In particular we consider capacitated network location problems with single-source constraints. We consider several different network location models, by combining cardinality constraints, fixed set-up costs, concentrator restrictions and regional constra...

Given a bipartite graph G = (S, T, E), the k-clustering Minimum Biclique Completion Problem (k-MinBCP) consists of finding k bipartite subgraphs (clusters), such that each vertex i of S appears in exactly one subgraph, every vertex j in T appears in each cluster in which at least one of its neighbors appears, and the total number of edges that would complete each subgraph into a complete bipart...

In this paper, a new guidance method for surface to surface ballistic missiles without mandatory engine cut-off will be presented. The complexity of solid fuel engine cut-off demands a comprehensive method for guiding these missiles. In the method presented in this paper, a certain guidance law is applied such that by transmitting appropriate commands to the control system, by changing the miss...

OBJECTIVES According to recent findings trauma and stress are important etiological factors in pathogenesis of depression. As characteristic features of depressive cognition have been reported intrusive thoughts and memory disturbances similar to posttraumatic symptoms known in patients with posttraumatic stress disorder or dissociative disorders. Hypothetically is also suggested a close relati...

Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generated dynamically throughout the search tree. The ability to handle constantly changing sets of cuts and variables allows these algorithms to undertake the solution of very large-scale DOPs; however, it also leads to int...