• Journal of the Korean Mathematical Society
• /
• v.51 no.3
• /
• pp.567-592
• /
• 2014

Complex-valued harmonic functions that are univalent and sense-preserving in the open unit disk are widely studied. A new methodology is employed to construct subclasses of univalent harmonic mappings from a given subfamily of univalent analytic functions. The notions of harmonic Alexander operator and harmonic Libera operator are introduced and their properties are investigated.

• Bulletin of the Korean Mathematical Society
• /
• v.37 no.2
• /
• pp.291-301
• /
• 2000

We give sufficient coefficient conditions for a class of meromorphic univalent harmonic functions that are starlike of some order. Furthermore, it is shown that these conditions are also necessary when the coefficients of the analytic part of the function are positive and the coefficients of the co-analytic part of the function are negative. Extreme points, convolution and convex combination conditions for these classes are also determined. Fianlly, comparable results are given for the convex analogue.

• Journal of applied mathematics & informatics
• /
• v.39 no.5_6
• /
• pp.717-723
• /
• 2021

The purpose of the present paper is to give sufficient conditions for normalized Dini function which is the special combination of the generalized Bessel function of first kind to be in the classes k-starlike functions and k-uniformly convex functions.

• The Journal of the Acoustical Society of Korea
• /
• v.29 no.2
• /
• pp.97-101
• /
• 2010

FIR type system identification with noisy input and output data can be solved by a total least squares (TLS) estimation. However, the performance of the TLS estimation is very sensitive to the ratio between the variances of the input and output noises. In this paper, we propose an iterative convex combination algorithm between TLS and least squares (LS). This combined algorithm shows robustness against the noise variance ratio. Consequently, the practical workability of the TLS method with noisy data has been significantly broadened.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.04a
• /
• pp.316-317
• /
• 1999

• Journal of the Korea Society for Simulation
• /
• v.13 no.1
• /
• pp.11-23
• /
• 2004

The decomposition of a structuring element for a morphological operation reduces the amount of the computation required for executing the operation. In this paper, we present a new technique for the decomposition of convex structuring elements for morphological operations. We formulated the linear constraints for the decomposition of a convex polygon in discrete space, then the constraints are applied to the decomposition of a convex structuring element. Also, a cost function is introduced to represent the optimal criteria for decomposition. We use linear integer programming technique to find the combination of basis structuring elements which minimizes the amount of the computation required for executing the morphological operation. Formulating different cost functions for different implementation methods and computer architectures, we can determine the optimal decompositions which guarantee the minimal amounts of computation on different computing environment.

• Kyungpook Mathematical Journal
• /
• v.50 no.4
• /
• pp.499-507
• /
• 2010

A new class of univalent holomorphic functions with fixed finitely many coefficients based on Generalized fractional derivative are introduced. Also some important properties of this class such as coefficient bounds, convex combination, extreme points, Radii of starlikeness and convexity are investigated.

• Journal of the Korean Statistical Society
• /
• v.25 no.4
• /
• pp.545-556
• /
• 1996

In this paper, we introduce a new concept of partial ordering which permits us to compare pairs of the dependence structures of a new hitting times for POD multivariate vector process of interest as to their degree of POD-ness. We show that POD ordering is closed under convolution, limit in distribution, compound distribution, mixture of a certain type and convex combination. Finally, we present several examples of POD ordering processes.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.467-470
• /
• 1994

In this paper, we develop two sufficient conditions for Schur stability of convex combinations of discrete time polynomials. We give conditions under which Schur stability of the extremes implies Schur stability of the entire convex combination. These results are based on Bhattacharyya's result(1991), the AHMC theory in Barmish and Kang's paper (1993) and the bilinear transformation. Important applications of the results involves robust Schur stability of a feedback system having degenerate interval plants in an extreme point context.

• Journal of the Korean Statistical Society
• /
• v.31 no.3
• /
• pp.315-328
• /
• 2002

As an extension of the well-known Pickands (1975) estimate. for the extreme value index, Yun (2002) introduced a generalized Pickands estimator. This paper searches for a minimax estimator in the sense of minimizing the maximum asymptotic relative efficiency of the Pickands estimator with respect to the generalized one. To reduce the asymptotic variance of the resulting estimator, convex combinations of the minimax estimator are also considered and their asymptotic normality is established. Finally, the optimal combination is determined and proves to be superior to the generalized Pickands estimator.