• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2004.11a
• /
• pp.13-20
• /
• 2004

Grid system has the potential to resolve the current need of bioinformatics for super-computing environment inexpensively. There are already several Grid applications of bioinformatics tools. To solve the real-world bioinformatics problems, however, the various integration of each tool is necessary in addition to the implementation of more basic tools. Workflow based problem solving environment can be the efficient solution for this type of software development. There are still heavy overhead, however, to develop and implement workflow model on current Grid system. He re we propose a model of simple problem solving environment that enables component based workflow design of integrated bioinformatics applications on Grid environment by using Condor functionalities. We realized this model for practical bioinformatics solutions of a genome sequence analysis and a comparative genome analysis. We implemented necessary bioinformatics tools and interfacing tools as the components, and combine them in the workflow model of each solution by using the tools presented in Condor.

• Journal of Information Processing Systems
• /
• v.4 no.3
• /
• pp.103-112
• /
• 2008

This paper proposes a policy adjuster-driven Grid workflow management system for collaborative healthcare platform, which supports collaborative heart disease diagnosis applications. To select policies according to service level agreement of users and dynamic resource status, we devised a policy adjuster to handle workflow management polices and resource management policies using policy decision scheme. We implemented this new architecture with workflow management functions based on policy quorum based resource management system for providing poincare geometrycharacterized ECG analysis and virtual heart simulation service. To evaluate our proposed system, we executed a heart disease identification application in our system and compared the performance to that of the general workflow system and PQRM system under different types of SLA.

• Journal of Internet Computing and Services
• /
• v.10 no.3
• /
• pp.113-129
• /
• 2009

Abstract Corporate activities are composed of numerous working processes and during the working flow, various business processes are being created and completed simultaneously. Enterprise Resources Planning (ERP) makes the working process simple, yet creates more complicated work structure and therefore, there is an absolute need of efficient management for business processes. The workflow literature has been looking for efficient and effective ways of rediscovering and mining workflow intelligence and knowledge from their enactment histories and event logs. As part of studies to analyze and improve the process, the concepts of 'Process Mining', 'Process re-discovery', 'BPR (Business Process Reengineering)' have appeared and the studies for practical implementation are proactively being done. However, these studies normally follow the approach throughout data warehousing for log data of process instances. It is very hard for these approaches to reflect user's intention to the rediscovering and mining activities. The process instances designed based on the consideration of analysis can make groupings effectively and when the analysis demand of user changes within the analysis domain can also reduce the cost of analysis. Therefore, the thesis proposes a special type of workflow model, which is called a colored workflow model, that is extended from the ICN (information control net) modeling methodology by reinforcing the concept of colored token. The colored tokens represent the conceptual types of constraints and criteria that can be used to classifying and grouping the workflow intelligence and knowledge extracted from the corresponding workflow models' enactment histories and event logs. Through the runtime information of process instances, it makes possible to analyze proactive and user-oriented process with the goal of deriving business knowledge from the beginning of process definition.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1454-1466
• /
• 2016

This paper implements an estimated ranking algorithm of closeness centrality measures in large-scale workflow-supported social networks. The traditional ranking algorithms for large-scale networks have suffered from the time complexity problem. The larger the network size is, the bigger dramatically the computation time becomes. To solve the problem on calculating ranks of closeness centrality measures in a large-scale workflow-supported social network, this paper takes an estimation-driven ranking approach, in which the ranking algorithm calculates the estimated closeness centrality measures by applying the approximation method, and then pick out a candidate set of top k actors based on their ranks of the estimated closeness centrality measures. Ultimately, the exact ranking result of the candidate set is obtained by the pure closeness centrality algorithm [1] computing the exact closeness centrality measures. The ranking algorithm of the estimation-driven ranking approach especially developed for workflow-supported social networks is named as RankCCWSSN (Rank Closeness Centrality Workflow-supported Social Network) algorithm. Based upon the algorithm, we conduct the performance evaluations, and compare the outcomes with the results from the pure algorithm. Additionally we extend the algorithm so as to be applied into weighted workflow-supported social networks that are represented by weighted matrices. After all, we confirmed that the time efficiency of the estimation-driven approach with our ranking algorithm is much higher (about 50% improvement) than the traditional approach.

• Journal of Internet Computing and Services
• /
• v.16 no.3
• /
• pp.71-77
• /
• 2015

This paper implements an estimated closeness centrality ranking algorithm in large-scale workflow-supported social networks and performance analyzes of the algorithm. Existing algorithm has a time complexity problem which is increasing performance time by network size. This problem also causes ranking process in large-scale workflow-supported social networks. To solve such problems, this paper conducts comparison analysis on the existing algorithm and estimated results by applying estimated-driven RankCCWSSN(Rank Closeness Centrality Workflow-supported Social Network). The RankCCWSSN algorithm proved its time-efficiency in a procedure about 50% decrease.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.955-958
• /
• 2002

A workflow is a flow of work supported by computers. An instance of a workflow is called case. Companies need to constantly refine their current workflows in order to meet various requirements. The change of current workflows is called dynamic change of the workflow. Since Ellis et al. proposed three change types, Flush, Abort, and Synthetic Cut-Over in 1995, various change types have been proposed. A promising change type is Migrate proposed by Sadiq et al., because Migrate changes workflow definitions immediately and makes the redo of cases minimum. However, the formal modeling and time-dependent analysis of Migrate has not been done. This paper proposes a method of computing change time of Migrate dynamic changes for time-dependent analysis. Change time is a measure for evaluating dynamic changes. We first show a Petri-nets-based model of Migrate dynamic changes. Then we present a method of computing change time based on the net model. Finally, we apply the method to 270 examples, and show experimental results, and comparison with Ellis et al..'s three change types.

• Journal of Digital Convergence
• /
• v.12 no.8
• /
• pp.271-282
• /
• 2014

The recent flow of broadcasting technology, HDTV and 3DTV are being followed to develop UHDTV. UHDTV has established itself as the new paradigm. In Korea, the 4K-UHDTV experimental terrestrial broadcasting and cable and satellite TV services are being carried out in the present. 4K-UHD content creation workflow to enable a systematic formulation is needed. In this study, Through expert opinion 4K-UHD production workflow to derive the important topics and Hierarchical analysis methods (AHP, Analytic Hierarchy Process) is applied to 4K-UHD content creation is important to consider the items were compared to each other. The upper layer has a content creation workflow planning side, the media file management side and operational aspects of the selection and production equipment were classified. In the lower layer, UHD STAFF roles between production and training, media management, selection and operation of the storage device was evaluated in a relatively important. In addition, real-time 4K-UHD suggested workflow for production.

• Journal of the Korea Society for Simulation
• /
• v.23 no.3
• /
• pp.1-9
• /
• 2014

Traditional workflow time analyses have been performed treating an activity as an independent M/M/1queueing system. Using the general forms of performance measures in the M/M/1 system, various aspects of analyses can be performed. Especially, on the time analysis of an AND structure in a workflow system, the mean system sojourn time can be formalized by applying the performance measures of M/M/1 system. In the real workflow system, the AND structure cannot be described correctly under the assumption of independent M/M/1 systems. To overcome this limitation, this research makes the assumption that the all activities for a task starts simultaneously. In this situation, the theoretical solution can be derived using the performance measures of the M/G/1 system. In addition, the simulation modeling method will be proposed to analyze the AND structure of a real workflow system. Finally, some numerical results from the theoretical solutions and simulation models will be provided for verification. The main performance measures used in this research are mean queueing time and mean sojourn time.

• Journal of Internet Computing and Services
• /
• v.20 no.1
• /
• pp.87-96
• /
• 2019

In this paper, we propose a MapReduce-supported clustering technique for collecting and classifying distributed workflow enactment event logs as a preprocessing tool. Especially, we would call the distributed workflow enactment event logs as Workflow BIG-Logs, because they are satisfied with as well as well-fitted to the 5V properties of BIG-Data like Volume, Velocity, Variety, Veracity and Value. The clustering technique we develop in this paper is intentionally devised for the preprocessing phase of a specific workflow process mining and analysis algorithm based upon the workflow BIG-Logs. In other words, It uses the Map-Reduce framework as a Workflow BIG-Logs processing platform, it supports the IEEE XES standard data format, and it is eventually dedicated for the preprocessing phase of the ${\rho}$-Algorithm that is a typical workflow process mining algorithm based on the structured information control nets. More precisely, The Workflow BIG-Logs can be classified into two types: of activity-based clustering patterns and performer-based clustering patterns, and we try to implement an activity-based clustering pattern algorithm based upon the Map-Reduce framework. Finally, we try to verify the proposed clustering technique by carrying out an experimental study on the workflow enactment event log dataset released by the BPI Challenges.

• The Journal of Society for e-Business Studies
• /
• v.15 no.2
• /
• pp.191-203
• /
• 2010

Recently applications of RFID technologies in production and logistics systems are expanding. In this research, we deal with workflow modeling methods for handling RFID-tagged parts. We verified that the material flow processes in a RFID system can be designed and assessed using workflow modeling notations, and suggested available process patterns using BPMN. In addition, we proposed an algorithm to monitor the exact status of flows and determine whether some of the events are ghost reads or not by referring predefined workflow definitions. The major contribution of this research is that it has demonstrated how well-established workflow modeling methods can be applied to RFID-based systems.