• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.38 no.6
• /
• pp.623-633
• /
• 2020

As the time spent in indoor space has increased, the demand for services targeting indoor spaces also continues to increase. To provide indoor spatial information services, the construction of indoor spatial information should be done first. In the study, a method of generation IndoorGML, which is the international standard data format for Indoor space, from existing BIM data. The characteristics of IFC objects were investigated, and objects that need to be converted to IndoorGML were selected and classified into objects that restrict the expression of Indoor space and internal passages. Using the proposed method, a part of data set provided by the BIMserver github and the IFC model of the 21st Century Building in University of Seoul were used to perform experiments to generate PrimalSpaceFeatures of IndoorGML. As a result of the experiments, the geometric information of IFC objects was represented completely as IndoorGML, and it was shown that NavigableBoundary, one of major features of PrimalSpaceFeatures in IndoorGML, was accurately generated. In the future, the proposed method will improve to generate various types of objects such as IfcStair, and additional method for automatically generating MultiLayeredGraph of IndoorGML using PrimalSpaceFeatures should be developed to be sure of completeness of IndoorGML.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.6
• /
• pp.1051-1060
• /
• 2009

In this paper, we give topological properties of collection of prime ideals in 2-primal near-rings. We show that Spec(N), the spectrum of prime ideals, is a compact space, and Max(N), the maximal ideals of N, forms a compact $T_1$-subspace. We also study the zero-divisor graph $\Gamma_I$(R) with respect to the completely semiprime ideal I of N. We show that ${\Gamma}_{\mathbb{P}}$ (R), where $\mathbb{P}$ is a prime radical of N, is a connected graph with diameter less than or equal to 3. We characterize all cycles in the graph ${\Gamma}_{\mathbb{P}}$ (R).

• Journal of applied mathematics & informatics
• /
• v.34 no.1_2
• /
• pp.19-34
• /
• 2016

In this paper, we present a split least-squares characteristic mixed finite element method(MFEM) to get the approximate solutions of the convection dominated Sobolev equations. First, to manage both convection term and time derivative term efficiently, we apply a least-squares characteristic MFEM to get the system of equations in the primal unknown and the flux unknown. Then, we obtain a split least-squares characteristic MFEM to convert the coupled system in two unknowns derived from the least-squares characteristic MFEM into two uncoupled systems in the unknowns. We theoretically prove that the approximations constructed by the split least-squares characteristic MFEM converge with the optimal order in L² and H¹ normed spaces for the primal unknown and with the optimal order in L² normed space for the flux unknown. And we provide some numerical results to confirm the validity of our theoretical results.

• East Asian mathematical journal
• /
• v.35 no.5
• /
• pp.569-587
• /
• 2019

In this paper, we consider a split least-squares characteristic mixed element method for Sobolev equations with a convection term. First, to manipulate both convection term and time derivative term efficiently, we apply a characteristic mixed element method to get the system of equations in the primal unknown and the flux unknown and then get a least-squares minimization problem and a least-squares characteristic mixed element scheme. Finally, we obtain a split least-squares characteristic mixed element scheme for the given problem whose system is uncoupled in the unknowns. We prove the optimal order in $L^2$ and $H^1$ normed spaces for the primal unknown and the suboptimal order in $L^2$ normed space for the flux unknown.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.1
• /
• pp.27-39
• /
• 2005

Implicit surfaces are geometric shapes which are defined by implicit functions and exist in three-dimensional space. Recently, implicit surfaces have received much attention in solid modeling applications because they are easy to represent the location of points and to use boolean operations. However, it is difficult to chart points on implicit surfaces for rendering. As efficient rendering method of implicit surfaces, the original Adaptively Sampled Distance Fields (ADFs) $method^{[1]}$ is to use sampled distance fields which subdivide the three dimensional space of implicit surfaces into many cells with high sampling rates in regions where the distance field contains fine detail and low sampling rates where the field varies smoothly. In this paper, in order to maintain the sharp features efficiently with small number of cells, an extended ADFs method is proposed, applying the Dual/Primal mesh optimization $method^{[2]}$ to the original ADFs method. The Dual/Primal mesh optimization method maintains sharp features, moving the vertices to tangent plane of implicit surfaces and reconstructing the vertices by applying a curvature-weighted factor. The proposed extended ADFs method is applied to several examples of implicit surfaces to evaluate the efficiency of the rendering performance.

• Korean Journal of Mathematics
• /
• v.26 no.3
• /
• pp.467-481
• /
• 2018

In this paper we present a postprocessing scheme for the Raviart-Thomas mixed finite element approximation of the second order elliptic eigenvalue problem. This scheme is carried out by solving a primal source problem on a higher order space, and thereby can improve the convergence rate of the eigenfunction and eigenvalue approximations. It is also used to compute a posteriori error estimates which are asymptotically exact for the $L^2$ errors of the eigenfunctions. Some numerical results are provided to confirm the theoretical results.

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.759-772
• /
• 2012

In this paper, semi-infinite constrained programming, a class of constrained nonsmooth optimization problems, are transformed into unconstrained nonsmooth convex programs under the help of exact penalty function. The unconstrained objective function which owns the primal-dual gradient structure has connection with $\mathcal{VU}$-space decomposition. Then a $\mathcal{VU}$-space decomposition method can be applied for solving this unconstrained programs. Finally, the superlinear convergence algorithm is proved under certain assumption.

• International Journal of Aeronautical and Space Sciences
• /
• v.9 no.2
• /
• pp.79-86
• /
• 2008

High performance direct-iterative hybrid linear solver for large scale finite element problem is developed. Direct solution method is robust but difficult to parallelize, whereas iterative solution method is opposite for direct method. Therefore, combining two solution methods is desired to get both high performance parallel efficiency and numerical robustness for large scale structural analysis problems. Hybrid method mentioned in this paper is based on FETI-DP (Finite Element Tearing and Interconnecting-Dual Primal method) which has good parallel scalability and efficiency. It is suitable for fourth and second order finite element elliptic problems including structural analysis problems. We are using the hybrid concept of theses two solution method categories, combining the multifrontal solver into FETI-DP based iterative solver. Hybrid solver is implemented for our general structural analysis code, IPSAP.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.3
• /
• pp.561-567
• /
• 2010

Multiclassification is typically performed using voting scheme methods based on combining a set of binary classifications. In this paper we use multiclassification method with a hat matrix of least squares support vector machine (LS-SVM), which can be regarded as the revised one-against-all method. To tackle multiclass problems for large data, we use the $Nystr\ddot{o}m$ approximation and the quadratic Renyi entropy with estimation in the primal space such as used in xed size LS-SVM. For the selection of hyperparameters, generalized cross validation techniques are employed. Experimental results are then presented to indicate the performance of the proposed procedure.

• East Asian mathematical journal
• /
• v.33 no.1
• /
• pp.83-102
• /
• 2017

The main purpose of this paper is to introduce a pair new class of primal and dual problem associated with an operator. We prove the sufficient optimality theorem, weak duality theorem and strong duality theorem for these problems. The equivalence between the generalized optimization problems and the generalized variational inequality problems is studied in ordered topological vector space modeled in Hilbert spaces. We introduce the concept of partial differential associated (PDA)-operator, PDA-vector function and PDA-antisymmetric function to show the existence of a new class of function called, ($T_{\eta};{\xi}_{\theta}$)-invex functions. We discuss first and second kind of ($T_{\eta};{\xi}_{\theta}$)-invex functions and establish their existence theorems in ordered topological vector spaces.