• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.213-221
• /
• 2012

The architecture of an interconnection network is usually represented by a graph, and a graph G is bipancyclic if it contains a cycle for every even length from 4 to ${\mid}V(G){\mid}$. In this article, we analyze the conditional edge-fault-tolerant properties of an enhanced hypercube, which is an attractive variant of a hypercube that can be obtained by adding some complementary edges. For any n-dimensional enhanced hypercube with at most (2n-3) faulty edges in which each vertex is incident with at least two fault-free edges, we showed that there exists a fault-free cycle for every even length from 4 to $2^n$ when n($n{\geq}3$) and k have the same parity. We also show that a fault-free cycle for every odd length exists from n-k+2 to $2^n-1$ when n($n{\geq}2$) and k have the different parity.

• Bulletin of the Korean Chemical Society
• /
• v.10 no.3
• /
• pp.298-302
• /
• 1989

The strengths of two-photon transitions from the ground state to excited vibronic states in benzene are calculated by using the CNDO/2-U wave functions. The role of vibronic coupling in two-photon absorption process is discussed. The $A_{1{\bar{g}}}-A_{2g}^+$ two-photon transitions, which are forbidden by the identity-forbidden selection rule in single frequency two-photon absorption, are too weak to be experimentally observed even when two photons of different energies are used. It is because the transitions are forbidden also by the pseudo-parity selection rule which are applicable for alternant hydrocarbons such as benzene. It is also shown that the vibronic coupling is not very effective in altering the pseudo-parity property of the electronic state. The strength of the vibronically induced two-photon absorption is strongly affected by the presence of an electronic state from which two-photon absorption can borrow the intensity. It is pointed out that the pseudo-parity selection rule may be violated in such cases.

• Proceedings of the Korean Nuclear Society Conference
• /
• 2001.10a
• /
• pp.56-56
• /
• 2001

• Asian-Australasian Journal of Animal Sciences
• /
• v.14 no.2
• /
• pp.189-192
• /
• 2001

This study was initiated in an effort to determine the normal mean and variations of the somatic cell count (SCC) in milk of buffaloes as influenced by the milking time, stage of lactation, parity and season. The buffaloes were hand milked at 13 and 11 h. interval during evening and morning respectively. On the day of milk sampling the udders were tested for mastitis by California Mastitis Test (CMT). Only those buffaloes, which were found negative in the CMT, were included in the sampling plan. The mean values for morning and evening were 1.09 (range 0.39-1.76) and $0.97(range\;0.57-2.46){\times}10^5cells/ml$, respectively which did not differ significantly. When data of the morning and evening values was compared on the basis of total cell secretion in milk, even then there was no statistical difference between the morning and the evening values, thereby suggesting that no diurnal variation existed in SCC of milk. Paritywise differences were not significant between the 1st to 5th lactation and above. Similarly stage of lactation effect, when tested at 30 day intervals, did not differ significantly. Significant (p<0.05) correlation coefficients (r) between SCC and milk yield during different stages of lactation and parity suggested that SCC per ml of milk was higher during the later stages of lactation. SCC was higher in primiparous than in multiparous buffaloes. On an average the SCC recorded was $1.0{\times}10^5cells/ml$ of milk irrespective of time of milking, parity and stages of lactation. The SCC was low during cold and hot-dry season but were high during the hot-humid season (p<0.05), the respective values being 0.76, 1.08 and $1.35{\times}10^5cells/ml$. These values were lower than the SCC already reported in cows suggesting less stressful condition of the udder of buffaloes in this study.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.1
• /
• pp.52-60
• /
• 1999

This paper deals with a fault detection and isolation scheme for a DC motor driven centrifugal pump system. The emphasis is placed on the design and implementation of the residual generatorm, based on parity relation, that provides decision logic unit with residuals that will be further processed to detect and isolate three important faults in the system;brush fault, impeller fault, and the speed sensor fault. Two process faults are modelled as multiplicative type faults, while the sensor fault as an additive one. With multiplicative fault, the implementation of the residual generator needs the time varying transformation matrix that must be computed on-line. Typical implementation methods lack in generality because only a numerical approximation around the assumed fault levels is employed. In this paper, a new implementation method using well tranined neural network is proposed to improve the generality of the residual generator. Application results show that the fault detection and isolation scheme with the proposed residual generator effectively isolates three major faults in the centrifugal pump system even with a wide range of fault magnitude.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2010.08a
• /
• pp.56-56
• /
• 2010

Using first-principles density-functional theory calculations, we find dramatically different electronic states in the C chains generated on the H-terminated C(111) surface, depending on their length and parity. The infinitely long chain has $\pi$ electrons completely delocalized over the chain, yielding an equal C-C bond length. As the chain length becomes finite, such delocalized $\pi$ electrons are transformed into localized ones. As a result, even-numbered chains exhibit a strong charge-lattice coupling, leading to a bond-alternated structure, while odd-numbered chains show a ferrimagnetic spin ordering with a solitonlike structure. These geometric and electronic features of infinitely and finitely long chains are analogous to those of the closed (benzene) and open (polyacetylene) chains of hydrocarbons, respectively.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.389-396
• /
• 2009

In RFID systems, identifying the tag attached to the subject begins with the request from a reader. When the reader sends a request, multiple tags in the reader's interrogation zone simultaneously respond to it, resulting in collision. The reader needs the anti collision algorithm which can quickly identify all the tags in the interrogation zone. We propose the Anti Collision Algorithm using Parity Mechanism(ACPM). In ACPM, a collision can be prevented because the tags which match with the prefix of the reader's request respond as followings; the group of tags with an even number of 1's in the bits to the prefix + 2nd bits responds in slot '0', while the group of tags with an odd number of 1's responds in slot '1'. The ACPM generates the request prefix so that the only existing tags according to the response in the corresponding slot. If there are two collided bits in tags, then reader identify tags by the parity mechanism. That is, it decreases the tag identification time by reducing the overall number of requests.

• Journal of Broadcast Engineering
• /
• v.16 no.4
• /
• pp.635-646
• /
• 2011

In distributed video coding, low complexity encoder can be realized by shifting encoder-side complex processes to decoder-side. However, not only motion estimation/compensation processes but also complex LDPC decoding process are imposed to the Wyner-Ziv decoder, therefore decoder-side complexity has been one important issue to improve. LDPC decoding process consists of numerous iterative decoding processes, therefore complexity increases as the number of iteration increases. This iterative LDPC decoding process accounts for more than 60% of whole WZ decoding complexity, therefore it can be said to be a main target for complexity reduction. Previously, HDA (Hard Decision Aided) method is introduced for fast LDPC decoding process. For currently received parity bits, HDA method certainly reduces the complexity of decoding process, however, LDPC decoding process is still performed even with insufficient amount of parity request which cannot lead to successful LDPC decoding. Therefore, we can further reduce complexity by avoiding the decoding process for insufficient parity bits. In this paper, therefore, a parity request estimation method is proposed using bit plane-wise correlation and temporal correlation. Joint usage of HDA method and the proposed method achieves about 72% of complexity reduction in LDPC decoding process, while rate distortion performance is degraded only by -0.0275 dB in BDPSNR.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.12
• /
• pp.156-163
• /
• 2012

Recently, Information Hiding Technology are becoming increasingly demanding in the field of international security, military and medical image This paper proposes data hiding technique utilizing parity checker for gray level image. many researches have been adopted LSB substitution and XOR operation in the field of steganography for the low complexity, high embedding capacity and high image quality. But, LSB substitution methods are not secure through it's naive mechanism even though it achieves high embedding capacity. Proposed method replaces LSB of each pixel with XOR(between the parity check bit of other 7 MSBs and 1 Secret bit) within one pixel. As a result, stego-image(that is, steganogram) doesn't result in high image degradation. Eavesdropper couldn't easily detect the message embedding. This approach is applying the concept of symmetric-key encryption protocol onto steganography. Furthermore, 1bit of symmetric-key is generated by the self-reference of each pixel. Proposed method provide more 25% embedding rate against existing XOR operation-based methods and show the effect of the reversal rate of LSB about 2% improvement.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.5-9
• /
• 2008

Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.