• Title/Summary/Keyword: Common map

Search Result 366, Processing Time 0.031 seconds

Development of a Writing Program Using a Mind-map Software (마인드맵 소프트웨어를 활용한 논술 프로그램 개발)

  • Seo, Mi-Kyung;Park, Sun-Ju
    • Journal of The Korean Association of Information Education
    • /
    • v.13 no.2
    • /
    • pp.215-224
    • /
    • 2009
  • The aim of teaching writing is not to memorize a single piece of knowledge but to acquire higher thinking that could be related to other fields using learners' various reading experiences and schemata. Among several strategies or techniques to write well, it is recommended to use a mind-map technique. A mind-map software applies the mind-map technique into computer for learners to study autonomously. However, the mind-map software is not common in educational fields yet and there are only few studies on the effect of it. Therefore, this study analyzed various curricula to extract the elements of writing and developed a mind-map software program which was applied and tested. As a result, the writing program using the mind-map software was effective in promoting learners' motivation and lowering anxiety. It also improved learners' competence of writing such as understanding, analytic thinking, creativity, ability to organize, and expression.

  • PDF

System Journey Map Based on Touch Point (터치포인트를 기반으로 한 시스템 여정 맵)

  • Yoo, Jae Yeon;Pan, Young Hwan
    • Design Convergence Study
    • /
    • v.14 no.2
    • /
    • pp.17-32
    • /
    • 2015
  • The perspectives of customers and providers as for the services have the same objective; however, perspectives and objective are distinctly different. But the existing methodologies have mostly pondered only based on the customer-centric perspective or separately from the perspective of providers. It would be necessary to take these two perspectives as a whole by combining them into one perspective since they not only have differences but also common points. Therefore, in this study suggested the System Journey Map in terms of internal staff based on the customer's task in service. System Journey Map is consists of four parts : a customer journey map, thus the performance of internal staff, internal staff satisfaction evaluation, and finally the performance of internal staff assessment of the senior staff. After releasing a service, with customers and internal staff made a point of contact to identify specific behavioral patterns and whether any part of the problem so that this toolkit gives us an expectation to be a useful map, which is the intangible being placed in service, not just visualize and understand for identifying problems.

Multi-AUV Motion Planner with Collision-Map Considering Environmental Disturbances (수중 외란을 고려한 다중 자율 잠수정의 무충돌 주행 계획기의 개발)

  • Jung, Yeun-Soo;Ji, Sang-Joon;Ko, Woo-Hyun;Lee, Beom-Hee
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • 2006.11a
    • /
    • pp.323-326
    • /
    • 2006
  • The operation planning of multi-AUV is considered as a very difficult task. This paper proposes the qualitative method about the operation plan of multi-agents. In order to achieve this goal, it applies an extension collision map method as a tool to avoide collision between multi AUVs. This tool has been developed for the purpose of collision forecasting and collision avoidance for the multi - agents system in a land where a control is much easier. This paper analyzes the avoidance value of maximum path of AUV in order to apply this to a water environment where a tidal, a wave and disturbances are common. And it suggests the method that the maximum path avoidance can be applied to the collision avoidance on the extension collision map. Finally, the result proves that multi AUVs effectively navigates to the goal point, avoiding the collision by the suggested method.

  • PDF

Efficient Processing of an Aggregate Query Stream in MapReduce (맵리듀스에서 집계 질의 스트림의 효율적인 처리 기법)

  • Choi, Hyunjean;Lee, Ki Yong
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.2
    • /
    • pp.73-80
    • /
    • 2014
  • MapReduce is a widely used programming model for analyzing and processing Big data. Aggregate queries are one of the most common types of queries used for analyzing Big data. In this paper, we propose an efficient method for processing an aggregate query stream, where many concurrent users continuously issue different aggregate queries on the same data. Instead of processing each aggregate query separately, the proposed method processes multiple aggregate queries together in a batch by a single, optimized MapReduce job. As a result, the number of queries processed per unit time increases significantly. Through various experiments, we show that the proposed method improves the performance significantly compared to a naive method.

Development of GML Map Visualization Service and POI Management Tool using Tagging (GML 지도 가시화 서비스 및 태깅을 이용한 POI 관리 도구 개발)

  • Park, Yong-Jin;Song, Eun-Ha;Jeong, Young-Sik
    • Journal of Internet Computing and Services
    • /
    • v.9 no.3
    • /
    • pp.141-158
    • /
    • 2008
  • In this paper, we developed the GML Map Server which visualized the map based on GML as international standard for exchanging the common format map and for interoperability of GIS information. And also, it should transmit effectively GML map into the mobile device by using dynamic map partition and caching. It manages a partition based on the visualization area of a mobile device in order to visualize the map to a mobile device in real time, and transmits the partition area by serializing it for the benefit of transmission. Also, the received partition area is compounded in a mobile device and is visualized by being partitioned again as four visible areas based on the display of a mobile device. Then, the area is managed by applying a caching algorithm in consideration of repetitiveness for a received map for the efficient operation of resources. Also, in order to prevent the delay in transmission time as regards the instance density area of the map, an adaptive map partition mechanism is proposed for maintaining the regularity of transmission time. GML Map Server can trace the position of mobile device with WIPI environment in this paper. The field emulator can be created mobile devices and mobile devices be moved and traced it's position instead of real-world. And we developed POIM(POI Management) for management hierarchically POI information and for the efficiency POI search by using the individual tagging technology with visual interface.

  • PDF

Propriety analysis of Depth-Map production methods For Depth-Map based on 20 to 3D Conversion - the Last Bladesman (2D to 3D Conversion에서 Depth-Map 기반 제작 사례연구 - '명장 관우' 제작 중심으로 -)

  • Kim, Hyo In;Kim, Hyung Woo
    • Smart Media Journal
    • /
    • v.3 no.1
    • /
    • pp.52-62
    • /
    • 2014
  • Prevalence of common three-dimensional display progresses, increasing the demand for three-dimensional content. Starting from the year 2010 to meet increasing 2D to 3D conversion is insufficient to meet demand content was presented as an alternative. But, Convert 2D to 3D stereo effect only emphasizes content production as a three-dimensional visual fatigue and the degradation of the Quality problems are pointed out. In this study, opened in 2011 'Scenes Guan', the 13 selected Scene is made of the three-dimensional transform the content and the Quality of the transformation applied to the Depth-Map is a visual representation of three-dimensional fatigue and, the adequacy of whether the expert has group interviews and surveys were conducted. Many of the changes are applied to the motion picture of the three-dimensional configurations of Depth-Map conversion technology used in many ways before and after the analysis of the relationship of cascade configurations to create a depth map to the stage. Experiments, presented in this study is a three-dimensional configuration of Depth-Map transformation can lower the production of a three-dimensional visual fatigue and improve the results obtained for a reasonable place was more than half of the experiment accepted the expert group to show a positive reaction were. The results of this study with a rapid movement to convert 2D images into 3D images of applying Depth-map configuration cascade manner to reduce the visual fatigue, to increase the efficiency, and has a three-dimensional perception is the result derived.

Depth Upsampler Using Color and Depth Weight (색상정보와 깊이정보 가중치를 이용한 깊이영상 업샘플러)

  • Shin, Soo-Yeon;Kim, Dong-Myung;Suh, Jae-Won
    • The Journal of the Korea Contents Association
    • /
    • v.16 no.7
    • /
    • pp.431-438
    • /
    • 2016
  • In this paper, we present an upsampling technique for depth map image using color and depth weights. First, we construct a high-resolution image using the bilinear interpolation technique. Next, we detect a common edge region using RGB color space, HSV color space, and depth image. If an interpolated pixel belongs to the common edge region, we calculate weighting values of color and depth in $3{\times}3$ neighboring pixels and compute the cost value to determine the boundary pixel value. Finally, the pixel value having minimum cost is determined as the pixel value of the high-resolution depth image. Simulation results show that the proposed algorithm achieves good performance in terns of PSNR comparison and subjective visual quality.

2D Grid Map Compensation Using ICP Algorithm based on Feature Points (특징 점 기반의 ICP 알고리즘을 이용한 2차원 격자지도 보정)

  • Hwang, Yu-Seop;Lee, Dong-Ju;Yu, Ho-Yun;Lee, Jang-Myung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.10
    • /
    • pp.965-971
    • /
    • 2015
  • This paper suggests a feature point-based Iterative Closest Point (ICP) algorithm to compensate for the disparity error in building a two-dimensional map. The ICP algorithm is a typical algorithm for matching a common object in two different images. In the process of building a two-dimensional map using the laser scanner data, warping and distortions exist in the map because of the disparity between the two sensor values. The ICP algorithm has been utilized to reduce the disparity error in matching the scanned line data. For this matching process in the conventional ICP algorithm, pre-known reference data are required. Since the proposed algorithm extracts characteristic points from laser-scanned data, reference data are not required for the matching. The laser scanner starts from the right side of the mobile robot and ends at the left side, which causes disparity in the scanned line data. By finding the matching points between two consecutive frame images, the motion vector of the mobile robot can be obtained. Therefore, the disparity error can be minimized by compensating for the motion vector caused by the mobile robot motion. The validity of the proposed algorithm has been verified by comparing the proposed algorithm in terms of map-building accuracy to conventional ICP algorithm real experiments.

Study on Cartographic Characteristics of Wood Block "DaedongyYeojiJeondo" (목판본 "대동여지전도"의 지도적 특징에 대한 연구)

  • Lee, Kibong
    • Journal of the Korean association of regional geographers
    • /
    • v.20 no.3
    • /
    • pp.300-314
    • /
    • 2014
  • The study is to systematically review "DaedongYeojiJeondo", the mid-sized wood block map of Chosun to shed light on the cartographic characteristics not discovered by previous studies. First it was discovered that Kim Jung-ho is the developer of the map as the distance information from Seoul to towns is identical with the information on "Daedong Jiji" the manuscript map drawn by Kim Jung-ho himself (assumed to live from 1804~1866) that is still remaining unfinished. Second, the information Kim Jung-ho wanted to specify most precisely and specifically was distance from Seoul to towns and for this purpose he invented unique symbols for towns in tiny size on the map. Third, in selecting information to mark on the map including road network, street information, mountain routes and streams and location of islands, "DaedongYeojiJeondo" is not just a simple smaller copy of "DaedongYeojido" but an independent creative work as it is much different in many aspects of quality. Forth, but still "DaedongYeojiJeondo" and "DaedongYeojido" have something in common in the fact both of them tried to mark land and mountain routes and streams most precisely and specifically.

  • PDF

A formal Definition of Semi-join Based Reduction Method of Petri Nets (세미죠인을 기반으로 한 패트리 넷의 형식적 정의)

  • Lee, Jong-Geun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.2
    • /
    • pp.202-214
    • /
    • 1994
  • A functional reduction method of Petri nets is proposed. The method is based on interpretation of relations and transitions with functions which map one series of a relation a another. In particular, we propose CF-join which combines two transitions to new one after reduction of the common places, CE-join which superpose two transitions to one after superposition of the common places, and EQ-join which reduces the common places, after the Petri nets were explained be a relational scheme. A reduced net can be obtained without changing the properties such as liveness and boundness.

  • PDF