• Journal of Digital Convergence
• /
• v.13 no.12
• /
• pp.161-169
• /
• 2015

Realtime search words of typical portal sites appear every few seconds in descending order by search frequency in order to show issues increasing rapidly in interest. However, the characteristics of realtime search words reordering within too short a time cause problems that they go over the key issues of the day. This paper proposes a method for deriving a key issue through association analysis of realtime search words. The proposed method first makes scores of realtime search words depending on the ranking and the relative interest, and derives the top 10 search words through descriptive statistics for groups. Then, it extracts association rules depending on 'support' and 'confidence', and chooses the key issue based on the results as a graph visualizing them. The results of experiments show that the key issue through association rules is more meaningful than the first realtime search word.

• Journal of Digital Convergence
• /
• v.14 no.12
• /
• pp.237-243
• /
• 2016

Since realtime search keywords of portal sites are arranged in descending order by instant increasing rates of search numbers, they easily show issues increasing in interests for a short time. But they have the limits extracted different results by portal sites and not shown issues by a period. Thus, to find key issues from the whole realtime search keywords for certain period, and to show results of summarizing them and analyzing differences, is significant in providing the basis of understanding issues more practically and in maintaining consistency of them. This paper analyzes differences of week key issues extracted from week analysis of realtime search keywords provided by two typical portal sites. The results of experiments show that the portal group means of realtime search keywords by the independent t-test and the survival functions of realtime search keywords by the survival analysis are statistically significant differences.

• Journal of IKEEE
• /
• v.17 no.1
• /
• pp.36-43
• /
• 2013

This paper proposes a motion estimation algorithm with run-time adaptive workload control. It has optimized performance within limited hardware resources while guaranteeing hard realtime operation. It performs maximum searches within hard realtime constraints, since it determines search steps and workload adaptively. It reduces the hardware size to 1/4~1/400 of conventional algorithms, while its PSNR degradation is only 0.02~0.44 dB. It can be easily applied to most conventional fast algorithms, so it is useful to design realtime encoder chips.

• Journal of Digital Convergence
• /
• v.15 no.12
• /
• pp.333-340
• /
• 2017

Since realtime search words are centered on the fact that the search growth rate of an issue is rapidly increasing in a short period of time, it is not possible to express an issue that maintains interest for a certain period of time. In order to overcome these limitations, this paper evaluates the daily and hourly persistence of the realtime words that belong to the top 10 for a certain period of time and extracts the search word that are constantly interested. Then, we present the method of using the time series analysis and the neural network to know how the interest of the upper search word changes, and show the result of forecasting the near future change through the actual example derived through the method. It can be seen that forecasting through time series analysis by date and artificial neural networks learning by time shows good results.

• The Journal of Society for e-Business Studies
• /
• v.16 no.3
• /
• pp.249-261
• /
• 2011

The rapid growth of e-business market makes new online companies to start and existing offline companies to join in this area. As the number of players of this market grows rapidly, the competition among them is very intense. Many companies invest huge resources to online marketing including search advertisement, email advertisement and banner advertisement. Because these traditional online marketing activities mainly focus on how to invite visitors to their web sites, ROI of these marketing activities are getting lower. Many companies are looking for a new marketing method to escape this situation. In this paper, we propose ROMS (Realtime Online Marketing System) which supports tools to improve conversion ratio of e-commerce sites, ROMS gathers behavioral data of visitors and analyzes it in realtime. ROMS supports live chats, visitor profiling, context analysis, event detection, and live marketing. With ROMS, personalized offers based on visitors' realtime context can be made for each visitor.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2002.11a
• /
• pp.163-170
• /
• 2002

Terrain surfaces have to be modeled in very detail and wheel-surface contacting geometry must be well defined in order to obtain proper ground-reaction and friction forces for realistic simulation of off-road vehicles. Delaunay triangulation is one of the most widely used methods in modeling 3-dimensional terrain surfaces, and T-search is a relevant algorithm for searching resulting triangular polygons. The T-search method searches polygons in successive order and may not allow real-time computation of off-road vehicle dynamics if the terrain is modeled with many polygons, depending on the computer performance used in the simulation. In order to accelerate the searching speed of T-search, a terrain database of triangular polygons is modeled in multi-levels by adopting the LOD (Level of Detail) method used in realtime computer graphics. Simulation results show that the new LOD search is effective in shortening the required computing time. The LOD search can be even further accelerated by introducing an NN (Neural Network) algorithm, in the cases where a appropriate range of moving paths can be predicted by cultual information of the simulated terrain, such as lakes, houses, etc.. Numerical tests show that LOD-NN search almost double the speed of the original T-search.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2008.05a
• /
• pp.1428-1432
• /
• 2008

상수관망이 노후화됨에 따라 파괴나 누수와 같은 운영상의 문제가 빈번하게 발생한다. 따라서 상수관망의 상태를 보다 정확히 파악하여 운영할 경우 안정적인 상수관망의 운영이 가능할 것이며 관파괴와 같은 돌발적인 사태의 피해를 최소화 할 수 있을 것이다. 그러나 상수관망의 실시간 모니터링 센서중 대표적인 online 압력계를 모든 지점에 설치할 경우 과다한 초기투자 비용이 소요되며 시스템의 유지관리 측면에서도 적절하지 않다. 따라서 본 연구에서는 상수관망의 실시간 모니터링을 위한 적정한 규모의 online 압력계 설치위치의 결정 방법을 제안하였다. 제안된 방법은 영향행렬지수(Effect Index Matrix)를 기반으로 하며 영향행렬지수내 column search를 수행하여 online 압력계의 위치를 선정한다. 제안된 방법을 미국의 Cherry Hill 상수관망에 적용하여 적용성을 검증하였다.

• The Journal of the Convergence on Culture Technology
• /
• v.4 no.4
• /
• pp.337-341
• /
• 2018

As the online media continues to evolve and the mobile computing environment has improved dramatically, the distribution of Internet information has rapidly changed from one-sided to consumer-oriented. Therefore, measuring the interest of Internet information has become an important issue for suppliers and consumers. In this paper, we analyze the Internet information interest by analyzing the duration of real - time query by collecting data for one month by implementing real - time search word provided by domestic Internet information provider.

• The Journal of the Korea Contents Association
• /
• v.19 no.2
• /
• pp.460-468
• /
• 2019

Recently, analysis techniques to extract new meanings using big data analysis and various services using these analysis techniques have been developed. Among them, the transport is one of the most important areas that can be utilized about big data. However, the existing traffic route guidance system can not recommend the optimal traffic route because they use only the traffic information when the user search the route. In this paper, we propose a realtime optimal traffic route guidance system using big data analysis. The proposed system considers the realtime traffic information and results of big data analysis using historical traffic data. And, the proposed system show the warning message to the user when the user need to change the traffic route.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.6
• /
• pp.49-55
• /
• 2017

Robots, games and life applications have been developed while computer areas are developed. Moreover, various applications have been utilized for various users including the early childhood. Recently, smart phones have been dramatically used by various users including early childhood. Many applications need to find a path from a starting point to destinations. For example, without using real maps, users can find the direct paths for the destinations in realtime. Specifically, path exploration in game programs is so important to have accurate results. Nowadays, with these techniques, diverse applications for educations of early childhood have been developed. To deal with the functions, necessity of efficient path search programs with high accuracy becomes much higher. In this paper, we design and develop a friendly maze program for early childhood based on a path searching algorithm. Basically, the path of lineal distance from a starting location to destination is considered. Moreover, weight values are calculated by considering heuristic weighted h(x). In our approach, A* algorithm searches the path considering weight values. Moreover, we utilize depth first search approach instead of breadth first search in order to reduce the search space. so it is proper to use A* algorithm in finding efficient paths although it is not optimized paths.