• Title/Summary/Keyword: Information Processing Theory

Search Result 597, Processing Time 0.041 seconds

Effectiveness Analysis of Programming Education for College of Education Student Based on Information Processing Theory Applied DEVS Methodology (DEVS 형식론 기반의 정보처리학습이론을 적용한 사범대생 대상 프로그래밍교육의 효과성 분석)

  • Han, Youngshin
    • Journal of Korea Multimedia Society
    • /
    • v.23 no.9
    • /
    • pp.1191-1200
    • /
    • 2020
  • In this paper, we proposed DEVS based programming education model that based on the cognitive information processing theory, not a grammatical programming education, and studied effectiveness analysis using computer thinking patterns. By creating a small range of patterns in the grammar which underlies the programming language and solving various examples through combinations, this paper shows an education method to develop problem-solving skills based on algorithmic thinking. The purpose of this study is to facilitate non-majors learn programming languages and understand patterned program structures when writing programs by patterning of control statements which the most important in learning programming.

Improving the Diffusion of the Stream Cipher Salsa20 by Employing a Chaotic Logistic Map

  • Almazrooie, Mishal;Samsudin, Azman;Singh, Manmeet Mahinderjit
    • Journal of Information Processing Systems
    • /
    • v.11 no.2
    • /
    • pp.310-324
    • /
    • 2015
  • The stream cipher Salsa20 and its reduced versions are among the fastest stream ciphers available today. However, Salsa20/7 is broken and Salsa20/12 is not as safe as before. Therefore, Salsa20 must completely perform all of the four rounds of encryption to achieve a good diffusion in order to resist the known attacks. In this paper, a new variant of Salsa20 that uses the chaos theory and that can achieve diffusion faster than the original Salsa20 is presented. The method has been tested and benchmarked with the original Salsa20 with a series of tests. Most of the tests show that the proposed chaotic Salsa of two rounds is faster than the original four rounds of Salsa20/4, but it offers the same diffusion level.

Computation of Noncentral T Probabilities using Neural Network Theory (신경망이론에 의한 비중심T분포 확률계산)

  • Gu, Son-Hee
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.1
    • /
    • pp.177-183
    • /
    • 1997
  • The cumulative function of the noncentral t distribution calculate power in testing equality of means of two normal populations and confidence intervals for the ratio of population mean to standard deviation. In this paper, the evaluation of the cumulative function of noncentral t distribution is applied to the neural network consists of the multi-layer perception structure and learning process has the algorithm of the backpropagation. Numerical comparisons are made between the Fisher's values and the results obtained by neural network theory.

  • PDF

Evaluation of an Alarm System Using Signal Detection Theory(SDT)

  • Park, Jin-Kyun;Hong, Jin-Hyuk;Chang, Soon-Heung
    • Proceedings of the Korean Nuclear Society Conference
    • /
    • 1995.10a
    • /
    • pp.197-202
    • /
    • 1995
  • When the process disturbance of nuclear power plant occurred, the operator should ensure plant safety, economy and identify the causes of disturbance. To accomplish these goals, operator should process a large amounts of information. Among these, alarms would be often in the operator's first indication of a plant state change or disturbance. To support limited information processing capability of operator, considerable works are under way to develop advanced alarm processing systems and to evaluate it. However, conventional evaluation method could provide just evaluation results but the design alternatives to enhance alarm system performance. To overcome problems associated with conventional evaluation methods of alarm system, signal detection theory(SDT) was introduced, and it was possible conclude that SDT could not only evaluate system but also suggest design alternatives for performance enhancement.

  • PDF

A Study on the Hangeul Pattern Classification by Using Adaptive Resonance Theory Neural Network (ART 신경회로망을 이용한 한글 유형 분류에 관한 연구)

  • Jang, Jae-Hyuk;Park, Chang-Han;NamKung, Jae-Chan
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.05a
    • /
    • pp.603-606
    • /
    • 2003
  • 본 논문에서는 ART(Adaptive Resonance Theory) 신경회로망을 이용하여 한글 모음을 인식하고, 그 유형을 분류하는 방법을 제안하였다. 기존의 연구들은 단순히 문자의 선분, 획 등의 정합만을 이용하여 한글의 자소 분류에 중점을 두었다. 그러나 인식 대상 운자의 특성이 각각 다르므로 효율적인 인식을 위해서는 먼저 포괄적인 특정적 유형 분류가 필요하다. 제안된 한글 유형 분류 시스템에서는 먼저 ART 신경회로망의 문제점인 증가분류 알고리즘의 단점을 최소화할 수 있도록 비교층에 최초 활성화패턴의 크기를 기억하는 메모리를 두고 각 층간 하향틀 변화를 경계인수 값을 "1" 이내로 제한하여 이미 입력된 패턴을 다시 입력할 때, 새로운 노드의 활성화를 방지하여 비교적 입력순서에 둔감한 분류가 가능하였다. 실험 결과 제안된 시스템에서는 한글의 6형식 중 1, 3, 4, 5형식 분류는 평균 97.3% 의 분류율을 보였으나, 나머지 2, 6형식 분류는 다소 떨어지는 평균 94.9% 분류율를 보였다.

  • PDF

Distancing the Constraints on Syntactic Variations

  • Choi, Hye-Won
    • Language and Information
    • /
    • v.11 no.1
    • /
    • pp.77-96
    • /
    • 2007
  • This paper investigates syntactic variations in English such as Dative Alternation, Particle Inversion, and Object Postposition (Heavy NP Shift) within the framework of Optimality Theory, and shows that the same set of morphological, informational, and processing constraints affect all these variations. In particular, it shows that the variants that used to be regarded as ungrammatical are in fact used fairly often in reality, especially when processing or informational conditions are met, and therefore, grammatical judgment may not be always categorical but sometimes gradient. It is argued that the notion of distance in constraint ranking in stochastic OT can effectively explain the gradience and variability of grammaticality in the variation phenomena.

  • PDF

Theory and Practice of Automatic Indexing (자동색인의 이론과 실제)

    • Journal of Korean Library and Information Science Society
    • /
    • v.30 no.3
    • /
    • pp.27-51
    • /
    • 1999
  • This paper deals with the methods as well as the problems associated with automatic extraction indexing and assignment indexing, expert systems for indexing, and major approaches currently used to index the Internet resources. It also briefly reviews basic methods for establishing hypertext/hypermedia links automatically. The methods used in much of text processing today are not particularly new. Most of the them were used, perhaps in a more rudimentary form, 30 or more years ago by Luhn and many other investigators. Better results can be achieved today because much greater bodies of electronic text are now avaliable and the power of present-day computers allows the processing of such text with reasonable efficiency.

  • PDF

A Tree Morphing Animation Using Fractal Theory based on the Web (웹기반에서의 랜덤 프랙탈을 이용한 나무 모핑 애니메이션)

  • Bae, Woo-Jung;Song, Hang-Sook
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2000.04a
    • /
    • pp.240-243
    • /
    • 2000
  • 웹 환경에서 모핑 애니메이션들은 전송량의 증가에 따른 과부하를 줄이기 위하여 소스들을 다운 로드 하여 자신의 컴퓨터에서 실행하여 통신 트래픽을 해소하고자 한다. 이때의 애니메이션들은 기하학적 프리미티들을 이용하여 만든 동화상들로 자연스러운 실세계 등의 모습을 표현하기에는 무리가 있다. 본 논문에서는 이러한 문제들을 해결하는 한 방법이면서 보다 다양한 자연의 랜덤한 모습을 보이기 위해 랜덤프랙탈을 사용 한다.

  • PDF

Route Optimization Algorithm Based on Game Theory for Tourism Routes at Pseudo-Imperial Palace

  • Liu, Guangjie;Zhu, Jinlong;Sun, Qiucheng;Hu, Jiaze;Yu, Hao
    • Journal of Information Processing Systems
    • /
    • v.17 no.5
    • /
    • pp.879-891
    • /
    • 2021
  • With improvements in living conditions, an increasing number of people are choosing to spend their time traveling. Comfortable tour routes are affected by the season, time, and other local factors. In this paper, the influencing factors and principles of scenic spots are analyzed, a model used to find the available routes is built, and a multi-route choice model based on a game theory utilizing a path recommendation weight is developed. A Monte Carlo analysis of a tourist route subjected to fixed access point conditions is applied to account for uncertainties such as the season, start time, end time, stay time, number of scenic spots, destination, and start point. We use the Dijkstra method to obtain multiple path plans and calculate the path evaluation score using the Monte Carlo method. Finally, according to the user preference in the input path, game theory generates path ordering for user choice. The proposed approach achieves a state-of-the-art performance at the pseudo-imperial palace. Compared with other methods, the proposed method can avoid congestion and reduce the time cost.

Study of Danger-Theory-Based Intrusion Detection Technology in Virtual Machines of Cloud Computing Environment

  • Zhang, Ruirui;Xiao, Xin
    • Journal of Information Processing Systems
    • /
    • v.14 no.1
    • /
    • pp.239-251
    • /
    • 2018
  • In existing cloud services, information security and privacy concerns have been worried, and have become one of the major factors that hinder the popularization and promotion of cloud computing. As the cloud computing infrastructure, the security of virtual machine systems is very important. This paper presents an immune-inspired intrusion detection model in virtual machines of cloud computing environment, denoted I-VMIDS, to ensure the safety of user-level applications in client virtual machines. The model extracts system call sequences of programs, abstracts them into antigens, fuses environmental information of client virtual machines into danger signals, and implements intrusion detection by immune mechanisms. The model is capable of detecting attacks on processes which are statically tampered, and is able to detect attacks on processes which are dynamically running. Therefore, the model supports high real time. During the detection process, the model introduces information monitoring mechanism to supervise intrusion detection program, which ensures the authenticity of the test data. Experimental results show that the model does not bring much spending to the virtual machine system, and achieves good detection performance. It is feasible to apply I-VMIDS to the cloud computing platform.