NEURO-FUZZY BASED SEARCH ROBOT FOR SOFTWARE COMPONENTS

1999 ◽  
Vol 08 (02) ◽  
pp. 119-135
Author(s):  
YAU-HWANG KUO ◽  
JANG-PONG HSU ◽  
MONG-FONG HORNG

A personalized search robot is developed as one major mechanism of a personalized software component retrieval system. This search robot automatically finds out the Web servers providing reusable software components, extracts needed software components from servers, classifies the extracted components, and finally establishes their indexing information for local component retrieval in the future. For adaptively tuning the performance of software component extraction and classification, an adaptive thesaurus and an adaptive classifier, realized by neuro-fuzzy models, are embedded in this search robot, and their learning algorithms are also developed. A prototype of the personalized software component retrieval system including the search robot has been implemented to confirm its validity and evaluate the performance. Furthermore, the framework of proposed personalized search robot could be extended to the search and classification of other kinds of Internet documents.

2019 ◽  
Vol 12 (3) ◽  
pp. 224-232
Author(s):  
Iqbaldeep Kaur ◽  
Rajesh Kumar Bawa

Background: With an exponential increase in software online as well as offline, through each passing day, the task of digging out precise and relevant software components has become the need of the hour. There is no dearth of techniques used for the retrieval of software component from the available online and offline repositories in the conceptual as well as the empirical literature. However each of these techniques has its own set of limitations and suitability. Objective: The proposed technique gives concrete decision using schematic based search that gives better result and higher precision and recall values. Methods: In this paper, a component decision and retrieval engine called SR-SCRS (Schematic and Refinement based Software Component Retrieval System) has been presented using OPAM. OPAM is a github repository containing software components (packages), designed by OcamlPro. This search engine employs two retrieval techniques for a robust decision vis-o-vis Schematic-based search with fuzzy logic and Refinement-based search. The Schematic based search is based on matching the attribute values and the threshold of those values as given by the user. Thereafter the results are optimized to achieve the level of relevance using fuzzy logic. Refinement based search works on one particular attribute value. The experiments have been conducted and validated on OPAM dataset. Results: Precisely, the average precision of Schematic based search and Refinement based search is 60% and 27.86% which shows robust results. Conclusion: Hence, the performance and efficiency of the proposed work has been evaluated and compared with the other retrieval technique.


Author(s):  
Jyoti Aggarwal ◽  
Manoj Kumar

Component Based Software System (CBSS) have become most generalized and popular approach for developing reusable software applications. A software component has different important factors, but reusability is the most citing factor of any software component. Software components can be reused for the development of another software application, which further reduces the amount of time and effort of software development process. With the increase in the number of software components, requirement for identification of software metrics also increased for quantitative analysis of different aspects of components. Reusability depends on different factors and these factors have different impact on the reusability of software components. In this paper, study has been performed to identify the major reusability factors and software metrics for measuring those factors. From this research work, it will become easier to measure the reusability of software components, and software developers would be able to measure the degree of various features of any application which can be reused for developing other software applications. In this way, it would be easy and convenient to identify and compare the reusable software components and they could be reused in effective and efficient manner.


1991 ◽  
Vol 1 (2) ◽  
pp. 191-211 ◽  
Author(s):  
Colin Runciman ◽  
Ian Toyn

AbstractPolymorphic types are labels classifying both (a) defined components in a library and (b) contexts of free variables in partially written programs. It is proposed to help programmers make better use of software libraries by providing a system that, given (b), identifies candidates from (a) with matching types. Assuming at first that matching means unifying (i.e. having a common instance), efficient ways of implementing such a retrieval system are discussed and its likely effectiveness based on a quantitative study of currently available libraries is indicated. The applicative instance relation between types, which captures some intuitions about generalization/specialization is then introduced, and its use as the basis of a more flexible system is discussed.


Author(s):  
JUN-JANG JENG ◽  
BETTY H. C. CHENG

Reusing software may greatly increase the productivity of software engineers and improve the quality of developed software. Software component libraries have been suggested as a means for facilitating reuse. A major difficulty in designing software libraries is in the selection of a component representation that will facilitate the classification and the retrieval processes. Using formal specifications to represent software components facilitates the determination of reusable software because they more precisely characterize the functionality of the software, and the well-defined syntax makes processing amenable to automation. This paper presents an approach, based on formal methods, to the classification, organization and retrieval of reusable software components. From a set of formal specifications, a two-tiered hierarchy of software components is constructed. The formal specifications represent software that has been implemented and verified for correctness. The lower-level hierarchy is created by a subsumption test algorithm that determines whether one component is more general than another; this level facilitates the application of automated logical reasoning techniques for a fine-grained, exact determination of reusable candidates. The higher-level hierarchy provides a coarse-grained determination of reusable candidates and is constructed by applying a hierarchical clustering algorithm to the most general components from the lower-level hierarchy. The hierarchical organization of the software component specifications provides a means for storing, browsing, and retrieving reusable components that is amenable to automation. In addition, the formal specifications facilitate the verification process that proves a given software component correctly satisfies the current problem. A prototype browser that provides a graphical framework for the classification and retrieval process is described.


INSIST ◽  
2018 ◽  
Vol 3 (2) ◽  
pp. 149
Author(s):  
Monisha Kumari ◽  
Dimple Nagpal

The development of the software component consists of many stages and the lifecycle models show the flow of the stages that the development of the component follows. The development of the new software from the reusable software component has been challenging as it is always a concern to retrieve the relevant software component from the repository. There are lifecycles for making the design and development of the component more efficient. In this paper, an overview of the software component lifecycle models X-model, Y-model, Z-model, knot model and elite model and phases explanation of the lifecycle has been discussed. The current concept explains the comparison of the three lifecycle models in this paper. The component retrieval algorithms has been compared and discussed for the retrieval of the software component.


Sign in / Sign up

Export Citation Format

Share Document