• The Korean Journal of Applied Statistics
• /
• v.21 no.1
• /
• pp.141-149
• /
• 2008

Recently we frequently analyze multivariate data with quite large number of variables. In such data sets, virtually duplicated variables may exist simultaneously even though they are conceptually distinguishable. Duplicate variables may cause problems such as the distortion of principal axes in principal component analysis and factor analysis and the distortion of the distances between observations, i.e. the input for cluster analysis. Also in supervised learning or regression analysis, duplicated explanatory variables often cause the instability of fitted models. Since real data analyses are aimed often at multiple purposes, it is necessary to reduce the number of variables to a parsimonious level. The aim of this paper is to propose a practical algorithm for selection of a subset of variables from a given set of p input variables, by the criterion of minimum trace of partial variances of unselected variables unexplained by selected variables. The usefulness of proposed method is demonstrated in visualizing the relationship between selected and unselected variables, in building a predictive model with very large number of independent variables, and in reducing the number of variables and purging/merging categories in categorical data.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.38 no.9
• /
• pp.1029-1036
• /
• 2014

Several types of automatic 3D scanners are available for use in the 3D scanning industry, e.g., an automatic 3D scanner that uses a robot arm and one that uses an automatic rotary table. Specifically, these scanners are used to obtain a 3D shape using automatic assisting devices. Most of these scanners are required to perform numerous operations, such as merging, aligning, trimming, and filling holes. We are interested in developing an automatic 3D shape collection device using a spherical-coordinate-based guiding system. Then, the aim of the present study is to design an automatic guiding system that can automatically collect 3D shape data. We develop a 3D model of this system and measuring data which are collected by a personal computer. An optimal design of this system and the geometrical accuracy of the measured data are both evaluated using 3D modeling software. The developed system is then applied to an object having a highly complex shape and manifold sections. Our simulation results demonstrate that the developed system collects higher-quality 3D data than the conventional method.

• The KIPS Transactions:PartA
• /
• v.18A no.4
• /
• pp.135-142
• /
• 2011

This research is to design an effective buffer structure and its management for flash memory based high performance SSDs (Solid State Disks). Specifically conventional SSDs tend to show asymmetrical performance in read and /write operations, in addition to a limited number of erase operations. To minimize the number of erase operations and write latency, the degree of interleaving levels over multiple flash memory chips should be maximized. Thus, to increase the interleaving effect, an effective buffer structure is proposed for the SSD with a hybrid address mapping scheme and super-block management. The proposed buffer operation is designed to provide performance improvement and enhanced flash memory life cycle. Also its management is based on a new selection scheme to determine random and sequential accesses, depending on execution characteristics, and a method to enhance the size of sequential access unit by aggressive merging. Experiments show that a newly developed mapping table under the MBA is more efficient than the basic simple management in terms of maintenance and performance. The overall performance is increased by around 35% in comparison with the basic simple management.

• Archives of Plastic Surgery
• /
• v.38 no.1
• /
• pp.73-76
• /
• 2011

Purpose: Congenital midline upper lip sinus is a rare lesion. There are two postulates that can account for the formation of the upper lip sinus based on two major theories of the development of the face: the fusion theory and the merging theory. However, congenital midline lower lip sinus is very rarely reported and described. We report a case of a congenital midline sinus of the lower lip in a 6-year-old female. Methods: A 6-year-old girl presented with a nipple like swelling on the midline lower lip. Physical examination revealed about $5{\times}5$ mm protruding round mass with a just small opening that was non-tender to palpation. The mass was not associated with any skin changes. It umbilicated at the apex and contains a fistulous tract, discharging clear fluid. Only, simple radiologic finding shows bony spur on the lower one third of mandibular symphsis. Results: A small transverse ellipse is made around the opening and elevated mass with sharpe dissection. The tract is excised using the probe and dye as the guide. The tract was extended to periosteum of the lower one third of the mandible. The tract and involved periosteum were excised en bloc, and removed protrusion of the mandibular bone using diamond burr. Microscopic examination of the resected sinus revealed the fistulous tract itself, consisting of fibrous connective tissue covered with cornified stratified squamous epithelium, was observed in the center of the sample. In 6 months follow-up, This patient had a good result was obtained by the method of fistulectomy alone. Conclusion: Midline cranoifacial fistulas represent rare lesions resulting from abnormal fusion of embryologic structures. Our case report describes the excision of a congenital midline sinus of the lower lip in a 6-year-old female. This case represents the first report of a lower lip sinus presenting in a girl as a mass in the skin of the chin with extension to the midline of the mandible. However, the etiology of this rare congenital sinus remains obscure.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.11
• /
• pp.64-74
• /
• 1999

A new clock skew optimization for clock routing using link-edge insertion is proposed in this paper. It satisfies the given skew bound and prevent the total wire length from increasing. As the clock skew is the major constraint for high speed synchronous ICs, it must be minimized in order to obtain high performance. But clock skew minimization can increase total wire length, therefore clock routing is performed within the given skew bound which can not induce the malfunction. Clock routing under the specified skew bound can decrease total wire length Not only total wire length and delay time minimization algorithm using merging point relocation method but also clock skew reduction algorithm using link-edge insertion technique between two nodes whose delay difference is large is proposed. The proposed algorithm construct a new clock routing topology which is generalized graph model while previous methods uses only tree-structured routing topology. A new cost function is designed in order to select two nodes which constitute link-edge. Using this cost function, delay difference or clock skew is reduced by connecting two nodes whose delay difference is large and distance difference is short. Furthermore, routing topology construction and wire sizing algorithm is developed to reduce clock delay. The proposed algorithm is implemented in C programming language. From the experimental results, we can get the delay reduction under the given skew bound.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.4
• /
• pp.80-89
• /
• 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$^1$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 it 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 by 15.58% rather than the TEMPLA, and reduces process time rather than the TMCPLD.

• 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.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2019.05a
• /
• pp.157-157
• /
• 2019

This study derived the Flood-Inducing-Rainfall (FIR) and the Flood-Inducing-Runoff (FIRO) from the radar-gage composite data to be used as the basis of the flood warning initiation for the urban area of Seoul. For this, we derived the rainfall depth-duration relationship for the 261 flood events at 239 watersheds during the years 2010 and 2011 based on the 10-minute 1km-1km radar-gauge composite rainfall field. The relationship was further refined by the discrete ranges of the proportion of the flooded area in the watershed (FP) and the coefficient variation of the rainfall time series (CV). Then, the slope of the straight line that contains all data points in the depth-duration relationship plot was determined as the FIR for the specified range of the FP and the CV. Similar methodology was applied to derive the FIRO, which used the runoff depths that were estimated using the NRCS Curve Number method. We found that FIR and FIRO vary at the range of 37mm/hr-63mm/hr and the range of 10mm/hr-42mm/hr, respectively. The large variability was well explained by the FP and the CV: As the FP increases, FIR and FIRO increased too, suggesting that the greater rainfall causes larger flooded area; as the rainfall CV increases, FIR and FIRO decreased, which suggests that the temporally concentrated rainfall requires less total of rainfall to cause the flood in the area. We verified our result against the 21 flood events that occurred for the period of 2012 through 2015 for the same study area. When the 5 percent of the flooded area was tolerated, the ratio of hit-and-miss of the warning system based on the rainfall was 44.2 percent and 9.5 percent, respectively. The ratio of hit-and-miss of the warning system based on the runoff was 67 percent and 4.7 percent, respectively. Lastly, we showed the importance of considering the radar-gauge composite rainfall data as well as rainfall and runoff temporal variability in flood warning system by comparing our results to the ones based on the gauge-only or radar-only rainfall data and to the one that does not account for the temporal variability.

• Journal of The Korean Association For Science Education
• /
• v.42 no.3
• /
• pp.357-370
• /
• 2022

In this paper, we developed an augmented reality learning tool suitable for chemical bond learning and proposed a process-oriented guided inquiry learning using mobile augmented reality (POGIL-MAR) to find out how it affects science achievement, science learning motivation and learning flow. Participants were 139 10^th-grade students from a coeducational high school in Gyeonggi-do, and they were randomly assigned to the control group (TL), the treatment group 1 (POGIL), and the treatment group 2 (POGIL-MAR). They learned the concept of the chemical bond from the Integrated Science subject for four class periods. Results of two-way ANCOVA revealed that the POGIL-MAR group scored significantly higher than the other groups in a science achievement test, science learning motivation test, and learning flow test, regardless of their prior science achievement. In addition, in the case of the low-level group, the POGIL-MAR group showed a statistically significant improvement in achievement compared to the TL and POGIL groups. The MANCOVA analysis for sub-factors of science learning motivation show that the POGIL-MAR group had significantly higher scores in intrinsic motivation, career motivation, self-determination, self-efficacy, and grade motivation. In particular, the interaction effect between the teaching and learning method and the level of prior achievement was significant in the intrinsic motivation. Meanwhile, the MANCOVA analysis for sub-factors of learning flow show that the POGIL-MAR group had significantly higher scores in clear goals, unambiguous feedback, action-awareness merging, sense of control, and autotelic experience. Based on the results, educational implications for effective teaching and learning strategy using mobile augmented reality are discussed.