• International journal of advanced smart convergence
• /
• v.8 no.2
• /
• pp.94-101
• /
• 2019

Building a stable knowledge base is an important issue in the application of knowledge engineering. In this paper, we present an algorithm for detecting and locating discrepancies in the line of the reasoning process especially when discrepancies occur on belief values. This includes backtracking the rule firing from a goal node of the rule network. Retracting a belief function allows the current belief state to move back to another belief state without the rule firing. It also gives an estimate, called contribution measure, of how much the rule has an impact on the current belief state. Examining the measure leads the expert to locate the possible cause of problem in the rule. For non-monotonic reasoning, the belief retraction method moves the belief state back to the previous state. A tracing algorithm is presented to identify and locate the cause of problem. This also gives repair suggestions for rule refinement.

• Journal of the Korea Convergence Society
• /
• v.9 no.12
• /
• pp.9-15
• /
• 2018

The main goal of extended data expression is to develop a data structure suitable for common problems in ubiquitous environments. The greatest feature of this method is that the attribute values can be represented with probability. The next feature is that each event in the training data has a weight value that represents its importance. After this data structure has been developed, an algorithm has been devised that can learn it. In the meantime, this algorithm has been applied to various problems in various fields to obtain good results. This paper first introduces the extended data expression technique, UChoo, and rule refinement method, which are the theoretical basis. Next, this paper introduces some examples of application areas such as rule refinement, missing data processing, BEWS problem, and ensemble system.

• Journal of the Korean Ceramic Society
• /
• v.40 no.4
• /
• pp.371-374
• /
• 2003

Various types of equation for mixing rule on permittivity of mixture have been proposed, but none of these is not perfect because of the inconsistency between the actual geometrical configuration and the basic model for calculation. Serial model and parallel model are lower and upper extremes of mixing manner, the apparent permittivity of any other type of mixture stay between these two extreme states. For the random mixture of the stumpy fine particles, customarily the logarithmic mixing rule has been applied. But, the logarithmic mixing rule does not give the proper value of permittivity in low or high mixing rate of constituent. The author proposed the new mixing rule that gives better consistency with measured value in whole mixing range compared to the logarithmic rule. In this paper, a desirable refinement on the equation proposed in the previous paper is made to adapt to thr configuration image of actual compound and then the equation has been expanded to the complex permittivity to apply the mixing rule on the dissipative materials cases.

• Structural Engineering and Mechanics
• /
• v.43 no.3
• /
• pp.349-370
• /
• 2012

Variable-node finite element families, termed (4 + k + l + m + n)-node elements with an arbitrary number of nodes (k, l, m, and n) on each of their edges, are developed based on the generic point interpolation with special bases having slope discontinuities in two-dimensional domains. They retain the linear interpolation between any two neighboring nodes, and passes the standard patch test when subdomain-wise $2{\times}2$ Gauss integration is employed. Their shape functions are automatically generated on the master domain of elements although a certain number of nodes are inserted on their edges. The elements can provide a flexibility to resolve nonmatching mesh problems like mesh connection and adaptive mesh refinement. In the case of adaptive mesh refinement problem, so-called "1-irregular node rule" working as a constraint in performing mesh adaptation is relaxed by adopting the variable-node elements. Through several examples, we show the performance of the variable-node finite elements in terms of accuracy and efficiency.

• Architectural research
• /
• v.16 no.2
• /
• pp.57-65
• /
• 2014

A study on the static analysis of Timoshenko beams is presented. A beam element is developed by using isogeometric approach based on Timoshenko beam theory which allows the transverse shear deformation. The identification of transverse shear locking is conducted by three refinement schemes such as h-, p- and k-refinement and compared to other reference solutions. From numerical examples, the present beam element does not produce any shear locking in very thin beam situations even with full Gauss integration rule. Finally, the benchmark tests described in this study is provided as future reference solutions for Timoshenko beam problems based on isogeometric approach.

• Wind and Structures
• /
• v.1 no.1
• /
• pp.111-125
• /
• 1998

This paper deals with the development of variable-node element and its application to the adaptive h-version mesh refinement-recovery for the incompressible viscous flow analysis. The element which has variable mid-side nodes can be used in generating the transition zone between the refined and unrefined element and efficiently used for the construction of a refined mesh without generating distorted elements. A modified Guassian quadrature is needed to evaluate the element matrices due to the discontinuity of derivatives of the shape functions used for the element. The penalty function method which can reduce the number of the independent variables is adopted for the purpose of computational efficiency and the selective reduced integration is carried out for the convection and pressure terms to preserve the stability of solution. For the economical analysis of transient problems in which the locations to be refined are changed in accordance with the dynamic distribution of velocity gradient, not only the mesh refinement but also the mesh recovery is needed. The numerical examples show that the optimal mesh for the finite element analysis of a wind around the structures can be obtained automatically by the proposed scheme.

• Journal of the Korea Convergence Society
• /
• v.8 no.2
• /
• pp.27-33
• /
• 2017

To efficiently provide cloud computing services to users over the Internet, IT resources must be configured in the data center based on virtualization and distributed computing technology. This paper focuses specifically on the problem that new training data can be added at any time in a wide range of fields, and new attributes can be added to training data at any time. In such a case, rule generated by the training data with the former attribute set can not be used. Moreover, the rule can not be combined with the new data set(with the newly added attributes). This paper proposes further development of the new inference engine that can handle the above case naturally. Rule generated from former data set can be combined with the new data set to form the refined rule.

• Proceedings of the KSRS Conference
• /
• 1999.11a
• /
• pp.304-309
• /
• 1999

In this paper, we presents a new disparity map refinement algorithm using statistical characteristics of disparity map and edge information. The proposed algorithm generate a refined disparity map using disparity maps which are obtained from area and feature-based Stereo Matching by selecting a disparity value of edge point based on the statistics of both disparity maps. Experimental results on aerial stereo image show the better results than conventional fusion algorithms in the disparity error. This algorithm can be applied to the reconstruction of building image from the high resolution remote sensing data.

• Journal of KIISE:Software and Applications
• /
• v.27 no.11
• /
• pp.1082-1087
• /
• 2000

신경회로망 구조의 정제(精製)는 회로망의 일반화능력이나 효율성의 관점에서 중요한 문제이다. 본 논문에서는 feed-forward neural networks로부터 은닉지식을 추출하는 방법을 사용하여 네트워크 재구성을 통한 정제방법을 제안한다. 먼저, 효율적인 if-then rule 추출방법을 제시하고 그 추출된 룰들을 사용하여 룰기반 네트워크로 변환하는 과정을 보여준다. 생성된 룰기반 네트워크 fully connected network에 비하여 상당히 축소된 연결 복잡도를 가지게 되며 일반적으로 더 우수한 일반화능력을 가지게 된다. 본 연구는 도메인 지식이 없이 데이타만 사용하여 어떻게 정제된 룰기반 신경망회로를 생성하고 있는가를 보여준다. 도메인 데이타들에 대한 실험결과도 제시하였다.

• The Pure and Applied Mathematics
• /
• v.31 no.1
• /
• pp.33-48
• /
• 2024

In this study, we would like to state two refined results related to Hermite Hadamard type inequality for convex functions with two distinct techniques. Hence our obtained results would be better than the results already established for the class of convex functions. Applications to trapezoidal rule and special means are also discussed.