8 results
Search Results
Now showing 1 - 8 of 8
Conference Object Citation - Scopus: 4Effective Project Leadership in Computer Science and Engineering(Springer-Verlag Berlin, 2009) Cafer,F.; Misra,S.Project leaders are the most important individuals in projects. A project leader should follow some thinking styles and values which can lead his or her team to success. There is a common notion among software specialists that the more complex a project manager thinks, the better his leadership is. In this paper, we discuss the significance of simple thinking in project leadership. If the leader thinks in a simple way, then the risk of being suffocated in details is less. Complex thinking brings out greater risks of losing the general control of the system because of spending too much time and effort on details and, as a result, more confusion. Not only simplicity, but also psychological factors are important in guiding teams and developing projects in the most effective way. Here, we present a set of qualities for a good project leader in software engineering. In addition to that, we also demonstrate how cognitive and ethical issues affect leadership qualities. © 2009 Springer Berlin Heidelberg.Conference Object Citation - Scopus: 9A unique complexity metric(Springer-Verlag Berlin, 2008) Misra,S.; Akman,I.Metrics, in general, are defined as "a quantitative measure of the degree to which a system, component, or process possesses a given attribute". Complexity metrics are used to predict critical information about reliability and maintainability of software systems. This paper proposes complexity metric, which includes all major factors responsible for complexity. We validated our metric against the principles of measurement theory since the measurement theory has been proposed and extensively used in the literature as a means to evaluate the software engineering metrics. The scale of the metric is investigated through Extensive structure. It is found that the proposed measure is on ratio scale. The applicability of the proposed measure is tested through test cases and comparative study. © 2008 Springer-Verlag Berlin Heidelberg.Conference Object A New Complexity Metric Based on Cognitive Informatics(Springer-Verlag Berlin, 2008) Misra,S.; Akman,I.In this paper, a new complexity metric based on cognitive informatics is proposed for object oriented(OO) code. This is the single metric, which covers cognitive complexity of the OO system, method complexity and complexity due to inheritance together. The proposed metric was evaluated against Weyuker set of measurement principles. It was found that seven Weyuker properties are satisfied by this measure. © 2008 Springer-Verlag Berlin Heidelberg.Conference Object A Multi-Paradigm Complexity Metric (mcm)(Springer-Verlag Berlin, 2011) Misra,S.; Akman,I.; Cafer,F.Huge amount of researches and software metrics have been proposed for procedural and object-oriented languages. However, there are only few metrics available in the literature related with multi-paradigm programming languages. In this paper, we propose a metric to evaluate the code written in multi-paradigm language. Our proposed metric can be used for most of the programming paradigms, including both procedural and object-oriented languages. © 2011 Springer-Verlag.Conference Object Citation - Scopus: 1Plagiarism Detection in Software Using Efficient String Matching(Springer-Verlag Berlin, 2012) Pandey,K.L.; Agarwal,S.; Misra,S.; Prasad,R.String 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. © 2012 Springer-Verlag.Conference Object Measuring Complexity of Object Oriented Programs(Springer-Verlag Berlin, 2008) Misra,S.; Akman,I.In 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. © 2008 Springer-Verlag Berlin Heidelberg.Conference Object Citation - Scopus: 26A Suite of Cognitive Complexity Metrics(Springer-Verlag Berlin, 2012) Misra,S.; Koyuncu,M.; Crasso,M.; Mateos,C.; Zunino,A.In this paper, we propose a suite of cognitive metrics for evaluating complexity of object-oriented (OO) codes. The proposed metric suite evaluates several important features of OO languages. Specifically, the proposed metrics are to measure method complexity, message complexity (coupling), attributes complexity and class complexity. We propose also a code complexity by considering the complexity due to inheritance for the whole system. All these proposed metrics (except attribute complexity) use the cognitive aspect of the code in terms of cognitive weight. All the metrics have critically examined through theoretical and empirical validation processes. © 2012 Springer-Verlag.Conference Object Citation - Scopus: 5Complexity Metrics for Cascading Style Sheets(Springer-Verlag Berlin, 2012) Adewumi,A.; Misra,S.; Ikhu-Omoregbe,N.Web applications are becoming important for small and large companies since they are integrated with their business strategies. Cascading Style Sheets (CSS) however are an integral part of contemporary Web applications that are perceived as complex by users and this result in hampering its widespread adoption. The factors responsible for CSS complexity include size, variety in its rule block structures, rule block reuse, cohesion and attribute definition in rule blocks. In this paper, we have proposed relevant metric for each of the complexity factors. The proposed metrics are validated through a practical framework. The outcome shows that the proposed metrics satisfy most of the parameters required by the practical framework hence establishing them as well structured. © 2012 Springer-Verlag.
