• Korean Journal of Food Science and Technology
• /
• v.32 no.6
• /
• pp.1331-1335
• /
• 2000

The WL6 strain isolated from Kimchi could not be made scientific name because it was identified as three species, i.e., Leuconostoc mesenternides ssp cremoris, Leu. mesenteroides ssp. dextranicum or Lactobacillus bifermentans when it was tested by API kit or Biolog system methods. The unidentifiable WL6 strain was finally reclassified as Lactobacillus bifermentans by genetic identification using two PCR-based specific sequence primer sets which were originated from homologous pepN and 16S rRNA genes.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.3
• /
• pp.69-79
• /
• 2017

In this paper, we propose our four-phase life cycle of P2P botnet with corresponding detection methods and the future direction for more effective P2P botnet detection. Our proposals are based on the intensive analysis that compares existing P2P botnet detection schemes in different points of view such as life cycle of P2P botnet, machine learning methods for data mining based detection, composition of data sets, and performance matrix. Our proposed life cycle model composed of linear sequence stages suggests to utilize features in the vulnerable phase rather than the entire life cycle. In addition, we suggest the hybrid detection scheme with data mining based method and our proposed life cycle, and present the improved composition of experimental data sets through analysing the limitations of previous works.

• Journal of information and communication convergence engineering
• /
• v.2 no.1
• /
• pp.26-31
• /
• 2004

In the last few years, The Semantic Web has increased the interest in ontologies. Ontology is an essential component of the semantic web. Ontologies continue to change and evolve. We consider the management of versions in ontology. We study a set of changes based on domain changes, changes in conceptualization, metadata changes, and temporal dimension. In many cases, we want to be able to search in historical versions, query changes in versions, retrieve versions on the temporal dimension. In order to support an ontology query language that supports temporal operations, we consider temporal dimension includes transaction time and valid time. Ontology versioning brings about massive amount of versions to be stored and maintained. We present the storage policies that are storing all the versions, all the sequence of changed element, all the change sets, the aggregation of change sets periodically, and the aggregation of change sets using a criterion. We conduct a set of experiments to compare the performance of each storage policies. We present the experimental results for evaluating the performance of different storage policies from scheme 1 to scheme 5.

• East Asian mathematical journal
• /
• v.39 no.4
• /
• pp.479-492
• /
• 2023

Although Euclidean plane geometry is implemented in the middle school course, there are three major problems in high school space geometry that can be intuitively taken for granted or misinterpreted as circular arguments. In order to solve this problem, this study proved three major problems using sets, Euclidean plane geometry, and parallel line postulates. This corresponds to a logical sequence and has mathematical and mathematical educational values. Furthermore, it will be possible to configure spatial geometry using sets, and by giving legitimacy to non-Euclidean spatial geometry, it will open the possibility of future research.

• Journal of Korea Multimedia Society
• /
• v.15 no.11
• /
• pp.1358-1368
• /
• 2012

A tag sequence estimation scheme is to estimate the physical sequence of passive RFID tags that are linearly spread using the movement of a RFID reader. Since RFID readers communicate with the passive tags by very weak radio waves, scanning passive tags are unstable. In this paper, we applied round-trip scanning of a reader to enhance the tag sequence estimation. Proposed scheme first determines the turning point of the reader movement, and then estimates the sequence of the tags using the tag sets scanned in each read cycles. Test experiments show that the proposed scheme can improve the estimation accuracy.

• Korean Journal of Microbiology
• /
• v.39 no.2
• /
• pp.67-75
• /
• 2003

One large topic in comparative genomics is to predict functional annotation by classifying protein sequences. Computational approaches for function prediction include protein structure prediction, sequence alignment and domain prediction or binding site prediction. This paper is on another computational approach searching for sets of homologous sequences from sequence similarity graph. Methods based on similarity graph do not need previous knowledges about sequences, but largely depend on the researcher's subjective threshold settings. In this paper, we propose a genome sequence clustering method of iterative testing and graph decomposition, and a simple method to calculate a strict threshold having biochemical meaning. Proposed method was applied to known bacterial genome sequences and the result was shown with the BAG algorithm's. Result clusters are lacking some completeness, but the confidence level is very high and the method does not need user-defined thresholds.

• Communications for Statistical Applications and Methods
• /
• v.9 no.3
• /
• pp.871-876
• /
• 2002

In this paper, we establish some characterizations of tightness for a sequence of random elements taking values in the space of upper-semicontinuous fuzzy sets with compact support in R.

• Bulletin of the Korean Mathematical Society
• /
• v.35 no.3
• /
• pp.515-525
• /
• 1998

In this paper we obtain a "compactness" result that asserts the existence, in certain sets of sequences, of a sequence which has a maximal reciprocal sum. We derive this result from a much more general theorem which will be proved by introducing a metric into the set of sequences and using a topological argument.

• Honam Mathematical Journal
• /
• v.24 no.1
• /
• pp.1-8
• /
• 2002

In this paper we will show that if E is an injective module over a commutative ring A, then the sequence of sets $Ass_{A}(A/I^{n})^{*(E)}),\;n{\in}N,$ is increasing and ultimately constant. Also we will obtain some results concerning the integral closure of ideals related to some modules.

• Journal of Korean Society for Quality Management
• /
• v.17 no.1
• /
• pp.69-81
• /
• 1989

This study is concerned with a job sequencing method using the concept of sampling technique in the case of Job Shop. This is the follow study of Kang and Ro (1988) which examined the possibility of application of sampling technique to determine the Job Sequence in the case of Flow Shop. Not only it is very difficult, but also it takes too much time to develop the appropriate job schedules that satisfy the complex work conditions. The most job sequencing algorithms have been developed to determine the best or good solution under the special conditions or assumptions. The application areas of these algorithms are also very narrow, so it is very hard to find the appropriate algorithm which satisfy the complex work conditions. In this case it is very desirable to develop a simple job sequencing method which can select the optimal job sequence or near optimal job sequence with a little effort. This study is to examine the effect of sampling job sequencing which can select the good job of 0.01%~5% upper good group. The result shows that there is the sets of 0.05%~23% job sequence group which has the same amount of performance measure with the optimal job sequence in the case of experiment of N/M/G/$F_{max}$. This indicates that the sampling job sequencing method is a useful job sequencing method to find the optimal or good job sequence with consuming a small amount of time. The results of ANOVA show that the only one factor, number of machines is the significant factor for determining the job sequence at ${\alpha}=0.01$. It takes about 10 minutes to compare the number of 10,000 samples of job sequence by personal computer and it is proved that the selection rate of the same job sequence with optimal job sequence is 23.0%, 3.9% and 0.065% in the case of 2 machines, 3 machines and 4 machines, respectively. The area of application can readily be extended to the other work condition.