background: nickel–titanium (niti) rotary instrumentation carries a risk of fracture, mainly as a result of fl exural (fatigue fracture) and torsional (shear failure) stresses. this risk might be reduced by creating a glide path before niti rotary instrumentation. the aim of this study was to compare various root canal parameters with the new waveone single-fi le reciprocating system in mesial ...

In this paper, the longest Hamiltonian cycle problem and the longest Hamiltonian path problem are proved to be NPO-complete. @ 1998 Published by Elsevier Science B.V.

We consider the fair Hamiltonian cycle Maker-Breaker game, played on the edge set of the complete graph Kn on n vertices. It is known that Maker wins this game if n is sufficiently large. We are interested in the minimum number of moves needed for Maker in order to win the Hamiltonian cycle game, and in the smallest n for which Maker has a winning strategy for this game. We prove the following ...

Full-path indexing can improve I/O efficiency for workloads that operate on data organized using traditional, hierarchical directories, because data is placed on persistent storage in scan order. Prior results indicate, however, that renames in a local file system with fullpath indexing are prohibitively expensive. This paper shows how to use full-path indexing in a file system to realize fast ...

We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to find an odd sun when the method fails. This algorithm has several interesting consequences concerning the relationship between path graphs and directed path graphs. One is that for a directed path graph, path graph mode...

identification based on faces is still a useful method for many applications and face recognition developing is an active research field. in this paper, a novel face identification method is proposed. the proposed method (bridle path on gabor phase (bpgp)) is based on extracting texture patterns from phases of the gabor wavelet. also, in order to describe the textures, a novel texture descripto...

In this survey paper, we describe and characterize an extension to the classical path coupling method applied to statistical mechanical models, referred to as aggregate path coupling. In conjunction with large deviations estimates, we use this aggregate path coupling method to prove rapid mixing of Glauber dynamics for a large class of statistical mechanical models, including models that exhibi...

Computer vision systems require large amounts of manually annotated data to properly learn challenging visual concepts. Crowdsourcing platforms offer an inexpensive method to capture human knowledge and understanding, for a vast number of visual perception tasks. In this survey, we describe the types of annotations computer vision researchers have collected using crowdsourcing, and how they hav...

We consider edge-decompositions of regular graphs into isomorphic paths. An m-PPD (perfect path decomposition) is a decomposition of a graph into paths of length m such that every vertex is an end of exactly two paths. An m-PPDC (perfect path double cover) is a covering of the edges by paths of length m such that every edge is covered exactly two times and every vertex is an end of exactly two ...

The Median-Path problem consists of locating a path on a network, minimizing a function of two parameters: accessibility to the path and total cost of the path. Applications of this problem can be found in transportation planning, water resource management and fluid transportation. The Central-Path problem is defined similarly. In this paper, we give a construction on a graph G which produces a...