Browsing by Author "Kodituwakku, S. R"

Now showing 1 - 7 of 7

Embargo
Analysis and enhancements of a cognitive based complexity measure
(IEEE, 2017-06-25) De Silva, D. I; Kodagoda, N; Kodituwakku, S. R; Pinidiyaarachchi, A. J
As stated by Tom DeMacro, something that cannot be measured is uncontrollable. Thus, a number of metrics have been developed to measure the complexity associated with software by considering various aspects such as size, control flow and data flow between modules, cognitive informatics etc. Amongst these aspects, cognitive informatics is recognized as a promising aspect in measuring software complexity. Thus, majority of the complexity metrics that were proposed after the introduction of cognitive informatics have been proposed mainly based on the cognitive aspect. Amongst them, Chhillar and Bhasins' weighted composite complexity measure is one of the few metrics that had attempted to measure the complexity of a program by considering more than three or more complexity factors. After a thorough analysis, in a previous study, the authors identified that the weighted composite complexity measure could be further improved by considering more complexity factors. This paper extends the previous study to identify the most appropriate factors that could be considered by the weighted composite complexity measure. Using the opinions of the industry experts, the authors were able to discover that compound conditional statements, threads and recursion could also be considered by the weighted composite complexity measure. Accordingly, the weighted composite complexity measure was enhanced to capture the complexities that arise due to those factors. The paper also includes a demonstration of the complexity calculation method of the improved weighted composite complexity measure with the use of three sample java programs, which were written by incorporating the above mentioned factors. In addition, an application of the weighted composite complexity measure to the same programs are also given in the paper, to illustrate the changes in complexity values of the two measures.
Open Access
Enhancements to an OO Metric: CB Measure.
(Journal of Software, 2018-01-01) De Silva, D. I; Kodituwakku, S. R; Pinidiyaarachchi, A. J; Kodagoda, N
Due to the wide usage of the object-oriented paradigm as a development paradigm many researches have proposed metrics to measure the complexity of object-oriented programs. The proposed object-oriented metrics can be divided into two categories based on the main aspect they have considered: metrics based on object-oriented aspects and metrics based on the cognitive aspects. Majority of the metrics which belong to the latter category have relied on a maximum of three complexity factors to derive the complexity of a program. CB measure is one of the few metrics that has considered four or more complexity factors to measure the complexity associated with a software program. However, there exists some other factors that could be considered by the CB measure to make it a more practically applicable measure. Such factors were proposed by the authors in a previous study. This paper demonstrates how those factors can be incorporated to the CB measure. In addition, it validates the practical applicability of the modified CB measure.
Embargo
Improvements to a complexity metric: CB measure
(IEEE, 2015-12-18) De Silva, D. I; Kodagoda, N; Kodituwakku, S. R
Controlling the complexity of software applications is an essential part of the software development process as it directly affects maintenance activities such as reusability, understandability, modifiability and testability. However, as stated by Tom DeMarco “You cannot control what you cannot measure”. Thus, over the years many complexity metrics have been proposed with the intention of controlling and minimizing the complexity associated with software. However, majority of these proposed complexity metrics are based on only one aspect of complexity. The CB measure introduced by Chhillar and Bhasin is one metric which relies on a number of complexity factors to decide on the complexity of a program. However, it also has some shortcomings and can be further improved. Thus, this paper attempts to propose some additional complexity factors that the CB measure has not considered, to further improve it. The paper also presents an extensive coverage about the software complexity metrics proposed in the literature.
Embargo
Limitations of an object-oriented metric: Weighted complexity measure
(IEEE, 2015-09-23) De Silva, D. I; Kodagoda, N; Kodituwakku, S. R; Pinidiyaarachchi, A. J
Many computer science practitioners and software developers believes that the complexity of a program could be controlled more effectively by using object-oriented programming concepts. In addition to controlling complexity, the object-oriented approach allows faster development, reduction in costs, higher quality, easier maintenance, increased scalability, better information structures, and increased adaptability. As such, more and more programs are written using the object-oriented programming approach rather than using the traditional functional approach. This demand has spurred the provision for a number of object-oriented metrics. Out of them, Chidamber and Kemerers' metrics suite is one of the most prominent object-oriented metrics that has been proposed. It has been widely validated and has been accepted as a useful predictor of object-oriented design complexity. But it does not consider the complexities that occur due to factors such as the nesting level and type of control structures, and the size of the program. Thus, Chhillar and Bhasins' introduced the weighted complexity measure to address these issues. It is the only metric which considers the complexities that occur due to inheritance level of statements, nesting level and type of control structures, and the size of the program. However, weighted complexity measure also has some limitations. This paper attempts to draw the readers' attention to those limitations, with the hope that it will be further improved by addressing them.
Embargo
Limitations of an object-oriented metric: Weighted complexity measure
(IEEE, 2015-09-23) De Silva, D. I; Kodagoda, N; Kodituwakku, S. R; Pinidiyaarachchi, A. J
Many computer science practitioners and software developers believes that the complexity of a program could be controlled more effectively by using object-oriented programming concepts. In addition to controlling complexity, the object-oriented approach allows faster development, reduction in costs, higher quality, easier maintenance, increased scalability, better information structures, and increased adaptability. As such, more and more programs are written using the object-oriented programming approach rather than using the traditional functional approach. This demand has spurred the provision for a number of object-oriented metrics. Out of them, Chidamber and Kemerers' metrics suite is one of the most prominent object-oriented metrics that has been proposed. It has been widely validated and has been accepted as a useful predictor of object-oriented design complexity. But it does not consider the complexities that occur due to factors such as the nesting level and type of control structures, and the size of the program. Thus, Chhillar and Bhasins' introduced the weighted complexity measure to address these issues. It is the only metric which considers the complexities that occur due to inheritance level of statements, nesting level and type of control structures, and the size of the program. However, weighted complexity measure also has some limitations. This paper attempts to draw the readers' attention to those limitations, with the hope that it will be further improved by addressing them.
Open Access
A Risk Management Framework for Clouds Using Big Data and Security Informatics usingAttack Trees and Hidden Markov Model in Analysis and Prediction of Risks in Social Media …
(2014-11) Subasinghe, K. D. B. H; Kodituwakku, S. R; Perera, H. S. C
Social media refers to the means of interactions among people in which they create, share, and exchange information and ideas in virtual communities and networks. The growth of Information and Communication Technology (ICT) has resulted in an enormous volume of security related information present on the web largely when it comes to social media networks. Therefore, with the changing face of cyber security, although it is difficult, it was found that detecting the potential cyber-attacks or crimes is possible and feasible with the vast improvements in ICT. Cloud computing uses ICT resources that are delivered as a service over a network which has opened a promising opportunity across the globe thus resulting a greater popularity of e-commerce. The proposed framework is developed to manage risks of social media networks using the attack tree method which is used to model the risk of the system and identify the possible attacking strategies which the adversaries may launch. This paper presents the development of a Risk Management Framework by analysis of social media networks through web intelligence and security informatics using attack tree analysis based on the Hidden Markov Model for information extraction and prediction of risk factors of Social Media Networks.
Embargo
SecAODV-Lightweight Authentication for AODV Protocol
(International Journal of Computer Applications, 2016) Jayakody, A; Samarasinghe, R; Kodituwakku, S. R
In nature of the transmission medium the broadcast, Wireless sensor networks are vulnerable to security attacks. The nodes are placed in a hostile or dangerous environment where they are not tangibly safe in the MANETs. In many application, the data obtained from the sensing nodes need a false, or malicious node could intercept private information or could send false messages to nodes in the network. Among the major attacks Eavesdropping, Spoof Attack, Denial of Service, Wormhole attack, Sinkhole attack, Sybil attack, Selective Forwarding attack, Passive information gathering, Node capturing, and False or malicious node, Hello flood attack are common. In this paper, authors have proposed and implemented an efficient light weighted authentication secure routing protocol on top of an AODV. The focused area of the proposed routing protocol is increasing the network security of the MANET. Additionally, the paper evaluates the implemented protocol using NS2 simulator in different networks with SecAODV.