Browsing by Author "Cereci, Ibrahim"
Now showing 1 - 7 of 7
- Results Per Page
- Sort Options
Conference Object Citation Count: 0THE BORDERLINE BETWEEN SERIOUS GAMES AND SIMULATIONS(Iated-int Assoc Technology Education & development, 2014) Guney, Sinem; Cagiltay, Nergiz Ercil; Tuner, Emre; Cereci, IbrahimGame and simulation-based environments allow trainees to develop motor and cognitive skills as well as to provide some very detailed measurement values which in turn provide a feedback mechanism. It is a well known fact that games and simulation are potentially creating safer and cheaper active learning environments. Even when several benefits of games and simulations are reported in the literature, there is no exact definition of a game and simulation drawing the borders in between. Hence this causes to some complexities and misunderstandings in the field. Accordingly, in this study a definition for simulations and games is searched by being based on the studies found in the literature. Based on these definitions a borderline for the games and simulations will be provided. Results of study aim to guide the educational technology designers by better defining their education designs and better understanding their affect on the educational environments.Conference Object Citation Count: 2CAWP A Combinatorial Auction Web Platform(Scitepress, 2010) Cereci, Ibrahim; Kilic, HurevrenOnline 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.Conference Object Citation Count: 15An Empirical Study About Search-Based Refactoring Using Alternative Multiple and Population-Based Search Techniques(Springer-verlag London Ltd, 2012) Kılıç, Hürevren; Ersoy, Nur; Cereci, İbrahim; Camlidere, Zelal Seda; Cereci, Ibrahim; Kilic, Hurevren; Computer EngineeringAutomated 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.Conference Object Citation Count: 0F-ACTOR: A MULTIAGENT GAMING ENVIRONMENT FOR CONTROLLING VIRTUAL FLOW NETWORKS(Univ Wolverhampton, 2008) Ocal, Ilter Kagan; Cevik, Ahmet; Cereci, Ibrahim; Kilic, HurevrenA 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.Conference Object Citation Count: 2Need for a Software Development Methodology for Research-Based Software Projects(Ieee, 2018) Cereci, Ibrahim; Karakaya, ZiyaSoftware development is mostly carried by a group of individuals. Software development methodologies are heavily utilized to organize these individuals and keep track of the entire software development process. Although previously proposed software development methodologies meet the needs of the industry and the firms, they are not usually suitable for research-based software projects that are carried by universities and individual researchers. In this paper, we aim to show the necessity of a new software development methodology for research-based problems carried by universities. The literature review will show the differences between industry and university software projects from certain aspects. These findings will be supported by the authors own research on the area. This qualitative research involves collecting data through interviews and applying Grounded Theory to better understand the development process.Conference Object Citation Count: 2Process matchmaking on a P2P environment(Ieee Computer Soc, 2006) Çelebi, Remzi; Ellezer, Huseyin; Cereci, İbrahim; Cereci, Ibrahim; Kilic, Hurevreni; Computer EngineeringA process matchmaking environment based on P2P architecture and Gnutella protocol is established Java Agent Development Framework (JADE) is used as middleware. The processes are modeled as one-input transition systems augmented by goal state descriptions. A polynomial-time algorithm for handling matchmaking of peer process encounters is developed The environment can easily be customized to a specific application domain by simple user-interface modifications and through the development of related state ontologies.Conference Object Citation Count: 13Search-Based Parallel Refactoring Using Population-Based Direct Approaches(Springer-verlag Berlin, 2011) Kilic, Hurevren; Koc, Ekin; Cereci, IbrahimAutomated 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.