• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.11
• /
• pp.1074-1081
• /
• 2011

As robotics systems are becoming more complex there is the need to promote component based robot development, where systems can be constructed as the composition and integration of reusable building block. One of the most important challenges facing component based robot development is safeguarding against software component failures and malfunctions. The health monitoring of the robot software is most fundamental factors not only to manage system at runtime but also to analysis information of software component in design phase of the robot application. And also as a lot of monitoring events are occurred during the execution of the robot software components, a simple data treatment and efficient memory management method is required. In this paper, we propose an efficient events monitoring and data management method by modeling robot software component and monitoring factors based on robot software framework. The monitoring factors, such as component execution runtime exception, Input/Output data, execution time, checkpoint-rollback are deduced and the detail monitoring events are defined. Furthermore, we define event record and monitor record pool suitable for robot software components and propose a efficient data management method. To verify the effectiveness and usefulness of the proposed approach, a monitoring module and user interface has been implemented using OPRoS robot software framework. The proposed monitoring module can be used as monitoring tool to analysis the software components in robot design phase and plugged into self-healing system to monitor the system health status at runtime in robot systems.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.1003-1007
• /
• 2009

Client-side attacks including drive-by download target vulnerabilities in client applications that interact with a malicious server or process malicious data. A typical client-side attack is web-based one related to a malicious web page exploiting specific browser vulnerability that can execute mal ware on the client system (PC) or give complete control of it to the malicious server. To defend those attacks, this paper has constructed high interaction client honeypot system using Capture-HPC that adopts execution-based detection in virtual machine. We have detected and classified malicious web pages using the system. We have also analyzed the system's performance in terms of the number of virtual machine images and the number of browsers executed simultaneously in each virtual machine. Experimental results show that the system with one virtual machine image obtains better performance with less reverting overhead. The system also shows good performance when the number of browsers executed simultaneously in a virtual machine is 50.

• Journal of The Korean Association of Information Education
• /
• v.24 no.3
• /
• pp.233-241
• /
• 2020

This study has developed and applied an elementary EPL education program centered on execution time as an educational method for improving Computational thinking of elementary school students, and then its effect has been verified. The education program was developed based on the results of preliminary demand analysis conducted on 48 elementary school students. In order to verify the effectiveness of the education program, 25 students were asked to participate in the class of elementary school students on a seven hours for six days. Using the "Korea Bebras Challenge 2018", educational effects were analyzed through the results of pre- and post-mortem examinations, and the analysis showed that elementary EPL education centered on performance time was effective in improving computational thinking of elementary school students

• KIISE Transactions on Computing Practices
• /
• v.23 no.1
• /
• pp.45-56
• /
• 2017

In astronomy, the amount of data generated using wide-field optical telescope has increased exponentially. However, the fixed-size small-scale computing environment and the complexity of data analysis tools, results in difficulties to process the massive observation data collected. To resolve this problem, we propose a cloud-based automation system for the efficient processing of the enormous data gathered. The proposed system consists of a Workflow Execution Manager which manages various workflow templates and controls the execution of workflows instantiated from theses templates, and an Elastic Resource Manager that dynamically adds/deletes computing resources, according to the amount of data analysis requests. To show the effectiveness of our proposed system, we exhaustively explored a board spectrum of experiments, like elastic resources allocation, system load, etc. Finally, we describe the best practice case of DEEP-SOUTH scheduling system as an example application.

• Korean Journal of Construction Engineering and Management
• /
• v.6 no.2 s.24
• /
• pp.139-149
• /
• 2005

The major purpose of construction project management is to meet defined targets(scope or quality) on schedule and budget. Korean construction industry is suuering from lower productivity as compared to other industry sectors. 'Management software' of the construction industry has not been developed as fast as hardware in the aftermath of compressed economic development following the Korean War. Therefore, this study is intended to compare project execution at planning phase and at completion phase and identifying the risk factor of construction projects. Construction projects are more extensive and long-winding than any other projects and stake holders of complex interests are often involved. In this study, we identified and analyzed risk factor for domestic building construction projects and outputs of this study will be conducive to the improvement of construction management processes in the future.

• The KIPS Transactions:PartA
• /
• v.13A no.6 s.103
• /
• pp.533-540
• /
• 2006

This paper describes the design and implementation of a grid system META (Metacomputing Environment using Test-run of Application) which facilitates the execution of a CFD (Computational Fluid Dynamics) analysis program on distributed environment. The grid system META allows the CFD program developers can access the computing resources distributed over the network just like one computer system. The research issues involved in the grid computing include fault-tolerance, computing resource selection, and user-interface design. In this paper, we exploits an automatic resource selection scheme for executing the parallel SPMD (Single Program Multiple Data) application written in MPI (Message Passing Interface). The proposed resource selection scheme is informed from the network latency time and the elapsed time of the kernel loop attained from test-run. The network latency time highly influences the executional performance when a parallel program is distributed and executed over several systems. The elapsed time of the kernel loop can be used as an estimator of the whole execution time of the CFD Program due to a common characteristic of CFD programs. The kernel loop consumes over 90% of the whole execution time of a CFD program.

• Journal of Digital Contents Society
• /
• v.2 no.1
• /
• pp.9-19
• /
• 2001

Web robot is an important Internet software technology used in a variety of Internet application software which includes search engines. As Internet continues to grow, implementations of high performance Web robots are urgently demanded. For this, researches specially geared toward performance scalability of Web robots are required. Hoover, because researches are focused mostly on addressing issues related to commercial implementations, scientific researches and studies are not still made on the performance scalability. In this research, Ive choose a Web robot model implemented by fork-join based. multiprocesses. With respect to the model, we evaluate the effect on the collection efficiency that the timeout values set to requests from Web robots to Web servers have. Also, we analysed the behaviors of Web robots by comparing the execution time between the URL extraction and the uniqueness checking for the extracted URLs. as well as by comparing between the computation time and the network time. Based on the analysis result, we suggest the direction for the design of high performance Web robots.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.1008-1012
• /
• 2009

Obfuscation is known as one of the most effective methods to protect software against malicious reverse engineering transforming the software into more complicated one with still preserving the original semantic. However, obfuscating a program can increase both code size of the program and execution time compared to the original program. In mobile devices, the increases of code size and execution time incur the waste of resources including the increase of power consumption. This paper has analyzed the effectiveness of some high-level obfuscation algorithms as well as their power consumption with implementing them under an embedded board equipped with ARM processor. The analysis results show that there is (are) an efficient obfuscation method(s) in terms of execution time or power consumption according to characteristics of a given program.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.6
• /
• pp.139-143
• /
• 2018

Arduino, based on open source hardware, is used in many IoT devices, and IoT devices require multitasking for various inputs and outputs. Among the several methods used for multitasking based on Arduino, we compare three methods: Timing Call by using millis(), Simple Timer library method, and Timer library method. In order to measure the execution error caused by measurement and time delay of each method, two situations are created and analyzed. In the first case, 10 random tasks of a certain size are generated to measure the time delay of each method. In the second situation, 10 random tasks of a certain size are generated to compare execution errors caused by the time lag of the Timer library. In the first case, the millis() timing call method and the Simple Timer library method have a similar time delay and the Timer library method has more time delay. In the second situation, an execution error occurred in which small-size tasks were not called back at the correct timing due to the time delay.

• Nuclear Engineering and Technology
• /
• v.51 no.6
• /
• pp.1487-1503
• /
• 2019

The methods and performance of a pin-level nuclear reactor core thermal-hydraulics (T/H) code ESCOT employing the drift-flux model are presented. This code aims at providing an accurate yet fast core thermal-hydraulics solution capability to high-fidelity multiphysics core analysis systems targeting massively parallel computing platforms. The four equation drift-flux model is adopted for two-phase calculations, and numerical solutions are obtained by applying the Finite Volume Method (FVM) and the Semi-Implicit Method for Pressure-Linked Equation (SIMPLE)-like algorithm in a staggered grid system. Constitutive models involving turbulent mixing, pressure drop, and vapor generation are employed to simulate key phenomena in subchannel-scale analyses. ESCOT is parallelized by a domain decomposition scheme that involves both radial and axial decomposition to enable highly parallelized execution. The ESCOT solutions are validated through the applications to various experiments which include CNEN $4{\times}4$, Weiss et al. two assemblies, PNNL $2{\times}6$, RPI $2{\times}2$ air-water, and PSBT covering single/two-phase and unheated/heated conditions. The parameters of interest for validation include various flow characteristics such as turbulent mixing, spacer grid pressure drop, cross-flow, reverse flow, buoyancy effect, void drift, and bubble generation. For all the validation tests, ESCOT shows good agreements with measured data in the extent comparable to those of other subchannel-scale codes: COBRA-TF, MATRA and/or CUPID. The execution performance is examined with a mini-sized whole core consisting of 89 fuel assemblies and for an OPR1000 core. It turns out that it is about 1.5 times faster than a subchannel code based on the two-fluid three field model and the axial domain decomposition scheme works as well as the radial one yielding a steady-state solution for the OPR1000 core within 30 s with 104 processors.