• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2010.11a
• /
• pp.787-788
• /
• 2010

• The Magazine of the Society of Air-Conditioning and Refrigerating Engineers of Korea
• /
• v.2 no.4
• /
• pp.271-273
• /
• 1973

에너지 사용의 최적화는 건축설비계통의 각 관점을 다른 모든 사항들과 비교고찰하는 (설치비에 대응하는 장기운전 및 정비의 요구사을 고려하는) HVAC계통설계로부터 얻어 진다. 저자는 최상목표인 쾌적과 경제성을 고려해서 전반적으로 각 분야를 집약한 계통설계의 프로그램을 제시하고 있다.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.45 no.8
• /
• pp.662-670
• /
• 2017

This paper proposes an optimization-based procedure to determine the parameters of the Apollo guidance law for Korean lunar lander mission. A lunar landing mission is formulated as a trajectory optimization problem to minimize the fuel consumption and the reference trajectory for the lander is obtained by solving the problem in the pre-flight phase. Some parameters of the Apollo guidance, which are coefficients of the polynomial used to define the guidance command, are selected based on the reference trajectory obtained in the pre-flight phase. A case study for the landing guidance of Korean lunar lander mission using the proposed procedure is conducted to demonstrate its effectiveness.

• Journal of KIISE:Software and Applications
• /
• v.35 no.11
• /
• pp.661-670
• /
• 2008

In some applications of software engineering such as the verification of software model or embedded program, SAT solver is used. To practical use a SAT solver, a problem is encoded to a CNF formula, but because the formula has lower expressiveness than software models or source codes, optimal CNF encoding is required. In this paper, we propose optimal encoding techniques for the problem of "Selecting adjacent $k{\leq}n$ among n objects," Through experimental results we show the proposed constraint is efficient and correct to solve Japanese puzzle. As we know, this paper is the first study about CNF encoding for adjacency in BCC.

• 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.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2007.05a
• /
• pp.393-397
• /
• 2007

KModSim은 수자원배분에 관련된 물리적, 수문학적, 제도적, 그리고 행정적인 요구들을 동시에 만족하도록 디자인된 범용 우선순위 목적 선형최적화 모형으로써 자연유입량과 기득 수리권 혹은 기득 저류권 등과 같은 다양한 형태의 저수권 사이의 조화운영이 가능하다. KModSim 목적함수에 관련된 제약조건의 유연한 설정과 변경이 가능하며, 기존의 최적화 방법과 다르게 유역통합모의에 관련한 모형변수가 모형내에서 자동적으로 생성되도록 프로그램화 되어있다. 본 연구에서는 유역내 수자원의 효율적인 운영을 위하여 우선순위 목적 선형최적화 모형을 위한 Backrouting 방법을 개발하고 금강유역 일단위 KModSim 네트워크에 Backrouting 방법을 적용하여 적용성을 검토하였다. 금강유역에 KModSim을 적용하고 모의한 결과 Backrouting 방법을 사용한 모의결과가 Backrouting 방법을 사용하지 않은 경우에 비해 실측치를 보다 잘 재현하는 것으로 나타났다. 본 연구에서 개발된 Backrouting 방법은 다중목적 우선순위 선형최적화 모형을 이용하여 일단위 모의 시에 발생할 수 있는 과도한 손실을 방지하고자 할 때 적용할 수 있을 것으로 기대된다.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.1
• /
• pp.17-28
• /
• 2010

This paper presents a new automatic TFT-LCD image quality optimization system using DSP for the first time. Since conventional manual method depends on experiences of LCD module developers, it is highly labor-intensive and requires several correction steps providing large gamma correction error. The proposed system optimizes automatically gamma adjustment and power setting registers in mobile TFT-LCD driver IC to reduce gamma correction error, adjusting time, and flicker. It contains module-under-test (MUT, TFT-LCD module), PC installed with program, multimedia display tester for measuring luminance and flicker, and control board for interface between PC and TFT-LCD module. We have developed a new algorithm using 6-point programmable matching technique with reference gamma curve and applying automatic power setting sequence. Developed algorithm and program are generally applicable for most of the TFT-LCD modules. It is realized to calibrate gamma values of 1.8, 2.0, 2.2 and 3.0, and reduce flicker level. The control board is designed with DSP and FPGA, and it supports various interfaces such as RGB and CPU. Developed automatic image quality optimization system showed significantly reduced gamma adjusting time, reduced flicker, and much less average gamma error than conventional manual method. We believe that the proposed system is very useful to provide high-quality TFT-LCD and to improve developing process using optimized gamma-curve setting and automatic power setting.

• Journal of the Microelectronics and Packaging Society
• /
• v.8 no.4
• /
• pp.67-72
• /
• 2001

An Effort has been made to more accurately analyze the flow in the chip cavity, particularly to model the flow through the openings in the leadframe and correctly treat the thermal boundary condition at the leadframe. The theoretical analysis of the flow has been done by using the Hele-Shaw approximation in each cavity separated by a leadframe. The cross-flow through the openings in the leadframe has been incorporated into the Hele-Shaw formulation as a mass source term. The optimization program based on the complex method integrated with flow analysis program has been successfully used to obtain the optimal filling conditions to avoid short shot.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.430-432
• /
• 2005

자바 언어는 객체 지향 언어이며 이식성에 좋은 언어로써 각광을 받고 있다. 하지만 자바 프로그램은 이식성은 좋지만 실행 시 인터프리터 방식으로 사용하기 때문에 실행속도가 느리다는 단점이 있다. 또한 바이트코드는 스택기반의 코드이기 때문에 코드 단편화 문제점과 스택 접근 연산들을 사용하여 프로그램 분석이 용이 하지 않고, 단순한 변환을 복잡하게 만들 수 있다는 단점이 있다. 따라서 바이트코드 자체로 분석과 최적화하기가 용이 하지 못하다. 본 논문에서는 바이트코드의 분석을 위한 트리구조 중간코드를 제안 한다. 트리구조 중간코드는 스택기반 코드의 문제점을 보완하고, 기존에 3-주소 형태의 최적화 기법들을 적용할 수 있다는 장점이 있다. 본 논문은 바이트코드와 각종 정보를 가지고 있는 클래스 파일을 입력받아 분석 후 기본블록을 나누고 BNF코드를 바탕으로 트리구조 중간코드를 생성하게 된다. 생성된 중간코드를 가지고 제어 흐름 그래프를 만들게 된다. 이러한 방식으로 트리구조 중간코드를 설계하게 된다.

• Journal of Internet Computing and Services
• /
• v.9 no.1
• /
• pp.55-67
• /
• 2008

This paper presents the assignment motion algorithm unrestricted for code optimization computationally. So, this algorithm is suppressed the unnecessary code motion in order to avoid the superfluous register pressure, we propose the assignment motion algorithm added to the final optimization phase. This paper improves an ambiguous meaning of the predicate. For mixing the basic block level analysis with the instruction level analysis, an ambiguity occurred in Knoop's algorithm. Also, we eliminate an ambiguity of it. Our proposal algorithm improves the runtime efficiency of a program by avoiding the unnecessary recomputations and reexecutions of expressions and assignment statements.