• Proceedings of the IEEK Conference
• /
• 2000.11b
• /
• pp.337-340
• /
• 2000

In this paper, we put forth a procedure that target low power logic synthesis based on XOR representation of Boolean functions, and the results of synthesis procedure are a multi-level XOR form with minimum switching activity. Specialty, this paper show a method to extract the common cubes or kernels by Boolean matrix and rectangle covering, and to estimate the power consumption in terms of the extracted common sub-functions.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.293-300
• /
• 1998

The numerical method is used to solve the Fredholm integral equation of the second kind with weak singular kernels using the Toeplitz matrices. The solution has a computing time requir-ment of O(N2) where 2N+1 is the number of discretization points used. Also the error estimate is computed. Some numerical Exam-ples are computed using the Mathcad package.

• Honam Mathematical Journal
• /
• v.26 no.4
• /
• pp.455-462
• /
• 2004

We prove that if ${\mathbb{K}}^*$ is adjoint operator on $W_2{^2}({\Omega})$, then ${\mathbb{K}}^*v(t,\;{\tau})=,\;v(x,\;y){\in}W_2{^2}({\Omega})$ ; it is also related to the decomposition of solution of Fredholm equations.

• Bulletin of the Korean Mathematical Society
• /
• v.42 no.2
• /
• pp.387-396
• /
• 2005

In the setting of the half-plane of the complex plane, we introduce a modified reproducing kernel and we show that for $r>-1/2,\;B^{1,r}-cancellation$ property holds and the Bloch space is the dual space of $B^{1,r}$.

• Journal of the Korean Mathematical Society
• /
• v.44 no.3
• /
• pp.733-745
• /
• 2007

We prove the $L^p(1 boundedness of the parabolic Marcinkiewicz integral with the kernel function $\Omega{\in}L(log^+L)^{1/2}(S^{n-1})$. The result is an improvement and extension of some known results.

• Communications of the Korean Mathematical Society
• /
• v.18 no.2
• /
• pp.243-249
• /
• 2003

We consider weighted Bergman spaces and radial derivatives on the spaces. We also prove that for each element f in B$\^$p, r/ there is a unique f in B$\^$p, r/ such that f is the radial derivative of f and for each f$\in$B$\^$r/(i), f is the radial derivative of some element of B$\^$r/(i) if and only if, lim f(tz)= 0 for all z$\in$H.

• Bulletin of the Korean Mathematical Society
• /
• v.45 no.3
• /
• pp.523-561
• /
• 2008

The purpose of this paper is to survey the use of the important method of scaling in analysis, and particularly in complex analysis. Applications are given to the study of automorophism groups, to canonical kernels, to holomorphic invariants, and to analysis in infinite dimensions. Current research directions are described and future paths indicated.

• Communications for Statistical Applications and Methods
• /
• v.15 no.4
• /
• pp.543-549
• /
• 2008

Inspired by using a robust loss function in the support vector machine regression to control training error and the idea of robust template matching with M-estimator, Chen (2004) applies M-estimator techniques to gaussian radial basis functions and form a new class of robust kernels for the support vector machines. We are specially interested in the shape of the Huber's M-estimator in this context and propose a way to find the shape parameter of the Huber's M-estimating function. For simplicity, only the two-class classification problem is considered.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1994.10a
• /
• pp.837-842
• /
• 1994

The boundary element method was used for studying singularities of an interface crack with contact zones. Because the contact zone size was extremely small in a tention field, a large number of Gaussian points were is used for numerical integration of the Kernels. In order to estimate the contact zone size, iteration method was used. The interface crack tips with contact zones showed no oscillatory behavior and J-integral values across the interface were conserved.

• Journal of the Korean Statistical Society
• /
• v.27 no.1
• /
• pp.91-100
• /
• 1998

A method of estimating probability density using regression tools is presented here. It is based on equal-length binning and locally weighted approximate likelihood for bin counts. The method is particularly useful for densities with bounded supports, where it automatically corrects edge effects without using boundary kernels.