• Communications for Statistical Applications and Methods
• /
• 제6권1호
• /
• pp.207-220
• /
• 1999

In this paper, some of the issue about a group sequential method are considered in the Bayesian context. The continuous time optimal stopping boundary can be used to approximate the optimal stopping boundary for group sequential designs. The exact stopping boundary for group sequential design is obtained by using the backward induction method and is compared with the continuous optimal stopping boundary and the corrected continuous stopping boundary.

• Journal of Multimedia Information System
• /
• 제6권4호
• /
• pp.323-328
• /
• 2019

In this paper, a method of constructing an advanced sequential circuit over finite fields is proposed. The method proposed an algorithm for assigning all elements of finite fields to digital code from the properties of finite fields, discussed the operating characteristics of T-gate used to construct sequential digital system of finite fields, and based on this, formed sequential circuit without trajectory. For this purpose, the state transition diagram was allocated to the state dependency code and a whole table was drawn showing the relationship between the status function and the current state and the previous state. The following status functions were derived from the status function and the preceding table, and the T-gate and the device were used to construct the sequential circuit. It was confirmed that the proposed method was able to organize sequential digital systems effectively and systematically.

• Journal of information and communication convergence engineering
• /
• 제8권4호
• /
• pp.421-426
• /
• 2010

This paper presents a method of design the counter using sequential system based on synchronous techniques. For the design the counter, first of all, we derive switching algebras and their operations. Also, we obtain the next-state functions, flip-flop excitations and their input functions from the flip-flop. Then, we propose the algorithm which is a method of implementation of the synchronous sequential digital logic circuits. Finally, we apply proposed the sequential logic based on synchronous techniques to counter.

• 전기의세계
• /
• 제18권6호
• /
• pp.33-45
• /
• 1969

The purpose of this paper is design the most important part of sequential control systems, that is, command-treatment part, from the signal-transformation point of view. An orderly procedure is developed by which for sequential control systems the experimental design method can be reduced to the rational design method. Important in this procedure are: 1. To make total block diagram of sequential control systems by determining input and output signals of command-treatment part. 2. To partition over-all block diagram by observing each output signal. 3. To design concretely minimum block diagram by using the operational block diagram. By applying the method for partitioning the circuit to the design, the design method for sequential control systems is organized and done rationally without the aid of experiece.

• 식물병연구
• /
• 제21권1호
• /
• pp.20-23
• /
• 2015

A sequential planting method was developed to screen rice plants with durable resistance against rice blast in a short time, and applied for several years in Korean rice breeding program. In this study, we showed the advantages of a sequential planting method compared to other pathogenicity tests. The correlation analysis among three pathogenicity tests and other factors demonstrated that durable resistance depended on the average of diseased leaf area and the number of compatible pathogens. Significant correlations were found in the nursery test but not in the field test result. In addition, we traced changes in the pathogen population during sequential planting stages through re-isolation of the pathogen. The portion of compatible pathogens was increased during sequential planting. Through this study, we provide an effective sequential planting method and direction of durable resistance in a breeding program.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제32권2호
• /
• pp.75-84
• /
• 2005

연속패턴은 다양한 분야에서 사용되는 데이타 마이닝 기법의 한 종류이다. 하지만 현재의 연속 패턴 방법은 한개의 속성내에서의 패턴만을 감지할 수 있으며 속성간의 패턴을 생성할 수 없다. 다차원의 연속패턴은 일차원에 비하여 훤씬 유용한 정보를 제공할 수 있다. 본 연구에서는 Hellinger 엔트로피 함수를 사용하여 다차원의 연속패턴을 생성하는 방법을 게시한다 기존의 연속패턴방법과 달리 본 방법에서는 각 연속패턴의 중요도를 자동으로 계산할 수 있다. 또한 계산의 복잡도를 감소시키기 위한 다수의 법칙이 개발되었으며 다수의 실험 결과를 제시하였다.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2006년도 Proceedings of ISRS 2006 PORSEC Volume II
• /
• pp.627-630
• /
• 2006

Sequential Pattern Mining is the mining approach which addresses the problem of discovering the existent maximal frequent sequences in a given databases. In the daily and scientific life, sequential data are available and used everywhere based on their representative forms as text, weather data, satellite data streams, business transactions, telecommunications records, experimental runs, DNA sequences, histories of medical records, etc. Discovering sequential patterns can assist user or scientist on predicting coming activities, interpreting recurring phenomena or extracting similarities. For the sake of that purpose, the core of sequential pattern mining is finding the frequent sequence which is contained frequently in all data sequences. Beside the discovery of frequent itemsets, sequential pattern mining requires the arrangement of those itemsets in sequences and the discovery of which of those are frequent. So before mining sequences, the main task is checking if one sequence is a subsequence of another sequence in the database. In this paper, we implement the subsequence matching method as the preprocessing step for sequential pattern mining. Matched sequences in our implementation are the normalized sequences as the form of number chain. The result which is given by this method is the review of matching information between input mapped sequences.

• 대한원격탐사학회지
• /
• 제22권5호
• /
• pp.457-462
• /
• 2006

Sequential Pattern Mining is the mining approach which addresses the problem of discovering the existent maximal frequent sequences in a given databases. In the daily and scientific life, sequential data are available and used everywhere based on their representative forms as text, weather data, satellite data streams, business transactions, telecommunications records, experimental runs, DNA sequences, histories of medical records, etc. Discovering sequential patterns can assist user or scientist on predicting coming activities, interpreting recurring phenomena or extracting similarities. For the sake of that purpose, the core of sequential pattern mining is finding the frequent sequence which is contained frequently in all data sequences. Beside the discovery of frequent itemsets, sequential pattern mining requires the arrangement of those itemsets in sequences and the discovery of which of those are frequent. So before mining sequences, the main task is checking if one sequence is a subsequence of another sequence in the database. In this paper, we implement the subsequence matching method as the preprocessing step for sequential pattern mining. Matched sequences in our implementation are the normalized sequences as the form of number chain. The result which is given by this method is the review of matching information between input mapped sequences.

• 대한전기학회논문지
• /
• 제32권11호
• /
• pp.404-416
• /
• 1983

This paper is concerned with the design automation of the sequential machines. The operations of sequential machine can be diveded into two types such as synchronous and asynchronous sequential machine and their realization is treated in separate mode. But, in order to integrate logic circuits in high volume, mixed mode sequential machine uses common circuitry that consists of gates and flip-flops. Proposed sequential machine can be designed by several method, which are hard-wired implementation, firmware realization by PLA and ROM. And then onr example shows the differnces among three design mothods. Finally, computer algorithm(called MINIPLA) is discussed for various application of mixed-mode sequential machine.

• 한국CDE학회논문집
• /
• 제11권3호
• /
• pp.205-210
• /
• 2006

Curve tessellation, which generates a sequence of points from a curve, is very important for curves rendering on a computer screen and for NC machining. For the most case the sequence of discrete points is used rather than a continuous curve. This paper deals with a method of tessellation by calculating the maximal deviation of a curve. The maximal deviation condition is introduced to find the point with the maximal chordal deviation on a curve segment. In the previous research a curve tessellation was tried by the subdivision method, that is, a curve is subdivided until the maximal chordal deviation is less than the given tolerance. On the other hand, a curve tessellation by sequential method is tried in this paper, that is, points are generated successively by using the local property of a curve. The sequential method generates relatively much less points than the subdivision method. Besides, the sequential method can generate a sequence of points from a spatial curve by approximation to a planar curve. The proposed method can be applied for high-accuracy curve tessellation and NC tool-path generation.