• Journal of Korean Institute of Industrial Engineers
• /
• v.9 no.1
• /
• pp.23-31
• /
• 1983

A group scheduling problem, which is production scheduling problem associated with the concept of group technology, is studied under due date constraints in multi-stage manufacturing systems. The purpose of this paper is to develop and evaluate a practical heuristic procedure for determining group sequence and job sequence within each group to minimize total tardiness in multi-stage manufacturing systems. A heuristic algorithm has been developed by introducing the concept of relative measures of job tardiness and group tardiness for job sequencing and group sequencing, respectively. A numerical example is shown to illustrate the proposed procedure. The heuristic algoirthm is tested by comparisons with problems with known optimal solutions and also with random group schedules for a set of large-size problems. Results indicate that the proposed heuristic algorithm provides good solutions with small computational requirements, and thus is viable for large size problems in practice.

• Journal of the Korean Mathematical Society
• /
• v.43 no.3
• /
• pp.491-506
• /
• 2006

In this paper, we extend the concept of the group ${\varepsilon}(X)$ of self homotopy equivalences of a space X to that of an object in the category of pairs. Mainly, we study the group ${\varepsilon}(X,\;A)$ of pair homotopy equivalences from a CW-pair (X, A) to itself which is the special case of the extended concept. For a CW-pair (X, A), we find an exact sequence $1\;{\to}\;G\;{\to}\;{\varepsilon}(X,\;A)\;{to}\;{\varepsilon}(A)$ where G is a subgroup of ${\varepsilon}(X,\;A)$. Especially, for CW homotopy associative and inversive H-spaces X and Y, we obtain a split short exact sequence $1\;{\to}\;{\varepsilon}(X)\;{\to}\;{\varepsilon}(X{\times}Y,Y)\;{\to}\;{\varepsilon}(Y)\;{\to}\;1$ provided the two sets $[X{\wedge}Y,\;X{\times}Y]$ and [X, Y] are trivial.

• Research in Mathematical Education
• /
• v.25 no.3
• /
• pp.227-244
• /
• 2022

The concrete-representational-abstract integrated (CRA-I) sequence is an explicit approach for teaching students who struggle in mathematics. This approach is beneficial because it assists students in the development of conceptual understanding. This article describes how the approach is used in general as well as its use with a specific geometry concept, area of a rectangle. The author will describe why one might choose CRA-I and the steps needed for implementation. Finally, the CRA-I steps will be shown with a lesson series related to teaching the concept of area. The article will describe lesson activities, methods, materials, and procedures.

• Journal of Korea Multimedia Society
• /
• v.1 no.1
• /
• pp.109-119
• /
• 1998

This paper describes a research result on automatic generation of Abstract Test Suite from INAP protocol in formal specifications by applying many existing related algorithms such as Rural Chinese Postman Tour and UIO sequence concepts. We use the I/O FSM generated from SDL specifications and a characterizing sequence concepts. We use the I/O FSM generated from SDL specifications and a characterizing sequence, called UIO sequence, is defined for the I/O FSM. The UIO sequence is combined with the concept of Rural Chinese Postman tour to obtain an optimal test sequence. It also proposes an estimation methodology of the fault courage for the Test Suite obtained by our method and their translation into the standardized test notation TTCN.

• Kyungpook Mathematical Journal
• /
• v.50 no.1
• /
• pp.59-69
• /
• 2010

The main aim of this article is to introduce a new class of sequence spaces using the concept of n-norm and to investigate these spaces for some linear topological structures as well as examine these spaces with respect to derived (n-1)-norm. We use an Orlicz function, a bounded sequence of positive real numbers and some difference operators to construct these spaces so that they become more generalized and some other spaces can be derived under special cases. These investigations will enhance the acceptability of the notion of n-norm by giving a way to construct different sequence spaces with elements in n-normed spaces.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.6
• /
• pp.105-114
• /
• 1984

A fast pseudo-noise (PN) sequence acquisition algorithm for the direct-sequence (DS) spread spectrum system is proposed. The basic concept of the algorithm has been adopted from that of the classical sliding correlator. Mathematical modeling, analysis and computer simulation of the proposed system have been done. The results of analysis and computer simulation show that the acquisition system yields a significant performance improvement over the sliding correlator. Its acquisition time takes only 45 ms when signal-to-noise ratio(SNR) is -18dB. The algorithm developed has been implemented in hardware and its experimental result is also given.

• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.147-153
• /
• 2001

This paper presents techniques for discovering rules with elastic patterns. Elastic patterns are useful for discovering rules from data sequences with different sampling rates. For fast discovery of rules whose heads and bodies are elastic patterns, we construct a suffix tree from succinct forms of data sequences. The suffix tree is a compact representation of rules, and is also used as an index structure for finding rules matched to a target head sequence. When matched rules cannot be found, the concept of rule relaxation is introduced. Using a cluster hierarchy and a relaxation error, we find the least relaxed rules that provide the most specific information on a target head sequence. Performance evaluation through extensive experiments reseals the effectiveness of the proposed approach.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.321-327
• /
• 2006

Recently there has been enormous growth in the amount of commercial and scientific data. Such datasets consist of sequence data that have an inherent sequential nature. However, only a few of the existing clustering algorithms consider sequentiality. This study presents a similarity measure and a method for clustering such sequence datasets. Especially, we present an extended concept of the measure of similarity, which considers various conditions. Using a splice dataset, we show that the quality of clusters generated by our proposed clustering algorithm is better than that of clusters produced by traditional clustering algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1307-1329
• /
• 2022

This paper proposes an improved Pseudorandom Sequence Generator (PRSG) based on the concept of modular arithmetic systems with non-integral numbers. The generated random sequence use in various cryptographic applications due to its unpredictability. Here the mathematical model is designed to solve the problem of the non-uniform distribution of the sequences. In addition, PRSG has passed the standard statistical and empirical tests, which shows that the proposed generator has good statistical characteristics. Finally, image encryption has been performed based on the sort-index method and diffusion processing to obtain the encrypted image. After a thorough evaluation of encryption performance, there has been no direct association between the original and encrypted images. The results show that the proposed PRSG has good statistical characteristics and security performance in cryptographic applications.

• Kyungpook Mathematical Journal
• /
• v.50 no.4
• /
• pp.565-574
• /
• 2010

In this paper we introduce the concept of lacunary statistical and lacunary strongly convergence of generalized difference sequence of fuzzy real numbers. We prove some inclusion relations and also study some of their properties.