• East Asian mathematical journal
• /
• v.38 no.2
• /
• pp.143-164
• /
• 2022

Computer technology in mathematics teaching-learning is not for teaching computer but for improving mathematics teaching-learning with computer. It is shown the use of computer technology comparing with traditional approach provides students more opportunities in order to approach abstract structure. Computer activity provides not only understanding concepts of analysis and opportunity to investigate theory but also effective background in teaching analysis. We analyze students' computer usage level on analysis education by using computer usage level according to role of computer technology. We try to get an useful educational implication on analysis education applying MATLAB through qualitative research.

• Annual Conference on Human and Language Technology
• /
• 2003.10d
• /
• pp.54-60
• /
• 2003

음차 표기된 외래어로부터 원어를 복원하는 문제는 원어의 발음정보를 이용한 통계적인 방법을 많이 사용한다. 하지만 지금까지의 연구들은 대부분 영어단어만을 그 대상으로 하였기 때문에 '도쿄(Tokyo)', '하인리히(Hinrich)'와 같이 어원이 영어가 아닌 단어들의 복원에는 좋은 결과를 보여주지 못했다. 이러한 문제를 해결하기 위하여 한글로 표기된 외래어의 어원을 판단할 수 있는 방법을 찾아내고, 이 방법을 통해 외래어를 어원별로 분리하여 학습모델을 구축함으로써 다양한 어원을 가진 외래어들의 복원 정확률을 높이고자 하였다. 위의 방식으로 구현된 시스템은 영어, 일본어, 중국어, 프랑스어의, 서로 다른 4개의 어원을 가진 데이터의 복원 실험에서 기존의 방식에 비해 13%의 성능 향상을 보였다.

• Annual Conference on Human and Language Technology
• /
• 2007.10a
• /
• pp.233-240
• /
• 2007

온톨로지 구축에서 클래스간 관계 설정은 중요한 부분이다. 본 논문에서는 클래스간 상 하위 관계 외의 관계 설정을 위한 클래스간 관계 자동 정의를 목적으로 의존구문분석의 (주어, 용언) (목적어, 용언) 쌍들을 추출하고, 이렇게 추출된 데이터를 이용하여 용언들을 클러스터링 하는 방법을 제안한다. 도메인 전문 코퍼스 데이터 희귀성 문제를 해결하고자, 웹검색을 결합한 방식을 선택하여 도메인 온톨로지 구축 클래스간 관계 자동 설정에 대한 방법론을 제시한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3421-3437
• /
• 2018

With the enlargement of wireless technology, vehicular ad-hoc networks (VANETs) are rising as a hopeful way to realize smart cities and address a lot of vital transportation problems such as road security, convenience, and efficiency. To achieve data confidentiality, integrity and authentication applying lightweight cryptosystems is widely recognized as a rather efficient approach for the VANETs. The Khudra cipher is such a lightweight cryptosystem with a typical Generalized Feistel Network, and supports 80-bit secret key. Up to now, little research of fault analysis has been devoted to attacking Khudra. On the basis of the single nibble-oriented fault model, we propose a differential fault analysis on Khudra. The attack can recover its 80-bit secret key by introducing only 2 faults. The results in this study will provides vital references for the security evaluations of other lightweight ciphers in the VANETs.

• International Journal of Computer Science & Network Security
• /
• v.21 no.9
• /
• pp.63-66
• /
• 2021

The technological advancement in computer vision has made system like grab-and-go grocery a reality. Now all the shoppers have to do now is to walk in grab the items and go out without having to wait in the long queues. This paper presents an intelligent retail environment system that is capable of monitoring and tracking customer's activity during shopping based on their interaction with the shelf. It aims to develop a system that is low cost, easy to mount and exhibit adequate performance in real environment.

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.147-154
• /
• 2023

Network intrusion refers to any unauthorized penetration or activity on a computer network. This upsets the confidentiality, integrity, and availability of the network system. One of the major threats to any system's availability is a Denial-of-Service (DoS) attack, which is intended to deny a legitimate user access to resources. Therefore, due to the complexity of DoS attacks, it is increasingly important to abstract and describe these attacks in a way that will be effectively detected. The automaton theory is used in this paper to implement a SYN Flood detection system based on Time-Dependent Finite Automata (TDFA).

• Journal of Computing Science and Engineering
• /
• v.7 no.4
• /
• pp.242-250
• /
• 2013

Many information systems that provide useful services to people are connected to the Internet for convenience and efficiency. However, improper accessibility might make the systems susceptible to a variety of attacks. Although existing security solutions such as an intrusion detection system, intrusion prevention system, and firewalls have been designed to protect against such attacks, it is impossible to block all kinds of attacks. Furthermore, most of the proposed solutions require information about attacks for efficient prevention. Research on intrusion-tolerant systems (ITSs) have been conducted in order to continue providing proper services in threatening environments. The purpose of an ITS is to survive against every intrusion, rather than to prevent them. In this paper, previous studies on ITS are introduced and classified according to the centric scheme as middleware-based ITS, hardware-based ITS, and recovery-based ITS. Recent research focusing on adaptive transformation schemes is also introduced.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.405-408
• /
• 2004

기업 환경의 변화에 의해 비즈니스 프로세스는 변경되며, 따라서 워크플로우와 이에 영향을 받는 요소들의 변경도 수반된다. 이때 워크플로우 관리시스템(WfMS)이 워크플로우의 변경에 따라 영향을 받는 요소를 예측하고 동적으로 변경하는 것은 어려운 문제이다. 이를 위해 본 논문에서는 Enterprise 온톨러지를 활용하여 워크플로우 변경 시 영향을 받는 요소를 예측해 보았다

• International Journal of Advanced Culture Technology
• /
• v.6 no.2
• /
• pp.51-57
• /
• 2018

The purpose of this study is to try finding the research possibilities of computer technology in art education and understand why computer technology has such a great impact on our contemporary education. The methodology of this study is based on the analysis of literature review. I have tried to find the importance articles in the journals of art education such as Studies in Art Education and Art Education published from the National Art Education Association, one of the most well-known organizations in the field of art education. To draw the purpose of this study, I found articles and categorized the information using key words such as aesthetic, feminist, gender issues, and interactivity. After analyzing, I have discussed about the research possibilities and important issues of computer technology in art education and then categorized the information found in each article into four different subheadings: 1) the visual effects of computer graphics in art education, 2) gender issues based on the computer technology, 3) interactive multimedia and social interactions among students, 4) research possibilities with computer technologies in art education. The findings are as follow. Firstly, there were many research possibilities of computer technologies in art education such as ways of criticizing the contemporary art world. Secondly, I found that computer technology has a great impact on art education because students are more eager to engage with computer technologies-based media activities and very familiar with new media either at home and school. Therefore, we, as educators, must address how the student will be systematically engaged with computer technologies in their educational environment and should determine what knowledge and skills prospective teachers bring to our teacher education programs and how and where they acquired this knowledge.

• International Journal of Computer Science & Network Security
• /
• v.24 no.2
• /
• pp.15-24
• /
• 2024

One of the most significant issues in combinatorial optimization is the classical NP-complete conundrum known as the 0/1 Knapsack Problem. This study delves deeply into the investigation of practical solutions, emphasizing two classic algorithmic paradigms, brute force, and dynamic programming, along with the metaheuristic and nature-inspired family algorithm known as the Genetic Algorithm (GA). The research begins with a thorough analysis of the dynamic programming technique, utilizing its ability to handle overlapping subproblems and an ideal substructure. We evaluate the benefits of dynamic programming in the context of the 0/1 Knapsack Problem by carefully dissecting its nuances in contrast to GA. Simultaneously, the study examines the brute force algorithm, a simple yet comprehensive method compared to Branch & Bound. This strategy entails investigating every potential combination, offering a starting point for comparison with more advanced techniques. The paper explores the computational complexity of the brute force approach, highlighting its limitations and usefulness in resolving the 0/1 Knapsack Problem in contrast to the set above of algorithms.