Browsing by Author "Akshara Pande"

Now showing 1 - 9 of 9

A Decision Tree Approach for Design Patterns Detection by Subgraph Isomorphism
(2010) Akshara Pande; Manjari Gupta; A.K. Tripathi
In many object oriented softwares, there are recurring patterns of classes. Design pattern instances are important for program understanding and software maintenance.Hence a reliable design pattern mining is required. Here we are applying decision tree approach followed by subgraph isomorphism technique for design pattern detection. © Springer-Verlag Berlin Heidelberg 2010.
A new approach for detecting design patterns by graph decomposition and graph isomorphism
(2010) Akshara Pande; Manjari Gupta; A.K. Tripathi
Design Pattern Detection is a part of many solutions to Software Engineering difficulties. It is a part of reengineering process and thus gives important information to the designer. Design Pattern existence improve the program understanding and software maintenance. With the help of these patterns specific design problem can be solved and object oriented design become more flexible and reusable. Hence a reliable design pattern mining is required. Here we are applying graph decomposition followed by graph isomorphism technique for design pattern detection. © 2010 Springer-Verlag Berlin Heidelberg.
Design Pattern Detection by normalized cross correlation
(2010) Manjari Gupta; Akshara Pande; Rajwant Singh Rao; A.K. Tripathi
Design Pattern Detection has been documented so far in the literature. The knowledge of design Pattern existence in the program improves the program understanding and software maintenance. Design pattern is a technology for design reuse. Experts store their experiences in the form of design patterns. Reengineering done by novice users will be successful if a reliable design pattern mining exists. There are 23 design patterns defined by experts. Here we are taking the UML diagrams corresponding to design pattern and corresponding to source code. Our main aim is to find out whether a particular design pattern exists in system design (source code) or not. For this we have extracted the relationship graphs (consisting of nodes and edges), and then tried to detect the design pattern. In this paper we have applied normalized cross correlation and taking design pattern as a template tried to find out its existence in system design. Normalized cross correlation (NCC) has been used extensively for many machine vision applications. Normalized cross correlation has been commonly used to evaluate the degree of similarity or dissimilarity between two images. © 2010 IEEE.
Design pattern mining for GIS application using graph matching techniques
(2010) Akshara Pande; Manjari Gupta; A.K. Tripathi
Design Pattern Detection is a part of many solutions to Software Engineering difficulties. It is a part of reengineering process and thus gives important information to the designer. Design Pattern existence improve the program understanding and software maintenance. With the help of these patterns specific design problem can be solved and object oriented design become more flexible and reusable. Hence a reliable design pattern mining is required. A GIS is an information system designed to work with data referenced by spatial / geographical coordinates. Here we are detecting design patterns so that it can be used as a conceptual tool to cope with recurrent problems appearing in the GIS domain. In this way, GIS applications can evolve smoothly, because maintenance is achieved by focusing on different concerns at different times. © 2010 IEEE.
Design pattern mining using state space representation of graph matching
(2011) Manjari Gupta; Rajwant Singh Rao; Akshara Pande; A.K. Tripathi
Design Pattern Detection is a part of many solutions to Software Engineering problems. It is a part of reengineering process and thus gives significant information to the designer. Design Pattern improves the program understanding and software maintenance. Therefore, a reliable design pattern discovery is required. Graph theoretic approaches have been used for design pattern detection in past. Here we are applying state space representation of graph matching algorithm for design pattern detection. State space representation easily describes the graph matching process. Using our approach variants of each design pattern as well as any occurrence of a design pattern can be detected. © Springer-Verlag Berlin Heidelberg 2011.
Design Patterns Discovery in Source Code: Novel Technique Using Substring Match
(UIKTEN - Association for Information Communication Technology Education and Science, 2021) Akshara Pande; Vivekanand Pant; Manjari Gupta; Alok Mishra
The role of design pattern mining is a very significant strategy of re-engineering as with the help of detection one could easily understand complex systems. Of course, identifying a design pattern is not always a simple task. Additionally, pattern recovering methods often encounter problems dealing with space outburst for extensive systems. This paper introduces a new way to discover a design pattern based on an Impact Analysis matrix followed by substring match. UML diagrams corresponding to codes are created using Visual Paradigm Enterprise. Impact Analysis matrices of these UML diagrams are converted to string format. Considering system code string as main string and design pattern string as a substring, the main string is further decomposed. A substring match technique is developed here to discover design patterns in the source code. Overall, this procedure has the potential to convert the representation of system design and design pattern in ingenious shapes. In addition, this method has the advantage of moderation in the size. Therefore, this approach is beneficial for Software professionals and researchers due to its simplicity. © 2021. Akshara Pande et al; published by UIKTEN. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivs 4.0 License.
Design patterns mining using subgraph isomorphism: Relational view
(2011) Manjari Gupta; Akshara Pande
Design Pattern Detection is a part of many solutions to Software Engineering difficulties. The usage of design patterns leads to benefits for new and young developers by enabling them to reuse the knowledge of their experienced colleagues. Mining of design pattern instances is important for program understanding and software maintenance. Hence a reliable design pattern mining is required. Here we are using the relational view of subgraph isomorphism to detect design patterns in the source code.
DNIT - A new approach for design pattern detection
(2010) Akshara Pande; Manjari Gupta; A.K. Tripathi
In many object oriented softwares, there are recurring patterns of classes. With the help of these patterns specific design problem can be solved and object oriented design becomes more flexible and reusable. Design Pattern Detection is a part of solutions to Software Engineering difficulties. Mining of design pattern instances is important for program understanding and software maintenance. Hence a reliable design pattern mining is required. Here we are introducing a new method called DNIT (Depth-Node-Input Table) for design pattern detection, which extracts the design patterns which exists at different depths in the rooted directed graph of system under study. ©2010 IEEE.
Lessons Learnt from Applying the Trustworthy and Acceptable Human-Robot Interaction Checklist on the Pepper Robot
(Springer Science and Business Media Deutschland GmbH, 2025) Akshara Pande; Shrabanti Kundu; Aida Omerovic; Manjari Gupta; Deepti Mishra
Social robots are gaining recognition because of their ability to interact with humans efficiently. They can comprehend, process, and respond to human behaviour, emotions, and communication with sophisticated technologies. However, trustworthiness is an important condition for establishing credibility of the robot’s responses and accepting them among users. There is a need to evaluate if social robots are satisfying the requirements necessary for obtaining and verifying trustworthiness. We have outlined State of the art on requirements for trustworthiness of social robots and found that frameworks for evaluation and design of trustworthy social robots are at an initial and emerging stage. A noteworthy framework Trustworthy and Acceptable HRI (TA-HRI) checklist is explored in the current study. The applicability of this list was examined, and authors, through their experience with social robots, introduced one main requirement as a category called ‘Validation and Reliability’ with five sub-questions. Further, the present study utilizes extended-TA-HRI checklist as a tool against the social robot Pepper to comprehensively assess its various functional and non-functional aspects towards trustworthiness in various settings. Our initial findings suggest that the framework has several strengths and weaknesses. Most notably, it is comprehensive and facilitates a process of requirements refinement for the target of analysis. Among weaknesses are a lack of role of stakeholders, prioritization, as well as a notion of the relationships among the requirements. This paper reports on the trial and summarizes the lessons learned from the application of extended TA-HRI list on the Pepper robot. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.