نتایج جستجو برای: shift length

تعداد نتایج: 438901  

,

Zn0.97TM0.03O (TM = Co, Fe) thin films were deposited onto glass substrates by the sol–gel method and the effects of transition metals substitution on structural and optical properties of ZnO films were investigated. The X-ray diffraction patterns revealed that the films have wurtzite structure. Optical transmittance of the films was recorded in the range of 200 -800 nm wave length and the band...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه سمنان 1390

ردیابی بر مبنای هسته اصلی بهینه شده با بکارگیری الگوریتم mean shift توجه زیادی را به عنوان یک تکنیک موثر ردیابی در رشته های ویدئویی کسب کرده است. الگوریتم mean shift اساساً یک روش بهینه سازی صعود گرادیان است، که برای پیدا کردن بابهای محلی طراحی شده است. در بسیاری از ردیابی ها، ما نیاز به جستجوی باب کلی یک تابع هدف داریم، مانند وقتیکه جابجایی هدف در بین فریم های متوالی نسبتاً بزرگ باشد بطوریکه هیچ...

Journal: :The journal of physical chemistry. B 2005
Luke O'Neill Hugh J Byrne

A series of pi-conjugated oligomers containing one to six monomer units were studied by absorption and photoluminescence spectroscopy. As is common for these systems, a linear relationship between the positioning of the lowest-energy absorption and the highest-energy photoluminescence maxima plotted versus inverse conjugation length is observed, in good agreement with a simple nearly free elect...

Journal: :International journal of ophthalmology 2015
Donghyun Jee Yi-Ryeung Park Kyoung In Jung Eunchul Kim Tae Yoon La

AIM To examine the refractive prediction error in high myopic eyes after phacovitrectomy. METHODS This retrospective comparative case series included 91 eyes (18 high myopic eyes and 73 non-high myopic eyes) of 91 patients who underwent successful phacovitrectomy (phacoemulsification, intraocular lens implantation, and pars plana vitrectomy). The high myopic eyes were defined as the eye with ...

2008
Maxime Crochemore Thierry Lecroq

String matching is the problem of finding all the occurrences of a pattern in a text. We present a new method to compute a combinatorial shift function (“best matching shift”) of the well-known Boyer–Moore string matching algorithm. Moreover we conduct experiments showing that the algorithm using this best matching shift is the most efficient in particular cases such as the search for patterns ...

2004
A. H. Bilge A. Erzan D. Balcan

Abstract We define the “shift-match number” for a binary string and we compute the probability of occurrence of a given string as a subsequence in longer strings in terms of its shift-match number. We thus prove that the string matching probabilities depend not only on the length of shorter strings, but also on the equivalence class of the shorter string determined by its shift-match number. PA...

Journal: :IEEE Trans. Information Theory 1991
Miodrag V. Zivkovic

An algorithm is given for the reconstruction of the initial state of a key–stream generator (KSG) consisting of a short linear feedback shift register (length ≤ 30), whose clock is controlled by an algebraically simple internal KSG. The algorithm is based on the fact that the expected number of possible LFSR initial states exponentially decreases with the length of the known part of the output ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید