• Korean Journal of Microbiology
• /
• v.29 no.2
• /
• pp.80-84
• /
• 1991

We cloned and expressed hepatitis B viral core antigen (HBcAg) gene in E. coli using $P_{L}$ promoter system. For optimal expression of the gene, we undertook the studies on the effects of the distance between Shine-Dalgarno (SD) sequence and start codon, copy number of repressor gene, induction temperature, and the stability of the core antigen. The results demonstrated that the induction at 37.deg.C was more efficient than at 42.deg.C, and the 11 base pairs (bp) distance between SD sequence and start codon of HBcAg gene was more efficient than the 15 bp distance in E. coli. The copy number of cI857 repressor gene did not influence on the expression of HBcAg, and the expression level of HBcAg in mutant type (low protease activity) and wild type strains was almost the same. The produced core antigen appeared to be HBcAg not HBeAg judged by two different radioimmunoassat (RIA) kits. This result suggested that the antigen was stable in E. coli.i.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1995.10a
• /
• pp.30-36
• /
• 1995

Conventionally design for multi-stage cold forging depends on the designer's experience and decision-making. Due to such non-deterministic nature of the process sequence design, a flexible inference engine is needed for process design expert system. In this study, A* searching algorithm was introduced to arrive at the vetter process sequence design considering the number of forming stages and levels of effective strain, effective stress, and forming load during the porcess. In order to optimize the process sequence in producing the final part, cost function was defined and minimized using the proposed A* searching algorithm. For verification of the designed forming sequences, forming experiments and finite element analyses were carried out in the present investigation. The developed expert system using A* searching algorithm can produce a flexible design system based on changes in the number of forming stages and weights.

• Asian-Australasian Journal of Animal Sciences
• /
• v.22 no.7
• /
• pp.955-961
• /
• 2009

The aim of this study was to determine the specific polymorphic sites in cattle breeds and inter- and interbreed genetic variation among breeds and to develop a databank of Turkish native cattle mtDNA using sequence analysis. The entire D-loop region was analyzed based on DNA sequences in Turkish Grey, East Anatolian Red, South Anatolian Red, and Anatolian Black native breeds. In total, 68 nucleotide differences were observed at 26 different sites. The variable positions consisted of 22 transitions, two transversions, and two insertions, but no deletions. Haplotype number, haplotype diversity, nucleotide diversity, and mean number of pairwise difference values were found to be 17, 0.993, 0.00478, and 4.275, respectively. In addition, a phylogeny was developed by comparison among cattle populations for which the entire D-loop sequence was available. A high level of genetic variation was observed within and among the native cattle breeds.

• The Pure and Applied Mathematics
• /
• v.20 no.3
• /
• pp.137-148
• /
• 2013

In this paper, we study the Lie-generalized Fibonacci sequence and the root system of rank 2 symmetric hyperbolic Kac-Moody algebras. We derive several interesting properties of the Lie-Fibonacci sequence and relationship between them. We also give a couple of sufficient conditions for the existence of the integral points on the hyperbola $\mathfrak{h}^a:x^2-axy+y^2=1$ and $\mathfrak{h}_k:x^2-axy+y^2=-k$ ($k{\in}\mathbb{Z}_{>0}$). To list all the integral points on that hyperbola, we find the number of elements of ${\Omega}_k$.

• Journal of applied mathematics & informatics
• /
• v.28 no.5_6
• /
• pp.1439-1443
• /
• 2010

For a positive integer k $\geq$ 2, the k-bonacci sequence {$g^{(k)}_n$} is defined as: $g^{(k)}_1=\cdots=g^{(k)}_{k-2}=0$, $g^{(k)}_{k-1}=g^{(k)}_k=1$ and for n > k $\geq$ 2, $g^{(k)}_n=g^{(k)}_{n-1}+g^{(k)}_{n-2}+{\cdots}+g^{(k)}_{n-k}$. And the k-Lucas sequence {$l^{(k)}_n$} is defined as $l^{(k)}_n=g^{(k)}_{n-1}+g^{(k)}_{n+k-1}$ for $n{\geq}1$. In this paper, we give a representation of nth k-Lucas $l^{(k)}_n$ by using determinant.

• Journal of Korea Multimedia Society
• /
• v.20 no.5
• /
• pp.800-807
• /
• 2017

The Pattern Sequence-based Forecasting (PSF) is an approach to forecast the behavior of time series based on similar pattern sequences. The innovation of PSF method is to convert the load time series into a label sequence by clustering technique in order to lighten computational burden. However, it brings about a new problem in determining the number of clusters and it is subject to insufficient similar days occasionally. In this paper we proposed an adaption of the PSF method, which introduces a new clustering index to determine the number of clusters and imposes a threshold to solve the problem caused by insufficient similar days. Our experiments showed that the proposed method reduced the mean absolute percentage error (MAPE) about 15%, compared to the PSF method.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1718-1723
• /
• 1991

The determination of a production sequence is an important problem in a batch process operation. In this paper a new algorithm for a near optimal production sequence of N product in an M unit serial multiproduct batch process is proposed. The basic principle is the same as that of Johnson's algorithm for two-unit UIS system. Test results on a number of selected examples exhibit the superiority over previously reported results. In addition, a tabulation technique is presented to calculate the makespan of a given sequence of production for all processing units under UIS mode.

• The Pure and Applied Mathematics
• /
• v.20 no.3
• /
• pp.207-221
• /
• 2013

In this work we study the tribonacci numbers. We find a tribonacci triangle which is an analog of Pascal triangle. We also investigate an efficient method to compute any $n$th tribonacci numbers by matrix method, and find periods of the sequence by taking modular tribonacci number.

• Journal of the Korea Safety Management & Science
• /
• v.3 no.4
• /
• pp.103-112
• /
• 2001

In Factory, as the number of machine is increased the more maintenance efforts are necessary. Multi maintenance issues may occur at a certain time and the determination of maintenance sequence is needed. In this study, we first compare the priority of machines and the impact value using modified FMEA(Failure Mode Effect and Analysis) method. Also, CBR(Case-based Reasoning) approach is applied to retrieve similar fault cases of current machine problem. The proposed methodology will be useful to implement decision support system of maintenance sequence for CMMS/EAM (Computerized Maintenance Management System/Enterprise Asset Management).

• 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.