نتایج جستجو برای: 3 step procedure
تعداد نتایج: 2480946 فیلتر نتایج به سال:
BACKGROUND/PURPOSE Bowel lengthening may be beneficial for children with short bowel syndrome. However, current techniques require at least one intestinal anastomosis and place the mesenteric blood supply at risk. This study seeks to establish the technical principles of a new, simple, and potentially safer bowel lengthening procedure. METHODS Young pigs (n = 6) underwent interposition of a r...
In a Step-down procedure, apart from an hierarchy of the component hypotheses (leading to the steps), one also needs to settle on, their individual levels of significnace (constrained on the overall one). The Fisher method of combining independent tests is extended to the step-down procedure and its Bahadur-efficiency and (asymptotic) optimality results are considered.
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the first step, we apply a slight variant of variational shape approximation in order to segment the input mesh into patches which capture the global structure of the processed object. Then we compute an optimized quad-mesh f...
In geometrical camera calibration the objective is to determine a set of camera parameters that describe the mapping between 3-0 reference coordinates and 2 0 image coordinates. Various methods for camera calibration can be found from the literature. Howevel; surprisingly little attention has been paid to the whole calibration procedure, i.e , control point extraction from images, model Jitting...
The detectability of planetesimal impacts on imaged exoplanets can be measured using Jupiter during the 1994 comet Shoemaker-Levy 9 events as a proxy. By integrating the whole planet flux with and without impact spots, the effect of the impacts at wavelengths from 2 4 μm is revealed. Jupiter’s reflected light spectrum in the near-infrared is dominated by its methane opacity including a deep ban...
In this paper, a new algorithm to solve the discrete logarithm problem is presented which is similar to the usual baby-step giant-step algorithm. Our algorithm exploits the order of the discrete logarithm in the multiplicative group of a finite field. Using randomization with parallelized collision search, our algorithm indicates some weakness in NIST curves over prime fields which are consider...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید