• Title/Summary/Keyword: Information Search Model

Search Result 1,293, Processing Time 0.026 seconds

A Study of Efficient Search Location Model for East Search Algorithm

  • Kim, Jean-Youn;Hyeok Han;Park, Nho-Kyung;Yun, Eui-Jung;Jin, Hyun-Joon
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.43-45
    • /
    • 2000
  • For motion estimation, the block matching algorithm is widely used to improve the compression ratio of low bit-rate motion video. As a newly developed fast search algorithm, the nearest-neighbors search technique has a drawback of degrading video quality while providing fisher speed in search process. In this paper, a modified nearest-neighbors search algorithm is proposed in which a double rectangular shaped search-candidate area is used to improve video quality in encoding process with a small increasing of search time. To evaluate the proposed algorithm. other methods based on the nearest-neighbors search algorithm are investigated.

  • PDF

Development of Search and Rescue System with Dynamic Model by RF Signal Based LTE (탐색구조 시스템에서의 RF 신호 기반 동역학 모델 적용 및 개발)

  • Jeong, I.C.;Kim, D.W.;Ahn, W.G.;Lee, S.
    • Journal of Satellite, Information and Communications
    • /
    • v.12 no.4
    • /
    • pp.120-124
    • /
    • 2017
  • This paper describes the product of search and rescue system with dynamic model. This spread spectrum system based new standard of COSPAS-SARSAT is results of RF signal generation and transmission. we will test performance evaluation which implement signal process adapting Dynamic model and we will adapt the CAF model using TDOA and FDOA relationship.

A network traffic prediction model of smart substation based on IGSA-WNN

  • Xia, Xin;Liu, Xiaofeng;Lou, Jichao
    • ETRI Journal
    • /
    • v.42 no.3
    • /
    • pp.366-375
    • /
    • 2020
  • The network traffic prediction of a smart substation is key in strengthening its system security protection. To improve the performance of its traffic prediction, in this paper, we propose an improved gravitational search algorithm (IGSA), then introduce the IGSA into a wavelet neural network (WNN), iteratively optimize the initial connection weighting, scalability factor, and shift factor, and establish a smart substation network traffic prediction model based on the IGSA-WNN. A comparative analysis of the experimental results shows that the performance of the IGSA-WNN-based prediction model further improves the convergence velocity and prediction accuracy, and that the proposed model solves the deficiency issues of the original WNN, such as slow convergence velocity and ease of falling into a locally optimal solution; thus, it is a better smart substation network traffic prediction model.

Personal Information Management Based on the Concept Lattice of Formal Concept Analysis (FCA 개념 망 기반 개인정보관리)

  • Kim, Mi-Hye
    • Journal of Internet Computing and Services
    • /
    • v.6 no.6
    • /
    • pp.163-178
    • /
    • 2005
  • The ultimate objective of Personal Information Management (PIM) is to collect, handle and manage wanted information in a systematic way that enables individuals to search the information more easily and effectively, However, existing personal information management systems are usually based on a traditional hierarchical directory model for storing information, limiting effective organization and retrieval of information as well as providing less support in search by associative interrelationship between objects (documents) and their attributes, To improve these problems, in this paper we propose a personal information management model based on the concept lattice of Formal Concept Analysis (FCA) to easily build and maintain individuals' own information on the Web, The proposed system can overcome the limitations of the traditional hierarchy approach as well as supporting search of other useful information by the inter-relationships between objects and their attributes in the concept lattice of FCA beyond a narrow search.

  • PDF

Construction of Indoor and Outdoor Spatial Information Integration Service System based on Vector Model

  • Kim, Jun Hyun;Kwon, Kee Wook
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.36 no.3
    • /
    • pp.185-196
    • /
    • 2018
  • In order to overcome the problem that outdoor and indoor spatial information service are separately utilized, an integration service system of spatial information that is linked from outdoor to indoor has been implemented. As a result of the study, "0001.xml" corresponding to the file index key value, which is the service connection information in the building information of the destination, was extracted from the prototype verification of the system, the search word of 'Kim AB' was transmitted to the indoor map server and converted from the outdoor map service to the indoor map service through confirmation of the navigation service connected information, using service linkage information and search words of the indoor map service was confirmed that the route was displayed from the entrance of the building to the destination in the building through the linkage search DB (Database) table and the search query. Therefore, through this study was examined the possibility of linking indoor and outdoor DB through vector spatial information integration service system. The indoor map and the map engine were implemented based on the same vector map format as the outdoor map engine, it was confirmed that the connectivity of the map engine can be applied.

Comparison and Analysis of Information Exchange Distributed Algorithm Performance Based on a Circular-Based Ship Collision Avoidance Model (원형 기반 선박 충돌 피항 모델에 기반한 정보 교환 분산알고리즘 성능 비교 분석)

  • Donggyun Kim
    • Journal of Navigation and Port Research
    • /
    • v.47 no.6
    • /
    • pp.401-409
    • /
    • 2023
  • This study compared and analyzed the performance of a distributed area search algorithm and a distributed probability search algorithm based on information exchange between ships. The distributed algorithm is a method that can search for an optimal avoidance route based on information exchange between ships. In the distributed area search algorithm, only a ship with the maximum cost reduction among neighboring ships has priority, so the next expected location can be changed. The distributed stochastic search algorithm allows a non-optimal value to be searched with a certain probability so that a new value can be searched. A circular-based ship collision avoidance model was used for the ship-to-ship collision avoidance experiment. The experimental method simulated the distributed area search algorithm and the distributed stochastic search algorithm while increasing the number of ships from 2 to 50 that were the same distance from the center of the circle. The calculation time required for each algorithm, sailing distance, and number of message exchanges were compared and analyzed. As a result of the experiment, the DSSA(Distributed Stochastic Search Algorithm) recorded a 25%calculation time, 88% navigation distance, and 84% of number of message exchange rate compared to DLSA.

A modified tabu search for redundancy allocation problem of complex systems of ships

  • Kim, Jae-Hwan;Jang, Kil-Woong
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.38 no.2
    • /
    • pp.225-232
    • /
    • 2014
  • The traditional RAP (Redundancy Allocation Problem) of complex systems has considered only the redundancy of subsystem with homogeneous components. In this paper we extend it as a RAP of complex systems with heterogeneous components which is more flexible than the case of homogeneous components. We model this problem as a nonlinear integer programming problem, find its optimal solution by tabu search, and suggest an example of the efficient reliability design with heterogeneous components. In order to improve the quality of the solution of the tabu search, we suggest a modified tabu search to employ an adaptive procedure (1-opt or 2-opt exchange) to generate the efficient neighborhood solutions. Computational results show that our modified procedure obtains better solutions as the size of problem increases from 30 to 50, even though it requires rather more computing time. With some adjustment of the parameters of the proposed method, it can be applied to the optimal reliability designs of complex systems of ships.

A Spiking Neural Network for Autonomous Search and Contour Tracking Inspired by C. elegans Chemotaxis and the Lévy Walk

  • Chen, Mohan;Feng, Dazheng;Su, Hongtao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.2846-2866
    • /
    • 2022
  • Caenorhabditis elegans exhibits sophisticated chemotaxis behavior through two parallel strategies, klinokinesis and klinotaxis, executed entirely by a small nervous circuit. It is therefore suitable for inspiring fast and energy-efficient solutions for autonomous navigation. As a random search strategy, the Lévy walk is optimal for diverse animals when foraging without external chemical cues. In this study, by combining these biological strategies for the first time, we propose a spiking neural network model for search and contour tracking of specific concentrations of environmental variables. Specifically, we first design a klinotaxis module using spiking neurons. This module works in conjunction with a klinokinesis module, allowing rapid searches for the concentration setpoint and subsequent contour tracking with small deviations. Second, we build a random exploration module. It generates a Lévy walk in the absence of concentration gradients, increasing the chance of encountering gradients. Third, considering local extrema traps, we develop a termination module combined with an escape module to initiate or terminate the escape in a timely manner. Experimental results demonstrate that the proposed model integrating these modules can switch strategies autonomously according to the information from a single sensor and control steering through output spikes, enabling the model worm to efficiently navigate across various scenarios.

가치혁신 전략을 적용한 디지털콘텐츠 평가에 관한 연구;구글과 네이버의 검색 서비스를 중심으로

  • No, Mi-Jeong;Mun, Hyeong-Nam
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2007.05a
    • /
    • pp.229-238
    • /
    • 2007
  • This study was intended to point out the limit of existing digital content-centered studies, or approaches from the viewpoint of the supplier and in the aspect of business profit model and find ways to assess the quality of digital content, considering the characteristics of digital content. For this, the study is to apply value innovation strategy to digital content assessment, to analyze the applicability, and to propose a new and practical framework for digital content assessment method. To this end, this study selected the global No. 1 search service provider Google and local portal site Naver search service. The study on assessment factors by value innovation strategy was based on existing literature, while user-value elements in that respect were confined to information quality, interactivity, communication, interactive storytelling, and usability. This study objectified the relation with the value innovation strategic analysis, through qualitative and quantitative analyses on value elements of search service users.

  • PDF

A Construction of Fuzzy Inference Network based on Neural Logic Network and its Search Strategy

  • Lee, Mal-rey
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2000.11a
    • /
    • pp.375-389
    • /
    • 2000
  • Fuzzy logic ignores some information in the reasoning process. Neural networks are powerful tools for the pattern processing, but, not appropriate for the logical reasoning. To model human knowledge, besides pattern processing capability, the logical reasoning capability is equally important. Another new neural network called neural logic network is able to do the logical reasoning. Because the fuzzy inference is a fuzzy logical reasoning, we construct fuzzy inference network based on the neural logic network, extending the existing rule- inference. network. And the traditional propagation rule is modified. For the search strategies to find out the belief value of a conclusion in the fuzzy inference network, we conduct a simulation to evaluate the search costs for searching sequentially and searching by means of search priorities.

  • PDF