A Searching Method Based on Problem Description and Algorithmic Features

A searching method related to “what” and “how” problem descriptions within a special software component library is presented. The “what” problem description is based on a high level representation of general features of initial and final data the problem can operate and produce. The “how” problem description is based on another high level representation of computational features of algorithm used for the problem solution. To realize the searching method, a special library in which each item is stored as a cyberFilm is considered. CyberFilm formats are used for representing data/knowledge units as self-explanatory components, and a special double ID is assigned to each component. The double ID is a pair of a URL-like address and a classification code. A cyberFilm represents a software component as a set of algorithmic features that provide a high-level and yet precise description of computation as well as semantics of problem that should be solved by the corresponding algorithm. These features are the basis of the classification code and the searching method. In this paper, a basic idea of the “what” problem description for the searching method, and an overview of the features for the “how” problem description, are considered. A possible library structure that uses the classification codes to support various searching goals is also described.

[1]  Robert C. Seacord,et al.  AGORA: A Search Engine for Software Components , 1998, IEEE Internet Comput..

[2]  Christian S. Collberg,et al.  A Fuzzy Visual Query Language for a Domain-Specific Web Search Engine , 2002, Diagrams.

[3]  Vijay V. Raghavan,et al.  Visualizing association mining results through hierarchical clusters , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[4]  Andreas Wierse,et al.  Information Visualization in Data Mining and Knowledge Discovery , 2001 .

[5]  Marcus A. Rothenberger,et al.  Software reuse strategies and component markets , 2003, CACM.

[6]  Frederick P. Brooks,et al.  No Silver Bullet: Essence and Accidents of Software Engineering , 1987 .

[7]  Anthony K. H. Tung,et al.  Spatial clustering methods in data mining : A survey , 2001 .

[8]  Pete Thomas,et al.  Object-oriented programming in Eiffel , 1995 .

[9]  Clemens A. Szyperski,et al.  Component software - beyond object-oriented programming , 2002 .

[10]  Steven Skiena,et al.  The Algorithm Design Manual , 2020, Texts in Computer Science.

[11]  Nikolay N. Mirenkov,et al.  Visual computing within environment of self-explanatory components , 2002, Soft Comput..

[12]  Nikolay N. Mirenkov,et al.  Self-Explanatory Components: A New Programming Paradigm , 2001, Int. J. Softw. Eng. Knowl. Eng..

[13]  Marios C. Angelides,et al.  Guest Editor's Introduction: Multimedia Content Modeling and Personalization , 2003, IEEE Multim..

[14]  Rik Van de Walle,et al.  MPEG-21: goals and achievements , 2001 .

[15]  Alan W. Brown,et al.  The Current State , 2016 .

[16]  George T. Heineman,et al.  Component-Based Software Engineering: Putting the Pieces Together , 2001 .

[17]  Nick Cercone,et al.  RuleViz: a model for visualizing knowledge discovery process , 2000, KDD '00.

[18]  Bertrand Meyer,et al.  Eiffel: The Language , 1991 .

[19]  A.P. Black.  Post-Javaism [object-oriented languages] , 2004, IEEE Internet Computing.

[20]  Shinji Kusumoto,et al.  Ranking significance of software components based on use relations , 2003, IEEE Transactions on Software Engineering.

[21]  Dawson R. Engler,et al.  Uprooting Software Defects at the Source , 2003, ACM Queue.

[22]  P. McFedries.  Google this , 2003 .

[23]  Andrei Broder,et al.  A taxonomy of web search , 2002, SIGF.