• Title/Summary/Keyword: Real-time Search Terms

Search Result 60, Processing Time 0.026 seconds

Realization of a Motion-based Interactive System Using Extraction of Real-time Search Terms

  • Lim, Sooyeon;Lee, Dongin
    • International Journal of Contents
    • /
    • v.12 no.2
    • /
    • pp.31-36
    • /
    • 2016
  • The purpose of this research is to realize interactive art based on user's motions information using real time internet search terms. For this purpose, real-time search terms and related news information were extracted from three domestic and foreign portal sites, and the extracted information was used to generate content for interaction with the user. For interaction between the generated content and the user, a motion-based interactive technology that optimizes the intentions and experiences of the user was developed. A motion-based interactive system can be used to develop an immersive interface that induces user interest.

Estimating long-term sustainability of real-time issues on portal sites (포털사이트 실시간이슈 지속가능성 평가)

  • Chong, Min-Young
    • Journal of Digital Convergence
    • /
    • v.17 no.12
    • /
    • pp.255-260
    • /
    • 2019
  • Real-time search keywords are not only limited to search keywords that are rapidly increasing interest in real-time, but also have a limitation that they are difficult to determine the sustainability as there is a difference in ranking between portal sites. Estimating sustainability for real-time search keywords is significant in terms of overcoming these limitations and providing some predictability. In particular, long-term search keywords that last for more than a month are of high value as long-lasting social issues. Therefore, in this paper, we analyze the interest based on the ranking of the real-time search keywords and the duration based on sustained weeks, days and hours of real-time search keywords by each portal site and the integrated portal site, and then estimating sustainability based on high level of interest and duration, and present a method to derive real-time search issues with high long-term sustainability.

A Coarse Grid Method for the Real-Time Route Search in a Large Network (복잡한 대규모의 도로망에서 실시간 경로 탐색을 위한 단계별 세분화 방법)

  • Kim, Seong-In;Kim, Hyun-Gi
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.5
    • /
    • pp.61-73
    • /
    • 2004
  • The efficiency of the real-time route guidance system(RGS) depends largely on the quality of route search algorithms. In this paper, we implement the coarse grid method(CGM) in mathematical programming for finding a good quality route of real-time RGS in large-scale networks. The proposed CGM examines coarser and wider networks as the search phase proceeds, in stead of searching the whole network at once. Naturally, we can significantly reduce computational efforts in terms of search time and memory requirement. We demonstrate the practical effectiveness of the proposed CGM with nationwide real road network simulation.

Real-Time Non-Local Means Image Denoising Algorithm Based on Local Binary Descriptor

  • Yu, Hancheng;Li, Aiting
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.825-836
    • /
    • 2016
  • In this paper, a speed-up technique for the non-local means (NLM) image denoising method based on local binary descriptor (LBD) is proposed. In the NLM, most of the computation time is spent on searching for non-local similar patches in the search window. The local binary descriptor which represents the structure of patch as binary strings is employed to speed up the search process in the NLM. The descriptor allows for a fast and accurate preselection of non-local similar patches by bitwise operations. Using this approach, a tradeoff between time-saving and noise removal can be obtained. Simulations exhibit that despite being principally constructed for speed, the proposed algorithm outperforms in terms of denoising quality as well. Furthermore, a parallel implementation on GPU brings NLM-LBD to real-time image denoising.

An Improved Three-Step Search Algorithm for Block Motion Estimation

  • Hong, Won-Gi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.9B
    • /
    • pp.1604-1608
    • /
    • 2000
  • The three-step search (TSS) algorithm for block motion estimation has been widely used in real-time video coding due to the simplicity of the algorithm significant reduction of computationl cost and good performance. In this paper an improved three-step search (ITS) algorithm is proposed to improve the performance of the TSS algorithm. Simulation results show that in terms of motion compensation errors the proposed ITSS outperforms some popular fast search algorithms while it has the lower computational complexity.

  • PDF

Application of Color Information to Facilitate Finding Books in the Library

  • Park, Kyeongjin;Kim, Hyeon Chul;Lee, Eun Hye;Kim, Kyungdoh
    • Journal of the Ergonomics Society of Korea
    • /
    • v.36 no.3
    • /
    • pp.197-211
    • /
    • 2017
  • Objective: We propose to apply color information to facilitate finding books in the library. Background: Currently, books are classified in the basis of a decimal classification system and a call number in the library. Users find a book using the call number. However, this classification system causes various difficulties. Method: In a process analysis and survey study, we identify what the real problem is and where the problem is occurred. To solve the real problems, we derived a new search method using color information. We conducted a comparative experiment with 48 participants to see whether the new method can show higher performance. Results: The new method using color information showed faster time and higher subjective rating scores than current call number method. Also, the new method showed faster time regardless of the skill level while the call number method showed time differences in terms of the skill level. Conclusion: The effectiveness of the proposed method was verified by experiments. Users will be able to find the desired book without difficulty. This method can improve the quality of service and satisfaction of library use. Application: Our book search method can be applied as a book search tool in a real public library. We hope that the method can provide higher satisfaction to users.

Tabu Search for Sequencing to Minimize the Utility Work (가외작업을 최소로 하는 투입순서 결정을 위한 Tabu Search)

  • Hyun, Chul-Ju
    • Proceedings of the Korean Society for Quality Management Conference
    • /
    • 2009.10a
    • /
    • pp.131-135
    • /
    • 2009
  • This paper considers the sequencing of products in car assembly lines. The sequence which minimizes overall utility work in car assembly lines reduce the cycle time and the risk of conveyor stopping. The sequencing problem is solved using Tabu Search. Tabu Search is a heuristic method which can provide a near optimal solution in real time. The performance of proposed technique is compared with existing heuristic methods in terms of solution quality and computation time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

  • PDF

Efficient Bidirectional Search Algorithm for Optimal Route (최적 경로를 보장하는 효율적인 양방향 탐색 알고리즘)

  • 황보택근
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.6
    • /
    • pp.745-752
    • /
    • 2002
  • A* algorithm is widely used in optimal car route search which is a kind of informed search, since the locations of starting and ending points are known a priori. Unidirectional A* algorithm requires considerable search time but guarantees a optimal path, bidirectional A* algorithm does not guarantee a optimal path and takes even longer search time than unidirectional search to guarantee a optimal path. In this paper, a new bidirectional A* algorithm which requites less search time and guarantees a optimal path is proposed. To evaluate the efficiency of the proposed algorithm, several experiments are conducted in real road map and the results show that the algorithm is very effective in terms of finding a optimal path and search time.

  • PDF

Nano Technology Trend Analysis Using Google Trend and Data Mining Method for Nano-Informatics (나노 인포매틱스 기반 구축을 위한 구글 트렌드와 데이터 마이닝 기법을 활용한 나노 기술 트렌드 분석)

  • Shin, Minsoo;Park, Min-Gyu;Bae, Seong-Hun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.4
    • /
    • pp.237-245
    • /
    • 2017
  • Our research is aimed at predicting recent trend and leading technology for the future and providing optimal Nano technology trend information by analyzing Nano technology trend. Under recent global market situation, Users' needs and the technology to meet these needs are changing in real time. At this point, Nano technology also needs measures to reduce cost and enhance efficiency in order not to fall behind the times. Therefore, research like trend analysis which uses search data to satisfy both aspects is required. This research consists of four steps. We collect data and select keywords in step 1, detect trends based on frequency and create visualization in step 2, and perform analysis using data mining in step 3. This research can be used to look for changes of trend from three perspectives. This research conducted analysis on changes of trend in terms of major classification, Nano technology of 30's, and key words which consist of relevant Nano technology. Second, it is possible to provide real-time information. Trend analysis using search data can provide information depending on the continuously changing market situation due to the real-time information which search data includes. Third, through comparative analysis it is possible to establish a useful corporate policy and strategy by apprehending the trend of the United States which has relatively advanced Nano technology. Therefore, trend analysis using search data like this research can suggest proper direction of policy which respond to market change in a real time, can be used as reference material, and can help reduce cost.

A Study on the Effect of the Searcher색s Subject Background on the Result of Online Database Searches (탐색자의 주제배경이 탐색효과에 미치는 영향)

  • 이근봉
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.7 no.1
    • /
    • pp.293-317
    • /
    • 1994
  • The Purpose of this study is to verify the effect of the searcher's subject background on the result of online database searches. To achieve this purpose, an experimental method was adopted. 180 students performed online searches in the three different libraries chosen for this study. The subjects were classified into two groups according to the scores of the test. Data concerning processes, behavior, and results of the searches performed by the subjects in real situations were gathered. Immediately following the searches, the extent of their subject background were assessed through interview. The search effect consists of the 4 elements: search efficiency (the number of terms used per unit time), the number of relevant documents, the number of relevant documents per unit time, precision ratio. The major findings of this study are summarized as belows. 1. The searchers with strong subject background has significantly higher efficiency in searches made. Group A (of those with strong subject back-ground) use more search terms per unit time than Group B (of those with weak subject background) do. 2. In the searches made by those with strong subject background, more relevant documents art retrieved. 3. In the searches made by those with strong subject background, more relevant documents per unit time are retrieved. 4. The searchers with strong subject background has significantly higher precision ratio in searches made. In the searches made by those with strong subject background, more relevant documents of documents retrieved are retrieved.

  • PDF