• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1238-1259
• /
• 2019

Saving energy is a big challenge for Wireless Sensor Networks (WSNs), which becomes even more critical in large-scale WSNs. Most energy waste is communication related, such as collision, overhearing and idle listening, so the schedule-based access which can avoid these wastes is preferred for WSNs. On the other hand, clustering technique is considered as the most promising solution for topology management in WSNs. Hence, providing interference-free clustering is vital for WSNs, especially for large-scale WSNs. However, schedule management in cluster-based networks is never a trivial work, since it requires inter-cluster cooperation. In this paper, we propose a clustering method, called Interference-Free Clustering Protocol (IFCP), to partition a WSN into interference-free clusters, making timeslot management much easier to achieve. Moreover, we model the clustering problem as a multi-objective optimization issue and use non-dominated sorting genetic algorithm II to solve it. Our proposal is finally compared with two adaptive clustering methods, HEED-CSMA and HEED-BMA, demonstrating that it achieves the good performance in terms of delay, packet delivery ratio, and energy consumption.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.4
• /
• pp.76-83
• /
• 2020

Postal logistics organizations are characterized as having high labor intensity and short response times. These characteristics, along with rapid change in mail volume, make load scheduling a fundamental concern. Load analysis of major postal infrastructures such as post offices, sorting centers, exchange centers, and delivery stations is required for optimal postal logistics operation. In particular, the performance of mail traffic forecasting is essential for optimizing the resource operation by accurate load analysis. This paper addresses a traffic forecast problem of postal parcel that arises at delivery stations of Korea Post. The main purpose of this paper is to describe a method for predicting short-term traffic of postal parcel based on self-similarity analysis and to introduce an application of the traffic prediction model to postal logistics system. The proposed scheme develops multiple regression models by the clusters resulted from feature engineering and individual models for delivery stations to reinforce prediction accuracy. The experiment with data supplied by main postal delivery stations shows the advantage in terms of prediction performance. Comparing with other technique, experimental results show that the proposed method improves the accuracy up to 45.8%.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.145-145
• /
• 2021

Water distribution networks (WDNs) are designed to satisfy water requirement of an urban community. One of the central issues in human history is providing sufficient quality and quantity of water through WDNs. A WDN consists of a great number of pipelines with different ages, lengths, materials, and sizes in varying degrees of deterioration. The available annual budget for rehabilitation of these infrastructures only covers part of the network; thus it is important to manage the limited budget in the most cost-effective manner. In this study, a novel pipe replacement scheduling approach is proposed in order to smooth the annual investment time series based on a life cycle cost assessment. The proposed approach is applied to a real WDN currently operating in South Korea. The proposed scheduling plan considers both the annual budget limitation and the optimum investment on pipes' useful life. A non-dominated sorting genetic algorithm is used to solve a multi-objective optimization problem. Three decision-making objectives, including the minimum imposed LCC of the network, the minimum standard deviation of annual cost, and the minimum average age of the network, are considered to find optimal pipe replacement planning over long-term time period. The results indicate that the proposed scheduling structure provides efficient and cost-effective rehabilitation management of water network with consistent annual budget.

• Journal of The Korean Association of Information Education
• /
• v.15 no.3
• /
• pp.375-385
• /
• 2011

Computer education is moving its focus from skill oriented education to improving students' creativity and problem solving ability. Thus, the importance of programming education is being strengthened. However, programming education was biased to grammar oriented language that has been limits of students' interest. Robot programming is problem solving itself, and by allowing students to directly see the robot which is the output of programming, can help interest and motivate to the students. In fact, it is still observed that the students are facing difficulties due to various kinds of errors during the programming education. Therefore, this study categorizes and analyzes the errors students are facing during robot programming, and based on that, a support tool to help treat errors developed. The developed supporting system for error solving reduces the frequency of errors and provides the set of coding instruction, NXC language and error message in Korean, examples and detailed information for each stage of education, function removing major coding errors, and code sorting and indication of row number. This study also confirmed that the supporting tool is helpful in reducing and solving errors after input.

• Journal of KIISE:Software and Applications
• /
• v.34 no.12
• /
• pp.1083-1092
• /
• 2007

In Unicode, two types of Hangul encoding schemes are currently in use, namely, the "precomposed modern Hangul syllables" model and the "conjoining Hangul characters" model. The current Unicode Hangul conjoining rules allow a precomposed Hangul syllable to be a member of a syllable which includes conjoining Hangul characters; this has resulted in a number of different Hangul encoding implementations. This unfortunate problem stems from an incomplete understanding of the Hangul writing system when the normalization and encoding schemes were originally designed. In particular, the extended use of old Hangul was not taken into consideration. As a result, there are different ways to represent Hangul syllables, and this cause problem in the processing of Hangul text, for instance in searching, comparison and sorting functions. In this paper, we discuss the problems with the normalization of current Hangul encodings, and suggest a single efficient rule to correctly process the Hangul encoding in Unicode.

• Smart Structures and Systems
• /
• v.16 no.2
• /
• pp.243-262
• /
• 2015

Optimal sensor placement (OSP) is a critical issue in construction and implementation of a sophisticated structural health monitoring (SHM) system. The uncertainties in the identified structural parameters based on the measured data may dramatically reduce the reliability of the condition evaluation results. In this paper, the information entropy, which provides an uncertainty metric for the identified structural parameters, is adopted as the performance measure for a sensor configuration, and the OSP problem is formulated as the multi-objective optimization problem of extracting the Pareto optimal sensor configurations that simultaneously minimize the appropriately defined information entropy indices. The nondirective movement glowworm swarm optimization (NMGSO) algorithm (based on the basic glowworm swarm optimization (GSO) algorithm) is proposed for identifying the effective Pareto optimal sensor configurations. The one-dimensional binary coding system is introduced to code the glowworms instead of the real vector coding method. The Hamming distance is employed to describe the divergence of different glowworms. The luciferin level of the glowworm is defined as a function of the rank value (RV) and the crowding distance (CD), which are deduced by non-dominated sorting. In addition, nondirective movement is developed to relocate the glowworms. A numerical simulation of a long-span suspension bridge is performed to demonstrate the effectiveness of the NMGSO algorithm. The results indicate that the NMGSO algorithm is capable of capturing the Pareto optimal sensor configurations with high accuracy and efficiency.

• Journal of the Korean Academy of Child and Adolescent Psychiatry
• /
• v.21 no.3
• /
• pp.161-167
• /
• 2010

Objectives: In assessing behavioral/emotional problems in school-aged children, the importance of multi-informant reporting has been well documented. However, in clinical settings obtaining multiple informants' opinions has proven difficult. For that reason, we researched the agreement and predictive validity of the Child Problem-Behavior Screening Questionnaire (CPSQ) in order to reveal how accurate parents' assessments reflected teachers'opinions. Methods: We conducted the first screening for second- and third-grade children from 3 elementary schools in Seoul from 2003 to 2007 using the CPSQ. There were 1178 children included in the analysis. We then administered the Korean version of the Child Behavior Checklist (K-CBCL) as a second screening tool and subsequently, the ADHD Diagnostic System (ADS) and the Korean Educational Development Institute version of the Wechsler Intelligence Scale for Children (KEDI-WISC) was administered by a psychiatrist. We examined each item on the CPSQ and the subscale's agreement between parent and teacher as well as the predictive validity of the CPSQ in children diagnosed with emotional/behavioral problems. Results: The agreement rates between parents and teachers appeared high for questions 18 (0.433), 1 (0.385), and 2 (0.325). Among the subscales, a relatively high correlation was found for externalizing problems, attention deficit hyperactivity disorder, and cognitive problems. For all diagnosed children, their parents revealed a higher sensitivity and lower specificity than teachers. Conclusion: From these results, we confirmed that the CPSQ can be useful for sorting out externalizing and cognitive problems. There is a need for further study, however, with a larger sample size.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.1
• /
• pp.227-235
• /
• 2015

In this paper, I propose a linear time algorithm devised to produce exact solution to NP-complete maximum clique problem. The proposed algorithm firstly, from a given graph G=(V,E), sets vertex $v_i$ of the maximum degree ${\Delta}(G)$ as clique's major vertex. It then selects vertex $v_j$ of ${\Delta}(G)$ among vertices $N_G(v_i)$ that are adjacent to $v_i$, only to determine $N_G(v_i){\cap}N_G(v_j)$ as candidate cliques w and $v_k$. Next it obtains $w=w{\cap}N_G(v_k)$ by sorting $d_G(v_k)$ in the descending order. Lastly, the algorithm executes the same procedure on $G{\backslash}w$ graph to compare newly attained cliques to previously attained cliques so as to choose the lower. With this simple method, multiple independent cliques would also be attainable. When applied to various regular and irregular graphs, the algorithm proposed in this paper has obtained exact solutions to all the given graphs linear time O(n).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1260-1283
• /
• 2019

Low earth orbit (LEO) satellite broadband network is a crucial part of the space information network. LEO satellite constellation design is a top-level design, which plays a decisive role in the overall performance of the LEO satellite network. However, the existing works on constellation design mainly focus on the coverage criterion and rarely take network performance into the design process. In this article, we develop a unified framework for constellation optimization design in LEO satellite broadband networks. Several design criteria including network performance and coverage capability are combined into the design process. Firstly, the quality of service (QoS) metrics is presented to evaluate the performance of the LEO satellite broadband network. Also, we propose a network stability model for the rapid change of the satellite network topology. Besides, a mathematical model of constellation optimization design is formulated by considering the network cost-efficiency and stability. Then, an optimization algorithm based on non-dominated sorting genetic algorithm-II (NSGA-II) is provided for the problem of constellation design. Finally, the proposed method is further evaluated through numerical simulations. Simulation results validate the proposed method and show that it is an efficient and effective approach for solving the problem of constellation design in LEO satellite broadband networks.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.6
• /
• pp.99-105
• /
• 2022

This paper deals with the problem of appropriately allocating multiple processors arriving at the ready queue to the block in the user space of the main memory is divided into blocks of variable size at compilation time. The existing allocation methods, first fit(FF), best fit(BF), worst fit(WF), and next fit(NF) methods, had the disadvantage of waiting for a specific processor because they failed to allocate all processors arriving at the ready queue. The proposed algorithm in this paper is a simple block packing algorithm that allocates as many processors as possible to the largest block by sorting the size of the partitioned blocks(holes) and the size of the processor in the ready queue in descending order. The application of the proposed algorithm to nine benchmarking experimental data showed the performance of allocating all processors while having minimal internal fragment(IF) for all eight data except one data in which the weiting processor occurs due to partition errors.