• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.4
• /
• pp.572-578
• /
• 2008

We analyze the search space considered by the previously proposed R-CORE method for learning Bayesian network structures of large scale. Experimental analysis on the search space of the method is also shown. The R-CORE method reduces the search space considered for Bayesian network structures by recursively clustering the random variables and restricting the orders between clusters. We show the R-CORE method has a similar search space with the previous method in the worst case but has a much less search space in the average case. By considering much less search space in the average case, the R-CORE method shows less tendency of overfitting in learning Bayesian network structures compared to the previous method.

• Journal of Korea Game Society
• /
• v.22 no.1
• /
• pp.77-86
• /
• 2022

This article argues that electronic entertainment has continued to this day, contrary to the existing view that it has been absorbed by digital games since the 1990s. From a media archaeological point of view, it tracks in what cultural and technical context the electronic entertainment called "Pump It Up", which has been popular since the late 1990s, has been accepted and used by gamers. The big trend of 'Pump' took place through a "performative shift" of gamers' creative game performing, and the rise and fall of the 'Pump' took place through competitions and interactions between imaginaries and practices that each subject surrounded the game had. In conclusion, it suggests the necessity of media archaeological research on various genres of arcade games.

• Journal of the Korea Society of Computer and Information
• /
• v.29 no.2
• /
• pp.127-136
• /
• 2024

This paper presents a novel method for minting hierarchical Non-Fungible Tokens(NFTs) via a parent-child structure. In contrast to existing NFT structures, our proposed model enables an NFT to act as a parent, creating child NFTs and distributing ownership stakes among them. These child NFTs are recursively structured, allowing them to generate their own descendants. The existing structure of NFTs does not inherently allow for fractional ownership. However, our proposed hierarchical model provides a feasible solution to this restriction. By dividing an NFT into multiple child NFTs, each with its own unique identity, we facilitate the detailed division of an asset, thereby making fractional ownership possible. In conclusion, the hierarchical NFT model proposed in this paper offers a promising solution to the challenges of fractional ownership in the digital asset arena. By enabling the detailed division of NFTs through a parent-child structure, we anticipate a future where digital assets can be owned and traded more flexibly and transparently.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.04a
• /
• pp.111-116
• /
• 2000

컴퓨터네트워크를 통한 정보의 이동이 빈번한 오늘날, 중요 정보를 지키는 정보 보호 기술의 요구는 점차 늘어나고 있다. 이에 따라, 통신망 상의 프라이버시 보호, 기밀성, 무결성 같은 개인정보보호를 위해서 필수적인 암호학적 도구로 디지털 서명이 이용되고 있다. 본 논문에서는 이산대수 문제의 어려움에 기반하여, 디지털 서명대상을 2명에서 n명으로 확대한 다중서명 기법에 서명자 전원의 동의 없이는 서명을 검증할 수 없는 부정할 수 없는 서명의 기능을 부여한다. 이는 전자, 선거, 전자 현금 등 보다 복잡하고 민감한 사회적 영역에 적용될 수 있을 것이다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.945-948
• /
• 2002

모발 에이전트는 고객을 대신하여 호스트에서 고객의 서명을 대리 수행하도록 하는 기능을 가지고 있다. 이러한 모발 에이전트를 이용한 진자상거래 환경에서 안전성을 강화하기 위한 1회용 대리서명 기법이 제안되어 있다[4]. 그러나, 진자상거래와 같은 환경에서 대부분의 사용자가 신분노출을 꺼려하는 익명성이 제공되지 않는 문제점이 있다. 따라서 본 논문에서는 무선 환경에서의 계산량과 통신량을 줄이면서 익명성을 제공할 수 있는 안전하고 효율적인 1회용 대리서명 기법을 제안한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1110-1115
• /
• 2014

The matrix-star and the transposition graphs are considered as star graph variants that have various merits in graph theory such as node symmetry, fault tolerance, recursive scalability, etc. This paper describes an one-to-one mapping algorithm from a matrix-star graph to a transposition graph using adjacent properties in graph theory. The result show that a matrix-star graph $MS_{2,n}$ can be embedded in a transposition graph $T_{2n}$ with dilation n or less and average dilation 2 or less.

• Journal of Korea Multimedia Society
• /
• v.7 no.4
• /
• pp.579-591
• /
• 2004

This paper presents a new arc segmentation method which extracts curves from simple drawing consisted of straight lines and curves and segments them into circular arcs. First, it finds center points and finds line segments and curve segments by tracing connected center points. Next, it expands the segment by searching neighbor segment at the two endpoints. Next, it removes straight lines and segments the extracted curves into circular arcs by using the recursive subdivision method. The proposed method has been compared with previous vectorization software and vector based arc segmentation method. Experimental results show that the proposed method produces more correct results for the curves which contain intersection with other lines or curves.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.2
• /
• pp.204-210
• /
• 2005

This paper presents online identification algorithm for TSK fuzzy model. The proposed algorithm identify structure of premise part by using distance, and obtain the parameters of the piecewise linear function consisting consequent part by using recursive least square. Only input space was considered in Most researches on structure identification, but input and output space is considered in the proposed algorithm. By doing so, outliers are excluded in clustering effectively. The existing other algorithm has disadvantage that it is sensitive to noise by using data itself as cluster centers. The proposed algorithm is non-sensitive to noise not by using data itself as cluster centers. Model can be obtained through one pass and it is not needed to memorize many data in the proposed algorithm.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.10
• /
• pp.1193-1201
• /
• 1988

In this paper, we describe the syntactic and semantic parsing methods which use the case frames. The case structures based on obligatory cases of verbs. And, we use a small set of partial-garammar rules based on simple sentence to represent such case structures. Also, we enhance the efficiency by constructing independent procedure for particle classification and ambiguity resolution of major particle considering the importance of Japanese particle process in the generation. And we construct the generation table considering the combination possibility between the verbs and auxiliary verbs for processing the termination phrase. Therefore we can generate more natural translated sentence according to unique decision with information of syntactic analysis and simplify the generating process.

• Journal of Korea Multimedia Society
• /
• v.11 no.9
• /
• pp.1227-1237
• /
• 2008

In this paper, we analyze topological properties and embedding of Folded Hyper-Star network to further improve the network cost of Hypercube, a major interconnection network. Folded Hyper-Star network has a recursive expansion and maximal fault tolerance. The result of embedding is that Folded Hypercube $FQ_n$ and $n{\times}n$ Torus can be embedded into Folded Hyper-Star FHS(2n,n) with dilation 2. Also, we show Folded Hyper-Star FHS(2n,n) can be embedded into Folded Hypercube $FQ_{2n-1}$ with dilation 1.