• Journal of KIISE:Software and Applications
• /
• v.32 no.4
• /
• pp.290-299
• /
• 2005

Stealing the source code of a program is a serious problem not only in a moral sense but also in a legal sense. However, it is not clear whether the code of a program is copied from another or not. There was a program similarity checker detecting code-copy by comparing the syntax trees of programs. However this method has a limitation that it cannot detect the code-copy attacks when the attacker modifies the syntax of the program on purpose. We propose a program similarity check by program control graph, which reveals not only syntax information but also control dependancy. Our method can detect the code-copy attacks that do not change control dependancy Moreover, we define what code-copy means and establish the connection between code-copy and similarity of program control graph: we prove that two programs are related by copy congruence if and only if the program control graphs of these programs are equivalent. We implemented our method on a functional programming language, nML. The experimental results show us that the suggested method can detect code similarity that is not detected by the existing method.

• The KIPS Transactions:PartA
• /
• v.11A no.1
• /
• pp.89-96
• /
• 2004

Abstraction is an important concept applied widely to variables, functions, complex data, abstract data types, classes and polymorphism in programming languages. However, the concept of abstraction has been considered as ambiguous and explained differently because it is not defined clearly and uniformly. In this paper, we analyse many aspects of abstraction in programming languages, and propose the taxonomy of abstraction. We classify abstraction according to the mechanism of formation into 4 categories such as napping abstraction, bundling abstraction. integrating abstraction and extending abstraction. We also consider many concepts related closely to abstraction such as functions, abstract data types, objects, encapsulation and classes in the view of abstraction. These analysis and consideration will make it possible to explain uniformly various aspects of abstraction which have been treated individually and differently, and to understand the meanings, necessity and importance of abstraction more intensively.

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

Separable systems are defined in term rewriting systems, respecting the notion of separability in the λ-calculus. In this research, we generalize separable systems of term rewriting systems, which was studied in restrictive systems such as constructive systems. We also associate separability with index-transitivity and with forward branching Separability is identified with forward branching, and strong sequentiality with index-transitivity satisfies separability. These are such good properties that enable us to describe the procedure of pattern-matching as an index tree, which is a sort of automata, and to transform separable systems into a constructor system with a simple pattern. Separable systems, in particular, can be translated into the λ-calculus. This research can serve a theoretical basis which allows functional languages to be explained by the λ-calculus, since functional languages such as ML and Haskell belong to a subclass of separable systems.

• New Physics: Sae Mulli
• /
• v.68 no.12
• /
• pp.1364-1373
• /
• 2018

A recognizable form having meaning is called a sign in semiotics. The sign is transformed into a physical counter form in this work. Its internal structure is restricted on the linguistic concept structure. We borrow the concept of a mathematical function from the utility function of a rational personal in the economy. Universalizing the utility function by introducing the consistency of independency on the manner of construction, we construct the probability. We introduce a random variable for the probability and join it to a position variable. Thus, we propose a physical sign and its serial changes in the forms of stochastic equations. The equations estimate three patterns (jumping, drifting, diffusing) of possible solutions, and we find them in the one-day stock-price flow. The periods of jumping, drifting and diffusing were about 2, 3.5, and 6 minutes for the Kia stock on 11/05/2014. Also, the semiotic sign (icon, index, symbol) can be expected from the equations.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.1
• /
• pp.87-92
• /
• 2016

In this paper, optimization technique such as particle swarm optimization was used to optimize the parameters of fuzzy Extreme Learning Machine. While the learning speed of conventional neural networks is very slow, that of Extreme Learning Machine is very fast. Fuzzy Extreme Learning Machine is composed of the Extreme Learning Machine with very fast learning speed and fuzzy logic which can represent the linguistic information of the field experts. The general sigmoid function is used for the activation function of Extreme Learning Machine. However, the activation function of Fuzzy Extreme Learning Machine is the membership function which is defined in the procedure of fuzzy C-Means clustering algorithm. We optimize the parameters of the membership functions by using optimization technique such as Particle Swarm Optimization. In order to validate the classification capability of the proposed classifier, we make several experiments with the various machine learning datas.

• Journal of the Korean School Mathematics Society
• /
• v.20 no.3
• /
• pp.277-302
• /
• 2017

Educational objectives for mathematics in the curriculum revised in 2009 and the curriculum revised in 2015 put great emphasis on practical use of math, but perception of that lacks at schools. Accordingly, this research is recognizing the need for paying attention to curriculum focusing on mathematical connectivity and is inspecting CMP curriculum which has been developed over the years to reinforce problem solving competence and improve communication skills. This study analyzes CMP textbooks published as third edition in 2014 after several revisions, focusing on equations, inequalities and functions. First, this thesis analyzes mathematical connectivity using a new analysis framework which applied the modes of representation(situations, verbal description/ tables/ graphs/ formulae) made by Janvier(1987). Second, this research analyzes connectivities between different units, various sections, other subjects and practical contents related to the real life. The results: CMP textbooks use various practical materials for specific situations. They represent twelve processes of connectivity according to the modes of representation of Janvier. The books also show relationship between equations and functions, between inequalities and functions. And CMP textbooks include other subjects and practical contents.

• Annual Conference of KIPS
• /
• 2017.04a
• /
• pp.83-86
• /
• 2017

단일 코어 프로세스의 성능 향상은 전력 소모, 발열 등의 이유로 한계에 달했다. 이에 대한 대안으로 멀티 코어가 등장했으며 매니 코어 기술에 대한 연구가 활발히 진행 중에 있다. 이렇듯 멀티 코어 환경이 보편화됨에 따라 병렬 프로그래밍의 중요성이 더욱 커졌다. 한편, 순수 함수형 언어 Haskell은 부수효과가 없고 다양한 병렬화 도구를 지원함으로써 다가오는 병렬 프로그래밍 시대에 적합한 언어라 할 수 있다. 이때 Haskell 병렬 프로그램의 성능은 메모리 재사용(Garbage Collection) 시간에 큰 영향을 받는다. 그래서 Haskell 병렬 프로그램의 성능 향상, 분석을 위한 메모리 프로파일링 도구가 필요하다. 이미 Haskell이 제공하는 메모리 프로파일링 도구로 ghc-gc-tune이 있지만 실행 속도 측면에서 개선이 필요하다. 본 연구에서는 분할 정복법을 이용해서 매 단계마다 탐색 영역을 4분의 1로 줄이도록 ghc-gc-tune을 개선했다. 개선된 ghc-gc-tune을 극대 독립 집합 프로그램과 K-means 프로그램에 적용한 결과, 평균 98%의 정확도로 실행 시간을 평균 7.78배 단축했다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.12
• /
• pp.3574-3580
• /
• 2009

An embedded motion controller supporting the PLC programming environment based on the IEC 61131-3 International Standard Language was developed in this paper. In this developed motion controller, the CoDeSys, one of the IEC61131-3 development tools, was embedded in order to support that of PLC as well as the development environment of the PC, and the various function blocks based on PLCopen standard for motion control such as the linear and circular interpolation control were implemented. Moreover, the ethernet based remote control on real-time operating system and the motion simulator for a motion programmer were implemented.

• Korean Journal of Cognitive Science
• /
• v.10 no.1
• /
• pp.45-55
• /
• 1999

This paper argues that the basic modes of spatial cognition can be best identified in terms of argument/participant location, and shows that natural language uses‘simple’types of semantic denotations to encode spatial cognition, and further notes that spatial expressions should be interpreted not as locating an event/state as a whole but as locating arguments/participants of the event. The ways of locating events/states are identified in terms of argument orientation(AO), Which indicates semantic patterns of linkiarticipant location. and shows that natural langrage uses ng locatives to specific arguments. Four patterns of argument orientation described here reveal substantial modes of spatial cognition. and the AO patterns are mostly determined by the semantic classes of English verbs combining with locative expressions, i.e., by the event type of the predicate. As for the denotational constraint of locatives, the paper concludes that semantic denotations of locative PPs are restricted to the intersecting functions mapping relations to relations.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.249-254
• /
• 2013

This paper presented a mobile application program to help eye movement with mobile devices. It helps to strengthen ocular muscles and improve visual acuity. Users can easily access the program of eye movement type of app program in mobile devices. There were some papers which studied on the eye movement and showed efficient eye movement method for improvement of visual acuity. So here presents programming codes to help eye movement with some specific patterns from some papers and it was implemented by HTML, CSS and javascript. To convert web code to app code, appspresso tool was used.