Kılıç, Hürevren

Profile Picture
Profile URL
https://hdl.handle.net/20.500.14411/6745
Name Variants
H., Kilic
Hürevren, Kılıç
Hurevren, Kilic
Kiliç H.
H.,Kilic
H.,Kılıç
H., Kılıç
K., Hürevren
K.,Hurevren
Kılıç,H.
Kilic,H.
Hürevren Kılıç
K.,Hürevren
K., Hurevren
Kilic H.
Kılıç H.
Kılıç, Hürevren
Kilic, Hurevren
Kilic,Hurevren
Job Title
Profesör Doktor
Email Address
hurevren.kilic@atilim.edu.tr
Main Affiliation
Computer Engineering
Status
Website
https://www.atilim.edu.tr/tr/bilgisayar-muhendisligi-ana-bilim-dali/page/1620/akademik-kadro
ORCID ID
0000-0002-9058-0365
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

NO POVERTY1
NO POVERTY
0
Research Products
ZERO HUNGER2
ZERO HUNGER
0
Research Products
GOOD HEALTH AND WELL-BEING3
GOOD HEALTH AND WELL-BEING
1
Research Products
QUALITY EDUCATION4
QUALITY EDUCATION
1
Research Products
GENDER EQUALITY5
GENDER EQUALITY
0
Research Products
CLEAN WATER AND SANITATION6
CLEAN WATER AND SANITATION
2
Research Products
AFFORDABLE AND CLEAN ENERGY7
AFFORDABLE AND CLEAN ENERGY
0
Research Products
DECENT WORK AND ECONOMIC GROWTH8
DECENT WORK AND ECONOMIC GROWTH
0
Research Products
INDUSTRY, INNOVATION AND INFRASTRUCTURE9
INDUSTRY, INNOVATION AND INFRASTRUCTURE
0
Research Products
REDUCED INEQUALITIES10
REDUCED INEQUALITIES
0
Research Products
SUSTAINABLE CITIES AND COMMUNITIES11
SUSTAINABLE CITIES AND COMMUNITIES
0
Research Products
RESPONSIBLE CONSUMPTION AND PRODUCTION12
RESPONSIBLE CONSUMPTION AND PRODUCTION
0
Research Products
CLIMATE ACTION13
CLIMATE ACTION
0
Research Products
LIFE BELOW WATER14
LIFE BELOW WATER
0
Research Products
LIFE ON LAND15
LIFE ON LAND
0
Research Products
PEACE, JUSTICE AND STRONG INSTITUTIONS16
PEACE, JUSTICE AND STRONG INSTITUTIONS
0
Research Products
PARTNERSHIPS FOR THE GOALS17
PARTNERSHIPS FOR THE GOALS
1
Research Products
This researcher does not have a Scopus ID.
This researcher does not have a WoS ID.
Scholarly Output

34

Articles

8

Views / Downloads

179/1615

Supervised MSc Theses

10

Supervised PhD Theses

0

WoS Citation Count

66

Scopus Citation Count

63

Patents

0

Projects

0

WoS Citations per Publication

1.94

Scopus Citations per Publication

1.85

Open Access Source

2

Supervised Theses

10

JournalCount
International Journal of Engineering Education3
Proceedings of the 2007 Inaugural IEEE-IES Digital EcoSystems and Technologies Conference, DEST 2007 -- 2007 Inaugural IEEE-IES Digital EcoSystems and Technologies Conference, DEST 2007 -- 21 February 2007 through 23 February 2007 -- Cairns -- 702542
2014 IEEE Symposium on Intelligent Agents (IA) -- DEC 09-12, 2014 -- Orlando, FL1
21st Signal Processing and Communications Applications Conference (SIU) -- APR 24-26, 2013 -- CYPRUS1
26th Annual International Symposium on Computer and Information Science -- SEP 26-28, 2011 -- Royal Soc London, London, ENGLAND1
Current Page: 1 / 5

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 10 of 34
  • Thumbnail Image
    Conference Object
    F-Actor: a Multiagent Gaming Environment for Controlling Virtual Flow Networks
    (Univ Wolverhampton, 2008) Ocal, Ilter Kagan; Cevik, Ahmet; Cereci, Ibrahim; Kilic, Hurevren; Computer Engineering
    A gaming environment that enables agent-based local control of a configurable virtual flow network is developed. The gaming software what we call F-Actor provides a graph-based discrete virtual control environment on which user-developed controller agents reside and act according to their assigned design goals. Runtime performances of user-developed controller agent codes are made observable through a graphical user interface. The proposed game can be played by different developers having different level of control and programming knowledge. By playing with F-Actor, engineers (or students) can make practices on a virtual flow environment and try alternative intelligent control algorithms before their potential implementations on field.
  • Thumbnail Image
    Master Thesis
    Yapısal ve merkezi olmayan sayısal ortamların süreç eşleme performansları hakkında bir inceleme
    (2007) Çakır, Buğra; Kılıç, Hürevren; Öztoprak, Kasım; Computer Engineering; Computer Engineering; Computer Engineering
    Verimli es¸leme, yapısal ve merkezi olmayan sayısal ortamlarda problem tes¸kil etmektedir. Bu tezde s¨ozkonusu ortamlara odaklanılarak, ortamlarn es¸leme performanslarını ¨olc¸me amac¸lı benzetimler gerc¸ekles¸tirilmis¸tir. Calısmada, P2P(HyperGrid, basuclu (ultrapeer) ve bas¸uc¸'suz Gnutella), Kucuk-dunya (Small-World, Watts-Strogatz), ve us kanunu (power-law) da˘gılımını g¨osteren Ozerk Waxman sisteminin a˘gır-kuyruklu (heavy-tailed) ¨ uygulaması, rasgele (random), iki boyutlu-ızgara (2D-Grid) gibi farklı ortam modelleri dikkate alınmıs¸tır. Es¸leme amacıyla, s¨urec¸ kars¸ılas¸malarına olanak tanıyan akıs¸ mekanizmasının Bilgilendirilmemis¸ Once-Enlemesine-Arama oldugu kabullenilmis¸tir. Benzetimlerde, rasgele ortamın es¸leme performansının neredeyse di˘ger t¨um problemlere ve eszamanlı yapılandırmaya oranla performans ustunlugu gozlenmektedir. Ancak, kucuk-dunya ortamı modelinin toplam maliyeti neredeyse t¨um kurulumlar ic¸inde en yuksek olanıdır. Sozluk Terimler: Yapısal ve merkezi olmayan ortamlar, Surec¸ esleme, Performans, Benzetim
  • Thumbnail Image
    Conference Object
    An Investigation About Process Matchmaking Performances of Unstructured and Decentralized Digital Environments
    (Ieee, 2007) Cakir, Bugra; Kilic, Hurevren
    Efficient matchmaking is an important problem in unstructured and decentralized digital environments. We report the results of simulations of these environments and provide measurements of match performance focusing on unstructured and decentralized environments. In the study, different environment models including P2P (Hypergrid, Gnutella with/without ultrapeer); small-world (Watts-Strogatz); heavy-tailed and random versions of Autonomous System Waxman model showing power-law distribution property; random and 2D-Grid are considered. The flooding mechanism enabling process encounters for match purposes is uninformed Breadth-First-Search. Simulations show that the matchmaking performance of random environment outperforms the others for almost all different problems and time-to-live settings. On the other hand, the total cost of small world environment model is the highest for almost all setups.
  • Thumbnail Image
    Article
    Citation - WoS: 4
    Citation - Scopus: 6
    An Automata Networks Based Preprocessing Technique for Artificial Neural Network Modelling of Primary Production Levels in Reservoirs
    (Elsevier, 2007) Kilic, Hurevren; Soyupak, Selcuk; Tuzun, Ilhami; Ince, Ozlem; Basaran, Gokben
    Primary production in lakes and reservoirs develops as a result of complex reactions and interactions. Artificial neural networks (ANN) emerges as an approach in quantification of primary productivity in reservoirs. Almost all of the past ANN applications employed input data matrices whose vectors represent either water quality parameters or environmental characteristics. Most of the time, the components of input matrices are determined using expert opinion that implies possible factors that affect output vector. Major disadvantage of this approach is the possibility of ending-up with an input matrix that may have high correlations between some of its components. In this paper, an automata networks (AN) based preprocessing technique was developed to select suitable and appropriate constituents of input matrix to eliminate redundancy and to enhance calculation efficiency. The proposed technique specifically provides an apriori rough behavioral modeling through identification of minimal AN interaction topology. Predictive ANN models of primary production levels were developed for a reservoir following AN based pre-modeling step. The achieved levels of model precisions and performances were acceptable: the calculated root mean square error values (RMSE) were low; a correlation coefficient (R) as high as 0.83 was achieved with an ANN model of a specific structure. (c) 2006 Elsevier B.V. All rights reserved.
  • Thumbnail Image
    Conference Object
    Citation - WoS: 13
    Search-Based Parallel Refactoring Using Population-Based Direct Approaches
    (Springer-verlag Berlin, 2011) Kilic, Hurevren; Koc, Ekin; Cereci, Ibrahim
    Automated software refactoring is known to be one of the "hard" combinatorial optimization problems of the search-based software engineering field. The difficulty is mainly due to candidate solution representation, objective function description and necessity of functional behavior preservation of software. The problem is formulated as a combinatorial optimization problem whose objective function is characterized by an aggregate of object-oriented metrics or pareto-front solution description. In our recent empirical study, we have reported the results of a comparison among alternative search algorithms applied for the same problem: pure random, steepest descent, multiple first descent, simulated annealing, multiple steepest descent and artificial bee colony searches. The main goal of the study was to investigate potential of alternative multiple and population-based search techniques. The results showed that multiple steepest descent and artificial bee colony algorithms were most suitable two approaches for an efficient solution of the problem. An important observation was either with depth-oriented multiple steepest descent or breadth-oriented population-based artficial bee colony searches, better results could be obtained through higher number of executions supported by a lightweight solution representation. On the other hand different from multiple steepest descent search, population-based, scalable and being suitable for parallel execution characteristics of artificial bee colony search made the population-based choices to be the topic of this empirical study. I In this study, we report the search-based parallel refactoring results of an empirical comparative study among three population-based search techniques namely, artificial bee colony search, local beam search and stochastic beam search and a non-populated technique multiple steepest descent as the baseline. For our purpose, we used parallel features of our prototype automated refactoring tool A-CMA written in Java language. A-CMA accepts bytecode compiled Java codes as its input. It supports 20 different refactoring actions that realize searches on design landscape defined by an adhoc quality model being an aggregation of 24 object-oriented software metrics. We experimented 6 input programs written in Java where 5 of them being open source codes and one student project code. The empirical results showed that for almost all of the considered input programs with different run parameter settings, local beam search is the most suitable population-based search technique for the efficient solution of the search-based parallel refactoring problem in terms of mean and maximum normalized quality gain. However, we observed that the computational time requirement for local beam search becomes rather high when the beam size exceeds 60. On the other hand, even though it is not able to identify high quality designs for less populated search setups, time-efficiency and scalability properties of artificial bee colony search makes it a good choice for population sizes >= 200.
  • Thumbnail Image
    Master Thesis
    Gerçek Zamanlı Trafik Yol Durumu Bilgisi ile A* Tabanlı Rota Planlaması: Çok Erkinli Bir Benzetim
    (2010) Öcal, İlter Kağan; Serçe, Fatma Cemile; Kılıç, Hürevren
    Araç trafiğinin önemli özelliklerinden birisi karmaşıklığıdır. Trafikteki araçlar tahmin edilemeyecek şekilde hareket ettikleri için, trafik ortamında düzenli bir araç akışı yoktur. Bu gibi karmaşık bir ortamda, iki nokta arasındaki en hızlı rotanın bulunması zor bir problemdir. Piyasada iki nokta arasındaki en kısa rotayı ve hız limitleri, geçmiş yol istatistikleri, fm bandı üzerinden yayın ve benzeri kaynaklardan alınan bilgiye dayanarak en hızlı rotayı hesaplayan navigasyon cihazları bulunmaktadır. Fakat hızlı rota hesabında kullanılan bu veriler yolların gerçek zamanlı hız durumlarını içermemektedir. Bu bilgiler kullanılarak yapılan hesaplamalarda, o anda kullanılabilecek en hızlı rota bulunamamaktadır. Bu çalışmada, gerçek zamanlı trafik bilgisi paylaşımı ve dağıtımı yapmak için tasarlanmış çok erkinli bir simülasyon yazılımı geliştirilmiştir. Yazılımda, araçların harita üzerindeki hareketlerinin gerçek zamanlı veriye dayanarak benzetimi yapılmıştır. Erkinlerin yaptığı rota planlamasının kalitesinin sınanması için, bir çok aracın hareket ettiği bir ortam oluşturulmuştur. Yapılan deneylerde, önerilen gerçek zamanlı veriye dayalı rota planlamasının, en hızlı rotayı bulmakta verimli ve etkili olduğu görülmüştür.
  • Thumbnail Image
    Master Thesis
    Doğurgan Ağ Özdevinirlerin Yerel Davranış Tanıması
    (2010) Özdemir, Burak; Kılıç, Hürevren
    Bir bütün ve onu oluşturan parçaların kendi aralarındaki ilişkisi, karmaşık ayrık dinamik sistemler bağlamında önem taşımaktadır. Bu amaçla, Doğurgan Ağ Özdeviniri şeklinde tanımlanan genel verilerden yerel davranış tanımlama algoritması geliştirilmiştir. Sabit kural-uzayı düzenlemesine sahip Özdevinir Ağları kullanarak sonlu Doğurgan Ağ Özdevinirlerinin tanınması ve benzetimi amacıyla bir izlek tasarlanabilirliği gösterilmiştir. ?Üst seviye bileşen etkileşimi? adı verilen bir soyutlama sunulmuştur. Ayrıca, Doğurgan Ağ Özdevinirleri için bir tanımlama yönteminin varlığı gösterilmiştir. Pratikte, model inşasına yönelik otomatikleştirilmiş bir yaklaşım sağlanmıştır ve geliştirilen yaklaşım Doğurgan Ağ Özdevinirlerini esas alan sistem modelleme girişimlerinde kullanılabilmektedir.
  • Thumbnail Image
    Conference Object
    Citation - WoS: 3
    An Agent-based Trading Infrastructure for Combinatorial Reverse Auctions
    (Ieee, 2014) Bayindir, Hakan; Kilic, Hurevren; Rehan, Mohammed
    A Combinatorial Reverse Auction Trading Infrastructure - CRATI is designed and implemented as an agent-based system. Two basic building blocks Java Agent Development Framework (JADE) and an Open Source Java Constraint Programming Library (Choco Solver) are used to facilitate agent interactions and an optimization task. For our purpose, it is shown that auction Winner Determination Problem (WDP) can suitably be represented as a weighted set covering problem instance whose solution gives the decided winners of the auction process. In order to realize the system, a variation of Contract Net protocol is designed and implemented to handle auctions that occur in the platform from start to finish.
  • Thumbnail Image
    Conference Object
    Citation - WoS: 2
    CAWP A Combinatorial Auction Web Platform
    (Scitepress, 2010) Cereci, Ibrahim; Kilic, Hurevren
    Online auctions, including online Combinatorial Auctions, are important examples of e-commerce applications. In this paper, a Combinatorial Auction Web Platform (CAWP) is introduced. The platform enables both product selling and buying capabilities that can be realized in a combinatorial way. CAWP supports a Sealed-Bid Single-Unit type of Combinatorial Auctions. Easy customization for any selected problem domain is a distinguished feature of CAWP. Platform users are not expected to have any technical knowledge about how to solve the Winner Determination Problem (WDP) known to be critical for profit maximization of the auctioneers in Combinatorial Auctions.
  • Thumbnail Image
    Master Thesis
    Durum Değişikliği İşleci: Cebirsel ve Biçimsel Dil Kümesi Özellikleri
    (2009) Çevik, Ahmet; Oğuztüzün, Halit; Kılıç, Hürevren
    Bu tezde soyut hesaplama modellerinin soyut güç tüketimi özelliklerinden esinlenerek düzgün dillerin yeni bir alt kümesi tanımlanmıştır. Bu yeni kümeye durum değişikliği dili adı verilmiştir. Bunun için, tanım kümesi sonlu özdevinir ve erim kümesi durum özdevinir olan birli işleç tanımlanmıştır. Bahsedilen yeni kümenin birleşme ve kesişme özellikleri altında kapalı olduğu, tümleme özelliği altında ise kapalı olmadığı kanıtlanmıştır. Kümenin karar verilebilirliği hakkında tartışılmıştır. Ayrıca soyut güç tüketimi kavramı formal olarak tanımlanmış, ve son bölümde bu kavram durum değişikliği dillerinin sağlanabilirliği ile beraber belitleştirilmiştir. Son olarak, belirli algoritmalar için düzenli olarak tanımlanmış soyut hesaplama modellerinin güç tüketimininin alt limitinin belirlenmesindeki evrensel bir işlecin varlığının önemi vurgulanmıştır.