• Nuclear Engineering and Technology
• /
• v.55 no.4
• /
• pp.1448-1459
• /
• 2023

A key element of the safety analysis is Loss of Coolant Analysis (LOCA) which must be performed using system thermal-hydraulic codes. These codes are extensively validated against separate effect and integral experiments. RELAP/SCDAPSIM is one such code that may be used to predict LBLOCA response in a CANDU reactor. The RD-14M experiment selected for the Best Estimate Plus Uncertainty study is a 44 mm (22.7%) inlet header break test with no Emergency Coolant Injection. This work has two objectives first is to simulate pipe break with RELAP and compare these results to those available from experiment and from comparable TRACE calculations. The second objective is to quantify uncertainty in the fuel element sheath (FES) temperature arising from model coefficient as well as input parameter uncertainties using Integrated Uncertainty Analysis package. RELAP calculated results are found to be in good agreement with those of TRACE and with those of experiments. The base case maximum FES temperature is 335.5 ℃ while that of 95% confidence 95^th percentile is 407.41 ℃ for the first order Wilk's formula. The experimental measurements fall within the predicted band and the trends and sensitivities are similar to those reported for the TRACE code.

• Journal of the Korean Society of Combustion
• /
• v.17 no.2
• /
• pp.1-8
• /
• 2012

Laminar flame speeds of Methane at elevated temperatures and pressures were investigated using constant volume spherical chamber. Pressure trace during combustion was measured in each test and this was used in calculating laminar flame speed of Methane. To have large amount of data, experimental apparatus was fabricated with fully automatically controlled feature. A calculating code which calculates laminar flame speeds at various temperatures and pressures with one experimental result was used to calculate laminar flame speeds. The experimental and calculating methods were verified using the calculated laminar flame speed result with PREMIX code.

• 한국전산유체공학회:학술대회논문집
• /
• 2002.10a
• /
• pp.144-149
• /
• 2002

This paper presents the result of numerical simulation of particles trace following melted zinc movement with nitrogen gas injection. The code of the computational fluid dynamics for numerical analysis was performed using FLUENT related to CFD. As application model, there was applied Eulerian multiphase model for simulation of melted zinc movement at first and then was used stochastic tracking technique for particles trace secondarily. Numerical simulation results are shown that particles move to the same direction as the movement of melted zinc.

• The KIPS Transactions:PartD
• /
• v.16D no.2
• /
• pp.213-222
• /
• 2009

Traceability has been held as an important factor in testing activities as well as model driven development. Vertical traceability affords us opportunities to improve manageability from models and test cases to code in testing and debugging phase. Traceability also overcomes difficulties by the separation between abstraction levels when we trace errors from models to source code after test. To support a rigorous test this paper proposes XML based traceability which vertically trace from model and test case to source code. This paper explains how the traceability works and finds out error spots Through experiments using a concrete example.

• Journal of Communications and Networks
• /
• v.5 no.1
• /
• pp.1-6
• /
• 2003

In this paper, we extend the derivation of the iterative soft-output Viterbi algorithm (SOVA) for partial response (PR) channels, and modify its decoding process such that it works consistently for arbitrary high code rates, e.g., rate 64/65. We show that the modified SOVA always outperforms the conventional SOVA that appears in the literature with a significant difference for high code rates. It also offers a significant cut down in the trace-back computations. We further examine its performance for parallel and serial concatenated codes on a precoded Class IC partial response (PR4) channel. Code rates of the form $\frac{k_0}{k_0+1}$($k_0$ = 4, 8, and 64) are considered. Our simulations indicate that the loss suffered by the modified SOVA, relative to the APP algorithm, is consistent for all code rates and is at most 1.2 dB for parallel concatenations and at most 1.6 dB for serial concatenations at $P_b$ = $10^{-5}$.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.4
• /
• pp.27-34
• /
• 2011

In this paper, it was presented a design on the dynamic multimedia fingerprinting code for anti-collusion code(ACC) in the protection of multimedia content. Multimedia fingerprinting code for the conventional ACC, is designed with a mathematical method to increase k to k+1 by transform from BIBD's an incidence matrix to a complement matrix. A codevector of the complement matrix is allowanced fingerprinting code to a user' authority and embedded into a content. In the proposed algorithm, the feature points were drawing from a content which user bought, with based on these to design the dynamical multimedia fingerprinting code. The candidate codes of ACC which satisfied BIBD's v and k+1 condition is registered in the codebook, and then a matrix is generated(Below that it calls "Rhee matrix") with ${\lambda}+1$ condition. In the experimental results, the codevector of Rhee matrix based on a feature point of the content is generated to exist k in the confidence interval at the significance level ($1-{\alpha}$). Euclidean distances between row and row and column and column each other of Rhee matrix is working out same k value as like the compliment matrices based on BIBD and Graph. Moreover, first row and column of Rhee matrix are an initial firing vector and to be a forensic mark of content protection. Because of the connection of the rest codevectors is reported in the codebook, when trace a colluded code, it isn't necessity to solve a correlation coefficient between original fingerprinting code and the colluded code but only search the codebook then a trace of the colluder is easy. Thus, the generated Rhee matrix in this paper has an excellent robustness and fidelity more than the mathematically generated matrix based on BIBD as ACC.

• Convergence Security Journal
• /
• v.19 no.3
• /
• pp.37-41
• /
• 2019

Recently, due to the appearance of various types of malware, the existing static analysis exposes many limitations. Static analysis means analyzing the structure of a code or program with source code or object code without actually executing the (malicious) code. On the other hand, dynamic analysis in the field of information security generally refers to a form that directly executes and analyzes (malware) code, and compares and examines and analyzes the state before and after execution of (malware) code to grasp the execution flow of the program. However, dynamic analysis required analyzing huge amounts of data and logs, and it was difficult to actually store all execution flows. In this paper, we propose and implement a preprocessor architecture of a system that performs malware detection and real-time multi-dynamic analysis based on 2nd generation PT in Windows environment (Windows 10 R5 and above).

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.7
• /
• pp.175-180
• /
• 2013

For the traitor tracing of multimedia content, this paper presents the classification algorithm of XOR collusion attack types using hamming distance, which applies to the colluded fingerprinting codes. The conventional traitor decision hinges on the colluded fingerprinting code used by a correlation coefficient, but the proposed scheme uses hamming distance. While XOR collusion attack employing a correlation coefficient is impossible to trace the traitors about 50% colluders due to a serious XOR linear problem, our method improves the performance of traceability to trace at least 1 traitor using hamming distance, and thus, the functional behavior of the proposed traitor traceability is coincided with Probability Scheme.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.722-726
• /
• 2010

The recent deployment of RIA (Rich Internet Application) is often involved with the complex JavaScript code, which leads to the announcement of high performance JavaScript engines for its efficient execution. And the Sunspider benchmark is being widely used for the performance evaluation of these JavaScript engines. In this paper, we compare the execution methods of three high-performance JavaScript engines, Mozilla TraceMonkey, Google V8, and Apple SquirrelFish Extreme, and measure their performances using the SunSpider benchmark. We also evaluate the pros and cons of each engine, based on its execution method and the code characteristics of the SunSpider benchmarks.

• Journal of Internet Computing and Services
• /
• v.15 no.6
• /
• pp.47-54
• /
• 2014

Anti-debugging is one of the techniques implemented within the computer code to hinder attempts at reverse engineering so that attackers or analyzers will not be able to use debuggers to analyze the program. The technique has been applied to various programs and is still commonly used in order to prevent malware or malicious code attacks or to protect the programs from being analyzed. In this paper, we will suggest an automatic detection scheme for anti-debugging routines. With respect to the automatic detection, debuggers and a simulator were used by which trace information on the Application Program Interface(API) as well as executive instructions were extracted. Subsequently, the extracted instructions were examined and compared so as to detect points automatically where suspicious activity was captured as anti-debugging routines. Based on experiments to detect anti-debugging routines using such methods, 21 out of 25 anti-debugging techniques introduced in this paper appear to be able to detect anti-debugging routines properly. The technique in the paper is therefore not dependent upon a certain anti-debugging method. As such, the detection technique is expected to also be available for anti-debugging techniques that will be developed or discovered in the future.