• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.10a
• /
• pp.303-311
• /
• 1999

The amount of financial information in today's sophisticated large data bases is huge and makes comparisons between company performance difficult or at least very time consuming. The purpose of this paper is to investigate whether neural networks in the form of self-organizing maps can be used to manage the complexity in large data bases. This paper structures and analyzes accounting numbers in a large data base over several time periods. By using self-organizing maps, we overcome the problems associated with finding the appropriate underlying distribution and the functional form of the underlying data in the structuring task that is often encountered, for example, when using cluster analysis. The method chosen also offers a way of visualizing the results. The data base in this study consists of annual reports of more than 80 Korean companies with data from the year 1998.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.04a
• /
• pp.179-182
• /
• 2007

In this paper, we introduce the concepts of fuzzy (r, s)-semi-preopen sets and fuzzy (r, s)-semi-precontinuous maps on intuitionistic fuzzy topological spaces in Sostak's sense. The relations among fuzzy (r, s)-semicontinuous, fuzzy (r, s)-precontinuous, and fuzzy (r, s)-semi-precontinuous maps are discussed. The concepts of fuzzy (r, s)-semi-preinterior, fuzzy (r, s)-semi-preclosure, fuzzy (r, s)-semi-preneighborhood, and fuzzy (r, s)-quasi-semi-preneighborhood are given. Using these concepts, the characterization for the fuzzy (r, s)-semi-precontinuous map is obtained. Also, we introduce the notions of fuzzy (r, s)-semi-preopen and fuzzy (r, s)-semi-preclosed maps on intuitionistic fuzzy topological spaces in Sostak's sense, and then we investigate some of their characteristic properties.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.660-663
• /
• 2003

The advanced computer network technology enables connectivity of computers through an open network environment. There has been growing numbers of security threat to the networks. Therefore, it requires intrusion detection and prevention technologies. In this paper, we propose a network based intrusion detection model using Fuzzy Cognitive Maps(FCM) that can detect intrusion by the Denial of Service(DoS) attack detection method adopting the packet analyses. A DoS attack appears in the form of the Probe and Syn Flooding attack which is a typical example. The Sp flooding Preventer using Fuzzy cognitive maps(SPuF) model captures and analyzes the packet information to detect Syn flooding attack. Using the result of analysis of decision module, which utilized FCM, the decision module measures the degree of danger of the DoS and trains the response module to deal with attacks. The result of simulating the "KDD ′99 Competition Data Set" in the SPuF model shows that the Probe detection rates were over 97 percentages.

• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.793-806
• /
• 2002

Feature-based similarity retrieval become an important research issue in image database systems. The features of image data are useful to discrimination of images. In this paper, we propose the highspeed k-Nearest Neighbor search algorithm based on Self-Organizing Maps. Self-Organizing Maps (SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space. The mapping preserves the topology of the feature vectors. The map is called topological feature map. A topological feature map preserves the mutual relations (similarity) in feature spaces of input data. and clusters mutually similar feature vectors in a neighboring nodes. Each node of the topological feature map holds a node vector and similar images that is closest to each node vector. In topological feature map, there are empty nodes in which no image is classified. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.

• Journal of the Korean Society for Precision Engineering
• /
• v.25 no.2
• /
• pp.131-139
• /
• 2008

This paper presents a new saliency map which is constructed by providing dynamic weights on individual features in an input image to search ROI(Region Of Interest) or FOA(Focus Of Attention). To construct a saliency map on there is no a priori information, three feature-maps are constructed first which emphasize orientation, color, and intensity of individual pixels, respectively. From feature-maps, conspicuity maps are generated by using the It's algorithm and their information quantities are measured in terms of entropy. Final saliency map is constructed by summing the conspicuity maps weighted with their individual entropies. The prominency of the proposed algorithm has been proved by showing that the ROIs detected by the proposed algorithm in ten different images are similar with those selected by one-hundred person's naked eyes.

• Communications of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.935-942
• /
• 2018

In this paper, we prove that any stable f-harmonic map from sphere ${\mathbb{S}}^n$ to Riemannian manifold (N, h) is constant, where f is a smooth positive function on ${\mathbb{S}}^n{\times}N$ satisfying one condition with n > 2. We also prove that any stable f-harmonic map ${\varphi}$ from a compact Riemannian manifold (M, g) to ${\mathbb{S}}^n$ (n > 2) is constant where, in this case, f is a smooth positive function on $M{\times}{\mathbb{S}}^n$ satisfying ${\Delta}^{{\mathbb{S}}^n}(f){\circ}{\varphi}{\leq}0$.

• 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.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.154-160
• /
• 1995

Maps are one of the most complicated types of drawings. Drawing recognition technology is not yet sophisticated enough for automated map reading. To automatically extract a road map directly form more complicated topographical maps, a very complicated algorithm is needed, simce the image generally involves such complicated patterns as symbols, characters, residential sections, rivers,etc. This paper describes a new feature extraction method based on the human optical neural field. We apply this method to extract complete set of road segments from topographical maps. The proposed method successfully extract road segments from various areas.

• 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.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.1
• /
• pp.17-27
• /
• 2010

A Cayley map is a 2-cell embedding of a Cayley graph into an orientable surface with the same local orientation induced by a cyclic permutation of generators at each vertex. In this paper, we provide classifications of prime-valent regular Cayley maps on abelian groups, dihedral groups and dicyclic groups. Consequently, we show that all prime-valent regular Cayley maps on dihedral groups are balanced and all prime-valent regular Cayley maps on abelian groups are either balanced or anti-balanced. Furthermore, we prove that there is no prime-valent regular Cayley map on any dicyclic group.