• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제14권2호
• /
• pp.63-70
• /
• 2007

In this paper, we introduce the concepts of r-gp-open map, weakly r-gp-open map, intuitionistic fuzzy r-compactness, nearly intuitionistic fuzzy r-compactness and almost intuitionistic fuzzy r-compactness defined by intuitionixtic gradations of openness, and obtain some characterizations.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2007년도 춘계학술대회 학술발표 논문집 제17권 제1호
• /
• 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.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제1권1호
• /
• pp.62-68
• /
• 2001

In this paper, we introduce the concepts of fuzzy r-pre-semiopen and r-pre-semiclosed sets. With them we define fuzzy r-pre-semiinterior and r-pre-semiclosure. We also introduce and investigate the properties of a fuzzy r-pre-semicontinuous map, a fuzzy r-pre-semiopen map and a fuzzy r-pre-semiclosed map. These concepts are generalizations of the Bai Shi-Zhongs fuzzy pre-semicontinuity.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제14권4호
• /
• pp.271-278
• /
• 2007

Let R be a 2-torsion free semiprime ring. Suppose that there exists a 4-permuting 4-derivation ${\Delta}:R{\times}R{\times}R{\times}R{\rightarrow}R$ such that the trace is centralizing on R. Then the trace of ${\Delta}$ is commuting on R. In particular, if R is a 3!-torsion free prime ring and ${\Delta}$ is nonzero under the same condition, then R is commutative.

• 디지털융복합연구
• /
• 제14권3호
• /
• pp.251-260
• /
• 2016

과학기술 및 R&D 연구자는 선행 연구와 그 개발 결과에 대해 조사 분석하는데 많은 시간을 소비한다. 그리고 최근에는 효과적인 정보검색을 위해 시맨틱 웹을 비롯한 다양한 검색기술을 제공하고 있으며, 특히 온톨로지를 이용한 검색기술은 가장 효과적인 방법으로 알려져 있다. 이에, 본 연구는 국가 R&D정보(사업 및 과제정보), 그 사업 및 과제 수행을 통한 성과물(논문, 특허, 보고서, 기술이전 정보 등), 그리고 사업 및 과제와 연관된 정보(동향, 연구자, 용어 정보 등)를 연계하여 지식베이스(RDF-Triple)를 모델링하고, 이를 지식맵 서비스로 구현하여 연구자에게 국가 R&D정보를 한 눈에, 한 곳에서 국가 R&D정보를 살펴볼 수 있게 하는 것이다. 이를 통해, 정책가(정책입안자)에게는 R&D 전략 수립 과정 및 의사 결정을 지원할 수 있으며, 연구자에게는 선행 연구에 대한 조사 분석 시간 단축 및 새로운 연구 주제를 도출할 수 있는 기회를 제공할 수 있다.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.988-990
• /
• 2003

IKONOS image mapping is being considered a possible replacement to the traditional mapping in many countries due to their ease of access to current data and their potential high resolution. Survey Department of His Majesty's Government completed traditional orthophoto mapping of all urban and semi-urban areas of the country. The 1:5000 monochrome orthophoto maps of Kathmandu Valley were completed in 2003. In 2002, as a test, production of a near natural colour Image Map at 1:5000 scale of a part of Kathmandu Valley based on IKONOS data was carried out. A conventional line map plotting of the same area at 1:5000 was also prepared. The objective of the pilot project was to assess the geometric accuracy and the information content of these maps. The details of the study and their results are underlined. The findings of the study helps to explain whether IKONOS image map can replace conventional orthophoto map at 1:5,000 for urban areas of Nepal like Kathmandu.

• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2003년도 Proceeding
• /
• pp.223-230
• /
• 2003

Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R＊-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R＊-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R＊-tree combines SOM and R＊-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R＊-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R＊-tree with that of an SOM and an R＊-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R＊-tree outperforms both the SOM and R＊-tree due to the reduction of the number of nodes required to build R＊-tree and retrieval time cost.

• 한국한의학연구원논문집
• /
• 제16권1호
• /
• pp.93-99
• /
• 2010

When researchers plan R&D projects, they usually use patent map or paper map for the objective decision-making, but in traditional korean medicine field, domestic patents and papers have been mainly proposed as results of many R&D projects, while most of patent or paper map tools support international patents and SCI papers, respectively. Therefore, as an alternative one KIOM constructed the project map which can provide the technology landscape for R&D project information in traditional korean medicine field. But the functions of the system is limited to the search and analysis with chart. So sophisticated analysis results are hard to get from the existing system. This research's goal is to upgrade the web based project map analysis system to provide researcher rich functionality and advanced analysis tools.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.900-903
• /
• 1996

The objective of this paper is to make the weighted graph map for path planning using the ultrasonic sensor measurements that are acquired when an A.M.R (autonomous mobile robot) explores the unknown circumstance. First, The A.M.R navigates on unknown space with wall-following and gathers the sensor data from the environments. After this, we constructs the occupancy grid map by interpreting the gathered sensor data to occupancy probability. For the path planning of roadmap method, the weighted graph map is extracted from the occupancy grid map using morphological image processing and thinning algorithm. This methods is implemented on an A.M.R having a ultrasonic sensor.

• 대한수학회지
• /
• 제35권2호
• /
• pp.315-330
• /
• 1998

Chen and Piccinni [7] have classified all compact surfaces in a Euclidean space $R^{2＋p}$ with 1-type generalized Gauss map. Being motivated by this result, the purpose of this paper is to consider the Lorentz version of the classification theorem and to obtain a complete classification of space-like surfaces in indefinite Euclidean space $R_{p}$ $^{2＋p}$ with 1-type generalized Gauss map.p.