Computer Engineering / Bilgisayar Mühendisliği
Permanent URI for this collectionhttps://hdl.handle.net/11147/10
Browse
6 results
Search Results
Now showing 1 - 6 of 6
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: 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: 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.Article Citation - WoS: 26Citation - Scopus: 30Ensuring Performance and Provider Profit Through Data Replication in Cloud Systems(Springer Verlag, 2017) Tos, Uras; Mokadem, Riad; Hameurlain, Abdelkader; Ayav, Tolga; Bora, ŞebnemCloud computing is a relatively recent computing paradigm that is often the answer for dealing with large amounts of data. Tenants expect the cloud providers to keep supplying an agreed upon quality of service, while cloud providers aim to increase profits as it is a key ingredient of any economic enterprise. In this paper, we propose a data replication strategy for cloud systems that satisfies the response time objective for executing queries while simultaneously enables the provider to return a profit from each execution. The proposed strategy estimates the response time of the queries and performs data replication in a way that the execution of any particular query is still estimated to be profitable for the provider. We show with simulations that how the proposed strategy fulfills these two criteria.Article Citation - WoS: 69Citation - Scopus: 89Joint Optimization for Object Class Segmentation and Dense Stereo Reconstruction(Springer Verlag, 2012) Ladicky, Lubor; Sturgess, Paul; Russell, Chris; Sengupta, Sunando; Baştanlar, Yalın; Clocksin, William; Torr, Philip H.S.The problems of dense stereo reconstruction and object class segmentation can both be formulated as Random Field labeling problems, in which every pixel in the image is assigned a label corresponding to either its disparity, or an object class such as road or building. While these two problems are mutually informative, no attempt has been made to jointly optimize their labelings. In this work we provide a flexible framework configured via cross-validation that unifies the two problems and demonstrate that, by resolving ambiguities, which would be present in real world data if the two problems were considered separately, joint optimization of the two problems substantially improves performance. To evaluate our method, we augment the Leu-ven data set (http://cms.brookes.ac.uk/research/visiongroup/ files/Leuven.zip), which is a stereo video shot from a car driving around the streets of Leuven, with 70 hand labeled object class and disparity maps. We hope that the release of these annotations will stimulate further work in the challenging domain of street-view analysis. Complete source code is publicly available (http://cms.brookes.ac.uk/ staff/Philip-Torr/ale.htm). © 2011 Springer Science+Business Media, LLC.Article Citation - WoS: 24Citation - Scopus: 31Dynamic Replication Strategies in Data Grid Systems: A Survey(Springer Verlag, 2015) Tos, Uras; Mokadem, Riad; Hameurlain, Abdelkader; Ayav, Tolga; Bora, ŞebnemIn data grid systems, data replication aims to increase availability, fault tolerance, load balancing and scalability while reducing bandwidth consumption, and job execution time. Several classification schemes for data replication were proposed in the literature, (i) static vs. dynamic, (ii) centralized vs. decentralized, (iii) push vs. pull, and (iv) objective function based. Dynamic data replication is a form of data replication that is performed with respect to the changing conditions of the grid environment. In this paper, we present a survey of recent dynamic data replication strategies. We study and classify these strategies by taking the target data grid architecture as the sole classifier. We discuss the key points of the studied strategies and provide feature comparison of them according to important metrics. Furthermore, the impact of data grid architecture on dynamic replication performance is investigated in a simulation study. Finally, some important issues and open research problems in the area are pointed out.