• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10A
• /
• pp.938-948
• /
• 2005

Localization in wireless sensor networks is to determine the positions of all nodes based on the Down positions of several nodes. Much previous work for localization use multilateration or triangulation based on measurement of angles or distances to the fixed nodes. In this paper, we propose a new centralized algorithm for localization using weights of adjacent nodes. The algorithm, having the advantage of simplicity, shows that the localization problem can be formulated to a linear matrix equalities. We mathematically show that the equalities have a unique solution. The unique solution indicates the locations of unknown nodes are capable of being uniquely determined. Three kinds of weights proposed for practical use are compared in simulation analysis.

• Journal of the Korean Mathematical Society
• /
• v.27 no.2
• /
• pp.193-202
• /
• 1990

• The Korean Journal of Applied Statistics
• /
• v.27 no.6
• /
• pp.909-922
• /
• 2014

This paper reviews Bayesian inference with inequality constraints. It focuses on ⅰ) comparison of models with various inequality/equality constraints on parameters, ⅱ) multiple tests on equalities of parameters when parameters are under inequality constraints, ⅲ) multiple test on equalities of score parameters in models for contingency tables with ordinal categorical variables.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.37 no.4
• /
• pp.67-72
• /
• 2012

In this paper a new method of handling linear constraints for the genetic algorithm is suggested. The method is designed to maintain the feasibility of offsprings during the evolution process of the genetic algorithm. In the genetic algorithm, the chromosomes are coded as the vectors in the real vector space constrained by the linear constraints. A method of handling the linear constraints already exists in which all the constraints of equalities are eliminated so that only the constraints of inequalities are considered in the process of the genetic algorithm. In this paper a new method is presented in which all the constraints of inequalities are eliminated so that only the constraints of equalities are considered. Several genetic operators such as arithmetic crossover, simplex crossover, simple crossover and random vector mutation are designed so that the resulting offspring vectors maintain the feasibility subject to the linear constraints in the framework of the new handling method.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.59-72
• /
• 2005

The auxiliary principle is used to suggest and analyze some iterative methods for solving solving hemivariational inequalities under mild conditions. The results obtained in this paper can be considered as a novel application of the auxiliary principle technique. Since hemivariational in­equalities include variational inequalities and nonlinear optimization problems as special cases, our results continue to hold for these problems.

• Kyungpook Mathematical Journal
• /
• v.27 no.2
• /
• pp.145-152
• /
• 1987

In this paper we wish to establish some new integral in equalities of the Gronwall-Bellman-Reid type that have a wide range of applications in the differential and integral equations.

• Journal of applied mathematics & informatics
• /
• v.10 no.1_2
• /
• pp.101-109
• /
• 2002

We extend two inequalities involving Hadamard Products of Positive definite Hermitian matrices to positive semi-definite Hermitian matrices. Simultaneously, we also show the sufficient conditions for equalities to hold. Moreover, some other matrix inequalities are also obtained. Our results and methods we different from those which are obtained by S. Liu in [J. Math. Anal. Appl. 243:458-463(2000)] and B.-Y Wang et al in [Lin. Alg. Appl. 302-303: 163-172(1999)] .

• Kyungpook Mathematical Journal
• /
• v.58 no.1
• /
• pp.167-182
• /
• 2018

In this paper, we prove the optimal inequalities for the generalized normalized ${\delta}$-Casorati curvature and the normalized scalar curvature for different submanifolds in generalized (${\kappa},{\mu}$)-space forms. The proof is based on an optimization procedure involving a quadratic polynomial in the components of the second fundamental form. We also characterize the submanifolds on which equalities hold.

• East Asian mathematical journal
• /
• v.24 no.1
• /
• pp.67-79
• /
• 2008

In this paper, we characterize the chaotic operator order $A\;{\gg}\;C\;{\gg}\;B$. Consequently all other possible characterizations follow easily. Some satellite theorems of the Furuta inequality are naturally given. And finally, using results of characterizing $A\;{\gg}\;C\;{\gg}\;B$, and by the Douglas's majorization and factorization theorem we are able to characterize the chaotic operator order $A\;{\gg}\;B$ in terms of operator equalities.

• East Asian mathematical journal
• /
• v.18 no.2
• /
• pp.205-209
• /
• 2002

In the paper the following propositions are proved. 1) If ($Q,{\cdot},e$) is a B-algebra, then there exists a group($Q,A,^{-1}$, 1) such that the following equalities hold e=1 and ${\cdot}=^{-1}A$, where $^{-1}A(x,y)=z{\Longleftrightarrow^{def}}A(z,y)=x$; and 2) If ($Q,A,^{-1}$, e) is a group, then ($Q,^{-1}A$, e) is a B-algebra.