• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.1053-1056
• /
• 2008

통신에서 이미지의 보안을 유지하는 일이 점점 중요한 이슈가 되고 있다. 그러나 기존의 여러 암호화 기법 통신상의 다양한 보안요구를 충족하지 못하고 있는 것이 현실이다. 이 논문에서는 새로운 암호화 전략이 제안되고 구현된다. 이는 통상적으로 카오스라 하는 암화 이미지와 원 이미지 간에 관계가 카오스적인, 패턴이 없는 무질서와 혼합적 구조를 가지고 있으나 그럼에도 불구하고 원래의 이미지로 돌아 올 수 있다. 여기에서는 이러한 카오스적 형태의 암호화 전략을 제안하고 구현하여 향후 나아간 연구를 자극하고자 한다.

• Journal of Korean Biological Nursing Science
• /
• v.17 no.4
• /
• pp.356-362
• /
• 2015

Purpose: The purpose of this study was to explore the experiences of nursing students in Korea who used concept mapping for understanding pathophysiology. Methods: The data were collected using an open-ended questionnaire from 83 sophomore nursing students after studying concept mapping in pathophysiology class. Each group consisted of five nursing students submitting four concept maps regarding cell injury, inflammation, infection, and neoplasm. After familiarity with concept mapping, the participants wrote their experiences anonymously on sheets of paper. The submitted materials were analyzed via qualitative content analysis. Results: The collected materials were classified into 3 themes, 8 categories, and 18 subcategories. Three themes emerged: (1) awareness of capabilities, (2) difficulties of completion, and (3) benefits of application. Conclusion: The study revealed that participants experienced self-capabilities, and the difficulties and benefits of concept mapping. Concept mapping also provided the opportunity for nursing students to realize communication skill improvement by active group discussion within a group.

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

• Communications of the Korean Mathematical Society
• /
• v.30 no.4
• /
• pp.349-361
• /
• 2015

A fence is an ordered set that the order forms a path with alternating orientation. Let F = (F;${\leq}$) be a fence and let OT(F) be the semigroup of all order-preserving self-mappings of F. We prove that OT(F) is coregular if and only if ${\mid}F{\mid}{\leq}2$. We characterize all coregular elements in OT(F) when F is finite. For any subfence S of F, we show that the set COTS(F) of all order-preserving self-mappings in OT(F) having S as their range forms a coregular subsemigroup of OT(F). Under some conditions, we show that a union of COTS(F)'s forms a coregular subsemigroup of OT(F).

• East Asian mathematical journal
• /
• v.18 no.1
• /
• pp.127-136
• /
• 2002

In this paper we obtain some fixed points theorems of expansive mappings and several necessary and sufficient conditions for the existence of common fixed points of families of self-mappings in metric spaces. Our results generalize and improve the main results of Fisher [1]-[5], Furi-Vignoli [6], $Is\'{e}ki$ [7], Jungck [8], [9], Kashara-Rhoades [10], Liu [13], [14] and Sharma and Strivastava [16].

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.4
• /
• pp.799-813
• /
• 2012

In this paper, we first show that the iteration {$x_n$} defined by $x_{n+1}=P((1-{\alpha}_n)x_n +{\alpha}_nTP[{\beta}_nTx_n+(1-{\beta}_n)x_n])$ converges strongly to some fixed point of T when E is a real uniformly convex Banach space and T is a quasi-nonexpansive non-self mapping satisfying Condition A, which generalizes the result due to Shahzad [11]. Next, we show the strong convergence of the Mann iteration process with errors when E is a real uniformly convex Banach space and T is a quasi-nonexpansive self-mapping satisfying Condition A, which generalizes the result due to Senter-Dotson [10]. Finally, we show that the iteration {$x_n$} defined by $x_{n+1}={\alpha}_nSx_n+{\beta}_nT[{\alpha}^{\prime}_nSx_n+{\beta}^{\prime}_nTx_n+{\gamma}^{\prime}_n{\upsilon}_n]+{\gamma}_nu_n$ converges strongly to a common fixed point of T and S when E is a real uniformly convex Banach space and T, S are two quasi-nonexpansive self-mappings satisfying Condition D, which generalizes the result due to Ghosh-Debnath [3].

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.9
• /
• pp.512-519
• /
• 2000

A Neural networks has been used for a expert system and fault diagnosis system. It is possible to nonlinear function mapping and parallel processing. Therefore It has been developing for a Diagnosis system of nuclear plower plant. In general Neural Networks is a static mapping but Dynamic Neural Network(DNN) is dynamic mapping.쪼두 a fault occur in system a state of system is changed with transient state. Because of a previous state signal is considered as a information DNN is better suited for diagnosis systems than static neural network. But a DNN has many weights so a real time implementation of diagnosis system is in need of a rapid network architecture. This paper presents a algorithm for RCP monitoring Alarm diagnosis system using Self Dynamic Neural Network(SDNN). SDNN has considerably fewer weights than a general DNN. Since there is no interlink among the hidden layer. The effectiveness of Alarm diagnosis system using the proposed algorithm is demonstrated by applying to RCP monitoring in Nuclear power plant.

• East Asian mathematical journal
• /
• v.22 no.1
• /
• pp.35-51
• /
• 2006

This paper deals with a general contraction. Two fixed-point theorems for a limit weak-compatible pair of a multi-valued map and a self map on a D-metric space have been established. These results improve significantly, the main results of Dhage, Jennifer and Kang [5] by reducing its assumption and generalizing its contraction simultaneously. At the same time some results of Singh, Jain and Jain [12] are generalized from a self map to a pair of a set-valued and a self map. Theorems of Veerapandi and Rao [16] get generalized and improved by these results. All the results of this paper are new.

• Korean Journal of Mathematics
• /
• v.30 no.2
• /
• pp.297-304
• /
• 2022

Fixed point theory has many useful applications in applied sciences. The object of this paper is to obtain fixed point for continuous self mappings in Hilbert C^*-module with rational conditions.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.4
• /
• pp.442-448
• /
• 2011

There are many research results about a self-localization technique of mobile robot. In this paper we present a self-localization technique based on the features of ceiling vision using a fisheye lens. The features obtained by SIFT(Scale Invariant Feature Transform) can be used to be matched between the previous image and the current image and then its optimal function is derived. The fisheye lens causes some distortion on its images naturally. So it must be calibrated by some algorithm. We here propose some methods for calibration of distorted images and design of a geometric fitness model. The proposed method is applied to laboratory and aile environment. We show its feasibility at some indoor environment.