http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : 南寅佶 (검색결과 93 건)
- 무료
- 기관 내 무료
- 유료
-
HP 3000 computer System에서 2pass tiny cross assembler 設計
남인길 慶北工業專門大學 1981 論文集 Vol.18 No.-
Cross assembler has been used for conviniently, when memory size is small and the use of operating system is restricted. Recently a host computer which is installed some cross assemblers for micro computer assembly language has been made use of studying. In this paper, both EDITOR function of HP 3000 computer system and learning of IBM assembly language have been taken, 2pass simulated tiny cross assembler has been developed. Having been applied the simulated assembler to HP 3000 computer system, desirable result has been obtained.
-
Variable Partition Paging 알고리즘에서의 모순현상
權寧淡,南寅佶 慶北工業專門大學 1984 論文集 Vol.21 No.-
Five types of anomalous behaviour which may occur in paged virtual memory operating systems are defined. The page fault frequency and working set algorithms are examined in terms of anomaly, and reference string example of various anomalies are presented. Two paging algorithm properties, the inclusion property and generalized inclusion property, are discussed and anomaly implication of these properties presented.
-
Paged Memory Computer System에 있어서 효과적인 代置 algorithm 設計
南寅佶 慶北工業專門大學 1982 論文集 Vol.19 No.-
A general class of adaptive replacement schemes for use in paged memories is developed. One such algorithm, called SIM, is simulated using a propability model that generates memory traces, and the result of the simulation of this adaptive scheme are compared with those obtained using the best nonlookahead algorithms.
-
본 논문에서는 신경회로망과 유전자 알고리즘을 이용하여 셀룰러 무선채널 할당을 위한 두 가지 최적화 기법
남인길,박상호,Nam, In-Gil,Park, Sang-Ho 한국정보처리학회 1999 정보처리논문지 Vol.6 No.2
본 논문에서는 신경회로망과 유전자 알고리즘을 이용하여 셀룰러 무선채널 할당을 위한 최적화 알고리즘을 제안하였다. 채널할당 과정을 채널할당 문제에 내포된 제한사항들을 나타내는 에너지함수의 최소화 과정으로 규정하였다. 채널간, 인접채널, 사이트간의 세 가지 제한사항이 고려되었다. 최적의 채널할당을 위하여 신경회로망을 이용한 방식에서는 강제적인 채널 할당 및 셀 순서 변화 등의 기법이 개발되었고 유전자 알고리즘 방식에서는 자료구조와 적절한 유전연산자를 개발하였다. 실험결과로서, 두 최적화 방법의 채널할당률을 나타내었고 그 결과들을 비교하였다. In this paper, two optimization algorithms based on artificial neural networks and genetic algorithms are proposed for cellular radio channel assignment problems. The channel assignment process is characterized as minimization of the energy function which represents constraints of the channel assignment problems. All three constraints such as the co-channel constraint, the adjacent channel constraint and the co-site channel constraint are considered. In the neural networks approach, certain techniques such as the forced assignment and the changing cell order are developed, and in the genetic algorithms approach, data structure and proper genetic operators are developed to find optimal solutions, As simulation results, the convergence rates of the two approaches are presented and compared.
-
남인길,이두한 대구대학교 산업기술연구소 1992 産業技術硏究 Vol.11 No.-
In this paper, we design and implement a meta-interpreter which can manage point query, range query, and list query in PROLOG database environment that is supported multi-key indexing. Also, by maintaining meta-knowledge for already loaded facts in meta-knowledgebase, this system can avoid the duplicated loads of same facts that decrease performance of query processing.
-
객체 정의역 해석에 기반한 객체 지향 질의어 모델 OQBE
남인길,사공준,장재호 大邱大學校 科學技術硏究所 1995 科學技術硏究 Vol.2 No.2
The existing object-oriented query languages are not userfriendly because of the characteristics of object-oriented databases(OODB) and the absence of unified form of query language. In order to use the OODB easily, OQBE(object query by example) as a query model is proposed in this thesis. This study analyzes the object-oriented query language and transforms it into the object domain calculus. On that basis, the existing complicated object-oriented query languages can be transformed into OQBE. Finally this study illustrates OQBE by some examples.
-
南寅佶 慶一大學校 1986 論文集 Vol.2 No.1
This paper presents a task allocation algorithm, BB technigue based, that allocates application tasks among processors in distributed computing systems satisfying maximum throuput. minimum interprocessor communication cost and average response time, and adapt some constraints that shared subtasks are allowed redundant processing and considered the location of required resources and the total processing time assigned to each processor.
-
Interactive Operation 을 爲한 INTEL 8080 A Assembler의 設計考察
南寅佶 慶北工業專門大學 1980 論文集 Vol.17 No.-
Machine language and Assembly language, which have ability to represent various bit operation by basic system of micro computer, have been used for the micro computer. Particulary, BASIC language has been used for the convinient use of the numerical computation. In this paper, both merits of 2PASS type Interpreter having been taken, a Load-and-go type Assembler has been developed. Having been applied to 8080A basic microcomputer, as it expected, the Load and go type Assembler detected syntax errors promptly, and also reduced input time of source code and effort. And it improved efficiency of memory utilization further than traditional method.
-
남인길,이두한,사재학 大邱大學校 科學技術硏究所 1994 科學技術硏究 Vol.1 No.-
In this paper, we propose a efficient query optimization mechanism that using syntatic and semantic knowledge in internal knowledge base. Syntatic knowledge represent relational information of tables and semantic knowledge represent internal rules between attributes and attributes. Also syntatic and structure knowledge was stored in internal knowledge base as graphical structure.
-
블록 정렬과 선두이동법을 이용한 VF산술부호에 의한 데이터 압축
李振鎬,南寅佶 慶一大學校 1997 論文集 Vol.14 No.2
In this paper, we present the loseless data compression using block-sorting, move to front(MTF) and arithmetic code based on run-length model. First, the substrings which is parsed into length N are shifted one by one symbol, Second the cyclic shifted rows are sorted substring. As the sequences by MTF tend to have a long consecutive symbol, the coding based on run-length model is efficient to compress the transformed sequence. Then the preprocessed sequence is coded using VF(variable to fixed) arithmetic code which can be limited the error propagation in one block. The key point is how to split the fixed length codeword in proportion to symbol probabilities in VF arithmetic code. We develop the new VF arithmetic coding that split completely the codeword set for arbitrary source alphabet. In addition to, an extended representation of symbol probability is designed by using recursive Gray conversion. The performance of proposed method is compared with other well-known source coding methods with respect to entropy and compression ratio.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
