• School Mathematics
• /
• v.15 no.2
• /
• pp.459-479
• /
• 2013

The Purpose of this study was to explore the methods of generalization and errors pattern generated by mathematically gifted students and non-gifted students in elementary school. In this research, 6 problems corresponding to the x+a, ax, ax+c, $ax^2$, $ax^2+c$, $a^x$ patterns were given to 156 students. Conclusions obtained through this study are as follows. First, both group were the best in symbolically generalizing ax pattern, whereas the number of students who generalized $a^x$ pattern symbolically was the least. Second, mathematically gifted students in elementary school were able to algebraically generalize more than 79% of in x+a, ax, ax+c, $ax^2$, $ax^2+c$, $a^x$ patterns. However, non-gifted students succeeded in algebraically generalizing more than 79% only in x+a, ax patterns. Third, students in both groups failed in finding commonness in phased numbers, so they solved problems arithmetically depending on to what extent it was increased when they failed in reaching generalization of formula. Fourth, as for the type of error that students make mistake, technical error was the highest with 10.9% among mathematically gifted students in elementary school, also technical error was the highest as 17.1% among non-gifted students. Fifth, as for the frequency of error against the types of all patterns, mathematically gifted students in elementary school marked 17.3% and non-gifted students were 31.2%, which means that a majority of mathematically gifted students in elementary school are able to do symbolic generalization to a certain degree, but many non-gifted students did not comprehend questions on patterns and failed in symbolic generalization.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.6
• /
• pp.679-685
• /
• 2011

This paper presents an algorithm identifying devices that generate observed mixed signals that are collected at main power-supply line. The proposed algorithm, which is necessary for low cost electric power monitoring system at appliance-level, that is non-intrusive load monitoring system, divides incoming mixed signal into multiple time intervals, calculating difference-signals between consecutive time interval, and identifies which device is operating at the time interval by analysing the difference-signals. Since the features of one device can remain when the time interval is short enough and the features are independent and additive, well-known classification algorithms can be used to classify the difference-signals with features of N individual devices, otherwise $2^N$ features might be necessary. The proposed algorithm was verified using data mixed in a laboratory with individual devices's data collected from field. When maximum 4 devices operate or stop sequentially and when features satisfy the requirements of proposed algorithm, the proposed algorithm resulted nearly 100% success rate under the constrained test condition. In order to apply the proposed algorithm in real world, the number devices shall increase, the time interval shall be smaller and the pattern of mixture shall be more diverse. However we can expect, if features used follow guidelines of proposed algorithm, future system could have certain level of performance without the guideline.

• Journal of the korean academy of Pediatric Dentistry
• /
• v.45 no.3
• /
• pp.324-333
• /
• 2018

Children need regularly dental check-ups after dental treatment because there are a lot of changes of oral conditions such as tooth exfoliation and eruption, occlusion, and recurrence of dental caries. The purpose of this study is to determine the factors that affect the follow-up pattern after dental treatment under conscious sedation. Patients who were treated under sedation at the department of pediatric dentistry of Ewha Womans University Mokdong Hospital from 2009 to 2013 were included in this study. The final samples comprised of 562 patients that were classified into 4 groups according to the number of visits during 3 years. The chi-square test was used to determine the factors affecting regular follow-up. There were statistically significant differences between each treatment groups and factors such as the change of doctor, overall treatment time, the number of treated teeth under sedation, restorative treatment, minor operation, and preventive treatment (p < 0.05). This study identified factors that affect regular follow-up after dental treatment under conscious sedation. It is recommended to educate the importance of regular check-ups to parents who are less likely to return.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.417-426
• /
• 2003

The problem of finding clusters in high dimensional data is well known in the field of data mining for its importance, because cluster analysis has been widely used in numerous applications, including pattern recognition, data analysis, and market analysis. Recently, a new framework, projected clustering, to solve the problem was suggested, which first select subdimensions of each candidate cluster and then each input point is assigned to the nearest cluster according to a distance function based on the chosen subdimensions of the clusters. We propose a new algorithm for subdimensional clustering of high dimensional data, each of the three major steps of which partitions the input points into several candidate clutters with proper numbers of points, filters the clusters that can not be useful in the next steps, and then merges the remaining clusters into the predefined number of clusters using a closeness function, respectively. The result of extensive experiments shows that the proposed algorithm exhibits better performance than the other existent clustering algorithms.

• Journal of KIISE:Databases
• /
• v.28 no.2
• /
• pp.217-232
• /
• 2001

본 논문에서는 시계열 데이터베이스에서 정규화 변환을 지원하는 서브시퀀스 매칭 알고리즘을 제안한다. 정규화 변환을 시계열 데이터 간의 절대적인 유클리드 거리에 관계 없이, 구성하는 값들의 상대적인 변화 추이가 유사한 패턴을 갖는 시계열 데이터를 검색하는 데에 유용하다. 기존의 서브시퀀스 매칭 알고리즘을 확장 없이 정규화 변환 서브시퀀스 매칭에 단순히 응용할 경우, 질의 결과로 반환되어야 할 서부시퀀스를 모두 찾아내지 못하는 착오 기각이 발생한다. 또한, 정규화 변환을 지원하는 기존의 전체 매칭 알고리즘의 경우, 모든 가능한 질의 시퀀스 길이 각각에 대하여 하나씩의 인덱스를 생성하여야 하므로, 저장 공간 및 데이터 시퀀스 삽입/삭제의 부담이 매우 심각하다. 본 논문에서는 인덱스 보간법을 이용하여 문제를 해결한다. 인덱스 보간법은 인덱스가 요구되는 모든 경우 중에서 적당한 간격의 일부에 대해서만 생성된 인덱스를 이용하며, 인덱스가 필요한 모든 경우에 대한 탐색을 수행하는 기법이다. 제안된 알고리즘은 몇 개의 질의 시퀀스 길이에 대해서만 각각 인덱스를 생성한 후, 이를 이용하여 모든 가능한 길이의 질의 시퀀스에 대해서 탐색을 수행한다. 이때, 착오 기각이 발생하지 않음을 증명한다. 제안된 알고리즘은 질의 시에 주어진 질의 시퀀스의 길이에 따라 생성되어 있는 인덱스 중에서 가장 적절한 것을 선택하여 탐색을 수행한다. 이때, 생성되어 있는 인덱스의 개수가 많을수록 탐색 성능이 향상된다. 필요에 따라 인덱스의 개수를 변화함으로써 탐색 성능과 저장 공간 간의 비율을 유연하게 조정할 수 있다. 질의 시퀀스의 길이 256 ~ 512중 다섯 개의 길이에 대해 인덱스를 생성하여 실험한 결과, 탐색 결과 선택률이 $10^{-2}$일 때 제안된 알고리즘의 탐색 성능이 순차 검색에 비하여 평균 2.40배, 선택률이 $10^{-5}$일 때 평균 14.6배 개선되었다. 제안된 알고리즘의 탐색 성능은 탐색 결과 선택률이 작아질수록 더욱 향상되므로, 실제 데이터베이스 응용에서의 효용성이 높다고 판단된다.

• The Journal of the Korea Contents Association
• /
• v.9 no.1
• /
• pp.106-114
• /
• 2009

In this paper we proposed a fast method for a K-Means Clustering algorithm. The main characteristic of this method is that it uses precalculated data which possibility of change is high in order to speed up the algorithm. When calculating distance to cluster centre at each stage to assign nearest prototype in the clustering algorithm, it could reduce overall computation time by selecting only those data with possibility of change in cluster is high. Calculation time is reduced by using the distance information produced by K-Means algorithm when computing expected input data whose cluster may change, and by using such distance information the algorithm could be less affected by the number of dimensions. The proposed method was compared with original K-Means method - Lloyd's and the improved method KMHybrid. We show that our proposed method significantly outperforms in computation speed than Lloyd's and KMHybrid when using large size data which has large amount of data, great many dimensions and large number of clusters.

• Proceedings of the Materials Research Society of Korea Conference
• /
• 2010.05a
• /
• pp.58.2-58.2
• /
• 2010

FPD (Flat Panel Display) 제조 공정에서 사용되는 패턴은 수 ${\mu}m$ 수준까지 감소하였으며, FPD의 크기는 급격하게 대형화 되여 현재 8세대(2200mm*2500mm)에 이르고 있다. 이에 따라, $1\;{\mu}m$ 이상의 크기를 갖는 오염입자에 의한 수율 저하를 극복하기 위한 세정효율의 향상 및 다량의 초순수 사용에 따른 폐수 발생으로 인한 환경오염, 또한 장비의 크기에 따른 공간 효용성 감소와 이에 따른 공정 비용의 증가 등의 어려움에 직면하고 있다. 따라서, 현장에서는 고효율, 저비용의 세정 공정 기술 개발에 대한 연구가 활발히 진행되고 있다. 이러한 문제점들을 해결 하고자 이류체 노즐 세정 장치와, 화학액 린스를 위한 초순수 Spray, 건조 공정에 해당하는 Air-knife, Halogen lamp로 구성된 소형화 된 고속 FPD(Flat Panel Display) 세정기에 대한 연구를 진행 하였다. 이류체 노즐은 초순수와 $N_2$ 가스를 내부에서 혼합하여 액적(Droplet)을 형성하여 고압으로 분사시키는 장치로서 화학액을 사용하지 않고 물리적인 방법으로 오염입자를 제거한다. Spray는 유기 오염입자 제거를 위한 오존수의 린스 공정을 위해 설치 하였다. 세정 후 표면에 남아있는 기판의 액막(water film)은 고압의 가스를 분사하는 Air-knife를 통해 제거하였으며, 고속 공정시 발생할 수 있는 Air-knife에서 제거하지 못한 잔류 액막을 Halogen lamp를 사용하여 효과적으로 제거함으로써, 물반점(water mark) 없는 건조 공정을 얻을 수 있었다. 실험에는 미세 입자의 정량적인 측정을 위하여 유리 기판 대신에 6인치 실리콘 웨이퍼(P-type (100))를 사용하였으며, > $\;1{\mu}m$ 실리카 입자를 스핀방식을 사용하여 정량적으로 균일하게 오염하였으며, 오염물의 개수 및 분포는 파티클 스캐너 (Surfscan 6200, KLA-Tancor, USA)를 사용하여 분포 및 개수를 정량적으로 측정 하였다. 이류체 노즐은 $N_2$ 가스의 압력과 초순수의 압력을 변화시켜 측정하여, 각각 0.20 MPa, 0.01 MPa에서 최적의 세정 결과를 얻을 수 있었으며, 건조 효율은 Air-Knife의 입사 각도와 건조면 간격, 할로겐 램프의 온도를 조절 하여 최적의 조건을 얻을 수 있었다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.1
• /
• pp.147-156
• /
• 2011

With the increasing utility of the recent information system, the methods to pick up necessary products rapidly by using a lot of data has been studied. Association rule search methods to find hidden patterns has been drawing much attention, and the Apriori algorithm is a major method. However, the Apriori algorithm increases search time due to its repeated scans. This paper proposes an algorithm to reduce searching time of frequent items. The proposed algorithm creates matrix using transaction database and search for frequent items using the mean number of items of transactions at matrix and a defined minimum support. The mean number of items of transactions is used to reduce the number of transactions, and the minimum support to cut down on items. The performance of the proposed algorithm is assessed by the comparison of search time and precision with existing algorithms. The findings from this study indicated that the proposed algorithm has been searched more quickly and efficiently when extracting final frequent items, compared to existing Apriori and Matrix algorithm.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.10 no.2
• /
• pp.247-256
• /
• 1999

The leaky wave emanated from the dielectric-coated parallel-plate waveguide with finite periodic thick slot in its upper plate is investigated theoretically for H-polarization case. For this structure, fields in slot regions are expressed as a summation of the parallel-plate waveguide TM modes, and in other regions are expressed in the spectral domain by use of the inverse Fourier transform. Boundary conditions at the interfaces are enforced, and the simultaneous linear equations are derived. The influences of the slot width, slot thickness, thickness of a dielectric coating, and finite slot number on the radiation characteristics (phase constant, leakage constant, radiation pattern) are examined. The results of the finite periodic slot are compared with those of the infinite extent structure and good agreement has been found.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.3
• /
• pp.75-84
• /
• 2007

Due to the increasing complexity and shorter life cycle of web applications, web applications need to be restructured to improve flexibility and extensibility. These days approaches are being used where systems are understood and restructured through clustering techniques. In this paper, the coupling metrics are proposed for clustering web pages more effectively. To achieve this, web application models are defined, where the relationship between web pages and the numbers of parameters are included. Considering direct and indirect coupling strength based on these models, coupling metrics are defined. The more direct relations between two pages and the more parameters they have, the stronger direct coupling is. The higher indirect connectivity strength between two pages is, the more similar the patterns of relationships among other web pages are. We verify the suggested metrics according to the well known verification framework and provide a case study to show that our metrics complements some existing metrics.