Detection of design pattern instances based on graph isomorphism

2013 ◽  
Author(s):  
Dongjin Yu ◽  
Jianlin Ge ◽  
Wei Wu
Keyword(s):  
Design Pattern ◽  
Graph Isomorphism

An Idea Towards Improving Design Pattern Detection

2015 ◽  
Vol 3 (2) ◽  
Author(s):  
Arti Chaturvedi ◽  
Manjari Gupta ◽  
Sanjay Kumar Gupta
Keyword(s):  
System Design ◽  
Design Pattern ◽  
Design Patterns ◽  
Graph Isomorphism ◽  
Pattern Detection ◽  
Engineering Process ◽  
Significant Information ◽  
Matching Algorithm ◽  
Mining Design ◽  
Reliable Design

Design Pattern Detection is a part of re-engineering process and thus gives significant information to the designer. Detection of design patterns is helpful for improving the software characteristics. Therefore, a reliable design pattern discovery is required. The problem of finding an isomorphic sub-graph is used to solve design pattern detection in past. It is noticed that ordering of vertices of the design pattern saves the time of process. In this paper we are doing ordering of vertices for few design patterns proposed by Gamma, Helm, Johnson, and Vlissides (1995) using an algorithm Greatest Constraint First proposed by Bonnici, Giugno, Pulvirenti, Shasha, and Ferro (2013). After getting this ordering, we use a matching algorithm that uses subgraph isomorphism conditions to check whether a particular design pattern exists in the system design or not (Bonnici et al., 2013). We redefine sub-graph isomorphism conditions in the context of the problem of mining design patterns from the system design.

ANALYZING AND IMPROVING WEB APPLICATION QUALITY USING DESIGN PATTERNS

2012 ◽  
Vol 2 (2) ◽  
pp. 112-116
Author(s):  
Shikha Bhatia ◽  
Mr. Harshpreet Singh
Keyword(s):  
Web Application ◽  
Design Pattern ◽  
Design Patterns ◽  
Web Applications ◽  
Past Research ◽  
Software Systems ◽  
Interactive Software ◽  
Web Based ◽  
Software Application ◽  
Execution Speed

With the mounting demand of web applications, a number of issues allied to its quality have came in existence. In the meadow of web applications, it is very thorny to develop high quality web applications. A design pattern is a general repeatable solution to a generally stirring problem in software design. It should be noted that design pattern is not a finished product that can be directly transformed into source code. Rather design pattern is a depiction or template that describes how to find solution of a problem that can be used in many different situations. Past research has shown that design patterns greatly improved the execution speed of a software application. Design pattern are classified as creational design patterns, structural design pattern, behavioral design pattern, etc. MVC design pattern is very productive for architecting interactive software systems and web applications. This design pattern is partition-independent, because it is expressed in terms of an interactive application running in a single address space. We will design and analyze an algorithm by using MVC approach to improve the performance of web based application. The objective of our study will be to reduce one of the major object oriented features i.e. coupling between model and view segments of web based application. The implementation for the same will be done in by using .NET framework.

scholarly journals Research on Blockchain-Based E-Bidding System

2021 ◽  
Vol 11 (9) ◽  
pp. 4011
Author(s):  
Dan Wang ◽  
Jindong Zhao ◽  
Chunxiao Mu
Keyword(s):  
Data Transmission ◽  
Privacy Protection ◽  
Graph Isomorphism ◽  
Third Party ◽  
Business Logic ◽  
Core Concept ◽  
The Core ◽  
Blockchain Technology ◽  
Smart Contract ◽  
Bidding Process

In the field of modern bidding, electronic bidding leads a new trend of development, convenience and efficiency and other significant advantages effectively promote the reform and innovation of China’s bidding field. Nowadays, most systems require a strong and trusted third party to guarantee the integrity and security of the system. However, with the development of blockchain technology and the rise of privacy protection, researchers has begun to emphasize the core concept of decentralization. This paper introduces a decentralized electronic bidding system based on blockchain and smart contract. The system uses blockchain to replace the traditional database and uses chaincode to process business logic. In data interaction, encryption techniques such as zero-knowledge proof based on graph isomorphism are used to improve privacy protection, which improves the anonymity of participants, the privacy of data transmission, and the traceability and verifiable of data. Compared with other electronic bidding systems, this system is more secure and efficient, and has the nature of anonymous operation, which fully protects the privacy information in the bidding process.

scholarly journals MET: a Java package for fast molecule equivalence testing

2020 ◽  
Vol 12 (1) ◽  
Author(s):  
Jördis-Ann Schüler ◽  
Steffen Rechner ◽  
Matthias Müller-Hannemann
Keyword(s):  
Chemical Properties ◽  
Graph Isomorphism ◽  
Isomorphism Problem ◽  
Equivalence Classes ◽  
Equivalence Testing ◽  
Equivalence Test ◽  
Graph Isomorphism Problem ◽  
2D Structure ◽  
Node Labels ◽  
Labelled Graphs

AbstractAn important task in cheminformatics is to test whether two molecules are equivalent with respect to their 2D structure. Mathematically, this amounts to solving the graph isomorphism problem for labelled graphs. In this paper, we present an approach which exploits chemical properties and the local neighbourhood of atoms to define highly distinctive node labels. These characteristic labels are the key for clever partitioning molecules into molecule equivalence classes and an effective equivalence test. Based on extensive computational experiments, we show that our algorithm is significantly faster than existing implementations within , and . We provide our Java implementation as an easy-to-use, open-source package (via GitHub) which is compatible with . It fully supports the distinction of different isotopes and molecules with radicals.

scholarly journals Graph isomorphism restricted by lists

2021 ◽  
Vol 860 ◽  
pp. 51-71
Author(s):  
Pavel Klavík ◽  
Dušan Knop ◽  
Peter Zeman
Keyword(s):  
Graph Isomorphism
Sign in / Sign up

Export Citation Format

Share Document