• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.537-546
• /
• 2004

In order to develop an application software for context-awareness techniques, we should program both all decisions on variable con-text-awareness and appropriate process with some program languages. These cause a loss of software production and unlimited repetition of program code. In this paper, we implement a context script language and language processor which can simplify a series of involved process acquired for context-awareness and describe them clearly. In addition, it can represent a definitions of context as standard syntax as well as accomplish them automatically. The proposed context script language provides functionality which can not only define efficiently a given context but also describe a variety of context with general purpose. Aiso, for the usefulness of the language processor, we build an application system which can provide music play service based on context-awareness.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.6
• /
• pp.899-905
• /
• 2013

In this paper, we focus on how to calibrate multi-cameras easily and how to efficiently detect quad-copters with small-numbered particles. Each particle is a six dimensional vector that is composed of 3D position and 3D orientation of a quad-copter in the space. Due to curse of dimensionality, that leads to explosive computational costs with a large amount of high-dimensioned particles. To detect efficiently, we need to put more particles in very promising spaces and few particles in other spaces. Though computational cost is lowered by minimizing particles, in order to track a quad-copter with multiple cameras in real-time, multiple images from the cameras should be synchronized and analyzed. Therefore, lots of the computations still need to be done. Because of this, GPGPU(General-Purpose computing on Graphics Processing Units) is implemented for parallel computing. This method has been successfully tested and gives accurate results in practical situations.

• Journal of Internet Computing and Services
• /
• v.5 no.1
• /
• pp.99-111
• /
• 2004

Two general security measures in computing networks are secure data transmission and user authentication, These problems are still critical in the wireless LAN environments. Thus security becomes most significant issue in personal network environments and ubiquitous networks based on wireless LANs. We purpose a new authentication system for these kind of environments, and coined it UPMA(Ubiquitous Personal Mutual Authen-tication) model. UPMA supports authenticating configurations which provides personal verification for each system. It guarantees secure communications through the session key setup, and provides mutual authentication by verifying each user and his/her station. UPMA solves security problems in ubiquitous networks without accessing authentication server, Instead it performs mutual authentication between terminals or between systems. It is a global authentication system which enables global roaming service through the Internet or other public networks, It can be used to guarantee safe and convenient access to a company Intranet or to a home network.

• Journal of Korea Game Society
• /
• v.12 no.4
• /
• pp.13-22
• /
• 2012

The wide-spread use of the broadband Internet service makes the cloud computing-based gaming service possible. A game program is executed on a cloud node and its live image is fed into a remote user's display device via video streaming. The user's input is immediately transmitted and applied to the game. The minimization of the time to process remote user's input and transmit the live image back to the user and thus satisfying the requirement of instant responsiveness for gaming makes it possible. However, the cost to build its servers can be very expensive to provide high quality 3D games because a general purpose graphics system that cloud nodes are likely to have for the service supports a single 3D application at a time. Thus, the server must have a technology of 'realtime multiple rendering' to execute multiple 3D games simultaneously. This paper proposes a new architecture of 2-tier servers of clouds nodes of which one group executes multiple games and the other produces game's live images. It also performs a few experimentations to prove the feasibility of the new architecture.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.11
• /
• pp.53-62
• /
• 1994

This paper presents a new approach of analyzing errors resulting from nonideal general-purpose lighting environment when the Photometric Stereo Method (PSM) is applied to estimate the surface-orientation of a three-dimensional object. The approach introduces the explicit modeling of the lighting environment including a circular-disk type irradiance object plane and the direct simulation of the error distribution with the model. The light source is modeled as a point source that has a certain amount of beam angle, and the luminance distribution on the irradiance plane is modeled as a Gaussian function with different deviation values. A simulation algorithm is devised to estimate the light source orientation computing the average luminance intensities obtained from the irradiance object planes positioned in three different orientations. The effect of the nonideal lighting model is directly reflected in such simulation, because of the analogy between the PSM and the proposed algorithm. With an instrumental tool designed to provide arbitrary orientations of the object plane at the origin of the coordinate system, experiment can be performed in a systematic way for the error analysis and compensation. Simulations are performed to find out the error distribution by widely varying the light model and the orientation set of the object plane. The simulation results are compared with those of the experiment performed in the same way as the simulation. It is confirmed from the experiment that a fair amount of errors is due to the erroneous effect of the general-purpose lighting environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.8
• /
• pp.1111-1120
• /
• 2022

Image Capturing is a matter of viewing images and describing images in language. The problem is an important problem that can be solved by keeping, understanding, and bringing together two areas of image processing and natural language processing. In addition, by automatically recognizing and describing images in text, images can be converted into text and then into speech for visually impaired people to help them understand their surroundings, and important issues such as image search, art therapy, sports commentary, and real-time traffic information commentary. So far, the image captioning research approach focuses solely on recognizing and texturing images. However, various environments in reality must be considered for practical use, as well as being able to provide image descriptions for the intended purpose. In this work, we limit the universally available Korean and English image captioning models and text generation techniques for the purpose of image captioning.

• Journal of Korea Multimedia Society
• /
• v.19 no.2
• /
• pp.411-417
• /
• 2016

Since the development of Graphic Processing Unit (GPU) in 1999, the development speed of GPUs has become much faster than that of CPUs and currently, the computational power of GPUs exceeds CPUs dozens and hundreds times in terms of decimal calculations and costs much less. Owing to recent technological development of hardwares, general-purpose computing and utilization using GPUs are on the rise. Thus, in this paper, we have identified the elements to be considered for the Smart Grid Security. Focusing on a Performance Improvement of the Basic Algorithm for the Stateful Inspection to Detect DDoS Attacks using CUDA. In the program, we compared the search speeds of GPU against CPU while they search for the suffix trees. For the computation, the system constraints and specifications were made identical during the experiment. We were able to understand from the results of the experiment that the problem-solving capability improves when GPU is used. The other finding was that performance of the system had been enhanced when shared memory was used explicitly instead of a global memory as the volume of data became larger.

• ETRI Journal
• /
• v.42 no.4
• /
• pp.468-479
• /
• 2020

The proposed AI processor architecture has high throughput for accelerating the neural network and reduces the external memory bandwidth required for processing the neural network. For achieving high throughput, the proposed super thread core (STC) includes 128 × 128 nano cores operating at the clock frequency of 1.2 GHz. The function-safe architecture is proposed for a fault-tolerance system such as an electronics system for autonomous cars. The general-purpose processor (GPP) core is integrated with STC for controlling the STC and processing the AI algorithm. It has a self-recovering cache and dynamic lockstep function. The function-safe design has proved the fault performance has ASIL D of ISO26262 standard fault tolerance levels. Therefore, the entire AI processor is fabricated via the 28-nm CMOS process as a prototype chip. Its peak computing performance is 40 TFLOPS at 1.2 GHz with the supply voltage of 1.1 V. The measured energy efficiency is 1.3 TOPS/W. A GPP for control with a function-safe design can have ISO26262 ASIL-D with the single-point fault-tolerance rate of 99.64%.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.1141-1144
• /
• 2005

일반 컴퓨터에서 중앙처리장치와 메모리 사이의 병목 현상인 "Von Neumann Bottleneck"을 보이는데 본 논문에서는 이러한 문제점을 해소하고 검색위주의 응용분야에서 우수한 성능을 보이는 확장 가능한 범용 Associative Processor(AP) 구조를 제안하였다. 본 연구에서는 Associative computing을 효율적으로 수행할 수 있는 명령어 세트를 제안하였으며 다양하고 대용량 응용분야에도 적용할 수 있도록 구조를 확장 가능하게 설계함으로써 유연한 구조를 갖는다. 12 가지의 명령어가 정의되었으며 프로그램이 효율적으로 수행될 수 있도록 명령어 셋을 구성하고 연속된 명령어를 하나의 명령어로 구현함으로써 처리시간을 단축하였다. 제안된 프로세서는 bit-serial, word-parallel로 동작하며 대용량 병렬 SIMD 구조를 갖는 32 비트 범용 병렬 프로세서로 동작한다. 포괄적인 검증을 위하여 명령어 단위의 검증 뿐 아니라 최대/최소 검색, 이상/이하 검색, 병렬 덧셈 등의 기본적인 병렬 알고리즘을 검증하였으며 알고리즘은 처리 데이터의 개수와는 무관한 상수의 복잡도 O(k)를 갖으며 데이터의 비트 수만큼의 이터레이션을 갖는다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.5
• /
• pp.656-662
• /
• 2018

Pattern matching algorithm is widely used in many application fields such as bio-informatics, intrusion detection, etc. Among many string matching algorithms, KMP (Knuth-Morris-Pratt) algorithm is commonly used because of its fast execution time when using large texts. However, the processing speed of KMP algorithm is also limited when the text size increases significantly. In this paper, we propose a high throughput parallel KMP algorithm considering CPU-GPU memory hierarchy based on OpenCL in GPGPU (General Purpose computing on Graphic Processing Unit). We focus on the optimization for the allocation of work-times and work-groups, the local memory copy of the pattern data and the failure table, and the overlapping of the data transfer with the string matching operations. The experimental results show that the execution time of the optimized parallel KMP algorithm is about 3.6 times faster than that of the non-optimized parallel KMP algorithm.