Computer Engineering / Bilgisayar Mühendisliği
Permanent URI for this collectionhttps://hdl.handle.net/11147/10
Browse
27 results
Search Results
Article Asking the Right Questions To Solve Algebraic Word Problems(TÜBİTAK - Türkiye Bilimsel ve Teknolojik Araştırma Kurumu, 2022) Çelik, Ege Yiğit; Orulluoğlu, Zeynel; Mertoğlu, Rıdvan; Tekir, SelmaWord algebra problems are among challenging AI tasks as they combine natural language understanding with a formal equation system. Traditional approaches to the problem work with equation templates and frame the task as a template selection and number assignment to the selected template. The recent deep learning-based solutions exploit contextual language models like BERT and encode the natural language text to decode the corresponding equation system. The proposed approach is similar to the template-based methods as it works with a template and fills in the number slots. Nevertheless, it has contextual understanding because it adopts a question generation and answering pipeline to create tuples of numbers, to finally perform the number assignment task by custom sets of rules. The inspiring idea is that by asking the right questions and answering them using a state-of-the-art language model-based system, one can learn the correct values for the number slots in an equation system. The empirical results show that the proposed approach outperforms the other methods significantly on the word algebra benchmark dataset alg514 and performs the second best on the AI2 corpus for arithmetic word problems. It also has superior performance on the challenging SVAMP dataset. Though it is a rule-based system, simple rule sets and relatively slight differences between rules for different templates indicate that it is highly probable to develop a system that can learn the patterns for the collection of all possible templates, and produce the correct equations for an example instance.Article Citation - WoS: 7Citation - Scopus: 12A Survey on Organizational Choices for Microservice-Based Software Architectures(TÜBİTAK, 2022) Ünlü, Hüseyin; Bilgin, Burak; Demirörs, OnurDuring the last decade, the demand for more flexible, responsive, and reliable software applications increased exponentially. The availability of internet infrastructure and new software technologies to respond to this demand led to a new generation of applications. As a result, cloud-based, distributed, independently deployable web applications working together in a microservice-based software architecture style have gained popularity. The style has been a common practice in the industry and successfully utilized by companies. Adopting this style demands software organizations to transform their culture. However, there is a lack of research studies that explores common practices for microservices. Thus, we performed a survey to explore the organizational choices on software analysis, design, size measurement, and effort estimation when working with microservices. The results provide a snapshot of the software industry that utilizes microservices. We provide insight for software organizations to transform their culture and suggest challenges researchers can focus on in the area.Article Citation - Scopus: 1Performance Analysis and Feature Selection for Network-Based Intrusion Detection With Deep Learning(Türkiye Klinikleri, 2022) Caner, Serhat; Erdoğmuş, Nesli; Erten, Yusuf MuratAn intrusion detection system is an automated monitoring tool that analyzes network traffic and detects malicious activities by looking out either for known patterns of attacks or for an anomaly. In this study, intrusion detection and classification performances of different deep learning based systems are examined. For this purpose, 24 deep neural networks with four different architectures are trained and evaluated on CICIDS2017 dataset. Furthermore, the best performing model is utilized to inspect raw network traffic features and rank them with respect to their contributions to success rates. By selecting features with respect to their ranks, sets of varying size from 3 to 77 are assessed in terms of classification accuracy and time efficiency. The results show that recurrent neural networks with a certain level of complexity can achieve comparable success rates with state-of-the-art systems using a small feature set of size 9; while the average time required to classify a test sample is halved compared to the complete set.Article Citation - WoS: 1Citation - Scopus: 2Information Retrieval-Based Bug Localization Approach With Adaptive Attribute Weighting(TÜBİTAK - Türkiye Bilimsel ve Teknolojik Araştırma Kurumu, 2021) ErşahIn, Mustafa; Utku, Semih; Kılınç, Deniz; ErşahIn, BuketSoftware quality assurance is one of the crucial factors for the success of software projects. Bug fixing has an essential role in software quality assurance, and bug localization (BL) is the first step of this process. BL is difficult and time-consuming since the developers should understand the flow, coding structure, and the logic of the program. Information retrieval-based bug localization (IRBL) uses the information of bug reports and source code to locate the section of code in which the bug occurs. It is difficult to apply other tools because of the diversity of software development languages, design patterns, and development standards. The aim of this study is to build an adaptive IRBL tool and make it usable by more companies. BugSTAiR solves the aforementioned problem by means of the adaptive attribute weighting (AAW) algorithm and is evaluated on four open-source projects which are well-known benchmark datasets on BL. One of them is BLIA which is the state of the art in bug localization area and another is BLUIR which is a well-known BL tool. According to the promising results of experiments, Top1 rank of BugSTAiR is 2% and MAP is 10% better than BLIA's results on AspectJ and it has localized 4.6% of all bugs in Top1 and its precision is 6.1% better than BLIA on SWT, respectively. On the other side, it is 20% better in the Top1 metric and 30% in precision than BLUIR.Article Citation - WoS: 2Citation - Scopus: 1Mutant Selection by Using Fourier Expansion(Türkiye Klinikleri Journal of Medical Sciences, 2020) Takan, Savaş; Ayav, TolgaMutation analysis is a widely used technique to evaluate the effectiveness of test cases in both hardware and software testing. The original model is mutated systematically under certain fault assumptions and test cases are checked against the mutants created to see whether the test cases can detect the faults or not. Mutation analysis is usually a computationally intensive task, particularly in finite state machine (FSM) testing due to a possibly huge amount of mutants. Random selection could be a practical reduction method under the assumption that each mutant is identical in terms of the probability of occurrence of its associating fault. The present study proposes a mutant selection method based on Fourier analysis of Boolean functions. Fourier helps to identify the most effective transitions on the output so that the mutants related to those transitions can be selected. Such mutants are considered more important since they are more likely to be killed. To evaluate the method, test cases are generated by the well-known W method, which has the capability of detecting every potential fault. The original and reduced sets of mutants are compared with respect to their importance values. Evaluations show that the mutants selected by the proposed technique are more effective, which reduces the cost of mutation analysis without sacrificing the performance of the mutation analysis.Article Estimating Spatiotemporal Focus of Documents Using Entropy With Pmi(Türkiye Klinikleri Journal of Medical Sciences, 2020) Yaşar, Damla; Tekir, SelmaMany text documents are spatiotemporal in nature, i.e. contents of a document can be mapped to a specific time period or location. For example, a news article about the French Revolution can be mapped to year 1789 as time and France as place. Identifying this time period and location associated with the document can be useful for various downstream applications such as document reasoning or spatiotemporal information retrieval. In this paper, temporal entropy with pointwise mutual information (PMI) is proposed to estimate the temporal focus of a document. PMI is used to measure the association of words with time expressions. Moreover, a word’s temporal entropy is considered as a weight to its association with a time point and a single time point with the highest overall score is chosen as the focus time of a document. The proposed method is generic in the sense that it can also be applied for spatial focus estimation of documents. In the case of spatial entropy with PMI, PMI is used to calculate the association between words and place entities. The effectiveness of our proposed methods for spatiotemporal focus estimation is evaluated on diverse datasets of text documents. The experimental evaluation confirms the superiority of our proposed temporal and spatial focus estimation methods.Article Artırılmış Gerçeklik için Brıef Betimleyicileri ve Yerelliğe Duyarlı Karma Yöntemi ile Nesne Arama(Pamukkale Üniversitesi, 2017) Özuysal, MustafaBu çalışmada mobil artırılmış gerçeklik için kullanılabilecek bir nesne arama yöntemi sunulmaktadır. Temel olarak yöntem anahtar nokta betimleyicilerinin eşleştirilmesine ve bu anahtar nokta eşlerinin geometrik kıstaslar ile süzülmesine dayanmaktadır. Eşlemenin hızlandırılması için gerekli iyileştirmeler detayları ile verilmektedir. Ayrıca, Yerelliğe Duyarlı Karma işleminin performansının bilgi erişim yaklaşımlarından faydalanılarak arttırılabileceği de gösterilmiştirArticle Citation - WoS: 1Citation - Scopus: 1A User-Assisted Thread-Level Vulnerability Assessment Tool(Wiley, 2019) Öz, Işıl; Topçuoğlu, Haluk Rahmi; Tosun, OğuzThe system reliability becomes a critical concern in modern architectures with the scale down of circuits. To deal with soft errors, the replication of system resources has been used at both hardware and software levels. Since the redundancy causes performance degradation, it is required to explore partial redundancy techniques that replicate the most vulnerable parts of the code. The redundancy level of user applications depends on user preferences and may be different for the users with different requirements. In this work, we propose a user-assisted reliability assessment tool based on critical thread analysis for redundancy in parallel architectures. Our analysis evaluates the application threads of a parallel program by considering their criticality in the execution and selects the most critical thread or threads to be replicated. Moreover, we extend our analysis by exploring critical regions of individual threads and execute redundantly only those regions to reduce redundancy overhead. Our experimental evaluation indicates that the replication of the most critical thread improves the system reliability more (up to 10% for blackscholes application) than the replication of any other thread. The partial thread replication based on critical region analysis also reduces the vulnerability of the system by considering a fine-grained approach.Article Citation - WoS: 9Citation - Scopus: 11A Qualitative Survey on Frequent Subgraph Mining(De Gruyter, 2018) Güvenoğlu, Büşra; Ergenç Bostanoğlu, BelginData mining is a popular research area that has been studied by many researchers and focuses on finding unforeseen and important information in large databases. One of the popular data structures used to represent large heterogeneous data in the field of data mining is graphs. So, graph mining is one of the most popular subdivisions of data mining. Subgraphs that are more frequently encountered than the user-defined threshold in a database are called frequent subgraphs. Frequent subgraphs in a database can give important information about this database. Using this information, data can be classified, clustered and indexed. The purpose of this survey is to examine frequent subgraph mining algorithms (i) in terms of frequent subgraph discovery process phases such as candidate generation and frequency calculation, (ii) categorize the algorithms according to their general attributes such as input type, dynamicity of graphs, result type, algorithmic approach they are based on, algorithmic design and graph representation as well as (iii) to discuss the performance of algorithms in comparison to each other and the challenges faced by the algorithms recently.Editorial Computational Mirnomics(Informationsmanagement in der Biotechnologie e.V. (IMBio e.V.), 2016) Allmer, Jens; Yousef, MalikThe term MicroRNA or its contraction miRNA currently appears in 21,215 titles of abstracts, published between 1997 and now, available on Pubmed (2016-21-22:12:59 EET). 4,108 of these were published in 2016 alone which signifies the importance of miRNA-related research. MicroRNAs can be detected experimentally using various techniques like directional cloning of endogenous small RNAs but they are time consuming [1]. Additionally, it is necessary for the miRNA and its mRNA target(s) to be co-expressed to infer a functional relationship which is difficult, if not impossible, to achieve [2]. Since experimental approaches are facing such difficulties, they have been complemented by computational approaches [3] thereby defining the field of computational miRNomics.
- «
- 1 (current)
- 2
- 3
- »