Computer Engineering / Bilgisayar Mühendisliği

Permanent URI for this collectionhttps://hdl.handle.net/11147/10

Browse

Filters

2006 - 200912010 - 20174

Settings

Publisher: search.filters.publisher.Association for Computing Machinery (ACM)Scopus Q: search.filters.scopusQuartile.N/A

Search Results

Now showing 1 - 5 of 5
  • Conference Object
    Citation - Scopus: 41
    Effort Estimation for Agile Software Development: Comparative Case Studies Using Cosmic Functional Size Measurement and Story Points
    (Association for Computing Machinery (ACM), 2017) Salmanoğlu, Murat; Hacaloğlu, Tuna; Demirörs, Onur
    Agile methodologies have gained significant popularity among software development organizations during the last decade. Although agile methodologies are regarded as minimizing formal processes, they still utilize an estimation methodology for proper management. Story point is the most common input for agile effort estimation. Story point is an arbitrary measure; it reflects experiences of project participants. On the other hand, functional size is an alternative measure used in practice as an input for effort estimation. In this research, we collect and present the outcomes of three case studies which compared the effectiveness of COSMIC-based and story point based effort estimation in agile context. On selected projects of these organizations, software functional size was measured with COSMIC functional size measurement methodology. Effort prediction models were formed by using COSMIC size and actual effort spent; and the models were tested in terms of their effectiveness. The results show controversial outcomes. For all the cases, COSMIC based estimation was more precise. Therefore, COSMIC is an appropriate measure to estimate the effort in organizations that adopt agile software development. It is also observed that COSMIC allowed for computing productivity which has less disperse distribution than the productivity computed with SP. The data is also provided to help other researchers conduct their own studies.
  • Conference Object
    Citation - Scopus: 5
    Effort Estimation Methods for Erp Projects Based on Function Points: a Case Study
    (Association for Computing Machinery (ACM), 2017) Küçükateş Ömüral, Neslihan; Demirörs, Onur
    Enterprise Resource Planning (ERP) Systems evolve at a rapid pace based on customer and industry expectations. As a result, historic project data for these kinds of projects lose their value especially for analogy based estimation methods. In this rapidly evolving domain, function point based methods might provide a sound alternative for ERP effort estimation. This paper presents the results obtained by applying three methods published in the literature in which function points are used as an input for ERP effort estimation. The evaluation of these methods with respect to their measurement processes and estimation errors are presented; their advantages and disadvantages are discussed.
  • Conference Object
    Citation - Scopus: 2
    Comparison of Dynamic Itemset Mining Algorithms for Multiple Support Thresholds
    (Association for Computing Machinery (ACM), 2017) Abuzayed, Nourhan; Ergenç, Belgin
    Mining1 frequent itemsets is an important part of association rule mining process. Handling dynamic aspect of databases and multiple support threshold requirements of items are two important challenges of frequent itemset mining algorithms. Most of the existing dynamic itemset mining algorithms are devised for single support threshold whereas multiple support threshold algorithms are static. This work focuses on dynamic update problem of frequent itemsets under multiple support thresholds and proposes tree-based Dynamic CFP-Growth++ algorithm. Proposed algorithm is compared to our previous dynamic algorithm Dynamic MIS [50] and a recent static algorithm CFP-Growth++ [2] and, findings are; in dynamic database, 1) both of the dynamic algorithms are better than the static algorithm CFP-Growth++, 2) as memory usage performance; Dynamic CFP-Growth++ performs better than Dynamic MIS, 3) as execution time performance; Dynamic MIS is better than Dynamic CFP-Growth++. In short, Dynamic CFP-Growth++ and Dynamic MIS have a trade-off relationship in terms of memory usage and execution time.
  • Conference Object
    Citation - Scopus: 2
    Resource Allocation Algorithm for a Relational Join Operator in Grid Systems
    (Association for Computing Machinery (ACM), 2012) Çokuslu, Deniz; Hameurlain, Abdelkader; Erciyeş, Kayhan; Morvan, Franck
    Grid systems become very popular during the last decade because of their rapidly increasing computational capabilities. On the other hand, the advances on different domains cause enormous increase in the scale of the manipulated data. This issue augments the importance of distributed query processing and causes researchers to port their underlying environment onto the grid systems. However the dynamicity, heterogeneity and large scale characteristics of grid systems pose new problems for the distributed query processing domain. Resource allocation for query processing in grid systems is one of these problems, which attracts many researchers' attention. In this paper, we propose a new resource allocation algorithm for one relational join operator in a query considering characteristics of the grid systems. We provide theoretical analyses of the proposed algorithm and we consolidate analyses with the simulations. Copyright © 2012 ACM.
  • Report
    Implementing Fault-Tolerance in Real-Time Systems by Automatic Program Transformations
    (Association for Computing Machinery (ACM), 2006) Ayav, Tolga; Fradet, Pascal; Girault, Alain
    We present a formal approach to implement and certify fault-tolerance in real-time embedded systems. The fault-intolerant initial system consists of a set of independent periodic tasks scheduled onto a set of fail-silent processors. We transform the tasks such that, assuming the availability of an additional spare processor, the system tolerates one failure at a time (transient or permanent). Failure detection is implemented using heartbeating, and failure masking using checkpointing and roll-back. These techniques are described and implemented by automatic program transformations on the tasks' programs. The proposed formal approach to fault-tolerance by program transformation highlights the benefits of separation of concerns and allows us to establish correctness properties.