http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
이완권 전주대학교 1999 論文集 Vol.24 No.2
The rapid advance in the computer and telecommunication technology has changed educational methodology from that of a simplistic one-directional knowledge transfer to a mutual interaction between a teacher and students. Thus, the role of a teacher is being transformed from an all-controlling knowledge-provider to an advisor or a consultant. Furthermore, the wide use of internet provides a new educational environment which is not limited by the time and space restriction unlike the previous conventional school systems. According to these recent trends, we have designed a CAI framework, emphasizes the bi-directional interaction between a student and teacher, based on mutimedia and internet technology.
이완권 전주대학교 공학연구소 1996 전주대학교 공학기술종합연구소 학술논문집 Vol.2 No.2
Structure charts are derived from the data flow diagrams, which are the results of structured analysis and with this procedure many design decisions are needed. One is to choose transform center. In this paper, we devise a fuzzy metrics to figure out the transformational extent of data flows. Highly degreed transformations are hired to boss and first-cut structure chart is constructed straightforwardly based on that module.
이완권,이광기 전주대학교 공학기술종합연구소 2003 전주대학교 공학기술종합연구소 학술논문집 Vol.9 No.1
The 7th National Curriculum is an educational process based on the level of each student group. In this paper, we design and develop the group-level education system that offers the test questions accommodated to the students' level. The CAT type used in this paper is the hybrid type of 2-step type CAT and Pyramid type CAT, which presents the fixed-level questions first and decides the testee's level based on the test result, and then repeatedly presents the next appropriate questions depending on the testee's achievement level. This paper is focused on the mock entrance examination type's evaluation in English education, not on the learning progress. Therefore students are enable to easily grasp their own learning levels.
모듈 접속 언어를 이용한 소프트웨어 구축의 정적 분석과 Makefile의 생성
이완권(W K Lee),권용래(Y R Kwon) 한국정보과학회 1989 한국정보과학회 학술발표논문집 Vol.16 No.2
본 논문에서는 새로운 모듈 접속 언어 MILV를 중심으로, configuration 제어의 지원과 소프트웨어 구축의 정적 분석을 통한 설계 단계와 연계, 그리고 Makefile 생성을 통한 manufacturing 과정의 수행 단계를 연계하여, 소프트웨어의 접속 문제를 단일의 메카니즘으로 해결하는 하나의 방법을 제시할 목적으로 MILV/MILSA를 설계하고 구현하였다. MILSA는 MILV 분석기, 정적 분석기, Makefile 생성기, 그리고 데이타 베이스로 구성되어 있다.
Program Slicing Based on Predicate Specification
Lee, Wankwon 전주대학교 공학기술종합연구소 1999 전주대학교 공학기술종합연구소 학술논문집 Vol.5 No.-
Slicing technique can help to solve many software engineering problems such as testing, program understanding and extraction of a reusable component. However, current slicing criteria and the corresponding techniques are not precise enough in that the obtained slices contain unnecessary statements in some situations. In this paper, we propose a new slicing technique that takes the specification of the slice into account. The information presented in the specification helps to produce more precise slices by removing statements that are not relevant to the specification for the slice. Our technique is based on the weakest precondition and strongest postcondition. We show an example application of the proposed technique in extracting a reusable component.
Recovering Reusable Functions by Specification-based Slicing
Lee, Wan kwon 전주대학교 공학기술종합연구소 2000 전주대학교 공학기술종합연구소 학술논문집 Vol.6 No.1
In this paper, we present a technique for extracting reusable functions from existing programs using specification-based program slicing. Unlike conventional program slicing, specification-based slicing presupposes the knowledge of the specification of the function to be recovered in terms of precondition and postcondition. The information presented in the specification helps to extract more precise reusable components from old programs by removing statements that are not relevant to the specification.
Applying Conventional Testing Techniques for Class Testing
Lee, Wan Kwon 전주대학교 공학연구소 1997 전주대학교 공학기술종합연구소 학술논문집 Vol.3 No.2
This paper discusses how conventional testing criteria such as branch coverage can be applied for the testing of member functions inside a class. To support such testing techniques, we employ symbolic execution techniques and finite state machines(FSMs). Symbolic execution is performed on the code of a member function to identify states that are required to fulfill a given criterion. We use FSMs to generate a sequence of member functions leading to the identified states. Our technique is a mixture of code-based and specification-based testing techniques in the sense that it uses information derived from codes using symbolic execution together with information from specifications using FSMs for testing activities.
이상곤,이완권,Lee, Sang-Kon,Lee, Wan-Kwon 한국정보처리학회 2003 정보처리학회논문지B Vol.10 No.3
인간은 문서전체를 읽지 않고 대표적인 단어를 보는 것만으로 정치나 스포츠 등의 분야를 정확히 인지할 수 있다. 문서전체를 대상으로 하지 않고 부분텍스트에서 출현하는 소수의 단어정보에서 문서의 분야를 정확히 결정하기 위해 분야연상어의 구축은 중요한 연구과제이다. 인간이 미리 분야체계를 정의하고, 각 분야에 해당하는 문서를 인터넷이나 서적을 통해 수집한다. 본 논문은 수집문서의 분야를 정확히 지시하는 분야연상어를 수집하는 방법을 제안한다. 문서의 분야결정 시점을 고려하여 분야연상어의 수준과 안정성 랭크에 대하여 논의한다. 학습데이터에서 분야연상어 후보의 각 수준을 자동으로 결정하고, 컴퓨터가 제시하는 분야연상어의 수준, 안정성 랭크, 집중률, 빈도정보를 이용하여 단일 분야연상어를 수집하는 방법을 제안한다. VSField-associated term is a single or compound word whose terms occur in any document, and which makes it possible to recognize a field of text by using common knowledge of human. For example, human recognizes the field of document such as <baseball> or <politics>, a field name of text, when she encounters a word 'Pitcher' or 'election', respectively We Proposes an efficient construction method of field-associated terms (FTs) for specializing field to decide a field of text. We could fix document classification scheme from well-classified document database or corpus. Considering focus field we discuss levels and stability ranks of field-associated terms. To construct a balanced FT collection, we construct a single FTs. From the collections we could automatically construct FT's levels, and stability ranks. We propose a new extraction algorithms of FT's for document classification by using FT's concentration rate, its occurrence frequencies.