51 results
Search Results
Now showing 1 - 10 of 51
Conference Object Citation - WoS: 1A Cognitive Evaluation for Meetings in Software Development Process(Springer-verlag Berlin, 2009) Misra, Sanjay; Akman, IbrahimSoftware development; includes number of different type of meetings in the whole development process. The cognitive activities also play an important role in decision making activities in these meetings since they are carried out, by human being. In this paper, we evaluated the relevance of meetings in different phases of the software development process with reference to cognitive aspects.Conference Object Citation - WoS: 6Jmathnorm: a Database Normalization Tool Using Mathematica(Springer-verlag Berlin, 2007) Yazici, Ali; Karakaya, ZiyaThis paper is about designing a complete interactive tool, named JMathNorm, for relational database (RDB) normalization using Mathematica. It is an extension of the prototype developed by the same authors [1] with the inclusion of Second Normal Form (2NF), and Boyce-Codd Normal Form (BCNF) in addition to the existing Third normal Form (3NF) module. The tool developed in this study is complete and can be used for real-time database design as well as an aid in teaching fundamental concepts of DB normalization to students with limited mathematical background. JMathNorm also supports interactive use of modules for experimenting the fundamental set operations such as closure, and full closure together with modules to obtain the minimal cover of the functional dependency set and testing an attribute for a candidate key. JMathNorm's GUI interface is written in Java and utilizes Mathematica's Mink facility to drive the Mathematica kernel.Conference Object Citation - WoS: 1Plagiarism Detection in Software Using Efficient String Matching(Springer-verlag Berlin, 2012) Pandey, Kusum Lata; Agarwal, Suneeta; Misra, Sanjay; Prasad, RajeshString matching refers to the problem of finding occurrence(s) of a pattern string within another string or body of a text. It plays a vital role in plagiarism detection in software codes, where it is required to identify similar program in a large populations. String matching has been used as a tool in a software metrics, which is used to measure the quality of software development process. In the recent years, many algorithms exist for solving the string matching problem. Among them, Berry-Ravindran algorithm was found to be fairly efficient. Further refinement of this algorithm is made in TVSBS and SSABS algorithms. However, these algorithms do not give the best possible shift in the search phase. In this paper, we propose an algorithm which gives the best possible shift in the search phase and is faster than the previously known algorithms. This algorithm behaves like Berry-Ravindran in the worst case. Further extension of this algorithm has been made for parameterized string matching which is able to detect plagiarism in a software code.Conference Object Citation - WoS: 13Search-Based Parallel Refactoring Using Population-Based Direct Approaches(Springer-verlag Berlin, 2011) Kilic, Hurevren; Koc, Ekin; Cereci, IbrahimAutomated software refactoring is known to be one of the "hard" combinatorial optimization problems of the search-based software engineering field. The difficulty is mainly due to candidate solution representation, objective function description and necessity of functional behavior preservation of software. The problem is formulated as a combinatorial optimization problem whose objective function is characterized by an aggregate of object-oriented metrics or pareto-front solution description. In our recent empirical study, we have reported the results of a comparison among alternative search algorithms applied for the same problem: pure random, steepest descent, multiple first descent, simulated annealing, multiple steepest descent and artificial bee colony searches. The main goal of the study was to investigate potential of alternative multiple and population-based search techniques. The results showed that multiple steepest descent and artificial bee colony algorithms were most suitable two approaches for an efficient solution of the problem. An important observation was either with depth-oriented multiple steepest descent or breadth-oriented population-based artficial bee colony searches, better results could be obtained through higher number of executions supported by a lightweight solution representation. On the other hand different from multiple steepest descent search, population-based, scalable and being suitable for parallel execution characteristics of artificial bee colony search made the population-based choices to be the topic of this empirical study. I In this study, we report the search-based parallel refactoring results of an empirical comparative study among three population-based search techniques namely, artificial bee colony search, local beam search and stochastic beam search and a non-populated technique multiple steepest descent as the baseline. For our purpose, we used parallel features of our prototype automated refactoring tool A-CMA written in Java language. A-CMA accepts bytecode compiled Java codes as its input. It supports 20 different refactoring actions that realize searches on design landscape defined by an adhoc quality model being an aggregation of 24 object-oriented software metrics. We experimented 6 input programs written in Java where 5 of them being open source codes and one student project code. The empirical results showed that for almost all of the considered input programs with different run parameter settings, local beam search is the most suitable population-based search technique for the efficient solution of the search-based parallel refactoring problem in terms of mean and maximum normalized quality gain. However, we observed that the computational time requirement for local beam search becomes rather high when the beam size exceeds 60. On the other hand, even though it is not able to identify high quality designs for less populated search setups, time-efficiency and scalability properties of artificial bee colony search makes it a good choice for population sizes >= 200.Conference Object Citation - WoS: 8A New Classifier Design With Fuzzy Functions(Springer-verlag Berlin, 2007) Celikytlmaz, Ash; Tuerksen, I. Burhan; Aktas, Ramazan; Doganay, M. Mete; Ceylan, N. BasakThis paper presents a new fuzzy classifier design, which constructs one classifier for each fuzzy partition of a given system. The new approach, namely Fuzzy Classifier Functions (FCF), is an adaptation of our generic design on Fuzzy Functions to classification problems. This approach couples any fuzzy clustering algorithm with any classification method, in a unique way. The presented model derives fuzzy functions (rules) from data to classify patterns into number of classes. Fuzzy c-means clustering is used to capture hidden fuzzy patterns and a linear or a non-linear classifier function is used to build one classifier model for each pattern identified. The performance of each classifier is enhanced by using corresponding membership values of the data vectors as additional input variables. FCF is proposed as an alternate representation and reasoning schema to fuzzy rule base classifiers. The proposed method is evaluated by the comparison of experiments with the standard classifier methods using cross validation on test patterns.Conference Object Citation - WoS: 2Object-Oriented Inheritance Metrics: Cognitive Complexity Perspective(Springer-verlag Berlin, 2009) Mishra, Deepti; Mishra, AlokIdentifying high cognitive complexity modules can lead to a better quality software system and can help during maintenance also. It has been found that inheritance has an impact on cognitive complexity of a software system. In this paper, two inheritance metrics based on cognitive complexity, one at class level CCI (Class Complexity due to Inheritance) and another at program level ACI (Average Complexity of a program due to Inheritance), have been proposed for object-oriented software systems. These metrics are also compared with other well known object-oriented inheritance metrics.Conference Object Citation - WoS: 3Software Architecture in Distributed Software Development: a Review(Springer-verlag Berlin, 2013) Mishra, Alok; Mishra, DeeptiThis paper presents a literature review of distributed software development (DSD) or global software development (GSD) and software architecture. The main focus is to highlight the current researches, observations, as well as practice directions in these areas. The results have been limited to peer-reviewed conference papers and journal articles, and analysis reports that major studies have been performed in software architecture and global software development, while the empirical studies of interfacing distributed/global software development and software architecture has only received very little attention among researchers up to now. This indicates the need for future research in these areas.Conference Object Software Quality Management Improvement Through Mentoring: an Exploratory Study From Gsd Projects(Springer-verlag Berlin, 2011) Colomo-Palacios, Ricardo; Soto-Acosta, Pedro; Mishra, Alok; Garcia-Crespo, AngelSoftware Quality Management (SQM) is a set of processes and procedures designed to assure the quality of software artifacts along with their development process. In an environment in which software development is evolving to a globalization, SQM is seen as one of its challenges. Global Software Development is a way to develop software across nations, continents, cultures and time zones. The aim of this paper is to detect if mentoring, one of the lead personnel development tools, can improve SQM of projects developed under GSD. The results obtained in the study reveal that the influence of mentoring on SQM is just temperate.Conference Object An Evaluation on Developer's Perception of Xml Schema Complexity Metrics for Web Services(Springer-verlag Berlin, 2013) Crasso, Marco; Mateos, Cristian; Coscia, Jose Luis Ordiales; Zunino, Alejandro; Misra, SanjayUndoubtedly, the Service-Oriented Computing (SOC) is not an incipient computing paradigm anymore, while Web Services technologies is now a very mature stack of technologies. Both have been steadily gaining maturity as their adoption in the software industry grew. Accordingly, several metric suites for assessing different quality attributes of Web Services have been recently proposed. In particular, researchers have focused on measuring services interfaces descriptions, which like any other software artifact, have a measurable size, complexity and quality. This paper presents a study that assesses human perception of some recent services interfaces complexity metrics (Basci and Misra's metrics suite). Empirical evidence suggests that a service interface that it is not complex for a software application, in terms of time and space required to analyze it, will not be necessarily well designed, in terms of best practices for designing Web Services. A Likert-based questionnaire was used to gather individuals opinions about this topic.Conference Object Citation - WoS: 3Measuring Complexity of Object Oriented Programs(Springer-verlag Berlin, 2008) Misra, Sanjay; Akman, IbrahimIn this paper, a metric for object oriented language is formulated and validated. On the contrary of the other metrics used for object oriented programming (OOPS), the proposed metric calculates the complexity of a class at method level and hence considers the internal architecture of the classes, subclasses and member functions. The proposed metric is evaluated against Weyuker's proposed set of measurement principles through examples and validated through experimentation, case study and comparative study with similar measures. The practical usefulness of the metric is evaluated by a practical framework.
