• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1385-1402
• /
• 2019

Quickly picking up some valuable information from massive manufacturing event stream usually faces with the problem of long detection time, high memory consumption and low detection efficiency due to its stream characteristics of large volume, high velocity, many variety and small value. Aiming to solve the problem above for the current complex event processing methods because of not sharing detection during the detecting process for massive manufacturing event streams, an efficient complex event processing method based on multipattern sharing is presented in this paper. The achievement of this paper lies that a multipattern sharing technology is successfully used to realize the quick detection of complex event for massive manufacturing event streams. Specially, in our scheme, we firstly use pattern sharing technology to merge all the same prefix, suffix, or subpattern that existed in single pattern complex event detection models into a multiple pattern complex event detection model, then we use the new detection model to realize the quick detection for complex events from massive manufacturing event streams, as a result, our scheme can effectively solve the problems above by reducing lots of redundant building, storing, searching and calculating operations with pattern sharing technology. At the end of this paper, we use some simulation experiments to prove that our proposed multiple pattern processing scheme outperforms some general processing methods in current as a whole.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.382-394
• /
• 2010

Cross-domain event information sharing is a topic of great interest in the area of event based network management. In this work we use data sets which represent actual attacks in the operational Internet. We analyze the data sets to understand the dynamics of the attacks and then go onto show the effectiveness of sharing incident related information to contain these attacks. We describe universal data acquisition system for event based management (UniDAS), a novel system for secure and automated cross-domain event information sharing. The system uses a generic, structured data format based on a standardized incident object description and exchange format (IODEF). IODEF is an XML-based extensible data format for security incident information exchange. We propose a simple and effective security model for IODEF and apply it to the secure and automated generic event information sharing system UniDAS. We present the system we have developed and evaluate its effectiveness.

• Journal of Digital Convergence
• /
• v.15 no.10
• /
• pp.243-251
• /
• 2017

As external data have become important corporate information resources, there are growing needs to combine them with internal data. This paper proposes an ontology-based scheme to combine external data with multi-dimensional databases, which shall be called multi-dimensional event ontology. In the ontology, external data are represented as events. Event characteristics such as actors, places, times, targets are linked to dimensions of a multi-dimensional database. By mapping event characteristics to database dimensions, external event data are shared via multi-dimensional hierarchies. This paper proposes rules to synchronize information sharing in multi-dimensional event ontology such as upward event information sharing, downward event information sharing and complex event information sharing. These rules are implemented using Protege. This study has a value in suggesting Big Data information sharing processes using an event database framework.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1237-1252
• /
• 2010

This paper proposes an intelligent technique for data sharing and event transition among personal devices including smart phones, laptops, and desktops. We implemented the PES (Personal Event Service) system that proactively executes appropriate tasks across multiple devices without explicit user requests by sharing the data used by the user and recognizing user intention based on the observed actions of the user for specific devices. The client module of PES installed on each device monitors the user actions and recognizes the intention of the user. The server provides data sharing and maintenance for clients. The connection between client and server is established by Java RMI (Remote Method Invocation). A series of experiments were performed to evaluate user satisfaction and system accuracy, and the results showed that the PES system can proactively provide appropriate, personalized services with a high degree of satisfaction to the user in an effective and efficient manner.

• Korean Journal of Optics and Photonics
• /
• v.27 no.6
• /
• pp.212-217
• /
• 2016

In connection-oriented data-transport services, data loss can occur when the service experiences a problem on its end-to-end path. To promptly resolve this problem, the data-switching systems providing the service should quickly modify their internal configurations distributed among different places in each system. This is performed through a sequence of problem (event) recognition, sharing, and handling procedures among multiple control processors in the system. This paper proposes a method for event sharing and messaging between control processors, to improve the time determinacy of event processing. This method simplifies runtime event sharing and minimizes the time variability caused by the event data, resulting in a decrease in the latency time in processing global events. The proposed method lessens the latency time of global event processing by about 40%, compared to general methods, for 738 internal path changes.

• Journal of the Korea Safety Management & Science
• /
• v.11 no.4
• /
• pp.221-228
• /
• 2009

Electronic Product Code Information Services(EPCIS) is an EPCglobal standard for sharing EPC related information between trading partners. EPCIS provides a new important capability to improve efficiency, security, and visibility in the global supply chain. EPCIS data are classified into two categories, master data (static data) and event data (dynamic data). Master data are static and constant for objects, for example, the name and code of product and the manufacturer, etc. Event data refer to things that happen dynamically with the passing of time, for example, the date of manufacture, the period and the route of circulation, the date of storage in warehouse, etc. There are four kinds of event data which are Object Event data, Aggregation Event data, Quantity Event data, and Transaction Event data. This thesis we propose an event-based data model for EPC Information Service repository in RFID based integrated logistics center. This data model can reduce the data volume and handle well all kinds of entity relationships. From the point of aspect of data quantity, we propose a formula model that can explain how many EPCIS events data are created per one business activity. Using this formula model, we can estimate the size of EPCIS events data of RFID based integrated logistics center for a one day under the assumed scenario.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.5
• /
• pp.989-998
• /
• 2011

Cloud computing provides computation, software, data access, and storage services that do not require end-user knowledge of the physical location and configuration of the system that delivers the services. Cloud computing providers have setup several data centers at different geographical locations over the Internet in order to optimally serve needs of their customers around the world. One of the fundamental challenges in geographically distributed clouds is to provide efficient algorithms for supporting inter-cloud data management and dissemination. In this paper, we propose a group quorum system (GQS)-based dissemination for improving the interoperability of inter-cloud in time-critical event dissemination service, such as computing policy updating, message sharing, event notification and so forth. The proposed GQS-based method organizes these distributed clouds into a group quorum ring overlay to support a constant event dissemination latency. Our numerical results show that the GQS-based method improves the efficiency as compared with Chord-based and Plume methods.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.6
• /
• pp.1259-1269
• /
• 2012

Cloud computing has rapidly become a new infrastructure for organizations to reduce their capital cost in IT investment and to develop planetary-scale distributed applications. One of the fundamental challenges in geographically distributed clouds is to provide efficient algorithms for supporting inter-cloud data management and dissemination. In this paper, we propose a geographic group quorum system (GGQS)-based hybrid algorithm for improving the interoperability of inter-cloud in time-critical event dissemination service, such as computing policy updating, message sharing, event notification and so forth. The proposed algorithm first organizes these distributed clouds into a geographic group quorum overlay to support a constant event dissemination latency. Then it uses a hybrid protocol that combines geographic group-based broad-cast with quorum-based multicast. Our numerical results show that the GGQS-based hybrid algorithm improves the efficiency as compared with Chord-based, Plume an GQS-based algorithms.

• Proceedings of the KSR Conference
• /
• 2008.11b
• /
• pp.1360-1365
• /
• 2008

Most recognition algorithms for intelligent surveillance system are based on analysis of the video collected from one camera. Video analysis is also used to compute the internal parameters used in the recognition process. The algorithm computes only the video of the fixed area so that it is a insufficient method and it could not use information of the related areas. However, intelligent integrated surveillance system should be constructed to correlate the events in the other areas as well as in the fixed area. In this paper, in order to construct the intelligent integrated surveillance system, we describe the method not to focus on the video of each camera but to aware the whole event by sharing information between cameras, which is more accurate. The method would be used to aware the event in the fixed area such as stations in urban transit.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1464-1480
• /
• 1997

Distributed systems offer environments for attaining high performance, fault-tolerance, information sharing, resource sharing, etc. But we cannot benefit from these potential advantages without suitable management of events/states occurring in distributed systems. These events and states can be symptoms for performance degradation, erroneous functions, suspicious activities, etc. and are subject to further analysis. To properly manage events/states, we need to be able to specify and efficiently detect these events/states. In this paper we first describe an event/state specification language and a centralized algorithm for detecting events/states specified with this language. Then we describe an algorithm for distributing an event/state detection task in a distributed system which is hierarchically organized. The algorithm consists of decomposing an event/state detection task into subtasks and allocation these subtasks to the proper nodes. We also explain a method to make the distributed detection fault-tolerant.