• The Journal of the Acoustical Society of Korea
• /
• v.15 no.5
• /
• pp.107-112
• /
• 1996

In this paper we propose a new fast codebook training algorithm for reducing the searching time of LBG algorithm. For each training data, the proposed algorithm stores the indexes of codewords that are close to that training data in the first iteration. It reduces computation time by searching only those codewords, the indexes of which are stored for each training data. Compared to one of the previous fast training algorithm, FSLBG, it obtains a better codebook with less exccution time. In our experiment, the performance of the codebook generated by the proposed algorithm in terms of peak signal-to-noise ratio(TSNR) is very close to that of LBG algorithm. However, the codewords to be searched for each training data of the proposed algorithm is only about 6%, for a codebook size of 256 and 1.6%, for a codebook size of 1.24, of LBG algorithm.

• Journal of KIISE:Software and Applications
• /
• v.30 no.1_2
• /
• pp.73-80
• /
• 2003

The Java programming language is designed for developing effective applications in a heterogeneous network environment. Major problem in Java is its performance. many attractive features of Java make the development of software easy, but also make it expensive to support ; applications written in Java are often much slower than their counterparts written in C or C++. To use Java`s attractive features without the performance penalty, sophisticated optimizations and runtime systems are required. Optimising Java bytecode has several advantages. First, the bytecode is independent of any compiler that is used to generate it. Second, the bytecode optimization can be performed as a pre=pass to Just-In-Time(JIT) compilation. Many attractive features of Java make the development of software easy, but also make it expensive to support. The goal of this work is to develop automatic construction of code optimizer for Java bytecode. We`ve designed and implemented a Bytecode Optimizer that performs the peephole optimization, bytecode-specific optimization, and method-inlining techniques. Using the Classfile optimizer, we see up to 9% improvement in speed and about 20% size reduction in Java class files, when compared to average code using the interpreter alone.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.41 no.8
• /
• pp.703-709
• /
• 2017

Creep analysis takes much more time than elastic or elastic-plastic analysis. In this study, we conducted elastic and elastic-plastic analysis and compared the results with creep analysis results. In the elastic analysis, we used primary stress, which can be classified by the $M{\alpha}-tangent$ method and stress intensities recommended in the ASME code. In the elastic-plastic analysis, we calculated the parameters recommended in the R5 code. For the FE models, a bending load, uniaxial load, and biaxial load were applied to the cross shaped welded plate, and a bending load and internal pressure were applied to the elbow pipe. To investigate the element size sensitivity, we conducted FE analysis for various element sizes for the cases where bending load was applied to the cross shaped welded plate. There was no significant difference between the creep stress and the alternative methods; however, in the $M{\alpha}-tangent$ method, the results were affected by the element size.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.9
• /
• pp.1079-1088
• /
• 2004

Generally, the code motion algorithm accomplishes the run-time optimal connected with the computational optimifation and the register overhead This paper proposes a sparse code motion, which considers the code size, in addition to computational optimization and lifetime optimization. The BCM algorithm carries out the optimal code motion computationally and the LCM algorithm reduces the register overhead in a sparse code motion algorithm. A sparse code motion algorithm is optimum algorithm computationally and lifetime because of suppression unnecessary code motion This algorithm improves runtime and efficiency of the program than the previous work through the performance test.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.11a
• /
• pp.257-258
• /
• 2017

머신러닝 기법을 다양한 분야에 사용되는 연구가 한창이다. 본 논문에서는 악성 코드의 분류 시스템에 머신러닝 기법을 적용하였다. 악성 코드 파일을 적당한 크기로 이미지화하여 텐서 플로우의 인셉션 V3에 적용하였다. 실험 결과, 이미지의 사이즈 조정과 파라미터 조정을 통해 매우 만족할 만한 수준으로 악성 코드를 잘 분류함을 확인할 수 있었다.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.10
• /
• pp.129-139
• /
• 2013

Java bytecodes are executed not on target machine but on the Java virtual machines. Since this bytecodes use a higher level representation than binary code, it is possible to decompile most bytecodes back to Java source. Obfuscation is the technique of obscuring code and it makes program difficult to understand. However, most of the obfuscation techniques make the code size and the performance of obfuscated program bigger and slower than original program. In this paper, we proposed an effective Java obfuscation techniques using assignment statements merging that make the source program difficult to understand. The basic approach is to merge assignments statements to append side effects of statement. An additional benefit is that the size of the bytecode is reduced.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.283-286
• /
• 2010

안전중요 소프트웨어 코드의 검증은 1%의 잠재적 가능성을 가진 오류조차 허용하지 않는 철저한 검증방식을 요구한다. 이러한 요구에 부응하여 최근 수학적 모델을 사용한 정형검증 기법이 코드검증에 활발하게 적용되고 있으나, 코드의 복잡도와 크기의 증가에 따른 검증비용의 기하급수적 증가가 해결과제로 부각되어왔다. 본 연구에서는 검증하고자 하는 특성을 중심으로 검증대상 코드를 추출, 정형검증의 대상을 자동으로 축소하는 코드추출기를 개발하였다. 개발된 코드추출기는 자동차 전장용 운영체제의 검증에 보조적으로 활용되어 검증비용을 90% 이상 절감하고 검증 사용성을 높이는데 기여하였다.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.342-350
• /
• 2002

The execution speed is not an important factor for Java programming language when implementing small size application program which is executed on the web browser, but it becomes a serious limitation when the huge-size programs are implemented. To overcome this problem, the various research is conducted for translating the Bytecode into the target code which can be implemented in the specific processor by using classical compiling methods. In this research, we have designed and realized an intermediate code translator for the native code generation system with which we can directly generate i386 code from Bytecode to improve the execution speed of Java application programs. The intermediate code translator generates the register-based intermediate code from *.class files which are the intermediate code of Java.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.268-270
• /
• 2012

동적 코드 분석 도구는 동적 컴파일(Just-in-Time Compile)을 통한 코드 변환 기술을 이용하여 응용프로그램 실행 중 기계어 수준의 코드를 분석한다. 기존의 동적 코드 분석 도구는 변환과정에서의 부하가 크기 때문에 리얼타임 프로그램에 적용하기 어렵다. 본 논문에서는 기존 동적 코드 분석 도구의 동적 컴파일 기법과 컴파일 프레임워크인 LLVM의 동적 컴파일 기법의 성능을 비교, 분석하였다. 이를 통해 LLVM의 동적 컴파일 기법을 이용한 높은 수행 성능을 가진 동적 코드 분석 도구의 설계 방안을 모색한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.334-336
• /
• 2002

자바 프로그래밍 언어는 웹 브라우저에서 실행되는 작은 크기의 응용 프로그램 수행에서는 실행 속도문제가 중요한 요소가 아니지만 대형 프로그램의 수행에서는 실행 속도가 현저히 저하되는 단점을 지니고있다. 이러한 문제점을 개선하기 위해 전통적인 컴파일 방법을 사용하여 바이트코드를 특정 프로세서에 적합한 목적기계 코드로 변환하는 다양만 연구가 진행중이다. ; 연구에서도 자바 응용 프로그램의 실행 속도의 개선을 위해 바이트코드로부터 직접 i386 코드를 생성하는 네이티브 코드 생성 시스템을 위한 중간 언어 변환기를 설계하고 구현한다. 중간 언어 변환기는 자바 언어의 중간 언어인 *.class 파일을 입력으로 받아 레지스터 기반의 중간 언어로 변환한다. 변환한다.