http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
객체 지향 데이터베이스에서 쓰기비용을 감안한 다중 선채취기법
남인길,도용석 大邱大學校 科學技術硏究所 1998 科學技術硏究 Vol.5 No.3
This paper presents a set of techniques for improving the efficiency of cache in object oriented database management system. The proposed method is divided into two steps. As the first step, we analyze the disc access frequency and pattern for various queries. Then, based on the analyzing results of the first step, we make prefetching of certain pages which have high degree of access frequency. In addition to this method, in this research, we propose a multiple prefetch caching algorithm that is based on the previous method. Basically this method delay page replacement by considering write cost for pages with information modification. Simulation results show that the proposed method consistently outperforms existent algorithms.
남인길,이두한 대구대학교 산업기술연구소 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.
통합된 구문 단서를 이용한 자동 의미 모호성 해결 방법
金權陽,南寅吉 慶一大學校 1997 論文集 Vol.14 No.2
We present a new approach for word sense disambiguation which disambiguates transitive verb sense using a set of clues based on syntactic relations between a given verb and surrounding context words. After training on clues that co-occur with a specific sense of a given transitive verb, this approach extracts a set of clues based on syntactic relations in a test sentence and integrates a set of clues to disambiguate the sense of given transitive verb. We use not only an unordered set of surrounding words of a given ambiguous verb but also co-occurrences as a clue for sense disambiguation based on some syntactic relations such as predicate-argument, modifier-modified, adjacency, or mixture of them. The experimental results show that the accuracy of our disambiguation method is always better than the default strategy of assigning all occurrences to the most frequent sense. Moreover, it is better than a method which uses only an unordered set of surrounding words in the context.
객체 정의역 해석에 기반한 객체 지향 질의어 모델 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.
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.
남인길,김권양 대구대학교 (한사대학) 산업기술연구소 1991 産業技術硏究 Vol.10 No.-
This paper outlines the design strategy of HEMD (Hyper Editor for Mixed-media Documents) which creates, edits, formats, prints and transmits mixed media documents consist of characters, multi-fonts, bit-mapped images, graphics and spread sheets. It is needed to design efficient data structure, software, hardware and human interface for HEMD system.
분산 체제하에서 중첩된 트랜잭션에 대한 로그를 기반으로 한 회복 알고리즘
南寅佶 慶一大學校 1988 論文集 Vol.4 No.1
The concept of nested transactions has been used to provide reliable processing in both centralized and distributed systems. Nested transactions are seen to permit safe concurrency within as well as among transactions, and to enable transactions to fail partially in a graceful and control manner. In this paper, we investigate log-based transaction recovery for nested transactions. Techniques similar to shadow page have been suggested for use in rollback and crash recovery for nested transactions. We first turn our attention to the single-level transaction recovery procedures, and next we extend the single-level transactions recovery algorithm to the nested transaction case.