### Yazar "Karci A." seçeneğine göre listele

Listeleniyor 1 - 10 / 10

###### Sayfa Başına Sonuç

###### Sıralama seçenekleri

Öğe Çizge Benzerli?i Yöntemi ile Doküman Siniflandirma(Institute of Electrical and Electronics Engineers Inc., 2019) Uçkan T.; Hark C.; Seyyarer E.; Ayata F.; Karci A.Daha fazla The classification of the documents is at the beginning of the topics that are studied extensively today. Using text similarity, many areas are used, such as whether citations are quoted elsewhere or the information searched in search engines is fast and accurate. A variety of methods are used while looking for similarities between documents. Similarity measurements are made by two basic methods, word-based and sentence-based, during the comparison of several documents. While word-based similarity measurements are made, many distance measurement methods such as Jaccard, Dice, Cosine similarity are used. In this study, the paragraphs in different documents will be broken down by sentence basis and they will be represented by a graph, and a study will be done on the classification of the documents using Hamming distance measurements by XOR method of neighborhood matrices obtained from these documents. © 2018 IEEE.Daha fazla Öğe Efficient Algorithm for Dominating Set in Graph Theory Based on Fundamental Cut-Set(Gazi Universitesi, 2024) Oztemiz F.; Karci A.Daha fazla Determining the minimum dominating set in connected graphs is one of the most difficult problems defined as NP-hard. In this problem, it is aimed to determine the important nodes that can influence all nodes via the minimum number of nodes on the graph. In this study, an efficient near-optimal algorithm showing a deterministic approach has been developed different from the approximation algorithms mentioned in the literature for discovering dominating set. The algorithm has O(n3) time complexity in determining the Dominating Set (DS). At the same time, the algorithm is an original algorithm whose solution is not random by using a fundamental cut-set. The DS algorithm consists of 3 basic phases. In the first phase of the algorithm, the algorithm that constructs the special spanning tree (Karci Max tree) of the graph is developed. In the second phase, the algorithm that finds the fundamental cut sets using the Kmax spanning tree is developed. In the last phase, Karci centrality node values are calculated with fundamental cut set and by using these Karci centrality node values, an algorithm has been developed to identify DS nodes. As a result of these three phases, the dominance values of the nodes on the graph and the DS nodes are calculated. The detected Karci centrality node values give priority to the node selection for determining the DS. All phases of the developed DS and Efficient node algorithms were coded in R programming language and the results were examined by running on sample graphs. © 2024, Gazi Universitesi. All rights reserved.Daha fazla Öğe Extractive Text Summarization via Graph Entropy Çizge Entropi ile Çikarici Metin Özetleme(Institute of Electrical and Electronics Engineers Inc., 2019) Hark C.; Uckan T.; Seyyarer E.; Karci A.Daha fazla There is growing interest in automatic summarizing systems. This study focuses on a subtractive, general and unsupervised summarization system. It is provided to represent the texts to be summarized with graphs and then graph entropy is used to interpret the structural stability and structural information content on the graphs representing the text files. The performance of the proposed text summarizing approach for the purpose of summarizing the text on the data set of Document Understanding Conference (DUC-2002) including open access texts and summaries of these texts was calculated using the Recall-Oriented Understudy for Gisting Evaluation (ROUGE) evaluation metrics. Experimental processes were repeated for 200 and 400 word abstracts. Experimental results reveale that the proposed text summarizing system performs competitively with competitive methods for different ROUGE metrics. © 2019 IEEE.Daha fazla Öğe Investigation of cricket behaviours as evolutionary computation for system design optimization problems(Elsevier B.V., 2015) Canayaz M.; Karci A.Daha fazla In this study, the behaviours of an insect species called cricket were investigated and tried to develop a new meta-heuristic algorithm approach that may be used in solving optimization problems by modelling these behaviours. These insect species make a sound by flapping their wings and attract the other crickets around them. While creating this algorithm, the physics laws related to propagation of sound as well as the crickets ability to predict the temperature with the number of flaps were also considered. The approach performance was tried to be shown by applying the developed approach at the end of the study to both numeric problems and cantilever stepped and welded beam that are of system design optimization problems. © 2015 Elsevier Ltd. All rights reserved.Daha fazla Öğe A novel approach for image compression based on multi-level image thresholding using discrete wavelet transform and cricket algorithm(Institute of Electrical and Electronics Engineers Inc., 2015) Canayaz M.; Karci A.Daha fazla Applications of image compression is important in terms of time and resource management considering factors such as require more time to send according to the size of image over the network and large amount of space is high dimensional data for storing images. In this study, a new approach can be using at image compression process will be introduced. Firstly, image subjected to discrete wavelet transform for extracting feature. Then multi-level threshold values will be find with Shanon entropy in the obtained image. The maximum value of objective function will be obtained with the help of cricket algorithm at the threshold values finding step. This algorithm is a meta-heuristic algorithm that based on population. The threshold values that obtained through algorithm using to compressing the images will be provided. At the end of the study, the image compression ratio, the proposed approach running on a standard test image will be given. © 2015 IEEE.Daha fazla Öğe Novel network steganography approaches for confidential transmission of information(Institute of Electrical and Electronics Engineers Inc., 2017) Karado?an I.; Daş R.; Karci A.Daha fazla In this paper, two different packet timing and IP ID based network steganography approaches have been proposed to provide confidential transmission of information. In the proposed packet timing approach, it is seen that the bandwidth is higher than the previous methods. The proposed IP ID field based approach has been found to be more effective than previous methods in ensuring the uniqueness of the ID field and is suitable for sending confidential data over the Internet. In addition, comprehensive information on this study was presented by examining methods of information hiding, hidden channels and secret data transmission in the network environment. © 2017 IEEE.Daha fazla Öğe Overcurrent relay coordination of 154/34,5 kV Hasançelebi substation by League Championship Algorithm(Institute of Electrical and Electronics Engineers Inc., 2017) Seyyarer A.; Akda? O.; Hark C.; Karci A.; Yero?lu C.Daha fazla In this study, non-directional overcurrent relay coordination was done in 154/34.5 kV Malatya Teiaş Hasançelebi transformer centre using League Championship Algorithm (LCA). Standard inverse time characteristic based on IEC 255-3 is used for the relay is coordinated. The results obtained by the LCA have been used in virtual model, obtained by DigSilent software for overcurrent relays at the Hasançelebi transformer centre. Then, the overcurrent relay coordination was performed by examining the response of the overcurrent relays to the 3-phase fault currents generated in the model. © 2017 IEEE.Daha fazla Öğe The properties of new approach of fractional order derivative(Gazi Universitesi Muhendislik-Mimarlik, 2015) Karci A.Daha fazla Derivative concept has got about 300-years history. The fractional order derivative concept also has got a long-term history and there are many studies on this concept. The reason for these studies is the belief of better modelling the physical systems with fractional order derivative; the classical derivative is beneficial to model the physical systems locally and the fractional order derivative is beneficial to model physical systems globally. However, the fractional order derivative methods in literature have deficiencies. In this study, these deficiencies were briefly demonstrated and then a new approach for fractional order derivative which was developed by Karci in 2013, will be given. After that, the relationships between classical derivative and this new approach will be illustrated and then some properties of this new definition will be given. There must be a relationship between results of derivative process and complex numbers since the result of derivative is a vectorial magnitude and complex numbers are also vectorial magnitudes. This relationship will be given in detail in this study.Daha fazla Öğe Segmentation of color texture images with artificial bee colony algorithm and wavelet transform(2012) Hanbay K.; Talu M.F.; Karci A.Daha fazla Segmentation is an important application in the analysis of gray level and color images numerically. The task of image segmentation is to separate a given image into different regions having homogenous properties. Although the most basic segmentation is thresholding, this method has been insufficient in time. In this paper, the segmentation of color texture images is carried out with the approach of wavelet transform and artificial bee colony algorithm. Through this approach, the segmentation of typical natural scenes, including no uniform statistical color and texture characteristics is achieved. The superior and weak points of the developed method are evaluated. © 2012 IEEE.Daha fazla Öğe Topology properties of hierarchical honeycomb meshes(CEUR-WS, 2021) Selcuk B.; Tankul A.N.A.; Karci A.Daha fazla Honeycomb meshes can be seen widely in nature and are using in many different areas because of its properties. Using honeycomb meshes for constructing hierarchical structures has some advantages. In this study, hierarchical honeycomb meshes (HHM) are investigated. The construction of HHM is introduced with an example, topological properties of HHM explained in detail, a labeling algorithm in the process of the construction phase and also routing algorithms are given. This study shows a HHM(n) has a fractal structure and its graph is a Hamiltonian graph. © 2021 Copyright for this paper by its authors.Daha fazla