• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.596-608
• /
• 2004

A lot of work has been done to reduce disk access time in I/O intensive systems, which store and handle massive amount of data, by distributing data across multiple disks and accessing them in parallel. Most of the previous work has focused on an efficient mapping from a grid cell to a disk number on the assumption that data space is regular grid-like partitioned. Although we can achieve good performance for low-dimensional data by grid-like partitioning, its performance becomes degenerate as grows the dimension of data even with a good disk allocation scheme. This comes from the fact that they partition entire data space equally regardless of distribution ratio of data objects. Most of the data in high-dimensional space exist around the surface of space. For that reason, we propose a new declustering algorithm based on the partitioning scheme which partition data space from the surface. With an unbalanced partitioning scheme, several experimental results show that we can remarkably reduce the number of data blocks touched by a query as grows the dimension of data and a query size. In this paper, we propose disk allocation schemes based on the layout of the resultant data blocks after partitioning. To show the performance of the proposed algorithm, we have performed several experiments with different dimensional data and for a wide range of number of disks. Our proposed disk allocation method gives a performance within 10 additive disk accesses compared with strictly optimal allocation scheme. We compared our algorithm with Kronecker sequence based declustering algorithm, which is reported to be the best among the grid partition and mapping function based declustering algorithms. We can improve declustering performance up to 14 times as grows dimension of data.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.5
• /
• pp.147-156
• /
• 2022

Industrial control systems that manage and maintain various industries were mainly operated in closed environment without external connection, but with the recent development of the Internet and the introduction of ICT technology, the access to the industrial control system of external or attackers has become easier. Such incorrect approaches or attacks can undermine the availability, a major attribute of the industrial control system, and violation of availability can cause great damage. In this paper, when issuing commands in an industrial control system, a verification group is formed using a random list to verify and execute commands, and a trust score technique is introduced that applies feedback to the verification group that conducted verification using the command execution result. This technique can reduce overhead generated by random generation in the process of requesting command verification, give flexibility to the verification process, and ensure system availability. For the performance analysis of the system, we measured the time and gas usage when deploying a smart contract, gas usage when verifying a command. As a result, we confirmed that although the proposed system generates a random list compared to the legacy system, there was little difference in the time when it took to deploy smart contract and that the gas used to deploy smart contract increased by about 1.4 times in the process of generating a random list. However, the proposed system does not perform random operations even though the operation of command verification and confidence score technique is performed together during the command verification process, thus it uses about 9% less gas per verification, which ensures availability in the verification process.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.1
• /
• pp.29-38
• /
• 2012

Due to the rapid development of network environment and wireless communication technology, the distribution of digital video has made easily and the importance of the protection for digital video has been increased. This paper proposes the digital video encryption system based on multiple chaos maps for MPEG-2 video encoding process. The proposed method generates secret hash key of having 128-bit characteristics from hash chain using Tent map as a basic block and generates $8{\times}8$ lattice cipher by applying this hash key to Logistic map and Henon map. The method can reduce the encryption overhead by doing selective XOR operations between $8{\times}8$ lattice cipher and some coefficient of low frequency in DCT block and it provides simple and randomness characteristic because it uses the architecture of combining chaos maps. Experimental results show that PSNR of the proposed method is less than or equal to 12 dB with respect to encrypted video, the time change ratio, compression ratio of the proposed method are 2%, 0.4%, respectively so that it provides good performance in visual security and can be applied in real time.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.5
• /
• pp.675-686
• /
• 2005

This paper proposes a new method of mathematically modeling and computer simulating television ghosts wherein television signals that have undergone multipath fading are generated without using approximations by considering the attenuation, time delay, phase, and timing jitter between consecutive frames. Conventional methods used polynomial interpolation or complex arithmetic to take into account the ghost phase, but our method uses only real arithmetic by employing the Hilbert transform and also reduces the computation time using the FFT (fast Fourier transform) algorithm. Furthermore, it is also possible to observe the transmit waveforms in both RF and IF ranges. Various ghost patterns generated in software provide for essential data required for the development of ghost canceling algorithms, and are deemed to be very useful in analyzing the constituent blocks of the transmitter and receiver chain in television broadcasting. The development of ghost cancelers needs to be preceded by the task of mathematically modeling ghosts and their extensive computer simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5A
• /
• pp.493-500
• /
• 2006

This paper presents the efficient structure and parameter optimization of downlink beamforming transmitter in OFDMA/TDD system. To design downlink beamforming transmitter for multiple transmit antennas, an efficient beamforming structure for multiple users and the choice of word-length of each block are critical in the aspect of its performance and hardware complexity. We propose an efficient beamforming scheme, which stores the weights of subcarriers into memory without user identification at the receiver of base station and calculates the weights for corresponding user in a subcarrier unit of IFFT input at high speed. Also, we obtain the word-length of main data path and other design parameters by fixed-point simulation analysis. The proposed architecture could reduce the memory size proportional to the maximum number of users per frame, and the processing time of an OFDM symbol at the receiver of base station without the need of additional processing time for calculating the weights at the transmitter.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.4A
• /
• pp.291-297
• /
• 2009

Relaxation of high strength bolts was investigated. Block type and splice type specimens were fabricated with different types of bolts and different clamping lengths. Bolts were tightened to the specified torque. Clamping forces were measured through strain gauges installed on the shafts of bolts, while specimens were kept in a constant temperature and humidity. In all cases, ratio of clamping force reduction is less than 10%. Test results of different types of specimens and bolts and different clamping lengths were compared each other by using a simple model, which is suggested in this study for the estimation of bolt relaxation. The suggested model shows reasonably good agreements with test results for all cases. No difference is found between F13T and F10T bolts, but Dacro coated bolts shows higher relaxation than black bolts by approx. 30%. And also the comparison of test results shows that ratios of bolt relaxation become larger as clamping lengths of bolt shorter and the number of faying surfaces greater.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.5
• /
• pp.877-884
• /
• 2023

In this study, when another vehicle is parked in a designated space where a personal vehicle can park and a defined personal use time, an ultrasonic object recognition sensor is used to determine vehicle entry, and a camera sensor recognizes a license plate. If the vehicle is not recognized by the individual vehicle owner, the "private parking lot operation block" of the application server receives the individual phone number based on the National Police Agency's Vehicle Number Information Inquiry Open API. Afterwards, when parking is processed, the non-right holder receives the approval of the parking right holder, parks for the recognized time, and deposits the parking fee into the public account of the city hall. Through this study, it was possible to find an operation processing method that can most effectively manage parking in the city center in a private parking space recognized by the city hall.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.2
• /
• pp.67-74
• /
• 2013

Approximate string matching problems have been studied in diverse fields. Recently, fast approximate string matching algorithms are being used to reduce the time and costs for the next generation sequencing. To measure the amounts of errors between two strings, we use a distance function such as the edit distance. Given two strings X(|X| = m) and Y(|Y| = n) over an alphabet ${\Sigma}$, the edit distance between X and Y is the minimum number of edit operations to convert X into Y. The edit distance between X and Y can be computed using the well-known dynamic programming technique in O(mn) time and space. The edit distance also can be computed using the Four-Russians' algorithm whose preprocessing step runs in $O((3{\mid}{\Sigma}{\mid})^{2t}t^2)$ time and $O((3{\mid}{\Sigma}{\mid})^{2t}t)$ space and the computation step runs in O(mn/t) time and O(mn) space where t represents the size of the block. In this paper, we present a parallelized version of the computation step of the Four-Russians' algorithm. Our algorithm computes the edit distance between X and Y in O(m+n) time using m/t threads. Then we implemented both the sequential version and our parallelized version of the Four-Russians' algorithm using CUDA to compare the execution times. When t = 1 and t = 2, our algorithm runs about 10 times and 3 times faster than the sequential algorithm, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.316-322
• /
• 2017

This paper suggests an efficient software implementation of lightweight encryption algorithm PRESENT which supports for secret key lengths of 80-bits. Each round of PRESENT is composed of the round key addition, substitution, and permutation and is repeated 31 times. Bo Zhu suggested combined substitution and permutation for efficient operation so that encryption throughput has been increased 2.6 times than processing substitution and permutation at separate times. The scheme that suggested in this paper improved the scheme of Bo Zhu to reduce the number of operation for the round key addition, substitution, and permutation. The scheme that suggested in this paper has increased encryption throughput up to 1.6 times than the scheme of Bo Zhu but memory usage has been increased.

• Journal of Korea Multimedia Society
• /
• v.6 no.6
• /
• pp.1100-1110
• /
• 2003

Design and implementation of remote procedure cail (RPC) resource service system based on the XML considering the request delegation between the servers are described for the resource application and efficient processing of distributed environment. For this purpose, the request information about several server, which would be used by client, is encoded into XML document based on XML-DOM and transferred to server. Server classifies the client requests using objects which can deal with the XMLL-DOM. For the request delegation between the servers, server saves the request result of client in XMLL-DOM structure without replying it immediately, and makes the client request delegated to another server in XML-DOM's request information. In addition, the resource repository are managed for resource transparency of distributed environment. As a result, resource application and processing efficiency are improved by reduction of response time caused by integration of RPC and XML-RPC services and request delegation between the servers. Extension of asynchronous and average blocking time of client were reduced and information of resource which can be used by client was offered.