• Journal of Intelligence and Information Systems
• /
• v.9 no.3
• /
• pp.99-115
• /
• 2003

In this paper, we present a knowledge-based object-oriented spatial database system called KOBOS. A knowledge-based approach is introduced to the object-oriented spatial database system for data modeling and approximate query answering. For handling the structure of spatial objects and the approximate spatial operators, we propose three levels of object-oriented data model: (1) a spatial shape model; (2) a spatial object model; (3) an internal description model. We use spatial type abstraction hierarchies(STAHs) to provide the range of the approximate spatial operators. We then propose SOQL, a spatial object-oriented query language. SOQL provides an integrated mechanism for the graphical display of spatial objects and the retrieval of spatial and aspatial objects. To support an efficient hybrid query evaluation, we use the top-down spatial query processing method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.8
• /
• pp.1986-1992
• /
• 2009

A user often searches a data by inputting a variant such as the abbreviation or substring of a word, or a misspelled word. The simple approach to the searching for variants is to build a variants dictionary. However, it entails enormous cost and time and can not handle variants by misspelling. Approximate searching, searching by approximate string matching, is a good approach to the searching. A problem in the approach is that it cannot handle variants by abbreviations. This paper propose a method for searching various variants including abbreviations and misspelled words, by using the trie indexing. First, this paper shows a variant matching method with the calculation of path weighted-metric. In addition, it provides variant searching algorithm to reduce the search time.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.6_2
• /
• pp.593-605
• /
• 2012

LiDAR systems provide dense and accurate topographic information. A pre-requisite to achieving the potential accuracy of LiDAR is having a proper system calibration, which aims at estimating all the systematic errors in the system measurements and the mounting parameters relating the different components. This paper presents a rigorous and two approximate methods for LiDAR system calibration. The rigorous approach makes use of the LiDAR equation and the system raw measurements. The approximate approaches utilize simplified LiDAR equations using some assumptions, which allow for less strict requirements regarding the raw measurements. The first presented approximate method, denoted as quasi-rigorous, assumes that we are dealing with a vertical platform (i.e., small pitch and roll angles). This method requires time-tagged point cloud and trajectory position data. The second approximate method, denoted as simplified, assumes that we are dealing with parallel strips, vertical platform, and minor terrain elevation variations compared to the flying height above ground. Such method can be performed using the LiDAR point cloud only. Experimental results using a real dataset, whose characteristics deviate to some extent from the utilized assumptions in the approximate methods, are presented to provide a comparative analysis of the outcome from the introduced methods.

• Journal for History of Mathematics
• /
• v.24 no.2
• /
• pp.1-15
• /
• 2011

Approximation is a very useful approach in mathematics research. It was the same in traditional Chinese and Chosun mathematics. This study derived five characteristics from approximation approaches which were found in Chinese and Chosun mathematical books: improvement of approximate values, common and inevitable use of approximate values, recognition of approximate values and their reasons, comparison of their exactness, application of approximate principles. Through these characteristics, we can infer what Chinese and Chosun mathematicians recognized approximate values and how they manipulated them. They took approximate approaches by necessity or for the sake of convenience in mathematical study and its applications. Also, they tried to improve the degree of exactness of approximate values and use the inverse calculations to check them.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.4
• /
• pp.97-109
• /
• 1998

In this paper, we propose a new approach to solve stochastic fluid flow models applied to the analysis of ceil loss of an ATM multiplexer. Existing stochastic fluid flow models have been analyzed by using linear differential equations. In case of large state space, however. analyzing stochastic fluid flow model without numerical errors is not easy. To avoid this numerical errors and to analyze stochastic fluid flow model with large state space. we develope a new computational algorithm. Instead of solving differential equations directly, this approach uses iterative and numerical method without calculating eigenvalues. eigenvectors and boundary coefficients. As a result, approximate solutions and upper and lower bounds are obtained. This approach can be applied to stochastic fluid flow model having general Markov chain structure as well as to the superposition of heterogeneous ON-OFF sources it can be extended to Markov process having non-exponential sojourn times.

• Communications for Statistical Applications and Methods
• /
• v.14 no.3
• /
• pp.507-516
• /
• 2007

Multinomial logistic regression is probably the most popular representative of probabilistic discriminative classifiers for multiclass classification problems. In this paper, a kernel variant of multinomial logistic regression is proposed by combining a Newton's method with a bound optimization approach. This formulation allows us to apply highly efficient approximation methods that effectively overcomes conceptual and numerical problems of standard multiclass kernel classifiers. We also provide the approximate cross validation (ACV) method for choosing the hyperparameters which affect the performance of the proposed approach. Experimental results are then presented to indicate the performance of the proposed procedure.

• Journal of Korean Society for Quality Management
• /
• v.18 no.2
• /
• pp.25-32
• /
• 1990

This paper presents an approximate algorithm for computing Fault-tree probabilities. The method is essentially composed of three steps. In the first step, a Fault-tree is converted into a network form. In the second step, We change the network into a parallelized diagram. In the third step, the approximate fault-tree probability is calculated from the parallelized diagram. In this paper, in order to verify the method two hypothetical Fault-tree is used by examples. The results show that the method is very useful, even though it is an approximate technique, since it needs not to search the minimal cut sets and has the simple computing rontines.

• Structural Engineering and Mechanics
• /
• v.3 no.4
• /
• pp.359-372
• /
• 1995

This study presents an efficient method for optimum design of plate and shell structures, when the design variables are continuous or discrete. Both sizing and shape design variables are considered. First the structural responses such as element forces are approximated in terms of some intermediate variables. By substituting these approximate relations into the original design problem, an explicit nonlinear approximate design task with high quality approximation is achieved. This problem with continuous variables, can be solved by means of numerical optimization techniques very efficiently, the results of which are then used for discrete variable optimization. Now, the approximate problem is converted into a sequence of second level approximation problems of separable form and each of which is solved by a dual strategy with discrete design variables. The approach is efficient in terms of the number of required structural analyses, as well as the overall computational cost of optimization. Examples are offered and compared with other methods to demonstrate the features of the proposed method.

• Structural Engineering and Mechanics
• /
• v.43 no.2
• /
• pp.211-223
• /
• 2012

This paper deals with large deformation post-buckling of a linear-elastic and hygrothermal beam with axially nonmovable pinned-pinned ends and subjected to a significant increase in swelling by an alternative method. Analytical approximate solutions for the geometrically nonlinear problem are presented. The solution for the limiting case of a string is also obtained. By coupling of the well-known Maclaurin series expansion and orthogonal Chebyshev polynomials, the governing differential equation with sinusoidal nonlinearity can be reduced to form a cubic-nonlinear equation, and supplementary condition with cosinoidal nonlinearity can also be simplified to be a polynomial integral equation. Analytical approximations to the resulting boundary condition problem are established by combining the Newton's method with the method of harmonic balance. Two approximate formulae for load along axis, potential strain for free hygrothermal expansion and periodic solution are established for small as well as large angle of rotation at the end of the beam. Illustrative examples are selected and compared to "reference" solution obtained by the shooting method to substantiate the accuracy and correctness of the approximate analytical approach.

• Communications for Statistical Applications and Methods
• /
• v.27 no.2
• /
• pp.255-268
• /
• 2020

A mixture of multivariate canonical fundamental skew t-distribution (CFUST) has been of interest in various fields. In particular, interest in the unsupervised learning society is noteworthy. However, fitting the model via EM algorithm suffers from significant processing time. The main cause is due to the calculation of many multivariate t-cdfs (cumulative distribution functions) in E-step. In this article, we provide an approximate, but fast calculation method for the in univariate fashion, which is the product of successively conditional univariate t-cdfs with Taylor's first order approximation. By replacing all multivariate t-cdfs in E-step with the proposed approximate versions, we obtain the admissible results of fitting the model, where it gives 85% reduction time for the 5 dimensional skewness case of the Australian Institution Sport data set. For this approach, discussions about rough properties, advantages and limits are also presented.