• 대한기계학회논문집B
• /
• 제28권4호
• /
• pp.467-474
• /
• 2004

A large-eddy simulation is performed for turbulent flow in a concentric annulus with the inner wall rotation at Re$\sub$Dh/=8900 for three rotation rates N=0.2145, 0.429 and 0.858. Main emphasis is placed on the inner wall rotation effect on near-wall turbulent structures. Near-wall turbulent structures close to the inner wall are scrutinized by computing the lower-order statistics. The anisotropy invariant map for the Reynolds stress tensor and the invariant function are illustrated to reveal the altered anisotropy in turbulent structure. Probability density functions of the splat/anti-splat process are explored to develop a sufficiently complete picture of the contributions of the flow events to turbulent production. The present numerical results show that the altered turbulent structures may be attributed to the centrifugal instability, which leads to the augmentation of sweep and ejection events.

• Journal of applied mathematics & informatics
• /
• 제6권2호
• /
• pp.553-568
• /
• 1999

This paper is of concern to queueing analysis of the dynamic rate leaky bucket(LB) scheme in which the token generation interval changes according to the buffer state at a token generation epoch. Cell arrivals are assumed to follow a Markovian arrival process (MAP) which is weakly dense in the class of the stationary point processes. By using the embedded Markov chain method we obtain the probability distribution of the system state at a token generation epoch and an arbitrary time. Some simple numerical examples also are provided to show the effects of the proposed LB scheme.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 추계학술대회 논문집 학회본부 B
• /
• pp.627-629
• /
• 1999

The research fields of mobile robot consist of three parts. The first is path planning, the second is the application of new sensors, and the last is a combination of the communication technology and mobile robot. In this paper we treat the path-planning. We use a Bayesian probability map, Distance Transform and Fuzzy logic for a path-planning. DT and Fuzzy logic algorithms search for path in entire, continuous free space and unifies global path planning and local path planning. It is efficient and effective method when compared with navigators using traditional approaches.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2007년도 춘계학술대회 논문집
• /
• pp.126-129
• /
• 2007

In this paper, an iterative MAP approach using a Bayesian model based on the lognormal distribution for image intensity and a GRF for image texture is proposed for despeckling the SAR images that are corrupted by multiplicative speckle noise. When the image intensity is logarithmically transformed, the speckle noise is approximately Gaussian additive noise, and it tends to a normal probability much faster than the intensity distribution. The MRF is incorporated into digital image analysis by viewing pixel type s as states of molecules in a lattice-like physical system defined on a GRF. Because of the MRFGRF equivalence, the assignment of an energy function to the physical system determines its Gibbs measure, which is used to model molecular mteractions. The proposed adaptive iterative method was evaluated using simulation data generated by the Monte Carlo method. In the extensive experiments of this study, the proposed method demonstrated the capability to relax speckle noise and estimate noise-free intensity.

• 한국HCI학회:학술대회논문집
• /
• 한국HCI학회 2007년도 학술대회 1부
• /
• pp.256-261
• /
• 2007

본 논문은 이미지 완성(Image Completion)을 위한 근사적 에너지 최적화 알고리즘을 제안한다. 이미지 완성이란 이미지의 특정영역이 지워진 상태에서, 그 지워진 부분을 나머지 부분과 시각적으로 어울리도록 완성시키는 기법을 말한다. 본 논문에서 이미지 완성은 유사-확률적(pseudo-probabilistic) 시스템인 Markov Random Field로 모델링된다. MRF로 모델링된 이미지 완성 시스템에서 사후 확률(posterior probability)을 최대로 만드는 MAP(Maximum A Posterior) 문제는 결국 시스템의 전체 에너지를 낮추는 에너지 최적화 문제와 동일하다. 본 논문에서는 MRF의 최적화 알고리즘들 중에서 Belief Propagation 알고리즘을 이용한다. BP 알고리즘이 이미지 완성 분야에 적용될 때 다음 두 가지가 계산시간을 증가시키는 요인이 된다. 첫 번째는 완성시킬 영역이 넓어 MRF를 구성하는 정점의 수가 증가할 때이다. 두 번째는 비교할 후보 이미지 조각의 수가 증가할 때이다. 기존에 제안된 Priority-Belief Propagation 알고리즘은 우선순위가 높은 정점부터 메시지를 전파하고 불필요한 후보 이미지 조각의 수를 제거함으로써 이를 해결하였다. 하지만 우선순위를 정점에 할당하기 위한 최초 메시지 전파의 경우 Belief Propagation의 단점은 그대로 남아있다. 이를 개선하기 위해 본 논문에서는 이미지 완성을 위한 MRF 모델을 피라미드 구조와 같이 층위로 나누어 정점의 수를 줄이고, 계층적으로 메시지를 전파하여 시스템의 적합성(fitness)을 정교화 해나가는 Hierarchical Priority Belief Propagation 알고리즘을 제안한다.

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2009년도 정보통신설비 학술대회
• /
• pp.72-77
• /
• 2009

In this paper, performance of a turbo-coded PLC system is analyzed and simulated in a power line communication channel. Since the power line communication system typically operates in a hostile environment, turbo code has been employed to enhance reliability of transmitted data. The performance is evaluated in terms of bit error probability. As turbo decoding algorithms, Max-Log-MAP algorithms are chosen and performances are compared. The results in this paper can be applied to OFDM-based high-speed power line communication systems

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
• /
• pp.213-216
• /
• 2001

In this paper, the performance of an OFDM/CDMA system with turbo coding is analyzed and simulated in a multipath fading channel. Bit error probability is derived fDr a Rayleigh fading channel. In an OFDM/CDMA system, an OFDM and a CDMA techniques are combined to exploit the advantages of both techniques. For decoding of turbo code, MAP decoding algorithm is employed. From the simulation results. it is demonstrated that turbo coding offers considerable coding gain with reasonable encoding/decoding complexity. Also, it is shown that the BER performance is substantially improved by increasing the interleaver length for a fixed code rate and the increasing number of iterations used in the decoding process. The results in the paper can be applied to the design of OFDM-based CDMA system.

• Journal of applied mathematics & informatics
• /
• 제28권3_4호
• /
• pp.931-938
• /
• 2010

The disentangling map from the commutative algebra to the noncommutative algebra of operators is the essential operation of Feynman's operational calculus for noncommuting operators. Thus formulas which simplify this operation are meaningful to the subject. In a recent paper the procedure for "methods for iterative disentangling" has been established in the setting of Feynman's operational calculus for time independent operators $A_1$, $\cdots$, $A_n$ and associated probability measures${\mu}_1$, $\cdots$, ${\mu}_n$. The main purpose for this paper is to extend the procedure for methods for iterative disentangling to time dependent operators.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
• /
• pp.270-273
• /
• 2007

In this paper, a SAR-despeck1ing approach of adaptive iteration based a Bayesian model using the lognormal distribution for image intensity and a Gibbs random field (GRF) for image texture is proposed for noise removal of the images that are corrupted by multiplicative speckle noise. When the image intensity is logarithmically transformed, the speckle noise is approximately Gaussian additive noise, and it tends to a normal probability much faster than the intensity distribution. The MRF is incorporated into digital image analysis by viewing pixel types as states of molecules in a lattice-like physical system. The iterative approach based on MRF is very effective for the inner areas of regions in the observed scene, but may result in yielding false reconstruction around the boundaries due to using wrong information of adjacent regions with different characteristics. The proposed method suggests an adaptive approach using variable parameters depending on the location of reconstructed area, that is, how near to the boundary. The proximity of boundary is estimated by the statistics based on edge value, standard deviation, entropy, and the 4th moment of intensity distribution.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제42권2호
• /
• pp.111-119
• /
• 2003

This research discussed a general concept on the qualitative research methods in mathematics education. It provided a classification of research methods in mathematics education. It also described research trends in mathematics education. It addressed how research design facilitates formulating a research problem, selecting a research design, choosing who and what to study, deciding how to approach Participants, selecting means to collect data choosing how to analyzing data, and interpreting data and applying the analysis. This study addressed the issues involved in choosing relevant populations and in selecting and sampling qualitative data. It described how populations are conceptualized and distinguished between probability sampling and criterion based selection. It discussed not only data arrangement such as, cross-sectional and categorical indexing, non-cross- sectional data organization, but also diagram flow chart matrix, cognitive map, family tree to facilitate analyzing data.