• Journal of The Korean Association For Science Education
• /
• v.34 no.5
• /
• pp.491-497
• /
• 2014

The purpose of this study is to investigate the structural relationships among the attitude toward science and science motivation such as affective characteristics, and self-regulated learning strategy such as cognitive factor of science achievement. 853 middle school students residing in Seoul completed questionnaires about attitude toward science, science motivation, and self-regulated learning strategy. The sample variance-covariance matrix was analysed using AMOS 20.0, and a maximum likelihood minimization function. The results are as follows: First, attitude toward science, science motivation and self-regulated learning strategy of middle school students were all found to have a significant direct effect on science achievement. Second, attitude toward science and science motivation in middle school students has a direct effect on the self-regulated learning strategy. Third, attitude toward science in middle school students has a substantial indirect effect on science achievement mediated by their self-regulated learning strategy. Forth, science motivation in middle school students has indirect effect on science achievement mediated by their self-regulated learning strategy. Therefore, in order to improve science achievement among middle school students, teachers should consider synthetically the affective characteristics such as attitude toward science and science motivation, and cognitive factor such as self-regulated learning strategy.

• Journal of KIISE
• /
• v.44 no.6
• /
• pp.587-594
• /
• 2017

Recently, motor imagery electroencephalogram(EEG) based Brain-Computer Interface(BCI) systems have received a significant amount of attention in various fields, including medicine and engineering. The Common Spatial Pattern(CSP) algorithm is the most commonly-used method to extract the features from motor imagery EEG. However, the CSP algorithm has limited applicability in Small-Sample Setting(SSS) situations because these situations rely on a covariance matrix. In addition, large differences in performance depend on the frequency bands that are being used. To address these problems, 4-40Hz band EEG signals are divided using nine filter-banks and Regularized CSP(R-CSP) is applied to individual frequency bands. Then, the Mutual Information-Based Individual Feature(MIBIF) algorithm is applied to the features of R-CSP for selecting discriminative features. Thereafter, selected features are used as inputs of the classifier Least Square Support Vector Machine(LS-SVM). The proposed method yielded a classification accuracy of 87.5%, 100%, 63.78%, 82.14%, and 86.11% in five subjects("aa", "al", "av", "aw", and "ay", respectively) for BCI competition III dataset IVa by using 18 channels in the vicinity of the motor area of the cerebral cortex. The proposed method improved the mean classification accuracy by 16.21%, 10.77% and 3.32% compared to the CSP, R-CSP and FBCSP, respectively The proposed method shows a particularly excellent performance in the SSS situation.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.177-187
• /
• 2014

This paper proposes a fast subspace tracking methods, which is called GVFF FAPI, based on FAPI (Fast Approximated Power Iteration) method and GVFF RLS (Gradient-based Variable Forgetting Factor Recursive Lease Squares). Since the conventional FAPI uses a constant forgetting factor for estimating covariance matrix of source signals, it has difficulty in applying to non-stationary environments such as continuously changing DOAs of source signals. To overcome the drawback of conventioanl FAPI method, the GVFF FAPI uses the gradient-based variable forgetting factor derived from an improved means square error (MSE) analysis of RLS. In order to achieve the decreased subspace error in non-stationary environments, the GVFF-FAPI algorithm used an improved forgetting factor updating equation that can produce a fast decreasing forgetting factor when the gradient is positive and a slowly increasing forgetting factor when the gradient is negative. Our numerical simulations show that GVFF-FAPI algorithm offers lower subspace error and RMSE (Root Mean Square Error) of tracked DOAs of source signals than conventional FAPI based MUSIC (MUltiple SIgnal Classification).

• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.3
• /
• pp.246-252
• /
• 2016

Since thermal power plant (TPP) equipment is operated under very high pressure and temperature, failures of the equipment give rise to severe losses of life and property. To prevent the losses, fault detection method is, therefore, absolutely necessary to identify abnormal operating conditions of the equipment in advance. In this paper, we present Mahalanobis distance (MD) based fault detection method for steam boiler tube in TPP. In the MD-based method, it is supposed that abnormal data samples are far away from normal samples. Using multivariate samples collected from normal target system, mean vector and covariance matrix are calculated and threshold value of MD is decided. In a test phase, after calculating the MDs between the mean vector and test samples, alarm signals occur if the MDs exceed the predefined threshold. To demonstrate the performance, a failure case due to boiler tube leakage in 200MW TPP is employed. The experimental results show that the presented method can perform early detection of boiler tube leakage successfully.

• Spatial Information Research
• /
• v.22 no.1
• /
• pp.75-84
• /
• 2014

Power lines are one of the main obstacles causing an aircraft crash and thus their realtime detection is significantly important during flight. To avoid such flight obstacles, the use of LIDAR has been recently increasing thanks to its advantages that it is less sensitive to weather conditions and can operate in day and night. In this study, we suggest a fast method to detect power lines from LIDAR data for flight obstacle avoidance. The proposed method first extracts non-ground points by eliminating the points reflected from ground surfaces using a filtering process. Second, we calculate the eigenvalues for the covariance matrix from the coordinates of the generated non-ground points and obtain the ratio of eigenvalues. Based on the ratio of eigenvalues, we can classify the points on a linear structure. Finally, among them, we select the points forming horizontally long straight as power-line points. To verify the algorithm, we used both real and simulated data as the input data. From the experimental results, it is shown that the average detection rate and time are 80% and 0.2 second, respectively. If we would improve the method based on the experiment results from the various flight scenario, it will be effectively utilized for a flight obstacle avoidance system.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.27-36
• /
• 2004

Detection and recognition of human faces in images can be considered as an important aspect for applications that involve interaction between human and computer. In this paper, we propose a face recognition method using eigenfaces and fuzzy neural networks. The Principal Components Analysis (PCA) is one of the most successful technique that have been used to recognize faces in images. In this technique the eigenvectors (eigenfaces) and eigenvalues of an image is extracted from a covariance matrix which is constructed form image database. Face recognition is Performed by projecting an unknown image into the subspace spanned by the eigenfaces and by comparing its position in the face space with the positions of known indivisuals. Based on this technique, we propose a new algorithm for face recognition consisting of 5 steps including preprocessing, eigenfaces generation, design of fuzzy membership function, training of neural network, and recognition. First, each face image in the face database is preprocessed and eigenfaces are created. Fuzzy membership degrees are assigned to 135 eigenface weights, and these membership degrees are then inputted to a neural network to be trained. After training, the output value of the neural network is intupreted as the degree of face closeness to each face in the training database.

• Journal of the Korean Chemical Society
• /
• v.31 no.6
• /
• pp.555-566
• /
• 1987

Fifty ancient Korean coins originated in Yi Dynasty have been determined for 9 elements such as Sn, Fe, As, Ag, Co, Sb, Ir, Ru and Ni by instrumental neutron activation analysis and for 3 elements such as Cu, Pb, and Zn by atomic absorption spectrometry. Bronze coins originated in early days of the dynasty contain as major constituents Cu, Pb and Sn approximately in the ratio 90 : 4 : 3, whereas, those in latter days contain in ratio 7 : 2 : 0. Brass coins which had begun in 17 century contain as major constituents Cu, Zn and Pb approximately in the ratio 7 : 1 : 1. The multivariate data have been analyzed for the relation among elemental contents through the variance-covariance matrix. The data have been further analyzed by a principal component mapping method. As the results training set of 8 class have been chosen, based on the spread of sample points in an eigen vector plot and archaeological data such as age and the office of minting. The training set and test set of samples have finally been analyzed for the assignment to certain classes or outliers through the statistical isolinear multiple component analysis (SIMCA).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.4
• /
• pp.772-780
• /
• 2008

K-means is one of the simplest unsupervised learning algorithms that solve the clustering problem. However K-means suffers the basic shortcoming: the number of clusters k has to be known in advance. In this paper, we propose extensions of X-means, which can estimate the number of clusters using Bayesian information criterion(BIC). We introduce two different versions of algorithm: modified X-means(MX-means) and generalized X-means(GX-means), which employ one full covariance matrix for one cluster and so can estimate the number of clusters efficiently without severe over-fitting which X-means suffers due to its spherical cluster assumption. The algorithms start with one cluster and try to split a cluster iteratively to maximize the BIC score. The former uses K-means algorithm to find a set of optimal clusters with current k, which makes it simple and fast. However it generates wrongly estimated centers when the clusters are overlapped. The latter uses EM algorithm to estimate the parameters and generates more stable clusters even when the clusters are overlapped. Experiments with synthetic data show that the purposed methods can provide a robust estimate of the number of clusters and cluster parameters compared to other existing top-down algorithms.

• The Journal of the Acoustical Society of Korea
• /
• v.27 no.5
• /
• pp.221-228
• /
• 2008

To estimate array shape with reference sources in SONAR systems, nearfield signal modeling is required for the reference sources near a towed array. Array shape estimation method based on the nearfield signal modeling generally exploits the spatial covariance matrix of the received reference sources. Among those method, nearfield eigenvector method uses the eigenvector corresponding to the maximum eigenvalue as a steering vector of the reference source. In this paper, we propose a simplified subspace fitting method based on the nearfield signal modeling with spherical wave modeling. Furthermore, we analyze performance of the array shape estimation methods based on the nearfield signal modeling for various environments. The results of the numerical experiments indicate that the simplified subspace fitting method and the nearfield eigenvector method with single reference source shows almost similar performance. Furthermore, the simplified subspace fitting method with 2 reference sources consistently estimates the shape of the array regardless of the incident angle of the reference sources, whereas the nearfield eigenvector method cannot apply for the case of 2 reference sources.