Детальный поиск

Отменить
Найденный: 3 Экземпляр 0.000 sn
- Вы можете использовать опцию И / ИЛИ / НЕ для критериев, которые вы хотите добавить или.
- Вы можете вернуться к обычному поиску, нажав кнопку Отмена.
Фильтры
Фильтры
Найденный: 3 Экземпляр 0.000 sn
Факультет / Институт [1]
Вид публикации [1]
Год публикации [3]
Язык [1]
Вид индекса [2]
Издатель [1]
Национальный/Международный [1]
Доступ к файлам

Synthesis and structural and electrochemical characterization of novel macrocyclic vic-dioxime ligand and its mononuclear transition and nontransition metal complexes

Ali Osman SOLAK

The reaction of N-(4-aminophenyl)aza-15-crown-5 (1) with anti-chlorophenylglyoxime (2) produces a novel azacrown ether containing vic-dioxime, N-(4-aminophenyl)aza-15-crown-5-phenylglyoxime (LH_2). LH_2 reacts with Ni(II), Cu(II), Co(II), Cd(II), and Zn(II) ions to yield the mononuclear transition and nontransition metal complexes [M(LH)_2] (M = Ni and Cu), [M(LH)_2(H_2O)_2] (M = Co), and [M(LH)(H_2O)(Cl)] (M = Cd and Zn). The structural features of LH_2 were studied using several techniques including elemental analysis, Fourier transform infrared spectroscopy (FT-IR), ultraviolet visible (UV ...Более

Доступ к файлам

An algorithm for line matching in an image by mapping into an n-dimensional vector space

Rayımbek SULTANOV | Rita İSMAİLOVA

This paper proposes a minimal length difference algorithm for construction of a line in an image by solving the problem of optimal contour approximation. In this algorithm, a method for finding interest points is proposed, and the object matching (classification) is done by mapping interest points onto a vector space. In cases where the lines in the representation of the images are not smooth, the algorithm converges rapidly. The results of the experiments showed that for convergence of the contour simplification, there were 5-6 iterations for n = 13. To check how close the curve approximation ...Более

Доступ к файлам

Hadoop framework implementation and performance analysis on a cloud

Göksu Zekiye ÖZEN | Rayımbek SULTANOV

Hadoop framework uses MapReduce programming paradigm to process big data by distributing data across a cluster and aggregating. MapReduce is one of the methods used to process big data hosted on large clusters. In this method, jobs are processed by dividing into small pieces and distributing over nodes. Parameters such as distributing method over nodes, the number of jobs held in a parallel fashion and the number of nodes in the cluster affect the execution time of jobs. The aim of this paper is to determine how number of nodes, maps and reduces affect the performance of Hadoop framework on a ...Более

Наши обязательства и политика в отношении файлов cookie подпадает под действие закона ТР защите персональных данных № 6698.
Да

creativecommons
Bu site altında yer alan tüm kaynaklar Creative Commons Alıntı-GayriTicari-Türetilemez 4.0 Uluslararası Lisansı ile lisanslanmıştır.
Platforms