• Journal of Korean Society for Atmospheric Environment
• /
• v.27 no.6
• /
• pp.772-790
• /
• 2011

In this paper, we use the HDDM (High-order Decoupled Direct Method)-driven ozone sensitivity to predict change in ozone concentrations in response to domain-wide $NO_x$(Oxides of Nitrogen) and VOC (Volatile Organic Compound) emission controls over the Seoul Metropolitan Area during June 11~19, 2007. In order to validate the applicability of HDDM to $NO_x$ and VOC control scenarios, the HDDM results are compared to Brute Force Method (BFM). For VOC controls, NME (Normalized Mean Error) between BFM and HDDM remains less than 2% until the domain-wide VOC emissions are reduced by 80%. The NME for a 40% reduction in the domain-wide $NO_x$ emissions is less than 5% but increases abruptly after further reductions in the $NO_x$ emissions (i.e., 80% reduction). The results indicates that it may be inaccurate to use ozone sensitivity coefficients estimated at a given base emission condition in predicting ozone after $NO_x$ reductions larger than ~50% of the domain total in the SMA. Therefore, HDDM application on piecewise emissions is desirable to predict ozone response to emission controls with accuracy (i.e., truck emissions rather than the domain total). For computational efficiency, HDDM shows approximately 30% faster than the BFM sensitivity approach.

• Journal of Environmental Science International
• /
• v.20 no.11
• /
• pp.1465-1481
• /
• 2011

The accuracy of ozone sensitivity coefficients estimated with HDDM (High-order Decoupled Direct Method) can vary depending on the $NO_x$ (Nitrogen Oxides) and VOC (Volatile Organic Compound) conditions. In order to evaluate the applicability of HDDM over the Seoul Metropolitan Area (SMA) during a high ozone episode in 2007 June, we compare BFM (Brute Force Method) and HDDM in terms of the $1^{st}$-order ozone sensitivity coefficient to explain ozone change in response to changes in NOx and VOC emissions, and the $2^{nd}$-order ozone sensitivity coefficient to represent nonlinear response of ozone to the emission changes. BFM and HDDM estimate comparable ozone sensitivity coefficients, exhibiting similar spatial and temporal variations over the SMAduring the episode. NME (Normalized Mean Error) between BFM and HDDM for the episode average $1^{st}$- and $2^{nd}$-order ozone sensitivity coefficients to NOx and VOC emissions are less than 3% and 9%, respectively. For the daily comparison, NME for the $1^{st}$- and $2^{nd}$-order ozone sensitivity coefficients are less than 4% ($R^2$ > 0.96) and 15% ($R^2$ > 0.90), respectively. Under the emission conditions used in this study, two methods show negative episode average $1^{st}$-order ozone sensitivity coefficient to $NO_x$ emissions over the core SMA. The $2^{nd}$-order ozone sensitivity coefficient to $NO_x$ emissions leads ozone to respond muchnonlinear to the reduction in $NO_x$ emissions over Seoul. Nonlinear ozone response to reduction in VOC emissions is mitigated due to the $2^{nd}$-order ozone sensitivity coefficient which is much smaller than the $1^{st}$-order ozone sensitivity coefficient to the emissions in the magnitude.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.545-548
• /
• 2005

Recently, the computing environment of P2P come out to solve the excessive load of the server in the computing environment of the client/server. Currently, operated computing environment of P2P is mainly spreading out P2P system of read name or anonymity base about a publisher, sender and receiver of the file. But, to the current file protection there is three problem. The first problem is to a host become attack target. The second is to received file loose attack of Brute Force. The third is to define target of attack of DOS. To solve the this problem. it divide file into block unit. Each block is safely scattered peers. This paper propose the distribution P2P system of file division. Both proposing system solve the this problem and promote efficiency of file application.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.1
• /
• pp.77-82
• /
• 2015

Recently, multi-user massive MIMO (MU-Massive MIMO) network has attracted a lot of attention as a technology to accommodate explosively increasing mobile data traffic. However, the MU-Massive MIMO network causes a tremendous hardware complexity in a base station and computational complexity to select optimal set of users. In this paper, we thus propose a simple algorithm for selecting antennas and users while reducing the hardware and computational complexities simultaneously. The proposed scheme has a computational complexity of $O((N-S_a+1){\times}min(S_a,K))$, which is significantly reduced compared to the complexity of optimal scheme based on Brute-Force searching, $$O\left({_N}C_S_a\sum_{i=1}^{min(S_a,K)}_KC_i\right)$$, where N, $S_a$, and K denote the number of total transmit antennas, the number of selected antennas, and the number of all users, respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.11
• /
• pp.1511-1517
• /
• 2018

Mobile Device-to-Device (D2D) caching networks can transmit multimedia data to users directly without passing through any network infrastructure by storing popular multimedia contents in advance that are popular among many mobile users at caching server devices (CSDs) in distributed manners. Thus, mobile D2D caching networks can significantly reduce backhaul traffic in wired networks and service latency time of mobile users. In this paper, we propose an efficient transmission scheme that can enhance the transmission efficiency of mobile D2D caching networks by using multiple CSDs that are caching the contents that are popular among mobile users. By sorting the multiple CSDs that are caching a content that mobile users want to receive according to their channel gains, the proposed scheme can reduce the complexity of algorithm significantly, compared to an optimal scheme based on Brute-force searching, and can also obtain much higher network transmission efficiency than the existing Blanket and Opportunistic transmission schemes.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.2
• /
• pp.131-138
• /
• 2011

The previous FPGA cluster systems for a brute force search of DES keyspace have showed cost efficient performance, but the research on optimized implementation of the DES algorithm on a single FPGA has been insufficient. In this paper, the optimized DES implementation for a single FPGA of the commercial FPGA cluster system with 77 Xilinx Virtex5-LX50 FPGAs is proposed. Design space exploration using the number of pipeline stages in a DES core, the number of DES cores and the maximum clock frequency of a DES core is performed which leads to integrating 16 DES cores running at 333MHz. Also low power design is applied to reduce the loss of performance caused by limitation of power supply on each FPGA which results in fitting 8 DES cores running at 333MHz. When the proposed DES implementations would be used in the FPGA cluster system, it is estimated that the DES key would be found at most 2.03 days and 4.06 days respectively.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.2
• /
• pp.9-14
• /
• 2022

This paper presents a subset sum problem (SSP) algorithm which takes the time complexity of O(nlogn). The SSP can be classified into either super-increasing sequence or random sequence depending on the element of Set S. Additive algorithm that runs in O(nlogn) has already been proposed to and utilized for the super-increasing sequence SSP, but exhaustive Brute-Force method with time complexity of O(n2ⁿ) remains as the only viable algorithm for the random sequence SSP, which is thus considered NP-complete. The proposed subtractive algorithm basically selects a subset S comprised of values lower than target value t, then sets the subset sum less the target value as the Residual r, only to remove from S the maximum value among those lower than t. When tested on various super-increasing and random sequence SSPs, the algorithm has obtained optimal solutions running less than the cardinality of S. It can therefore be used as a general algorithm for the SSP.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.6
• /
• pp.1149-1156
• /
• 2021

The Grover algorithm, which accelerates the brute force attack, is applicable to key recovery of symmetric key cryptography, and NIST uses the Grover attack cost for symmetric key cryptography to estimate the post-quantum security strength. In this paper, we estimate the attack cost of Grover's algorithm by implementing DES as a quantum circuit. NIST estimates the post-quantum security strength based on the attack cost of AES for symmetric key cryptography using 128, 192, and 256-bit keys. The estimated attack cost for DES can be analyzed to see how resistant DES is to attacks from quantum computers. Currently, since there is no post-quantum security index for symmetric key ciphers using 64-bit keys, the Grover attack cost for DES using 64-bit keys estimated in this paper can be used as a standard. ProjectQ, a quantum programming tool, was used to analyze the suitability and attack cost of the quantum circuit implementation of the proposed DES.

• Journal of the Korea Computer Graphics Society
• /
• v.28 no.2
• /
• pp.21-28
• /
• 2022

ASTC is one of the standard texture formats supported in OpenGL ES 3.2 and Vulkan 1.0 (and later versions), and it has been increasingly used on mobile platforms (Android and iOS). ASTC's most important feature is the block size configuration, thereby providing a trade-off between compression quality and rates. With the higher number of textures, however, it is difficult to manually determine the optimal block sizes of each texture. To solve the problem, we present a new approach based on PSNR values to automatically determine the ASTC block size. A brute-force approach, which compresses a texture on all block sizes and compares the PSNR values of the compressed textures, can increase the compression time by up to 14 times. In contrast, our three-step approach minimizes the compression-time overhead. According to our experiments on a texture set including 64 various textures, our method determined the block sizes from 4×4 to 12×12 and reduced the size of compressed files by 68%.

• The Journal of the Acoustical Society of Korea
• /
• v.26 no.3E
• /
• pp.69-73
• /
• 2007

This paper presents an efficient algorithm to retrieve similar music files from a large archive of digital music database. Users are able to navigate and discover new music files which sound similar to a given query music file by searching for the archive. Since most of the methods for finding similar music files from a large database requires on computing the distance between a given query music file and every music file in the database, they are very time-consuming procedures. By measuring the acoustic distance between the pre-classified music files with the same type of emotion, the proposed method significantly speeds up the search process and increases the precision in comparison with the brute-force method.