http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : 권육춘(Kwon Yoock Choon) (검색결과 4 건)
- 무료
- 기관 내 무료
- 유료
-
GNU 컴파일러를 이용한 ES-C2340 DSP2용 C 교차 컴파일러의 개발
김승호(Kim Sung Ho),이시영(Lee Si Young),권육춘(Kwon Yoock Choon),유하영(Yoo Hah Young),한기천(Han Ki Cheon) 한국정보처리학회 1997 정보처리학회논문지 Vol.4 No.1
In this paper, we describe the implementation of the C cross-compiler for the ES-C2340 DSP2 processor by using the GNU compiler. For the rapid and efficient developing of the compiler, we use the approach that combines some parts of the language-dependent front-end of the GNU compiler and other parts like the processor-dependent back-end which is implemented newly to build the compiler. This approach has several advantages. First, as we use GNU compiler''s well-proved excellent optimization method and multi-language support capability, we can improve the efficiency and generality of the compiler. Second, as we concentrate on the developing of processor-dependent part, it shorten the compiler developing time, third, with that, we can use high-level language as logic approving tool in processor developing process. And to support the cross-compiler, we also implement a text-level pre-linker.
-
夫起東,權六春 慶一大學校 1996 論文集 Vol.13 No.2
This paper proposes a new way to make C-language cross-compiler on the existing operating system. For this purpose, this research uses the existing front-end processor, but it redefines back-end processor. Using GNU compiler, this research presents a cross compiler system for ETRI ES-C2340 DSP2 and demonstrates its applications.
-
컴퓨터 바둑에서 상태재현 회피에 의한 탐색공간 간소화 기법
夫起東,李도漢,權六春,朴鉉秀 慶一大學校 1997 論文集 Vol.14 No.2
In this paper, we implement a methodology that searches a complete game tree to solve the problem caused by inaccuracy of a heuristic function used in the MIN/MAX algorithm. The methodology is based on the idea searching all possible paths from one root to all terminal nodes. The devised pruning method is constructed by noticing the fact that the frequent reappearances of the same status are occured in various sequences during the processing of the Life and Death problem of Go. When this algorithm detects reappearance of the same status, it links the child of current node with the already examined one. Consequently searching cost can be reduced by the linking process. Finally, generated solution tree is expanded to acyclic directed graph by the sharing method. Experimental result shows that the proposed methodology reduces the temporal and spatial traversing cost of the AND/OR game tree. And we apply the methodology to the status evaluating problem, a major problem of Go, because the problem must reflects the clear estimation of strings status on a board.
-
의미적 구조적 지식에 기반한 확장된 질의 최적화의 구현
李두漢,權六春,夫起東 慶一大學校 1998 論文集 Vol.15 No.1
In this paper, we implement the method that transforms equivalent optimized queries by using semantic knowledge. Also we implement the mechanism which transforms simple query into general SQL query. To transform and optimize simple query, we use semantic and structural knowledge. Semantic knowledge includes semantic integrity constraints and domain integrity constraints. Structural knowledge represents physical relationship between relations. We verify that the method optimize simple query through experiment.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
