• Honam Mathematical Journal
• /
• v.23 no.1
• /
• pp.41-50
• /
• 2001

This paper concerns with the subclass of normalized analytic function f in D = {z : |z| < 1}, namely a ${\delta}$-convex function in a sector. This subclass is denoted by ${\Delta}({\delta})$, where ${\delta}$ is a real positive. Given $0<{\beta}{\leq}1$ then for $z{\in}D$, the exact ${\alpha}({\beta},\;{\delta})$ is found such that $f{\in}{\Delta}({\delta})$ implies $f{\in}S^*({\beta})$, where $S^*({\beta})$ is starlike of order ${\beta}$ in a sector. This work is a more general version of the result of Nunokawa and Thomas [11].

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.05a
• /
• pp.285-288
• /
• 2002

In this paper, we introduce the concept of a fuzzy almost c-continuity and investigate some of its properties.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.2
• /
• pp.153-158
• /
• 2002

In this paper we introduce the concept of a fuzzy almost c-continuity and investigate some of its properties.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.1 no.3
• /
• pp.4-19
• /
• 1991

In this paper, we propose a fuzzy neural network pattern classifier utilizing fuzzy information. This system works without any a priori information about the number of clusters or cluster centers. It classifies each input according to the distance between the weights and the normalized input using Bezdek's [1] fuzzy membership value equation. This model returns the correct membership value for each input vector and find several cluster centers. Some experimental studies of comparison with other algorithms will be presented for sample data sets.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.15 no.2
• /
• pp.121-125
• /
• 2015

In this paper, we propose a method that extracts features from character patterns using the fractal dimension of chaos theory. The input character pattern image is converted into time-series data. Then, using the modified Henon system suggested in this paper, it determines the last features of the character pattern image after calculating the box-counting dimension, natural measure, information bit, and information (fractal) dimension. Finally, character pattern recognition is performed by statistically finding each information bit that shows the minimum difference compared with a normalized character pattern database.

• Journal of Korean Society for Quality Management
• /
• v.21 no.2
• /
• pp.156-161
• /
• 1993

Limiting distributions of Studentized test statistics have been shown for testing the slope parameter in a simple linear structural model. Since the limiting distribution of Studentized one appears to yield inaccurate inference, this paper suggests adjustment of critical value and normalization of the Studentized one. As results, we can have procedures for refined inference based on our approximate distrbution instead of the limiting distribution.

• 한국가스학회:학술대회논문집
• /
• 1998.09a
• /
• pp.241-246
• /
• 1998

This paper considers the applicability of a pseudosteady-state approach to the long-time behavior of real gas flow in a closed reservoir. The method involves a combination of a linearized gas diffusivity equation using a normalized pseudotime and a material balance equation. Comparison with a commercial reservoir simulator showed that highly accurate values of pseudopressure drawdown and well pressure are obtained by the pseudosteady-state approach with much less computational effort.

• Journal of the Korean Statistical Society
• /
• v.24 no.1
• /
• pp.19-29
• /
• 1995

In this paper, we investigate the asymptotic distributions of maximum queue length for M/G/1 and GI/M/1 systems which are positive recurrent. It is well knwon that for any positive recurrent queueing systems, the distributions of their maxima linearly normalized do not have non-degenerate limits. We show, however, that by concerning an array of queueing processes limiting behaviors of these maximum queue lengths can be established under certain conditions.

• Bulletin of the Korean Mathematical Society
• /
• v.35 no.2
• /
• pp.235-258
• /
• 1998

We define a crossing of a link without referring to a specific projection of the link and describe a construction of a non-normalized Alexander polynomial associated to collections of such crossings of oriented links under an equivalence relation, called homology relation. The polynomial is computed from a special Seifert surface of the link. We prove that the polynomial is well-defined for the homology equivalence classes, investigate its relationship with the combinatorially defined Alexander polynomials and study some of its properties.

• Communications of the Korean Mathematical Society
• /
• v.14 no.3
• /
• pp.569-579
• /
• 1999

We consider a random measure defined by the occupation time of Brownian motion in $l_2$. If it is normalized ${\lambda}^2$log then we show that its cluster set as ${\lambda}{longrightarrow}\infty$ can be represented by Ι-function on $\sigma$-finite measure in $l_2$.