• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.7 no.2
• /
• pp.21-26
• /
• 1989

This module to input Korean Level Data has 4 capacities of inputing, deleting, referencing and saving. Data file of level line consists of sorted list of node on the basis of “ABSTRACT”. For easy work, interactive method was employed. As the result of removing the boring routine by applying the characteristics of level data, working efficiency was increased. This program was written in C-language and runs on a minimum hardware configuration of IBM PC/XT with 640KB memory, In the future, these unit modules combine to form Generalized Level Information System.

• Convergence Security Journal
• /
• v.22 no.2
• /
• pp.77-90
• /
• 2022

Domestic and foreign automakers compete to lead the autonomous vehicle industry through continuously developing self-driving technologies. These self-driving technologies are evolving with dependencies on the connection between vehicles and other objects such as the environment of cars and roads. Therefore, cyber security vulnerabilities become more likely to occur in the self-driving environment, so it is necessary to prepare for them carefully. In this paper, we model the threats in autonomous vehicles and make the checklist to securely countermeasure them.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.798-801
• /
• 2008

MicroC/OS-II에서는 연속된 메모리 공간으로 구성된 파티션에서 고정 크기의 메모리 블록을 할당할 수 있는 방법을 제공하며, 이 파티션은 사용 가능한 메모리 블록의 개수를 유지하고, 모두 같은 크기를 갖는 메모리 블록을 단일 연결 리스트의 형태로 관리 한다. 이런 형태의 메모리 관리 시스템은 메모리 단편화 현상이 잘 일어나지 않지만 이런 단순한 구조로 메모리 공간을 통합 관리, 블록을 할당하고 반환하는데 필요한 검사등을 효율적으로 수행할 수 없다. 본 논문에서는 MicroC/OS-II에서의 단편화문제를 해결하는 방법에 더 나아가 효율적으로 메모리를 통합하고 관리하는 방법에 대해 제안하고 자 한다.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.52-63
• /
• 2003

Spatiotemporal moving objects are changing their Positions and/or shape over time in real world. As most of the indices of moving object are based on the R-tree. they have defects of the R-tree which are dead space and overlap. Some of the indices amplify the defects of the R-tree. In the paper, to solve the problems, we propose the MPR-tree(Moving Point R-tree) using Projection operation which has more effective search than existing moving point indices on time slice query and spatiotemporal range query. The MPR-tree connects positions of the same moving objects over time by using linked list, so it processes the combined query about trajectory effectively. The usefulness of the Projection operation is confirmed during processing moving object queries and in practical use of space from experimentation to compare MPR-tree with existing indices of moving objects. The proposed MPR-tree would be useful in the LBS, the car management using GPS, and the navigation system.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.809-822
• /
• 2004

In this paper, we propose a concurrency control algorithm based on R-tree for spatial database management system. The previous proposed algorithms can't prevent problem that search operation is to be blocking during update operations. In case of multidimensional indexes like R-tree, locking of update operations may be locked to several nodes, and splitting of nodes have to lock a splitting node for a long time. Therefore search operations have to waiting a long time until update operations unlock. In this paper we propose new algorithms for lock-free search operation. First, we develop a new technique using a linked-list technique on the node. The linked-list enable lock-free search when search operations search a node. Next, we propose a new technique using a version technique. The version technique enable lock-free search on the node that update operations is to be splitting.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.1
• /
• pp.64-70
• /
• 2003

Current growth of VLSI design depends critically on the research and development (If automatic layout tool. Automatic layout is composed of placement assigning a specific shape to a block and arranging the block on the layout surface and routing finding the interconnection of all the nets. Algorithms Performing placement and routing impact on Performance and area of VLSI design. Channel routing is a problem assigning each net to a track after global routing and minimizing the track that assigned each net. In this paper we propose a genetic algorithm searching solution space for the netlist partitioning problem for 4-layer channel routing. We compare the performance of proposed genetic algorithm(GA) for channel routing with that of simulated annealing(SA) algorithm by analyzing the results which are the solution of given problems. Consequently experimental results show that out proposed algorithm reduce area over the SA algorithm.

• KIISE Transactions on Computing Practices
• /
• v.21 no.1
• /
• pp.19-28
• /
• 2015

In this paper, we proposed an algorithm for the identification of relieving or worsening current traffic congestion using historic traffic congestion patterns. Historical congestion patterns were placed in an adjacency list. The patterns were constructed to represent spatial and temporal length for status of a congested road. Then, we found information about historical traffic congestions that were similar to today's traffic congestion and will use that information to show how to change traffic congestion in the future. The most similar pattern to current traffic status among the historical patterns corresponded to starting section of current traffic congestion. One of our experiment results had average error when we compared identified changes of the congestion for one of the sections in the congestion road by using our proposal and real traffic status. The average error was 15 minutes. Another result was for the long congestion road consisting of several sections. The average error for this result was within 10 minutes.

• The KIPS Transactions:PartB
• /
• v.15B no.2
• /
• pp.137-146
• /
• 2008

Fault localization plays a significant role in enormous distributed system because it can identify root cause of observed faults automatically, supporting self-managing which remains an open topic in managing and controlling complex distributed systems to improve system reliability. Although many Artificial Intelligent techniques have been introduced in support of fault localization in recent research especially in increasing complex ubiquitous environment, the provided functions such as diagnosis and prediction are limited. In this paper, we propose fault localization for self-managing in performance evaluation in order to improve system reliability via learning and analyzing real-time streams of system performance events. We use probabilistic reasoning functions based on the basic Bayes' rule to provide effective mechanism for managing and evaluating system performance parameters automatically, and hence the system reliability is improved. Moreover, due to large number of considered factors in diverse and complex fault reasoning domains, we develop an efficient method which extracts relevant parameters having high relationships with observing problems and ranks them orderly. The selected node ordering lists will be used in network modeling, and hence improving learning efficiency. Using the approach enables us to diagnose the most probable causal factor with responsibility for the underlying performance problems and predict system situation to avoid potential abnormities via posting treatments or pretreatments respectively. The experimental application of system performance analysis by using the proposed approach and various estimations on efficiency and accuracy show that the availability of the proposed approach in performance evaluation domain is optimistic.

• Journal of The Korean Association of Information Education
• /
• v.12 no.3
• /
• pp.303-312
• /
• 2008

In correspondence to the educational demand on study of computer principles that is recently being focused, this study promotes basic understanding on data structure and algorithm at the elementary student level through the process of simple numerical expressions and proposes effective education contents and methods. For this, an unplugged type computer education material was produced to understand the method of the computers for receiving data through activities. Also, we proposed students to create animation data to learn numerical expressions and algorithm through arrangements and linked lists. To examine educational effectiveness of this study, an experiment study was conducted through the education content and method to the subject of one class in the fifth-grade of elementary school located in OO metropolitan city. As a result, the student learned that there is a difference in calculation method between computers and people; and this enabled basic understanding on algorithm and data structure and presented positive responses to algorithm and data structure. In conclusion, it is confirmed that it is possible to provide effective education for students if the principle study of algorithm is proposed to proper levels.

• Journal of KIISE
• /
• v.44 no.5
• /
• pp.496-502
• /
• 2017

Pointer Networks is a deep-learning model for the attention-mechanism outputting of a list of elements that corresponds to the input sequence and is based on a recurrent neural network (RNN). The coreference resolution for pronouns is the natural language processing (NLP) task that defines a single entity to find the antecedents that correspond to the pronouns in a document. In this paper, a pronoun coreference-resolution method that finds the relation between the antecedents and the pronouns using the Pointer Networks is proposed; furthermore, the input methods of the Pointer Networks-that is, the chaining order between the words in an entity-are proposed. From among the methods that are proposed in this paper, the chaining order Coref2 showed the best performance with an F1 of MUC 81.40 %. The method showed performances that are 31.00 % and 19.28 % better than the rule-based (50.40 %) and statistics-based (62.12 %) coreference resolution systems, respectively, for the Korean pronouns.