• Spatial Information Research
• /
• v.19 no.3
• /
• pp.43-52
• /
• 2011

Recently, interest in location-based service (LBS) which utilizes a DBMS in mobile system environment has been increasing, and it is expected to overcome the existing file-based system's limitation in advanced in-vehicle system by utilizing DBMS's advantages such as efficient storage, transaction management, modelling and spatial queries etc. In particular, the road network data corresponds to the most essential domain in a route planning system, which needs efficient management and maintenance. Accordingly, this study aims to develop an efficient graph-based geodata model for topological network data and to support dynamic path computation algorithm based on heuristic approach in mobile LBS system. To achieve this goal, we design a data model for supporting the hierarchy of network, and implement a path planning system to evaluate its performance in mobile LBS system. Last but not least, we find out that the designed path computation algorithm with hierarchical graph model reduced the number of nodes used for finding and improved the efficiency of memory.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.2
• /
• pp.1-8
• /
• 2011

An underwater robot S/W framework consists of various sub-modules such as sensory data processing module, thruster control module, cognition module and behavior control module. Performance of a robot is determined by not only the efficiency of algorithms used but also effectiveness of their implementations. One most important factor of the effective implementation is the efficiency of data sharing module, as it transmits signals and data between the sub-modules and thus is directly related to the cycles of sensing and control The ideal data sharing module enables immediate access to any data source irrespective of system configurations. In reality, however, there are lots of obstacles including limitation of processing capacity of source modules, delay over network, and scheduling latency of operating systems. The paper proposes a new data sharing architecture and programming models to effectively handle such obstacles in implementation of underwater S/W framework on a small scale distributed computing system.

• The Journal of Korean Association of Computer Education
• /
• v.10 no.3
• /
• pp.9-17
• /
• 2007

This study compared and analysed computer textbooks of the middle school from South Korea and North Korea for preparing the unification of the Korean Peninsula. According to the result of this study, the contents of South Korea textbook were equally selected from all scopes. By contrast, the contents of North Korea mostly consisted of the basic knowledge of computer, word-processing excluding the newest contents as Internet or Multimedia. But with the BASIC programming and algorithm for enhancement of the creative solving ability, prospective IT brains had been trained in North Korea. Moreover, due to differences of language policy and country that delivered IT technology, significant differences were found between South and North Korea in IT terminology. For preparing IT education after unification of the Korean Peninsula, both efforts of people who work in the fields of IT and school system in South and North Korea should be taken in order to relieve these differences.

• Journal of Korea Multimedia Society
• /
• v.14 no.8
• /
• pp.981-991
• /
• 2011

MIP(Maximum Intensity Projection) is a volume rendering technique which is essential for the medical imaging system. MIP rendering based on the ray casting method produces high quality images but takes a long time. Our aim is improvement of the rendering speed using GPGPU(General-purpose computing on Graphic Process Unit) technique. In this paper, we present the ray casting algorithm based on CUDA(an acronym for Compute Unified Device Architecture) which is a programming language for GPGPU and we suggest new acceleration methods for CUDA. In detail, we propose the block based space leaping which skips unnecessary regions of volume data for CUDA, the bisection method which is a fast method to find a block edge, and the initial value estimation method which improves the probability of space leaping. Due to the proposed methods, we noticeably improve the rendering speed without image quality degradation.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.36 no.4
• /
• pp.465-474
• /
• 2012

In this study, a dynamic simulation model that considers many spherical particles and multibody dynamics (MBD) entities is developed. Plenteous spherical particles are solved using the Discrete Element Method (DEM) technique and simulated on a GPU board in a PC. A fast algorithm is used to calculate the Hertzian contact forces between many spherical particles, and NVIDIA CUDA is used to increase the calculation speed. The explicit integration method is applied to solve the many spheres. MBD entities are simulated by recursive formulation. Constraints are reduced by recursive formulation, and the implicit generalized alpha method is applied to solve the dynamic model. A new algorithm is developed to simulate the DEM and MBD models simultaneously. As a numerical example, a truck car model and gear model are developed. The results show that the proposed algorithm using a general-purpose GPU in a PC has many advantages.

• The Journal of the Korea Contents Association
• /
• v.11 no.5
• /
• pp.75-83
• /
• 2011

Aspect-oriented programming is the paradigm which extracts crosscutting concern from a system and solves scattering of a function and confusion of a code through software modularization. Existing aspect developing method has a difficult to extract a target area, so it is not easy to apply aspect mining. In an aspect minning, it is necessary a technique that convert existing program refactoring elements to crosscutting area. In the paper, it is suggested an aspect mining technique for extracting crosscutting concern in a system. Using abstract syntax structure specification, extract functional duplicated relation elements. Through Apriori algorithm, it is possible to create a duplicated syntax tree and automatic creation and optimization of a duplicated source module, target of crosscutting area. As a result of applying module of Berkeley Yacc(berbose.c) to mining process, it is confirmed that the length and volume of program has been decreased of 9.47% compared with original module, and it has been decreased of 4.92% in length and 5.11% in volume compared with CCFinder.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.33 no.9
• /
• pp.104-112
• /
• 2005

This paper presents the technique to develop an operational flight program(OFP) of avionic system computer(ASC) which integrates the avionics control, navigation and fire control and provides informations for flight, navigation and weapon aiming missions. For the development of the OFP of ASC, two i960KB chips are used as central processing units board and standard computer interface library(SCIL) which is built in house is used. The Irvine compiler corporation(ICC) integrated development environment(IDE) and the programming language Ada95 are used for the OFP development. We designed the OFP to a computer software configuration item(CSCI) which consists of to three parts for independency of software modules. The OFP has been verified through a series of flight tests. The relevant tests also have been rigorously conducted on the OFP such as software integrated test, and ground functional test.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.17-27
• /
• 2012

Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. This paper explores the issue of designing proper data allocation on multiple broadcast channels to reduce this wait time, and proposes a new data allocation scheme named near optimal data allocation(NODA). The proposed scheme first partitions all data items in K group based on the theoretical lower-bound of the average expected delay to determine data items which each broadcast channel has to broadcast. Then, NODA further partitions each group of data items in B groups using extended dynamic programming algorithm to broadcast data items allocated on the same broadcast channel in different frequencies. The proposed scheme is capable of minimizing the average expected delay time since it can broadcast data items allocated on the same channel reflecting their popularities.

• Journal of The Korean Association of Information Education
• /
• v.22 no.4
• /
• pp.419-425
• /
• 2018

The national curriculum includes the problem solving process, algorithms, and programming of SW education. The education using robots is one of attractive alternatives for students who have no interest of SW or are poor at programming. We have developed a courseware using robots for SW education based on paper art activities with narrative storytelling to enhance students' creative thinking and problem solving within limitation of class time in schools. We apply the courseware and obtained the result of pre and post-test on the creative problem solving ability of third graders in the elementary school The four factors of creative problem solving have shown significantly increase. In addition, it had an significant effects for understanding robot technology and for learning attitude using robots of SW or programming.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.5
• /
• pp.64-73
• /
• 2011

The problem of Euclidean minimum spanning tree (EMST) is to connect given nodes in a plane with minimum cost. There are many algorithms for the polynomial time problem as EMST. However, for numerous nodes, the algorithms consume an enormous amount of time to find an optimal solution. In this paper, an approximation scheme using a polynomial time approximation scheme (PTAS) algorithm with dividing and parallel processing for the problem is suggested. This scheme enables to construct a large, approximate EMST within a short duration. Although initially devised for the non-polynomial problem, we employ naive PTAS to construct a vast EMST with dynamic programming. In an experiment, the approximate EMST constructed by the proposed scheme with 15,000 input terminal nodes and 16 partition cells shows 89% and 99% saving in execution time for the serial processing and parallel processing methods, respectively. Therefore, our scheme can be applied to obtain an approximate EMST quickly for numerous input terminal nodes.