• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.35 no.2
• /
• pp.377-386
• /
• 2015

The helical pile is a manufactured steel pile consisting of one or more helix-shaped bearing plates affixed to a central shaft. This pile is installed by rotating the shaft into the ground to support structural loads. Advantages of the helical pile are no need for boring or grout process, and ability to install a pile foundation with relatively light devices. In this study, an optimized design method for helical piles is proposed to minimize the material cost with consideration of the load bearing capacity obtained by the cylindrical shear method. The harmony search meta-heuristic algorithm was adopted for optimization process. The optimized design was verified by comparing with the 2009 International building code. It is noted that the optimization for the configuration of helical piles along with material cost proves to be an out-performed tool in designing helical pile foundation with economic feasibility.

• Journal of KIISE:Software and Applications
• /
• v.31 no.4
• /
• pp.387-393
• /
• 2004

DNA computing is technology that applies immense parallel castle of living body molecules into information processing technology, and has used to solve NP-complete problems. However, there are problems which do not look for solutions and take much time when only DNA computing technology solves NP-complete problems. In this paper we proposed an algorithm called ACO(Algorithm for Code Optimization) that can efficiently express DNA sequence and create good codes through composition and separation processes as many as the numbers of reaction by DNA coding method. Also, we applied ACO to Hamiltonian path problem of NP-complete problems. As a result, ACO could express DNA codes of variable lengths more efficiently than Adleman's DNA computing algorithm could. In addition, compared to Adleman's DNA computing algorithm, ACO could reduce search time and biological error rate by 50% and could search for accurate paths in a short time.

• Journal of Information Technology Services
• /
• v.10 no.3
• /
• pp.167-177
• /
• 2011

Code obfuscation is a technique that protects the abstract data contained in a program from malicious reverse engineering and various obfuscation methods have been proposed for obfuscating intention. As the abstract data of control flow about programs is important to clearly understand whole program, many control flow obfuscation transformations have been introduced. Generally, inlining is a compiler optimization which improves the performance of programs by reducing the overhead of calling invocation. In code obfuscation, inlining is used to protect the abstract data of control flow. In this paper, we define new control flow complexity metric based on entropy theory and N-Scope metric, and then apply genetic algorithm to obtain optimal inlining results, based on the defined metric.

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

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

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.3
• /
• pp.1-8
• /
• 2000

Prepass code scheduling(code scheduling before register allocation), the register lifetimes may be lengthened, which may increase the amount of data dependence relations. So, it makes difficult to allocate the registers because of complex interference graph. In this paper, to improve that defect, propose an 2-phase coloring method. At first phase-1 assign the registers to variables which have long live ranges. Secondly, phase-2 allocate the registers to remained variables to minimize the register allocation cost. Experimental results shown that proposed method is more efficient scheme than Chaitin's scheme when prepass code scheduling.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.7-9
• /
• 2002

본 논문에서는 DSP 코드 생성시 어드레스 인스트럭션의 개수를 최소화하기위한 효과적 인 어드레스 코드 생성 기법을 제안하였다. 기존의 방법에서는 코드 스케줄링이 수행된 다음에 어드레스 코드가 생성되었다. 본 논문에서는 코드 스케줄링과 어드레스 코드 생성을 결합하였고, 어드레스 인스트럭션의 개수를 줄이기 위한 효과적인 스케줄링 방법을 제안하였다. 실험결과는 최근 연구에[6,8] 비해 23.7% 크기의 향상을 보여주었다.

• Journal of the Korean Society of Safety
• /
• v.14 no.4
• /
• pp.60-70
• /
• 1999

In this study, the computer code for the optimal design of road tunnel ventilation system based on one-dimensional analysis of the air flow was developed. The control volume method was used to calculate the air velocities and the concentration distribution of pollutants(CO, NOx, Particulate) for various tunnel ventilation system. This code was validated by comparing the calculation results to the practical design data for the road tunnel ventilation system. The calculation results were in accord with the practical design data.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.850-852
• /
• 2004

고급 언어 (high-level language)로 프로그램을 쓰고 그것이 맞다고 증명 했을때, 프로그램과 증명을 동시에 "컴파일"해주는 방법을 찾으려고 한다. 이러한 방법은 "증명 보내기"(Proof Carrying Code)라는 제안을 실용화할 때 요긴하게 사용할 수 있는 기술이다. 지면관계상 "반복문에서 명령어 끄집어내기"(Loop Invariant Code Motion)라는 최적화 과정에 맞게 Hoare 증명을 변환하는 방법에 대해서만 알아보겠다.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.391-397
• /
• 2019

In this paper, we give a simple proof of the improved Johnson bound for A(n, d), the maximum number of codewords in a binary code of length n and minimum distance d, given by Mounits, Etzion and Litsyn.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.17-21
• /
• 2001

Theories for optimal design and optimization algorithms have long been well developed. In industries, however, they are not well practiced. To make them work for industry, a new philosophy is necessary and an integration of various software systems required. A review of the history in the aspect of optimal design software is made and a newly developed code DS-Structure is introduced.