• 한국식품과학회지
• /
• 제32권6호
• /
• pp.1331-1335
• /
• 2000

김치 젖산균인 WL6는 API kit 또는 Biolog system방법에 의하여 동정한 결과, Leuconostoc mesenteroides ssp. cremoris, Leu. mesenteroides ssp. dextranicum 또는 Lactobacillus bifermentans로 나타나 동정되지 않았다. 그러나, pepN gene과 16S rRNA gene으로부터 2개의 specific-sequence primer set을 제조하여 PCR 방법으로 증폭한 후에 표준균주들과 비교한 결과, WL6는 Lactobacillus bifermentans로 추정되었다.

• 한국컴퓨터정보학회논문지
• /
• 제22권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
• /
• 제2권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
• /
• 제39권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.

• 한국멀티미디어학회논문지
• /
• 제15권11호
• /
• pp.1358-1368
• /
• 2012

RFID (Radio Frequency Identification) 태그 순차 추정 기법은 RFID 리더의 움직임을 이용하여 선형적으로 배열된 수동형 태그들의 물리적인 순서를 추정하는 것이다. 수동형 태그와 리더는 전자기 유도에 의한 미세 전파를 이용하여 통신하므로 수동형 태그의 스캔(scan)은 불안정하게 이루어진다. 본 논문에서는 순차 추정의 정확도를 높이기 위해 리더의 왕복 스캔을 이용하였다. 제안 기법은 먼저 리더의 움직임이 바뀌는 반환점을 찾아낸다. 그리고 이동 방향별로 매 읽기 주기에 읽혀지는 태그들의 집합을 이용하여 태그 전체의 순차를 추정한다. 실험을 통해 제안하는 기법이 다양한 환경에서 순차추정의 정확도를 높일 수 있음을 보였다.

• 미생물학회지
• /
• 제39권2호
• /
• pp.67-75
• /
• 2003

비교유전체학의 주요 주제 중 유전자서열을 분류하고 단백질기능을 예측하는 연구가 있으며, 이를 위해 단백질 구조, 공통서열 및 바인딩 위치 예측등의 방법과 함께, 전유전체 서열에서 구해지는 유사도 그래프를 분석해 상동유전자를 검색하는 계산학적인 접근방법이 있다. 유사도그래프를 사용한 방법은 서열에 대한 기존 지식에 의존하지 않는 장점이 있지만 유사도 하한값과 같은 주관적인 임계값이 필요한 단점이 있다. 본 논문에서는 반복적으로 그래프를 분해하는 이전의 방법을 일반화시켜, 유사도 그래프에 기반한 유전자 서열군집분석 방법론과 객관적이고 안정적인 파라미터 임계값 계산 방법을 제안한다. 제시된 방법으로 알려진 미생물 유전체 서 열을 분석하여 이전의 방법인 BAG 알고리즘 결과와 비교했다.

• Communications for Statistical Applications and Methods
• /
• 제9권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.

• 대한수학회보
• /
• 제35권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.

• 호남수학학술지
• /
• 제24권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.

• 품질경영학회지
• /
• 제17권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.