Research on Component Retrieval Method Based on Faceted Classification Described

2011 ◽  
Vol 121-126 ◽  
pp. 1727-1733
Author(s):  
Yan Pei Liu ◽  
Jian Ping Wang ◽  
Jun Chen
Keyword(s):  
Large Scale ◽  
Search Method ◽  
Component Technology ◽  
Component Reuse ◽  
Component Retrieval ◽  
Retrieval Method ◽  
Component Library ◽  
Faceted Search ◽  
Faceted Classification ◽  
Component Representation

With the development of component technology and component library expansion, component representation and retrieval technology as the component library management two core technologies has become a research hotspot. According to the current widely used methods described and characteristics of components faceted classification, this paper starting from component reuse by different search methods，based on view search method、based on faceted search method、based on terms retrieval method three kinds of term component retrieval methods and the corresponding model of the five matches and two matching algorithms are proposed. Theoretical analysis and experimental results show that the three kinds of retrieval methods used in large-scale component library component retrieval, to meet the component reuse of various search requirements and the retrieval efficiency is feasible.

Research on Active Services Component Library Based on Ontology

2010 ◽  
Vol 20-23 ◽  
pp. 1034-1039
Author(s):  
Shun Yan Wang ◽  
You An Ke ◽  
Yan Wen Wang
Keyword(s):  
Web Service ◽  
Component Technology ◽  
Component Retrieval ◽  
Component Library ◽  
Key Technology ◽  
Local Component ◽  
Information Classification ◽  
Active Service ◽  
Active Services ◽  
Facet Classification

Active service is a kind of Web service which can be customized by customer’s requirement. The development of component technology provides foundation for the implementation of active services. Based on UCDL, the key technology of Local Component Resource Warehouse (LCRW) is expounded, the model of component library based on active service is constructed, the organization method by facet classification combined with ontology information classification is proposed, and the component retrieval based on Ontology Information is also proposed in view of facet retrieval.

scholarly journals A Component Retrieval Tree Matching Algorithm Based on a Faceted Classification Scheme

2015 ◽  
Vol 15 (1) ◽  
pp. 14-23
Author(s):  
Yao Wang ◽  
Bo Wang ◽  
Minghan Liu
Keyword(s):  
Software Reuse ◽  
Classification Scheme ◽  
Component Retrieval ◽  
Retrieval Method ◽  
Matching Algorithm ◽  
Query Matching ◽  
Retrieval Efficiency ◽  
Efficient Scheme ◽  
Faceted Classification ◽  
The Cost

Abstract An efficient scheme of component retrieval can significantly reduce the cost of software reuse. For this purpose, a method of successfully retrieving of specified components from the component repository is a crucial consideration. However, neither the retrieval efficiency, nor the query-matching rate of the traditional method, which is based on a faceted classification scheme, satisfies the requirements of component retrieval. In this paper a novel component retrieval method combining the features of the faceted classification scheme and the theory of tree matching is proposed. This method not only accurately retrieves components that match queries, but also considers any incomplete descriptions of the retrieval component to completely ensure the relaxation ability of the component retrieval. The experimental results show that the retrieval matching method proposed is highly efficient, and it retrieves feasibly and efficiently the components.

Simulation of Fast Retrieval Method for Large-Scale Image Database

2014 ◽  
Vol 556-562 ◽  
pp. 4959-4962
Author(s):  
Sai Qiao
Keyword(s):  
Feature Extraction ◽  
Large Scale ◽  
Great Increase ◽  
Texture Features ◽  
Image Database ◽  
Image Databases ◽  
Matching Method ◽  
Retrieval Method ◽  
Database Retrieval ◽  
Database Constraints

The traditional database information retrieval method is achieved by retrieving simple corresponding association of the attributes, which has the necessary requirement that image only have a single characteristic, with increasing complexity of image, it is difficult to process further feature extraction for the image, resulting in great increase of time consumed by large-scale image database retrieval. A fast retrieval method for large-scale image databases is proposed. Texture features are extracted in the database to support retrieval in database. Constraints matching method is introduced, in large-scale image database, referring to the texture features of image in the database to complete the target retrieval. The experimental results show that the proposed algorithm applied in the large-scale image database retrieval, augments retrieval speed, thereby improves the performance of large-scale image database.

scholarly journals A Large-Scale Secure Image Retrieval Method in Cloud Environment

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 160082-160090 ◽  
Author(s):  
Yanyan Xu ◽  
Xiao Zhao ◽  
Jiaying Gong
Keyword(s):  
Image Retrieval ◽  
Large Scale ◽  
Cloud Environment ◽  
Retrieval Method

OPTIMIZED METHOD OF NETWORK PACKET ROUTING

2019 ◽  
pp. 27-32
Author(s):  
A. S. Kotlyarov
Keyword(s):  
High Speed ◽  
Large Scale ◽  
Data Transfer ◽  
Search Method ◽  
Concurrent Use ◽  
Parallel Pipeline ◽  
Field Programmable ◽  
Modified Block ◽  
Hardware Costs ◽  
Routing Tables

In the paper we review the possibility of using a block search method for network packets routing tasks in high-speed computer networks. The method provides minimization of hardware costs for large-scale routing tables. To support the maximum data transfer rate, it is necessary to perform real-time routing of packets. The existing solution presumes concurrent use of several routing devices. Each device performs independent search of records by the bisection method. However, if the channel rate exceeds 10 Gb/sec, and the number of routs exceeds 220, it leads to high hardware costs. To reduce hardware costs, we have suggested to use a modified block search method, which differs from the classic one by parallel-pipeline form of search. We have presented evaluation of the minimum field-programmable gate array hardware costs for the network packets routing task. Analysis of the results has proved efficiency of the suggested method in comparison with existing solutions. As a result, the hardware costs were reduced in 5 times.

Non-Dominated Strategies for Decision Based Design for Component Reuse

2007 ◽  
Author(s):  
Vijitashwa Pandey ◽  
Deborah Thurston
Keyword(s):  
Large Scale ◽  
Common Ground ◽  
Partial Ordering ◽  
Impossibility Theorem ◽  
Component Reuse ◽  
Component Level ◽  
Dominated Strategies ◽  
The Government ◽  
Product Reuse ◽  
Decision Based Design

Component level reuse enables retention of value from products recovered at the end of their first lifecycle. Reuse strategies determined at the beginning of the lifecycle are aimed at maximizing this recovered value. Decision based design can be employed, but there are several difficulties in large scale implementation. First, computational complexities arise. Even with a product with a relatively small number of components, it becomes difficult to find the optimal component level decisions. Second, if there is more than one stakeholder involved, each interested in different attributes, the problem becomes even more difficult, due both to complexity and Arrow’s Impossibility Theorem. However, while the preferences of the stakeholders may not be known precisely, and aggregating those preferences poses difficulties, what is usually known is the partial ordering of alternatives. This paper presents a method for exploiting the features of a solution algorithm to address these difficulties in implementing decision based design. Heuristic methods including non-dominated sorting genetic algorithms (NSGA) can exploit this partial ordering and reject dominated alternatives, simplifying the problem. Including attributes of interest to various stakeholders ensures that the solutions found are practicable. One of the reasons product reuse has not achieved critical acceptance is because the three entities involved, the customers, the manufacturer and the government do not have a common ground. This results in inaccurate aggregating of attributes which the proposed method avoids. We illustrate our approach with a case study of component reuse of personal computers.

scholarly journals Research on Large-Scale Road Network Partition and Route Search Method Combined with Traveler Preferences

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
De-Xin Yu ◽  
Zhao-Sheng Yang ◽  
Yao Yu ◽  
Xiu-Rong Jiang
Keyword(s):  
Data Storage ◽  
Road Network ◽  
Large Scale ◽  
Search Algorithm ◽  
Optimal Path ◽  
Search Method ◽  
Urban Road Network ◽  
Urban Road ◽  
Path Search ◽  
Route Search

Combined with improved Pallottino parallel algorithm, this paper proposes a large-scale route search method, which considers travelers’ route choice preferences. And urban road network is decomposed into multilayers effectively. Utilizing generalized travel time as road impedance function, the method builds a new multilayer and multitasking road network data storage structure with object-oriented class definition. Then, the proposed path search algorithm is verified by using the real road network of Guangzhou city as an example. By the sensitive experiments, we make a comparative analysis of the proposed path search method with the current advanced optimal path algorithms. The results demonstrate that the proposed method can increase the road network search efficiency by more than 16% under different search proportion requests, node numbers, and computing process numbers, respectively. Therefore, this method is a great breakthrough in the guidance field of urban road network.

Sign in / Sign up

Export Citation Format

Share Document