• 한국신재생에너지학회:학술대회논문집
• /
• 2010.11a
• /
• pp.186-186
• /
• 2010

개별 블레이드 피치 제어(individual blade pitch control)는 각각의 로터 블레이드의 피치각을 독립적으로 조정함으로써 블레이드에 작용하는 공력을 변화시키는 원리로 풍력 터빈 구조물에 발생하는 동적 피로하중을 저감시키기 위한 제어기법이다. 그러나 개별 피치 제어에 의해 발생하는 각 블레이드의 독립적인 피치 운동은 풍력 터빈 회전자에 비대칭성을 야기하고 구조물의 동적 불안정 현상을 발생시킬 수 있기 때문에 이에 대한 정확한 동적 해석이 선행되어야 한다. 하지만 블레이드의 피치 운동이 반영된 풍력 터빈은 시변계로 간주되어 기존의 시불변계 해석기법을 직접 적용할 수 없기 때문에 동적 해석에 어려움이 있다. 이 논문에서는 각각의 블레이드 피치운동을 주기함수로 근사화 함으로써 풍력 터빈을 주기 시변계로 모형화한다. 그리고 효율적으로 주기 시변계의 근사해를 구하기 위한 변조 좌표 변환(modulated coordinate transformation)기법을 적용하여 블레이드의 피치운동이 반영된 풍력 터빈의 동적 안정성 해석을 수행하였다. 그리고 현재 풍력 터빈의 동적 해석에 활용되는 대표적인 해석 기법인 다중 블레이드 좌표변환(multi-blade coordinate transformation)기법을 이용한 해석보다 정확한 결과를 얻을 수 있음을 보였다.

• Journal of Broadcast Engineering
• /
• v.2 no.1
• /
• pp.65-73
• /
• 1997

This paper propose a new triangular mesh approximation method using wavelet coefficients for large terrain data. Using spatio-freguency localization characteristics of wavelet coefficients, we determine the complexity of terrain data and approximate the data according to the complexity. This proposed algorithm is simple and requires low computational cost due to its top-down approach. Because of the similarity between the mesh approximation and data compression procedures based on wavelet transform, we combine the mesh approximation scheme with the Embedded Zerotree Wavelet (EZW) coding scheme for the effective management of large terrain data. Computer simulation results demonstrate that the proposed algorithm is very prospective for the 3-D visualization of terrain data.

• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.447-458
• /
• 2008

In this paper, we address an efficient processing scheme for k-nearest neighbor queries to retrieve k static objects in road network databases. Existing methods cannot expect a query processing speed-up by index structures in road network databases, since it is impossible to build an index by the network distance, which cannot meet the triangular inequality requirement, essential for index creation, but only possible in a totally ordered set. Thus, these previous methods suffer from a serious performance degradation in query processing. Another method using pre-computed network distances also suffers from a serious storage overhead to maintain a huge amount of pre-computed network distances. To solve these performance and storage problems at the same time, this paper proposes a novel approach that creates an index for moving objects by approximating their network distances and efficiently processes k-nearest neighbor queries by means of the approximate index. For this approach, we proposed a systematic way of mapping each moving object on a road network into the corresponding absolute position in the m-dimensional space. To meet the triangular inequality this paper proposes a new notion of average network distance, and uses FastMap to map moving objects to their corresponding points in the m-dimensional space. After then, we present an approximate indexing algorithm to build an R*-tree, a multidimensional index, on the m-dimensional points of moving objects. The proposed scheme presents a query processing algorithm capable of efficiently evaluating k-nearest neighbor queries by finding k-nearest points (i.e., k-nearest moving objects) from the m-dimensional index. Finally, a variety of extensive experiments verifies the performance enhancement of the proposed approach by performing especially for the real-life road network databases.

• The Journal of the Korea Contents Association
• /
• v.4 no.3
• /
• pp.81-90
• /
• 2004

Recently, It has been increased to use a multi-dimensional data in various applications with a rapid growth of the computing environment. In this paper, we propose the vector approximate tree for content-based retrieval of multi-dimensional data. The proposed index structure reduces the depth of tree by storing the many region information in a node because of representing region information using space partition based method and vector approximation method. Also it efficiently handles 'dimensionality curse' that causes a problem of multi-dimensional index structure by assigning the multi-dimensional data space to dynamic bit. And it provides the more correct regions by representing the child region information as the parent region information relatively. We show that our index structure outperforms the existing index structure by various experimental evaluations.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.3
• /
• pp.1-8
• /
• 2004

The anomalous behavior of the 1/f noise of halo or pocket ion implanted MOSFETs is investigated. The model for the anomalous 1/f noise behaviors of MOSFETs, which consist of inhomogeneous conductance along the channel is improved within a regional approximation as previous works and presented in a fen directly applicable to halo MOSFETs. The presented model reduces to the previous results, discussed in the linear region operation, for small drain bias. Comparisons with experimental results show that the 1/f model based on the regional approach can be applicable for limited ranges, especially for sufficiently large gate bias voltages.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.7
• /
• pp.822-830
• /
• 2012

Clutters are all unwanted radar returns to affect on detection of targets. Radar clutter is characterized by amplitude distributions, spectrum, etc. Clutter is modelled with considering these kinds of characteristics. In this paper, a Weibull distribution function approximated by uniform distribution function is suggested. Weibull distribution function is used to model the various clutters. This paper shows that the data generated by the approximated solution of Weibull distribution function satisfy the Weibull probability density function. This paper shows that the data generation time of approximated Weibull distribution function solution is reduced by 20 % compared with the generation time of original Weibull probability density function.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.32 no.5
• /
• pp.58-64
• /
• 2004

A new method to obtain approximate solutions by placing the only poles of the slow subsystem for the two-time-scale aircraft dynamic systems. The two kinds of approximate solutions are obtained by a matrix block diagonalization. One is called the uncorrected solution, and the other is called the corrected solution. The former has an error of $O({\varepsilon})$, and the latter has an error of $O({\varepsilon}^2)$. Of course, both solutions are robust enough even though they are reduced solutions. The excellence of the proposed method is illustrated by an numerical example of an aircraft longitudinal dynamics.

• Annual Conference of KIPS
• /
• 2011.11a
• /
• pp.1243-1247
• /
• 2011

센서 네트워크는 많은 수의 센서들로 구성되며 물질세계와 상호작용하여 실시간 감시를 할 수 있는 큰 규모의 네트워크이다. 현실 세계의 물리적 변화를 지속적으로 감시하기 위하여 센서 네트워크에 속해 있는 각 센서들은 주기적으로 측정값을 읽어서 기지국(base station)에 전달하는 기능을 수행한다. 이러한 경우, 각 센서들의 지속적인 통신에 따른 에너지 낭비가 발생하여 센서 네트워크 전체의 수명을 단축시키게 된다. 따라서 데이터 모니터링에 있어서 예측을 통한 근사 데이터 수집을 통해 센서 네트워크의 수명을 연장하고자 하는 연구들이 진행되고 있다. 그러나 현재의 예측을 통한 근사 데이터 수집은 측정값의 변화가 클수록 예측 모델의 갱신이 잦다. 따라서 본 논문에서는 지연 갱신을 이용한 효율적인 예측 모델 갱신 기법을 제안한다. 제안된 기법에서는 예측이 실패하였을 경우 즉시 예측 모델을 갱신하는 대신 문제가 되는 구간의 측정값들을 지연, 근사화하여 전송함으로써 예측 모델의 잦은 갱신을 방지할 수 있다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.49-60
• /
• 2002

We propose an algorithm for extracting the boundary of a desired object with shape information obtained from sample images. Considering global shape obtained from sample images and edge orientation as well as edge magnitude, the Proposed method composed of two steps finds the boundary of an object. The first step is the approximate segmentation that extracts a rough boundary with a probability map and an edge map. And the second step is the detailed segmentation for finding more accurate boundary based on the SEEL (seed-point extraction and edge linking) algorithm. The experiment results using IR images show robustness to low-quality image and better performance than conventional segmentation methods.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.3
• /
• pp.193-201
• /
• 2022

SOQPSK-TG is a modulated signal for aircraft telemetry with excellent frequency efficiency and power efficiency. In this paper, the phase waveform of the partial response SOQPSK-TG modulation is linearly approximated and modeled as a full response double duobinary SOQPSK (SOQPSK-DD) signal. And using the XTCQM method and the Laurent decomposition method, the SOQPSK-DD signal was approximated as OQPSK having linear pulse waveforms, and the results of the two methods were proved to be the same. In addition, it was confirmed that the Laurent decomposition waveform of the SOQPSK-DD signal approximates the Laurent decomposition waveform of the original SOQPSK-TG signal. And it was shown that the decision feedback IQ-detector, which applied the Laurent decomposition waveform of SOQPSK-DD to the detection filter, exhibits almost the same performance even with a simpler waveform than before.