• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.6
• /
• pp.568-572
• /
• 2006

This paper presents the device of recognizing image of the studded paving blocks, transmitting, the information by vibration to a visually handicapped person. Usually the blind uses the walking stick to recognize the studded paving block. This research uses a PCA (Principal Component Analysis) based image processing approach for recognizing the paving blocks. We classify the studded paving blocks into 5 classes, that is, vertical line block, right-declined line block, left-declined line block, dotted block and flat block. The 8 images for each of 5 classes are captured for each block by 112*120 pixels, then the eigenvectors are obtained in magnitude order of eigenvectors by using principal component analysis. The principal components for images can be calculated using projection of transformation matrix composed of eigenvectors. The classification has been executed using Euclidean's distance, so the block having minimum distance with a image is chosen as matched one. The result of classification is transmitted to the blind by electric vibration signals with different magnitudes and frequencies.

• The KSFM Journal of Fluid Machinery
• /
• v.1 no.1 s.1
• /
• pp.72-80
• /
• 1998

Computational analysis of incompressible flows by numerically solving Navier-Stokes equations using multi-block finite volume method is conducted on a parallel computing system. Numerical algorithms adopted in this study $include^{(1)}$ QUICK upwinding scheme for convective $terms,^{(2)}$ central differencing for other terms $and^{(3)}$ the second-order Euler differencing for time-marching procedure. Structured grids are used on the body-fitted coordinate with multi-block concept which uses overlaid grids on the block-interfacing boundaries. Computational code is parallelized on the MPI environment. Numerical accuracy of the computational method is verified by solving a benchmark test case of the flow inside two-dimensional rectangular cavity. Computation in the axial compressor cascade is conducted by using 4 PE's md, as results, no numerical instabilities are observed and it is expected that the present computational method can be applied to the turbomachinery flow problems without major difficulties.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1435-1438
• /
• 2005

In hands-free telephone systems, the received speech signal is fed back to the microphone and constitutes the so-called echo. To cancel the effect of this time-varying echo path, it is necessary to device an adaptive filter between the receiving and the transmitting ends. For a typical FIR realization, the length of the fullband adaptive filter results in high computational complexity and low convergence rate. Consequently, subband adaptive filtering schemes have been proposed to improve the performance. In this work, we use deterministic approach to analyze the relationship between fullband and subband adaptive filtering structures. With block adaptive filtering structure as an intermediate stage, the analysis is divided into two parts. First, to avoid aliasing, it is found that the matrix of block adaptive filters is in the form of pseudocirculant, and the elements of this matrix are the polyphase components of the fullband adaptive filter. Second, to transmit the near-end voice signal faithfully, the analysis and the synthesis filter banks in the subband adaptive filtering structure must form a perfect reconstruction pair. Using polyphase representation, the relationship between the block and the subband adaptive filters is derived.

• Journal of Industrial Technology
• /
• v.28 no.B
• /
• pp.209-214
• /
• 2008

Set-valued attributes appear in many applications to model complex objects occurring in the real world. One of the most important operations on set-valued attributes is the set join, because it provides a various method to express complex queries. Currently proposed set join algorithms are based on block nested loop join in which inverted files are partitioned horizontally into blocks. Evaluating these joins are expensive because they generate intermediate partial results severely and finally obtain the final results after merging partial results. In this paper, we present an efficient processing of set join algorithm. We propose a new set join algorithm that vertically partitions inverted files into blocks, where each block fits in memory, and performs block nested loop join without producing intermediate results. Our experiments show that the vertical bitmap nested set join algorithm outperforms previously proposed set join algorithms.

• Journal of the Korean Society for Railway
• /
• v.9 no.5 s.36
• /
• pp.612-617
• /
• 2006

As the on-board electric devices determine the performances of vehicles, production of reliable devices is important. To keep the reliability of devices constant, management of performance evaluation of the on-board devices is crucial. Because temperature has a serious effect on failures of the components of the devices, its measurement is the first step for good management. In this study, we described performance characteristics of domestic auxiliary block developed through G7 project. We measured the performances of auxiliary block during test running by the developed on-line measurement system. After we save the input real-time data from each signal of Korean High Speed Train through the network line, we can acquire necessary information through post-processing program. We verify the motor block characteristics of Korean High Speed Train by this system.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.6
• /
• pp.388-392
• /
• 2014

This paper proposes an early termination method of a block vector search for fast encoding of high efficiency video coding (HEVC) screen content coding (SCC). In the proposed algorithm, two blocks indicated by two block vector predictors (BVPs) were first employed as an intra block copy (IBC) search. If the sum of absolute difference (SAD) value of the block is less than a threshold defined empirically, an IBC BV search is terminated early. The initial threshold for early termination is derived by statistical analysis and it can be modified adaptively based on a quantization parameter (QP). The proposed algorithm is evaluated on SCM-2.0 under all intra (AI) coding configurations. Experimental results show that the proposed algorithm reduces IBC BV search time by 29.23% on average while the average BD-rate loss is 0.41% under the HEVC SCC common test conditions (CTC).

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.7
• /
• pp.311-316
• /
• 2013

256-bit block cipher XSB(eXtended Spn Block cipher) was proposed in 2012 and has a symmetric strucrure in encryption and decryption process. In this paper, we propose a differential fault analysis on XSB. Based on a random byte fault model, our attack can recover the secret key of XSB by using only two random byte fault injection. This result is the first known cryptanalytic result on the target algorithm.

• The KIPS Transactions:PartC
• /
• v.8C no.3
• /
• pp.271-276
• /
• 2001

회의용 키분배 시스템은 회의용 키를 생성하여 키를 회의에 참석하고 있는 사람에게만 전달하여 서로간에 안전하게 통신하도록 한다. 본 논문에서는 Block Design의 한 분류인 symmetric balanced incomplete block design(SBIBD)를 적용한 효율적인 회의용 키분배시스템을 제안한다. 회의용 키를 생성하고 개인식별 정보를 근거로 하여 인증을 수행하는 통신 프로토콜이 설계된다. 제안된 프로토콜은 회의용 키를 생성하는 메시지의 복잡도를 최소화시키는데, SBIBD의 특별한 분류에서는 참석자의 수 v에 따라 메시지 복잡도는 O(v√v)가 된다. 보안시스템의 구현에서 중요한 요소인 프로토콜의 안전성은 factoring과 discrete logarithm을 계산할 정도로 난해하여 충분히 보장됨을 증명할 수 있다.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.14 no.4
• /
• pp.47-56
• /
• 2018

We analyzed security threats and suggested countermeasures about the block chain technologies which has emerged as a core technology of the fourth industrial revolution. We know that increasing the security leads to slow down program processing rate in the block chain systems. The block chain system which is currently an early stage of technological development, to become an economic and social infrastructure, development of technology and active policy implementation will be necessary. We studied on the security threats and countermeasures of the Bit Coin based on block chain. Further research should be undertaken on the possibility that future studies could have a real adverse effect on the integrity of the data.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.4
• /
• pp.1141-1151
• /
• 1997

In this paper the Maximum Block Method is suggested for the Feature Extraction of stokes of off-line Chinese characters.The Maximum Block Method is a technique which enlarges the block from the first found pixel that wxtracts the skeleton and features of the input characters.The maximum Block mthod is an adequate technique for the correct extraction of the features since the exsting thining methods have shortcomings of making the feature extraction difficult from the distoritions generated from the effiects of the parial noises,inflection points and blemishes. The printed outputs and chinese books of the middle and high school students,and other materials are used for the test.It was found that the Maxthod is also an effective technique for the extraction of skeleton line and features,which is the preoprocessing of the pattern recognition,for the Korean chracters and English as well as chinese chracters.