نتایج جستجو برای: 2010 in our algorithm

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

A. Malekzadeh, M. Javadian R. Vaziri S. Haghzad Klidbary

Fuzzy C-mean (FCM) is the most well-known and widely-used fuzzy clustering algorithm. However, one of the weaknesses of the FCM is the way it assigns membership degrees to data which is based on the distance to the cluster centers. Unfortunately, the membership degrees are determined without considering the shape and density of the clusters. In this paper, we propose an algorithm which takes th...

Journal: :bulletin of the iranian mathematical society 0
y. shehu department of mathematics, university of nigeria, nsukka, nigeria. f. u. ogbuisi school of mathematics‎, ‎statistics and computer science‎, ‎university of kwazulu-natal‎, ‎durban‎, ‎south africa. o. s. iyiola department of mathematical sciences, university of wisconsin-milwaukee, wisconsin, usa

‎our contribution in this paper is to propose an iterative algorithm which does not require prior knowledge of operator norm and prove a strong convergence theorem for approximating a solution of split equality fixed point problem for quasi-nonexpansive mappings in a real hilbert space‎. ‎so many have used algorithms involving the operator norm for solving split equality fixed point problem‎, ‎...

Journal: :iranian economic review 0
mansour khalili araghi professor, faculty of economics, university of tehran, iran, majid mirzaee ghazani phd, faculty of economics, university of tehran, iran

in this paper, we have examined abrupt changes in volatility of tepix index in tehran stock exchange during august 23, 2010 to june 12, 2014. applying the iterated cumulative sum of squares (icss) algorithm proposed by inclan and tiao (1994) and the modified version of this algorithm consisting kappa 1 and kappa 2 test statistics developed by sansó et al. (2004), we have specified that the dete...

H. R. Naji, R. Ebrahimi Atani, S. M. Almasi Mousavi,

In this paper, we propose a new concurrency control algorithm based on multi-agent systems which is an extension of majority protocol. Then, we suggest a clustering approach to get better results in reliability, decreasing message passing and algorithm’s runtime. Here, we consider n different transactions working on non-conflict data items. Considering execution efficiency of some different...

Journal: :progress in biological sciences 2014
samaneh saadat zhaleh safikhani kambiz badie mehdi sadeghi

given the importance of transcriptome analysis in various biological studies and considering thevast amount of whole transcriptome sequencing data, it seems necessary to develop analgorithm to assemble transcriptome data. in this study we propose an algorithm fortranscriptome assembly in the absence of a reference genome. first, the contiguous sequencesare generated using de bruijn graph with d...

ژورنال: علوم آب و خاک 2017
دانش‌کار آراسته, پیمان, کمالی, میثم, یونس‌زاده جلیلی, سهیلا,

Integrated management of watershed basins depends on deep knowledge of basic concepts such as the arrangement of lands and their uses. Location and distribution of agricultural land use help to balance water resources in the watershed basins. In this research with the help of satellite images of Landsat 5 and 8, and the method of maximum likelihood classification algorithm, land use types of wa...

In this paper, the application of the Independent Component Analysis In this paper, the application of the Independent Component Analysis technique in speech-music separation is discussed. The separation algorithm is in the time domain. It needs the score function estimation to minimize the mutual information. For estimating score function, sufficient samples of the mixed (speech-music) signals...

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

abstract this study examines the relationship between reading anxiety and difficulty of texts as well as the relationship between reading anxiety and students perceived difficulty of the texts. since difficulty is a relative concept, i limited its definition by sticking to the readability formula. we also took students perceived difficulty levels into account. therefore, in the present study, ...

Journal: :journal of advances in computer research 2016
mohammad karim sohrabi hamidreza hasannejad marzooni

finding frequent patterns plays a key role in exploring association patterns, correlation, and many other interesting relationships that are applicable in tdb. several association rule mining algorithms such as apriori, fp-growth, and eclat have been proposed in the literature. fp-growth algorithm construct a tree structure from transaction database and recursively traverse this tree to extract...

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

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