نتایج جستجو برای: distance method
تعداد نتایج: 1822000 فیلتر نتایج به سال:
The accuracy of driving test systems is very important. Aiming at the content and characteristics subject II examination items, we studied distance measurement items methods field system, in system. results show that method this paper can realize accurate judgment providing technical support for detection ensure fairness justice test.
The cosmic distance duality relation (DDR) is constrained from the combination of type-Ia supernovae (SNe Ia) and strong gravitational lensing (SGL) systems using deep learning method. To make use full SGL data, we reconstruct luminosity SNe Ia up to highest redshift learning, then it compared with angular diameter obtained SGL. Considering influence lens mass profile, constrain possible violat...
All algorithms for impedance calculation use an analog-to-digital converter. The high accuracy of the impedance seen by a distance relay is an important factor in the correct isolation of the faulty part of power systems. To achieve this, a novel
technique based on third order interpolation is used in this paper. According to this technique, the times and the values of the obtained samples a...
the quantitative analysis of cardiac motions in echocardiography images is a noteworthy issue in processing of these images. cardiac motions can be estimated by optical flow (of) computation in different regions of image which is based on the assumption that the intensity of a moving pattern remains constant in consecutive frames. however, in echocardiographic sequences this assumption may be v...
Fuzzy measures are suitable in analyzing human subjective evaluation processes. Several different strategies have been proposed for distance of fuzzy numbers. The distances introduced for fuzzy numbers can be categorized in two groups:\1. The crisp distances which explain crisp values for the distance between two fuzzy numbers.\2. The fuzzy distance which introduce a fuzzy distance for normal f...
vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید