Tae-Young Choe
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Tae-Young Choe has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
Chang Won Lee
Department of Computer Engineering, Kumoh National Institute of Technology, Gumi, Gyeongbuk 730-701, Korea
1 shared publication- Chanik Park
Pohang University of Science and Technology
1 shared publication Jaepil Ko
Department of Computer Engineering, Kumoh National Institute of Technology, Gumi, Gyeongbuk 730-701, Korea
1 shared publication- Masky Mackita
ING Bank, B-1040 Brussels, Belgium
1 shared publication - Soo Young Shin
Department of IT Convergence Engineering, WENS Laboratory, Kumoh National Institute of Technology, Gumi, South Korea
1 shared publication
Latest Publications
- Open Access
- 10 September 2019
- Published by MDPI AG in Future Internet
- Vol. 11 (9) , 195
ERMOCTAVE: A Risk Management Framework for IT Systems Which Adopt Cloud Computing
Many companies are adapting cloud computing technology because moving to the cloud has an array of benefits. During decision-making, having processed for adopting cloud computing, the importance of risk management is progressively recognized. However, traditional risk management methods cannot be applied directly to cloud computing when data are transmitted and processed by external providers. When they are directly applied, risk management processes can fail by ignoring the distributed nature of cloud computing and leaving numerous risks unidentified. In order to fix this backdrop, this paper introduces a new risk management method, Enterprise Risk Management for Operationally Critical Threat, Asset, and Vulnerability Evaluation (ERMOCTAVE), which combines Enterprise Risk Management and Operationally Critical Threat, Asset, and Vulnerability Evaluation for mitigating risks that can arise with cloud computing. ERMOCTAVE is composed of two risk management methods by combining each component with another processes for comprehensive perception of risks. In order to explain ERMOCTAVE in detail, a case study scenario is presented where an Internet seller migrates some modules to Microsoft Azure cloud. The functionality comparison with ENISA and Microsoft cloud risk assessment shows that ERMOCTAVE has additional features, such as key objectives and strategies, critical assets, and risk measurement criteria.
- 10 September 2019
- Published by MDPI AG in Future Internet
- Vol. 11 (9) , 195
Open AccessERMOCTAVE: A Risk Management Framework for IT Systems Which Adopt Cloud Computing
Many companies are adapting cloud computing technology because moving to the cloud has an array of benefits. During decision-making, having processed for adopting cloud computing, the importance of risk management is progressively recognized. However, traditional risk management methods cannot be applied directly to cloud computing when data are transmitted and processed by external providers. When they are directly applied, risk management processes can fail by ignoring the distributed nature of cloud computing and leaving numerous risks unidentified. In order to fix this backdrop, this paper introduces a new risk management method, Enterprise Risk Management for Operationally Critical Threat, Asset, and Vulnerability Evaluation (ERMOCTAVE), which combines Enterprise Risk Management and Operationally Critical Threat, Asset, and Vulnerability Evaluation for mitigating risks that can arise with cloud computing. ERMOCTAVE is composed of two risk management methods by combining each component with another processes for comprehensive perception of risks. In order to explain ERMOCTAVE in detail, a case study scenario is presented where an Internet seller migrates some modules to Microsoft Azure cloud. The functionality comparison with ENISA and Microsoft cloud risk assessment shows that ERMOCTAVE has additional features, such as key objectives and strategies, critical assets, and risk measurement criteria.
- Open Access
- 30 June 2014
- Published by Springer Nature in EURASIP Journal on Image and Video Processing
- Vol. 2014 (1) , 33
Two-way partitioning of a recursive Gaussian filter in CUDA
Recursive Gaussian filters are more efficient than basic Gaussian filters when its filter window size is large. Since the computation of a point should start after the computation of its neighborhood points, recursive Gaussian filters are line oriented. Thus, the degree of parallelism is restricted by the length of the data image. In order to increase the parallelism of recursive Gaussian filters, we propose a two-way partitioned recursive Gaussian filter. The proposed filter partitions a line into two lines and a point, which is used for Gaussian blur effect across the two lines. This partition increases the parallelism because the filter is applied to the two blocks in parallel. Experimental results show that the process time of the proposed filter is half compared to the time of an one-way parallel recursive Gaussian filter while the peak signal-to-noise ratio is maintained within an acceptable rate of 26 to 33 dB.
- 30 June 2014
- Published by Springer Nature in EURASIP Journal on Image and Video Processing
- Vol. 2014 (1) , 33
Open AccessTwo-way partitioning of a recursive Gaussian filter in CUDA
Recursive Gaussian filters are more efficient than basic Gaussian filters when its filter window size is large. Since the computation of a point should start after the computation of its neighborhood points, recursive Gaussian filters are line oriented. Thus, the degree of parallelism is restricted by the length of the data image. In order to increase the parallelism of recursive Gaussian filters, we propose a two-way partitioned recursive Gaussian filter. The proposed filter partitions a line into two lines and a point, which is used for Gaussian blur effect across the two lines. This partition increases the parallelism because the filter is applied to the two blocks in parallel. Experimental results show that the process time of the proposed filter is half compared to the time of an one-way parallel recursive Gaussian filter while the peak signal-to-noise ratio is maintained within an acceptable rate of 26 to 33 dB.
- 25 June 2003
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302016,p. 531-536
A task duplication based scheduling algorithm with optimality condition in heterogeneous systems
The task scheduling problem is NP-hard in heterogeneous systems. We propose a task scheduling algorithm based on task duplication with an optimality condition to determine whether or not the resulting schedule has the shortest schedule length. The optimality condition is that, given any join task, the completion time of a parent task is longer than the maximum message arrival times from the other parent tasks. An illustrative example is given to show how our algorithm differs from existing algorithms.
- 25 June 2003
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15302016,p. 531-536
A task duplication based scheduling algorithm with optimality condition in heterogeneous systems
The task scheduling problem is NP-hard in heterogeneous systems. We propose a task scheduling algorithm based on task duplication with an optimality condition to determine whether or not the resulting schedule has the shortest schedule length. The optimality condition is that, given any join task, the completion time of a parent task is longer than the maximum message arrival times from the other parent tasks. An illustrative example is given to show how our algorithm differs from existing algorithms.