• The Journal of Korean Association of Computer Education
• /
• v.3 no.2
• /
• pp.31-37
• /
• 2000

We developed a test bank system which dynamically adjusts to students' achievement levels. In order to dynamically calculate the student's achievement level, our system uses the question-response theory which is usually adopted to CAT. The system proposes appropriate questions depending on the students' achievement levels so that they can do self-directed and individualized learning. The system consists of pre-test, main learning, and review stages. In the pre-test stage, the intellectual level of the student is examined to determine the starting point in the main stage. In the main learning stage, individualized learning is performed. Finally, a review session is added to re-examine the questions that the student gave wrong answers. The output from the learning process of the system is not the usual test scores but the level of the student's intellectual ability which is produced through the question-response theory. The intellectual ability level index objectively measures the degree of improvement of the student's learning ability.

• Journal of Information Technology and Architecture
• /
• v.9 no.4
• /
• pp.455-464
• /
• 2012

Due to the recent data explosion, methods which can meet the requirement of large data analysis has been studying. This paper proposes MRIterativeBUC algorithm which enables efficient computation of large data cube by distributed parallel processing with MapReduce framework. MRIterativeBUC algorithm is developed for efficient iterative operation of the BUC method with MapReduce, and overcomes the limitations about the storage size and processing ability caused by large data cube computation. It employs the idea from the iceberg cube which computes only the interesting aspect of analysts and the distributed parallel process of cube computation by partitioning and sorting. Thus, it reduces data emission so that it can reduce network overload, processing amount on each node, and eventually the cube computation cost. The bottom-up cube computation and iterative algorithm using MapReduce, proposed in this paper, can be expanded in various way, and will make full use of many applications.

• Journal of KIISE:Software and Applications
• /
• v.31 no.5
• /
• pp.563-569
• /
• 2004

A set of Zernike moments has been successfully used for object recognition or content-based image retrieval systems. Real time applications using Zernike moments, however, have been limited due to its complicated definition. Conventional methods to compute Zernike moments fast have focused mainly on the radial components of the moments. In this paper, utilizing symmetric/anti-symmetric properties of Zernike basis functions, we propose a fast and efficient method for Zernike moments. By reducing the number of operations to one quarter of the conventional methods in the proposed method, the computation time to generate Zernike basis functions was reduced to about 20% compared with conventional methods. In addition, the amount of memory required for efficient computation of the moments is also reduced to a quarter. We also showed that the algorithm can be extended to compute the similar classes of rotational moments, such as pseudo-Zernike moments, and ART descriptors in same manner.

• Journal of Internet Computing and Services
• /
• v.2 no.3
• /
• pp.81-92
• /
• 2001

The clustering environment with heterogeneous workstations provides the cost effectiveness and usability for executing applications in parallel. The load balancing is considered as a necessary feature for the clustering of heterogeneous workstations to minimize the turnaround time. Since each workstation may have different users, groups. requests for different tasks, and different processing power, the capability of each processing unit is relative to the others' unit in the clustering environment Previous works is a static approach which assign a predetermined weight for the processing capability of each workstation or a dynamic approach which executes a benchmark program to get relative processing capability of each workstation. The execution of the benchmark program, which has nothing to do with the application being executed, consumes the computation time and the overall turnaround time is delayed. In this paper, we present an efficient task distribution method and implementation of load balancing system for the clustering environment with heterogeneous workstations. Turnaround time of the methods presented in this paper is compared with the method without load balancing as well as with the method load balancing with performance evaluation program. The experimental results show that our methods outperform all the other methods that we compared.

• Journal of the Korean Applied Science and Technology
• /
• v.34 no.2
• /
• pp.400-409
• /
• 2017

The purpose of this study was to measure the antioxidant and physiological activities of seed from Gardenia jasminoides Ellis fructus (GJE) in Namhae Korea. We determined proanthocyanidin. GJE seed were extracted by 70% ethanol, chloroform:methanol, 2:1 volume ratio (CM) and n-butanol of three solvents. To investigate by the solvent extract of flavonoid content and value as a functional food ingredient of GJE seed through various antioxidant activities were performed. Solvent extract antioxidant activity of increasing concentrations (0.2, 0.4, 0.6 mg/mL) were significantly increased (p<0.05). The content of proanthocyanidin in GJE seed was $70.035{\pm}0.772mg$ catechin eqivalents/g dry weight. As a result of bioactivity assay, by a solvent of seed were found that the relationship with the increase of flavonoid content increased bioactivities. The antioxidant activity of the extract from the other except for the n-butanol extract on seed was observed at a high level. The results suggest that Gardenia jasminoides Ellis fructus seed can be used as a natural antioxidant.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.6
• /
• pp.1-9
• /
• 2012

Low-cost RFID tags are used in many applications. However, since it has very limited power of computation and storage, it's not easy to make a RFID mutual authentication protocol which can resist from the various security attacks. Quite recently, Tian et al. proposed a new ultralightweight authentication protocol (RAPP) for low-cost RFID tags using the low computation cost operations; XOR, rotation, and permutation operations, which is able to resist from the various security attacks. In this paper, we show that RAPP is vulnerable to the de-synchronization attack and present an improved RAPP which overcomes the vulnerability of RAPP.

• The Magazine of the IEIE
• /
• v.11 no.5
• /
• pp.42-50
• /
• 1984

국내의 다음세대 컴퓨터 개발을 위한 VLSI 설계와 CAD 분야에 대한 연구 방향을 제시한다. 연구의 목표는 국제적으로 경쟁할 수 있는 VLSI 설계능력과 백만개 정도의 트랜지스터로 자성된 회로를 경제적으로 설계하기 위한 CAD 기술과 System의 확립이다. ·새로운 회로 구조와 알고리즘에 대한 연구 · CAD 도구와 언어의 개발에 관한 첨단 CAD 기술개발연구 · VLSI 설계에 필요한 CAD 도구 이용과 개발에 필요한 표준 인터페이스, 네트워킹, 컴퓨팅 하드웨어. 시스템 소프트웨어에 대한 연구등의 부분으로 크게 나눌 수 있다. 이용 가능한 CAD system을 평가하고 개선하며 첨단 CAD에 대한 소프트웨어와 하드웨어에 대해 · 컴퓨팅 하드웨어 · 프로그램 분위기 · 네트워킹 능력 ·자료 교환을 위한 표준인터페이스 등에 관해 조사분석도 병행한다. CAD에 관한 세부적인 연구 과제는 · 시스템 사양언어 · 설계 검증 ·시스템시뮬레이션· 설계 합성 · 설계 해석· 설계 방법론·디바이스와 공정 모델링 프로그램 등이다. 고속 계산용 VLSI에 관한 구조와 알고리즘은 행렬 계산을 위한 ·분산 배열 처리 회로 ·시스토릭 (Systolic) 배열 회로 ·셀률라(Cellular) 논리 회로 · 3차원 배열 회로 와 · 비규칙적 계산 알고리즘을 갖는 VLSI가 있다. VLSI설계훈련과 CAD 기술 축적을 위해 CAD enter를 설립하여 전국적인 CAD 네트워킹을 관계 연구소와 여러 대학에 가설하며, MPC 계획을 추진한다. VLSI설계 가능성이 입증되면 VLSI 설계능력을 더욱 향상 시키기 위해 0.5∼1.0mm기술의 silicon faundary를 설립한다. 연구 개발 조직은 대학, 산업체. 연구소가 삼위일체가 되어 수행될 수 있도록 연구 개발 위원회를 설치 운영하며 경쟁적이며 경제적으로 연구 업무를 집행하는 것이 바람직하다.았다.형질에 관여하는 귀전자에 미치는 기구에 대하여 검토할 여타가 있다고 보여진다. 분해능의 특징으로 미루어 앞으로는 레이저를 이용한 계측 방법이 그 주류를 이룰 것으로 사료된다. 우선 본 해설은 기체의 온도 및 농도의 광학적 측정방법중 Raman산란광 검출법에 대하여 실제로 측정하는 입장에서 간단히 소개한다.lity)이, 높은 $GA_3$함량에 기인된다'는 주장은 본실험(本實驗)으로 부인(否認)되었다. 따라서, 응용학적(應用學的) 측면에서 고려해 볼 때, 리베스식물(植物)의 육종기간 단축을 위한 모든 화아분화(花芽分化) 촉진 조치는 P.J.-식물(植物)이 20. node이상 생육하였을 때 취하는 것이 효율적인 것으로 결론 지어진다.앞당겨진 7月 셋째 週였다. 8. Culex (Culex) tritaeniorhynchus summoro년의 最大發生 peak는 1981年, 1982年 모두 8月 둘째 週였다. 9. Anopheles (Anopheles) sinensis의 最大發生 peak는 1981年에 7月 다섯째 週, 1982年은 2週 앞당겨진 7月 셋째 週였다. 10. 重要 3種의 最大 peak를 比城하면 Culex (Culex) pipiens pallens와 Anopheles (Anopheles) sinensis는 1981年과 1982年 모두 最大 peak時期가 同一하였으며, Culex (Culex) tritaeniorhynchus summoro년는 2年間 모두 8月둘째 週에 나타났다.osterior to manubrium and anterior to aortic arch) replacing the normal mediastinal fat. (2) In benign thymoma, the marging of the mass was smooth and the normal fat

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.2
• /
• pp.183-194
• /
• 2002

The clustering environment with heterogeneous workstations provides the cost effectiveness and usability for executing applications in parallel. Load balancing is considered a necessary feature for a cluster of heterogeneous workstations to minimize the turnaround time. Previously, static load balancing that assigns a predetermined weight for the processing capability of each workstation, or dynamic approaches which execute a benchmark program to get relative processing capability of each workstation were proposed. The execution of the benchmark program, which has nothing to do with the application being executed, consumes the computation time and the overall turnaround time is delayed. In this paper, we present efficient methods for task distribution and task migration, based on the relative load index. We designed and implemented a load balancing system for the clustering environment with heterogeneous workstations. Turnaround times of our methods and the round-robin approach, as well as the load balancing method using a benchmark program, were compared. The experimental results show that our methods outperform all the other methods that we compared.

• KIISE Transactions on Computing Practices
• /
• v.23 no.3
• /
• pp.156-164
• /
• 2017

Measuring the similarity of two graphs is a basic tool to solve graph problems in various applications. Most graph algorithms have a high time complexity according to the number of vertices and edges. Because Graphics Processing Units (GPUs) have a high computational power and can be obtained at a low cost, these have been widely used in graph applications to improve execution time. This paper proposes an efficient parallel algorithm to measure graph similarity using the CUDA on a GPU environment. The experimental results show that the proposed approach brings a considerable improvement in performance and efficiency when compared to CPU-based results. Our results also show that the performance is improved significantly as the size of the graph increases.

• Composites Research
• /
• v.14 no.2
• /
• pp.43-49
• /
• 2001

The characteristics of smart skin for wireless LAN system under compression load are investigated. The smart skin structure is composed of 3 layers of face material and 2 layers of core material. Theoretical formula for determining buckling load is derived by Rayleigh-Ritz method and compared with experimental result. The maximum length of specimen that buckling does not occur is determined by assuming that the compression load is sustained by only face material. In the experiment, if buckling occurs obviously then it follows the theoretical result well. In the process of buckling, the load supporting capability and the antenna property such as radiation pattern and reflection coefficient were examined.