Computer Engineering / Bilgisayar Mühendisliği
Permanent URI for this collectionhttps://hdl.handle.net/11147/10
Browse
5 results
Search Results
Now showing 1 - 5 of 5
Article Citation - WoS: 4Citation - Scopus: 5Generating Ontologies From Relational Data With Fuzzy-Syllogistic Reasoning(Springer Verlag, 2015) Kumova, Bora İsmailExisting standards for crisp description logics facilitate information exchange between systems that reason with crisp ontologies. Applications with probabilistic or possibilistic extensions of ontologies and reasoners promise to capture more information, because they can deal with more uncertainties or vagueness of information. However, since there are no standards for either extension, information exchange between such applications is not generic. Fuzzy-syllogistic reasoning with the fuzzy-syllogistic system4S provides 2048 possible fuzzy inference schema for every possible triple concept relationship of an ontology. Since the inference schema are the result of all possible set-theoretic relationships between three sets with three out of 8 possible fuzzy-quantifiers, the whole set of 2048 possible fuzzy inferences can be used as one generic fuzzy reasoner for quantified ontologies. In that sense, a fuzzy syllogistic reasoner can be employed as a generic reasoner that combines possibilistic inferencing with probabilistic ontologies, thus facilitating knowledge exchange between ontology applications of different domains as well as information fusion over them.Conference Object Citation - WoS: 5Citation - Scopus: 10An Exploratory Study on Usage of Process Mining in Agile Software Development(Springer Verlag, 2017) Erdem, Sezen; Demirörs, OnurAgile software development methods have become popular in the software development field during the last decade. Majority of software organizations develop or claim to develop software based on agile methods. Process mining is a process management technique that allows for the analysis of business processes based on the event logs. The aim of process mining is to discover, monitor and improve real processes, but not assumed processes, by extracting knowledge from event logs readily available in information systems. Process mining can be used to discover agile processes followed in organizations/projects to determine the actual processes followed. Process mining can also establish the necessary evidences for assessing or measuring the agility of organizations. This study explores the usability of process mining methods in agile software development context. The results of an exploratory case study on using process mining techniques in a software project managed by Scrum are depicted. We also discuss the benefits of the process mining techniques used and compare different tools utilized.Article Citation - Scopus: 1Assuring Dependability of Software Reuse: an Industrial Standard(Springer Verlag, 2014) Belli, FevziWhereas a software component may be perfectly suited to one application, it may prove to cause severe faults in other applications. The prestandard IEC/PAS 62814 (Dependability of Software Products Containing Reusable Components – Guidance for Functionality and Tests), which has recently been released, addresses the functionality, testing, and dependability of software components to be reused and products that contain software to be used in more than one application; that is, reused by the same or by another development organization, regardless of whether it belongs to the same or another legal entity than the one that has developed this software. This paper introduces into this pre-standard and give hints how to use it. The author, who chaired its realization that started in 2006, briefly summarizes the difficult process to bring the industrial partners with controversial interests to a consensus.Conference Object Citation - Scopus: 2A Maximum Degree Self-Stabilizing Spanning Tree Algorithm(Springer Verlag, 2010) Çokuslu, Deniz; Erciyeş, Kayhan; Hameurlain, AbdelkaderSpanning trees are fundamental topological structures in distributed environments which ease many applications that require frequent communication between nodes. In this paper, we examine and compare two spanning tree construction algorithms which rely on classical and self stabilization approach. Then, we propose a new self-stabilizing spanning tree construction algorithm which uses maximum degree heuristic while choosing the root node. We show experimentally that our new algorithm provides smaller tree diameters than the two existing approaches with favorable run-times. © 2011 Springer Science+Business Media B.V.Conference Object Citation - WoS: 8Citation - Scopus: 10Model-Based Higher-Order Mutation Analysis(Springer Verlag, 2010) Belli, Fevzi; Güler, Nevin; Hollmann, Axel; Suna, Gökhan; Yıldız, EsraMutation analysis is widely used as an implementation-oriented method for software testing and test adequacy assessment. It is based on creating different versions of the software by seeding faults into its source code and constructing test cases to reveal these changes. However, in case that source code of software is not available, mutation analysis is not applicable. In such cases, the approach introduced in this paper suggests the alternative use of a model of the software under test. The objectives of this approach are (i) introduction of a new technique for first-order and higher-order mutation analysis using two basic mutation operators on graph-based models, (ii) comparison of the fault detection ability of first-order and higher-order mutants, and (iii) validity assessment of the coupling effect. © 2010 Springer-Verlag Berlin Heidelberg.
