• Interaction and multiscale mechanics
• /
• 제3권2호
• /
• pp.123-143
• /
• 2010

The essential idea of the element-free Galerkin method (EFG) is that moving least-squares (MLS) approximation are used for the trial and test functions with the variational principle (weak form). By using the weighted orthogonal basis function to construct the MLS interpolants, we derive the formulae for an improved element-free Galerkin (IEFG) method for solving three-dimensional problems in linear elasticity. There are fewer coefficients in improved moving least-squares (IMLS) approximation than in MLS approximation. Also fewer nodes are selected in the entire domain with the IEFG method than is the case with the conventional EFG method. In this paper, we selected a few example problems to demonstrate the applicability of the method.

• ETRI Journal
• /
• 제42권6호
• /
• pp.815-826
• /
• 2020

We propose a two-dimensional (2D) scattering-center-extraction (SCE) method using sparse recovery based on the compressive-sensing theory, even with data missing from the received radar cross-section (RCS) dataset. First, using the proposed method, we generate a 2D grid via adaptive discretization that has a considerably smaller size than a fully sampled fine grid. Subsequently, the coarse estimation of 2D scattering centers is performed using both the method of iteratively reweighted least square and a general peak-finding algorithm. Finally, the fine estimation of 2D scattering centers is performed using the orthogonal matching pursuit (OMP) procedure from an adaptively sampled Fourier dictionary. The measured RCS data, as well as simulation data using the point-scatterer model, are used to evaluate the 2D SCE accuracy of the proposed method. The results indicate that the proposed method can achieve higher SCE accuracy for an incomplete RCS dataset with missing data than that achieved by the conventional OMP, basis pursuit, smoothed L0, and existing discrete spectral estimation techniques.

• 한국정보전자통신기술학회논문지
• /
• 제7권4호
• /
• pp.205-211
• /
• 2014

This paper addresses the framework of object-oriented image coding, describing a new algorithm, based on monodimensional Legendre polynomials, for texture approximation. Through the use of 1D orthogonal basis functions, the computational complexity which usually makes prohibitive most of 2D region-oriented approaches is significantly reduced, while only a slight increment of distortion is introduced. In the aim of preserving the bidimensional intersample correlation of the texture information as much as possible, suitable pseudo-bidimensional basis functions have been used, yielding significant improvements with respect to the straightforward 1D approach. The algorithm has been experimented for coding still images as well as motion compensated sequences, showing interesting possibilities of application for very low bitrate video coding.

• 한국항공우주학회지
• /
• 제38권5호
• /
• pp.414-420
• /
• 2010

본 연구에서는 천음속 날개/동체 모텔에 대한 축소모델 (Reduced Order Model; ROM)의 정확성을 검증하고, Proper Orthogonal Decomposition(POD)을 이용한 최적설계를 통해 그 효율성을 검토하였다. full order 공력해석을 통한 Snapshot을 추출하기 위해 삼차원 오일러 방정식을 이용하였으며, 이들 Snapshot들을 통해 날개/동체 모델 주위 유동장의 거동을 모사하는 POD의 기저벡터를 계산 하였다. 이러한 과정을 거쳐 구축된 축소모텔은 6개의 Case들로 검증하였으며, 그 결과 ROM을 이용해 관심영역에 대한 유동장의 예측을 할 수 있다는 것을 확인하였다. 그리고 ROM을 통한 날개/동체 모델의 최적설계를 수행 하였으며, 그 결과는 반응면모델 (Response Surface Model; RSM)을 이용한 최적설계 결과와 비교 하였다. 이를 통해 ROM을 바탕으로한 최적설계가 RSM을 이용한 것보다 효율적임을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권8호
• /
• pp.3529-3550
• /
• 2016

In heterogeneous networks (HetNets), energy saving is vital for a sustainable network development. Many techniques, such as spectrum allocation, network planning, etc., are used to improve the network energy efficiency (EE). In this paper, micro BSs utilizing cell range expansion (CRE) and spectrum allocation are considered in multi-channel heterogeneous networks to improve EE. Hotspot region is assumed to be covered by micro BSs which can ensure that the hotspot capacity is greater than the average demand of hotspot users. The expressions of network energy efficiency are derived under shared, orthogonal and hybrid subchannel allocation schemes, respectively. Particle swarm optimization (PSO) algorithm is used to solve the optimal ratio of subchannel allocation in orthogonal and hybrid schemes. Based on the results of the optimal analysis, we propose three service control strategies on the basis of large-scale user behaviors, i.e., adjust micro cell rang expansion (AmCRE), adjust micro BSs density (AmBD) and adjust micro BSs transmit power (AmBTP). Both theoretical and simulation results show that using shared subchannel allocation scheme in AmBD strategies can obtain maximal EE with a very small area ratio. Using orthogonal subchannel allocation scheme in AmCRE strategies can obtain maximal EE when area ratio is larger. Using hybrid subchannel allocation scheme in AmCRE strategies can obtain maximal EE when area ratio is large enough. No matter which service control strategy is used, orthogonal spectrum scheme can obtain the maximal hotspot user rates.

• ETRI Journal
• /
• 제29권3호
• /
• pp.402-404
• /
• 2007

One of the major disadvantages of the orthogonal frequency division multiplexing system is high peak-to-average power ratio (PAPR). Selected mapping (SLM) is an efficient distortionless PAPR reduction scheme which selects the minimum PAPR sequence from a group of independent phase rotated sequences. However, the SLM requires explicit side information and a large number of IFFT operations. In this letter we investigate a novel PAPR reduction method based on the radial basis function network and SLM.

• 전자공학회논문지B
• /
• 제31B권7호
• /
• pp.58-65
• /
• 1994

A recursive on-line algorithm for orthogonal ARMA identification is proposed for linear MIMO systems with unknown parameters time delay and order. This algorithm is based on the Gram-Schmidt orthogonalization of basis functions, and extended to a recursiveform by using new functions of two dimensional autocorrelations and crosscorrelations of inputs and outputs. This proposed algorithm can also cope with slowly time-varying or order-varying systems. Various simulations reveal the performance of the algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.58-63
• /
• 1993

A recursive on-line algorithm with orthogonal ARMA identification is proposed for linear MIMO systems with unknown parameters, time delay, and order. This algorithm is based on the Gram-Schmidt orthogonalization of basis functions, and extended to a recursive form by using new functions of two dimensional autocorrelations and cross-correlations of inputs and outputs. The proposed algorithm can also cope with slowly time-varying or order-varying systems. Various simulations reveal the performance of the algorithm.

• 전자공학회논문지B
• /
• 제31B권4호
• /
• pp.48-54
• /
• 1994

A recursive on-line algorithm with orthogonal ARMA identification is proposed for linear systems with unkonwn time delay, order, and parameters. The algorithm is based on the Gram-Schmidt orthogonalization of basis functions, and extendedto recursive form by using two dimensional autocorrelations and crosscorrelations of input and output with constant data length. The proposed algorith can cope with slowly time-varying or order-varying delayed system. Various simulations reveal the performance of the algorithm.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제1권1호
• /
• pp.1-34
• /
• 1997

In this study, various available meshless methods are briefly reviewed and the connection among them is investigated. The objective of meshless methods is to eliminate some difficulties which are originated from reliance on a mesh by constructing the approximation entirely in terms of nodes. Especially, focusing on Element Free Galerkin Method(EFGM) based on moving least square interpolants(MLSI), a new implementation is developed based on a variational principle with penalty function method were used to enforce the essential boundary condition. In addition, the weighted orthogonal basis functions are constructed to overcome disadvantage of MLSI.