• Bulletin of the Korean Mathematical Society
• /
• v.57 no.4
• /
• pp.957-972
• /
• 2020

Let 𝓡 be a 2-torsion free unital ring containing a non-trivial idempotent. An additive map 𝛿 from 𝓡 into itself is called a Jordan derivable map at commutative zero point if 𝛿(AB + BA) = 𝛿(A)B + B𝛿(A) + A𝛿(B) + 𝛿(B)A for all A, B ∈ 𝓡 with AB = BA = 0. In this paper, we prove that, under some mild conditions, each Jordan derivable map at commutative zero point has the form 𝛿(A) = 𝜓(A) + CA for all A ∈ 𝓡, where 𝜓 is an additive Jordan derivation of 𝓡 and C is a central element of 𝓡. Then we generalize the result to the case of Jordan higher derivable maps at commutative zero point. These results are also applied to some operator algebras.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.6188-6204
• /
• 2017

Over the years, more password-based authentication key agreement schemes using chaotic maps were susceptible to attack by off-line password guess attack. This work approaches this problem by a new method--new theorem of chaotic maps: $T_{a+b}(X)+T_{a-b}(X)=2T_a(X)T_b(X)$,(a>b). In fact, this method can be used to design two-party, three-party, even in N-party intelligently. For the sake of brevity and readability, only a two-party instance: a novel Two-party Password-Authenticated Key Agreement Protocol is proposed for resisting password guess attack in this work. Compared with the related literatures recently, our proposed scheme can be not only own high efficiency and unique functionality, but is also robust to various attacks and achieves perfect forward secrecy. For capturing improved ratio of security and efficiency intuitively, the paper firstly proposes a new parameter called security/efficiency ratio(S/E Ratio). The higher the value of the S/E Ratio, the better it is. Finally, we give the security proof and the efficiency analysis of our proposed scheme.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.19 no.4
• /
• pp.357-363
• /
• 2001

Recently, structure and type of GIS data is various and complicated. Therefore, there is a research on efficient data collecting and processing method. Digital maps and orthophotos are needed for efficient usage in the field of GIS. Digital maps which are one of the part of NGIS and digital cadastral maps are different, and data construction isn't performed. Furthermore, there are no research on the improvement of difference between digital maps and cadastral maps. In this paper, manufactured digital orthophotos using aerial photos are used for change detection in a central area of a town. Selecting a town which has various changes, and digital maps and cadastral maps overlap each other, and analyze them for correction, renovation and possible application.

• Bulletin of the Korean Mathematical Society
• /
• v.41 no.3
• /
• pp.521-540
• /
• 2004

In this paper, we give a sharp estimate on the cardinality of the set generating the convex hull containing the image of harmonic maps with polynomial growth rate on a certain class of manifolds into a Cartan-Hadamard manifold with sectional curvature bounded by two negative constants. We also describe the asymptotic behavior of harmonic maps on a complete Riemannian manifold into a regular ball in terms of massive subsets, in the case when the space of bounded harmonic functions on the manifold is finite dimensional.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.2
• /
• pp.180-187
• /
• 2010

In this paper, a global path generation method is suggested using multiple grid maps connected with the mission type of unmanned combat vehicle(UCV). In order to carry out a mission for UCV, it is essential to find a global path which is coincident with the characteristics of the mission. This can be done by considering various combat circumstances represented as grid maps such as velocity map, threat map and communication map. Cost functions of multiple grid maps are linearly combined and normalized to them simultaneously for the path generation. The proposed method is realized using $A^*$, a well known search algorithm, and cost functions are normalized in the ratio of the traverse time which is one of critical information should be provided with the operators using the velocity map. By the experiments, it is checked found global paths match with the mission type by reflecting input data of grid maps properly and the computation time is short enough to regenerate paths in real time as combat circumstances change.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.2
• /
• pp.167-172
• /
• 2012

In biology the advent of the high-throughput technology for sequencing, probing, or screening has produced huge volume of data which could not be manually handled. Biologists have resorted to software tools in order to effectively handle them. This paper introduces a bioinformatics tool to help biologists find potentially interesting pathway maps from a transcriptome data set in which the expression levels of genes are described for both case and control samples. The tool accepts a transcriptome data set, and then selects and categorizes some of genes into four classes using a fuzzy filtering technique where classes are defined by membership functions. It collects and edits the pathway maps related to those selected genes without analyst' intervention. It invokes a sequence of web service functions from KEGG, which an online pathway database system, in order to retrieve related information, locate pathway maps, and manipulate them. It maintains all retrieved pathway maps in a local database and presents them to the analysts with graphical user interface. The tool has been successfully used in identifying target genes for further analysis in transcriptome study of human cytomegalovirous. The tool is very helpful in that it can considerably save analysts' time and efforts by collecting and presenting the pathway maps that contain some interesting genes, once a transcriptome data set is just given.

• Journal of applied mathematics & informatics
• /
• v.8 no.2
• /
• pp.635-640
• /
• 2001

Let X be a T-admissible space and A(x) be the set of all admissible fibers at x∈X. In this paper, we introduce some basic concepts, properties, and known results about set-valued maps, hyperspaces and especially T-admissible spaces. And then, we construct a certain set-valued map(Theorem 2.3) and an arc from {x} to X∈A(x) in use of the set-valued maps(Theorem 2.3 through Theorem 2.7).

• Communications of the Korean Mathematical Society
• /
• v.21 no.4
• /
• pp.679-687
• /
• 2006

The purpose of this paper is to obtain a new common fixed point theorem by using a new contractive condition in intuitionistic fuzzy metric spaces. Our result generalizes and extends many known results in fuzzy metric spaces and metric spaces.

• The Pure and Applied Mathematics
• /
• v.28 no.2
• /
• pp.103-110
• /
• 2021

The aim of this paper is to prove a common fixed point theorem for two w-compatible maps in modular A-metric spaces. The main result is also illustrated by an example to demonstrate the degree of validity of our hypothesis.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.1
• /
• pp.45-58
• /
• 2022

In this paper, iterative algorithms for approximating a common fixed point of a countable family of multi-valued demicontractive maps in the setting of Hadamard spaces are presented. Under different mild conditions, the sequences generated are shown to strongly convergent and ∆-convergent to a common fixed point of the considered family, accordingly. Our theorems complement many results in the literature.