• Journal of Korean Philosophical Society
• /
• v.116
• /
• pp.437-464
• /
• 2010

The article, focusing on the theory of Zhong-He, sheds a new light on the philosophy of Daizhen. The theory of Zhong-He, according to the philosophical system of Zhuxi, serves as the theoretical foundation in erecting the apriori moral nature and guiding mental cultivation of subjects. Daizhen, on the contrary, criticizes the doctrine of Zhonghe in Zhuxi's philosophy as it produces negative side-effects of moral dogmatism. Zhuxi's doctrine, according to Daizhen, as it reduce the origin of morality to apriori condition of consciousness and delimit the range of cultivation to psychological realm of subjects, restricts moral subjects in the fortress of their own subjectivity. In this vein of his criticism, Daizhen attempts new interpretation on Zhonghe. The character Zhong (中), according to him, does not refer to apriori moral state or metaphysical moral substance as it does in the doctrine of Zhuxi. On the contrary, it denotes the state in which diverse existent beings are placed in their own position by their own dispositions. Similarly, the other character He (和) does not refer to the condition where an individual's consciousness is in equilibrium, but to the process of achieving the harmony of entire society in which diverse existent beings are communicating to each other. With his novel interpretation of the theory of Zhong-He, Daizhen could dissolve the tradition of Weifa (未發) and moral subjectivism in Zhuxi's philosophy and provide a way of establishing reciprocal communication and harmony between various individuals. It is in his ethics of rational mutual understanding where the significance of Daizhen's philosophy should be found.

• Journal of Korean Library and Information Science Society
• /
• v.52 no.3
• /
• pp.287-311
• /
• 2021

It is not easy for information users to find books that are suitable for them in a knowledge information society. There is a growing need for libraries to break away from traditional services and provide user-tailored recommendation services, but there are few qualitative studies on user satisfaction so far. In this study, a user-customized book recommendation was performed by applying Apriori, a correlation analysis algorithm, and satisfaction factors were analyzed in depth through interviews. The experimental data was the loan data of 100 people who used the most frequently used loan data for 10 years from 2009 to 2019 of the S library in Seoul. The interviewees of the experiment were those who could be interviewed in depth. After the correlation analysis, the concepts and categories derived by analyzing the interview data were 59 concepts, 6 sub-categories, and 2 upper categories, respectively. The upper categories were 'reading' and 'book recommendation service'. In the 'reading' category, there were 16 concepts of motivation for reading, 8 concepts of preferred books, and 12 concepts of expected effects. Also, in the category of 'reading recommendation service', there were 10 'reflection factors', 4 'reflection methods', and 9 'satisfaction factors'.

• The Journal of the Korea Contents Association
• /
• v.21 no.2
• /
• pp.121-129
• /
• 2021

In this study, we try to minimize the tariff risk by constructing a hazardous cargo screening model by applying Association Rule Mining, one of the data mining techniques. For this, the risk level between supply chains is calculated using the Apriori Algorithm, which is an association analysis algorithm, using the big data of the import declaration form of the Korea Customs Service(KCS). We perform data preprocessing and association rule mining to generate a model to be used in screening the supply chain. In the preprocessing process, we extract the attributes required for rule generation from the import declaration data after the error removing process. Then, we generate the rules by using the extracted attributes as inputs to the Apriori algorithm. The generated association rule model is loaded in the KCS screening system. When the import declaration which should be checked is received, the screening system refers to the model and returns the confidence value based on the supply chain information on the import declaration data. The result will be used to determine whether to check the import case. The 5-fold cross-validation of 16.6% precision and 33.8% recall showed that import declaration data for 2 years and 6 months were divided into learning data and test data. This is a result that is about 3.4 times higher in precision and 1.5 times higher in recall than frequency-based methods. This confirms that the proposed method is an effective way to reduce tariff risks.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.2
• /
• pp.197-203
• /
• 2006

This paper addresses dynamic modeling and task-space trajectory following issues for nonholonomic mobile manipulators moving on a slope. An integrated dynamic modeling method is proposed considering nonholonomic constraints and interactive motions. An adaptive neural-fuzzy controller is presented for end-effector trajectory following, which does not rely on precise apriori knowledge of dynamic parameters and can suppress bounded external disturbances. Effectiveness of the proposed algorithm is verified through simulations.

• ETRI Journal
• /
• v.10 no.1
• /
• pp.39-52
• /
• 1988

This study suggests the diffusion models to predict the spread pattern of telecommunications services. The extended models containing both (either) price and (or) income varible are offered on the basis of Bass model. At the empirical test using Korean telephone data, the models with either price or income varible are the best forecasting model under apriori selected econometric criteria.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.136-139
• /
• 2002

연관규칙 마이닝과정에서의 빈발항목 탐색의 대표적인 방법으로 알려진 Apriori 알고리즘의 성능을 향상시키기 위한 많은 연구가 진행되어 왔다. 본 논문에서는 트랜잭션 데이터베이스(TDB)에서 생성되는 각 패스의 k-itemset들에 대해 각각 트랜잭션 ID List(TIDist)를 유지하고 이를 이용해 (k+1)-itemset을 효율적으로 찾아내는 방법을 제안한다. 이 방법은 frequent (k+1)-itemset(k>0)의 빈도수 및 TIDList를 TDB 에 대한 스캔이 전혀 없이 k-itemset의 TIDList로부터 직접 구한다. 이는 빈발항목집합을 찾기 위한 탐색 complexity는 크게 줄여줄 뿐 아니라 시간 변화에 따른 빈발항목집합의 분포 정보를 제공해 준다.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.4
• /
• pp.380-385
• /
• 1990

This Paper presents a general algorithm for the parameter estimation of an antoregressive moving average process observed in additive white noise. The algorithm is based on the Gauss-Newton recursive prediction error method. For the parameter estimation, the output measurement is modelled as an innovation process using the spectral factorization, so that noise free RPE ARMA estimation can be used. Using apriori known properties leads to algorithm with smaller computation and better accuracy be the parsimony principle. Computer simulation examples show the effectiveness of the proposed algorithm.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.10
• /
• pp.52-58
• /
• 1997

In this paper, we consider methods of robust stabilization of the interval plant with a PID controller. Suppose that we know apriori a sign of the coefficients of the numerator of the PID controller. Under this condition, it sufficies to make eight polynomials stable for robust stabilization of the interval plant with a minimum phase PID controller. In addition, with a nonminimum phase PID controller, it suffices to make different eight polynomials stable. Especially, with the nonminimum phase PID controller it is shown that stabilization of eight plants is necessary and sufficient for robust stabilization of the interval plants.

• Journal of applied mathematics & informatics
• /
• v.6 no.1
• /
• pp.51-64
• /
• 1999

We give a new characterization of the solutions set of the general (inconsistent) linear least-squares problem using the set of linit-points of an extended version of the classical Daczmarz's pro-jections method. We also obtain a "step error reduction formula" which in some cases can give us apriori information about the con-vergence properties of the algorithm. Some numerical experiments with our algorithm and comparisons between it and others existent in the literature are made in the last section of the paper.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.15-18
• /
• 2005

데이터베이스로부터 유용한 정보를 얻기 위해서 데이터마이닝을 사용하는데 많은 데이터들을 다루기 위해서는 좀 더 나은 성능의 데이터마이닝 기법이 필요하다. 연관규칙을 생성하는 기존의 Apriori 알고리즘은 많은 데이터베이스 접근과 많은 조인 횟수로 인하여 수행 속도의 저하를 가져오게 된다. 이를 개선하기 위하여 본 논문에서는 새로운 클러스터링 방법을 이용하여 클러스터링을 수행하고 각 클러스터의 연관규칙을 생성하게 된다. 본 연구의 방법을 이용하게 되면 기존 연관규칙 알고리즘으로 찾지 못했던 규칙도 생성가능하다.