• The Journal of the Korea Contents Association
• /
• v.19 no.5
• /
• pp.187-193
• /
• 2019

Key-value storage engines are an essential component of growing demand in many computing environments, including social networks, online e-commerce, and cloud services. Recent key-value storage engines offer many features such as transaction, versioning, and replication. In a key-value storage engine, transaction processing provides atomicity through Write-Ahead-Logging (WAL), and a synchronous commit method for transaction processing flushes log data before the transaction completes. According to our observation, flushing log data to persistent storage is a performance bottleneck for key-value storage engines due to the significant overhead of fsync() calls despite the various optimizations of existing systems. In this article, we propose a group synchronization method to improve the performance of the key-value storage engine. We also design and implement a transaction scheduling method to perform other transactions while the system processes fsync() calls. The proposed method is an efficient way to reduce the number of frequent fsync() calls in the synchronous commit while supporting the same level of transaction provided by the existing system. We implement our scheme on the WiredTiger storage engine and our experimental results show that the proposed system improves the performance of key-value workloads over existing systems.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.3
• /
• pp.69-77
• /
• 2015

MANET is composed of only the mobile nodes have a limited transmission range. The dynamic topology by the frequent movement of nodes makes routing difficult and is also cause exposed to security vulnerabilities. In this paper, we propose the security routing technique consisted of mechanism of two steps in order to respond effectively to attack by the modification of the routing information and transmit secure data. The hierarchical structure is used and the authentication node that issues the key of the nodes within each cluster is elected in this proposed method. The authentication node manages key issues and issued information for encrypting the routing information from the source node. The reliability value for each node is managed to routing trust table in order to secure data transmission. In the first step, the route discovery is performed using this after the routing information is encrypted using the key issued by the authentication node. In the second step, the average reliability value of the node in the found path is calculated. And the safety of the data transmission is improved after the average reliability value selects the highest path. The improved performance of the proposed method in this paper was confirmed through comparative experiments with CBSR and SEER. It was confirmed a better performance in the transmission delay, the amount of the control packet, and the packet transmission success ratio.

• The Journal of the Korea Contents Association
• /
• v.21 no.7
• /
• pp.127-133
• /
• 2021

In industrial IoT environments, sensors generate data for their detection targets and deliver the data to IoT gateways. Therefore, managing large amounts of real-time sensor data is an essential feature for IoT gateways, and key-value storage engines are widely used to manage these sensor data. However, key-value storage engines used in IoT gateways do not take into account the characteristics of sensor data generated in industrial IoT environments, and this limits the performance of key-value storage engines. In this paper, we optimize the key-value storage engine by utilizing the features of sensor data in industrial IoT environments. The proposed optimization technique is to analyze the key, which is the input of a key-value storage engine, for further indexing. This reduces excessive write amplification and improves performance. We implement our optimization scheme in LevelDB and use the workload of the TPCx-IoT benchmark to evaluate our proposed scheme. From experimental results we show that our proposed technique achieves up to 21 times better than the existing scheme, and this shows that the proposed technique can perform high-speed data ingestion in industrial IoT environments.

• Journal of Korea Multimedia Society
• /
• v.5 no.6
• /
• pp.683-696
• /
• 2002

The existing block encryption algorithms have been designed for the encryption key value to be unchanged and applied to the round functions of each block, and enciphered. Therefore, it has such a weak point that the plaintext or encryption key could be easily exposed by differential cryptanalysis or linear cryptanalysis, both are the most powerful methods for decoding block encryption of a round-repeating structure. In order to overcome with this weak point, an encryption algorithm using a mote efficient key should be designed. In this paper, a block encryption algorithm which is designed for each encryption key value to be applied to each round block with different value is proposed. This algorithm needs a short processing time in an encryption and decryption, has a high intensity, can apply to electronic commerce and various applications of data protection.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.3
• /
• pp.1047-1062
• /
• 2022

Differential power analysis (DPA) is disturbed by ghost peaks. There is a phenomenon that the mean absolute difference (MAD) value of the wrong key is higher than the correct key. We propose a compressed key guessing space (CKGS) scheme to solve this problem and analyze the AES algorithm. The DPA based on this scheme is named CKGS-DPA. Unlike traditional DPA, the CKGS-DPA uses two power leakage points for a combined attack. The first power leakage point is used to determine the key candidate interval, and the second is used for the final attack. First, we study the law of MAD values distribution when the attack point is AddRoundKey and explain why this point is not suitable for DPA. According to this law, we modify the selection function to change the distribution of MAD values. Then a key-related value screening algorithm is proposed to obtain key information. Finally, we construct two key candidate intervals of size 16 and reduce the key guessing space of the SubBytes attack from 256 to 32. Simulation experimental results show that CKGS-DPA reduces the power traces demand by 25% compared with DPA. Experiments performed on the ASCAD dataset show that CKGS-DPA reduces the power traces demand by at least 41% compared with DPA.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.36 no.4
• /
• pp.109-123
• /
• 2011

This study proposes a value based service design (VBSD) approach using Kano's model and QFD. Key quality factors and key cost factors are identified, evaluated and then incorporated to produce customer value index (CVI) and provider value index (PVI) which are together used to determine the four value strategy zones. Each value strategy zone suggests its own appropriate service development strategy based on its corresponding CVI and PVI characteristics such as maintaining current service, reducing costs, raising quality or eliminating/creating services. A camping car service design case is applied to this study, which shows the practical contribution of this VBSD approach.

• Journal of Advanced Marine Engineering and Technology
• /
• v.32 no.6
• /
• pp.955-963
• /
• 2008

In this paper, we propose an improved practical encryption and fault-tolerance decryption method using a non-negative value key and random function obtained with a white noise by using iterative phase wrapping method. A phase wrapping operating key, which is generated by the product of arbitrary random phase images and an original phase image. is zero-padded and Fourier transformed. Fourier operating key is then obtained by taking the real-valued data from this Fourier transformed image. Also the random phase wrapping operating key is made from these arbitrary random phase images and the same iterative phase wrapping method. We obtain a Fourier random operating key through the same method in the encryption process. For practical transmission of encryption and decryption keys via Internet, these keys should be intensity maps with non-negative values. The encryption key and the decryption key to meet this requirement are generated by the addition of the absolute of its minimum value to each of Fourier keys, respectively. The decryption based on 2-f setup with spatial filter is simply performed by the inverse Fourier transform of the multiplication between the encryption key and the decryption key and also can be used as a current spatial light modulator technology by phase encoding of the non-negative values. Computer simulations show the validity of the encryption method and the robust decryption system in the proposed technique.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.12
• /
• pp.1367-1372
• /
• 2015

In this paper, we embed RFID tag into name plate of pole and store key value at its RFID tag in order to solve the problem for the management of name plate of pole, which identify by eyes of human for until now. The 900MHz RFID reader performs identification for stored key value, then its key value transmit into smart phone through Bluetooth. The smart phone transmit the key value into server through data communication network and receive again the necessary information after the authentication by the server. We develop pole information system that have such a structure.

• Animal Bioscience
• /
• v.36 no.1
• /
• pp.108-118
• /
• 2023

Objective: The objective of this experiment was to determine the net energy (NE) value of 6 wheat bran and 1 wheat shorts by indirect calorimetry and establish the NE prediction equations of wheat bran fed to growing barrows. Methods: Forty-eight growing barrows (28.5±2.4 kg body weight) were allotted in a completely randomized design to 8 dietary treatments that included a corn-soybean meal basal diet, 6 wheat bran diets and 1 wheat shorts diet. The inclusion level of wheat bran or wheat shorts in diets is 30%. Results: The addition of wheat bran reduced the apparent total tract digestibility (ATTD) of nutrients (p<0.05). The ATTD of gross energy, crude protein (CP) and dry matter (DM) in the wheat shorts were greater than that in the wheat bran. Addition of wheat bran or wheat shorts had no effect on total heat production and fasting heat production. The NE of wheat bran was negatively correlated with neutral detergent fiber (r = -0.84; p<0.05) and acid detergent fiber (r = -0.83; p<0.05), while it was positively correlated with CP (r = 0.92; p<0.01). The NE values of wheat bran ranged from 6.79 to 8.15 MJ/kg DM, and the NE value of wheat shorts was 12.47 MJ/kg DM. The ratio of NE to metabolizable energy for wheat bran fed to growing pigs was from 66.0% to 71.7%, whereas the value for wheat shorts was 83.7%. Conclusion: The NE values of wheat bran ranged from 6.79 to 8.15 MJ/kg DM, and the NE value of wheat shorts was 12.47 MJ/kg DM. The NE value of wheat bran can be well predicted based on energy content and proximate analysis.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.5
• /
• pp.58-64
• /
• 2001

Recently many informations are transmitted ,md stored as video data, and they are on the rapid increase because of popularization of high performance computer and internet. In this paper, to retrieve video data, shots are found through analysis of video stream and the method of detection of key frame is studied. Finally users can retrieve the video efficiently. This Paper suggests a new feature that is robust to object movement in a shot and is not sensitive to change of color in boundary detection of shots, and proposes the characterizing value that reflects the characteristic of kind of video (movie, drama, news, music video etc,). The key frames are pulled out from many frames by using the local minima and maxima of differential of the value. After original frame(not de image) are reconstructed for key frame, indexing process is performed through computing parameters. Key frames that arc similar to user's query image arc retrieved through computing parameters. It is proved that the proposed methods are better than conventional method from experiments. The retrieval accuracy rate is so high in experiments.