• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.1
• /
• pp.1-8
• /
• 2008

In the Web 2.0, besides more gaining information on the web, the number of web sites that take advantage of RSS increases explosively. Commonly each users search RSS channels through the web search engine before registering RSS channel's url to the RSS reader. Users judge whether the site is RSS channel or not and register an RSS channel's url through theirs interests. Because accomplished by users themselves, those processes conflict to user's convenience and quick consumption of information. Techniques of current search engines can't provide users with reliable RSS feed information as search results. In this paper, we analysis appropriateness of current search engines' techniques that offer users RSS feed search service and discuss their limitations. Also, we make up RSS feed database through classification of RSS tag being possible to search RSS feed information effectively and apply update rate of each RSS channel's feed to ranking algorithm providing more reliable search results.

• Proceedings of the KSR Conference
• /
• 1998.05a
• /
• pp.323-329
• /
• 1998

Fatigue strength database system was developed for Windows 95 on personal computer. The relational database management system Visual Foxpro 5.0 was used. The database system developed contains 3,147 S-N curves and 311 $\varepsilon$-N ones for 437 material symbols and has the ability to search data by material symbol that each specification marks differently. Visual Basic 5.0 was used for graphic presentation and statistical treatment of the data searched.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.810-813
• /
• 2004

Indexing and Retrieving images from large and varied collections using image content as a key is a challenging and important problem in computer vision application. In this paper, a color Content-based Image Retrieval (CBIR) system using hierarchical Region of Interest (ROI) query and indexing is presented. During indexing process, First, The ROIs on every image in the image database are extracted using a region-based image segmentation technique, The JSEG approach is selected to handle this problem in order to create color-texture regions. Then, Color features in form of histogram and correlogram are then extracted from each segmented regions. Finally, The features are stored in the database as the key to retrieve the relevant images. As in the retrieval system, users are allowed to select ROI directly over the sample or user's submission image and the query process then focuses on the content of the selected ROI in order to find those images containing similar regions from the database. The hierarchical region-of-interest query is performed to retrieve the similar images. Two-level search is exploited in this paper. In the first level, the most important regions, usually the large regions at the center of user's query, are used to retrieve images having similar regions using static search. This ensures that we can retrieve all the images having the most important regions. In the second level, all the remaining regions in user's query are used to search from all the retrieved images obtained from the first level. The experimental results using the indexing technique show good retrieval performance over a variety of image collections, also great reduction in the amount of searching time.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.1
• /
• pp.46-55
• /
• 2009

We study the problem of searching documents containing each of several keywords (conjunctive keyword search) over encrypted documents. A conjunctive keyword search protocol consists of three entities: a data supplier, a storage system such as database, and a user of storage system. A data supplier uploads encrypted documents on a storage system, and then a user of the storage system searches documents containing each of several keywords. Recently, many schemes on conjunctive keyword search have been suggested in various settings. However, the schemes require high computation cost for the data supplier or user storage. Moreover, up to now, their securities have been proved in the random oracle model. In this paper, we propose efficient conjunctive keyword search schemes over encrypted documents, for which security is proved without using random oracles. The storage of a user and the computational and communication costs of a data supplier in the proposed schemes are constant. The security of the scheme relies only on the hardness of the Decisional Bilinear Diffie-Hellman (DBDH) problem.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.772-774
• /
• 2017

Currently, there are many simple searches for local culture and tourism, but systematic information retrieval using ontology technology is weak. The keyword-based search, which is an existing search method, derives a search result that is different from a user's wanted intention. On the other hand, semantic search using ontology constructs shows the information related to the search term by creating a relation between words and words. Therefore, when tourists search for cultural and tourist attractions in the area, they provide information that includes meaning relevance in the search results. If the ontology provides information on the culture, sightseeing area, transportation, Can be more easily grasped. In this paper, we propose an ontology-based retrieval system based on culture and tourist sites utilizing public institutions database by using mobile application by extending search system which relied only on existing internal database to provide accurate and reliable information to users. This efficient structure of the ontology makes it possible to provide information suitable for the user quickly and accurately.

• Journal of the Korean Society for information Management
• /
• v.17 no.1
• /
• pp.103-127
• /
• 2000

This study compared finding economic and energy information on the WWW to finding the same information on DIALOG, a traditional search service. Professional searchers answered 20 questions for end users using either of DIALOG and one Internet database (general search engine or Web database). The relevance of the results in both sets of answers was ranked by searchers and end-users, respectively. The study found that searching for information on the Web took at least twice as long as it did when using DIALOG. Relevance rating was a little higher for materials found on DIALOG. However, the relevance rating difference between two systems was not so higher than we expected. From the research results, we conclude that Internet database including Web database and general search engines is providing valuable information of economic and energy subject areas.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.20 no.2
• /
• pp.165-179
• /
• 2007

For the purpose of optimum design of reinforced concrete structures, pre-determined section database of column and beam are constructed and arranged in order of the resisting capacity. Then, regression equations representing the relation between section number and section resisting capacity are derived. In advance, effective optimization algorithms which search optimized solution quickly using direct search method from these database are proposed. In practice, from the fact that engineers conduct member design close to capacity optimization rather than cost optimization, both capacity and cost optimization using proposed algorithms are performed, and the review for the obtained results are followed. Moreover, the investigation for the applicability and effectiveness of the Introduced design procedure is conducted through correlation study for example structures. Because of no restriction in constructing objective functions with very simple optimization processes and fast convergence, the introduced method can effectively be used in the preliminary design stage. Especially, selected solutions from database are directly applicable in practice because these sections already satisfy all the requirements in design codes and practical restrictions.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.1
• /
• pp.25-33
• /
• 1998

This paepr presents an algorithm for searching an object in a fast way which contains a continuous moving object in multi-dimensional spatical databases. This algorithm improves the search method of R-tree for the case that a target object is continuously moving in a spatial database. It starts the searching from the current node instead of the root of R-tree. Thus, the algorithm will find the target object from the entries of current node or sibling nodes in the most cases. The performance analysis shows that it is more efficient than the existing algorithm for R-tree when search windows or target objects are continuously moving.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.570-573
• /
• 2007

In this paper, we can find a new effective way in the search function of hangeul characters by using frequency of data. Also using a new algorithm suggested in this paper, we made the effective search function of hangeul characters in database.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.3
• /
• pp.177-182
• /
• 1998

The computer related techniques have been developed rapidly in the field of metal removal industry. The electronic catalog for mechanical elements is one of such developments realized in recent years. As the emergence of the electronic catalogs in the 90s, it breaks the restriction of the traditional catalog and becomes a helpful and efficient tool in the field. In this paper, we develop an electronic catalog for the cutting tools of the Korea Tungsten Co. Ltd. The catalog consists of three parts: a preprocessor for tool selection, a database for tool, and a postprocessor for search result. A preprocessor for tool selection is developed under a user-friendly consideration. A database for tool consists of milling, drilling, and reaming tools with a list of cutters, inserts, and components. A postprocessor for search result consists of weight, dimension. drawing, product order number etc. of the tools. It also suggests the optimized cutting condition of the selected tool using a neural network technique which is done by an independent research group.