• Journal of the Korea Society of Computer and Information
• /
• v.8 no.2
• /
• pp.8-15
• /
• 2003

Recently various of information suppliers provide information via WWW so the necessary of search engine grows larger. However the efficiency of most search engines is low comparatively because of using simple pattern match technique between user's query and web document. A specialized search engine returns the specialized information depend on each user's search goal. It is trend to develop specialized search engines in many countries. However, most such engines don't satisfy the user's needs. This paper proposes the specialized search engine for ocean information that uses user's query related with ocean and the association rules in web data mining can prove relation between web documents. So this search engine improved the recall of data and the precision in existent search method.

• Journal of Information Technology Applications and Management
• /
• v.26 no.1
• /
• pp.65-75
• /
• 2019

As the use of semantic web based on XML increases in the field of data management, a lot of studies to extract useful information from the data stored in ontology have been tried based on association rule mining. Ontology data is advantageous in that data can be freely expressed because it has a flexible and scalable structure unlike a conventional database having a predefined structure. On the contrary, it is difficult to find frequent patterns in a uniformized analysis method. The goal of this study is to provide a basis for extracting useful knowledge from ontology by searching for frequently occurring subgraph patterns by applying transaction-based graph mining techniques to ontology schema graph data and instance graph data constituting ontology. In order to overcome the structural limitations of the existing ontology mining, the frequent pattern search methodology in this study uses the methodology used in graph mining to apply the frequent pattern in the graph data structure to the ontology by applying iterative node chunking method. Our suggested methodology will play an important role in knowledge extraction.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.4
• /
• pp.299-302
• /
• 2002

Error detection and correction using CRC and the general class of cyclic codes is an important part of designing reliable data transmission schemes. The decoding method for cyclic codes using covering patterns is easily-implementable, and its complexity de-pends on the number of covering patterns employed. Determination of the minimal set of covering patterns for a given code is an open problem. In this paper, an efficient search method for constructing minimal sets of covering patterns is proposed and compared with several existing search methods. The result is applicable to various codes of practical interest.

• Journal of Korea Game Society
• /
• v.20 no.6
• /
• pp.43-52
• /
• 2020

This paper presents a fast pattern tracking method using location prediction in cubemap video for 360-degree VR. A spherical cubemap frame has six face textures and searching a pattern is much slower than a flat image. To overcome the limitation, we propose a method of predicting the location of target pattern using Kalman filter and reducing the search area by considering only textures of predicted location. The experimental results showed that the proposed system is much faster than the previous method of searching all six faces and also gives accurate pattern tracking performance.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.10
• /
• pp.251-258
• /
• 2009

Data mining is a method that extract useful knowledges from huge size of data. Recently, a focussing research part of data mining is to find interesting patterns in graph databases. More efficient methods have been proposed in graph mining. However, graph analysis methods are in NP-hard problem. Graph pattern mining based on pattern growth method is to find complete set of patterns satisfying certain property through extending graph pattern edge by edge with avoiding generation of duplicated patterns. This paper suggests an efficient approach of reducing computing time of pattern growth method through pattern growth's property that similar patterns cause similar tasks. we suggest pruning methods which reduce search space. Based on extensive performance study, we discuss the results and the future works.

• Smart Structures and Systems
• /
• v.26 no.3
• /
• pp.291-309
• /
• 2020

To study oceanic and meteorological problems related to climate change, Korea has been operating several ocean research stations (ORSs). In 2011, the Gageocho ORS was attacked by Typhoon Muifa, and its structural members and several observation devices were severely damaged. After this event, the Gageocho ORS was rehabilitated with 5 m height to account for 100-yr extreme wave height, and the vibration measurement system was equipped to monitor the structural vibrational characteristics including natural frequencies and modal damping ratios. In this study, a mass reallocation method is presented for structural model updating of the Gageocho ORS based on the experimentally identified natural frequencies. A preliminary finite element (FE) model was constructed based on design drawings, and several of the candidate baseline FE models were manually built, taking into account the different structural conditions such as corroded thickness. Among these candidate baseline FE models, the most reasonable baseline FE model was selected by comparing the differences between the identified and calculated natural frequencies; the most suitable baseline FE model was updated based on the identified modal properties, and by using the pattern search method, which is one of direct search optimization methods. The mass reallocation method is newly proposed as a means to determine the equivalent mass quantities along the height and in a floor. It was found that the natural frequencies calculated based on the updated FE model was very close to the identified natural frequencies. In conclusion, it is expected that these results, which were obtained by updating a baseline FE model, can be useful for establishing the reference database for jacket-type offshore structures, and assessing the structural integrity of the Gageocho ORS.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.3
• /
• pp.1458-1464
• /
• 2011

This study is on the application of TOPMODEL-topographic based hydrologic model-to the runoff analysis, The test area was the ssang-chi watershed which is mountainous catchment located in the upstream of the sumjin-gang basin and the watershed area is $126.7km^2$. The six's hourly runoff and precipitation data was selected in the 2006 ~ 2009 year. And the model parameters are calibrated using observed runoff data by Pattern Search method. The topographic index of the ssang-chi catchment was produced by digital elevation model(DEM) of 100m grid. As a results of the analysis, the parameters of model, a decay facter(m), transmissivity(T0), and the unsaturated zone delay(TD) are sensible to hydrologic response, and the simulated runoff data are in good agreement with observed runoff data.

• Journal of Wetlands Research
• /
• v.19 no.4
• /
• pp.423-432
• /
• 2017

This study used SSARR model to predict the flood hydrograph for the Miho stream in the Geum river basin. First, we performed the sensitivity analysis on the parameters of SSARR model to know the characteristics of the parameters and set the range. For the parameter calibration, optimization methods such as genetic algorithm, pattern search and SCE-UA were used. WSSR and SSR were applied as objective functions, and the results of optimization method and objective function were compared and analyzed. As a result of this study, flood prediction was most accurate when using pattern search as an optimization method and WSSR as an objective function. If the parameters are optimized based on the results of this study, it can be helpful for decision making such as flood prediction and flood warning.

• Journal of Broadcast Engineering
• /
• v.5 no.2
• /
• pp.247-259
• /
• 2000

This paper introduces a new technique that reduces the search times and Improves the accuracy of motion estimation using high temporal and spatial correlation of motion vector. Instead of using the fixed first search Point of previously proposed search algorithms, the proposed method finds more accurate first search point as to compensating searching area using high temporal and spatial correlation of motion vector. Therefore, the main idea of proposed method is to find first search point to improve the performance of motion estimation and reduce the search times. The proposed method utilizes the direction of the same coordinate block of the previous frame compared with a block of the current frame to use temporal correlation and the direction of the adjacent blocks of the current frame to use spatial correlation. Based on these directions, we compute the first search point. We search the motion vector in the middle of computed first search point with two fixed search patterns. Using that idea, an efficient adaptive predicted direction search algorithm (APDSA) for block matching motion estimation is proposed. In the experimental results show that the PSNR values are improved up to the 3.6dB as depend on the Image sequences and advanced about 1.7dB on an average. The results of the comparison show that the performance of the proposed APDSA algorithm is better than those of other fast search algorithms whether the image sequence contains fast or slow motion, and is similar to the performance of the FS (Full Search) algorithm. Simulation results also show that the performance of the APDSA scheme gives better subjective picture quality than the other fast search algorithms and is closer to that of the FS algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.5
• /
• pp.892-898
• /
• 2012

Rough classification methods are used to improving the recognition speed in many character recognition problems. In this case, some irreversible result can occur by an error in rough classification. Methods for duplicating each model in several classes are used in order to reduce this risk. But the errors by rough classfication can not be completely ruled out by these methods. In this paper, an recognition method is proposed to increase speed that matches models selectively without any increase in error. This method constructs a model graph using similarity between models. Then a search process begins from a particular point in the model graph. In this process, matching of unnecessary models are reduced that are not similar to the input pattern. In this paper, the proposed method is applied to the recognition problem of handwriting numbers and upper/lower cases of English alphabets. In the experiments, the proposed method was compared with the basic method that matches all models with input pattern. As a result, the same recognition rate, which has shown as the basic method, was obtained by controlling the out-degree of the model graph and the number of maintaining candidates during the search process thereby being increased the recognition speed to 2.45 times.