• Title/Summary/Keyword: decomposition time

Search Result 1,519, Processing Time 0.028 seconds

2D Finite Difference Time Domain Method Using the Domain Decomposition Method (영역분할법을 이용한 2차원 유한차분 시간영역법 해석)

  • Hong, Ic-Pyo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.5
    • /
    • pp.1049-1054
    • /
    • 2013
  • In this paper, two-dimensional(2-D) Finite Difference Time Domain(FDTD) method using the domain decomposition method is proposed. We calculated the electromagnetic scattering field of a two dimensional rectangular Perfect Electric Conductor(PEC) structure using the 2-D FDTD method with Schur complement method as a domain decomposition method. Four domain decomposition and eight domain decomposition are applied for the analysis of the proposed structure. To validate the simulation results, the general 2-D FDTD algorithm for the total domain are applied to the same structure and the results show good agreement with the 2-D FDTD using the domain decomposition method.

Analysis on Decomposition Models of Univariate Hydrologic Time Series for Multi-Scale Approach

  • Kwon, Hyun-Han;Moon, Young-Il;Shin, Dong-Jun
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2006.05a
    • /
    • pp.1450-1454
    • /
    • 2006
  • Empirical mode decomposition (EMD) is applied to analyze time series characterized with nonlinearity and nonstationarity. This decomposition could be utilized to construct finite and small number intrinsic mode functions (IMF) that describe complicated time series, while admitting the Hilbert transformation properties. EMD has the capability of being adaptive, capture local characteristics, and applicable to nonlinear and nonstationary processes. Unlike discrete wavelet transform (DWT), IMF eliminates spurious harmonics and retains meaningful instantaneous frequencies. Examples based on data representing natural phenomena are given to demonstrate highlight the power of this method in contrast and comparison of other ones. A presentation of the energy-frequency-time distribution of these signals found to be more informative and intuitive when based on Hilbert transformation.

  • PDF

A Note on the Decomposition Property for $M^{X}$/G/1 Queues with Generalized Vacations (일반휴가형 $M^{X}$/G/1 대기행렬의 분해속성에 대한 소고)

  • Chae, Kyung-Chul;Choi, Dae-Won;Lee, Ho-Woo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.28 no.3
    • /
    • pp.247-255
    • /
    • 2002
  • The objective of this paper is to clarify the decomposition property for $M^{X}$/G/1 queues with generalized vacations so that the decomposition property is better understood and becomes more applicable. As an example model, we use the $M^{X}$/G/1 queue with setup time. For this queue, we correct Choudhry's (2000) steady-state queue size PGF and derive the steady-state waiting time LST. We also present a meaningful interpretation for the decomposed steady-state waiting time LST.

Optimal Decomposition of Convex Structuring Elements on a Hexagonal Grid

  • Ohn, Syng-Yup
    • The Journal of the Acoustical Society of Korea
    • /
    • v.18 no.3E
    • /
    • pp.37-43
    • /
    • 1999
  • In this paper, we present a new technique for the optimal local decomposition of convex structuring elements on a hexagonal grid, which are used as templates for morphological image processing. Each basis structuring element in a local decomposition is a local convex structuring element, which can be contained in hexagonal window centered at the origin. Generally, local decomposition of a structuring element results in great savings in the processing time for computing morphological operations. First, we define a convex structuring element on a hexagonal grid and formulate the necessary and sufficient conditions to decompose a convex structuring element into the set of basis convex structuring elements. Further, a cost function was defined to represent the amount of computation or execution time required for performing dilations on different computing environments and by different implementation methods. Then the decomposition condition and the cost function are applied to find the optimal local decomposition of convex structuring elements, which guarantees the minimal amount of computation for morphological operation. Simulation shows that optimal local decomposition results in great reduction in the amount of computation for morphological operations. Our technique is general and flexible since different cost functions could be used to achieve optimal local decomposition for different computing environments and implementation methods.

  • PDF

Realization of Variable Bandwidth Filter for Decomposition of Speech Signals into AM-FM Components (음성신호의 AM-FM 성분 분리를 위한 가변대역폭 필터 구현)

  • 이희영;김용태
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.2208-2211
    • /
    • 2003
  • In this paper, a variable bandwidth filter(VBF) is realized with the purpose of the decomposition of speech signals with time-varying instantaneous of frequencies. The proposed VBF can extract AM-FM components of a speech signal whose time-frequency representations(TFRs) are not overlapped in time-frequency domain

  • PDF

Forecasting Baltic Dry Index by Implementing Time-Series Decomposition and Data Augmentation Techniques (시계열 분해 및 데이터 증강 기법 활용 건화물운임지수 예측)

  • Han, Min Soo;Yu, Song Jin
    • Journal of Korean Society for Quality Management
    • /
    • v.50 no.4
    • /
    • pp.701-716
    • /
    • 2022
  • Purpose: This study aims to predict the dry cargo transportation market economy. The subject of this study is the BDI (Baltic Dry Index) time-series, an index representing the dry cargo transport market. Methods: In order to increase the accuracy of the BDI time-series, we have pre-processed the original time-series via time-series decomposition and data augmentation techniques and have used them for ANN learning. The ANN algorithms used are Multi-Layer Perceptron (MLP), Recurrent Neural Network (RNN), and Long Short-Term Memory (LSTM) to compare and analyze the case of learning and predicting by applying time-series decomposition and data augmentation techniques. The forecast period aims to make short-term predictions at the time of t+1. The period to be studied is from '22. 01. 07 to '22. 08. 26. Results: Only for the case of the MAPE (Mean Absolute Percentage Error) indicator, all ANN models used in the research has resulted in higher accuracy (1.422% on average) in multivariate prediction. Although it is not a remarkable improvement in prediction accuracy compared to uni-variate prediction results, it can be said that the improvement in ANN prediction performance has been achieved by utilizing time-series decomposition and data augmentation techniques that were significant and targeted throughout this study. Conclusion: Nevertheless, due to the nature of ANN, additional performance improvements can be expected according to the adjustment of the hyper-parameter. Therefore, it is necessary to try various applications of multiple learning algorithms and ANN optimization techniques. Such an approach would help solve problems with a small number of available data, such as the rapidly changing business environment or the current shipping market.

Review of Data-Driven Multivariate and Multiscale Methods

  • Park, Cheolsoo
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.2
    • /
    • pp.89-96
    • /
    • 2015
  • In this paper, time-frequency analysis algorithms, empirical mode decomposition and local mean decomposition, are reviewed and their applications to nonlinear and nonstationary real-world data are discussed. In addition, their generic extensions to complex domain are addressed for the analysis of multichannel data. Simulations of these algorithms on synthetic data illustrate the fundamental structure of the algorithms and how they are designed for the analysis of nonlinear and nonstationary data. Applications of the complex version of the algorithms to the synthetic data also demonstrate the benefit of the algorithms for the accurate frequency decomposition of multichannel data.

Robust Singular Value Decomposition BaLsed on Weighted Least Absolute Deviation Regression

  • Jung, Kang-Mo
    • Communications for Statistical Applications and Methods
    • /
    • v.17 no.6
    • /
    • pp.803-810
    • /
    • 2010
  • The singular value decomposition of a rectangular matrix is a basic tool to understand the structure of the data and particularly the relationship between row and column factors. However, conventional singular value decomposition used the least squares method and is not robust to outliers. We propose a simple robust singular value decomposition algorithm based on the weighted least absolute deviation which is not sensitive to leverage points. Its implementation is easy and the computation time is reasonably low. Numerical results give the data structure and the outlying information.

Complexity Estimation Based Work Load Balancing for a Parallel Lidar Waveform Decomposition Algorithm

  • Jung, Jin-Ha;Crawford, Melba M.;Lee, Sang-Hoon
    • Korean Journal of Remote Sensing
    • /
    • v.25 no.6
    • /
    • pp.547-557
    • /
    • 2009
  • LIDAR (LIght Detection And Ranging) is an active remote sensing technology which provides 3D coordinates of the Earth's surface by performing range measurements from the sensor. Early small footprint LIDAR systems recorded multiple discrete returns from the back-scattered energy. Recent advances in LIDAR hardware now make it possible to record full digital waveforms of the returned energy. LIDAR waveform decomposition involves separating the return waveform into a mixture of components which are then used to characterize the original data. The most common statistical mixture model used for this process is the Gaussian mixture. Waveform decomposition plays an important role in LIDAR waveform processing, since the resulting components are expected to represent reflection surfaces within waveform footprints. Hence the decomposition results ultimately affect the interpretation of LIDAR waveform data. Computational requirements in the waveform decomposition process result from two factors; (1) estimation of the number of components in a mixture and the resulting parameter estimates, which are inter-related and cannot be solved separately, and (2) parameter optimization does not have a closed form solution, and thus needs to be solved iteratively. The current state-of-the-art airborne LIDAR system acquires more than 50,000 waveforms per second, so decomposing the enormous number of waveforms is challenging using traditional single processor architecture. To tackle this issue, four parallel LIDAR waveform decomposition algorithms with different work load balancing schemes - (1) no weighting, (2) a decomposition results-based linear weighting, (3) a decomposition results-based squared weighting, and (4) a decomposition time-based linear weighting - were developed and tested with varying number of processors (8-256). The results were compared in terms of efficiency. Overall, the decomposition time-based linear weighting work load balancing approach yielded the best performance among four approaches.

Anti-Oxidation Property of Organo-Molybdenum Dialkyldithiophosphate (유용성 몰리부덴 화합물의 산화방지기능에 관한 연구)

  • 김영환;전광식
    • Tribology and Lubricants
    • /
    • v.18 no.6
    • /
    • pp.396-401
    • /
    • 2002
  • ln this paper, the fuction of molybdenum dialkyl dithiophosphate (MoDTP) as an oxidation inhibitor of mineral oils was investigated and compared with 2,6-Di-tert-Butyl-4-Methylphenol (DBMP). Oxidation tests were conducted using an oxygen absorption apparatus. MoDTP showed anti-oxidation property, and length of induction time prolonged by increasing MoDTP concentration. However the induction time of DBMP was longer than those of MoDTP. The anti-oxidation property of MoDTP was found to be inferior to that of DBMP The capability of hydroperoxide decomposition ability with MoDTP was much greater than that with DBMP. However the rate constant of radical scavenging with MoDTP was much better than that with DBMP. It was found that the performance of MoDTP is exellent with respect to hydroperoxide decomposition but it is susceptible to chemical decomposition. From the fact that formation of phenol was observed when MoDTP was added to hexane solution of cumene hydroperoxide (CHPO), it is indicated that the decomposition of hydroperoxide with MoDTP occurs by means of ionic mechanism.