• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.1
• /
• pp.13-17
• /
• 2003

A continuous solution of the Dirichlet boundary value problem for the heat equation $u_t$＝$a2u_{xx}$ using a fuzzy system is described. We first apply the Crank-Nicolson method to obtain a discrete solution at the grid points for the heat equation. Then we find a continuous function to represent approximately the discrete values at the grid points in the form of a bicubic spline function (equation omitted) that can in turn be represented exactly by a fuzzy system. We show that the computed values at non-grid points using the bicubic spline function is much smaller than the ones obtained by linear interpolations of the values at the grid points. We also show that the fuzzy rule table in the fuzzy system representation of the bicubic spline function can be viewed as a gray scale image. Hence, the fuzzy rules provide a visual representation of the functions of two variables where the contours of different levels for the function are shown in different gray scale levels

• Journal of the Chungcheong Mathematical Society
• /
• v.20 no.4
• /
• pp.543-550
• /
• 2007

In this paper, we define the ap-Denjoy integral and investigate some properties od the ap-Denjoy integral. In particular, we show that a function f : [a,b]${\rightarrow}\mathbb{R}$ is ap-Denjoy integrable on [a,b] if and only if there exists an $ACG_s$ function F on [a,b] such that $F^{\prime}_{ap}=f$ almost everywhere on [a,b].

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.283-286
• /
• 2001

Based on a fuzzy system representation of gray scale images, we derive an edge detection algorithm whose convolution kernel is different from the known kernels such as those of Roberts', Prewitt's or Sobel's gradient. Our fuzzy system representation is an exact representation of the bicubic spline function which represents the gray scale image approximately. Hence the fuzzy system is a continuous function and it provides a natural way to define the gradient and the Laplacian operator. We show that the gradient at grid points can be evaluated by taking the convolution of the image with a 3 3 kernel. We also show that our gradient coupled with the approximate value of the continuous function generates an edge detection method which creates edge images clearer than those by other methods. A few examples of applying our methods are included.

• Kyungpook Mathematical Journal
• /
• v.49 no.4
• /
• pp.691-700
• /
• 2009

We use the fixed alternative theorem to establish Hyers-Ulam-Rassias stability of the quadratic functional equation where functions map a linear space into a complete quasi p-normed space. Moreover, we will show that the continuity behavior of an approximately quadratic mapping, which is controlled by a suitable continuous function, implies the continuity of a unique quadratic function, which is a good approximation to the mapping. We also give a few applications of our results in some special cases.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.5
• /
• pp.591-596
• /
• 1986

A binary continuous phase frequency shift keying (CPFSK), whose phase is a continuous function of time and instantaneous frequency is constant, is a bandwidth efficient constant envelope signalling scheme. A transmitting signal is formed by combined coding of a convolutional encoder and a binary CPFSK modulator. The signal is transmitted throuth additive white Gaussian noise(AWGN) channel. If the received signal is detected by a coherent maximum likelihood(ML) receiver, error probability can be expressed approximately in terms of minimum Euclidean distance. We propose rate 2/4 codes for the improvement of error performance without increating the data rate per bandwidth and the receiver complexity. Its minimum Euclidean distances are compared with those of rate \ulcornercodes as a function of modulation index and observation interval.

• Proceedings of the KSR Conference
• /
• 2006.11b
• /
• pp.138-143
• /
• 2006

Oscillatory wheel load fluctuation of considerable amplitude is almost always observed on railway vehicle running at high speed. From the acceleration measured on the axle-box, the frequency of this fluctuation is estimated to be approximately within 70 Hz. By the conventional measuring method, continuous outputs of wheel load can not be obtained, so it is difficult to investigate such a high frequency phenomenon exactly. We have developed a new method of measuring the forces and derailment coefficient continuously, using two pairs of strain gauge bridges whose output phases are shifted by 90 degree, and summing up the outputs with a weighting function. This method is available for measuring the forces between wheel and rail up to high frequency. In this paper, continuous method of measuring forces between wheel and rail and derailment coefficient.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.6
• /
• pp.454-458
• /
• 2001

Based on a fuzzy system representation of gray scale images, we derive and edge detection algorithm whose convolution kernel is different from the known kernels such as those of Robert's Prewitt's or Sobel's gradient. Our fuzzy system representation is an exact representation of the bicubic spline function which represents the gray scale image approximately. Hence the fuzzy system is a continuous function and it provides a natural way to define the gradient and the Laplacian operator. We show that the gradient at grid points can be evaluated by taking the convolution of the image with a 3$\times$3 kernel. We also that our gradient coupled with the approximate value of the continuous function generates an edge detection method which creates edge images clearer than those by other methods. A few examples of applying our methods are included.

• Bulletin of the Korean Mathematical Society
• /
• v.33 no.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.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.545-557
• /
• 2001

In this paper we propose a hierarchical classification algorithm based on rough membership function which can reason a new object approximately. We use the fuzzy reasoning method that substitutes fuzzy membership value for linguistic uncertainty and reason approximately based on the composition of membership values of conditional sttributes Here we use the rough membership function instead of the fuzzy membership function It can reduce the process that the fuzzy algorithm using fuzzy membership function produces fuzzy rules In addition, we transform the information system to the understandable minimal decision information system In order to do we, study the discretization of continuous valued attributes and propose the discretization algorithm based on the rough membership function and the entropy of the information theory The test shows a good partition that produce the smaller decision system We experimented the IRIS data etc. using our proposed algorithm The experimental results with IRIS data shows 96%~98% rate of classification.

• Journal of Korean Society of Transportation
• /
• v.6 no.1
• /
• pp.5-16
• /
• 1988

Development is given to an optimal network design method using continuous design variables. Modified Hooke-and-Jeeves algorithm is implemented in order to solve nonlinear programming problem which is approximately equivalent to the real network design problem with system efficiency crieteria and improvement cost as objective function. the method was tested for various forms of initial solution, and dimensions of initial step size of link improvements. At each searching point of evaluating the objective function, a link flow problem was solved with user equilibrium principles using the Frank-Wolfe algorithm. The results obtained are quite promising interms fo numbers of evaluation, and the speed of convergence. Suggestions are given to selections of efficient initial solution, initial step size and convergence criteria. An approximate method is also suggested for reducing computation time.