• Proceedings of the KSME Conference
• /
• 2004.11a
• /
• pp.474-479
• /
• 2004

According to our previous study, it is confirmed that the Petrov-Galerkin natural element method (PGNEM) completely resolves the numerical integration inaccuracy in the conventional Bubnov-Galerkin natural element method (BG-NEM). This paper is an extension of PG-NEM to two-dimensional nonlinear dynamic problem. For the analysis, a constant average acceleration method and a linearized total Lagrangian formulation is introduced with the PG-NEM. At every time step, the grid points are updated and the shape functions are reproduced from the relocated nodal distribution. This process enables the PG-NEM to provide more accurate and robust approximations. The representative numerical experiments performed by the test Fortran program, and the numerical results confirmed that the PG-NEM effectively and accurately approximates the nonlinear dynamic problem.

• Journal of Korean Society of Water and Wastewater
• /
• v.19 no.5
• /
• pp.619-624
• /
• 2005

This work is for examining a simplified equation based on the rational formula, which can easily decide storm-water detention volume in small urban catchments. The storm-water detention volume is determined by the inflow hydrograph flowing to detention basin and the outflow hydrograph discharged from the detention basin. The ratio of average outflow over the period of rainfall duration against allowable discharge was 0.5 in former simplified equation. But this research has found that the average outflow ratio depends on the storage methodology. In the case of the on-line storage method, the average outflow ratio is a function of the time of concentration of the catchments and rainfall duration, which ranged from 0.5~1.0. In the case of the off-line storage method, the average ratio is a function of peak discharge and allowable discharge except above time of concentration and rainfall duration, where its function value ranged from 1.0~2.0. When applying this equation to small catchment in Mokpo city, South Korea, we could easily calculate the relation curve between the storm-water detention volume and allowable discharge.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.2
• /
• pp.183-189
• /
• 1987

The performance of frame synchronization can be represented by the values of three characteristic variables-average misframe interval, average syncloss detection time, average reframe time. In this paper, we have analyzed the performance of frame synchronization of the standardized 90Mb/s optical transmission system by Markov chain method, with the suggestion of an extended algorithm for performance improvement. Maximum average reframe time of 1.18 ms can be obtained by the suggested algorithm, which is compared with that of 2.28 ms for the existing algorithm.

• Journal of the Korean Society for information Management
• /
• v.36 no.4
• /
• pp.83-105
• /
• 2019

This study aims to suggest an effective method for the automatic classification of keywords with similar patterns by calculating pattern similarity of temporal data. For this, large scale news on the Web were collected and time series data composed of 120 time segments were built. To make training data set for the performance test of the proposed model, 440 representative keywords were manually classified according to 8 types of trend. This study introduces a Dynamic Time Warping(DTW) method which have been commonly used in the field of time series analytics, and proposes an application model, MA-DTW based on a Moving Average(MA) method which gives a good explanation on a tendency of trend curve. As a result of the automatic classification by a k-Nearest Neighbor(kNN) algorithm, Euclidean Distance(ED) and DTW showed 48.2% and 66.6% of maximum micro-averaged F1 score respectively, whereas the proposed model represented 74.3% of the best micro-averaged F1 score. In all respect of the comprehensive experiments, the suggested model outperformed the methods of ED and DTW.

• Journal of information and communication convergence engineering
• /
• v.20 no.2
• /
• pp.125-130
• /
• 2022

In modern society, as many data are used for research or commercial purposes, the value of data is gradually increasing. In related fields, research is being actively conducted to collect valuable data, but it is difficult to collect proper data because the value of collection is determined according to the performance of existing sensors. To solve this problem, a method to effectively reduce noise has been proposed, but there is a point in which performance is degraded due to damage caused by noise. In this paper, a device capable of collecting time series data was designed to correct such data noise, and a correction technique was performed by giving an error value based on the representatively collected ultrafine dust data, and then comparing before and after Compare performance. For the correction method, Kalman, LPF, Savitzky-Golay, and Moving Average filter were used. Savitzky-Golay filter and Moving Average Filter showed excellent correction rate as an experiment. Through this, the performance of the sensor can be supplemented and it is expected that data can be effectively collected.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.2052-2067
• /
• 2011

Complementary trees are two spanning trees rooted at the sink node satisfying that any source node's two paths to the sink node on the two trees are node-disjoint. Complementary trees routing strategy is a special node-disjoint multi-path routing approach. Several complementary trees routing algorithms have been proposed, in which path discovery methods based on depth first search (DFS) or Dijkstra's algorithm are used to find a path for augmentation in each round of path augmentation step. In this paper, a novel path discovery method based on multi-tree-growing (MTG) is presented for the first time to our knowledge. Based on this path discovery method, a complementary trees routing algorithm is developed with objectives of low average path length on both spanning trees and low complexity. Measures are employed in our complementary trees routing algorithm to add a path with nodes near to the sink node in each round of path augmentation step. The simulation results demonstrate that our complementary trees routing algorithm can achieve low average path length on both spanning trees with low running time, suitable for wireless sensor networks in industrial scenarios.

• Journal of information and communication convergence engineering
• /
• v.5 no.1
• /
• pp.54-58
• /
• 2007

A real-time frame-layer rate control algorithm with a token bucket traffic shaper is proposed for distortion variation minimization. The proposed rate control method uses a non-iterative optimization method for low computational complexity, and performs bit allocation at the frame level to minimize the average distortion over an entire sequence as well as variations in distortion between frames. The proposed algorithm does not produce time delay from encoding, and is suitable for real-time low-complexity video encoder. Experimental results indicate that the proposed control method provides better visual and PSNR performances than the existing rate control method.

• Journal of Environmental Science International
• /
• v.33 no.2
• /
• pp.179-185
• /
• 2024

This study aimed to evaluate the differences in canine preferences for pet food terrine according to the processing method. As companion dogs, three male Spitz canines (average age 12 years, average weight 7 kg) and three male Spitz mix canines (average age 12 years, average weight 5 kg) were used in Experiment 1, whereas five male (average age 10 years, average weight 9 kg) and five female Shetland Sheepdogs (Sheltie, average age 10 years, average weight 8 kg) were used in Experiment 2, to evaluate their preferences and intake types. In both experiments, all dog categories mostly preferred 'meat' when it came to their first choice of food consumed, followed by 'vegetables', 'mixed eating', and 'vegetable leftover' last. This confirms means that canines are carnivores, and over time, choosing 'vegetables' or 'vegetable leftovers' as a secondary or alternate food source can be considered a natural process. When provided various terrines, canines in both experiments first ingested 'cooked' rather than 'freeze-dried' duck, chicken, beef, and pork terrines when selecting food at the start of feeding. For both experiments, most of the intake types using duck, chicken, beef, and pork terrine showed a preference for 'after consuming cooked terrine first and then intake freeze-dried' item. In conclusion, the reason for preferring cooked terrine can be attributed to the difference in the preparation cooking method of freeze-dried cooked terrine.

• Journal of KIISE:Databases
• /
• v.36 no.4
• /
• pp.327-340
• /
• 2009

To achieve the noise reduction effect in boundary image matching, we use the moving average transform of time-series matching. Our motivation is based on an intuition that using the moving average transform we may exploit the noise reduction effect in boundary image matching as in time-series matching. To confirm this simple intuition, we first propose $\kappa$-order image matching, which applies the moving average transform to boundary image matching. A boundary image can be represented as a sequence in the time-series domain, and our $\kappa$-order image matching identifies similar images in this time-series domain by comparing the $\kappa$-moving average transformed sequences. Next, we propose an index-based matching method that efficiently performs $\kappa$-order image matching on a large volume of image databases, and formally prove the correctness of the index-based method. Moreover, we formally analyze the relationship between an order $\kappa$ and its matching result, and present a systematic way of controlling the noise reduction effect by changing the order $\kappa$. Experimental results show that our $\kappa$-order image matching exploits the noise reduction effect, and our index-based matching method outperforms the sequential scan by one or two orders of magnitude.

• Speech Sciences
• /
• v.8 no.3
• /
• pp.133-142
• /
• 2001

In the area of speech processing, raw signals used to be presented in 2D format and different kinds of algorithms use the format to solve their problems. However, such kinds of presentation methods have limitations to extract characteristics from the signal, even though the algorithms are quiet good. The basic reason is that not much information can be detected from the 2D signal. Strange attractor in the field of chaos theory provides the 3D presentation method. In the area of the recognition problem, signal construction method is very important because good features can be detected from a good shape of attractors. This paper discusses a new presentation method that can be used to construct strange attractor in a different way. Normal strange attractor uses time-delay idea while the new method uses time-delay and vector average. This method provides us good information to be applied to speaker recognition problem.