• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.10a
• /
• pp.124-127
• /
• 1998

One of the eventual goals of VR research is to provide valuable experiences to the participants. In this work, we view that the content of experience is composed of a sequence of events, and develop algorithms authoring those events. Event authoring can be realized by controlling agents in VE in two different modes: (1) the autonomous mode, in which the agent exhibit autonomous behaviors based on the current world status and its own personality, and (2) the event mode, in which the behaviors generated form the autonomous mode is further controlled to meet the needs of the experiment. We define the event authoring language, so that the authors can design experiments by writing event-programs. Then the architecture of event execution manager is described, which is the heart of event-program execution. prove the effectiveness of our approach by showing results of several experiments.

• Korean Journal of Computational Design and Engineering
• /
• v.17 no.2
• /
• pp.97-110
• /
• 2012

High performance sensors and modern data logging technology with real-time telemetry facilitate system fault diagnosis in a very precise manner. Fault detection, isolation and identification in fault diagnosis systems are typical steps to analyze the root cause of failures. This systematic failure analysis provides not only useful clues to rectify the abnormal behaviors of a system, but also key information to redesign the current system for retrofit. The main barriers to effective failure analysis are: (i) the gathered data (event) logs are too large in general, and further (ii) they usually contain noise and redundant data that make precise analysis difficult. This paper therefore applies suitable pre-processing techniques to data reduction and feature extraction, and then converts the reduced data log into a new format of event sequence information. Finally the event sequence information is decoded to investigate the correlation between specific event patterns and various system faults. The efficiency of the developed pre-filtering procedure is examined with a terminal box data log of a marine diesel engine.

• ETRI Journal
• /
• v.31 no.4
• /
• pp.463-465
• /
• 2009

In this letter, we present an event stream processing system that can evaluate a pattern query for a data sequence with predicates. We propose a pattern query language and develop a pattern query processing system. In our system, we propose novel techniques for run-time aggregation and negation processing and apply our system to stream data generated from vehicles to monitor unusual driving patterns.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.201-209
• /
• 2012

The point-based complex event processing handled an instantaneous event by using one time stamp in each event. However, the activity period of the event plays the important role in the field which is the same as the finance, multimedia, medicine, and meteorology. The point-based event is insufficient for expressing the complex temporal relationship in this field. In the application field of the real-time world, the event has the period. The events more than two kinds can be temporally overlapped. In addition, one event can include the other event. The relation about the events of kind of these can not be successive like the point-based event. This thesis designs and implements the method detecting the patterns of the complex event by using the interval-based events. The interval-based events can express the overlapping relation between events. Furthermore, it can include the others. By using the end point of beginning and end point of the termination, the operator of interval-based events shows the interval-based events. It expresses the sequence of the interval-based events and can detect the complex event patterns. This thesis proposes the algorithm using the active instance stack in order to raise efficiency of detection of the complex event patterns. When comprising the event sequence, this thesis applies the window push down technique in order to reduce the number of intermediate results. It raises the utility factor of the running time and memory.

• Journal of KIISE:Software and Applications
• /
• v.27 no.2
• /
• pp.108-119
• /
• 2000

Most of prior works on testing parallel programs have concentrated on how to guarantee the reproducibility by employing event traces exercised during executions of a program. Consequently, little work has been done to generate meaningful event sequences, especially, from specifications. This paper describes techniques for deriving event sequences from Message Sequence Charts(MSCs) which are widely used in telecommunication areas for its simplicity in specifying the behaviors of a program. For deriving event sequences from MSCs, we have to uncover the causality relations among events embedded implicitly in MSCs. In order to attain this goal, we adapt vector time stamping which has been previously used to determine the ordering of events taken place during an execution of interacting processes. Then, valid event sequences, satisfying the causality relations, are generated according to the interleaving rules suggested in this paper. The feasibility of our testing technique was investigated using the phone conversation example. In addition, we discussed on the experimental results gained from the example and how to combine various test criteria into our testing environment.

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

• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.6
• /
• pp.91-98
• /
• 1998

A DEDS is a system whose stated change in response to the occurrence of events from a predefined event set. A major difficulty in developing analytical results for the system is the lack of appropriate modeling techniques. In this paper, we consider the modeling and control problem for Discrete Event Dynamic Systems(DEDS) in the Temporal Logic framework(TLF) which have been recently defined. The traditional TLF is enhanced with time functions for real time control of Discrete Event Dynamic Systems. A sequence of event which drive the system from a given initial state to a given final state is generated by pertinently operating the given plants. This paper proposes the use of Real-time Temporal Logic as a modeling tool for the analysis and control of DEDS. An given example of fixed-time traffic control problem is shown to illustrate our results with Real-time Temporal Logic Framework.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.7 no.2
• /
• pp.25-33
• /
• 1997

A DEDS is a system whose states change in response to the occurence of events from a predefined event set. In this paper, we consider the optimal control and reasoning problem for Discrete Event Systems(DES) in the Temporal Logic Framework(TEL) which have been recnetly defined. The TLE is enhanced with objective functions(event cost indices) and a measurement space is alos deined. A sequence of event which drive the system form a give initial state to a given final state is generated by minimizing a cost functioin index. Our research goal is the reasoning of optimal trajectory and the design of the optimal controller for DESs. This procedure could be guided by the heuristic search methods. For the heuristic search, we suggested the Stochastic Ruler algorithm, instead of the A algorithm with difficulties as following ; the uniqueness of solutions, the computational complexity and how to select a heuristic function. This SR algorithm is used for solving the optimal problem. An example is shown to illustrate our results.

• Journal of KIISE:Databases
• /
• v.36 no.3
• /
• pp.169-179
• /
• 2009

Communication log data consist of communication events such as sending and receiving e-mail or instance message and visiting web sites, etc. Many countries including USA and EU enforce the retention of these data on the communication service providers for the purpose of investigating or detecting criminals through the Internet. Because size of the retained data is very large, the efficient method for extracting valuable information from the data is needed for Law Enforcement Authorities to use the retained data. This paper defines the Interactive Communication Sequence Patterns(ICSPs) that is the important information when each communication event in communication log data consists of sender, receiver, and timestamp of this event. We also define a Mining(FDICSP) problem to discover such patterns and propose a method called Fast Discovering Interactive Communication Sequence Pattern(FDICSP) to solve this problem. FDICSP focuses on the characteristics of ICS to reduce the search space when it finds longer sequences by using shorter sequences. Thus, FDICSP can find Interactive Communication Sequence Patterns efficiently.

• Horticultural Science & Technology
• /
• v.29 no.2
• /
• pp.123-129
• /
• 2011

To identify unintended vertical gene-transfer rates from the developed transgenic plants, rapid and unequivocal techniques are needed to identify event-specific markers based on flanking sequences around the transgene and to distinguish zygosity such as homo- and hetero-zygosity. To facilitate evaluation of zygosity, a polymerase chain reaction technique was used to analyze a transgenic pepper line B20 (homozygote), P915 wild type (null zygote), and their F1 hybrids, which were used as transgene contaminated plants. First, we sequenced the 3'-flanking region of the T-DNA (1,277 bp) in the transgenic pepper event B20. Based on sequence information for the 3'- and 5'-flanking region of T-DNA provided in a previous study, a primer pair was designed to amplify full length T-DNA in B20. We successfully amplified the full length T-DNA containing 986 bp from the flanking regions of B20. In addition, a 1,040 bp PCR product, which was where the T-DNA was inserted, was amplified from P915. Finally, both full length T-DNA and the 1,040 bp fragment were simultaneously amplified in the F1 hybrids; P915 ${\times}$ B20, Pungchon ${\times}$ B20, Gumtap ${\times}$ B20. In the present study, we were able to identify zygosity among homozygous transgenic event B20, its wild type P915, and hemizygous F1 hybrids. Therefore, this novel zygosity identification technique, which is based on PCR, can be effectively used to examine gene flow for transgenic pepper event B20.