Yazar "Nuriyeva, Fidan" seçeneğine göre listele
Listeleniyor 1 - 16 / 16
Sayfa Başına Sonuç
Sıralama seçenekleri
Öğe Algorithms with guarantee value for knapsack problems(Taylor & Francis Ltd, 2012) Guler, Asli; Nuriyev, Urfat G.; Berberler, Murat Ersen; Nuriyeva, FidanIn this study one-dimensional knapsack problems (KP), which have many applications in technical and economic areas, are studied; then greedy algorithms are discussed for these problems. Guarantee values of these algorithms are calculated in order to determine how the results, returned by the algorithms, are close to optimal solutions. Furthermore, complementary problems for integer maximization KP and bounded integer maximization KP are defined; and it is aimed to improve the guarantee values, which have been calculated before, in terms of the complementary problems.Öğe Öğe Çarpanlarına ayırma algoritmaları üzerine(Ege Üniversitesi, 2010) Nuriyeva, Fidan; Ordin, BurakSayılar Teorisi ile Bilgisayar Teknolojisinin kaynaşması çeşitli konuları ve bu konulara bağlı olarak birçok uygulamayı ortaya çıkarmıştır. Bu alandaki en önemli konulardan biri de çarpanlarına ayırma algoritmalarıdır. Günümüzün en sağlam verişifreleme algoritmalarının başında gelen RSA Algoritmas Asal çarpanlarına ayırma probleminin büyük sayılar için bilgisayarda etkin bir şekilde çözülememesi prensibine dayanmaktadır. Bu nedenle çarpanlarına ayırma algoritmaları pratikte çok önem kazanmıştır. Bu tezde çarpanlara ayırma algoritmaları ele alınarak konu ile ilgili geniş bir literatür taraması yapılmış, ilgili matematiksel notasyon ve yöntemler, önemli algoritmalar hakkında ayrıntılı bilgi verilmiştir. Konu ile ilgili yaklaşımlar özetlenerek yeni çarpanlara ayırma algoritmalar geliştirilmiştir. Bu algoritmalarda hesaplamaları hızlandırmak için karekök alma ve 2. ci dereceden kuvvete yükseltme işlemleri toplama işlemi ile ifade edilmiştir. Önerilen algoritmalar GMP kütüphanesi kullanılarak C programlama dilinde kodlanarak hesaplama denemeleri yapılmıştır.Öğe An Effective Method Determining the Initial Cluster Centers for K-means for Clustering Gene Expression Data(Ieee, 2017) Tanir, Deniz; Nuriyeva, Fidan; Adali, EClustering is an important tool for analyzing gene expression data. Many clustering algorithms have been proposed for the analysis of gene expression data. In this article we have clustered real life gene expression data via K-Means which is one of clustering algorithms. Also, we have proposed a new method determining the initial cluster centers for K-means. We have compared results of our method with other clustering algorithms. The comparison results show that the K-means algorithm which uses the proposed methods converges to better clustering results than other clustering algorithms.Öğe Experimental Analysis of New Heuristics for the TSP(Ieee, 2012) Nuriyeva, Fidan; Kizilates, Gozde; Berberler, Murat Ersen; AidaZade, KIn this study, the three new heuristic algorithms which are proposed in [1] for the solution of traveling salesman problem is developed. In addition, the new versions of 2-opt and 3-opt algorithms are proposed. These algorithms are tested and their performances are compared with the well-known heuristic algorithms such as Nearest Neighbor, and Greedy algorithms.Öğe Gezgin Satıcı Problemi İçin Merkezden Kenarlara Hipersezgisel Yöntem(2016) Nuriyeva, Fidan; Kızılateş, GözdeBu makalede Gezgin Satıcı Problemi için yeni bir hipersezgisel algoritma önerilmiştir. Bu yöntemde önce N adet şehir içerisinden merkez şehir ve 4 uç şehir seçilip, sonra ise merkez ile ikişer-ikişer uç şehirlerin orta noktaları belirlenerek merkez şehirden başlanarak bu 9 şehirden geçen bir devre oluşturulmuştur. Daha sonra "en kısa yol" ve "ekleme sezgiseli" algoritmaları kullanılarak bulunan devre tüm şehirlerden geçecek şekilde genişletilmiştir. Önerilen algoritmalar ile kütüphane problemleri üzerinde hesaplama denemeleri yapılmış, elde edilen sonuçlar "en yakın komşu" algoritmasından elde edilen sonuçlar ile karşılaştırılmıştır. Hesaplama denemeleri önerilen algoritmanın verimli olduğunu göstermektedirÖğe İletişim ağlarında karşılaşılan kombinatorik problemler üzerine(Ege Üniversitesi, 2013) Nuriyeva, Fidan; Ordin, BurakGünümüzde ağ tasarım problemleri telekomünikasyon, ulaştırma, dağıtım ve lojistik gibi birçok alanda önem kazanmıştır ve bununla beraber yüksek kapasiteli hatlara olan ihtiyaç da artmaktadır; iletişimin hızlı, güvenilir ve kesintisiz olması istenmektedir. Bu tezde iletişim ağlarının tasarlanmasında karşıya çıkan üç tür kombinatorik problem ele alınmıştır: 1. İletişim ağındaki bağlantılılığın güçlendirilmesi ile ilgili Gökkuşağı Tepe ve Gökkuşağı Ayrıt bağlantılılık problemlerinin matematiksel modelleri hazırlanmış, gökkuşağı tepe bağlantılılık sayısını hesaplamak için yeni bir sezgisel algoritma önerilmiştir. 2. Geniş Bant Kablosuz Erişiminin Tasarımında kullanılan Kareleme Problemlerinin sezgisel algoritmalar ile çözümlerinin değerlendirilmesinde yararlanabilecek bir teorem ispatlanmıştır. 3. Ulaştırma, Dağıtım, Lojistik gibi birçok alanda kullanılan Gezgin Satıcı Problemi için üç yeni sezgisel algoritma önerilmiş, bu algoritmaların farklı hibritlerinden oluşan hipersezgisel ve parametreli yeni algoritmalar tasarlanmış ve C++ dilinde kodlanarak hesaplama denemeleri yapılmıştır.Öğe Mathematical Computer Games Based on Modular Arithmetic(Ieee, 2012) Nuriyeva, Fidan; Guler, Asli; Tanir, Deniz; AidaZade, KIn this paper, computer aided games, which motivate and bring out the mathematical abilities of students, have been studied by inspiring "Bachet's Game". The winning strategies of the games are based on modular arithmetic. Winning algorithms and mathematical models are included in the paper. Levels of the logical and math games which have been proved to be beneficial for students in order to gain ability of appropriate selection and application of analytical technics and strategies in terms of problems could be applied in compliance with age group of students and be permanent during the academic life of the student as a result of its character.Öğe A Mathematical Model For Finding The Rainbow Connection Number(Ieee, 2013) Nuriyeva, Fidan; Ugurlu, Onur; Kutucu, HakanThe rainbow connection problem belongs to the class of NP-Hard graph theoretical problems. The rainbow connection of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow edge-connected. In this study, we present a new mathematical model for the rainbow connection problem.Öğe A New Method for Lossless Compression of Binary Images(Ieee, 2017) Sadik, Tural; Tanir, Deniz; Nuriyeva, FidanNowadays, compression of binary image is vital due to enormous amount of images that are being processed and stored in a wide range of applications such as text, maps, fingerprint etc. In this study, we proposed a new method for lossless compression of binary images. The general principle of image compression algorithms is transforming binary digits into a new one that specifies the same information but with fewer digits. We compared our proposed method with Run-Length method which is one of lossless compression methods for binary images, and the compression results shown that our method is successful in lossless compression binary images.Öğe On selecting the Initial Cluster Centers in the K-means Algorithm(Ieee, 2017) Tanir, Deniz; Nuriyeva, FidanK-means clustering algorithm which is a process of separating n number of points into K clusters according to the predefined value of K is one of the clustering analysis algorithms. This algorithm has many applications in analysis of clustering. There are many factors that affect performance of the K-means clustering algorithm to better cluster. One of these is selecting initial cluster centers. In this study, two methods have been proposed for selecting the initial cluster centers. The proposed methods have been tested on data sets taken from UCI database and compared with the method proposed by Erisoglu etc and K-means algorithm which generates initial centers randomly. The comparison results show that the K-means algorithm which uses the proposed methods converges to better clustering results.Öğe ON THE SOLUTION OF MULTIDIMENSIONAL INTEGER KNAPSACK PROBLEM WITH DYNAMIC PROGRAMMING TECHNIQUE(Baku State Univ, Inst Applied Mathematics, 2020) Nuri, Elnur; Nuriyeva, Fidan; Nuriyev, Urfat[No Abstract Available]Öğe A Parametric Hybrid Method For the Traveling Salesman Problem(2013) Kızılateş, Gözde; Nuriyeva, FidanThe traveling salesman problem (TSP) is one of the typical NP–Hard problems of combinatorial optimization area. This paper proposes a new hyper heuristic algorithm named Parametric Hybrid Method (PHM) based on the Farthest Vertex (FV) and Greedy heuristics for solving the traveling salesman problem. in addition, many problem instances from TSPLIB (traveling salesman problem library) were solved with NN, Greedy and PHM algorithms. the experimental results show that the new hybrid algorithm is more effective and efficient than both Greedy and Nearest Neighbor algorithmsÖğe Self-Organizing Iterative Algorithm for Travelling Salesman Problem(Elsevier Science Bv, 2018) Nuriyev, Urfat; Ugurlu, Onur; Nuriyeva, FidanThis paper presents a self-organizing heuristic iterative algorithm for solving Travelling Salesman Problem. In the algorithm, firstly priority values of the edges are determined. Then, varied solutions are found. After that, the priority values of the edges are updated according to these solutions. Then, all the edges are sorted in descending order according to the priority values and in order to improve solutions an iterative algorithm is used. Greedy algorithm is used to find the solution in each iteration and the priority values of the edges are updated according to the solution. The proposed algorithm is compared with Nearest Neighbour and Greedy algorithm. Experimental results show that the proposed algorithm is efficient. (C) 2018, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.Öğe A SIMPLE ALGORITHM FOR THE MULTI-DEPOT MULTIPLE TRAVELING SALESMAN PROBLEM(Baku State Univ, Inst Applied Mathematics, 2018) Nuriyev, Urfat; Ugurlu, Onur; Nuriyeva, Fidan; Fikret, A; Tamer, BÖğe A Simple Iterative Algorithm for Boolean Knapsack Problem(Springer International Publishing Ag, 2020) Nuriyeva, Fidan; Nuriye, Urfat; Ugurlu, OnurThe Boolean Knapsack Problem, which has numerous real life applications, is a combinatorial optimization problem. Since the problem belongs to NP-Hard, many researchers have worked on several variants of the problem. In this paper a simple iterative algorithm based on a greedy strategy to solve the classical boolean knapsack problem is proposed. In algorithm, firstly initial solutions are generated, then a greedy criteria is used to improve these solutions. To demonstrate the performance of the proposed method, experiments are carried out with various benchmark instances of boolean Knapsack Problem. The computational results show that the proposed algorithm is functional enough to achieve acceptable results in reasonable times.
