Browsing by Author "Kilic,H."

Filter results by typing the first few letters
Now showing 1 - 4 of 4
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 1
    Ace-Pe: an Automated Code Evaluation Software Tool for Programming Education
    (Institute of Electrical and Electronics Engineers Inc., 2023) Alper,B.; Nazlioglu,S.; Kilic,H.; Computer Engineering; Software Engineering; 06. School Of Engineering; 01. Atılım University
    An automated code evaluation tool that combines the usage of software quality metrics and object-oriented programming teaching subjects is designed and developed. The tool (called ACE-PE) gives flexibility to instructors to assess student assignments at the level of precision of specific subjects which reveals the degree of student's understanding of covered subjects, and to observe his/her own effort, as well. Provision of content-aware automated fast feedback to students to improve quality of their products and development efforts is another outcome of the proposed solution. © 2023 IEEE.
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 21
    An Empirical Study About Search-Based Refactoring Using Alternative Multiple and Population-Based Search Techniques
    (2012) Koc,E.; Ersoy,N.; Andac,A.; Camlidere,Z.S.; Cereci,I.; Kilic,H.; Computer Engineering; 06. School Of Engineering; 01. Atılım University
    Automated maintenance of object-oriented software system designs via refactoring is a performance demanding combinatorial optimization problem. In this study, we made an empirical comparative study to see the performances of alternative search algorithms under a quality model defined by an aggregated software fitness metric. We handled 20 different refactoring actions that realize searches on design landscape defined by combination of 24 object-oriented software metrics. The investigated algorithms include random, steepest descent, multiple first descent, multiple steepest descent, simulated annealing and artificial bee colony searches. The study is realized by using a tool called A-CMA developed in Java that accepts bytecode compiled Java codes as its input. The empiricial study showed that multiple steepest descent and population-based artificial bee colony algorithms are two most suitable approaches for the efficient solution of the search based refactoring problem. © 2012 Springer-Verlag London Limited.
  • Thumbnail Image
    Conference Object
    Citation - Scopus: 1
    An Investigation About Process Matchmaking Performances of Unstructured and Decentralized Digital Environments
    (2007) Cakir,B.; Kilic,H.; Computer Engineering; 06. School Of Engineering; 01. Atılım University
    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 (WattsStrogatz); 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. © 2007 IEEE.
  • Thumbnail Image
    Conference Object
    An Investigation About Process Matchmaking Performances of Unstructured and Decentralized Digital Environments
    (2007) Cakir,B.; Kilic,H.; Computer Engineering; 06. School Of Engineering; 01. Atılım University
    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 (WattsStrogatz); 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. © 2007 IEEE.