• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.7
• /
• pp.370-379
• /
• 2020

The purpose of this study is to estimate the longitudinal changes in the academic achievement of Korean adolescents who transition from elementary to middle school and examine the individual and social factors of the changes using piecewise growth modeling. For this study, the Multicultural Adolescents Panel Study (MAPS) data from 1st to 6th waves (4th-9th grade) were used. The results are as follows. First, the results showed that the piecewise growth function was the most appropriate method to explain changes in the academic achievement of Korean adolescents with respect to the time of vacation. Second, adolescents' academic achievement declined constantly and was greater for middle school students. Third, parental efficacy, self-esteem, and support from friends had a significant positive effect, while uninvolved parenting and acculturation stress had a significant negative effect on the initial value of academic achievement. Self-esteem and support from friends in the 4th grade prohibit its decline in the first change rate of academic achievements. Meanwhile, acculturation stress for 4th-grade students accelerates the decline of academic achievement.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.67-69
• /
• 2001

다중스레드 모델은 긴 메모리 참조 지체 시간과 동기화의 문제점을 해결할 수 있다는 점에서 대규모 병렬 시스템에 매우 효과적이다. 다중스레드 병렬기계를 위하여 Non-Strict 함수 프로그램을 번역할 때 가장 중요한 것은 순차적으로 수행될 수 있는 부분을 찾아내어 스레드로 분할하는 것이다. 스레드 분할의 목적은 스레드의 크기를 크게 만들어 Non-Strict 함수 프로그램이 수행되는 동안 발생하는 동기화 횟수와 스레드간의 문맥 전환 횟수를 최소화하는 것이다. 본 논문에서는 Non-Strict 함수 프로그램을 보다 큰 스레드로 분할하는 조건식의 스레드 분할 알고리즘을 제안한다.

• Journal of Digital Convergence
• /
• v.12 no.4
• /
• pp.277-283
• /
• 2014

Fuzzy modeling is generally using the given data and the fuzzy rules are established by the input variables and the space division by selecting the input variable and dividing the input space for each input variables. The premise part of the fuzzy rule is presented by selection of the input variables, the number of space division and membership functions and in this paper the consequent part of the fuzzy rule is identified by polynomial functions in the form of linear inference and modified quadratic. Parameter identification in the premise part devides input space Min-Max method using the minimum and maximum values of input data set and C-Means clustering algorithm forming input data into the hard clusters. The identification of the consequence parameters, namely polynomial coefficients, of each rule are carried out by the standard least square method. In this paper, membership function of the premise part is dividing input space by using trapezoid-type membership function and by using gas furnace process which is widely used in nonlinear process we evaluate the performance.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.49-57
• /
• 2012

Conventional fuzzy c-means (FCM) algorithms have achieved a good clustering performance. However, they do not fully utilize the spatial information in the image and this results in lower clustering performance for images that have low contrast, vague boundaries, and noises. To overcome this issue, we propose an enhanced spatial fuzzy c-means (ESFCM) algorithm that takes into account the influence of neighboring pixels on the center pixel by assigning weights to the neighbors in a $3{\times}3$ square window. To evaluate between the proposed ESFCM and various FCM based segmentation algorithms, we utilized clustering validity functions such as partition coefficient ($V_{pc}$), partition entropy ($V_{pe}$), and Xie-Bdni function ($V_{xb}$). Experimental results show that the proposed ESFCM outperforms other FCM based algorithms in terms of clustering validity functions.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.721-724
• /
• 2006

This paper presents a method of the constructing the digital logic switching functions and realizing the circuit design using partition techniques. First of all, we introduce the necessity, background and concepts of the partition design techniques for the digital logic systems. Next, we discuss the definitions that are used in this paper. For the purpose of the circuit design for the digital logic switching functions, we discuss the extraction of the partition functions. Also we describe the construction method of the building block, that is called the building block, based on each partition functions. And we apply the proposed method to the example, and we compare the results with the results of the earlier methods. In result, we describe the control functions, it means that we obtain the effective cost in the digital logic design for any other earlier methods.

• Journal of the Korea Convergence Society
• /
• v.7 no.5
• /
• pp.213-219
• /
• 2016

This paper presents a branch-and-bound algorithm for solving the concave minimization problem with upper bounded variables whose single constraint is linear. The algorithm uses simplex as partition element. Because the convex envelope which most tightly underestimates the concave function on the simplex is uniquely determined by solving the related linear equations. Every branching process generates two subsimplices one lower dimensional than the candidate simplex by adding 0 and upper bound constraints. Subsequently the feasible points are partitioned into two sets. During the bounding process, the linear programming problems defined over subsimplices are minimized to calculate the lower bound and to update the incumbent. Consequently the simplices which do certainly not contain the global minimum are excluded from consideration. The major advantage of the algorithm is that the subproblems are defined on the one less dimensinal space. It means that the amount of work required for the subproblem decreases whenever the branching occurs. Our approach can be applied to solving the concave minimization problems under knapsack type constraints.

• The Korean Journal of Applied Statistics
• /
• v.30 no.3
• /
• pp.335-344
• /
• 2017

This paper discusses a method of analyzing data from split-plot experiments by projections. The assumed model for data has two experimental errors due to two different experimental sizes and some random components in treatment effects. Residual random models are constructed to obtain sums of squares due to random effects. Expectations of sums of squares are obtained by Hartley's synthesis. Estimable functions of fixed effects are discussed.

• Journal of KIISE:Software and Applications
• /
• v.35 no.9
• /
• pp.547-553
• /
• 2008

We propose a two-stage document layout segmentation method. At the first stage, as top-down segmentation, morphological distance map algorithm extracts a collection of rectangular regions from a given input image. This preliminary result from the first stage is employed as input parameters for the process of next stage. At the second stage, a machine-learning algorithm is adopted RBF network, one of neural networks based on statistical model, is selected. In order for constructing the hidden layer of RBF network, a data clustering technique bared on the self-organizing property of Kohonen network is utilized. We present a result showing that the supervised neural network, trained by 300 number of sample data, improves the preliminary results of the first stage.

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.1889-1890
• /
• 2008

본 연구에서는 퍼지 추론 메커니즘에 기반 한 Polynomial RBF Neural Network(p-RBFNN)를 설계하고 얼굴인식 문제로 적용하여 분류기로서의 성능을 분석한다. 제안된 p-RBFNN 구조는 FCM 클러스터링에 기반 한 분할 함수를 활성 함수로 사용하며, 다항식 함수로 구성된 연결가중치를 사용함으로서 기존 신경회로망 분류기의 선형적인 특성을 개선한다. p-RBFNN 구조는 언어적 해석관점에서 "If-then"의 퍼지 규칙으로 표현되며 퍼지 추론 메커니즘에 의해 구동된다. 즉 조건부, 결론부, 추론부 세 가지의 기능적 모듈로 나뉘어 네트워크 구조가 형성된다. 조건부는 FCM 클러스터링을 사용하여 입력 공간을 분할하고, 결론부는 분할된 로컬 영역을 다항식 함수로 표현한다. 마지막으로, 네트워크의 최종출력은 추론부의 퍼지추론에 의한다. 또한 제안된 p-RBFNN을 얼굴인식 문제로 적용하여 성능을 분석한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06c
• /
• pp.178-180
• /
• 2006

임베디드 시스템이 복잡해지고 Time-to-Market이 요구되면서 HW/SW 통합설계 방법론(codesign)이 제시되었다. 통합설계 과정 중, HW/SW 분할 과정은 시간 성능, 비용, 전력 등의 모든 요구사항을 만족시키기는 불가능하므로 특정 목적함수에 근거한 알고리즘을 이용하여 진행된다. 하지만 고정된 분할 알고리즘을 이용해서는 이해관계자들의 요구사항을 최대한 반영하기 어렵다. 본 논문에서는 이해관계자들의 의견을 최대한 반영하고, 이를 만족시키는 모델을 유도하기 위하여 WinWin negotiation model을 적용된 요구사항 절충을 고려한 HW/SW 분할 방법론을 제안하였다. WinWin 모델을 통해서 도출된 요구사항에 가장 적합한 목적함수를 가지는 분할 알고리즘을 선택하여 HW/SW 분할 과정을 진행하는 방법이다.