The edges of an image define the image boundary. When the image is noisy, it does not become easy to identify the edges. Therefore, a method requests to be developed that can identify edges clearly in a noisy image. Many methods have been proposed earlier using filters, transforms and wavelets with Ant colony optimization (ACO) that detect edges. We here used ACO for edge detection of noisy ima...

Let G=(V(G),E(G)) be a connected simple undirected graph with non empty vertex set V(G) and edge set E(G). For a positive integer k, by an edge irregular total k-labeling we mean a function f : V(G)UE(G) --> {1,2,...,k} such that for each two edges ab and cd, it follows that f(a)+f(ab)+f(b) is different from f(c)+f(cd)+f(d), i.e. every two edges have distinct weights. The minimum k for which G ...

A 55-year-old male patient presented with an acute myocardial infarction. A sirolimus-eluting stent (SES) was implanted in the proximal left anterior descending artery (LAD). Eight months later, there was a newly developed distal LAD lesion. An additional SES was implanted. Twenty-eight months after the index procedure of primary coronary intervention, the electrocardiogram showed ST elevation ...

Rev Esp Cardiol. 2009;62(5):576-88 587 of the distal circumflex artery, severe stenosis of the first marginal artery and slightly reduced left ventricular ejection fraction. A percutaneous coronary intervention was also performed during the procedure. After the deobstruction and first dilation with balloon of the distal circumflex, the patient began to feel chest pain and an angiograph showed a...

The vertex version of detour index was defined during the works on connected graph in chemistry. The edge versions of detour index have been introduced ecently. In this paper, the explicit relations among edge versions of detour index have been declared and due to these relations, we compute the edge detour indices for some well-known graphs.

The edge version of Szeged index and vertex version of PI index are defined very recently. They are similar to edge-PI and vertex-Szeged indices, respectively. The different versions of Szeged and PIindices are the most important topological indices defined in Chemistry. In this paper, we compute the edge-Szeged and vertex-PIindices of some important classes of benzenoid systems.

we find recursive formulae for the number of perfect matchings in a graph g by splitting g into subgraphs h and q. we use these formulas to count perfect matching of p hypercube qn. we also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in g, is the graph constructed from by deleting edges with an en...

OBJECTIVE Sharp division of the A1 pulley is a time-honored technique for the treatment of flexor tendon entrapment; however, this procedure is not without complications. The anatomy of the A1 pulley system has been carefully investigated. Knowledge of superficial anatomic landmarks can assist with demarcating the distal edge of the A1 pulley and prevent damage to the critical A2 pulley. METH...

AIM To review current literature on types of distal triceps injury and determine diagnosis and appropriate management. METHODS We performed a systematic review in PubMed, Cochrane and EMBASE using the terms distal triceps tears and snapping triceps on the 10th January 2017. We excluded all animal, review, foreign language and repeat papers. We reviewed all papers for relevance and of the pape...