• Journal of Korea Multimedia Society
• /
• v.16 no.7
• /
• pp.802-809
• /
• 2013

In this paper, we propose the similarity measurement method between two program codes by counting the frequency and length of continuous patterns of specifiers and keywords, which exist in two program codes. In addition, we propose the visualization method of this analysis result by formal concept analysis. Proposed method considers adjacencies of specifiers or keywords, which have not been considered in the previous similarity measurements. Proposed method can detect the plagiarism by analyzing the pattern in each function regardless of the order of function call and execution. In addition, the result of the similarity measurement is visualized by the lattice of formal concept analysis to increase the user understanding about the relations between program codes. Experimental results showed that proposed method succeeded in 96% plagiarism detections. Our method could be applied into the analysis of general documents.

• Journal of KSNVE
• /
• v.8 no.5
• /
• pp.949-956
• /
• 1998

Complex and large lattice type structures are frequently used in design of bridge, tower, crane and aerospace structures. In general, in order to analyze these structures we have used the finite element method(FEM). This method is the most widely used and powerful method for structural analysis lately. However, it is necessary to use a large amount of computer memory and computational time because the FEM requires many degrees of freedom for solving dynamic problems exactly for these complex and large structures. For analyzing these structures on a personal computer, the authors developed the transfer stiffness coefficient method(TSCM). This method is based on the concept of the transfer of the nodal dynamic stiffness coefficient matrix which is related to force and displacement vector at each node. And we suggested TSCM for free vibration analysis of complex and large lattice type structures in the previous report. In this paper, we formulate forced vibration analysis algorithm for complex and large lattice type structures using extened TSCM. And we confirmed the validity of TSCM through computational results by the FEM and TSCM, and experimental results for lattice type structures with harmonic excitation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.2
• /
• pp.201-208
• /
• 2014

Park et al. introduced the concept of generalized intuitionistic fuzzy soft sets, which can be seen as an effective mathematical tool to deal with uncertainties. In this paper, we introduce new operations such as restricted union and restricted intersection and study their basic properties, and deal with the algebraic structure of generalized intuitionistic fuzzy soft sets. The lattice structures of generalized intuitionistic fuzzy soft sets are constructed.

• Korean Journal of Mathematics
• /
• v.27 no.3
• /
• pp.595-612
• /
• 2019

In this paper, we introduce the concept of ${\beta}$-fuzzy filters in MS-algebras and ${\beta}$-fuzzy filters are characterized in terms of boosters. It is proved that the lattice of ${\beta}$-fuzzy filters is isomorphic to the fuzzy ideal lattice of boosters.

• Korean Journal of Mathematics
• /
• v.28 no.4
• /
• pp.775-789
• /
• 2020

In this paper the concept of e-fuzzy filters is introduced in a Stone Almost Distributive Lattice. Several properties are derived on e-fuzzy filters with the help of maximal fuzzy filters. It is proved that the set of all e-fuzzy filters forms a complete distributive lattice.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.100-102
• /
• 2002

데이터 마이닝의 대표적인 기법인 연관규칙 마이닝을 위한 다양만 알고리즘들이 제안되었고, 각 알고리즘에 따른 대용량 데이터에 대한 신속한 탐색을 위한 독특한 자료구조가 제안되었다 각 자료구조의 특성에 따른 알고리즘 성능은 데이터의 패턴에 크게 의존한다. 본 논문에서는 Concept을 형성하는 세가지 대표적인 자료구조인 Hash Tree, Lattice. FP-Tree에 대해 비교 분석해보고, 데이터 패턴에 적합한 효율적인 알고리즘의 설계 위한 framework을 제안한다.

• Proceedings of the Korea Contents Association Conference
• /
• 2019.05a
• /
• pp.387-388
• /
• 2019

형식개념(Formal Concept)은 외연(extent)과 내포(intent)를 이용하여 어떤 대상에 대한 정의를 내리거나, 그 대상들을 분류하여 군집화하기 위한 논리적 도구로 사용되어왔다. 여기에서 외연이란 객체(Object)들의 집합이고, 내포는 그 객체들이 지니고 있는 속성(Attribute)들의 집합이다. 이러한 형식개념은 어떤 문제에 나타나는 다양한 데이터로부터 객체와 속성들을 추출하고 이로부터 개념(Concept)들의 계층구조(hierarchy)를 형성하여 데이터를 분석하는데 적용될 수 있다. 본 논문에서는 형식개념의 정의와 성질을 소개하고, 이를 일반화한 완비격자에서의 형식개념을 정의한다. 또한 이 형식개념에서의 외연과 내포격자에 대한 성질을 알아본다.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.2
• /
• pp.126-134
• /
• 2003

Among a variety of models proposed by so far to calculate the real options value when the investment decision about the underlying project may be delayed, the Black-Scholes and the binomial lattice models have been widely used and discussed by academics and practitioners. However these two models do not provide us with intuition into how it is constructed and what it does really mean. In this paper, we will therefore explore its components and practically more intuitive meaning. With the components explored, we developed the mathematical model to calculate the real options value and thus strategic net present value, based on the opportunity cost concept, for which the investment decision about the underlying project is postponed by one year. We will finally present a short illustrative example for readers better understanding on the model proposed in the paper.

• Journal of applied mathematics & informatics
• /
• v.38 no.1_2
• /
• pp.65-77
• /
• 2020

In this paper, for any non-empty subsets A, I of a pseudo BCI-algebra X, we introduce the concept of pseudo p-closure of A with respect to I, denoted by A^pc_I, and investigate some related properties. Applying this concept, we state a necessary and sufficient condition for a pseudo BCI-algebra 1) to be a p-semisimple pseudo BCI-algebra; 2) to be a pseudo BCK-algebra. Moreover, we show that A^pc_{0} is the least positive pseudo ideal of X containing A, and characterize it by the union of some branches. We also show that the set of all pseudo ideals of X which A^pc_I = A, is a complete lattice. Finally, we prove that this notion can be used to define a closure operation.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.24 no.7
• /
• pp.599-604
• /
• 2011

A highly strained nanostructure comprising crystallographically aligned HgTe nanoinclusions and a surrounding PbTe matrix has been synthesized using a precipitation process of supersaturated HgTe-PbTe alloys. From the early precipitation stage, HgTe nanoinclusions take disk shape, which is transformed from initial HgTe nuclei, although there is no lattice constant difference of the two end components at standard state. As a primary reason for the morphological transformation of the initial spherical HgTe nuclei to HgTe nanodisks, the induced lattice mismatch is suggested. On the condition that the HgTe nanodisks maintain perfect coherent nature with PbTe matrix, the stress-free lattice constant of constrained HgTe nanodisks has been calculated based on the defined concept of the strain-induced tetragonality, the linear elasticity and the actual measurement in HRTEM images.