• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.06a
• /
• pp.12-15
• /
• 2001

본 논문에서는 고효율 멀티미디어 프로세서 아키텍쳐에 대해 논의하였다. 제안한 멀티미디어 프로세서 아케텍쳐는 제안한 방법은 기존의 멀티미디어 프로세서의 단점들인 각종 텍스트, 사운드, 비디오 등의 미디어 들을 1개의 칩 속에서 처리할 수 있도록 하였으며, 또한 멀티미디어의 특성인 상호대화식 처리도 가능하게 하였다. 특히, 완전한 그래프에 기반을 둔 네트워크를 지향하므로 소프트웨어 없이 메모리 맵의 노드어드레싱을 가능하게 하였으며, 데이터 형태에 의존하는 완전한 재구성이 가능하며 동기/비동기를 갖는 시간 공유와 공간 공유 처리가 가능하다. 또한, 연속적임과 동적인 매체 데이터의 버스 충돌을 방지할 수 있으며 지역적임과 전반적인 공유 메모리 구조로부터의 버스 충돌도 방지할 수 있으며, 또한 가상현실과 흔합현실에도 적용할 수 있으리라 사료된다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.421-425
• /
• 2006

본 논문에서는 TinyOS 기반의 센서 네트워크에 대한 리프로그래밍을 에너지 효율적으로 수행하기 위한 매커니즘을 제안한다. 베이스 스테이션에서 센서노드에게 프로그램 전체를 보내는 대신 이전 버전과의 차이인 델타를 생성해서 전송할 때 Multi-round Rsync 알고리즘을 적용해 델타 파일의 크기를 최대한 줄이는 기법과 업데이트가 불필요한 플래시메모리 페이지에 대한 업데이트를 방지하기 위한 페이지 맵 기법을 통해 Rsync만을 사용하는 기존 방식보다 최대 30% 이상 에너지를 절감할 수 있음을 확인하였다.

• Journal of Korea Game Society
• /
• v.17 no.5
• /
• pp.123-132
• /
• 2017

The path-finding algorithm refers to an algorithm for navigating the route order from the current position to the destination in a virtual world in a game. The conventional path-finding algorithm performs graph search based on cost such as A-Star and Dijkstra. A-Star and Dijkstra require movable node and edge data in the world map, so it is difficult to apply online games with lots of map data. In this paper, we provide a Heuristic-based Genetic Algorithm Path-finding(HGAP) using Genetic Algorithm(GA). Genetic Algorithm is a path-finding algorithm applicable to game with variable environment and lots of map data. It seek solutions through mating, crossing, mutation and evolutionary operations without the map data. The proposed algorithm is based on Binary-Coded Genetic Algorithm and searches for a path by performing a heuristic operation that estimates a path to a destination to arrive at a destination more quickly.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.331-339
• /
• 2004

XML has got to be a new standard for data representation and exchanging by its many good points, and the core part of many new researches and emerging technologies. However, the self-describing characteristic, which is one of XML's good points, caused the spreading of XML documents with different structures, and so the need of the research for the effective XML-document search has been proposed. This paper is for the analysis of the problem in BitCube, which is a bitmap indexing that shows high performance grounded on its fast retrieval. In addition, to resolve the problem of BitCube, we did design and implement xPlaneb(XML Plane Web) which it a new 3-dimensional bitmap indexing made of linked lists. We propose an effective information retrieval technique by replacing BitCube operations with new ones and reconstructing 3-dimensional array index of BitCube with effective nodes. Performance evaluation shows that the proposed technique is better than BitCube, as the amount of document increases, in terms of memory consumptions and operation speed.

• Journal of KIISE:Software and Applications
• /
• v.33 no.1
• /
• pp.114-129
• /
• 2006

Ontology mapping is the task of finding semantic correspondences between two ontologies. In order to improve the effectiveness of ontology mapping, we need to consider the characteristics and constraints of data models used for implementing ontologies. Earlier research on ontology mapping, however, has proven to be inefficient because the approach should transform input ontologies into graphs and take into account all the nodes and edges of the graphs, which ended up requiring a great amount of processing time. In this paper, we propose a multi-strategic mapping approach to find correspondences between ontologies based on the syntactic or semantic characteristics and constraints of the topic maps. Our multi-strategic mapping approach includes a topic name-based mapping, a topic property-based mapping, a hierarchy-based mapping, and an association-based mapping approach. And it also uses a hybrid method in which a combined similarity is derived from the results of individual mapping approaches. In addition, we don't need to generate a cross-pair of all topics from the ontologies because unmatched pairs of topics can be removed by characteristics and constraints of the topic maps. For our experiments, we used oriental philosophy ontologies, western philosophy ontologies, Yahoo western philosophy dictionary, and Yahoo german literature dictionary as input ontologies. Our experiments show that the automatically generated mapping results conform to the outputs generated manually by domain experts, which is very promising for further work.

• Journal of the Korean Geographical Society
• /
• v.39 no.5 s.104
• /
• pp.804-818
• /
• 2004

As spatial data resources become more abundant, the potential for conflict among them increases. Those conflicts can exist between two or many spatial datasets covering the same area and categories. Therefore, it becomes increasingly important to be able to effectively relate these spatial data sources with others then create new spatial datasets with matching geometry and topology. One extensive spatial dataset is US Census Bureau's TIGER file, which includes census tracts, block groups, and blocks. At present, however, census maps often carry information that conflicts with municipally-maintained detailed spatial information. Therefore, in order to fully utilize census maps and their valuable demographic and economic information, the locational information of the census maps must be reconciled with the more accurate municipally-maintained reference maps and imagery. This paper formulates a conceptual framework and two map models of map conflation to make geometrically and topologically consistent source maps according to the reference maps. The first model is based on the cell model of map in which a map is a cell complex consisting of 0-cells, 1-cells, and 2-cells. The second map model is based on a different set of primitive objects that remain homeomorphic even after map generalization. A new hierarchical based map conflation is also presented to be incorporated with physical, logical, and mathematical boundary and to reduce the complexity and computational load. Map conflation principles with iteration are formulated and census maps are used as a conflation example. They consist of attribute embedding, find meaning node, cartographic 0-cell match, cartographic 1-cell match, and map transformation.

• Journal of Educational Research in Mathematics
• /
• v.14 no.3
• /
• pp.239-266
• /
• 2004

This article presents new perspectives for analysing and diagnosing students' mathematical errors on the basis of Pascaul-Leone's neo-Piagetian theory. Although Pascaul-Leone's theory is a cognitive developmental theory, its psychological mechanism gives us new insights on mathematical errors. We analyze mathematical errors in the domain of proof problem solving comparing Pascaul-Leone's psychological mechanism with mathematical errors and diagnose misleading factors using Schoenfeld's levels of analysis and structure and fuzzy cognitive map(FCM). FCM can present with cause and effect among preconceptions or misconceptions that students have about prerequisite proof knowledge and problem solving. Conclusions could be summarized as follows: 1) Students' mathematical errors on proof problem solving and LC learning structures have the same nature. 2) Structures in items of students' mathematical errors and misleading factor structures in cognitive tasks affect mental processes with the same activation mechanism. 3) LC learning structures were activated preferentially in knowledge structures by F operator. With the same activation mechanism, the process students' mathematical errors were activated firstly among conceptions could be explained.

• The Journal of the Korea Contents Association
• /
• v.10 no.10
• /
• pp.78-85
• /
• 2010

Map/Reduce is the programing model which can implement the Cloud Computing recently has been noticed. The model operates an application program processing amount of data using a lot of computers. It is important to plan the mechanism of separating the data in proper size and distributing that to a cluster consisted of computing node in efficient for using the computing nodes very well. Besides that, planning a process of Map phases and Reduce phases also influences the performance of Map/Reduce. This paper suggests the effectively distributing scheme that separates a huge data and operates Map task in the considering the performance of computing node and network status. And we make the Reduce task can be processed quickly through the tuning the mechanism of Map and Reduce task operation. Using the two Map/Reduce sample application, we experimented the suggestion and we evaluate suggestion considered it in how impact the Map/Reduce performance.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.13-26
• /
• 2009

Wireless Sensor Networks (WSNs) is one of the key technologies that make it possible to provide u-service in a ubiquitous society, however, it has disadvantages such as difficulty of managing sensor nodes and weaknesses of stability or mobility in large-scale WSNs. In order to solve these problems, 6LoWPAN that integrates with WSNs and IP networks has been studied widely. In this paper, we propose a Location Tracking Service Based on Google Map (LTSGM) system using 6LoWPAN. Since LTSGM system provides visual location information of sensor nodes through Google Map, it is possible to makes it easier than ever to manage sensor nodes in large-scale WSNs. Moreover, LTSGM can be used for various services such as applications for disaster or crime because it can trace the location of mobile nodes. Implementation of LTSGM system will be a test platform for 6LoWPAN.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.672-674
• /
• 2010

There are various ways for expressing map on android system. The typical method is to use the API provided by Google, called geocoding although simple display of location of GPS is possible, but node expression of road or the detail information on map for various location service are not available. And it is difficult to express a location in shadow area. In this paper, to solve these problems, we propose a map expression method for location service in specific area based on geocoding and apply the method.