• 한국기계가공학회지
• /
• 제20권6호
• /
• pp.33-43
• /
• 2021

A60 class bulkhead penetration piece is a fire resistance system installed on a bulkhead compartment to protect lives and to prevent flame diffusion in a fire accident on a ship and offshore plant. This study focuses on the approximate optimization of the fire resistance design of the A60 class bulkhead penetration piece using a multi-island genetic algorithm. Transient heat transfer analysis was performed to evaluate the fire resistance design of the A60 class bulkhead penetration piece. For approximate optimization, the bulkhead penetration piece length, diameter, material type, and insulation density were considered discrete design variables; moreover, temperature, cost, and productivity were considered constraint functions. The approximate optimum design problem based on the meta-model was formulated by determining the discrete design variables by minimizing the weight of the A60 class bulkhead penetration piece subject to the constraint functions. The meta-models used for the approximate optimization were the Kriging model, response surface method, and radial basis function-based neural network. The results from the approximate optimization were compared to the actual results of the analysis to determine approximate accuracy. We conclude that the radial basis function-based neural network among the meta-models used in the approximate optimization generates the most accurate optimum design results for the fire resistance design of the A60 class bulkhead penetration piece.

• 한국수학사학회지
• /
• 제25권3호
• /
• pp.1-14
• /
• 2012

구장산술이래 동양의 전통 수학은 유리수체를 기본으로 이루어져 있다. 따라서 방정식의 무리수해는 허용되지 않으므로 근사해를 구하는 방법은 방정식론에서 매우 중요한 과제가 되었다. 중국의 사료에 나타나는 근사해에 관한 역사를 먼저 기술하고, 이를 조선산학에 나타나는 근사해에 관한 사료와 비교한다. 조선의 근사해에 대한 이론은 박율(1621 - 1668) 의 산학원본 (算學原本) 과 조태구 (趙泰耉, 1660-1723) 의 주서관견(籌書管見)에 이미 정립되었다. 중국의 이론과 달리 두 산학자 모두 근사해의 오차에 관심을 가지고 더 좋은 근사해를 구하는 방법을 얻어내었음을 밝힌다.

• 대한수학교육학회지:수학교육학연구
• /
• 제13권1호
• /
• pp.77-94
• /
• 2003

This study attempts to compare the topic "approximate value" in mathematics text-books of the 2nd year of South Korean junior high schools and that of the 3rd year of North Korean high schools. In addition, a survey questionnaire was distributed to junior and senior high school students as well as to mathematics teachers in South Korea. Based on the results of the survey, this study attempts to uncover the issues within the current teaching methods of "approximate value" and proposes the directions in which the teaching of approximate value should go in order to enhance mathematical thinking power and creativity of the students. First, it Is necessary to teach students how an error applies to the real world. To accomplish this end, it may be worthwhile to consider introducing the relative errors with more seriousness. Second, it is more important to teach the way of thinking which is concealed in the background of the calculation methods of approximate values than to simply teach mere calculation methods. Third, it is necessary to teach the calculation of approximate value with more realistic examples. Fourth, It is needed to teach students what the differences are when the terminology of "approximately" and "about" is used in real life and in mathematics.

• 한국측량학회지
• /
• 제30권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.

• 한국해양공학회지
• /
• 제35권2호
• /
• pp.131-140
• /
• 2021

The paper deals with comparative study of various surrogate models based approximate optimization in the structural design of the passive type deck support frame under design load conditions. The passive type deck support frame was devised to facilitate both transportation and installation of 20,000 ton class topside. Structural analysis was performed using the finite element method to evaluate the strength performance of the passive type deck support frame in its initial design stage. In the structural analysis, the strength performances were evaluated for various design load conditions. The optimum design problem based on surrogate model was formulated such that thickness sizing variables of main structure members were determined by minimizing the weight of the passive type deck support frame subject to the strength performance constraints. The surrogate models used in the approximate optimization were response surface method, Kriging model, and Chebyshev orthogonal polynomials. In the context of numerical performances, the solution results from approximate optimization were compared to actual non-approximate optimization. The response surface method among the surrogate models used in the approximate optimization showed the most appropriate optimum design results for the structure design of the passive type deck support frame.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1601-1606
• /
• 1991

We present an algorithm to approximate the Voronoi diagrams of 2D objects bounded by algebraic curves. Since the bisector curve for two algebraic curves of degree d can have a very high algebraic degree of 2 * d$^{4}$, it is very difficult to compute the exact algebraic curve equation of Voronoi edge. Thus, we suggest a simple polygonal approximation method. We first approximate each object by a simple polygon and compute a simplified polygonal Voronoi diagram for the approximating polygons. Finally, we approximate each monotone polygonal chain of Voronoi edges with Bezier cubic curve segments using least-square curve fitting.

• 대한수학회논문집
• /
• 제20권3호
• /
• pp.505-509
• /
• 2005

We show that every $\varepsilon-approximate$ Jordan functional on a Banach algebra A is continuous. From this result we obtain that every $\varepsilon-approximate$ Jordan mapping from A into a continuous function space C(S) is continuous and it's norm less than or equal $1+\varepsilon$ where S is a compact Hausdorff space. This is a generalization of Jarosz's result [3, Proposition 5.5].

• Journal of applied mathematics & informatics
• /
• 제26권1_2호
• /
• pp.375-381
• /
• 2008

Boundedness for the set of all the $\epsilon$-approximate solutions for convex optimization problems are considered. We give necessary and sufficient conditions for the sets of all the $\epsilon$-approximate solutions of a convex optimization problem involving finitely many convex functions and a convex semidefinite problem involving a linear matrix inequality to be bounded. Furthermore, we give examples illustrating our results for the boundedness.

• 음성과학
• /
• 제11권2호
• /
• pp.211-216
• /
• 2004

In this paper, we present a fast encoding algorithm for vector quantization with an approximate Euclidean distance calculation. An approximation is performed by converting floating point to the near integer. An inequality between the approximate Euclidean distance and the nearest distance is developed to avoid unnecessary distance calculations. Since the proposed algorithm rejects those codewords that are impossible to be the nearest codeword, it produces the same output as conventional full search algorithm.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1997년도 춘계학술대회 학술발표 논문집
• /
• pp.248-251
• /
• 1997

In this paper, We propose the concept of approximate Classification in the field of two group discriminan analysis. In our approach, an attribute space is divided into three subspaces. Two subspaces are for given two group and one subspace is for a boundary area between the two groups. We propose Approximate Pattern Classification with Rough set. We also propose learning procedures of neural networks for approximate classification. We propose two weighting methods which lead to possibility analysis and necessity analysis. We illustrate the proposed methods by numerical examples.