• Journal of the Korea Society of Computer and Information
• /
• v.7 no.2
• /
• pp.59-67
• /
• 2002

Major Characteristic of the 7th National Curriculum in science is to provide deep and supplementary learning, depending on the level of each learner. In the level-oriented curriculum, coursewares are used to present teaching materials to various levels. In most coursewares, however, they provide their contents at a uniform level and hence it is hard to expect level-oriented learning. This paper presents learner's modeling for developing student's level-oriented dynamic tutoring system for science class , Instructional module of this system made by component unit is able to be reconstructed dynamically. Learning module is constructed using a hybrid model mixed of Overlay and Bug model. Testing module interprets diagnostic errors to be established by given differentiated weight in accordance with item's difficulty and discrimination. Through ITS student modeling, this system presents various problem solving methods reconstructed by learner's level differentiated.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.169-175
• /
• 2006

In this paper we propose a method of reconstruction of cylindrical panorama using simplified projective transform from the panning image on the fixed camera. For the practical construction of cylindrical panorama we consider the rotation of the camera on the Y-axis only, even though considering the rotation components on all of the X,Y,Z axis on three-dimensional space for projective transform between general panoramas. The restriction mentioned above simplifies projective transform with existing 8 degrees of freedom into the one with 4 degrees of freedom. In the results, overall computation for projective transform can be decreased to the great extents in quantify, because the number of corresponding points required for inducing the transforming formula is gone down by half. Proposed algorithm from the simulation carried out in this paper shows similar performance and decreased computational quantity compared with existing algorithm. Also, it shows the construction of cylindrical panorama using simplified projective transform.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.1
• /
• pp.283-291
• /
• 2021

In this paper, we propose the development and application of a software education program for underachievers. The software education program for underachieving students was developed in consideration of the characteristics of learner's suffering from underachievement and the educational effects of software education, and is meaningful in that it proposes a plan to improve the learning gap in distance learning. Learners can acquire digital literacy and learning skills by solving structured tasks in the form of courseware, intelligent tutoring, debugging, and artificial intelligence learning models in educational programs. Based on the effects of software education, such as enhancing logical thinking ability and problem solving ability, this program provides opportunities to solve fusion tasks to underachievers. Based on this, it is expected that it can have a positive effect on the overall academic work.

• Journal of Korea Entertainment Industry Association
• /
• v.5 no.1
• /
• pp.127-133
• /
• 2011

Characters in natural image are an important information with various context. Previous work of character region detection algorithms is not detect of character region in case of image complexity and the surrounding lighting, similar background to character, so this paper propose an method of character region detection in natural image using edge and connected component by morphological reconstructions. Firstly, we detect edge using Canny-edge detector and connected component with local min/max value by morphological reconstructed-operation in gray-scale image, and labeling each of detected connected component elements. lastly, detected candidate of text regions was merged for generation for one candidate text region, Final text region detected by checking the similarity and adjacency of neighbor of text candidate individual character. As the results of experiments, proposed algorithm improved the correctness of character regions detection using edge and connected components.

• Journal of Internet of Things and Convergence
• /
• v.10 no.1
• /
• pp.7-12
• /
• 2024

To trade cryptocurrency, traders require a personal cryptocurrency wallet. Cryptocurrency itself using blockchain technology is guaranteed excellent security and reliability, so the threat of blockchain hacking is almost impossible, but the exchange environment used by traders for transactions is most subject to hacking threats. Even if transactions are made safely through blockchain during the transaction process, if the trader's wallet information itself is hacked, security cannot be secured in these processes. Exchange hacking is mainly done by stealing a trader's wallet information, giving the hacker access to the victim's wallet assets. In this paper, to prevent this, we would like to reconstruct the existing Hyperledger Fabric structure and propose a system that verifies the identity integrity of traders during the transaction process using whitelisting. The advantage is that through this process, damage to cryptocurrency assets caused by hackers can be prevented and recognized. In addition, we aim to point out and correct problems in the transaction process that may occur if the victim's wallet information is stolen from the existing Hyperledger Fabric.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.2 s.302
• /
• pp.113-120
• /
• 2005

3D reconstruction of a scene structure from un-calibrated image sequences has been long one of the central problems in computer vision. For 3D reconstruction in Euclidean space, projective reconstruction, which is classified into the merging method and the factorization, is needed as a preceding step. By calculating all camera projection matrices and structures at the same time, the factorization method suffers less from dia and error accumulation than the merging. However, the factorization is hard to analyze precisely long sequences because it is based on the assumption that all correspondences must remain in all views from the first frame to the last. This paper presents a new projective reconstruction method for recovery of 3D structure over long sequences. We break a full sequence into sub-sequences based on a quantitative measure considering the number of matching points between frames, the homography error, and the distribution of matching points on the frame. All of the projective reconstructions of sub-sequences are registered into the same coordinate frame for a complete description of the scene. no experimental results showed that the proposed method can recover more precise 3D structure than the merging method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.11
• /
• pp.5465-5470
• /
• 2012

FPGA(Field Programmable Gate Array) devices are widely used due to their merits in circuit development time, and development cost. Among various FPGA technologies, SRAM-based FPGAs have large cell capacity so that they are attractive for complex circuit design and their reconfigurability. However, they are weak in space environment where radiation energy particles cause Single Event Upset(SEU). In this paper, we designed a controller supervising SRAM-based FPGA to protect configuration memory inside. The controller is implemented on an Anti-Fusing FPGA. Radiation test was performed on the implemented computer board and the result show that our controller provides better SEU-resilience than TMR-only system.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.2
• /
• pp.65-72
• /
• 2007

As embedded system has strict cost and space constraints, it is impossible to apply conventional fault-tolerant techniques directly for increasing the dependability of embedded system. In this paper, we propose software fault-tolerant mechanism which requires only minimum redundancy of system component. We define an utility metric that reflects the dependability of each embedded system component, and then measure the defined utility of each reconfiguration combinations to provide fault tolerance. The proposed utility evaluation process shows exponential complexity. However we reduce the complexity by hierachical subgrouping at the software level of each component. When some components of embedded system are tailed, reconfiguration operation changes the system state from current faulty state to pre-calculated one which has maximum utility combination.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.2 s.308
• /
• pp.63-71
• /
• 2006

Denoising and reconstruction of color images are extensively studied in the field of computer vision and image processing. Especially, denoising and reconstruction of color face images are more difficult than those of natural images because of the structural characteristics of human faces as well as the subtleties of color interactions. In this paper, we propose a denoising method based on PCA reconstruction for removing complex color noise on human faces, which is not easy to remove by using vectorial color filters. The proposed method is composed of the following five steps: training of canonical eigenface space using PCA, automatic extraction of facial features using active appearance model, relishing of reconstructed color image using bilateral filter, extraction of noise regions using the variance of training data, and reconstruction using partial information of input images (except the noise regions) and blending of the reconstructed image with the original image. Experimental results show that the proposed denoising method maintains the structural characteristics of input faces, while efficiently removing complex color noise.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.6
• /
• pp.711-718
• /
• 2019

BDD is a well-known alternative to the conventional Boolean logic method in fault tree analysis. As the size of fault tree increases, the calculation time and computer resources for BDD dramatically increase. A new failure path search and path restructure method is proposed for efficient calculation of CS and MCS from BDD. Failure path grouping and bottom-up path search is proved to be efficient in failure path search in BDD and path restructure is also proved to be used in order to reduce the number of CS comparisons for MCS extraction. With these newly proposed methods, the top event probability can be calculated using the probability by ASDMP(Approximate Sum of Disjoint MCS Products), which is shown to be equivalent to the result by the conventional MCUB(Minimal Cut Upper Bound) probability.