• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.4
• /
• pp.192-202
• /
• 2009

Disassembly of products at their end-of-life (EOL) is a prerequisite for recycling or remanufacturing, since most products should be disassembled before being recycled or remanufactured as secondary parts or materials. In disassembly sequence planning of EOL products, considered are the uncertainty issues, i.e., defective parts or joints in an incoming product, disassembly damage, and imprecise net profits and costs. The paper deals with the problem of determining the disassembly level and corresponding sequence, with the objective of maximizing the overall profit under uncertainties in disassembly cost and/or revenue. The solution is represented as the longest path on a directed acyclic graph where parameter (arc length) uncertainties are modeled in the form of intervals. And, a heuristic algorithm is developed to find a path with the minimum worst case regret, since the problem is NP-hard. Computational experiments are carried out to show the performance of the proposed algorithm compared with the mixed integer programming model and Conde's heuristic algorithm.

• Journal of Information Processing Systems
• /
• v.13 no.6
• /
• pp.1527-1543
• /
• 2017

MiRNA is a biological short sequence, which plays a crucial role in almost all important biological process. MiRNA patterns are common sequence segments of multiple mature miRNA sequences, and they are of significance in identifying miRNAs due to the functional implication in miRNA patterns. In the proposed approach, the primary miRNA patterns are produced from sequence alignment, and they are then cut into short segment miRNA patterns. From the segment miRNA patterns, the candidate miRNA patterns are selected based on estimated probability, and from which, the potential miRNA patterns are further selected according to the classification performance between authentic and artificial miRNA sequences. Three parameters are suggested that bi-nucleotides are employed to compute the estimated probability of segment miRNA patterns, and top 1% segment miRNA patterns of length four in the order of estimated probabilities are selected as potential miRNA patterns.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.441-445
• /
• 2009

In this paper we propose the method of generating the maximum length sequence based on Self Programmable Cellular Automata. Recently there is a research trend such that increased CA dimensionality and PCA which applies different rules on the same cell at different time steps can make a sequence with a long period. By changing a cell's state transition rules to give the cell dynamic energy at each time step, we can make the period of a sequence longer and the randomness of a sequence higher.

• Korean Journal of Plant Taxonomy
• /
• v.52 no.4
• /
• pp.262-268
• /
• 2022

The complete chloroplast genome (cp genome) sequence of Clematis calcicola J. S. Kim (Ranunculaceae) is 159,655 bp in length. It consists of large (79,451 bp) and small (18,126 bp) single-copy regions and a pair of identical inverted repeats (31,039 bp). The genome contains 92 protein-coding genes, 36 transfer RNA genes, eight ribosomal RNA genes, and two pseudogenes. A phylogenetic analysis based on the cp genome of 19 taxa showed high similarity between our cp genome and data published for C. calcicola, which is recognized as a species endemic to the Korean Peninsula. The complete cp genome sequence of C. calcicola reported here provides important information for future phylogenetic and evolutionary studies of Ranunculaceae.

• Journal of the Korean Statistical Society
• /
• v.12 no.2
• /
• pp.95-99
• /
• 1983

Limiting law for maximum queue length in G/M/1 queue system is derived. Furthermore, a simple approach using mixing sequence is also discussed.

• Journal of the Korean Statistical Society
• /
• v.6 no.2
• /
• pp.97-102
• /
• 1977

For a sequence of Markov dependent Bernoulli trails, asymptotic normality of the number of success runs with length $r \geq 1$ is established, when the number of trials tends to infinity.

• Journal of Microbiology and Biotechnology
• /
• v.4 no.4
• /
• pp.264-269
• /
• 1994

To determine the nucleotide sequence of the ds RNA segment B containing the RNA dependent RNA polymerase (RdRp) gene of the DRT strain of infectious pancreatic necrosis virus (lPNV), the cDNA of the ds RNA segment B of the DRT strain of IPNV was synthesized using the reverse transcriptase (RT)-polymerase chain reaction (PCR) and its cDNA nucleotide sequence was determined. The DRT segment B was 2, 783 bp long and contained only a single long open reading frame (ORF) of 2, 535 bp in length. This ORF nucleotides encoded the VPl protein, the putative RdRp of IPNV. The VPl protein comsisted of 845 amino acids. The molecular weight of the RdRp, as deduced from the nucleotide sequence, is 94, 426. The nucleotide sequence of the ORF of the DRT showed 89.7% homology to the Jasper strain, but 80.8% to the Sp strain. The amino acid sequence of the ORF of the DRT sho.wed 97.6% homology to the Jasper strain, but 88.7% to the Sp strain. The conserved GTP-binding motif was detected in VPl protein.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.11 no.5
• /
• pp.23-33
• /
• 2008

In this paper, we verify the performance of LDPC coded OFDM/DS system by Monte-Carlo simulation of BER on Eb/No. The simulation results show that LDPC coded OFDM/DS has a strong anti-jamming characteristic over pulse-noise jammer and partial-band noise jammer. The performance of LDPC coded OFDM/DS system is evaluated on both faded waveforms and non-faded waveforms. For non-faded waveforms, high coding gain is attained due to LDPC, even when waveforms have short PN sequence and JSR is only 5dB. Especially, the increase in the repeated number of LDPC decoding enhances coding gain. However, faded waveforms cannot achieve sufficient average effect when PN sequence is short. High coding gain of faded waveforms can be achieved by extending length of PN sequence. In addition, we compare LDPC coded OFDM/DS system with Convolutional coded OFDM/DS system. The simulation results illustrate that when LDPC coded OFDM/DS system with short PN sequence has sufficient average effects, the system shows lower BER than Convolutional coded OFDM/DS system with long PN sequence.

• Proceedings of the Zoological Society Korea Conference
• /
• 1995.10b
• /
• pp.120-120
• /
• 1995

The total size of the pF AR1, a genomic clone of Frankia FaCI, was estimated to be about 44Kb by summation of the individual fragment length generated by single or double restriction enzymes. Southern hybridization analyses with Azotobacter vinelandii nif-genes as probes and partial sequencing analyses of the subclones revealed that organization of the nif-gene in the FaCI strain was nifV, H, D, K, E, N, X, W, B. The organization of the structural genes for nitrogenase is the same in this Frankia strain as it is in most other nitrogen-fixing prokaryotes but the positioning of the nifV-like gene relative to the nifHDK cluster differs. A consensus nif-promoter-like sequence, found at 5' of nifH, was not detected upstream of the niJV-like gene. nifV-like gene contained a ORF of 1206 NT encoding 401 amino acids. The nucleotide sequence and deduced amino acid sequence of the gene exhibit homology value of 65% and 41% with that from A vinelandii, respectively. The putative Shine-Dargamo sequences were present preceding nitK, nifH, D, K, and nifE, and in nitK gene putative start codon GTG was detected instead of A TG. The nucleotide and amino acid sequence of niIK of FaCI showed 82% and 76% homolgy with those of Frankia HFPCc 13, respectively. Amino acid sequence of niIK showed 69% and 61% homology with those of A vinelandii, Klebsiella pnewnoniae, respectively, while that of nifE 73% and 71%, respecti vely.i vely.

• Journal of the Korean Statistical Society
• /
• v.13 no.2
• /
• pp.87-106
• /
• 1984

It ${X_t}$ is a sequence of independent identically distributed normal random variables, then the conditional probability density of $X_1, X_2, \cdots, X_n$ given the first p+1 sample autocovariances converges to the maximum entropy probability density satisfying the corresponding covariance constraints as the length of the sample sequence tends to infinity. This establishes that the maximum entropy probability density and the associated Gaussian autoregressive process arise naturally as the answers of conditional limit problems.