• Korean Journal of Computational Design and Engineering
• /
• v.11 no.6
• /
• pp.429-439
• /
• 2006

The purpose of this study is to support the integration from current 2D drawing-based design to future 3D model-based design. In this paper, an important theme is the combination between the STEP-based 2D drawing standards (i.e., AP202) and the IFC-based 3D building model standards. To achieve the purpose, two methodologies are proposed as follows: the development of IFC extension model for the 2D shape data representation by harmonizing ISO/STEP AP202; and the development of mapping solution between IFC 2D extension model and KOSDIC by constructing the exchange scenario for 2D shape data representation. It is expected that the proposed IFC2X2 2D extension model and mapping solution will offer the basis of development of the integrated standards model in AEC industry.

• Journal of the Chungcheong Mathematical Society
• /
• v.20 no.3
• /
• pp.287-296
• /
• 2007

Using the representation of the solution by means of the resolvent, we study the boundedness of the solutions of some Volterra difference equations.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.1
• /
• pp.13-17
• /
• 2003

A continuous solution of the Dirichlet boundary value problem for the heat equation $u_t$＝$a2u_{xx}$ using a fuzzy system is described. We first apply the Crank-Nicolson method to obtain a discrete solution at the grid points for the heat equation. Then we find a continuous function to represent approximately the discrete values at the grid points in the form of a bicubic spline function (equation omitted) that can in turn be represented exactly by a fuzzy system. We show that the computed values at non-grid points using the bicubic spline function is much smaller than the ones obtained by linear interpolations of the values at the grid points. We also show that the fuzzy rule table in the fuzzy system representation of the bicubic spline function can be viewed as a gray scale image. Hence, the fuzzy rules provide a visual representation of the functions of two variables where the contours of different levels for the function are shown in different gray scale levels

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.11 no.4
• /
• pp.143-150
• /
• 1991

This paper presents an overview of a system of computer programs for the solution of a large geodetic network of about 2,000 stations. The system arranges the matrices in systematic sparse form which is applied to observation equations of RR(C)U (Row-wise Representation Complete Unordered) type and to normal equations of RR(U)U (Row-wise Representation Upper Unordered) type. The solution is done by a Modified Cholesky's algorithm in view of large networks. The implementation program are tested in PC-386 by korean new secondary networks, the results show that the sparse techniques are highly useful to geodetic networks in core-storage management and processing time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.9
• /
• pp.3745-3761
• /
• 2020

Low-rank representation methods already achieve many applications in the image reconstruction. However, for high-gradient image patches with rich texture details and strong edge information, it is difficult to find sufficient similar patches. Existing low-rank representation methods usually destroy image critical details and fail to preserve edge structure. In order to promote the performance, a new representation-based image super-resolution reconstruction method is proposed, which combines gradient domain guided image filter with the structure-constrained low-rank representation so as to enhance image details as well as reveal the intrinsic structure of an input image. Firstly, we extract the gradient domain guided filter of each atom in high resolution dictionary in order to acquire high-frequency prior information. Secondly, this prior information is taken as a structure constraint and introduced into the low-rank representation framework to develop a new model so as to maintain the edges of reconstructed image. Thirdly, the approximate optimal solution of the model is solved through alternating direction method of multipliers. After that, experiments are performed and results show that the proposed algorithm has higher performances than conventional state-of-the-art algorithms in both quantitative and qualitative aspects.

• The Mathematical Education
• /
• v.45 no.3 s.114
• /
• pp.263-273
• /
• 2006

The purpose of this paper is to research the factors and the effects of immediacy in mathematics teaching and learning and mathematical problem solving. The factors of immediacy are visualization, functional fixedness and representatives. In special, students can apprehend immediately the clues and solution using the visual representation because of its properties of finiteness and concreteness. But the errors sometimes originate from visual representation which come from limitation of the visual representation. It suggests that students have to know conceptual meaning of the visual representation when they use the visual representation. And this phenomenon is the same in functional fixedness and representatives which are the factors of immediacy The methods which overcome the errors of immediacy is that problem solvers notice the limitation of the factors of immediacy and develop the meta-cognitive ability. And it means we have to emphasize the logic and the intuition in mathematical teaching and learning. Clearly, we can't solve all mathematical problems using only either the logic or the intuition.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.228-246
• /
• 2011

A 3D model based approach for a face representation and recognition algorithm has been investigated as a robust solution for pose and illumination variation. Since a generative 3D face model consists of a large number of vertices, a 3D model based face recognition system is generally inefficient in computation time and complexity. In this paper, we propose a novel 3D face representation algorithm based on a pixel to vertex map (PVM) to optimize the number of vertices. We explore shape and texture coefficient vectors of the 3D model by fitting it to an input face using inverse compositional image alignment (ICIA) to evaluate face recognition performance. Experimental results show that the proposed face representation and recognition algorithm is efficient in computation time while maintaining reasonable accuracy.

• Journal of Electrical Engineering and Technology
• /
• v.2 no.3
• /
• pp.312-319
• /
• 2007

The solution of the power flow is one of the most important problems in electrical power systems. These traditional methods such as Gauss-Seidel method and Newton-Raphson (NR) method have had drawbacks up to now such as initial values, abnormal operating solutions and divergences in heavy loads. In order to overcome theses problems, the power flow solution incorporating genetic algorithm (GA) is introduced in this paper. General operator of genetic algorithm, arithmetic crossover, and non-uniform mutation operator of GA are suggested to solve the power flow problem. While abnormal solution cannot be obtained by a NR method, multiple power flow solution can be obtained by a GA method. With a heavy load, both normal solution and abnormal solution can be obtained by a proposed method. In this paper, a floating number representation instead of the binary number representation is introduced for accuracy. Simulation results have been compared with traditional methods.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.493-496
• /
• 2000

We study the problem of designing at minimum cost a two-connected network topology such that the shortest cycle to which each edge belongs does not exceed a given maximum number of hops. This problem is considered as part of network planning and arises in the design of backbone networks. We propose a genetic algorithm approach that uses a solution representation, in which the connectivity and ring constraints can be easily encoded. We also propose a crossover operator that ensures a generated solution is feasible. By doing so, the checking of constraints is avoided and no repair mechanism is required. We carry out experimental evaluations to investigate the solution representation issues and GA operators for the network design problem.

• Journal of the Korean Statistical Society
• /
• v.34 no.3
• /
• pp.197-208
• /
• 2005

We consider the problem for approximate solution of linear stochastic evolution equations driven by infinite-dimensional fractional Brownian motion with Hurst parameter $H\;\in$ (0,1/2). The error of the approximate solution for the explicit Euler scheme is investigated.