• Journal of KIISE:Computer Systems and Theory
• /
• 제36권1호
• /
• pp.9-20
• /
• 2009

In a real-time system with both hard real-time periodic tasks and soft real-time aperiodic tasks, it is important to guarantee the deadlines of each periodic task as well as obtain fast response time for each aperiodic task. This paper proposes Enhanced Total Bandwidth Server (ETBS) with possibly shorter response time than Total Bandwidth Server (TBS), which is efficient and widely used for servicing aperiodic tasks. For uniprocessor system using Earliest Deadline First (EDF) scheduling algorithm, ETBS assigns an on-line deadline to each aperiodic task considering a surplus slack time which gained for every unit execution time of periodic job. The proposed method can fully utilize the processor while meeting all the deadlines of periodic tasks. We show that the proposed ETBS provides better response time of aperiodic tasks than TBS theoretically, but has the same computational complexity as TBS, O(1). Simulation results show that the response time of aperiodic tasks with ETBS are shorter than one with TBS.

• The Journal of Korean Association of Computer Education
• /
• 제22권3호
• /
• pp.55-65
• /
• 2019

In programming language learning system of flip learning methods, the evaluation of cyber lectures generally proceeds from online to multiple choice questions. In this case, the questions are randomly extracted from the question bank and given to individual learners. In order for these evaluation results to be reflected in the grades, the equity of the examination question is more important than anything else. Especially in the programming language subject, the degree of difficulty that learners think can be different depending on the type of problem. In this paper, we classify the types of multiple-choice problems into two categories, and manage the difficulty level by each type. And we propose a question selection algorithm that considers both difficulty level and type of question. Considering the characteristics of the programming language, experimental results show that the proposed algorithm is more efficient and fair than the conventional method.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• 제20권1호
• /
• pp.1-8
• /
• 2019

Most of rotor resistance estimators utilizes Classical qd Model (CQDM) and Alternate qd Model (AQDM). The rotor resistance estimators based on both models were shown to provide an accurate rotor resistance estimate under conditions where flux is constant such as a field-oriented control (FOC) based induction motor drives. Under the conditions where flux is varying such as a Maximum torque per amp (MTPA) control, AQDM based rotor resistance estimator estimates actual rotor resistance accurately even in different operating points. However, CQDM based rotor resistance estimator has not been investigated and its performance is questionable under condition where flux level is varying. Thus, in this work, the performance of CQDM based rotor resistance estimator was investigated and made comparisons with AQDM based estimator under conditions where flux level is significantly varying such as in MTPA control based induction motor drives. Unlike AQDM based estimator, the laboratory results show that the CQDM based estimator underestimates actual rotor resistance and exhibits an undesirable dip in the estimates in different operating points.

• Journal of Convergence for Information Technology
• /
• 제9권7호
• /
• pp.33-40
• /
• 2019

As aerospace industry has been activated recently, it is required to commercialize composite analysis software. Until now, commercial software has been mainly used for analyzing composites, but it has been difficult to use due to high price and limited functions. In order to solve this problem, automatic analysis software for both in-plane and corner radius strength, which are all made on-line and generalized, has recently been developed. However, these have the disadvantage that they can not be analyzed simultaneously with multiple failure criteria. In this paper, we propose a method to greatly improve the processing speed while simultaneously handling the analysis of multiple failure criteria using a parallel processing platform that only works with a GPU equipped with a CUDA core. We have obtained satisfactory results when the analysis speed is experimented on the vast structure data.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 한국컴퓨터정보학회 2019년도 제60차 하계학술대회논문집 27권2호
• /
• pp.315-316
• /
• 2019

전투복, 군용 천막 등에 사용되는 위장무늬는 군 작전 수행 시 주변 환경의 색상, 패턴을 모사하여 개인병사 및 무기체계의 위장 기능을 극대화하고, 이를 통해 아군의 생명과 시설피해를 최소화하기 위한 목적으로 사용된다. 특히 최근 들어 군의 작전환경과 임무가 복잡하고 다양해짐에 따라, 작전환경에 대한 데이터의 취득 및 정량적 분석을 통해 전장 환경에 최적화된 위장무늬 패턴 및 색상 추출에 대한 연구의 필요성이 증대되고 있다. 본 논문에서는 한반도 자연환경 영상에 대한 자기 조직화 지도(SOM, Self-organizing Map) 기반의 한반도 자연환경 대표 색상 군집화 연구 방법에 대해 서술한다. 이를 위해 한반도 내 위도를 고려한 장소에서 시간별, 계절별 자연환경 영상 수집을 진행하며, 수집된 영상 내 다수의 화소의 군집화를 위해 2차원 SOM을 활용한다. 영상 내 각 화소의 색상 값에 대한 SOM의 학습 시, RGB공간상의 색차/색상 인지 왜곡을 피하기 위하여 CIEDE2000 색차 식을 통해 군집화를 진행한다. 실험결과에서는 온라인상으로 수집한 여름 및 가을철 대표 색상 군집화 결과와, 현재까지 수집된 계절별 자연환경 사진 내 6억 7648개 화소에 대한 대표 색상 군집화 결과를 보여준다.

• Journal of the Korea Society of Computer and Information
• /
• 제26권9호
• /
• pp.13-25
• /
• 2021

In the age of digital innovation based on the Internet, Information and Communication and Artificial Intelligence technologies, huge amounts of datasets are being generated, collected, accumulated, and opened on the web by various public institutions providing useful and public information. In order to analyse, gain useful insights and information from data, Formal Concept Analysis(FCA) has been successfully used for analyzing, classifying, clustering and visualizing data based on the binary relation between objects and attributes in the dataset. In this paper, we present an approach for enhancing the analysis of relational attributes of data within the extended framework of FCA, which is designed to classify, conceptualize and visualize sets of objects described not only by attributes but also by relations between these objects. By using the proposed tool, RCA wizard, several experiments carried out on some public open datasets demonstrate the validity and usability of our approach on generating and visualizing conceptual hierarchies for extracting more useful knowledge from datasets. The proposed approach can be used as an useful tool for effective data analysis, classifying, clustering, visualization and exploration.

• Journal of Digital Convergence
• /
• 제17권11호
• /
• pp.201-206
• /
• 2019

While many users searched for insurance information online, there were not many cases of contents recommendation researches on insurance companies' websites. Therefore, this study proposed a page recommendation system with high possibility of preference to users by utilizing page visit history of insurance companies' websites. Data was collected by using client-side storage that occurs when using a web browser. Collaborative filtering was applied to research as a recommendation technique. As a result of experiment, we showed good performance in item-based collaborative (IBCF) based on Jaccard index using binary data which means visit or not. In the future, it will be possible to implement a content recommendation system that matches the marketing strategy when used in a company by studying recommendation technology that weights items.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제24권8호
• /
• pp.970-977
• /
• 2020

The collaborative filtering recommendation technique has been the most widely used since the beginning of e-commerce companies introducing the recommendation system. As the online purchase of products or contents became an ordinary thing, however, recommendation simply applying purchasers' ratings led to the problem of low accuracy in recommendation. To improve the accuracy of recommendation, in this paper suggests the method of collaborative filtering that analyses product reviews and uses them as a weighted value. The proposed method refines product reviews with text mining to extract features and conducts sentiment analysis to draw a sentiment score. In order to recommend better items to user, sentiment weight is used to calculate the predicted values. The experiment results show that higher accuracy can be gained in the proposed method than the traditional collaborative filtering.

• Journal of the Korea Society of Computer and Information
• /
• 제25권12호
• /
• pp.145-153
• /
• 2020

Recently, keyword extraction from social big data has been widely used for the purpose of extracting opinions or complaints from the user's perspective. Regarding this, our previous work suggested a method to improve accuracy of keyword extraction based on the notion of cohesion scoring, but its accuracy can be degraded when the number of input reviews is relatively small. This paper presents a method to resolve this issue by applying simplified morphological analysis as a postprocessing step to extracted keywords generated from the algorithm discussed in the previous work. The proposed method enables to add analysis rules necessary to process input data incrementally whenever new data arrives, which leads to reduction of a dictionary size and improvement of analysis efficiency. In addition, an interactive rule adder is provided to minimize efforts to add new rules. To verify performance of the proposed method, experiments were conducted based on real social reviews collected from online, where the results showed that error ratio was reduced from 10% to 1% by applying our method and it took 450 milliseconds to process 5,000 reviews, which means that keyword extraction can be performed in a timely manner in the proposed method.

• Journal of the Korea Society of Computer and Information
• /
• 제26권8호
• /
• pp.55-63
• /
• 2021

Since social big data often includes new words or proper nouns, statistical morphological analysis methods have been widely used to process them properly which are based on the frequency of occurrence of each word. However, these methods do not properly recognize compound nouns, and thus have a problem in that the accuracy of keyword extraction is lowered. This paper presents a method to extract compound nouns in keyword analysis of social big data. The proposed method creates a candidate group of compound nouns by combining the words obtained through the morphological analysis step, and extracts compound nouns by examining their frequency of appearance in a given review. Two algorithms have been proposed according to the method of constructing the candidate group, and the performance of each algorithm is expressed and compared with formulas. The comparison result is verified through experiments on real data collected online, where the results also show that the proposed method is suitable for real-time processing.