• Tunnel and Underground Space
• /
• v.15 no.1 s.54
• /
• pp.47-54
• /
• 2005

One of the standard procedures of discontinuity survey is the joint set identification from the population of field orientation data. Discontinuity set identification is fundamental to rock engineering tasks such as rock mass classification, discrete element analysis, key block analysis. and discrete fracture network modeling. Conventionally, manual method using contour plot had been widely used for this task, but this method has some short-comings such as yielding subjective identification results, manual operations, and so on. In this study, the method of discontinuity set identification using genetic algorithm was introduced, but slightly modified to handle the orientation data. Finally, based on the genetic algorithm, we developed a FORTRAN program, Genetic Algorithm based Clustering(GAC) and applied it to two different discontinuity data sets. Genetic Algorithm based Clustering(GAC) was proved to be a fast and efficient method for the discontinuity set identification task. In addition, fitness function based on variance showed more efficient performance in finding the optimal number of clusters when compared with Davis - Bouldin index.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.1
• /
• pp.8-18
• /
• 2010

Traditional storage server suffers from duplicated data blocks which cause an waste of storage space and network bandwidth. To address this problem, various de-duplication mechanisms are proposed. Especially, lots of works are limited to backup server that exploits Contents-Defined Chunking (CDC). In backup server, duplicated blocks can be easily traced by using Anchor, therefore CDC scheme is widely used for backup server. In this paper, we propose a new de-duplication mechanism for improving a storage system. We focus on efficient algorithm for supporting general purpose de-duplication server including backup server, P2P server, and FTP server. The key idea is to adapt stride scheme on traditional fixed block duplication checking mechanism. Experimental result shows that the proposed mechanism can minimize computation time for detecting duplicated region of blocks and efficiently manage storage systems.

• The Journal of the Korea Contents Association
• /
• v.4 no.4
• /
• pp.71-78
• /
• 2004

Dedicated Short Range Communications(DSRC) as a prominent communications candidate for Intelligent Transportation Systems(ITS) have been developed to support ITS applications such as value-added information service, e-commerce, electronic toll payment, etc. These various applications associated with electronic payment through unsecure communication channel of DSRC suffer from security threats. To ensure secure payment, we have adopted appropriate cryptographic mechanisms including encipherment, authentication exchange and digital signature. The cryptographic mechanisms require to use cryptographic keys established between two communication entities. In this paper, we propose a secure electronic payment system which is designed to have some functions for strong authentication, encryption, key agreement, etc. Especially, we adopt domestic developed cryptographic algorithms such as EC-KCDSA and SEED for digital signature and block cipher, respectively. We can show those mechanisms are appropriate for the secure electronic payment system for ITS services under the DSRC wireless environment in aspects of constrained computational resource use and processing speed.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.11
• /
• pp.196-201
• /
• 2016

Digital watermarking is a technique used to hide information within digital media. Digital watermarking techniques can be classified as either robust watermarking or fragile watermarking. Robust watermarking techniques are generally used for the purpose of copyright protection. In addition, fragile watermarking techniques are used for the authentication and integrity verification of a digital image. Therefore, fragile watermarks should be easily breakable for trivial tampering of a watermarked image. This paper proposes an efficient fragile watermarking method for image tamper detection in the spatial domain. In the proposed method, a hash code and symmetric key encryption algorithm are used. The proposed method of inserting a watermark by dividing the original image into many blocks of small sizes is not weak against attacks, such as cut and paste. The proposed method can detect the manipulated parts of a watermarked image without testing the entire block of the image.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.2 no.2
• /
• pp.111-124
• /
• 2002

The ferroelectric RAM (FeRAM) has a great advantage for a system on a chip (SOC) and mobile product memory, since FeRAM not only supports non-volatility but also delivers a fast memory access similar to that of DRAM and SRAM. This work develops at three levels: 1) low voltage operation with boost voltage control of bitline and plateline, 2) reducing bitline capacitance with multiple divided sub cell array, and 3) increasing chip performance with write operation sharing both active and precharge time period. The key techniques are implemented on the proposed hierarchy bitline scheme with proposed hybrid-bitline and high voltage boost control. The test chip and simulation results show the performance of sub-1.5 voltage operation with single step pumping voltage and self-boost control in a cell array block of 1024 ($64{\;}{\times}{\;}16$) rows and 64 columns.

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1321-1327
• /
• 2019

This paper describes an efficient hardware implementation of modular square root (MSQR) computation over GF(p), which is the operation needed to map plaintext messages to points on elliptic curves for elliptic curve (EC)-ElGamal public-key encryption. Our method supports five sizes of elliptic curves over GF(p) defined by the National Institute of Standards and Technology (NIST) standard. For the Koblitz curves and the pseudorandom curves with 192-bit, 256-bit, 384-bit and 521-bit, the Euler's Criterion based on the characteristic of the modulo values was applied. For the elliptic curves with 224-bit, the Tonelli-Shanks algorithm was simplified and applied to compute MSQR. The proposed method was implemented using the finite field arithmetic circuit with 32-bit datapath and memory block of elliptic curve cryptography (ECC) processor, and its hardware operation was verified by implementing it on the Virtex-5 field programmable gate array (FPGA) device. When the implemented circuit operates with a 50 MHz clock, the computation of MSQR takes about 18 ms for 224-bit pseudorandom curves and about 4 ms for 256-bit Koblitz curves.

• Biomolecules & Therapeutics
• /
• v.22 no.4
• /
• pp.295-300
• /
• 2014

The actin cytoskeleton plays an important role in macrophage-mediated inflammatory responses by modulating the activation of Src and subsequently inducing nuclear factor (NF)-${\kappa}B$ translocation. In spite of its critical functions, few papers have examined how the actin cytoskeleton can be regulated by the activation of toll-like receptor (TLR). Therefore, in this study, we further characterized the biological value of the actin cytoskeleton in the functional activation of macrophages using an actin cytoskeleton disruptor, cytochalasin B (Cyto B), and explored the actin cytoskeleton's involvement in morphological changes, cellular attachment, and signaling events. Cyto B strongly suppressed the TLR4-mediated mRNA expression of inflammatory genes such as cyclooxygenase (COX)-2, tumor necrosis factor (TNF)-${\alpha}$, and inducible nitric oxide (iNOS), without altering cell viability. This compound also strongly suppressed the morphological changes induced by lipopolysaccharide (LPS), a TLR4 ligand. Cyto B also remarkably suppressed NO production under non-adherent conditions but not in an adherent environment. Cyto B did not block the co-localization between surface glycoprotein myeloid differentiation protein-2 (MD2), a LPS signaling glycoprotein, and the actin cytoskeleton under LPS conditions. Interestingly, Cyto B and PP2, a Src inhibitor, enhanced the phagocytic uptake of fluorescein isothiocyanate (FITC)-dextran. Finally, it was found that Cyto B blocked the phosphorylation of vasodilator-stimulated phosphoprotein (VASP) at 1 min and the phosphorylation of heat shock protein 27 (HSP27) at 5 min. Therefore, our data suggest that the actin cytoskeleton may be one of the key components involved in the control of TLR4-mediated inflammatory responses in macrophages.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.31 no.1 s.256
• /
• pp.26-35
• /
• 2007

The vehicle of urban transit is a complex system that consists of various electric, electronic, and mechanical equipments, and the maintenance cost of this complex and large-scale system generally occupies sixty percent of the LCC (Life Cycle Cost). For reasonable establishing of maintenance strategies, safety security and cost limitation must be considered at the same time. The concept of system reliability has been introduced and optimized as the key of reasonable maintenance strategies. For optimization, three preceding studies were accomplished; standardizing a maintenance classification, constructing RBD (Reliability Block Diagram) of VVVF (Variable Voltage Variable Frequency) urban transit, and developing a web based reliability evaluation system. Historical maintenance data in terms of reliability index can be derived from the web based reliability evaluation system. In this paper, we propose applying inverse problem analysis method and hybrid neuro-genetic algorithm to system reliability optimization for using historical maintenance data in database of web based system. Feed-forward multi-layer neural networks trained by back propagation are used to find out the relationship between several component reliability (input) and system reliability (output) of structural system. The inverse problem can be formulated by using neural network. One of the neural network training algorithms, the back propagation algorithm, can attain stable and quick convergence during training process. Genetic algorithm is used to find the minimum square error.

• Asian Pacific Journal of Cancer Prevention
• /
• v.13 no.12
• /
• pp.5969-5973
• /
• 2012

Introduction: Andhra Pradesh (AP) is one of the largest tobacco producing states in India. About 29% of adults in AP currently use tobacco in some form. Almost 24% of males and 4% of females are smokers. The prevalence of tobacco use in the state is higher than the national average of 15% for male and 2% for female smokers. However, few attempts have been made to understand the current situation of tobacco control resources, activities and strategies in the context of such a high tobacco prevalence state. The present study aimed to identify the gaps in existing tobacco control program and areas where tobacco control efforts can be integrated. Methods: Data were collected using both quantitative and qualitative methods. Semi-structured interviews were undertaken with a total of 95 key officials of state health departments, program managers, and project directors in six districts to understand ongoing tobacco control efforts. To facilitate the interviews, semi-structured guides were developed. Simple descriptive statistical analysis was conducted on the quantitative data using SPSS version 17. Results: The results of the situational analysis suggest that a sufficient health workforce and infrastructure with the potential to integrate tobacco control activities is available in the surveyed districts. However, lack of integration of the tobacco control program intothe tuberculosis control program and the National Rural Health Mission was observed. Information, education and communication activities were lacking at block level health facilities. Conclusions: Our findings indicate that lack of trained health professionals, paucity of dedicated funds, lack of information, education and communication materials and low priority given to tobacco control activities are some of the factors which impede integration of tobacco control into existing health and developmental programmes in the districts of Andhra Pradesh, India.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.2
• /
• pp.23-29
• /
• 2015

The baby-step giant-step algorithm seeks b in a discrete logarithm problem when a,c,p of $a^b{\equiv}c$(mod p) are already given. It does so by dividing p by m block of $m={\lceil}{\sqrt{p}}{\rceil}$ length and letting one giant walk straight toward $a^0$ with constant m strides in search for b. In this paper, I basically reduce $m={\lceil}{\sqrt{p}}{\rceil}$ to p/l, $a^l$ > p and replace a giant with an adult who is designed to walk straight with constant l strides. I also extend the algorithm to allow $2^k$ adults to walk simultaneously. As a consequence, the proposed algorithm quarters the execution time of the basic adult-walk method when applied to $2^k$, (k=2) in the range of $1{\leq}b{\leq}p-1$. In conclusion, the proposed algorithm greatly shorten the step number of baby-step giant-step.