• Proceedings of the KSME Conference
• /
• 2001.11b
• /
• pp.22-29
• /
• 2001

The present study investigates the effects of various rib arrangements and rotating on heat/mass transfer in the cooling passage of gas turbine blades. The cooling passage has very complex flow structure, because of the rib turbulator and rotating effect. Experiments and numerical calculation are conducted to investigate the complex flow structures and heat transfer characteristics; the numerical computation is performed using a commercial code, FLUENT ver.5, to calculate the flow structures and the experiments are conducted to measure heat/mass transfer coefficients using a naphthalene sublimation technique. For the rotating duct tests, the test duct, which is the cross section of is $20mm\times40mm$ (the hydraulic diameter, $D_h$, of 26.7 mm, has two-pass with $180^{\circ}$ turning and the rectangular ribs on the wall. The rib angle of attack is $70^{\circ}$ and the maximum radius of rotation is $21.63D_h$. The partition wall has 10 mm thickness, which is 0.5 times to the channel width, and the distance between the tip of the partition wall and the outer wall of the turning region is 26.7 mm $(1D_h)$. The turning effect of duct flow makes the very complex flow structure including Dean type vortex and high turbulence, so that the heat/mass transfer increases in the turning region and at the entrance of the second pass. The Coriolis effect deflects the flow to the trailing surface, resulting in enhancement of the heat/mass transfer on the trailing surface and reduction on the leading surface in the first pass. However, the opposite phenomena are observed in the second pass. The each rib arrangement makes different secondary flow patterns. The complex heat/mass transfer characteristics are observed by the combined effects of the rib arrangements, duct rotation and flow turning.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.83-93
• /
• 2012

This paper proposes an image segmentation framework that modifies the objective function of Fuzzy C-Means (FCM) to improve the performance and computational efficiency of the conventional FCM-based image segmentation. The proposed image segmentation framework includes a locally weighted fuzzy c-means (LWFCM) algorithm that takes into account the influence of neighboring pixels on the center pixel by assigning weights to the neighbors. Distance between a center pixel and a neighboring pixels are calculated within a window and these are basis for determining weights to indicate the importance of the memberships as well as to improve the clustering performance. We analyzed the segmentation performance of the proposed method by utilizing four eminent cluster validity functions such as partition coefficient ($V_{pc}$), partition entropy ($V_{pe}$), Xie-Bdni function ($V_{xb}$) and Fukuyama-Sugeno function ($V_{fs}$). Experimental results show that the proposed LWFCM outperforms other FCM algorithms (FCM, modified FCM, and spatial FCM, FCM with locally weighted information, fast generation FCM) in the cluster validity functions as well as both compactness and separation.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.10 no.3
• /
• pp.37-48
• /
• 1986

The purpose of this study was to analyze 'the natural groupings' of subjects in order to classify highly similar somatotype for clothing construction. The sample for the study was drawn randomly out of senior high school boys in Seoul urban area. The sample size was 425 boys between age 16 and 18. Cluster analysis was more concerned with finding the hierarchical structure of subjects by three dimensional distance of stature. bust girth and sleeve length. The groups forming a partition can be subdivided into 5 and 6 sets by the hierarchical tree of the given subjects. Ward's Minimum Variance Method was applied after extraction of distance matrix by the Standardized Euclidean Distance. All of the above data was analyzed by the computer installed at Korea Advanced Institute of Science and Technology. The major findings, take for instance, of 16 age group can be summarized as follows. The results of cluster analysis of this study: 1. Cluster 1 (32 persons means $18.29\%$ of the total) is characterized with smaller bust girth than that of cluster 5, but stature and sleeve length of the cluster 1 are the largest group. 2. Cluster 2 (18 Persons means $10.29\%$ of the total) is characterized with the group of the smallest stature and sleeve length, but bust girth larger than that of cluster 3. 3. Cluster 3(35persons means $20\%$ of the total) is classified with the smallest group of all the stature, bust girth and sleeve length. 4. Cluster 4(60 persons means $34.29\%$ of the total) is grouped with the same value of sleeve length with the mean value of 16 age group, but the stature and bust girth is smaller than the mean value of this age group. 5. Cluster 5(30 persons means $17.14\%$ of the total) is characterized with smaller stature than that of cluster 1, and with larger bust girth than that of cluster 1, but with the same value of the sleeve length with the mean value of the 16 age group.

• The KIPS Transactions:PartB
• /
• v.13B no.2 s.105
• /
• pp.127-132
• /
• 2006

K-NN (k-Nearest Neighbors), which is a well-known instance-based learning algorithm, simply stores entire training patterns in memory, and uses a distance function to classify a test pattern. K-NN is proven to show satisfactory performance, but it is notorious formemory usage and lengthy computation. Various studies have been found in the literature in order to minimize memory usage and computation time, and NGE (Nested Generalized Exemplar) theory is one of them. In this paper, we propose RPA (Recursive Partition Averaging) and IRPA (Incremental RPA) which is an incremental version of RPA. RPA partitions the entire pattern space recursively, and generates representatives from each partition. Also, due to the fact that RPA is prone to produce excessive number of partitions as the number of features in a pattern increases, we present IRPA which reduces the number of representative patterns by processing the training set in an incremental manner. Our proposed methods have been successfully shown to exhibit comparable performance to k-NN with a lot less number of patterns and better result than EACH system which implements the NGE theory.

• International Journal of Industrial Entomology and Biomaterials
• /
• v.15 no.1
• /
• pp.47-58
• /
• 2007

The tiny dragonfly, Nannophya pygmaea(Odonata: Libellulidae) is one the smallest dragonflies in the world and listed as a second-degree endangered wild animal and plant in Korea. For the long-term conservation of such endangered species, an investigation on nation-wide genetic magnitude and nature of genetic diversity is required as a part of conservation strategy. We, thus, sequenced a portion of mitochondrial COI gene, corresponding to "DNA Barcode" region(658 bp) from 68 N. pygmaea individuals collected over six habitats in Korea. The sequence data were used to investigate genetic diversity within populations and species, geographic variation within species, phylogeographic relationship among populations, and phylogenetic relationship among haplotypes. Phylogenetic analysis and uncorrected pairwise distance estimate showed overall low genetic diversity within species. Regionally, populations in southern localities such as Gangjin and Gokseong in Jeollanamdo Province showed somewhat higher genetic diversity estimates than those of remaining regions in Korean peninsula. Although geographic populations of N. pygmaea were subdivided into two groups, distance- or region-based geographic partition was not observed.

• Earthquakes and Structures
• /
• v.6 no.2
• /
• pp.141-161
• /
• 2014

This article presents a new generation of empirical ground motion models for the prediction of response spectral accelerations in soil conditions, specifically developed for the Vrancea intermediate-depth seismic source. The strong ground motion database from which the ground motion prediction model is derived consists of over 800 horizontal components of acceleration recorded from nine Vrancea intermediate-depth seismic events as well as from other seventeen intermediate-depth earthquakes produced in other seismically active regions in the world. Among the main features of the new ground motion model are the prediction of spectral ordinates values (besides the prediction of the peak ground acceleration), the extension of the magnitudes range applicability, the use of consistent metrics (epicentral distance) for this type of seismic source, the extension of the distance range applicability to 300 km, the partition of total standard deviation in intra- and inter-event standard deviations and the use of a national strong ground motion database more than two times larger than in the previous studies. The results suggest that this model is an improvement of the previous generation of ground motion prediction models and can be properly employed in the analysis of the seismic hazard of Romania.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.5 no.2
• /
• pp.28-43
• /
• 1995

This paper concerns with automatic generation of fuzzy rules which can be used for pattern classification. Feature space is recursively subdivided into hyperspheres, and each hypersphere is represented by its centroid and bounding distance. Fuzzy rules are then generated based on the constructed hyperspheres. The resulting fuzzy rules have very simple premise parts, and they can be organized into a hierarchical structure so that classification process can be implemented very rapidly. The experimented results show that the suggested method works very well compared to other methods.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.173-179
• /
• 1999

In reverse engineering, when a shape containing multi-patched surfaces is digitized, the boundaries of these surfaces should be detected. The objective of this paper is to introduce a computationally efficient segmentation technique for extracting edges, ad partitioning the 3D measuring point data based on the location of the boundaries. The procedure begins with the identification of the edge points. An automatic edge-based approach is developed on the basis of local geometry. A parametric quadric surface approximation method is used to estimate the local surface curvature properties. the least-square approximation scheme minimizes the sum of the squares of the actual euclidean distance between the neighborhood data points and the parametric quadric surface. The surface curvatures and the principal directions are computed from the locally approximated surfaces. Edge points are identified as the curvature extremes, and zero-crossing, which are found from the estimated surface curvatures. After edge points are identified, edge-neighborhood chain-coding algorithm is used for forming boundary curves. The original point set is then broke down into subsets, which meet along the boundaries, by scan line algorithm. All point data are applied to each boundary loops to partition the points to different regions. Experimental results are presented to verify the developed method.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.258-268
• /
• 2004

We demonstrate rotationally invariant space-time (ST) trellis codes with a 4-D rectangular signal constellation for data transmission over fading channels using two transmit antennas. The rotational invariance is a good property to have that may alleviate the task of the carrier phase tracking circuit in the receiver. The transmitted data stream is segmented into eight bit blocks and quadrature amplitude modulated using a 256 point 4-D signal constellation whose 2-D constituent constellation is a 16 point square constellation doubly partitioned. The 4-D signal constellation is simply the Cartesian product of the 2-D signal constellation with it-self and has 32 subsets. The partition is performed on one side into four subsets A, B, C, and D with increased minimum-squared Euclidian distance, and on the other side into four rings, where each ring includes four points of equal energy. We propose both linear and nonlinear ST trellis codes and perform simulations using an appropriate multiple-input multiple-output (MIMO) channel model. The 4-D ST codes constructed here demonstrate about the same frame error rate (FER) performance as their 2-D counterparts, having however the added value of rotational invariance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.407-412
• /
• 2007

본 논문에서는 비선형 블라인드 채널등화기의 구현을 위하여 가우시안 가중치(gaussian weights)를 이용한 개선된 퍼지 클러스터(Modified Fuzzy C-Means with Gaussian Weights: MFCM_GW) 알고리즘을 제안한다. 제안된 알고리즘은 기존 FCM 알고리즘의 유클리디언 거리(Euclidean distance) 값 대신 Bayesian Likelihood 목적함수(fitness function)와 가우시안 가중치가 적용된 멤버쉽 매트릭스(partition matrix)를 이용하여, 비선형 채널의 출력으로 수신된 데이터들로부터 최적의 채널 출력 상태 값(optimal channel output states)들을 직접 추정한다. 이렇게 추정된 채널 출력 상태 값들로 비선형 채널의 이상적 채널 상태(desired channel states) 벡터들을 구성하고, 이를 Radial Basis Function(RBF) 등화기의 중심(center)으로 활용함으로써 송신된 데이터 심볼을 찾아낸다. 실험에서는 무작위 이진 신호에 가우시안 잡음이 추가된 데이터를 사용하여 기존의 Simplex Genetic Algorithm(GA), 하이브리드 형태의 GASA(GA merged with simulated annealing (SA)), 그리고 과거에 발표되었던 MFCM 등과 그 성능을 비교 분석하였으며, 가우시안 가중치가 적용된 MFCM_GW를 이용한 채널등화기가 상대적으로 정확도와 속도 면에서 우수함을 보였다.