• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2000.04b
• /
• pp.357-364
• /
• 2000

The three main processes involved in the design of stressed membrane surface are surface form-finding, stress analysis and cutting pattern generation. The last process, cutting pattern generation, is considered as a very important procedure in the aspect of the practical design for the fabric membrane surface. In this paper, The cutting pattern generation technique using the geodesic line algorithms is first introduced. And the numerical examples resulting from this technique are presented. Cable elements are used for the approximating membrane surface and two kinds of model, square line and central line model, are used in pattern generation. Finally, a number of different cutting pattern generation for the same membrane surface is carried out and the numerical results are compared each

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.33 no.5
• /
• pp.167-172
• /
• 1984

This paper describes the finite element analysis of magnetostatic field problems with permanent magnets. Two kinds of algorithms, one using the magnetic vector potential and the other using the magnetic scalar potential, are introduced. The magnetization of the pemanent magnet is used as the source instead of the magnetic equivalent current in both of the formulations using the magnetic vector potential and the magnetic scalar potential. A simple functional, which has only the region integral instead of the region integral and boundary integral, is derived in the formulation using the magnetic scalar potential. These make the formulation of the system equations simpler and more convenient than the conventional methods. The numerical results by the two proposed algorithms for a C-type permanent magnet model are compared with the analytic solutions respectively. The numerical results are in good agreement with the analytic solutions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.4
• /
• pp.895-905
• /
• 1999

This paper identifies a linear time-invariant mathematical model of each stand of a five-stand tandem cold mill to design a robust $H_\infty$ thickness controller by applying input and output data sets to N4SID (Numerical algorithms for Subspace State Space System Identification) method. The input-output data sets describe interstand interference in the process of tandem cold rolling and are obtained from a nonlinear simulator of the tandem cold mill. In result, it is shown that the identified model well approximates the nonlinear model than a Taylor linearized model. Furthermore, uncertainties including roll eccentricity and incoming strip variation are quantitatively analyzed from the plot of maximum singular values.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.1
• /
• pp.67-84
• /
• 1995

Five-axis NC machining is advanced machining technology by which highly geometrically complicated parts can be machined accurately with high machinability. In this paper, we investigate the problems of determining the machinability and part setup orientation for a given surface models. We first develop kinematic model of the five-axis machines based on the axis configuration, then develop algorithms for determining the feasibility of machining by one setup(machinability) and the part orientation for the C,A and A,B type configuration. The machinability is determined by computationally efficient procedure for finding the intersection between the feasible area on the sphere and the numerical map called binary spherical map(BSM), and the part setup is chosen such that the rotational range is minimized among the feasible configurations. The developed algorithms are tested by numerical simulations, convincing they can be readily implemented on the CAD/CAM system as an automated process planner giving the efficient machine type and setup for NC machining.

• International Journal of Contents
• /
• v.1 no.1
• /
• pp.1-5
• /
• 2005

This paper presents the development and application of electrical resistance imaging techniques for the visualization of two-phase flow fields. Two algorithms, the so-called the mesh grouping and the boundary estimation, are described for potential applications of electrical resistance tomography (ERT) and results from extensive numerical simulations are also presented. In the electrical resistance imaging for two-phase flows, numerical meshes fairly belonging to each phase can be grouped to improve the reconstruction performance. In many cases, the detection of phase boundary is a key subject and a mathematical model to estimate phase boundary can be formulated in a different manner. Our results indicated that the mesh grouping algorithm is effective to enhance computational performance and image quality, and boundary estimation algorithm to determine the phase boundary directly.

• Research in Mathematical Education
• /
• v.2 no.1
• /
• pp.5-12
• /
• 1998

The COM curriculum provides first a core of mathematics for all students, and then offers opportunities for students to enter different streams of mathematics studies. The flexible curriculum (COM) is certainly welcome as it focuses on a transition from concrete to conceptual mathematics and on sequentially learning the power of mathematical language and symbols from simple to complex. This approach emphasizes the use of computers in mathematics education in the upper secondary grades. In Mathematics A, one unit is developed to computer operation, flow charts and programming, and computation using the computer. In mathematics B, a chapter addresses algorithms and the computer where students learn the functions of computers, as well as programs of various algorithms. Mathematics C allots a chapter for numerical computation in which approximating solutions for equations, numerical integration, mensuration by parts, and approximation of integrals. But, unfortunately, they do not have any plan for the cooperation study.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.11
• /
• pp.1048-1052
• /
• 2013

Recently, many countries have attempted to protect their satellites from damage caused by space debris. To design these collision avoidance maneuvers, optimal algorithms based on numerical simulations are widely used due to their practicality. However, these algorithms often require a great expenditure of time in order to find solutions. Therefore, in this paper, a simple analytical strategy is suggested to find the initial prediction required to find these numerical solutions for collision avoidance maneuvers by using relative dynamics for the rendezvous and docking problems. For this analytical strategy, the simple dynamics on the CW (Clohessy-Wiltshire) frame is adopted as an attempt to introduce an analytical solution.

• 한국전산유체공학회:학술대회논문집
• /
• 1999.11a
• /
• pp.17-22
• /
• 1999

Convergence characteristics and efficiency of three implicit approximate factorization schemes(ADI, DDADI and MAF) are examined using 2-Dimensional compressible upwind Navier-Stokes code. Second-order CSCM(Conservative Supra Characteristic Method) upwind flux difference splitting method with Fromm scheme is used for the right-hand side residual evaluation, while generally first-order upwind differencing is used for the implicit operator on the left-hand side. Convergence studies are performed using an example of the flow past a NACA0012 airfoil at steady transonic flow condition, i. e. Mach number 0.8 at $1.25^{\circ}$ angle of attack. The results were compared with other computational results in order to validate the current numerical analysis. The results from the implicit AF algorithms were compared well in low surface with the other computational results; however, not well in upper surface. It might be due to lack of the grid around the shock position. Because the algorithm minimizes the errors of the approximate decomposition, the improved convergence rate with MAF were observed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.10
• /
• pp.4007-4024
• /
• 2020

It is tremendously important to construct decision trees to use as a tool for knowledge representation from a given decision table. However, the usual algorithms may split the decision table based on each value, which is not efficient for numerical attributes. The methodology of this paper is to split the given decision table into binary groups as like the CART algorithm, that uses binary split to work for both categorical and numerical attributes. The difference is that it uses split for each attribute established by the directed acyclic graph in a dynamic programming fashion whereas, the CART uses binary split among all considered attributes in a greedy fashion. The aim of this paper is to study the effect of binary splits in comparison with each value splits when building the decision trees. Such effect can be studied by comparing the number of nodes, local and global misclassification rate among the constructed decision trees based on three proposed algorithms.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.837-839
• /
• 2003

Low spatial resolution remote sensing (RS) data (LSRD) are promising in agricultural monitoring activities due to their high temporal resolution, but under such a spatial resolution, mixing in a pixel is a common problem. In this study, a numerical experiment was conducted to explore a mixed pixel problem in agriculture using a combined RSsimulation model SWAP (Soil-Water-Atmosphere -Plant) and a Genetic Algorithm (GA) approach. Results of the experiments showed that it is highly possible to address the mixed pixel problem with LSRD.