نتایج جستجو برای: correspondence techniques

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

Journal: :پژوهش ادبیات معاصر جهان 0
ابراهیم سلیمی کوچی دانشگاه اصفهان، ایران، دکترای زبان و ادبیات فرانسه مینا اعلائی دانشجوی کارشناسی ارشد ادبیات فرانسه دانشگاه اصفهان، ایران

the nouveau roman is considered as an influential literary movement of modern literature. there are some traces of the usage of elements and narrative techniques of nouveau roman in contemporary iranian literature. this tendency is more characteristic and typical in bahram sadeghi's work, which is named the representative of nouveau roman in iran. nevertheless, sadeghi has denied any consc...

1998
Byeong-Gwan Iem Antonia Papandreou-Suppappola Gloria Faye Boudreaux-Bartels

We propose the new P0-Weyl symbol to analyze system induced time shifts and scale changes on the input signal. This new Weyl symbol (WS) is useful in wideband signal analysis. We also propose new WS as tools for analyzing systems which produce dispersive frequency shifts on the signal. We obtain these generalized, frequency-shift covariant WS by warping conventional, narrowband WS. Using the ne...

1977
Harry G. Barrow Jay M. Tenenbaum Robert C. Bolles Helen C. Wolf

Parametric correspondence is a technique for matching images to a three dimensional symbolic reference map. An analytic camera model is used to predict the location and appearance of landmarks in the image, generating a projection for an assumed viewpoint. Correspondence is achieved by adjusting the parameters of the camera model until the appearances of the landmarks optimally match a symbolic...

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

چکیده ندارد.

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه علامه طباطبایی - دانشکده ادبیات و زبانهای خارجی 1393

پایان نامه حاضر به بررسی میزان موفقیت ترجمه های انگلیسی منظوم، منثور، و مشروح قرآن کریم در حفظ صورت و معنای این کتاب آسمانی می پردازد. در این پایان نامه تنها سوره یس و سه ترجمه مذکور آن که به ترتیب توسط پرفسور نیک آیین، آرتور آربری، و یوسف علی صورت گرفته اند، مورد بررسی قرار گرفتند. در پایان نامه حاظر همچنین سعی شده است میزان موفقیت شیوه ترجمه formal correspondence و dynamic equivalence که توس...

2009
Younsik Kang Xue Tu Satyaki Dutta Murali Subbarao

A new passive ranging technique named Robust Depth-from-Defocus (RDFD) is presented for autofocusing in digital cameras. It is adapted to work in the presence of image shift and scale change caused by camera/hand/object motion. RDFD is similar to spatial-domain Depth-from-Defocus (DFD) techniques in terms of computational efficiency, but it does not require pixel correspondence between two imag...

1991
Peter Norvig

It is shown that a process similar to Earley's algorithm can be generated by a simple top-down backtracking parser, when augmented by automatic memoization. The memoized parser has the same complexity as Earley's algorithm, but parses constituents in a different order. Techniques for deriving memo functions are described, with a complete implementation in Common Lisp, and an outline of a macro-...

Journal: :International Journal of Modern Physics B 2023

We consider two recent solutions of the generalized Faddeev–Volkov model, which is an exactly solvable Ising-type lattice spin model. The first solution obtained by using noncompact quantum dilogarithm, and second one constructed in a study via gauge/YBE correspondence. show that weight functions these models different techniques are same upto constant.

2013
Derek Beaton Francesca Filbey Hervé Abdi

We present an extension of PLS—called partial least squares correspondence analysis (PLSCA)—tailored for the analysis of nominal data. As the name indicates, PLSCA combines features of PLS (analyzing the information common to two tables) and correspondence analysis (CA, analyzing nominal data). We also present inferential techniques for PLSCA such as bootstrap, permutation, and χ2 omnibus tests...

N. Delfan T. Rastad

In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...

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

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