• Communications of the Korean Mathematical Society
• /
• v.27 no.4
• /
• pp.753-762
• /
• 2012

We prove some sharp extremal distance results for functions in weighted Bergman spaces on the upper halfplane. We also prove new analogous results in the context of bounded strictly pseudoconvex domains with smooth boundary.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.2
• /
• pp.299-306
• /
• 2011

In this paper, a blind adaptive equalization algorithm based on PDF-distance minimization and a set of Delta functions is introduced and its superior robustness against impulsive noise and multipath characteristics of underwater communication channels is proved. The conventional CMA based on MSE has shown to be incapable of coping with impulsive noise, and correntropy blind algorithm has also revealed to yield not satisfying performance for the mission. On the other hand, the blind adaptive equalization algorithm based on PDF-distance minimization and a set of Delta functions has been proved to solve effectively the problem of impulsive noise and multipath characteristics of underwater communication channels through theoretical and simulation analysis.

• Communications of the Korean Mathematical Society
• /
• v.33 no.1
• /
• pp.85-101
• /
• 2018

Let S be a polynomial ring over a field K, with a monomial order ${\prec}$, and let I be an unmixed graded ideal of S. In this paper we study two functions associated to I: The minimum distance function ${\delta}_I$ and the footprint function $fp_I$. It is shown that ${\delta}_I$ is positive and that $fp_I$ is positive if the initial ideal of I is unmixed. Then we show that if I is radical and its associated primes are generated by linear forms, then ${\delta}_I$ is strictly decreasing until it reaches the asymptotic value 1. If I is the edge ideal of a Cohen-Macaulay bipartite graph, we show that ${\delta}_I(d)=1$ for d greater than or equal to the regularity of S/I. For a graded ideal of dimension ${\geq}1$, whose initial ideal is a complete intersection, we give an exact sharp lower bound for the corresponding minimum distance function.

• Journal of Magnetics
• /
• v.20 no.1
• /
• pp.11-20
• /
• 2015

In this work, Monte Carlo simulation was employed to model the stretchable Ising monolayer film to investigate the effect of the spatial distance variation among magnetic atoms on magnetic behavior of the film. The exchange interaction was considered as functions of initial interatomic distance and the stretched distance (or the strain). Following Bethe-Slater picture, the magnetic exchange interaction took the Lennard-Jones potential-like function. Monte Carlo simulations via the Wolff and Metropolis algorithms were used to update the spin systems, where equilibrium and dynamic magnetic profiles were collected. From the results, the strain was found to have strong influences on magnetic behavior, especially the critical behavior. Specifically, the phase transition point was found to either increase or decrease depending on how the exchange interaction shifts (i.e. towards or away from the maximum value). In addition, empirical functions which predict how the critical temperatures scale with initial interatomic distance and the strain were proposed, which provides qualitatively view how to fine tune the magnetic critical point in monolayer film using the substrate modification induced strain.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.3
• /
• pp.687-696
• /
• 2003

This article presents a new family of the estimating functions related with minimum distance estimations, and discusses its relationship to the family of the minimum density power divergence estimating equations. Two representative minimum distance estimations; the minimum $L_2$ distance estimation and the minimum Hellinger distance estimation are studied in the light of the theory of estimating equations. Despite of the desirable properties of minimum distance estimations, they are not widely used by general researchers, because theories related with them are complex and are hard to be computationally implemented in real problems. Hopefully, this article would be a help for understanding the minimum distance estimations better.

• Communications for Statistical Applications and Methods
• /
• v.27 no.6
• /
• pp.589-602
• /
• 2020

The development of smart grids has enabled the easy collection of a large amount of power data. There are some common patterns that make it useful to cluster power consumption patterns when analyzing s power big data. In this paper, clustering analysis is based on distance functions for time series and clustering algorithms to discover patterns for power consumption data. In clustering, we use 10 distance measures to find the clusters that consider the characteristics of time series data. A simulation study is done to compare the distance measures for clustering. Cluster validity measures are also calculated and compared such as error rate, similarity index, Dunn index and silhouette values. Real power consumption data are used for clustering, with five distance measures whose performances are better than others in the simulation.

• International Journal of Computer Science & Network Security
• /
• v.21 no.5
• /
• pp.69-72
• /
• 2021

The article discusses the features of the use of distance technologies to intensify the learning process of students. The advantages and disadvantages of distance learning are shown. The role and functions of the teacher in distance learning have been adjusted. Information and methodological support for distance learning of students is proposed. Analyzed pedagogical, psychological, methodological and philosophical literature, educational standards, charters of higher educational institutions and other documents. Studied foreign experience in conducting classes using information technology.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.766-780
• /
• 1996

This paper presents a mapping scheme for parallel processing using an accurate characterization of the communication overhead. A set of objective functions is formulated to evaluate the optimality of mapping a problem graph into a system graph. One of them is especially suitable for real-time applications of parallel processing. These objective functions are different from the conventional objective functions in that the edges in the problem graph are weighted and the actual distance rather than the nominal distance for the edges in the system graph is employed. This facilitates a more accurate qualification of the communication overhead. An efficient mapping scheme has been developed for the objective functions, where two levels of assignment optimization procedures are employed: initial assignment and pairwise exchange. The mapping scheme has been tested using the hypercube as a system graph.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.9 no.1
• /
• pp.4-9
• /
• 2009

Fuzzy entropy is designed for non convex fuzzy membership function using well known Hamming distance measure. Design procedure of convex fuzzy membership function is represented through distance measure, furthermore characteristic analysis for non convex function are also illustrated. Proof of proposed fuzzy entropy is discussed, and entropy computation is illustrated.

• Journal of applied mathematics & informatics
• /
• v.36 no.1_2
• /
• pp.93-105
• /
• 2018

There are many metric functions in the plane. In this paper we are to classify the metric functions on the plane using two ways such as using sum of distances between some points when start point and end point is fixed, and using area of transferred triangle consisted of distances between 3 points.