• Title/Summary/Keyword: search management system

Search Result 1,084, Processing Time 0.026 seconds

A Mobile Semantic Integrated Search System of National Defense Research Information (국방연구정보의 모바일 시맨틱 통합검색 시스템)

  • Yoo, Dong-Hee;Ra, Min-Young
    • The KIPS Transactions:PartB
    • /
    • v.18B no.5
    • /
    • pp.295-304
    • /
    • 2011
  • To effectively manage research information in the field of national defense, metadata about the information should be managed systematically, and an integrated system to help convergence and management of the information should be implemented based on the metadata. In addition, the system should provide the users with effective integrated search services in a mobile environment, because searching via the use of mobile devices is increasing. The objective of this paper is to suggest a MSISS (Mobile Semantic Integrated Search System), which satisfies the requirements for effective management of the national defense research information. Specifically, we defined national defense research ontologies and national defense research rules after analyzing the Dublin Core metadata and database information of the major military research institutions. We implemented a prototype system for MSISS to demonstrate the use of the ontologies and rules for semantic integrated searching of the military research information. We also presented a triple-based search service to support semantic integrated search in a mobile environment and suggested future mobile semantic integrated search services.

Implementation of Search Engine to Minimize Traffic Using Blockchain-Based Web Usage History Management System

  • Yu, Sunghyun;Yeom, Cheolmin;Won, Yoojae
    • Journal of Information Processing Systems
    • /
    • v.17 no.5
    • /
    • pp.989-1003
    • /
    • 2021
  • With the recent increase in the types of services provided by Internet companies, collection of various types of data has become a necessity. Data collectors corresponding to web services profit by collecting users' data indiscriminately and providing it to the associated services. However, the data provider remains unaware of the manner in which the data are collected and used. Furthermore, the data collector of a web service consumes web resources by generating a large amount of web traffic. This traffic can damage servers by causing service outages. In this study, we propose a website search engine that employs a system that controls user information using blockchains and builds its database based on the recorded information. The system is divided into three parts: a collection section that uses proxy, a management section that uses blockchains, and a search engine that uses a built-in database. This structure allows data sovereigns to manage their data more transparently. Search engines that use blockchains do not use internet bots, and instead use the data generated by user behavior. This avoids generation of traffic from internet bots and can, thereby, contribute to creating a better web ecosystem.

An Intelligent Search Modeling using Avatar Agent

  • Kim, Dae Su
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.4 no.3
    • /
    • pp.288-291
    • /
    • 2004
  • This paper proposes an intelligent search modeling using avatar agent. This system consists of some modules such as agent interface, agent management, preprocessor, interface machine. Core-Symbol Database and Spell Checker are related to the preprocessor module and Interface Machine is connected with Best Aggregate Designer. Our avatar agent system does the indexing work that converts user's natural language type sentence to the proper words that is suitable for the specific branch information retrieval. Indexing is one of the preprocessing steps that make it possible to guarantee the specialty of user's input and increases the reliability of the result. It references a database that consists of synonym and specific branch dictionary. The resulting symbol after indexing is used for draft search by the internet search engine. The retrieval page position and link information are stored in the database. We experimented our system with the stock market keyword SAMSUNG_SDI, IBM, and SONY and compared the result with that of Altavista and Google search engine. It showed quite excellent results.

A design and implementation of the management system for number of keyword searching results using Google searching engine (구글 검색엔진을 활용한 키워드 검색결과 수 관리 시스템 설계 및 구현)

  • Lee, Ju-Yeon;Lee, Jung-Hwa;Park, Yoo-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.5
    • /
    • pp.880-886
    • /
    • 2016
  • With lots of information occurring on the Internet, the search engine plays a role in gathering the scattered information on the Internet. Some search engines show not only search result pages including search keyword but also search result numbers of the keyword. The number of keyword searching result provided by the Google search engine can be utilized to identify overall trends for this search word on the internet. This paper is aimed designing and realizing the system which can efficiently manage the number of searching result provided by Google search engine. This paper proposed system operates by Web, and consist of search agent, storage node, and search node, manage keyword and search result, numbers, and executing search. The proposed system make the results such as search keywords, the number of searching, NGD(Normalized Google Distance) that is the distance between two keywords in Google area.

Visual Search Model based on Saliency and Scene-Context in Real-World Images (실제 이미지에서 현저성과 맥락 정보의 영향을 고려한 시각 탐색 모델)

  • Choi, Yoonhyung;Oh, Hyungseok;Myung, Rohae
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.41 no.4
    • /
    • pp.389-395
    • /
    • 2015
  • According to much research on cognitive science, the impact of the scene-context on human visual search in real-world images could be as important as the saliency. Therefore, this study proposed a method of Adaptive Control of Thought-Rational (ACT-R) modeling of visual search in real-world images, based on saliency and scene-context. The modeling method was developed by using the utility system of ACT-R to describe influences of saliency and scene-context in real-world images. Then, the validation of the model was performed, by comparing the data of the model and eye-tracking data from experiments in simple task in which subjects search some targets in indoor bedroom images. Results show that model data was quite well fit with eye-tracking data. In conclusion, the method of modeling human visual search proposed in this study should be used, in order to provide an accurate model of human performance in visual search tasks in real-world images.

A Study on the Construction and User Base Evaluation of the Accuracy Rate and Satisfaction about Field Search System and XML Base Structure Search System (필드검색시스템과 XML기반 구조검색시스템의 구축과 이용자 기반의 정확률 및 만족도 평가에 관한 연구)

  • 김덕성
    • Proceedings of the Korean Society for Information Management Conference
    • /
    • 2001.08a
    • /
    • pp.153-158
    • /
    • 2001
  • 많은 정보가 인터넷 상에 산재함에 따라 검색엔진의 한계를 느끼게 되었으며, 정보의 질적인 문제를 해결하기 하여 메타데이터가 등장하게 되었으며, 이러한 메타데이터를 대상으로 검색하는 시스템이 등장하게되었다. 이에 본 연구는 2가지 메타데이터 검색시스템(필드검색시스템과 XML기반 구조검색시스템)을 구축하고 시스템의 차이와 이용자의 메타데이터 구조에 대한 이해의 차이가 이용자의 검색 만족도와 검색 정확율에 어떠한 영향을 미치는가를 밝히는 것이다.

  • PDF

Particle Swarm Optimization for Redundancy Allocation of Multi-level System considering Alternative Units (대안 부품을 고려한 다계층 시스템의 중복 할당을 위한 입자 군집 최적화)

  • Chung, Il Han
    • Journal of Korean Society for Quality Management
    • /
    • v.47 no.4
    • /
    • pp.701-711
    • /
    • 2019
  • Purpose: The problem of optimizing redundancy allocation in multi-level systems is considered when each item in a multi-level system has alternative items with the same function. The number of redundancy of multi-level system is allocated to maximize the reliability of the system under path set and cost limitation constraints. Methods: Based on cost limitation and path set constraints, a mathematical model is established to maximize system reliability. Particle swarm optimization is employed for redundant allocation and verified by numerical experiments. Results: Comparing the particle swarm optimization method and the memetic algorithm for the 3 and 4 level systems, the particle swarm optimization method showed better performance for solution quality and search time. Particularly, the particle swarm optimization showed much less than the memetic algorithm for variation of results. Conclusion: The proposed particle swarm optimization considerably shortens the time to search for a feasible solution in MRAP with path set constraints. PS optimization is expected to reduce search time and propose the better solution for various problems related to MRAP.

Consideration of a Robust Search Methodology that could be used in Full-Text Information Retrieval Systems (퍼지 논리를 이용한 사용자 중심적인 Full-Text 검색방법에 관한 연구)

  • Lee, Won-Bu
    • Asia pacific journal of information systems
    • /
    • v.1 no.1
    • /
    • pp.87-101
    • /
    • 1991
  • The primary purpose of this study was to investigate a robust search methodology that could be used in full-text information retrieval systems. A robust search methodology is one that can be easily used by a variety of users (particularly naive users) and it will give them comparable search performance regardless of their different expertise or interests In order to develop a possibly robust search methodology, a fully functional prototype of a fuzzy knowledge based information retrieval system was developed. Also, an experiment that used this prototype information retreival system was designed to investigate the performance of that search methodology over a small exploratory sample of user queries To probe the relatonships between the possibly robust search performance and the query organization using fuzzy inference logic, the search performance of a shallow query structure was analyzes. Consequently the following several noteworthy findings were obtained: 1) the hierachical(tree type) query structure might be a better query organization than the linear type query structure 2) comparing with the complex tree query structure, the simple tree query structure that has at most three levels of query might provide better search performance 3) the fuzzy search methodology that employs a proper levels of cut-off value might provide more efficient search performance than the boolean search methodology. Even though findings could not be statistically verified because the experiments were done using a single replication, it is worth noting however, that the research findings provided valuable information for developing a possibly robust search methodology in full-text information retrieval.

  • PDF

Optimal Design of Reporting Cell Location Management System using Simulated annealing System (시뮬레이티드어닐링을 이용한 리포팅셀 위치관리시스템 최적 설계)

  • Kim, Sung-Soo;Moon, Jae-Ki
    • Journal of Industrial Technology
    • /
    • v.28 no.B
    • /
    • pp.9-14
    • /
    • 2008
  • In the Reporting Cell Location Management (RCLM) system, a subset of cells in the network is designated as the reporting cells. Each mobile terminal performs location update only when it enters one of these reporting cells. When a call arrives, the paging is confined to the reporting cell the user last reported and the neighboring bounded non-reporting cells. Frequent location update may result in degradation of quality of service due to interference. Miss on the location of a mobile terminal will necessitate a search operation on the network when a call comes in. We must decide the number of reporting cells and which cell should be reporting cell to balance the registration (location update) and search (paging) operations to minimize the cost of RCLM system. This paper proposes a simulated annealing (SA) for optimization of RCLM system.

  • PDF

A Study of the Construction and Application of Point of Interest Data for Search and Guide (생활지리정보 검색 및 안내를 위한 POI의 구축 및 활용)

  • Kim, Dae-Sik;Kim, Hyung-Jin;Son, Bong-Soo;Yu, Wann
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2003.11a
    • /
    • pp.423-430
    • /
    • 2003
  • Generally, elements of DRM(Digital Road Map) consist of road, background and landmark data. The landmark, expressed as text and symbol, on map and additional search data are processed by GISSD(Geo-spatial Information System Service Data). This paper aims to develop the DBMS(Database Management System) for operating landmark and search data, and to discuss the characteristics and application of the DBMS. To accomplish the two objectives, the following four tasks were performed in this study. First, the working scopes of field survey and specification to construct the GISSD were defined. Second, the suggested process of manufacture and design of database were described. Third, the software for required construction and management of the system were developed. Lastly, the properties of developed system and data were analyzed. Especially, the efforts for the GISSD in this study are expected to provide a direct use and practical application to the creation of landmark in DRM and search data.

  • PDF