• 한국콘텐츠학회논문지
• /
• 제10권10호
• /
• pp.78-85
• /
• 2010

Map/Reduce 는 최근에 많은 주목을 받고 있는 클라우드 컴퓨팅을 구현하는 프로그래밍 모델이다. 이 모델은 여러 대의 컴퓨터를 이용해서 규모가 큰 데이터를 처리하는 어플리케이션에서 사용된다. 따라서 구성된 컴퓨터들을 효율적으로 사용하기 위해서 데이터를 적당한 크기로 나눈 다음 각각의 컴퓨터에 효율적으로 분배시키는 과정을 결정하는 것이 중요하다. 또한 모델을 구성하고 있는 Map 단계와 Reduce 단계를 실행하는 계획도 성능에 많은 영향을 줄 수 있다. 본 논문에서는 대용량의 데이터를 분리해서 Map 태스크를 실행하는 클라우드 컴퓨팅 노드의 성능과 네트워크의 상태를 고려한 후 각각의 컴퓨팅 노드에게 효율적으로 분배하는 방법을 제안한다. 그리고 Map 단계와 Reduce 단계에서 진행하는 방식을 튜닝하여 Reduce 작업의 처리속도를 향상시켰다. 제안된 방법은 대표적인 두 개의 Map/Reduce 어플리케이션을 이용하여 실험하고 조건에 따라 성능에 어떠한 결과를 미치는지 평가했다.

• 대한지구과학교육학회지
• /
• 제3권1호
• /
• pp.47-54
• /
• 2010

The purpose of this study is finding examine the Thinking Maps and how to use Thinking Maps effectively in Science Education. The result of this study were as follows: First, There are 8 type Maps, Circle Map, Tree Maps, Bubble Map, Double Bubble Map, Flow Map, Multi Flow Map, Brace Map, Bridge Map. Each Maps are useful in the following activities ; Circle Map-Express their thoughts. Tree Map-Activities as like determine the structure, classification, information organization. Bubble Maps-Construction. Double Bubble Map-Comparison of similarities and differences. Flow Map-Set goals, determine the result of changes in time or place. Multi Flow Map-Analysis cause and effect, expectation and reasoning. Brace Map-Analysis whole and part. Bridge Map-Activities need analogies. Second, each element of inquiry has 1~2 appropriate type of Thinking Maps. So student can choose the desired map. Third, the result of analysing of Science Curriculum Subjects, depending on the subject variety maps can be used. Therefore the Thinking Maps can be used for a variety on activities and subject. And student can be selected according to their learning style. So Thinking Maps are effective to improve student's Self-Directed Learning.

• 한국미생물·생명공학회지
• /
• 제51권1호
• /
• pp.26-31
• /
• 2023

A map gene encoding methionyl-specific aminopeptidase (MAP; EC 3.4.11.18) was cloned from Tetragenococcus halophilus CY54. Translated amino acid sequence of CY54 MAP showed high similarities with those from Enterococcus faecalis (83.8%) and Streptococcus salivarius (62.2%) but low similarities with MAPs from Lactobacillus and Lactococcus genera. The map gene was overexpressed in E. coli BL21(DE3) using pET26b(+),pET26b(+), and the recombinant MAP was purified by using an Ni-NTA column. The size of recombinant MAP was 29 kDa as determined by SDS-PAGE. The optimum pH and temperature of CY54 MAP were pH 5.0 and 60℃, respectively. The activity of CY54 MAP was most significantly increased by Co²⁺ ion (159%), and showed the highest activity at 12% NaCl. K_m and V_max were 0.64 ± 0.006 mM and 10.12 ± 0.014 U/mg protein, respectively when met-pNA was used as the substrate. This is the first report on a MAP from Tetragenococcus species.

• 한국측량학회:학술대회논문집
• /
• 한국측량학회 2006년도 춘계학술발표회 논문집
• /
• pp.405-410
• /
• 2006

The digital map version 2.0 is national base map which is used for frame work data, paper map making as well as geographic information system. National Geographic Institude has been research to make small scale digital map by using large scale digital map. NGI made from 25 1/5,000 digital maps to one 1/25,000 digital map ver 2.0 with map generalization system in 2003. However, they could not make 1/10,000 and l/50,000 digital map version 2.0 because of There is no portrayal on the scale 1/10,000 and 1/50,000 digital map in the existing regulations. therefore. We create the specification of the digital map on scale in order to make small scale digital map version 2.0 such as 1/10,000 and 1/50,000 scale.

• 한국컴퓨터정보학회논문지
• /
• 제19권2호
• /
• pp.91-99
• /
• 2014

본 논문은 '바다지도' 데이터를 이용한 지도 기반의 응용시스템을 위한 '바다지도' 데이터 입력 모듈의 설계 및 구현에 관한 것이다. '바다지도' 데이터 입력 모듈은 응용시스템에서 '바다지도' 데이터를 시스템의 내부 자료 구조 및 형식으로 쉽게 변경하여 사용할 수 있도록 일관된 형식으로 '바다지도' 데이터를 입력하여 제공한다. '바다지도' 데이터 입력 모듈의 설계는 '바다지도' 데이터 특성 분석을 바탕으로 하였다. 국제수로기구의 S-57 전자해도 표준의 데이터 형식과 '바다지도' 데이터의 데이터 형식을 비교 분석하고, 이를 바탕으로 전자해도 표준에 따른 전자해도 데이터의 디스플레이 표준인 S-52 표준의 적용이 가능하도록 '바다지도' 데이터를 위한 자료구조를 정의하였다. 그리고 배포형식의 '바다지도' 데이터 셋을 해도 응용시스템에서 이용할 수 있도록 '바다지도' 데이터를 파싱하여 객체를 중심으로 정의한 자료구조로 변환하는 입력 모듈을 설계하고 구현하였다. 또한 '바다지도' 데이터 입력 모듈의 테스트를 위해 '바다지도' 뷰어를 구현하여, 입력 모듈을 테스트하였다.

• 대한수학회보
• /
• 제46권2호
• /
• pp.303-309
• /
• 2009

Cryptographic protocols depend on the hardness of some computational problems for their security. Joux briefly summarized known relations between assumptions related bilinear map in a sense that if one problem can be solved easily, then another problem can be solved within a polynomial time [6]. In this paper, we investigate additional relations between them. Firstly, we show that the computational Diffie-Hellman assumption implies the bilinear Diffie-Hellman assumption or the general inversion assumption. Secondly, we show that a cryptographic useful self-bilinear map does not exist. If a self-bilinear map exists, it might be used as a building block for several cryptographic applications such as a multilinear map. As a corollary, we show that a fixed inversion of a bilinear map with homomorphic property is impossible. Finally, we remark that a self-bilinear map proposed in [7] is not essentially self-bilinear.

• 한국정보시스템학회지:정보시스템연구
• /
• 제18권3호
• /
• pp.327-349
• /
• 2009

Traditional keyword-based searching methods suffer from low accuracy and high complexity due to the rapid growth in the amount of information. Accordingly, many researchers attempt to implement a so-called semantic search which is based on the semantics of the user's query. Semantic information can be described using a semantic modeling language, such as Topic Map. In this paper, we propose a new method to map a topic map to a traditional Relational Database (RDB) without any information loss. Although there have been a few attempts to map topic maps to RDB, they have paid scant attention to handling multi-role topics. In this paper, we propose a new storage structure to map multi-role topics to traditional RDB. The proposed structure consists of a mapping table, role tables, and content tables. Additionally, we devise a query translator to convert a user's query to one appropriate to the proposed structure.

• 충청수학회지
• /
• 제13권1호
• /
• pp.87-94
• /
• 2000

In this paper we shall de ne a concept of ${\pi}_1$-category for a map relative to a subset which is a generalization of both the category for a map and the ${\pi}_1$-category of a space, and study some properties of the ${\pi}_1$-category for a map relative to a subset.

• 한국멀티미디어학회논문지
• /
• 제20권8호
• /
• pp.1216-1223
• /
• 2017

Because of the open data in public domains, it is easy to collect the public data. However, people find difficulty in visualizing the data in material that they actually want. Especially, A map is a difficult material to do the visualization work, without using the specific tools and learning. Therefore, in this paper, we proposed an interface tool for map data visualization that user can easily visualize various national statistics data on the map. We designed the interface by classifying the properties of the map systematically, focusing on the completion and convenience for making the map. After that, we developed a web-based application using D3.js. After user evaluation, we found that our application can visualize the map more quickly and completely than any other web interfaces for map data visualization. Users also found a higher satisfaction in operating convenience.

• 로봇학회논문지
• /
• 제4권4호
• /
• pp.298-304
• /
• 2009

This paper describes an algorithm that improves 3D reconstruction result using a multi-sensor fusion disparity map. We can project LRF (Laser Range Finder) 3D points onto image pixel coordinatesusing extrinsic calibration matrixes of a camera-LRF (${\Phi}$, ${\Delta}$) and a camera calibration matrix (K). The LRF disparity map can be generated by interpolating projected LRF points. In the stereo reconstruction, we can compensate invalid points caused by repeated pattern and textureless region using the LRF disparity map. The result disparity map of compensation process is the multi-sensor fusion disparity map. We can refine the multi-sensor 3D reconstruction based on stereo vision and LRF using the multi-sensor fusion disparity map. The refinement algorithm of multi-sensor based 3D reconstruction is specified in four subsections dealing with virtual LRF stereo image generation, LRF disparity map generation, multi-sensor fusion disparity map generation, and 3D reconstruction process. It has been tested by synchronized stereo image pair and LRF 3D scan data.