• Convergence Security Journal
• /
• v.23 no.4
• /
• pp.3-15
• /
• 2023

As remote services and remote work become commonplace, the use of the Metaverse has grown. This allows transactions like real estate and finance in virtual Second Life. However, conducting economic activities in the Metaverse presents unique security challenges compared to the physical world and conventional cyberspace. To address these, the paper proposes solutions centered on authentication and privacy. It suggests improving data preprocessing based on Metaverse data's uniqueness and introduces a new authentication service using NFTs while adhering to W3C's DID framework. The system is implemented using Hyperledger Indy blockchain, and its success is confirmed through implementation analysis.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2470-2476
• /
• 1997

We propose a new real-time search algorithm and provide experimental evaluation and comparison of the new algorithm with mini-min lookahead algorithm. Many other real-time heuristic-search approached often divide the problem space to several sub-problems. In this paper, the proposed algorithm guarantees not only the sub-problem deadline but also total deadline. Several heuristic real-time search algorithms such as $RTA^{\ast}$, SARTS and DYNORA have been proposed. The performance of such algorithms depend on the quality of their heuristic functions, because such algorithms estimate the search time based on the heuristic function. In real-world problem, however, we often fail to get an effective heuristic function beforehand. Therefore, we propose a new real-time algorithm that determines the sub-problem deadline based on the status of search space during sub-problem search process. That uses the cut-off method that is a dynamic stopping-criterion-strategy to search the sub-problem.

• The KIPS Transactions:PartB
• /
• v.10B no.6
• /
• pp.587-592
• /
• 2003

Many real world control problems have continuous states and actions. When the state space is continuous, the reinforcement learning problems involve very large state space and suffer from memory and time for learning all individual state-action values. These problems need function approximators that reason action about new state from previously experienced states. We introduce Fuzzy Q-Map that is a function approximators for 1 - step Q-learning and is based on fuzzy clustering. Fuzzy Q-Map groups similar states and chooses an action and refers Q value according to membership degree. The centroid and Q value of winner cluster is updated using membership degree and TD(Temporal Difference) error. We applied Fuzzy Q-Map to the mountain car problem and acquired accelerated learning speed.

• Journal of KIISE:Software and Applications
• /
• v.32 no.9
• /
• pp.901-911
• /
• 2005

With the development of e-commerce and the proliferation of easily accessible information, information filtering has become a popular technique to prune large information spaces so that users are directed toward those items that best meet their needs and preferences. While many collaborative filtering systems have succeeded in capturing the similarities among users or items based on ratings to provide good recommendations, there are still some challenges for them to be more efficient, especially the user bias problem, non-transitive association problem and cold start problem. Those three problems impede us to capture more accurate similarities among users or items. In this paper, we provide probabilistic model approaches for UCHM and ICHM which are suggested to solve the addressed problems in hopes of achieving better performance. In this probabilistic model, objects (users or items) are classified into groups and predictions are made for users considering the Gaussian distribution of user ratings. Experiments on a real-word data set illustrate that our proposed approach is comparable with others.

• Communications of Mathematical Education
• /
• v.36 no.3
• /
• pp.439-467
• /
• 2022

The future society requires not only knowledge but also various competencies, including creativity, cooperative spirit and integrated thinking. This research develops a program for integrating mathematics and information science to enhance important mathematical competencies such as problem-solving and communication. This program does not require much prior knowledge, can be motivated using everyday language and easy-to-access tools, and is based on creative problem-solving activities with multilateral cooperation. The usefulness and rigor of mathematics are emphasized as the number of participants increases in the activities, and theoretical principles stem from the matrix theory over finite fields. Moreover, the activity highlights a connection with error-correcting codes, an important topic in information science. We expect that the real-world contexts of this program contribute to enhancing mathematical communication competence and providing an opportunity to experience the values of mathematics and that this program to be accessible to teachers since coding is not included.

• Journal of Digital Convergence
• /
• v.10 no.10
• /
• pp.301-306
• /
• 2012

We propose a method for accurate image acquisition in a machine vision system in the present study. The most important feature is required by the various lenses to implement real and of the same high quality image-forming optical role. The input of the machine vision system, however, is generated due to the aberration of the lens distortion. Transformation defines the relationship between the real-world coordinate system and the image coordinate system to solve these problems, a mapping function that matrix operations by calculating the distance between two coordinates to specify the exact location. Tolerance Focus Lens caused by the lens aberration correction processing to Galvanometer laser precision machining operations can be improved. Aberration of the aspheric lens has a two-dimensional shape of the curve, but the existing lens correction to linear time-consuming calibration methods by examining a large number of points the problem. How to apply the Bilinear interpolation is proposed in order to reduce the machining error that occurs due to the aberration of the lens processing equipment.

• 한국ITS학회:학술대회논문집
• /
• 2008.11a
• /
• pp.581-584
• /
• 2008

무선 센서 네트워크는 최근 대두되고 있는 유비쿼터스 컴퓨팅의 연구에 힘입어, 광범위하게 설치되어 있는 유무선 네트워크 인프라에 상황인지를 위한 다양한 센서 디바이스를 결합하여 감지된 환경 데이터를 응용서비스와 연동하는 기술이다. 기본적으로 홈/빌딩 시큐리티, 사회기반 안전시설, 기계의 고장 진단, 의료 분야 등의 실세계의 다양한 분야에 응용될 수 있다. 본 논문에서 다루고자하는 실종 아동에 대한 문제는 어제 오늘의 이야기가 아니다. 미아 발생률은 꾸준히 증가하고 있으며 장기 미아의 발생 역시 증가하고 있다. 따라서 미아 방지를 위해 새로운 서비스들이 소개되었으나 이용자의 경제적 비용 부담 증가와 같은 문제점을 안고 있다. 본 논문에서 제안하는 미아 찾기 시스템은 무선 센서 네트워크 기술 응용 중의 하나로서 미아가 발생 시에 아동이 장기 미아가 되지 않도록 효율적이면서도 빠르게 미아를 찾을 수 있도록 하기 위해서 개발되었다. RFID 리더기가 장착된 고정형 센서 노드와 이동형 센서노드가 RFID 태그를 지닌 아동의 정보를 얻어서 중앙 제어 서버로 데이터를 넘기면 태그 정보와 전송한 센서 노드의 위치, 전송 시간을 바탕으로 아동의 위치를 파악할 수가 있다. 미아 찾기 시스템은 이용자가 태그만을 지니면 되기 때문에 경제적 부담은 줄어 들 수 있다. 또한 상기 시스템으로 미아 찾기만이 아니라 주변 환경 감시등의 여러 응용에도 적용 시킬 수가 있다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.4
• /
• pp.19-24
• /
• 2015

Security has been a major concern in software development. Security tactics are reusable building blocks providing a general solution for recurring security concerns at the architectural level. They are often used together with architectural patterns which provide a general solution for architecting software systems. However, use of security tactics in architectural patterns has been understood only conceptually without concrete understanding of how their involved elements should be structurally and behaviorally co-designed. In this paper, we present model-driven analyses of security tactics in the context of Broker architectural patterns and provide evidences of the analyses in real world case studies.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.2
• /
• pp.68-72
• /
• 2009

The suffix array is a data structure storing all suffixes of a string in lexicographical order. It is widely used in string problems instead of the suffix tree, which uses a large amount of memory space. Many researches have shown that not only the suffix array can be built in O(n), but also it can be constructed with a small time and space usage for real-world inputs. In this paper, we analyze a practical suffix sorting algorithm due to Maniscalco and Puglisi [1], and we propose an efficient algorithm which improves Maniscalco-Puglisi's running time.

• Journal of Korea Game Society
• /
• v.2 no.2
• /
• pp.37-45
• /
• 2002

Computer games could be regarded as simulation of the real world. Control problems of software agents have long been studied in the field of Artificial Intelligence (AI), resulting in giving a birth to the behavior-based approach. three main approaches might be categorized out of the history of AI study. First, Cognitivists propose that intelligence could be represented and manipulated in terms of symbols. Second, Connectionists claim that symbols could not be isolated but they are embedded in the body structure. Third, the behavior-based approach is an approach to AI which suggests that intelligence is dynamic property that exists nowhere but emerges in the relationship of an agent and the world including observers while the agent performs behavior. This paper explains and compares the three approaches to AI, then discusses the plausibility of the behavior-based approach and problems. Finally, this paper proposes application of behavior-based approach to computer games in terms of agent control.