• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.30 no.2A
• /
• pp.131-136
• /
• 2010

In this study, most of famous algorithms for the corner problem are listed. By comparing these with implemented codes and theoretical dissections, new algorithms are developed. These algorithms are combined by the existing auxiliary equations. All relating algorithms are numerically tested with 3 problems. Two problems have well-known analytical solutions and the result of another example is compared with the one of the published paper. The conducted research reveals the characteristics of existing algorithms and demonstrates newly developed algorithms can produce a reasonable solution by reflecting various type of boundary conditions.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.5
• /
• pp.24-32
• /
• 2010

In this study, we have proposed a pre-processing algorithm newly developed for improving the tracking efficiency of the optical flow method. The developed pre-processing algorithm consists of a median filter, binarization, morphology, canny edge, contour detecting and an approximation method. In order to evaluate whether the optical flow tracking capacity increases, this study applied the pre-processing algorithm to the Lucas-Kanade(LK) optical flow algorithm, and comparatively analyzed its images and tracking results with those of optical flow without the pre-processing algorithm and with the existing pre-processing algorithm(composed of median filter and histogram equalization). As a result, it was observed that the tracking performance derived from the LK optical flow algorithm with the pre-processing algorithm, shows better tracking accuracy, compared to the one without the pre-processing algorithm and the one with the existing pre-processing algorithm. It seems to have resulted by successful segmentation for characteristic areas and subdivision into inner and outer contour lines.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.820-823
• /
• 2011

WSN is composed of a lot of small sensors with the limited hardware resources. In WSN, at the initial stage, sensor nodes are randomly deployed over the region of interest, and self-configure the clustered networks by grouping a bunch of sensor nodes and selecting a cluster header among them. In this paper, we propose a self-configuration routing protocol for WSN, which consists of step-wise ripple routing algorithm for initial deployment, effective joining of sensor nodes. RRA is search node in RF-coverage of each node, which result in fast network connection, reducing overall power consumption, and extending the lifetime of network.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.5
• /
• pp.723-730
• /
• 2016

Solar cells in a PV module are connected in series and parallel to produce a higher voltage and current. The PV module has performance characteristics depending on solar radiation and temperature. In addition, the PV system causes power loss by special situations, including the shadows of the surrounding environment, such as nearby buildings and trees. In other words, an increase in power loss and a decrease in life cycle can occur because of the partial shadow and hot-spot effect. Therefore, this paper proposes the optimal configuration algorithm of a bypass diode to improve the output of a PV module and one of a PV array to minimize the loss of the PV array. In addition, this paper presents a model of a PV module and PV array based on the PSIM S/W. The simulation results confirmed that the proposed optimal configuration algorithms are useful tools for improving the performance of PV system.

• Journal of Digital Convergence
• /
• v.12 no.12
• /
• pp.265-275
• /
• 2014

This paper introduces a new algorithms for reconstructing the suffix tree of character string, when a substring id deleted from the string or a string is inserted into the string as a substring. The algorithem has two main functions, delete-structure and insert-structure. The main objective of this algorithm is to save the time for constructing the suffix tree of an edited string, when the suffix tree of the original string is available. We tested the performance of this algorithm with some DNA sequences. This test shows that delete-reconstructing can save time when the length of the subsequence deleted is less than 30% of the original sequence, and the insert-reconstructing takes less time with regard to the length of inserted sequence.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.4
• /
• pp.10-18
• /
• 2002

Network topology design is a multiobjective problem with various design components. The components such as cost, message delay and reliability are important to gain the best performance. Recently, Genetic Algorithms(GAs) have been widely used as an optimization method for real-world problems such as combinatorial optimization, network topology design, and so on. This paper proposed a method of Multi-objective GA for Design of the network topology which is to minimize connection cost and message delay time. A common difficulty in multiobjective optimization is the existence of an objective conflict. We used the prufer number and cluster string for encoding, parato elimination method and niche-formation method for the fitness sharing method, and reformation elitism for the prevention of pre-convergence. From the simulation, the proposed method shows that the better candidates of network architecture can be found.

• Journal of The Korean Association of Information Education
• /
• v.19 no.4
• /
• pp.409-418
• /
• 2015

The purpose of this study is derived implications at software curriculum development utilizing the backward design model. In this study, we developed 'Algorithms and Programming' unit teaching plan based on backward design template. First, we have derived enduring understandings, essential questions, specific knowledge and skill on 'Algorithms and Programming' unit by considering the goal, content, achievement standard of Software education operating instructions. Second, we developed authentic tasks using GRASPS technic and holistic scoring rubrics. Third, we developed 7 lesson 14 WHERETO element for effective teaching in 'Algorithms and Programming' unit. Fourth, we investigated about the effectiveness of the development unit based on backward design. Backward design could be useful of developing curriculum unit and lesson plan at software education.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.8
• /
• pp.528-537
• /
• 2014

Wireless Sensor Network(WSN) is a network which consists of sensor nodes(SNs) in data collection area. It is hard for the SNs to replace battery. Thus energy and transfer efficiency is important because the energy is limited. In this paper, we propose energy-efficient data collection algorithm for wireless sensor networks by using mobile agent in distance-based cluster structure. For avoid collisions and guarantee low latency, make distance-based topology and build cluster by the topology. For performance comparison of the proposed algorithm, compare with existing mobile agent algorithm. When network constructed by 300 nodes, proposed algorithm has performance increase than existing algorithm(GCF, LCF, TBID) in network lifetime 194, 124.6, 1.46 times each and data merging energy efficiency 87.5%, 85%, 45% each.

• The KIPS Transactions:PartB
• /
• v.14B no.6
• /
• pp.461-472
• /
• 2007

The emphasis in genome projects has Been moving towards the sequence analysis in order to extract biological "meaning"(e.g., evolutionary history of particular molecules or their functions) from the sequence. Especially. palindromic or direct repeats that appear in a sequence have a biophysical meaning and the problem is to recognize interesting patterns and configurations of words(strings of characters) over complementary alphabets. In this paper, we propose an algorithm to identify variable length palindromic pairs(longer than a threshold), where we can allow gaps(distance between words). The algorithm is called palindrome algorithm(PA) and has O(N) time complexity. A palindromic pair consists of a hairpin structure. By composing collected palindromic pairs we build n-pair palindromic patterns. In addition, we dot some of the longest pairs in a circle to represent the structure of a DNA sequence. We run the algorithm over several selected genomes and the results of E.coli K12 are presented. There existed very long palindromic pair patterns in the genomes, which hardly occur in a random sequence.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2019.11a
• /
• pp.240-241
• /
• 2019

최근 객체 추적 분야에서의 딥러닝 활용도가 증가하고 있다. 대표적인 딥러닝 기반 객체 추적 시스템은 객체 검출 알고리즘과 추적 알고리즘의 연쇄된 형태로 구성된 형태이다. 따라서 추적 시스템의 성능은 객체 검출기의 성능에 매우 의전적이라는 한계점이 존재한다. 본 논문에서는 위와 같은 검출-추적의 직관적인 구조로 구성된 시스템에서 딥러닝 기반 검출기에 대한 의존성을 낮추고 또한 추적기의 동작 속도를 증가시키는 방법을 제안한다.