• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.2
• /
• pp.57-72
• /
• 2010

Hash based RFID protocols proposed by Ha and M.Burmester is a scheme that tag's ID is updated using hash function to provide forward secrecy after session end. But this protocols have a problem both privacy and efficiency. This paper analyze a problem for privacy to apply a privacy game model proposed by Vaudenay. we analyze the cause that these scheme is difficult with tag's cheap implementation and efficient resynchronization. To solve these problems, we proposed a new hash based mutual authentication protocol which apply only two protocol's advantages. this protocols is based of resynchronization algorithm for Ha et al.'s protocol and added a new simple counter to record the numner of continuous desynchronization between tag and reader secret informations. this counter is more simple than cyclic counter proposed by M. Burmester's protocol. Also, we prove that proposal protocol improve a privacy against a privacy attack which is executed for Ha and M. Burmester's protocols.

• Journal of Broadcast Engineering
• /
• v.27 no.2
• /
• pp.207-215
• /
• 2022

The latest volumetric technology's high geometrical accuracy and realism ensure a high degree of correspondence between the real object and the captured 3D model. Nevertheless, since the 3D model obtained in this way constitutes a sequence as a completely independent 3D model between frames, the consistency of the model surface structure (geometry) is not guaranteed for every frame, and the density of vertices is very high. It can be seen that the interconnection node (Edge) becomes very complicated. 3D models created using this technology are inherently different from models created in movie or video game production pipelines and are not suitable for direct use in applications such as real-time rendering, animation and simulation, and compression. In contrast, our method achieves consistency in the quality of the volumetric 3D model sequence by linking re-meshing, which ensures high consistency of the 3D model surface structure between frames and the gradual deformation and texture transfer through correspondence and matching of non-rigid surfaces. And It maintains the consistency of volumetric 3D model sequence quality and provides post-processing automation.

• Smart Structures and Systems
• /
• v.29 no.1
• /
• pp.251-266
• /
• 2022

Structural Health Monitoring (SHM) of critical infrastructure comprises a major pillar of maintenance management, shielding public safety and economic sustainability. Although SHM is usually associated with data-driven metrics and thresholds, expert judgement is essential, especially in cases where erroneous predictions can bear casualties or substantial economic loss. Considering that visual inspections are time consuming and potentially subjective, artificial-intelligence tools may be leveraged in order to minimize the inspection effort and provide objective outcomes. In this context, timely detection of sensor malfunctioning is crucial in preventing inaccurate assessment and false alarms. The present work introduces a sensor-fault detection and interpretation framework, based on the well-established support-vector machine scheme for anomaly detection, combined with a coalitional game-theory approach. The proposed framework is implemented in two datasets, provided along the 1st International Project Competition for Structural Health Monitoring (IPC-SHM 2020), comprising acceleration and cable-load measurements from two real cable-stayed bridges. The results demonstrate good predictive performance and highlight the potential for seamless adaption of the algorithm to intrinsically different data domains. For the first time, the term "decision trajectories", originating from the field of cognitive sciences, is introduced and applied in the context of SHM. This provides an intuitive and comprehensive illustration of the impact of individual features, along with an elaboration on feature dependencies that drive individual model predictions. Overall, the proposed framework provides an easy-to-train, application-agnostic and interpretable anomaly detector, which can be integrated into the preprocessing part of various SHM and condition-monitoring applications, offering a first screening of the sensor health prior to further analysis.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.8
• /
• pp.119-126
• /
• 2023

In this paper, a new model was presented to objectively evaluate the defense ability of defenders in Korean professional baseball. In the proposed model, using Korean professional baseball game data from 2016 to 2019, a representative defender was selected for each team and defensive position to evaluate defensive ability. In order to evaluate the defense ability, a method of calculating the defense range for each position and dividing the calculated defense area was proposed. The defensive range for each position was calculated using the Convex Hull algorithm based on the point at which the defenders in the same position threw out the ball. The out conversion score and victory contribution score for both infielders and outfielders were calculated as basic scores using the defensive range for each position. In addition, double kill points for infielders and extra base points for outfielders were calculated separately and added together.

• Therapeutic Science for Rehabilitation
• /
• v.7 no.1
• /
• pp.79-88
• /
• 2018

Objective : Conventional therapy approaches for stroke survivors have required considerable demands on therapist's effort and patient's expense. Thus, new robotics rehabilitation therapy technologies have been proposed but they have suffered from less than optimal control algorithms. This article presents a novel technical healthcare solution for the real-time, simultaneous and propositional myoelectric control for stroke survivors' upper limb robotic rehabilitation therapy. Methods : To implement an appropriate computational algorithm for controlling a portable rehabilitative robot, a linear regression model was employed, and a simple game experiment was conducted to identify its potential of clinical utilization. Results : The results suggest that the proposed device and computational algorithm can be used for stroke robot rehabilitation. Conclusion : Moreover, we believe that these techniques will be used as a prominent tool in making a device or finding new therapy approaches in robot-assisted rehabilitation for stroke survivors.

• Archives of design research
• /
• v.18 no.1 s.59
• /
• pp.17-26
• /
• 2005

Nowadays, display-contents are developing to an informative environment. that is under the logic of the media operating system. To perceive the media-environments and produce the cultural contents, the cultural designers seek to understand a skin structure from making up for shape. To appreciate operating system in data and database is not only systematization of form and contents of visual contents but also variety contents into multiple-platform and integrative environments. These days, the spectacle exhibition try to express for their surface design between algorithm of data and database. the information is expressing aesthetic which means presents the integrated contents through the play instinct environment to end-user. That was given web or game to participation is developing with the cellular device and ubiquitous computing system. in the linear perspective, the end-user should be immerse more and more hyper-simulation system because of the operating algorithm of database. To do this, human have need to get the information-ability from multi-platform society. In the virtual environment, database offer the experience of an unheard-of event to end-user that prepare the participants the circumstances priority of signifiers. To do that already based on a fixed sensibility endow with narrative of the freshness- experience.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.383-389
• /
• 2004

This paper proposes a method to provide intelligence for characters in fighting action games by using a neural network. Each action takes several time units in general fighting action games. Thus the results of a character's action are not exposed immediately but some time units later. To design a suitable neural network for such characters, it is very important to decide when the neural network is taught and which values are used to teach the neural network. The fitness of a character's action is determined according to the scores. For learning, the decision causing the score is identified, and then the neural network is taught by using the score change, the previous input and output values which were applied when the decision was fixed. To evaluate the performance of the proposed algorithm, many experiments are executed on a simple action game (but very similar to the actual fighting action games) environment. The results show that the intelligent character trained by the proposed algorithm outperforms random characters by 3.6 times at most. Thus we can conclude that the intelligent character properly reacts against the action of the opponent. The proposed method can be applied to various games in which characters confront each other, e.g. massively multiple online games.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.42 no.3
• /
• pp.31-38
• /
• 2005

This paper proposes an implementation method of intelligent characters that can properly adapt to action patterns of opponent characters in fighting games by using genetic algorithm. For this intelligent characters, past actions patterns of opponent characters should be included in the learning process. To verify the effectiveness of the proposed method, two types of experiments are performed and their results are compared. In first experiment(exp-1), intelligent characters consider current action and its step of an opponent character. In second experiment (exp-2), on the other hands, they take past actions of an opponent characters into account additionally. As a performance index, the ratio of score obtained by an intelligent character to that of an opponent character is adopted. Experimental results shows that even if the performance index of exp-1 is better than that of exp-2 at the beginning of stages, but the performance index of exp-2 outperforms that of exp-1 as stages go on. Moreover, optimum solutions are always found in all experimental cases in exp-2. Futhermore, intelligent characters in exp-2 could learn moving actions (forward and backward) and waiting actions for getting more scores through self evolution.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2002.11a
• /
• pp.379-384
• /
• 2002

개발적인 측면에서 온라인 게임 환경에서의 NPC(Non Playable Character)들은 환경인식능력, 이동능력, 특수 능력 및 아이템의 소유 배분 등을 원활히 하기 위한 능력들을 소유해야 하며, 게임 환경을 인식, 저장하기 위한 데이터구조와 자신만의 독특한 임무(mission)를 달성하기 위한 계획을 갖고 행위를 해야 한다. 이런 의미에서 NPC는 자신만의 고유한 규칙과 행동 패턴, 그리고 목표(Goal)와 이를 실행하기 위한 계획(plan)을 소유하는 에이전트로 인식되어야 할 것이다. 그러나, 기존 게임의 NPC 제어 구조나 구현 방법은 이러한 요구조건에 부합되지 못한 부분이 많았다. C/C++ 같은 컴퓨터 언어들을 이용한 구현은 NPC의 유연성이나, 행위에 많은 문제점이 있었다. 이들 언어의 switch 문법은 NPC의 몇몇 특정 상태를 묘사하고, 그에 대한 행위를 지정하는 방법으로 사용되었으나, 게임 환경이 복잡해지면서, 더욱더 방대한 코드를 만들어야 했고, 해석하는데 많은 어려움을 주었으며, 동일한 NPC에 다른 행동패턴을 적용시키기도 어려웠다. 또한, 대부분의 제어권을 게임 서버 폭에서 도맡아 함으로써, 서버측에 많은 과부하 요인이 되기도 하였다. 이러한 어려움을 제거하기 위해서 게임 스크립트를 사용하기도 하였지만, 그 또한 단순 반복적인 패턴에 사용되거나, 캐릭터의 속성적인 측면만을 기술 할 수 있을 뿐이었다 이러한 어려움을 해소하기 위해서는 NPC들의 작업에 필요한 지식의 계층적 분화를 해야 하고, 현재 상황과 목표 변화에 적합한 반응을 표현할 수 있는 스크립트의 개발이 필수 적이라 할 수 있다 또한 스크립트의 실행도 게임 서버 측이 아닌 클라이언트 측에서 수행됨으로써, 서버에 걸리는 많은 부하를 줄일 수 있어야 할 것이다. 본 논문에서는, 대표적인 반응형 에이전트 시스템인 UMPRS/JAM을 이용하여, 에이전트 기반의 게임 캐릭터 구현 방법론에 대해 알아본다.퓨터 부품조립을 사용해서 Template-based reasoning 예를 보인다 본 방법론은 검색노력을 줄이고, 검색에 있어 Feasibility와 Admissibility를 보장한다.매김할 수 있는 중요한 계기가 될 것이다.재무/비재무적 지표를 고려한 인공신경망기법의 예측적중률이 높은 것으로 나타났다. 즉, 로지스틱회귀 분석의 재무적 지표모형은 훈련, 시험용이 84.45%, 85.10%인 반면, 재무/비재무적 지표모형은 84.45%, 85.08%로서 거의 동일한 예측적중률을 가졌으나 인공신경망기법 분석에서는 재무적 지표모형이 92.23%, 85.10%인 반면, 재무/비재무적 지표모형에서는 91.12%, 88.06%로서 향상된 예측적중률을 나타내었다.ting LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity of computation. Adaptive transversal filter with proposed data recycling buffer algorithm could efficiently reject ISI of channel and increase speed of convergence in avoidance burden of computational complexity in reality when it was experimented having

• Journal of the Korea Computer Graphics Society
• /
• v.26 no.3
• /
• pp.123-131
• /
• 2020

This study proposes a real-time rendering algorithm for lighting when each of more than 100,000 moving particles exists as a light source. Two 3D textures are used to dynamically determine the range of influence of each light, and the first 3D texture has light color and the second 3D texture has light direction information. Each frame goes through two steps. The first step is to update the particle information required for 3D texture initialization and rendering based on the Compute shader. Convert the particle position to the sampling coordinates of the 3D texture, and based on this coordinate, update the colour sum of the particle lights affecting the corresponding voxels for the first 3D texture and the sum of the directional vectors from the corresponding voxels to the particle lights for the second 3D texture. The second stage operates on a general rendering pipeline. Based on the polygon world position to be rendered first, the exact sampling coordinates of the 3D texture updated in the first step are calculated. Since the sample coordinates correspond 1:1 to the size of the 3D texture and the size of the game world, use the world coordinates of the pixel as the sampling coordinates. Lighting process is carried out based on the color of the sampled pixel and the direction vector of the light. The 3D texture corresponds 1:1 to the actual game world and assumes a minimum unit of 1m, but in areas smaller than 1m, problems such as stairs caused by resolution restrictions occur. Interpolation and super sampling are performed during texture sampling to improve these problems. Measurements of the time taken to render a frame showed that 146 ms was spent on the forward lighting pipeline, 46 ms on the defered lighting pipeline when the number of particles was 262144, and 214 ms on the forward lighting pipeline and 104 ms on the deferred lighting pipeline when the number of particle lights was 1,024766.