• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.3
• /
• pp.10-20
• /
• 2020

This paper presents a method to measure the similarity of assigned jobs in the gravure printing operation based on the chromaticity and color sequence, and order the jobs accordingly. The proposed dispatching rule can be used to fulfill diverse manufacturing site requirements because the parameters can be adjusted to prioritize chromaticity and color sequence. In general, dispatching rules either ignore the job-changing time or require that the time be clearly defined. However, in the gravure printing operation targeted in this study, it is difficult to apply the general dispatching rule because of the difficulties in quantifying the job-changing time. Therefore, we propose a method for generalizing assignment rules of the job planner, allocating relative similarity among assigned jobs, and determining the sequence of jobs accordingly. Chromaticity priority is determined by the arrangement of the color assignments in the printing operation; color sequence priority is determined by the addition, deletion, or change in a specific color sequence. Finally, the job similarity is determined by the dot product of the chromaticity and color sequence priorities. Implementation of the proposed dispatching rule at an actual manufacturing site showed the planner present the same job order as that obtained using the proposed rule. Therefore, this rule is expected to be useful in industrial sites where clear quantification of the job-changing time is not possible.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.31 no.2
• /
• pp.104-111
• /
• 2008

A process mining is considered to support the discovery of business process for unstructured process model, and a process mining algorithm by using the associated rule and sequence pattern of data mining is developed to extract information about processes from event-log, and to discover process of alternative, concurrent and hidden activities. Some numerical examples are presented to show the effectiveness and efficiency of the algorithm.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1995.11a
• /
• pp.115-125
• /
• 1995

본 논문에서는 컴퓨터 시스템에서 침입 감지 시스템을 설계함에 있어서 사용될 수 있는 새로운 방법인 Event Sequence Tracking 방법을 제안하였다. Event Sequence Tracking 방법에서는 컴퓨터 시스템의 공격방법을 크게 두가지로 분류한다. 첫번째는 일련의 시스템 명령어를 이용한 공격방법이고 두번째는 침입자 자신이 만들었거나 다른 사람으로부터 얻은 프로그램을 이용하는 방법이다. 첫번째 공격방법에 대한 감지방법은 시스템을 공격할 때 사용한 일련의 시스템 명령어들을 감사 데이타를 분석하여 찾아내고 이 결과를 기존에 알려진 공격 시나리오들과 비교하여 침입자를 찾아내는 방식이다. 두번째 공격방법에 대한 감지 방법은 보안 관리자가 정해놓은, 시스템에서 일반 사용자가 할 수 없는 행위에 관한 보안 정책에 따라 Key-Event 데이타 베이스를 만들고 여기에 해당하는 event의 집합을 감사 데이타에서 찾아내는 방법이다. Event Sequence Tracking 방법은 Rule-based Penetration Identification 방법의 일종으로서 시스템의 공격방법을 분류하여 컴퓨터 시스템에의 침입을 효과적으로 감지할 수 있다는 것과 rule-base의 생성과 갱신을 함에 있어서 보다 간단하게 할 수 있다는 장점을 갖는다.

• Journal of the Korean Statistical Society
• /
• v.20 no.1
• /
• pp.67-76
• /
• 1991

The empirical Bayes version involves ″independent″ repetitions(a sequence) of the component decision problem. With the varying sample size possible, these are not identical components. However, we impose the usual assumption that the parameters sequence $\theta$=($\theta$$_1$, $\theta$$_2$, …) consists of independent G-distributed parameters where G is unknown. We assume that G $\in$ g, a known family of distributions. The sample size $N_i$ and the decisin rule $d_i$ for component i of the sequence are determined in an evolutionary way. The sample size $N_1$ and the decision rule $d_1$$\in$ $D_{N1}$ used in the first component are fixed and chosen in advance. The sample size $N_2$and the decision rule $d_2$ are functions of *see full text($\underline{X}^1$equation omitted), the observations in the first component. In general, $N_i$ is an integer-valued function of *see full text(equation omitted) and, given $N_i$, $d_i$ is a $D_{Ni}$/-valued function of *see full text(equation omitted). The action chosen in the i-th component is *(equation omitted) which hides the display of dependence on *(equation omitted). We construct an empirical Bayes decision rule for estimating normal mean and show that it is asymptotically optimal.

• Korean Management Science Review
• /
• v.13 no.2
• /
• pp.25-48
• /
• 1996

Mixed Model Assembly Lines (MMALs) are increasingly used to produce differentiated products on a single assembly line without work-in-process storage, Usually, a typical MMAL consists of a number of (1) stations doing exactly the same operation on every job, (2) stations involving operations with different choices, and (3) stations offering operations that are not performed on every job, or that are performed on every job but with many options. For stations of the first type there is no sequencing problem at all. However, for the second type a set-up cost is incurred each time the operation switches from one choice to another. At the third type of stations, different models, requring different amounts and choices of assembly work, creates an uneven flow of work along the line and variations in the work load at these stations. When a subsequence of jobs requires more work load than the station can handle, it is necessary to help the operations at the station or to complete the work elsewhere. Therefore, a schedule which minimize the sum of set-up cost and utility work cost is desired. So this study has developed Fixed Random Ordering Rule (FROR), Fixed Ascending Ordering Rule (FAOR), Fixed Descending Ordering Rule, and Extended NHR (ENHR). ENHR is to choose optimal color ordering of each batch with NHR, and to decide job sequence of the batch with it, too. As the result of experiments, ENHR was the best heuristic algorithm. NHR is a new heuristic rule in which only the minimum addition of violations from both partial sequence and unassigned sequence at every branch could be considered. And this is a heuristic sequencing rule for the third type of stations at MMAL. This study developed one more heuristic algorithm to test the performance of NHR, which is named as Practical Heuristic Rule (PHR).

• Journal of Korea Multimedia Society
• /
• v.10 no.9
• /
• pp.1106-1116
• /
• 2007

Recently e-commerce trade on the web has grown rapidly in scale and complexity, just as web site designs and web servers have become more complicated. In view of these complexities, it is obviously difficult to analyse web user's data since they web users employ so many different web paths. The existing association rule investigation algorithms identify all items with a high correlation. However even though users often only want to find items in which they have interest, it is still difficult to find the rules they want out of all of the many association rules found by existing algorithms. In this paper, we propose a system linking each node with the sequence association rule, linking all routes after finding a path corresponding to a user with the association rule-one of the data mining techniques which identify user patterns in web user paths. The suggested system helps us construct individualized or customer-subdivided sites using the sequence association rule in order to harmonize the paths of web users with user characters.

• 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.

• Language and Information
• /
• v.4 no.2
• /
• pp.93-105
• /
• 2000

I argue in this paper that the sequence of tense (SOT) phenomenon can be accounted for without positing a SOT rule, focusing on the contrast between the past under-past sentences which lead to ambiguity and those sentences which do not. The different interpreta- tion of past under past sentences depends on whether the stative or then non-stative predicates occur in the complement clauses in the propositional attitude verbs. Based on this, I also argue that the embedded past tense does not contribute to the seman- tics past tense in the complement clause. Instead, it is due to the occurrence of the stative or non-stative predicates in the complement clauses. The stative predicates are associated with the temporal precedence or the overlap relation, whereas the non-stative predicates the precedence relation only. This fact triggers the contrast in past- under- past sentences.(Korea University)

• Korean Management Science Review
• /
• v.18 no.1
• /
• pp.147-153
• /
• 2001

In this paper, we Propose the Job-Pair Comparison (JPC) rule to minimize total tardiness in a single machine. For this purpose we derive conditional expression to choose the desirable job sequence. We also prove the transitivity of JPC rule, to prevent cycle and to decrease the complexity of comparison.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.607-609
• /
• 2004

본 논문은 시 계열 데이터에서의 연관성 발견에 있어서 복잡성과 연산량을 효과적으로 줄이며 연관성을 찾아내는 기법에 대해 기술한다. 기존의 시 계열 데이터에서의 sequence 분할 방법은 복잡한 clustering 기법을 사용하여 많은 시간과 resource를 필요로 하는 제한이 있다 이에 본 논문에서는 효과적인 sequence 분할을 위한 증감 table을 이용한 방법을 제안하였다.