PURPOSE To describe a model predicting endothelial cell (EC) loss after iris-fixated phakic intraocular lens (pIOL) implantation, taking distance from the edge of the pIOL to the endothelium into account. METHODS This prospective observational study monitored long-term EC changes in 306 eyes after pIOL implantation. EC density (ECD) was determined before surgery, 6 months after surgery, and t...

‎let $g=(v(g),e(g))$ be a simple connected graph with vertex set $v(g)$ and edge‎ ‎set $e(g)$‎. ‎the (first) edge-hyper wiener index of the graph $g$ is defined as‎: ‎$$ww_{e}(g)=sum_{{f,g}subseteq e(g)}(d_{e}(f,g|g)+d_{e}^{2}(f,g|g))=frac{1}{2}sum_{fin e(g)}(d_{e}(f|g)+d^{2}_{e}(f|g)),$$‎ ‎where $d_{e}(f,g|g)$ denotes the distance between the edges $f=xy$ and $g=uv$ in $e(g)$ and $d_{e}(f|g)=s...

This paper describes a technique for extracting moving targets and robustly tracking them from real time video sequence. It consists of two phases: Initial segmentation, temporal tracking and optimal paraimeter selection. After target detection subsequent tracking is based on a modified Canny edge detection and accelerated Hausdorff measure. The modified canny edge detection algorithm produces ...

Measurements were performed to assess the dose equivalent outside a primary proton treatment field, using a silicon-on-insulator (SOI) microdosimeter. The SOI microdosimeter was placed on the surface of an anthropomorphic phantom and dose equivalents were determined as a function of lateral distance from a typical passively scattered and modulated prostate treatment field. Measurements were als...

OBJECTIVES This study aimed to assess the relation between stent edge restenosis (SER) and the distance from the stent edge to the residual plaque using quantitative intravascular ultrasound. BACKGROUND Although percutaneous coronary intervention with drug-eluting stents has improved SER rates, determining an appropriate stent edge landing zone can be challenging in cases of diffuse plaque le...

Let G be a connected graph and S a nonempty set of vertices of G. Then the Steiner distance d,(S) of S is the smallest number of edges in a connected subgraph of G that contains S. Let k, I, s and m be nonnegative integers with m > s > 2 and k and I not both 0. Then a connected graph G is said to be k-vertex I-edge (s,m)-Steiner distance stable, if for every set S of s vertices of G with d,(S) ...

Shortest path computation is one of the most fundamental operations for managing and analyzing graphs. A number of methods have been proposed to answer shortest path distance queries on static graphs. Unfortunately, there is little work on answering distance queries on dynamic graphs, particularly graphs with edge failures. Today’s real-world graphs, such as the social network graphs and web gr...

The revision rate of large head metal-on-metal and resurfacing hips are significantly higher than conventional total hip replacements. The revision of these components has been linked to high wear caused by edge loading; which occurs when the head-cup contact patch extends over the cup rim. There are two current explanations for this; first, there is loss of entrainment of synovial fluid result...