• 한국연소학회:학술대회논문집
• /
• 2012.11a
• /
• pp.195-198
• /
• 2012

Numerical simulation is performed to evaluate the conditional moment closure (CMC) models for spray development, ignition, and turbulent combustion for the Engine Combustion Network (ECN) test cases. The CMC model is implemented in the open source code, OpenFOAM, to provide conditional flame structures through the solution of Eulerian as well as Lagrangian conditional transport equations. In spite of more accurate treatment of the convective term, Eulerian CMC provides similar ignition delays and lift-off lengths with Lagrangian CMC.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.1
• /
• pp.38-49
• /
• 1994

One of the most common problems encountered in the automatic translation of FORTRAN source code to VECTRAN is the occurrence of conditional transfer of control within loops. Transfers of control create control dependencies, in which the execution of a statement is dependent on the value of a variable in another statement. In this paper I propose algorithms involve an attempt to convert statements in the loop into conditional assignment statements that can be easily analyzed for data dependency, and this paper presents a simplification method for conditional assignment statement. Especially, I propose not only a method for simplifying boolean functions but extended method for n-state functions.

• Journal of the Korean Society of Combustion
• /
• v.15 no.1
• /
• pp.1-11
• /
• 2010

In this study, the coupled simulation of fuel injection model and three-dimensional KIVA-3V code was tried to develop an algorism for predicting the effects of varying fuel injection parameter on the characteristics of fuel injection and emissions. The numerical simulations were performed using STAR-CD code in order to calculate the intake air flow, and the combustion characteristics is examined by KIVA-3V code linked with the conditional moment closure(CMC) model to predict mean turbulent reaction rate. Parametric investigation with respect to twelve relevant injection parameters shows that appropriate modification of control chamber orifice diameter, needle valve spring constant and nozzle chamber orifice diameter can significantly reduce NOx and soot emissions. Consequently, it is needed to optimize the fuel injection system to reduce the specific emissions such as NOx and soot.

• International Journal of Automotive Technology
• /
• v.6 no.6
• /
• pp.571-577
• /
• 2005

Combustion of turbulent sprays in a direct injection diesel engine is modeled by the conditional moment closure (CMC) model. The CMC routines are combined with the KIVA code to provide conditional flame structures to determine mean state variables, instead of mean reaction rates. An independent transport equation is solved for each flame group with equal mass of sequentially evaporating fuel vapor. CMC calculation begins as the fuel mass for each flame group begins to evaporate with corresponding initialization conditions. Comparison is made with measured pressure traces for four operating conditions at different rpm's and injection conditions. Results show that the CMC model with multiple flame histories can successfully be applied to ignition and mixing-controlled combustion phases of a diesel engine.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.2
• /
• pp.264-276
• /
• 1995

In this paper, a technique for eliminating conditional branches in the compilers for superscalar processors is presented. The technique consists of three major steps. The first step transforms conditional branches into equivalent expressions using algebraic laws. The second step searches all possible instruction sequences for those expressions using GSO of Granlund/Kenner. Finally an optimal sequence that has the least dynamic count for the target superscalar processor is selected from the GSO output. Experiment result shows that for each conditional branch is the input program matched by one of the optimization patterns, the proposed technique outperforms more than 25% speedup of execution time over the original code when the GNU C compiler and the SuperSPARC processor are used.

• Journal of Communications and Networks
• /
• v.17 no.2
• /
• pp.198-202
• /
• 2015

This paper presents a computationally efficient implementation of a Hamming code decoder on a graphics processing unit (GPU) to support real-time software-defined radio, which is a software alternative for realizing wireless communication. The Hamming code algorithm is challenging to parallelize effectively on a GPU because it works on sparsely located data items with several conditional statements, leading to non-coalesced, long latency, global memory access, and huge thread divergence. To address these issues, we propose an optimized implementation of the Hamming code on the GPU to exploit the higher parallelism inherent in the algorithm. Experimental results using a compute unified device architecture (CUDA)-enabled NVIDIA GeForce GTX 560, including 335 cores, revealed that the proposed approach achieved a 99x speedup versus the equivalent CPU-based implementation.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.69-72
• /
• 2005

In this paper, pseudo noise (PN) code acquisition performance with multiple antennas in a UWB time hopping/code division multiple access system is analyzed. The closed form for the conditional probability is derived, using the Gauss-Hermite quadrature formula, when the signal with Gaussian distribution goes through the lognormal fading channel. The performance comparison of the above mentioned schemes shows that the code acquisition performance with a diversity combining technique, especially when increasing the number of antennas, is more robust than that using no diversity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3511-3532
• /
• 2019

Coverage-guided fuzzing is an efficient solution that has been widely used in software testing. By guiding fuzzers through the coverage information, seeds that generate new paths will be retained to continually increase the coverage. However, we observed that most samples follow the same few high-frequency paths. The seeds that exercise a high-frequency path are saved for the subsequent mutation process until the user terminates the test process, which directly affects the efficiency with which the low-frequency paths are tested. In this paper, we propose a fuzzing solution, ER-Fuzz, that truncates the recording of a high-frequency path to influence coverage. It utilizes a deep learning-based classifier to locate the high and low-frequency path transfer points; then, it instruments at the transfer position to promote the probability low-frequency transfer paths while eliminating subsequent variations of the high-frequency path seeds. We implemented a prototype of ER-Fuzz based on the popular fuzzer AFL and evaluated it on several applications. The experimental results show that ER-Fuzz improves the coverage of the original AFL method to different degrees. In terms of the number of crash discoveries, in the best case, ER-Fuzz found 115% more unique crashes than did AFL. In total, seven new bugs were found and new CVEs were assigned.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.5
• /
• pp.985-996
• /
• 2019

This paper analyzes the source code of FIPS-OpenSSL cryptographic module approved as FIPS cryptographic module in USA and shows how the selftest requirements are implemented as software cryptographic library with respect to pre-operational test and conditional tests. Even though FIPS-OpenSSL follows FIPS 140-2 standard, lots of security requirements are similar between FIPS 140-2 and Korean cryptographic module validation standards. Therefore, analysis from this paper contributes to help Korean cryptographic module vendors develop correct and secure selftest functions on their own cryptographic modules, which results in reducing the test period.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.1
• /
• pp.1-7
• /
• 1998

High-Level synthesis of digital circuits calls for automatic translation of a behavioral description to a structural design entity represented in terms of components and connection. One of the critical steps in high-level synthesis is to determine a particular scheduling algorithm that will assign behavioral operations to control states. A new scheduling algorithm called Data Availability Scheduling (DAS) for high-level synthesis is presented. It can determine an appropriate scheduling algorithm and minimize the number of states required using data availability and dependency conditions extracted from the behavioral code, taking into account of states required using data availability and dependency conditions extracted from the behavioral code, taking into account resource constraint in each control state. The DAS algorithm is efficient because data availability conditions, and conditional and wait statements break the behavioral code into manageable pieces which are analyzed independently. The output is the number of states in a finite state machine and shows better results than those of previous algorithms.