• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.323-326
• /
• 2002

DNA 컴퓨팅은 생체 분자들이 갖는 막대한 병렬성을 이용하여 조합 최적화 문제에 적용하는 연구가 많이 시도되고 있다. 특히 TSP(Travelling Salesman Problem)는 간선에 대한 가중치 정보가 추가되어 있기 때문에 가중치를 DNA 염기 배열로 표현하기 위한 효율저인 방법들이 제시되지 않았다. 따라서 본 논문에서는 DNA 컴퓨팅에 DNA 코딩 방법을 적용하여 정점과 간선을 효율적으로 생성하고 표현된 DNA 염기 배열의 간선에 실제간을 적용하여 가중치 정보를 계산하는 ACO(Algorithm for Code Optimization)를 제안한다. DNA 코딩 방법은 변형된 유전자 알고리즘으로 DNA 기능을 유지하며, 서열의 길이를 줄일 수 있으므로 최적의 서열을 생성할 수 있는 특징을 갖는다. 실험에서 ACO를 TSP에 적용하여 Adleman의 DNA 컴퓨팅 알고리즘과 비교하였다. 그 결과 초기 문제 표현에서 우수한 적합도 값을 생성했으며, 경로의 변화에도 능동적으로 대처하여 최적의 결과를 빠르게 탐색할 수 있었다.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.1-8
• /
• 2007

Although the Java bytecode has numerous advantages. there ate also shortcomings such as slow execution speed and difficulty in analysis. Therefore. in order for the Java class file to be effectively executed under the execution environment such as the network, it is necessary to convert it into optimized code. We implements CTOC. CTOC generated CFG using the existing bytecode then created the SSA Form for analysis and optimization. However. due to insertion or the ${\phi}$-function in the process of conversion into the SSA Form, the number of nodes increased. As a means of reducing the number of nodes, we performed copy propagation, which is an optimization method applicable to the SSA form. Copy propagation is the process of a value of a variable being topied to another variable. There are cases where conversion due to copy propagation alone does not yield significant effects. However, when variables are not used in the later optimization stages, copy propagation provides a means for eliminating the copy statement for the corresponding variable, making it an important step. This paper shows the copy propagation to obtain a more optimized code in SSA Form.

• Journal of Welding and Joining
• /
• v.15 no.1
• /
• pp.36-45
• /
• 1997

용접 구조물에 대한 프로세스 제어를 위하여 매우 효과적인 수단이 될 수 있는 SYSWELD 소프트웨어의 이론적인 개념 및 응용 기술에 대하여 소개하였다. 전술한 바와 같이 SYSWELD는 일반적으로 알려져 있는 범용 열 및 구조해석 상용 Code와는 달리 야금학적 이론이 접목되므로써 이전에는 고려하기 곤란했던 제어 인자들에 대하여 보다 정확한 정보를 얻을 수 있기 때문에 용접 프로세스 분야에 매우 적합한 시뮬레이션 Code라고 판단된다. 이와 같이 수치해석 기술을 응용함으로써 연구기관에서는 제반 현상들에 대하여 실험적인 접근방법보다 보다 효과적으로 이해할 수 있게 되어 궁극적으로 이론적 발전 및 실용화를 이룰 수 있으며, 또한 산업체에서는 현업에서 발생하는 결함의 제어 및 구조물이나 프로세스의 최적 설계 방안을 수립하는 일이 가능하기 때문에, 현재 용접 분야에 대한 컴퓨터 시뮬레이션 응용 기술에 대하여 관심이 집중되고 있다. 이에 당사는 SYSWELD를 비롯하여 공학 분야의 유용한 상용 Code에대한 공급 및 기술 지원 뿐만 아니라 엔지니어링 능력을 갖추고 이와 같은 추세에 부응하고자 하는 노력중에 있는 바, 용접 시뮬레이션 응용 기술에 대한 현황을 소개하고자 하였으므로 참고가 되기를 바란다.

• Structural Engineering and Mechanics
• /
• v.50 no.3
• /
• pp.323-347
• /
• 2014

This paper proposes a Particle Swarm Optimization (PSO) algorithm, which is improved by making use of the Harmony Search (HS) approach and called HS-PSO algorithm. A computer code is developed for optimal sizing design of non-linear steel frames with various semi-rigid and rigid beam-to-column connections based on the HS-PSO algorithm. The developed code selects suitable sections for beams and columns, from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange W-shapes, such that the minimum total cost, which comprises total member plus connection costs, is obtained. Stress and displacement constraints of AISC-LRFD code together with the size constraints are imposed on the frame in the optimal design procedure. The nonlinear moment-rotation behavior of connections is modeled using the Frye-Morris polynomial model. Moreover, the P-${\Delta}$ effects of beam-column members are taken into account in the non-linear structural analysis. Three benchmark design examples with several types of connections are presented and the results are compared with those of standard PSO and of other researches as well. The comparison shows that the proposed HS-PSO algorithm performs better both than the PSO and the Big Bang-Big Crunch (BB-BC) methods.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.14 no.5
• /
• pp.107-112
• /
• 2015

Increased productivity and cost reduction have emerged as the main goals of the industry due to the development of the machinery industry, and mechanical materials with excellent properties with the development of the machine tool industry are widely used in machine parts or structures. In addition, the cutting process of production plays a pivotal role in the production technology. Studies on cutting have involved a lot of research on the material, the cutting tool, the processing conditions, and numerical analysis. Due to the development of the computer through numerical analysis, cutting conditions, the assessment of cutting performance, and cutting quality could be predicted. This research uses the creation of the material model and AdvantEdge Production module for the NC code analysis. To improve the productivity, this research employs the optimization method to reduce cutting time.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06b
• /
• pp.77-79
• /
• 2012

본 논문에서는 임베디드 시스템으로의 적용을 위한 균형이진트리 방식의 허프만 코딩 복호화 방법에 대하여 논한다. 그리고 구현된 전체 시스템의 간단한 코드 최적화(code optimization)를 추가하여 시스템 전체의 처리 속도를 감소시키고자 하였다. 본문에서는 구현된 복호화 성능 향상의 정확한 측정을 위하여 하드웨어 시뮬레이터를 사용했다. 이를 통해서 실질적인 환경에서 어느 정도의 duration으로 동작될 수 있는지, 그리고 해당 환경에서 얼마나 성능을 향상시킬 수 있을지를 비교적 정확하게 판단할 수 있도록 했다. 본문의 마지막에 명시된 대로, 최적화의 결과로, 허프만 코드를 표에서 찾는 기존의 방법에 비하여, 복호화 부분과 복호화 부분을 제외한 시스템 코드 최적화 각각 36%, 2%의 duration 횟수의 감소를 확인할 수 있었다.

• International Journal of Internet, Broadcasting and Communication
• /
• v.16 no.3
• /
• pp.192-198
• /
• 2024

This paper investigates the application of multi-agent deep reinforcement learning in the fighting game Samurai Shodown using Proximal Policy Optimization (PPO) and Advantage Actor-Critic (A2C) algorithms. Initially, agents are trained separately for 200,000 timesteps using Convolutional Neural Network (CNN) and Multi-Layer Perceptron (MLP) with LSTM networks. PPO demonstrates superior performance early on with stable policy updates, while A2C shows better adaptation and higher rewards over extended training periods, culminating in A2C outperforming PPO after 1,000,000 timesteps. These findings highlight PPO's effectiveness for short-term training and A2C's advantages in long-term learning scenarios, emphasizing the importance of algorithm selection based on training duration and task complexity. The code can be found in this link https://github.com/Lexer04/Samurai-Shodown-with-Reinforcement-Learning-PPO.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.1-8
• /
• 2007

Although the Java bytecode has numerous advantages, there are also shortcomings such as slow execution speed and difficulty in analysis. Therefore, in order for the Java class file to be effectively executed under the execution environment such as the network, it is necessary to convert it into optimized code. We implements CTOC. In order to statically determine the value and type, CTOC uses the SSA Form which separates the variable according to assignment. Also, it uses a Tree Form for statements. But, due to insertion of the $\phi$-function in the process of conversion into the SSA Form, the number of nodes increased. This paper shows the dead code elimination to obtain a more optimized code in SSA Form. We add new live field in each node and achieve dead code elimination in tree structures. We can confirm after dead code elimination though test results that nodes decreases.

• Journal of the Korea Society for Simulation
• /
• v.17 no.1
• /
• pp.17-22
• /
• 2008

Double-binary turbo code has been adopted as an error control code of various future communication systems including wireless metropolitan area networks(WMAN) due to its powerful error correction capability. One of the components affecting the performance of turbo code is internal interleaver. In 802.16 d/e system, an almost regular permutation(ARP) interleaver has been included as a part of specification, however it seems that the interleaver is not optimized in terms of decoding performance. In this paper, we propose three optimization methods for the interleaver based on spatial distance, spread and minimum distance between original and interleaved sequence. We find optimized interleaving parameters for each optimization method and evaluate the performances of the proposed methods by computer simulation under additive white Gaussian noise(AWGN) channel. Optimized parameters can provide up to 1.0 dB power gain over the conventional method and furthermore the obtainable gain does not require any additional hardware complexity.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.107-117
• /
• 2006

Java language creates class files through Java compiler. Class files include informations involved with achievement of program. We can do analysis and optimization for efficient codes by analyzing class files. This paper analyzes bytecodes using informations of Java class files. We translate stack-based Java bytecodes into 3-address codes. Then we translate into static single assignment form using the 3-address codes. Static single assignment form provides a compact representation of a variable's definition-use information. Static single assignment form is often used as an intermediate representation during code optimization. Static sing1e assignment form renames each occurrence of a variable such that each variable is defined only once.