One of the main features of High Throughput Computing systems is the availability of high power processing resources. Cloud Computing systems can offer these features through concepts like Pay-Per-Use and Quality of Service (QoS) over the Internet. Many applications in Cloud computing are represented by workflows. Quality of Service is one of the most important challenges in the context of sche...

We present a female patient with atypical chest pain who was referred to our department for ischemia evaluation. 99mTc-MIBI myocardial perfusion scan with dipyridamole stress was performed. Sub-diaphragmatic activity in the hepatic tissue and then in the bowel loops caused severe overlap on the inferior wall even on consecutive delayed images. Dipyridamole stress was repeated for the...

we present a female patient with atypical chest pain who was referred to our department for ischemia evaluation. 99mtc-mibi myocardial perfusion scan with dipyridamole stress was performed. sub-diaphragmatic activity in the hepatic tissue and then in the bowel loops caused severe overlap on the inferior wall even on consecutive delayed images. dipyridamole stress was repeated for the patient wi...

abstract: the research at hand discusses about the notion of the theme in persian scientific and literary genres from the point of view of halliday’s systemic functional grammar (sfg) and explains and determines the similarities and differences of the two genres in persian language. in this research, after mentioning the obvious differences of the two genres from the point of view of theme type...

Much previous work on Transliteration Mining (TM) was conducted on short parallel snippets using limited training data, and successful methods tended to favor recall. For such methods, increasing training data may impact precision and application on large comparable texts may impact precision and recall. We adapt a state-of-the-art TM technique with the best reported scores on the ACL 2010 NEWS...

We study the problem of maximizing the overlap of two convex polytopes under translation in R for some constant d ≥ 3. Let n be the number of bounding hyperplanes of the polytopes. We present an algorithm that, for any ε > 0, finds an overlap at least the optimum minus ε and reports the translation realizing it. The running time is O(n d/2 +1 log n) with probability at least 1 − n−O(1), which c...

In earlier versions of the community discovering problem, the overlap between communities was restricted by a simple count upperbound [17,5,11,8]. In this paper, we introduce the Π-Packing with α()Overlap problem to allow for more complex constraints in the overlap region than those previously studied. Let V be all possible subsets of vertices of V (G) each of size at most r, and α : V × V → {0...