o bjective: to determine the etiology, signs and symptoms, angiography indications and angiography findings in patients with limb penetrating injuries suspected to have arterial injury. m e thods: this was a cross-sectional study being performed in imam reza hospital affiliated with mashhad university of medical sciences, iran between september 2011 and march 2013. we included those patients wi...

The best approximation problem in a hyperconvex metric space consists of finding conditions for given set-valued mappings F andG and a setX such that there is a point x0 ∈ X satisfying d G x0 , F x0 ≤ d x, F x0 for x ∈ X. When G I, the identity mapping, and when the set X is compact, best approximation theorems for mappings in hyperconvex metric spaces are given for the single-valued case in 1–...

Many algorithms have to deal with multiple representations of the same object. The process of aligning these representations is called registration. In this paper we present a new approach for the registration of free-form surfaces which is not based on finding closest points. Instead, our algorithm takes advantage of the graphics hardware and uses the depth buffer for determining the distance ...

The proximity relations inherent in triangulations of geometric data can be exploited in the implementation of nearest-neighbour search procedures. This is relevant to applications such as terrain analysis, cartography and robotics, in which triangulations may be used to model the spatial data. Here we describe neighbourhood search procedures within constrained Delaunay triangulations of the ve...

in this paper, using the best proximity theorems for an extensionof brosowski's theorem. we obtain other results on farthest points. finally, wedene the concept of e- farthest points. we shall prove interesting relationshipbetween the -best approximation and the e-farthest points in normed linearspaces (x; ||.||). if z in w is a e-farthest point from an x in x, then z is also a-best ...

K-nearest neighbor (KNN) is an effective nonparametric classifier that determines the neighbors of a point based only on distance proximity. The classification performance KNN disadvantaged by presence outliers in small sample size datasets and its deteriorates with class imbalance. We propose local Bonferroni Mean Fuzzy K-Nearest Centroid Neighbor (BM-FKNCN) assigns label query dependent neare...

This manuscript investigates if and how startups can utilize referral campaigns to increase Internet enabled software adoption. It is analyzed geographic proximity, tie strength status differences between referrer referee the sender’s network position impact adoption success. study complements a complete diffusion dataset of startup launching with user survey data on dyad characteristics. Using...

Hundreds of experiments over the last decade on the retrieval of OCR documents performed by the Information Science Research Institute have shown that OCR errors do not significantly affect retrievability. We extend those results to show that in the case of proximity searching, the removal of running headers and footers from OCR text will not improve retrievability for such searches.

Let X be an arrangement of n algebraic sets Xi in d-space, where the Xi are either parametrized or zero-sets of dimension 0 ≤ mi ≤ d − 1. We study a number of decompositions of d-space into connected regions in which the distance-squared function to X has certain invariances. Each region is contained in a single connected component of the complement of the bifurcation set B of the family of dis...

In order to retrieve best documents for finding answers, we developed a robust proximity search engine. It efficiently finds relevant passages. In addition, our search engine has two disjunction operators: or and or2. The former works just like addition, whereas the latter works just like logical disjunction. The operator or2 is used to introduce synonyms and antonyms of a query term. The searc...