• Journal of the Korea Concrete Institute
• /
• v.18 no.1 s.91
• /
• pp.57-64
• /
• 2006

The crack presented in concrete structures causes a structural defect, the durability decrease, and external damages etc. Therefore, it is necessary to improve durability through the effort to control the crack. Fluosilicic acid($H_2SiF_6$) is recovered as aqueous solution which absorbs $SiF_4$ produced from the manufacturing of industrial-graded $H_3PO_4$ or HF. Generally, fluosilicates prepared by the reaction between $H_2SiF_6$ and metal salts. Addition of fluosilicates to cement endows odd properties through unique chemical reaction with the fresh and hardened cement. Mix proportions for experiment were modulated at 0.45 of water to cement ratio and $0.0{\sim}2.0%$ of adding ratio of fluosilicate salt based inorganic compound. To evaluate correlation of concrete strength and adding ratio of fluosilicate salt based inorganic compound, the tests were performed about design strength(21, 24, 27 MPa) with 0.5% of adding ratio of fluosilicate salt based inorganic compound. Applications of fluosilicate salt based inorganic compound to reduce cracks resulted from plastic and drying shrinkage, to improve durability are presented in this paper. Durability was evaluated as neutralization, chloride ion penetration depth, freezing thawing resistant tests and weight loss according reinforcement corrosion. It is ascertained that the concrete added fluosilicate salt based inorganic compound showed m ability to reduce the total area and maximum crack width significantly as compared non-added concrete. In addition, the durability of concrete improved because of resistance to crack and watertightness by packing role of fluosilicate salt based inorganic compound obtained and pozzolanic reaction of soluble $SiO_2$ than non-added concrete.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.27-36
• /
• 2007

Changeable biometrics identify a person using transformed biometric data instead of original biometric data in order to enhance privacy and security in biometrics when biometric data is compromised. In this paper, a novel scheme which generates changeable face templates for statistical appearance-based face recognition is proposed. Two different original face feature vectors are extracted from two different appearance-based approaches, respectively, each original feature vector is normalized, and its elements are re-ordered. Finally a changeable face template is generated by weighted addition between two normalized and scrambled feature vectors. Since the two feature vectors are combined into one by a two to one mapping, the original two feature vectors are not easily recovered from the changeable face template even if the combining rule is known. Also, when we need to make new changeable face template for a person, we change the re-ordering rule for the person and make a new feature vector for the person. Therefore, the security and privacy in biometric system can be enhanced by using the proposed changeable face templates. In our experiments, we analyze the proposed method with respect to performance and security using an AR-face database.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.10 s.113
• /
• pp.943-952
• /
• 2006

The OFDM system is very good for the high data rate communication system. However, OFDM system has a high PAPR problem. This makes the OFDM signal distorted through the nonlinear HPA(High Power Amplifier). To solve this problem, generally, simple PAPR reduction methods have been considered. However, in this paper, we introduce IMD reduction method instead of PAPR. PAPR is the signal property and the IMD is signal component of the HPA output, which degrades the communication quality. So, instead of PAPR we want to use the IMD reduction method. This is to transmit a signal with the smallest distortion by considering the third order nonlinearity when the data is recovered. We use the TR method that was proposed for the PAPR reduction and we find out the BER performance of two methods. As results, we show that the IMD reduction method improves better BER performance than the PAPR reduction.

• Journal of Korea Multimedia Society
• /
• v.10 no.10
• /
• pp.1347-1355
• /
• 2007

A sensor network is composed of a large number of tiny devices, scattered and deployed in a specified regions. Each sensing device has processing and wireless communication capabilities, which enable it to gather information from the sensing area and to transfer report messages to a base station. The energy-efficient routing paths are established when the base station requests a query, since each node has several characteristics such as low-power, constrained energy, and limited capacity. The established paths are recovered while minimizing the total transmit energy and maximizing the network lifetime when the paths are broken. In this paper, we propose a routing algorithm that each sensor node reports its adjacent link information to the sink node when a sink node broadcasts a query. The sink node manages the total topology and establishes routing paths. This algorithm has a benefit to find an alternative path by reducing the negotiating messages for establishing paths when the established paths are broken. To reduce the overhead of collection information, each node has a link information before reporting to the sink. Because the node recognizes which nodes are adjacent. The proposed algorithm reduces the number of required messages, because sensor nodes receive and report routing messages for establishment at the beginning of configuring routing paths, since each node keeps topology information to establish a routing path, which is useful to report sensing tasks in monitoring environments.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.6
• /
• pp.330-338
• /
• 2010

Flash storage devices are very popularly used in portable devices such as cell phones, PDAs and MP3 players. As technology is improved, users want much bigger and faster storage system. Paradoxically, people have to wait more and more time proportionally to the capacity of their storage devices when these are trying to be recovered after file system crash. It is serious problem because booting time of devices is dominated by crash recovery of flash file system. In this paper, we design a crash recovery mechanism, named 'Working Area(WA hereafter)' technique, which has bounded crash recovery execution time. With WA technique, write operations to flash memory are only performed in WA. Therefore, by simply scanning the latest WA. We can recover a file system crash because every change for flash memory is occured only in latest WA. We implement the WA technique based on YAFFS2 and evaluate by comparing with traditional techniques. As a result, WA technique shows that its crash recovery execution time is 25 times faster than Log-based Method when we use 1 gig a bytes NAND flash memory in worst case. This gap will be futher and futher as storage capacity grows.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.5
• /
• pp.1099-1112
• /
• 2018

The field of post-quantum cryptography (PQC) is an active area of research as cryptographers look for public-key cryptosystems that can resist quantum adversaries. Among those categories in PQC, code-based cryptosystem provides high security along with efficiency. Recent works on code-based cryptosystems focus on the side-channel resistant implementation since previous works have indicated the possible side-channel vulnerabilities on existing algorithms. In this paper, we recovered the secret key in HyMES(Hybrid McEliece Scheme) using a single power consumption trace. HyMES is a variant of McEliece cryptosystem that provides smaller keys and faster encryption and decryption speed. During the decryption, the algorithm computes the parity-check matrix which is required when computing the syndrome. We analyzed HyMES using the fact that the joint distributions of nonlinear functions used in this process depend on the secret key. To the best of our knowledge, we were the first to propose the side-channel analysis based on joint distributions of leakages on public-key cryptosystem.

• Animal Systematics, Evolution and Diversity
• /
• v.16 no.1
• /
• pp.125-131
• /
• 2000

This paper deals with the morphology and taxonomy of the first reported species of echinostome belonging to the genus Himasthla Dietz, 1909, found from dunlins (Calidris alpina sakhalina) in Korea. Birds were captured with mist-nets at the tidal flat of Yeochari, Kanghwa-gun, Kyunggi-do, Korea. The worms were removed from avian intestines in physiological saline, fixed, acetocarmine stained and observed. Himasthla kusasigi Yamaguti, which was found in 1939, was characterized morphologically by a long and slender body (5.27 mm in length), besetting with spines and reniform head collar (0.27 mm) in a form of a single and uninterrupted row of 31 spines. The oral sucker (0.057$\times$0.0684 mm) is smaller than the ventral sucker (0.35$\times$0.29 mm). The ventral sucker was close to the anterior extremity of the body. The worm had two elliptical testes (anterior 0.47$\times$0.30 mm, posterior 0.59$\times$0.27 mm). The testes were close to the posterior end of the body. The uterus was very long, winding and extending through at least two thirds of the body length. The ovary (0.13$\times$0.14mm) was round and small. Below the ovary, a round and small seminal receptacle was found.

• Journal of KIISE:Software and Applications
• /
• v.29 no.11
• /
• pp.767-774
• /
• 2002

Conventional research on image restoration has focused on restoring degraded images resulting from image formation, storage and communication, mainly in the signal processing field. Related research on recovering original image information of caption regions includes a method using BMA(block matching algorithm). The method has problem with frequent incorrect matching and propagating the errors by incorrect matching. Moreover, it is impossible to recover the frames between two scene changes when scene changes occur more than twice. In this paper, we propose a method for recovering original images using EBMA(Extended Block Matching Algorithm) and a region compensation method. To use it in original image recovery, the method extracts a priori knowledge such as information about scene changes, camera motion and caption regions. The method decides the direction of recovery using the extracted caption information(the start and end frames of a caption) and scene change information. According to the direction of recovery, the recovery is performed in units of character components using EBMA and the region compensation method. Experimental results show that EBMA results in good recovery regardless of the speed of moving object and complexity of background in video. The region compensation method recovered original images successfully, when there is no information about the original image to refer to.

• Journal of Korea Multimedia Society
• /
• v.14 no.3
• /
• pp.403-413
• /
• 2011

In this paper, we proposed a digital image watermarking technique using scrambled binary phase computer generated hologram in the discrete cosine transform(DCT) domain. For the embedding process of watermark. Using simulated annealing algorithm, we would generate a binary phase computer generated hologram(BPCGH) which can reconstruct hidden image perfectly instead of hidden image and encrypt it through the scramble operation. We multiply the encrypted watermark by the weight function and embed it into the DC coefficients in the DCT domain of host image and an inverse DCT is performed. For the extracting process of watermark, we compare the DC coefficients of watermarked image and original host image in the DCT domain and dividing it by the weight function and decrypt it using descramble operation. And we recover the hidden image by inverse Fourier transforming the decrypted watermark. Finally, we compute the correlation between the original hidden image and recovered hidden image to determine if a watermark exits in the host image. The proposed watermarking technique use the hologram information of hidden image which consist of binary values and scramble encryption technique so it is very secure and robust to the various external attacks such as compression, noises and cropping. We confirmed the advantages of the proposed watermarking technique through the computer simulations.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.3
• /
• pp.12-26
• /
• 2000

In this paper, we propose a post-processing algorithm to remove false minutiae which decrease the overall performance of an automatic fingerprint identification system by increasing computational complexity, FAR(False Acceptance Rate), and FRR(False Rejection Rate) in matching process. The proposed algorithm extracts candidate minutiae from thinned fingerprint image. Considering characteristics of the thinned fingerprint image, the algorithm selects the minutiae that may be false and located in recoverable area. If the area where the selected minutiae reside is thinned incorrectly due to noise and loss of information, the algorithm recovers the area and the selected minutiae are removed from the candidate minutiae list. By examining the ridge pattern of the block where the candidate minutiae are found, true minutiae are recovered and in contrast, false minutiae are filtered out. In an experiment, Fingerprint images from NIST special database 14 are tested and the result shows that the proposed algorithm reduces the false minutiae extraction rate remarkably and increases the overall performance of an automatic fingerprint identification system.