• 충청수학회지
• /
• 제12권1호
• /
• pp.157-162
• /
• 1999

In this paper, we introduce approximate Perron-Stieltjes integral and approximate Roussel derivative and investigate the differentiability of indefinite approximate Perron-Stieltjes integral.

• 대한수학회지
• /
• 제38권6호
• /
• pp.1157-1166
• /
• 2001

This paper answers some old questions about approximate similarity and raises new ones. We provide positive evidence and a technique for finding negative evidence on the question of whether approximate similarity is the equivalence relation generated by approximate equivalence and similarity.

• 대한기계학회논문집A
• /
• 제29권6호
• /
• pp.842-851
• /
• 2005

In this paper, a new method for constrained optimization of noisy functions is proposed. In approximate optimization using response surface methods, if constraints have severe noise, the approximate feasible region defined by approximate constraints is apt to include some of the infeasible region defined by actual constraints. This can cause the approximate optimum to converge into the infeasible region. In the proposed method, the approximate optimization is performed with the approximate constraints shifted by their deviations, which are calculated using a diagonal quadratic response surface method. This can prevent the approximate optimum from converging into the infeasible region. To fit the objective and constraints into diagonal quadratic models, we select the center and 4 additional points along each axis of design variables as experimental points. The deviation of each function is calculated using the differences between the real and approximate function values at the experimental points. A sequential approximate optimization technique based on the trust region algorithm is adopted to manage approximate models. The proposed approach is validated by solving some design problems. The results of the problems show the effectiveness of the proposed method.

• 대한수학회지
• /
• 제54권4호
• /
• pp.1063-1079
• /
• 2017

Two standard Bessel sequences in a Hilbert $C^*$-module are approximately duals if the distance (with respect to the norm) between the identity operator on the Hilbert $C^*$-module and the operator constructed by the composition of the synthesis and analysis operators of these Bessel sequences is strictly less than one. In this paper, we introduce (a, m)-approximate duality using the distance between the identity operator and the operator defined by multiplying the Bessel multiplier with symbol m by an element a in the center of the $C^*$-algebra. We show that approximate duals are special cases of (a, m)-approximate duals and we generalize some of the important results obtained for approximate duals to (a, m)-approximate duals. Especially we study perturbations of (a, m)-approximate duals and (a, m)-approximate duals of modular Riesz bases.

• 대한임베디드공학회논문지
• /
• 제16권5호
• /
• pp.233-240
• /
• 2021

We propose a novel, highly accurate approximate multiplier using different types of inexact 4-2 compressors. The importance of low hardware costs leads us to develop approximate multiplication for error-resilient applications. Several rules are developed when selecting a topology for designing the proposed multiplier. Our highly accurate multiplier design considers the different error characteristics of adopted compressors, which achieves a good error distribution, including a low relative error of 0.02% in the 8-bit multiplication. Our analysis shows that the proposed multiplier significantly reduces power consumption and area by 45% and 26%, compared with the exact multiplier. Notably, a trade-off relationship between error characteristics and hardware costs can be achieved when considering those of existing highly accurate approximate multipliers. In the image blending, edge detection and image sharpening applications, the proposed 8-bit approximate multiplier shows better performance in terms of image quality metrics compared with other highly accurate approximate multipliers.

• Communications for Statistical Applications and Methods
• /
• 제5권3호
• /
• pp.927-934
• /
• 1998

An approximate parameter orthogonality is defined, which is called an $\alpha$-approximate orthogonality The useful consequences of parameter orthogonality mentioned by Cox and Reid(1987) can be shared by an $\alpha$-approximate orthogonality. If $\alpha\geq1/2$, the consequences of orthogonality and $\alpha$-approximate orthogonality are asymptotically equivalent.

• 한국전자통신학회논문지
• /
• 제17권1호
• /
• pp.173-180
• /
• 2022

근사 컴퓨팅은 효율적인 하드웨어 컴퓨팅 시스템을 설계하기 위한 유망한 방법이다. 근사 곱셈은 고성능, 저전력 컴퓨팅을 위한 근사 계산 방식에 사용되는 핵심적인 연산이다. 근사 4-2 compressor는 근사 곱셈을 위한 효율적인 하드웨어 회로를 구현할 수 있다. 본 논문에서는 저면적, 저전력 특성을 갖는 근사 곱셈기를 제안하였다. 근사 곱셈기 구조는 정확한 영역, 근사 영역, 상수 수정 영역의 세 영역으로 나누어진다. 새로운 4:2 근사 compressor를 사용하여 근사 영역의 부분 곱 축소를 단순화하고, 간단한 오류 수정 방식을 사용하여 근사로 인한 오류를 보상한다. 상수 수정 영역은 오차를 줄이기 위해 확률 분석을 통한 상수를 사용하였다. 8×8 곱셈기에 대한 실험 결과, 제안한 근사 곱셈기는 기존의 4-2 compressor 기반의 근사 곱셈기보다 적은 면적을 요구하면서 적은 전력을 소비함을 보였다.

• 대한기계학회논문집A
• /
• 제29권9호
• /
• pp.1199-1208
• /
• 2005

Nowadays, it is performed actively to optimize by using an approximate model. This is called the approximate optimization. In addition, the sequential approximate optimization (SAO) is the repetitive method to find an optimum by considering the convergence of an approximate optimum. In some recent studies, it is proposed to increase the fidelity of approximate models by applying the sequential sampling. However, because the accuracy and efficiency of an approximate model is directly connected with the design area and the termination criteria are not clear, sequential sampling method has the disadvantages that could support an unreasonable approximate optimum. In this study, the SAO is executed by using trust region, Kriging model and Optimal Latin Hypercube design (OLHD). Trust region is used to guarantee the convergence and Kriging model and OLHD are suitable for computer experiment. finally, this SAO method is applied to various optimization problems of highly nonlinear mathematical functions. As a result, each approximate optimum is acquired and the accuracy and efficiency of this method is verified by comparing with the result by established method.

• 대한수학회보
• /
• 제33권3호
• /
• pp.329-334
• /
• 1996

The notion of approximate derivative was introduced by Denjoy in 1916 [3]. Khintchine [5] proved that Rolle's theorem holds for approximate derivatives and Tolstoff [8] proved that every approximate derivative is of Baire class 1 and has Darboux property. Goffman and Neugebauer [4] proved the above results of Tolstoff [8] in a different and simplified method. Also they [4] proved indirectly (via Darboux property) that approximate derivatives possess mean value property.

• 천문학회보
• /
• 제41권1호
• /
• pp.49.3-50
• /
• 2016

Two major radiative transfer (RT) techniques have been developted to model late-type galaxies: approximate RT and Monte Carlo (MC) RT. In the approximate RT, first proposed by Kylafis & Bahcall, only two terms of unscattered (direct) and single-scattered intensities are computed and higher-order multiple scattering components are approximated, saving computing time and cost compared to MC RT. However, the approximate RT can yield errors in regions where multiple scattering effect is significant. In order to examine how significant the errors of the approximate RT are, we compare results of the approximate RT with those of SKIRT, a state-of-the-art MC RT code, which is basically free from the approximation errors by fully incorporating all the multiple scattered intensities. In this study, we present quantitative errors in the approximate RT for late type galaxy models with various optical depths and inclination angles. We report that the approximate RT is not reliable if the central face-on optical depth is intermediate or high (${\tau}_V$ > 3).