Computer Engineering / Bilgisayar Mühendisliği

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

Browse

Filters

2016 - 201912020 - 20233

Settings

Access Right: Closed AccessScopus Q: search.filters.scopusQuartile.Q4

Search Results

Now showing 1 - 4 of 4
  • Conference Object
    Citation - Scopus: 1
    Monocular Vision-Based Prediction of Cut-In Manoeuvres With Lstm Networks
    (Springer, 2023) Nalçakan, Yağız; Baştanlar, Yalın
    Advanced driver assistance and automated driving systems should be capable of predicting and avoiding dangerous situations. In this paper, we first discuss the importance of predicting dangerous lane changes and provide its description as a machine learning problem. After summarizing the previous work, we propose a method to predict potentially dangerous lane changes (cut-ins) of the vehicles in front. We follow a computer vision-based approach that only employs a single in-vehicle RGB camera, and we classify the target vehicle’s maneuver based on the recent video frames. Our algorithm consists of a CNN-based vehicle detection and tracking step and an LSTM-based maneuver classification step. It is computationally efficient compared to other vision-based methods since it exploits a small number of features for the classification step rather than feeding CNNs with RGB frames. We evaluated our approach on a publicly available driving dataset and a lane change detection dataset. We obtained 0.9585 accuracy with the side-aware two-class (cut-in vs. lane-pass) classification model. Experiment results also reveal that our approach outperforms state-of-the-art approaches when used for lane change detection. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.
  • Article
    Citation - Scopus: 5
    Unifying Behavioral and Feature Modeling for Testing of Software Product Lines
    (World Scientific Publishing, 2023) Belli, Fevzi; Tuğlular, Tuğkan; Ufuktepe, Ekincan
    Existing software product line (SPL) engineering testing approaches generally provide positive testing that validates the SPL's functionality. Negative testing is commonly neglected. This research aims to unify behavioral and feature models of an SPL, enable testing before and after variability binding for domain-centric and product-centric testing, and combine positive and negative testing for a holistic testing view. This study suggests behavioral modeling with event sequence graphs (ESGs). This heterogeneous modeling strategy supports bottom-up domain testing and top-down product testing with the feature model. This new feature-oriented ESG test creation method generates shorter test sequences than the original ESG optimum test sequences. Statechart and original ESG test-generating methods are compared. Positive testing findings are similar. The Statechart technique generated 12 test cases with 59 events, whereas the ESG technique created six test cases with 60 events. The ESG technique generated 205 negative test cases with 858 events with the Test Suite Designer tool. However, the Conformiq Designer tool for the Statechart technique does not have a negative test case generation capability. It is shown that the proposed ESG-based holistic approach confirms not only the desirable (positive) properties but also the undesirable (negative) ones. As an additional research, the traditional ESG test-generating approach is compared to the new feature-oriented method on six SPLs of different sizes and features. Our case study results show that the traditional ESG test generation approach demonstrated higher positive test generation scores compare to the proposed feature-oriented test generation approach. However, our proposed feature-oriented test generation approach is capable of generating shorter test sequences, which could be beneficial for reducing the execution time of test cases compared to traditional ESG approach. Finally, our case study has also shown that regardless of the test generation approach, there has been found no significant difference between the Bottom-up and Top-down test strategies with respect to their positive test generation scores. © World Scientific Publishing Company.
  • Conference Object
    Citation - Scopus: 1
    A Novel Feature To Predict Buggy Changes in a Software System
    (Springer, 2022) Yılmaz, Rahime; Nalçakan, Yağız; Haktanır, Elif
    Researchers have successfully implemented machine learning classifiers to predict bugs in a change file for years. Change classification focuses on determining if a new software change is clean or buggy. In the literature, several bug prediction methods at change level have been proposed to improve software reliability. This paper proposes a model for classification-based bug prediction model. Four supervised machine learning classifiers (Support Vector Machine, Decision Tree, Random Forrest, and Naive Bayes) are applied to predict the bugs in software changes, and performance of these four classifiers are characterized. We considered a public dataset and downloaded the corresponding source code and its metrics. Thereafter, we produced new software metrics by analyzing source code at class level and unified these metrics with the existing set. We obtained new dataset to apply machine learning algorithms and compared the bug prediction accuracy of the newly defined metrics. Results showed that our merged dataset is practical for bug prediction based experiments. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.
  • Conference Object
    Citation - WoS: 2
    Citation - Scopus: 2
    Dynamic Itemset Mining Under Multiple Support Thresholds
    (IOS Press, 2016) Abuzayed, Nourhan; Ergenç Bostanoğlu, Belgin; Ergenç, Belgin
    Handling dynamic aspect of databases and multiple support threshold requirements of items are two important challenges of frequent itemset mining algorithms. Existing dynamic itemset mining algorithms are devised for single support threshold whereas multiple support threshold algorithms assume that the databases are static. This paper focuses on dynamic update problem of frequent itemsets under MIS (Multiple Item Support) thresholds and introduces Dynamic MIS algorithm. It is i) tree based and scans the database once, ii) considers multiple support thresholds, and iii) handles increments of additions, additions with new items and deletions. Proposed algorithm is compared to CFP-Growth++ and findings are; in dynamic database 1) Dynamic MIS performs better than CFP-Growth++ since it runs only on increments and 2) Dynamic MIS can achieve speed-up up to 56 times against CFP-Growth++.