Computer Engineering / Bilgisayar Mühendisliği
Permanent URI for this collectionhttps://hdl.handle.net/11147/10
Browse
54 results
Search Results
Now showing 1 - 10 of 54
Article Citation - WoS: 55Citation - Scopus: 56Evaluation of an Artificial Intelligence System for Diagnosing Scaphoid Fracture on Direct Radiography(Springer Verlag, 2020) Özkaya, Emre; Topal, Fatih Esad; Bulut, Tuğrul; Gürsoy, Merve; Özuysal, Mustafa; Karakaya, ZeynepPurpose The aim of this study is to determine the diagnostic performance of artificial intelligence with the use of convolutional neural networks (CNN) for detecting scaphoid fractures on anteroposterior wrist radiographs. The performance of the deep learning algorithm was also compared with that of the emergency department (ED) physician and two orthopaedic specialists (less experienced and experienced in the hand surgery). Methods A total 390 patients with AP wrist radiographs were included in the study. The presence/absence of the fracture on radiographs was confirmed via CT. The diagnostic performance of the CNN, ED physician and two orthopaedic specialists (less experienced and experienced) as measured by AUC, sensitivity, specificity, F-Score and Youden index, to detect scaphoid fractures was evaluated and compared between the groups. Results The CNN had 76% sensitivity and 92% specificity, 0.840 AUC, 0.680 Youden index and 0.826Fscore values in identifying scaphoid fractures. The experienced orthopaedic specialist had the best diagnostic performance according to AUC. While CNN's performance was similar to a less experienced orthopaedic specialist, it was better than the ED physician. Conclusion The deep learning algorithm has the potential to be used for diagnosing scaphoid fractures on radiographs. Artificial intelligence can be useful for scaphoid fracture diagnosis particularly in the absence of an experienced orthopedist or hand surgeon.Article Citation - WoS: 3Citation - Scopus: 4Affordable person detection in omnidirectional cameras using radial integral channel features(Springer Verlag, 2019) Demiröz, Barış Evrim; Salah, Albert Ali; Baştanlar, Yalın; Akarun, LaleOmnidirectional cameras cover more ground than perspective cameras, at the expense of resolution. Their comprehensive field of view makes omnidirectional cameras appealing for security and ambient intelligence applications. Person detection is usually a core part of such applications. Conventional methods fail for omnidirectional images due to different image geometry and formation. In this study, we propose a method for person detection in omnidirectional images, which is based on the integral channel features approach. Features are extracted from various channels, such as LUV and gradient magnitude, and classified using boosted decision trees. Features are pixel sums inside annular sectors (doughnut slice shapes) contained by the detection window. We also propose a novel data structure called radial integral image that allows to calculate sums inside annular sectors efficiently. We have shown with experiments that our method outperforms the previous state of the art and uses significantly less computational resources.Article Citation - WoS: 22Citation - Scopus: 40Correlation of Critical Success Factors With Success of Software Projects: an Empirical Investigation(Springer Verlag, 2019) Garousi, Vahid; Tarhan, Ayça; Pfahl, Dietmar; Coşkunçay, Ahmet; Demirörs, OnurSoftware engineering researchers have, over the years, proposed different critical success factors (CSFs) which are believed to be critically correlated with the success of software projects. To conduct an empirical investigation into the correlation of CSFs with success of software projects, we adapt and extend in this work an existing contingency fit model of CSFs. To archive the above objective, we designed an online survey and gathered CSF-related data for 101 software projects in the Turkish software industry. Among our findings is that the top three CSFs having the most significant associations with project success were: (1) team experience with the software development methodologies, (2) team's expertise with the task, and (3) project monitoring and controlling. A comprehensive correlation analysis between the CSFs and project success indicates positive associations between the majority of the factors and variables, however, in most of the cases at non-significant levels. By adding to the body of evidence in this field, the results of the study will be useful for a wide audience. Software managers can use the results to prioritize the improvement opportunities in their organizations w.r.t. the discussed CSFs. Software engineers might use the results to improve their skills in different dimensions, and researchers might use the results to prioritize and conduct follow-up in-depth studies on those factors.Article Citation - WoS: 5Citation - Scopus: 9Modeling Cultures of the Embedded Software Industry: Feedback From the Field(Springer Verlag, 2021) Akdur, Deniz; Say, Bilge; Demirörs, OnurEngineering of modern embedded systems requires complex technical, managerial and operational processes. To cope with the complexity, modeling is a commonly used approach in the embedded software industry. The modeling approaches in embedded software vary since the characteristics of modeling such as purpose, medium type and life cycle phase differ among systems and industrial sectors. The objective of this paper is to detail the use of a characterization model MAPforES ("Modeling Approach Patterns for Embedded Software"). This paper presents the results of applying MAPforES in multiple case studies. The applications are performed in three sectors of the embedded software industry: defense and aerospace, automotive and transportation, and consumer electronics. A series of both structured and semi-structured interviews with 35 embedded software professionals were conducted as part of the case studies. The characterization model was successfully applied to these cases. The results show that identifying individual patterns provides insight for improving both individual behavior and the behavior of projects and organizations.Article Citation - WoS: 9Citation - Scopus: 8Scalable Parallel Implementation of Migrating Birds Optimization for the Multi-Objective Task Allocation Problem(Springer Verlag, 2021) Öz, Dindar; Öz, IşılAs the distributed computing systems have been widely used in many research and industrial areas, the problem of allocating tasks to available processors in the system efficiently has been an important concern. Since the problem is proven to be NP-hard, heuristic-based optimization techniques have been proposed to solve the task allocation problem. Particularly, the current cloud-based systems have been grown massively requiring multiple features like lower cost, higher reliability, and higher throughput; therefore, the problem has become more challenging and approximate methods have gained more importance. Migrating birds optimization (MBO) algorithm offers successful solutions, especially for quadratic assignment problems. Inspired by the movement of the birds, it exhibits good results by its population-based approach . Since the algorithm needs to deal with many individuals in the population, and the neighbor solution generation phase takes substantial time for large problem instances, we need parallelism to have execution time improvements and make the algorithm practical for large-scale problems. In this work, we propose a scalable parallel implementation of the MBO algorithm, PMBO, for the multi-objective task allocation problem. We redesigned the implementation of the MBO algorithm so that its computationally heavy independent tasks are executed concurrently in separate threads. We compare our implementation with three parallel island-based approaches. The experimental results demonstrate that our implementation exhibits substantial solution quality improvements for difficult problem instances as the computing resources, namely parallelism, increase. Our scalability analysis also presents that higher parallelism levels offer larger solution improvement for the PMBO over the island-based parallel implementations on very hard problem instances.Article Citation - WoS: 6Citation - Scopus: 6Estimating Software Robustness in Relation To Input Validation Vulnerabilities Using Bayesian Networks(Springer Verlag, 2018) Ufuktepe, Ekincan; Tuğlular, TuğkanEstimating the robustness of software in the presence of invalid inputs has long been a challenging task owing to the fact that developers usually fail to take the necessary action to validate inputs during the design and implementation of software. We propose a method for estimating the robustness of software in relation to input validation vulnerabilities using Bayesian networks. The proposed method runs on all program functions and/or methods. It calculates a robustness value using information on the existence of input validation code in the functions and utilizing common weakness scores of known input validation vulnerabilities. In the case study, ten well-known software libraries implemented in the JavaScript language, which are chosen because of their increasing popularity among software developers, are evaluated. Using our method, software development teams can track changes made to software to deal with invalid inputs.Article Citation - WoS: 7Citation - Scopus: 11Locality-Aware Task Scheduling for Homogeneous Parallel Computing Systems(Springer Verlag, 2018) Bhatti, Muhammad Khurram; Öz, Işıl; Amin, Sarah; Mushtaq, Maria; Farooq, Umer; Popov, Konstantin; Brorsson, MatsIn systems with complex many-core cache hierarchy, exploiting data locality can significantly reduce execution time and energy consumption of parallel applications. Locality can be exploited at various hardware and software layers. For instance, by implementing private and shared caches in a multi-level fashion, recent hardware designs are already optimised for locality. However, this would all be useless if the software scheduling does not cast the execution in a manner that promotes locality available in the programs themselves. Since programs for parallel systems consist of tasks executed simultaneously, task scheduling becomes crucial for the performance in multi-level cache architectures. This paper presents a heuristic algorithm for homogeneous multi-core systems called locality-aware task scheduling (LeTS). The LeTS heuristic is a work-conserving algorithm that takes into account both locality and load balancing in order to reduce the execution time of target applications. The working principle of LeTS is based on two distinctive phases, namely; working task group formation phase (WTG-FP) and working task group ordering phase (WTG-OP). The WTG-FP forms groups of tasks in order to capture data reuse across tasks while the WTG-OP determines an optimal order of execution for task groups that minimizes the reuse distance of shared data between tasks. We have performed experiments using randomly generated task graphs by varying three major performance parameters, namely: (1) communication to computation ratio (CCR) between 0.1 and 1.0, (2) application size, i.e., task graphs comprising of 50-, 100-, and 300-tasks per graph, and (3) number of cores with 2-, 4-, 8-, and 16-cores execution scenarios. We have also performed experiments using selected real-world applications. The LeTS heuristic reduces overall execution time of applications by exploiting inter-task data locality. Results show that LeTS outperforms state-of-the-art algorithms in amortizing inter-task communication cost.Conference Object Citation - Scopus: 12Incremental Itemset Mining Based on Matrix Apriori Algorithm(Springer Verlag, 2012) Oğuz, Damla; Ergenç, BelginDatabases are updated continuously with increments and re-running the frequent itemset mining algorithms with every update is inefficient. Studies addressing incremental update problem generally propose incremental itemset mining methods based on Apriori and FP-Growth algorithms. Besides inheriting the disadvantages of base algorithms, incremental itemset mining has challenges such as handling i) increments without re-running the algorithm, ii) support changes, iii) new items and iv) addition/deletions in increments. In this paper, we focus on the solution of incremental update problem by proposing the Incremental Matrix Apriori Algorithm. It scans only new transactions, allows the change of minimum support and handles new items in the increments. The base algorithm Matrix Apriori works without candidate generation, scans database only twice and brings additional advantages. Performance studies show that Incremental Matrix Apriori provides speed-up between 41% and 92% while increment size is varied between 5% and 100%.Conference Object Citation - Scopus: 6A Comprehensive Evaluation of Agile Maturity Self-Assessment Surveys(Springer Verlag, 2018) Yürüm, Ozan Raşit; Demirörs, Onur; Rabhi, FethiAgile methodologies are adapted by growing number of software organizations. Agile maturity (also called agility) assessment is a way to ascertain the degree of this adoption and determine a course of action to improve agile maturity. There are a number of agile maturity assessment surveys in order to assess team or organization agility and many of them require no guidance. However, the usability of these surveys are not widely studied. The purpose of this study is to determine available agile maturity self-assessment surveys and evaluate their strengths and weaknesses for agile maturity assessment. An extensive case study is conducted to measure the sufficiency of 22 available agile maturity self-assessment surveys according to the seven expected features: comprehensiveness, fitness for purpose, discriminativeness, objectivity, conciseness, generalizability, and suitability for multiple assessment. Our case study results show that they do not satisfy all of the expected features fully but are helpful in some degree based on the purpose of usage.Conference Object Citation - Scopus: 2Adapting Spice for Development of a Reference Model for Building Information Modeling - Bim-Carem(Springer Verlag, 2018) Yılmaz, Gökçen; Akçamete, Aslı; Demirörs, OnurBuilding Information Modelling (BIM) is highly adopted by Architecture, Engineering, Construction and Facilities Management (AEC/FM) companies around the world due to its benefits such as improving collaboration of stakeholders in projects. Effective implementation of BIM in organizations requires assessment of existing BIM performances of AEC/FM processes. We developed a reference model for BIM capability assessments based on the meta-model of the ISO/IEC 330xx (the most recent version of SPICE) family of standards. BIM-CAREM can be used for identifying the BIM capabilities of the AEC/FM processes. The model was updated iteratively based on the expert reviews and an exploratory case study, and was evaluated via four explanatory case studies. The assessment results showed that the BIM-CAREM is capable of identifying BIM capabilities of specific processes. In this paper, we present how we utilized ISO/IEC 330xx for developing BIM-CAREM as well as the iterations of the model and one of the explanatory case studies as an example.