• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.224-234
• /
• 2000

In this paper, we propose a new CPLD technology mapping algorithm for sequential circuit under time constraints. The algorithm detects feedbacks of sequential circuit, separate each feedback variables into immediate input variable, and represent combinational part into DAG. Also, among the nodes of the DAG, the nodes that the number of outdegree is more than or equal to 2 is not separated, but replicated from the DAG, and reconstructed to fanout-free-tree. To use this construction method is for reason that area is less consumed than the TEMPLA algorithm to implement circuits, and process time is improved rather than TMCPLD within given time constraint. Using time constraint and delay of device the number of partitionable multi-level is defined, the number of OR terms that the initial costs of each nodes is set to and total costs that the costs is set to after merging nodes is calculated, and the nodes that the number of OR terms of CLBs that construct CPLD is excessed is partitioned and is reconstructed as subgraphs. The nodes in the partitioned subgraphs is merged through collapsing, and the collapsed equations is performed by bin packing so that if fit to the number of OR terms in the CLBs of a given device. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces the number of CLBs bu 15.58% rather than the TEMPLA, and reduces process time rather than the TMCPLD.

• The KIPS Transactions:PartB
• /
• v.16B no.2
• /
• pp.131-140
• /
• 2009

This paper presents a new algorithm to the segmentation of the FISH images. First, for segmentation of the cell nuclei from background, a threshold is estimated by using the gaussian mixture model and maximizing the likelihood function of gray value of cell images. After nuclei segmentation, overlapped nuclei and isolated nuclei need to be classified for exact nuclei analysis. For nuclei classification, this paper extracted the morphological features of the nuclei such as compactness, smoothness and moments from training data. Three probability density functions are generated from these features and they are applied to the proposed Bayesian networks as evidences. After nuclei classification, segmenting of overlapped nuclei into isolated nuclei is necessary. This paper first performs intensity gradient transform and watershed algorithm to segment overlapped nuclei. Then proposed stepwise merging strategy is applied to merge several fragments in major nucleus. The experimental results using FISH images show that our system can indeed improve segmentation performance compared to previous researches, since we performed nuclei classification before separating overlapped nuclei.

• The KIPS Transactions:PartD
• /
• v.15D no.6
• /
• pp.741-754
• /
• 2008

Due to the characteristics of a data stream, it is very important to confine the memory usage of a data mining process regardless of the amount of information generated in the data stream. For this purpose, this paper proposes the Prime pattern tree(PPT) for finding frequent itemsets over data streams with using the confined memory space. Unlike a prefix tree, a node of a PPT can maintain the information necessary to estimate the current supports of several itemsets together. The length of items in a prime pattern can be reduced the total number of nodes and controlled by split_delta $S_{\delta}$. The size and the accuracy of the PPT is determined by $S_{\delta}$. The accuracy is better as the value of $S_{\delta}$ is smaller since the value of $S_{\delta}$ is large, many itemsets are estimated their frequencies. So it is important to consider trade-off between the size of a PPT and the accuracy of the mining result. Based on this characteristic, the size and the accuracy of the PPT can be flexibly controlled by merging or splitting nodes in a mining process. For finding all frequent itemsets over the data stream, this paper proposes a PPT to replace the role of a prefix tree in the estDec method which was proposed as a previous work. It is efficient to optimize the memory usage for finding frequent itemsets over a data stream in confined memory space. Finally, the performance of the proposed method is analyzed by a series of experiments to identify its various characteristics.

• Journal of Korea Water Resources Association
• /
• v.48 no.9
• /
• pp.719-728
• /
• 2015

In this study, urban runoff analyses were performed using high resolution Quantitative Precipitation Estimation (QPE), and variation of rainfall and runoff were analyzed to evaluate QPE data for urban runoff analysis. The five drainage districts (Seocho3, 4, 5, Yeoksam and Nonhyun) around Gangnam station were chosen as study area, the area is $7.4km^2$. Rainfall data from KMA AWS (34 stations), SKP AWS (156 stations) and Gwanduk radar were used for QPEs in Seoul area. Four types of QPE(QPE1: KMA AWS, QPE2: KMA+ SKP AWS, QPE3: Gwangduk radar, QPE4: QPE2+QPE3) of 6 events in July 2013 were generated by using Krigging and conditional merging. The temporal and spatial resolution of QPEs are 10 minutes and 250 m, respectively. The complex pipe network were treated as 773 manholes, 772 sub-drainage districts and 1,059 pipelines for urban runoff analysis as input data. QPE2 and QPE4 show spatial variation of rainfall by sub-drainage districts as 1.9 times bigger than QPE1. The peak runoff of QPE2 and QPE4 also show spatial variation as 6 times bigger than Gangnam and Seocho AWS. Thus, the spatial variation of rainfall and runoff could exist in small area such as this study area, and using high-resolution rainfall data is desirable for accurate urban runoff analysis.

• Journal of the Economic Geographical Society of Korea
• /
• v.12 no.4
• /
• pp.681-701
• /
• 2009

There were three banks that had the head office in Busan since 1912, Gyong-Nam Bank, Dong-Rae Bank and Busan Commercial Bank. This article tries to catch hold of the characteristics of the establishment and management, and the merging process of three banks. The main stockholders and managers made use of the money of the banks for the enterprises that they operated. Gyong-Nam Bank was combined with Dae-Gu Bank in 1928 to be Dae-Gu Commercial & Industrial Bank. The revised bank ordinance of 1928 regulated that the head office banks had to meet the requirement of the paid-in capital, 2 million yen. Not meeting such an excessive requirement, Dong-Rae Bank was amalgamated to Ho-Nam Bank of Gwang-Ju in 1933. Busan Commercial Bank was absorbed in Cho-Sun Commercial Bank in 1935 because it couldn't get back huge loan from a company which belonged to its three main stockholders. Japanese were already the main stockholders of Cho-Sun Commercial Bank from the beginning of 1920s. The banking agencies were not able to deal with the economic fluctuations effectively, and didn't have any economic organization in support of their profit. Cho-Sun Government-General forced the head office banks to be merged to control the colonial economy.

• The KIPS Transactions:PartB
• /
• v.16B no.1
• /
• pp.7-16
• /
• 2009

Some clustering algorithms have a problem that an image is over-segmented since both the spatial information between the segmented regions is not considered and the number of the clusters is defined in advance. Therefore, they are difficult to be applied to the applicable fields. This paper proposes the new post-processing methods, a reclassification of the inhomogeneous clusters and a region merging using Baysian algorithm, that improve the segmentation results of the clustering algorithms. The inhomogeneous cluster is firstly selected based on variance and between-class distance and it is then reclassified into the other clusters in the reclassification step. This reclassification is repeated until the optimal number determined by the minimum average within-class distance. And the similar regions are merged using Baysian algorithm based on Kullbeck-Leibler distance between the adjacent regions. So we can effectively solve the over-segmentation problem and the result can be applied to the applicable fields. Finally, we design a classification system for the segmented regions to validate the proposed method. The segmented regions are classified by SVM(Support Vector Machine) using the principal colors and the texture information of the segmented regions. In experiment, the proposed method showed the validity for various real-images and was effectively applied to the designed classification system.

• Journal of the Korean association of regional geographers
• /
• v.22 no.4
• /
• pp.887-911
• /
• 2016

The empirical law that transverse dunes migrate inversely with their heights leads logically to the prediction that multiple dune ridges will converse to a single huge dune by merging. This contradicts the existence of the steady state dune fields on the Earth. The recent studies have emphasized dune collisions as a key mechanism to the stability of dunefield. The roles of wind shadow aspect ratio, however, have yet to be fully explored. This research aims to investigate the potential roles of wind shadow aspect ratio in the dynamical behaviors of transverse dune field. The simplified model is established for this, based upon allometric properties of transverse dunes, wind speedup on the stoss slope and sand trapping efficiency. The derived governing equations can be transformed to the zoning criteria and vector field for dune evolution. The dynamics analysis indicates that wind shadow aspect ratios do not produce convergent areas on the behavior space; rather, they just act as one of the factors that affect the trajectories of dune evolution. Though the model cannot represent the stability of dune field, but seem to produce a reasonable exponent for dune spacing-height relations.

• The Journal of Engineering Geology
• /
• v.12 no.2
• /
• pp.137-150
• /
• 2002

Recently, plane failure mode occurred frequently along the bedding plane having low angle dip about 20 degree when cutting slopes were constructed in sedimentary rock region of the Gyeongsang Basin. Landslide of the Whangryeong Mountain which was occurred at Busan Metropolitan City in 1999 belongs to the category mentioned above. Reconstruction for cutting slope of the Whangryeong Mountain has finished in 2000 and final grade of reconstructed cutting slope is 1:2.0. To analyze slope failure mode for landslide of the Whangryeong Mountain, various analyses were performed such as in-situ investigation and test, drilling, laboratory test, aerial photograph interpretation, X-ray diffraction analysis, and slope stability analysis using Stereographic Projection and Limit Equilibrium methods. As the result, it is identified that tension cracks had been developed one year before the landslide took place. The tension crack semis to be formed by merging several joint sets. It appears that failure blocks broke down along the sliding planes of different layers. Risk of plane failure is conformed as a result of stability analysis using Stereographic Projection and Limit Equilibrium methods in case that greenish gray tuffaceous shales, regared as sliding planes, are weathered. From now on, a detailed investigation is needed for the thin layers which is sensitive to weathering, and stability analysis for this layer is performed at cut slope construction site having similar geological condition.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.8
• /
• pp.1809-1818
• /
• 2010

In order to detect the skin color area from input images, many prior researches have divided an image into the pixels having a skin color and the other pixels. In a still image or videos, it is very difficult to exactly extract the skin pixels because lighting condition and makeup generate a various variations of skin color. In this thesis, we propose a method that improves its performance using hierarchical merging of 3D skin color model and context informations for the images having various difficulties. We first make 3D color histogram distributions using skin color pixels from many YCbCr color images and then divide the color space into 3 layers including skin color region(Skin), non-skin color region(Non-skin), skin color candidate region (Skinness). When we segment the skin color region from an image, skin color pixel and non-skin color pixels are determined to skin region and non-skin region respectively. If a pixel is belong to Skinness color region, the pixels are divided into skin region or non-skin region according to the context information of its neighbors. Our proposed method can help to efficiently segment the skin color regions from images having many distorted skin colors and similar skin colors.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.4
• /
• pp.160-167
• /
• 2005

Among finite filed arithmetic operations, division/inverse is known as a basic operation for public-key cryptosystems over $GF(2^{m})$ and it is computed by performing the repetitive $AB^{2}$ multiplication. This paper presents a digit-serial-in-serial-out systolic architecture for performing the $AB^2$ operation in GF$(2^{m})$. To obtain L×L digit-serial-in-serial-out architecture, new $AB^{2}$ algorithm is proposed and partitioning, index transformation and merging the cell of the architecture, which is derived from the algorithm, are proposed. Based on the area-time product, when the digit-size of digit-serial architecture, L, is selected to be less than about m, the proposed digit-serial architecture is efficient than bit-parallel architecture, and L is selected to be less than about $(1/5)log_{2}(m+1)$, the proposed is efficient than bit-serial. In addition, the area-time product complexity of pipelined digit-serial $AB^{2}$ systolic architecture is approximately $10.9\%$ lower than that of nonpipelined one, when it is assumed that m=160 and L=8. Additionally, since the proposed architecture can be utilized for the basic architecture of crypto-processor and it is well suited to VLSI implementation because of its simplicity, regularity and pipelinability.