• 한국측량학회지
• /
• 제31권2호
• /
• pp.151-157
• /
• 2013

1997년부터 도로명을 기준으로 주소를 나타내는 법적 근거가 마련되었다. 지번 방식의 주소에서 도로의 왼쪽에 위치한 건물에 홀수번호를 오른쪽에 위치한 건물에는 짝수번호를 부여하는 도로명 기준의 주소로 변화하는 것이다. 사람들이 거주하는 지역에 대해서는 도로명주소에 의한 위치표시는 가능하나, 전 답 산악 지역에 대한 위치표시체계는 미흡하여 범죄와 응급 구조에 신속히 대처할 수 없다. 이러한 비거주지역에서의 위치찾기 어려움의 도로명주소 약점을 보완하기 위해 국가지점번호가 도입되었다. 연구의 목적은 국가지점번호 도입을 돕기 위함이다. 본 연구에서는 국가지점번호를 위한 영토 중심의 기준점과 격자 범위, 그리고 부여체계로 두 글자의 한글과 x, y 좌표체계를 제안하였다. 또한, 지점번호 고시대상지역, 지점번호판 설치위치와 민간 및 공공분야 활용방안을 제시하였다.

• 한국분무공학회지
• /
• 제4권1호
• /
• pp.55-61
• /
• 1999

The first maximum point in the stability curve of liquid jet, i.e., the critical point is associated with the critical Reynolds number. This critical Reynolds number should be predicted by simple means. In this work, the critical Reynolds number in the stability curve of liquid jet are predicted using the empirical correlations and the experimental data reported in the literatures. The critical Reynolds number was found to be a function of the Ohnesorge number, nozzle lengh-to-diameter ratio, ambient Weber number and nozzle inlet type. An empirical correlation for the critical Reynolds number as a function of the Ohnesorge number and nozzle length-to-diameter ratio is newly proposed here. Although an empirical correlation proposed in this work may not be universal because of excluding the effects of ambient pressure and nozzle inlet type, it has reasonably agrees with the measured critical Reynolds number.

• 한국산학기술학회논문지
• /
• 제15권5호
• /
• pp.3093-3099
• /
• 2014

최근 그래픽 프로세서, 멀티미디어 프로세서, 음성처리 프로세서 등에서 부동소수점이 주로 사용된다. 한편 C, Java 등 고급언어에서는 단정도실수와 배정도실수를 사용하고 있다. 본 논문에서는 32비트 곱셈기를 사용하여 배정도실수의 역수를 계산하는 알고리즘을 제안한다. 배정도실수 가수를 상위 부분과 하위 부분으로 나누고, 상위 부분의 역수를 골드스미스 알고리즘으로 계산하고, 이를 초기값으로 하여 배정도실수의 역수를 계산하는 알고리즘을 제안한다. 제안한 알고리즘은 입력값에 따라서 곱셈 횟수가 다르므로, 평균 곱셈 횟수를 계산하는 방식을 유도하고, 여러 크기의 근사 역수 테이블에서 평균곱셈 횟수를 계산한다.

• Current Optics and Photonics
• /
• 제5권1호
• /
• pp.16-22
• /
• 2021

We present the Shannon entropy as an indicator of the spatial resolutions of the morphologies of the resonance mode patterns in an optical resonator. We obtain each optimized number of mesh points, one of minimum size and the other of maximum one. The optimized mesh-point number of minimum size is determined by the identifiable quantum number through a chi-squared test, whereas the saturation of the difference between Shannon entropies corresponds to the other mesh-point number of maximum size. We also show that the optimized minimum mesh-point increases as the (real) wave number increases and approximates the proportionality constant between them.

• 설비공학논문집
• /
• 제23권11호
• /
• pp.754-761
• /
• 2011

The present study numerically investigates two-dimensional flow and heat transfer in the multiple confined impinging slot jet. Numerical simulations are performed for the different Reynolds numbers(Re=100 and 200) in the range of nozzles from 1 to 9 and height ratios(H/D) from 2 to 5, where H/D is the ratio of the channel height to the slot width. The vector plots of velocity profile, stagnation and averaged Nusselt number distributions are presented in this paper. The dependency of thermal fields on the Reynolds number, nozzle number and height ratio can be clarified by observing the Nusselt number as heat transfer characteristic at the stagnation point and impingement surface. The Nusselt number at the stagnation point of the central slot shows unsteadiness at H/D=3 and Re=200. The value of Nusselt number at the stagnation point of the central slot decreases with higher Reynolds number and number of nozzle although overall area averaged Nusselt number increases. Hence careful selection of geometrical parameters and number of nozzle are necessary for optimization of the heat transfer performance of multiple slot impinging jet.

• 대한임베디드공학회논문지
• /
• 제9권5호
• /
• pp.285-292
• /
• 2014

The commonly used Newton-Raphson's floating-point number divider algorithm performs two multiplications in one iteration. In this paper, a tentative K'th Newton-Raphson's floating-point number divider algorithm which performs K times multiplications in one iteration is proposed. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation in single precision and double precision divider is derived from many reciprocal tables with varying sizes. In addition, an error correction algorithm, which consists of one multiplication and a decision, to get exact result in divider is proposed. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a floating point number divider unit. Also, it can be used to construct optimized approximate reciprocal tables.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제14권2호
• /
• pp.84-90
• /
• 2014

This paper presents the results of three-dimensional face point cloud smoothing based on a modified anisotropic diffusion method. The focus of this research was to obtain a 3D face point cloud with a smooth texture and number of vertices equal to the number of vertices input during the smoothing process. Different from other methods, such as using a template D face model, modified anisotropic diffusion only uses basic concepts of convolution and filtering which do not require a complex process. In this research, we used 6D point cloud face data where the first 3D point cloud contained data pertaining to noisy x-, y-, and z-coordinate information, and the other 3D point cloud contained data regarding the red, green, and blue pixel layers as an input system. We used vertex selection to modify the original anisotropic diffusion. The results show that our method has improved performance relative to the original anisotropic diffusion method.

• 대한수학회논문집
• /
• 제10권3호
• /
• pp.681-688
• /
• 1995

Fixed-point theory has an extension to coincidences. For a pair of maps $f,g:X_1 \to X_2$, a coincidence of f and g is a point $x \in X_1$ such that $f(x) = g(x)$, and $Coin(f,g) = {x \in X_1 $\mid$ f(x) = g(x)}$ is the coincidence set of f and g. The Nielsen coincidence number N(f,g) and the Lefschetz coincidence number L(f,g) are used to estimate the cardinality of Coin(f,g). The aspherical manifolds whose fundamental group has a normal solvable subgroup of finite index is called infrasolvmanifolds. We show that if $M_1,M_2$ are compact connected orientable infrasolvmanifolds, then $N(f,g) \geq $\mid$L(f,g)$\mid$$ for every $f,g : M_1 \to M_2$.

• 대한임베디드공학회논문지
• /
• 제13권1호
• /
• pp.45-51
• /
• 2018

In this paper, a tentative Kth order Newton-Raphson's floating point number Nth root algorithm for K order convergence rate in one iteration is proposed by applying Taylor series to the Newton-Raphson root algorithm. Using the proposed algorithm, $F^{-1/N}$ and $F^{-(N-1)/N}$ can be computed from iterative multiplications without division. It also predicts the error of the algorithm iteration and iterates only until the predicted error becomes smaller than the specified value. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a floating point number Nth root unit.

• 한국멀티미디어학회논문지
• /
• 제22권9호
• /
• pp.1029-1035
• /
• 2019

In this paper, a tentative Kth order Goldschmidt floating point number Nth root algorithm for K order convergence rate in one iteration is proposed by applying Taylor series to the Goldschmidt square root algorithm. Using the proposed algorithm, Nth root and Nth inverse root can be computed from iterative multiplications without division. It also predicts the error of the algorithm iteration. It iterates until the predicted error becomes smaller than the specified value. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a floating point number Nth root unit.