• Honam Mathematical Journal
• /
• v.37 no.4
• /
• pp.549-557
• /
• 2015

We introduce strongly ${\kappa}$-$Fr{\acute{e}}chet$ and strongly ${\kappa}$-sequential spaces which are stronger than ${\kappa}$-$Fr{\acute{e}}chet$ and ${\kappa}$-net spaces respectively. For convenience, we use the terminology "${\kappa}$-sequential" instead of "${\kappa}$-net space", introduced by R.E. Hodel in [5]. And we study some properties and topological operations on such spaces. We also define strictly ${\kappa}$-$Fr{\acute{e}}chet$ and strictly ${\kappa}$-sequential spaces which are more stronger than strongly ${\kappa}$-$Fr{\acute{e}}chet$ and strongly ${\kappa}$-sequential spaces respectively.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.220-223
• /
• 2002

The digital logic systems(DLS) is classified into digital combinational logic systems(CDLS) and digital sequential logic systems(SDLS). This paper presents a method of constructing the digital sequential logic systems without feedback. Firstly we assign all elements in Finite Fields to P-valued digit codes using mathematical properties of Finine Fields. Also, we discuss the operarional properties of the building block T-gate that is used to realizing digital sequential logic systems over Finite Fields. Then we realize the digital sequential logic systems without feedback. This digital sequential logic systems without feedback is constructed ny following steps. Firstly, we assign the states in the state-transition diagram to state P-valued digit dodo, then we obtain the state function and predecessor table that is explaining the relationship between present state and previous states. Next, we obtained the next-state function and predecessor table. Finally, we realize the circuit using T-gate and decoder.

• Journal of Korean Society for Quality Management
• /
• v.25 no.3
• /
• pp.22-38
• /
• 1997

In a traditional sequential acceptance sampling plan, it is assumed that the sampled items are independent each other. In this paper, stochastically dependent sequential acceptance sampling plans are dealt when there exists dependency between sampled items. Monte-Calro algorithm is used to find the acceptance and rejection probabilities of a lot. The number of defectives for the test to be accepted and rejected in probability ratio sequential test can be found by using these probabilities. The formula for measures of performance of these sampling plans is developed. Type I and II error probabilities are estimated by simulation. This research can be a, pp.ied to sequential sampling procedures in place of control charts where there is a recognized and necessary dependency during the production processes. Also, dependent multiple acceptance sampling plans can be derived by extending this sequential sampling procedure. As a numerical example, a Markov dependent process model is given, and the characteristics of the sampling plans are examined according to the change of the dependency factor.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.4
• /
• pp.351-359
• /
• 2002

In this paper, stochastically dependent single and sequential acceptance sampling plans are dealt when the process follows a Polya process model. A Monte-Cairo algorithm is used to find the acceptance and rejection probabilities of a lot. The number of defectives for the test to be accepted and rejected in a probability ratio sequential test can be found by using these probabilities. The formula to measure performance of these sampling plans is developed. Type I and II error probabilities are estimated by simulation. Dependent multiple acceptance sampling plans can be derived by extending the sequential sampling procedure. In numerical examples, single and sequential sampling plans of a Polya dependent process are examined and the characteristics are compared according to the change of the dependency factor.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.880-883
• /
• 2005

This paper presents a method of constructing the sequential logic machines over finite fields(or galois fields). The proposed the sequential logic machines is constructed by as following. First of all, we obtain the linear characteristics between present state and next state based on mathematical properties of finite fields and sequential logic machines. Next, we realize the sequential logic machines over finite field GF(P) using above linear characteristics and characteristic polynomial that expressed using by matrix.

• Proceedings of the KIEE Conference
• /
• 1985.07a
• /
• pp.257-261
• /
• 1985

This paper deals with the personal computer based design for the sequential machines. Most part of sequential machine design have been implemented by using general purpose microprocessors in order to obtain the specific unctions required for their system. But, they have some difficulties in design stages. Knowledge of systems design method and high technology are basically applied to all the design stages.. Therefore ready made microcomputer system for personal use, personal computer, can be transformed to sequential machines by using the corresponding softwares and built-in personal computer input/output ports. Following the state transition diagram or table, we can obtain the ROM type of sequential machines directly and need not to design input/output interface except actuators and samplers because of capability of personal computer. Our main purpose of this design method are quick, flexible, reliable, modifiable circuit design of the sequential machines. In this paper, we use APPLE-II plus personal computer as target machine.

• Language and Information
• /
• v.9 no.1
• /
• pp.35-49
• /
• 2005

Lakoff(1986) claim that sequential fading alone suffices to sanction ATB violations cannot be supported in Korean verbal coordination of TP, since extraction from the conjunction of TP in Korean is impossible regardless of whether the conjuncts are interpreted sequentially or non-sequentially. However, ATB violations are allowed in the coordination of Non-TP, only when the conjuncts are interpreted sequentially. 1 will argue that Non-TP, in coordination are ambiguous between a conjunct and adjunct analysis. Furthermore, a claim made here is that the distinction between the sequential and non-sequential reading in Non-TP coordination is a distinction made by syntax, while the sequential vs. non-sequential reading in TP coordination is derived from semantics or pragmatics.

• Communications for Statistical Applications and Methods
• /
• v.28 no.5
• /
• pp.563-582
• /
• 2021

This paper deals with developing a general class of accelerated sequential procedures and obtaining the associated second-order approximations for the expected sample size and 'regret' (difference between the risks of the proposed accelerated sequential procedure and the optimum fixed sample size procedure) function. We establish that the estimation problems based on various lifetime distributions can be tackled with the help of the proposed class of accelerated sequential procedures. Extensive simulation analysis is presented in support of the accuracy of our proposed methodology using the Pareto distribution and a real data set on carbon fibers is also analyzed to demonstrate the practical utility. We also provide the brief details of some other inferential problems which can be seen as the applications of the proposed class of accelerated sequential procedures.

• Korean Journal of Mathematics
• /
• v.5 no.2
• /
• pp.211-215
• /
• 1997

In this paper, we introduce two notions of compactness defined by sequential convergence and compare them.

• Journal of the Korean Mathematical Society
• /
• v.51 no.6
• /
• pp.1321-1322
• /
• 2014