• Journal of the Korean Society of Radiology
• /
• v.11 no.5
• /
• pp.343-351
• /
• 2017

T1, T2 relaxation time and relaxation rates were measured and analyzed according to the change of RF coil channel number of MAGiC sequence. T1, T2, R1 and R2 maps were obtained by using MAGiC sequence with phantom (1.0, 0.6, 0.2, 0 mM) on the RF coil with channel number of 1, 8, 16 and 32 respectively. T1, T2, R1, R2 values and relaxation rates were measured for each channel number and concentration, and Relaxivity was calculated according to each concentration. T1, T2, R1, and R2 values were measured in each coil. There was no significant difference between T1 and R1 values (p> 0.05). However, T2 and R2 values were significantly different (p <0.05). In the post-analysis results, T2 value was significantly different from that measured on 1, 8, 16, and 32 channel coils (p <0.05) and There was no difference between 8, 16, and 32 channel coils (p> 0.05). The R2 value was significantly different from that measured on the 8, 16, and 32 channel coils in the 1 channel coil, and the results on the 8 channel coils and the 16 channel coils showed a significant difference (P <0.05). In conclusion, T1 and R1 values were not significantly different according to the number of channels in the coil, but T2 and R2 values were significantly different. Therefore, when quantitative measurement of T2 and R2 values using the MAGiC sequence, the same number of coils should be used for reproducibility.

• Journal of Korea Game Society
• /
• v.6 no.2
• /
• pp.51-60
• /
• 2006

Smoothing is a transmission plan where variable rate video data is converted to a constant bit rate stream. Among them are CBA, MCBA, MVBA, PCRTT and others. But, in these algorithm, a transmission plan is made in according to stored frame sequence in these algorithms. In case that the number of bytes in frames in GOP differs greatly each other, this may cause unnecessary transmission rate changes and may require high transmission rates abruptly when frame's byte is large. In result, it is difficult to use efficient network resource. In this paper, we proposed a smoothing algorithm that find the optimal frame sequence in short time by using backtracking method and smoothing's structure for the proposed smoothing algorithm. This algorithm decides the sequence of frames which requires the lowest variance of frame's bytes in GOP and make a transmission plan. In order to show the performance, we compared with MVBA algorithm by various evaluation factors such as the number of rate changes, peak rate, rate variability.

• Research in Plant Disease
• /
• v.19 no.2
• /
• pp.77-83
• /
• 2013

Bean yellow mosaic virus (BYMV; genus Potyvirus, family Potyviridae) causes severe losses to various legume species and a number of non-legume species, particularly freesia plants. In a survey of virus diseases in Gyeonggi province, Korea, BYMV isolates were identified from many cultivated freesia species. Here, we determined the complete nucleotide sequences of a BYMV freesia isolate (BYMV-Fr; accession number FJ492961). BYMV-Fr genome consists of 9,545 nucleotides (nt) excluding the poly (A) tail and encodes 3,057 amino acid (aa), with an AUG start and UAG stop codon, containing one open reading frame typical of a potyvirus polyprotein. The polyprotein of BYMV-Fr was divided to ten proteins and the cleavage sites of each protein were determined. The coat protein (CP) and polyprotein of BYMV-Fr were compared at the aa level with those of the previously reported 4 BYMV isolates. BYMV-Fr shared 90.1 to 97.1 and 91.0 to 92.5% at the CP and polyprotein homology. Interestingly, BYMV-Fr showed identities of a lower level at the nt level of 5' noncoding region (61.4 to 67.6%) and at the aa level of P1 (71.4 to 72.8%), comparing with four BYMV isolates. Based on the aa sequence diversity of CP and polyprotein, phylogenetic analysis with the four BYMV isolates showed two distinct groups and BYMV-Fr and most BYMV isolates were most closely related to the clover yellow vein virus among 52 potyviruses. To our knowledge, this is the first report of the complete genome sequence of BYMV freesia strain.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.9
• /
• pp.469-478
• /
• 2001

It is difficult to test a distributed system because of the task of controlling concurrent events,. Existing works do not propose the test sequence generation algorithm in a formal way and the amount of message is large due to synchronization. In this paper, we propose a formal test sequence generation algorithm using logical clock to control concurrent events. It can solve the control-observation problem and makes the test results reproducible. It also provides a generic solution such that the algorithm can be used for any possible communication paradigm. In distributed test, the number of channels among the testers increases non-linearly with the number of distributed objects. We propose a new remote test architecture for solving this problem. SDL Tool is used to verify the correctness of the proposed algorithm and it is applied to the message exchange for the establishment of Q.2971 point-to-multipoint call/connection as a case study.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.5
• /
• pp.1001-1008
• /
• 2019

A high-quality pseudorandom sequence generation is an important part of many cryptographic applications, including encryption protocols. Therefore, a pseudorandom number generator (PRNG) is an essential element for generating key sequences in a cryptosystem. A PRNG must effectively generate a large, high-quality random data stream. It is well known that the bitstreams output by the CA-based PRNG are more random than the bitstreams output by the LFSR-based PRNG. In this paper, we prove that the complemented CA derived from 90/150 maximum length cellular automata(MLCA) is a MLCA to design a PRNG that can generate more secure bitstreams and extend the key space in a secret key cryptosystem. Also we give a method for calculating the cell positions outputting a nonlinear sequence with maximum period in complemented MLCA derived from a 90/150 MLCA and a complement vector.

• Journal of Animal Science and Technology
• /
• v.63 no.2
• /
• pp.248-261
• /
• 2021

Attributable to their major function in pathogen recognition, the use of bovine leukocyte antigens (BoLA) as disease markers in immunological traits in cattle is well established. However, limited report exists on polymorphism of the BoLA gene in zebu cattle breeds by high resolution typing methods. Thus, we used a polymerase chain reaction sequence-based typing (PCR-SBT) method to sequence exon 2 of the BoLA class II DRB3 gene from 100 animals (Boran, n = 13; Sheko, n = 20; Fogera, n = 16; Horro, n = 19), Hanwoo cattle (n = 18) and Bangladesh Red Chittagong zebu (n = 14). Out of the 59 detected alleles, 43 were already deposited under the Immuno Polymorphism Database for major histocompatibility complex (IPD-MHC) while 16 were unique to this study. Assessment of the level of genetic variability at the population and sequence levels with genetic distance in the breeds considered in this study showed that Zebu breeds had a gene diversity score greater than 0.752, nucleotide diversity score greater than 0.152, and mean number of pairwise differences higher than 14, being very comparable to those investigated for other cattle breeds. Regarding neutrality tests analyzed, we investigated that all the breeds except Hanwoo had an excess number of alleles and could be expected from a recent population expansion or genetic hitchhiking. Howbeit, the observed heterozygosity was not significantly (p < 0.05) higher than the expected heterozygosity. The Hardy Weinberg equilibrium (HWE) analysis revealed non-significant excess of heterozygote animals, indicative of plausible over-dominant selection. The pairwise FST values suggested a low genetic variation among all the breeds (FST = 0.056; p < 0.05), besides the rooting from the evolutionary or domestication history of the cattle. No detached clade was observed in the evolutionary divergence study of the BoLA-DRB3 gene, inferred from the phylogenetic tree based on the maximum likelihood model. The investigation herein indicated the clear differences in BoLA-DRB3 gene variability between African and Asian cattle breeds.

• Journal of Computational Design and Engineering
• /
• v.3 no.3
• /
• pp.266-273
• /
• 2016

Optimization of hole-making operations in manufacturing industry plays a vital role. Tool travel and tool switch planning are the two major issues in hole-making operations. Many industrial applications such as moulds, dies, engine block, automotive parts etc. requires machining of large number of holes. Large number of machining operations like drilling, enlargement or tapping/reaming are required to achieve the final size of individual hole, which gives rise to number of possible sequences to complete hole-making operations on the part depending upon the location of hole and tool sequence to be followed. It is necessary to find the optimal sequence of operations which minimizes the total processing cost of hole-making operations. In this work, therefore an attempt is made to reduce the total processing cost of hole-making operations by applying relatively new optimization algorithms known as shuffled frog leaping algorithm and proposed modified shuffled frog leaping algorithm for the determination of optimal sequence of hole-making operations. An industrial application example of ejector plate of injection mould is considered in this work to demonstrate the proposed approach. The obtained results by the shuffled frog leaping algorithm and proposed modified shuffled frog leaping algorithm are compared with each other. It is seen from the obtained results that the results of proposed modified shuffled frog leaping algorithm are superior to those obtained using shuffled frog leaping algorithm.

• The Korean Journal of Applied Statistics
• /
• v.27 no.4
• /
• pp.577-588
• /
• 2014

The collection and storage of a large volumes of data are becoming easier; however, the number of variables is sometimes more than the number of samples(objects). We now face the problem of dependency among variables(such as multicollinearity) due to the increased number of variables. We cannot apply various statistical methods without satisfying independency assumption. In order to overcome such a drawback we consider a categorizing (or discretizing) observations. We have a data set of nancial indices from banks in Korea that contain 78 variables from 16 banks. Genetic sequence data is also a good example of a large data and there have been numerous statistical methods to handle it. We discover lots of useful bank information after we transform bank data into categorical data that resembles genetic sequence data and apply bioinformatic techniques.

• The Journal of the Korea Contents Association
• /
• v.19 no.9
• /
• pp.637-645
• /
• 2019

The RFID group proof is an extension of the yoking proof proving that multiple tags are scanned by a reader simultaneously. Existing group proof schemes provide only delayed tag loss detection which detects loss of tag response in a verification phase. However, delayed tag loss detection is not suitable for real-time applications where tag loss must be detected immediately. In this study, I propose a tag response loss detection scheme which detects loss of tag response in the proof generation process quickly. In the proposed scheme, the tag responds with the sequence number assigned to the tag group, and the reader detects the loss of the tag response through the sequence number. Through an experiment for indistinguishability, I show that the sequence number is secure against an analyzing message attack to distinguish between specific tags and tag groups. In terms of efficiency, the proposed scheme requires fewer transmissions and database operations than existing techniques to determine which tags response is lost.

• Journal of Plant Biotechnology
• /
• v.1 no.2
• /
• pp.109-115
• /
• 1999

A linkage map of Capsicum annuum L. was constructed by random amplified polymorphic DNA (RAPD) markers followed in a backcross population of an intraspecific cross between cultivars HDA210 and Yatsufusa. A total of 420 random primers were tested and 311 polymorphic bands were generated by 158 random primers. Among them, 86 Yatsufusa specific bands generated by 52 primers were examined for mapping. Most bands except three segregated in Mendelian fashion fitting the expected 1:1 ratio. The total length of the map was 533 cM distributed in 15 linkage groups. The map distance between adjacent markers ranged 0 to 32.8 cM, with an average distance of 9.1 cM (63 markers). Some markers were clustered and this may be due to the amplification of a repetitive sequence by the RAPDs. Primer pairs for a sequence characterized amplified region (SCAR) were developed and the segregation scores by the SCAR primers were in accordance with the RAPD data. Two QTL markers for number of axillary shoots and for early flowering were developed. One QTL for early flowering located in the linkage group 3 and explained 61 "io of the phenotypic variation. The other QTL for the number of axillary shoots located in the linkage group 4 explained 55 % of the phenotypic variation.tion.