C.V. Guru Rao

Clustering and Classification of Software Component for Efficient Component Retrieval and Building Component Reuse Libraries

Abstract A Software Repository is a collection of library files and function codes. Programmers and Engineers design develop and build software libraries in a continuous process. Selecting suitable function code from one among many in the repository is quite challenging and cumbersome as we need to analyze semantic issues in function codes or components. Clustering and Mining Software Components for efficient reuse is the current topic of interest among researchers in Software Reuse Engineering and Information Retrieval. A relatively less research work is contributed in this field and has a good scope in the future. In this paper, the main idea is to cluster the software components and form a subset of libraries from the available repository. These clusters thus help in choosing the required component with high cohesion and low coupling quickly and efficiently. We define a similarity function and use the same for the process of clustering the software components and for estimating the cost of new project. The approach carried out is a feature vector based approach.

Document Clustering Using Hybrid XOR Similarity Function for Efficient Software Component Reuse

In this paper a generalized approach is proposed for clustering a set of given documents or text files or software components for reuse based on the new similarity function called hybrid XOR function defined for the purpose of finding degree of similarity among two document sets or any two software components. We construct a matrix called similarity matrix of order n-1 by n for n document sets or software components by applying hybrid XOR function for each pair of document sets. We define and design the clustering algorithm which has its input as similarity matrix and output as a set of clusters formed dynamically as compared to other clustering algorithms that predefine the count of clusters and documents being fit to one of those clusters or classes finally. The approach carried out uses simple computations.

High performance pattern search algorithm using three sliding windows

In this work we propose a new pattern matching algorithm based on the principle of the text segmentation by slicing the text in to three segments. The idea is to perform preprocessing of pattern strings before beginning to search for the pattern in the text so as to achieve substantial speed up in the search process as against to other existing algorithms which either preprocess text or pattern or does no preprocessing such as Brute Force algorithm. The behavior of the algorithm depends on the occurrence of consecutive characters in the event of pattern failure. In this paper we present an efficient pattern matching algorithm based on preprocessing of the pattern string by considering three consecutive characters of the text that immediately follow the aligned pattern window in an event of mismatch between pattern and text character. The algorithm makes use of three sliding patterns. The experimental results show that the proposed algorithm is superior to other algorithms even when the pattern is in the end of the text.

Clustering Software Components for Component Reuse and Program Restructuring

Clustering Software Components for efficient component retrieval is gaining a significant practical importance in the field of software engineering from academic researchers and software industry. Clustering reduces the search space of components by grouping similar entities together thus ensuring reduced time complexity. Finding software components for efficient software reuse is one of the important problems gaining interest from researchers. In this Paper, we first define a similarity function and then give a generalized approach for clustering software components. A component may be a program module or any software document. The objective of component clustering is to form clusters containing high cohesive and low coupling components. Experiments were conducted with Reuters 21578 dataset by considering 70% of documents for training and 30% as test data.

Clustering Software Project Components for Strategic Decisions and Building Reuse Libraries

A Software Repository is a collection of function codes, library files, software requirement specification documents, software design patterns, architectural specifications to name a few. Software Engineers and Programmers analyse, design, implement, develop and build the software libraries, software projects as a continuous process. Mining Software Components for efficient reuse is the current topic of interest among researchers working in the areas of Software Reuse and Information Retrieval. A comparatively less research is contributed in this direction and has a good scope for research. In this paper, the main idea is to cluster the software projects, software components from the available repository and use these clusters in choosing the suitable software component quickly and efficiently. The software clustering process may also be used to estimate and know the hidden knowledge of software systems. We use the similarity function of our previous work submitted at the ACM ISDOC Conference [12] for the purpose of clustering the software projects and software components. The clusters formed may be used to estimate the hidden knowledge and behavior of software projects. The approach carried out is a feature vector based approach.

A Feature Vector Based Approach for Software Component Clustering and Reuse Using K-means

Software component clustering is an unsupervised learning approach which is used to cluster the software components. These clusters may then be used to study, analyze, understand behavior of the software components. In this paper, we use the k-means clustering algorithm to cluster the software components. The main difference lies in the use of distance measure which is designed to find the similarity between the software components. We use the distance measure [12], to find the pair wise project distance matrix and apply the k-means algorithm on this distance matrix. The main idea is to use more than one distance measure, to explore consensus based technique, so as to cluster software components, instead of using only one measure to cluster the components. This approach may also be applied for software architecture recovery problem by using our distance measure.

Feature Vector Based Component Clustering for Software Reuse

Software reuse is concerned about the possibility of reusability of software components. It is important to think about ways, methods and approaches for extracting knowledge from software components. Knowledge mining from software components has various practical applications that range from software reuse to financial applications. This paper proposes a similarity measure for similarity computation between software components by extending our previous research. The proposed measure is used to perform component clustering. Software component clustering facilitates software reusability and software segmentation.

Critical review of various near-duplicate detection methods in web crawl and their prospective application in drug discovery

For near-duplicate detection, various methods available in the literature are compared in terms of their application, utility, and context. In most of the cases the performances are highlighted so that anyone interested in choosing an algorithm can find this useful. Moreover, certain futuristic algorithms like oblique and streaming random forest are reported which will help the researcher to develop new algorithms especially suitable for Big Data and cloud environment. The coverage is not exhaustive but, nevertheless, considers all important algorithms used in practice so that any practitioner can find it handy to take implementation decision. As application case study application of random forest approach to near-duplicate detection is used in Chinese herbal drug discovery application is proposed.

A novel approach for avoiding overload in the web crawling

In comparison to human searchers, crawlers are capable of retrieving data in greater depth and more quickly. As a result, it can face crippling impact on the performance of the site. Inessential to say, if a particular crawler is carrying out numerous requests per second and/or, Therefore, in a scenario involving multiple crawlers, it would be difficult for a server to handle requests in case each crawler downloads large files and/or performs numerous requests/second. So to avoid the overloading in the retrieving data in the proposed system a sequence flow protocol(Leakey Bucket) is which retrieves the data in the sequence order and also proposed mobbing unrestricted router (MUR)(CFR) which maintains three phases inbound, peak and outbound. If the inbound flow is less than the peak it allows the crawling, and at the same time if the inbound is greater than or equal to height the MUR protocol stops the crawling and request for the server to extend network resource. Is used for retrieving the data in sequential order.