An XPDL-Based Workflow Control-Structure and Data-Sequence Analyzer

( Kwanghoon Pio Kim ) 한국인터넷정보학회 2019 KSII Transactions on Internet and Information Syst Vol.13 No.3

A workflow process (or business process) management system helps to define, execute, monitor and manage workflow models deployed on a workflow-supported enterprise, and the system is compartmentalized into a modeling subsystem and an enacting subsystem, in general. The modeling subsystem’s functionality is to discover and analyze workflow models via a theoretical modeling methodology like ICN, to graphically define them via a graphical representation notation like BPMN, and to systematically deploy those graphically defined models onto the enacting subsystem by transforming into their textual models represented by a standardized workflow process definition language like XPDL. Before deploying those defined workflow models, it is very important to inspect its syntactical correctness as well as its structural properness to minimize the loss of effectiveness and the depreciation of efficiency in managing the corresponding workflow models. In this paper, we are particularly interested in verifying very large-scale and massively parallel workflow models, and so we need a sophisticated analyzer to automatically analyze those specialized and complex styles of workflow models. One of the sophisticated analyzers devised in this paper is able to analyze not only the structural complexity but also the data-sequence complexity, especially. The structural complexity is based upon combinational usages of those control-structure constructs such as subprocesses, exclusive-OR, parallel-AND and iterative-LOOP primitives with preserving matched pairing and proper nesting properties, whereas the data-sequence complexity is based upon combinational usages of those relevant data repositories such as data definition sequences and data use sequences. Through the devised and implemented analyzer in this paper, we are able eventually to achieve the systematic verifications of the syntactical correctness as well as the effective validation of the structural properness on those complicate and large-scale styles of workflow models. As an experimental study, we apply the implemented analyzer to an exemplary large-scale and massively parallel workflow process model, the Large Bank Transaction Workflow Process Model, and show the structural complexity analysis results via a series of operational screens captured from the implemented analyzer.

An Estimated Closeness Centrality Ranking Algorithm and Its Performance Analysis in Large-Scale Workflow-supported Social Networks

( Jawon Kim ),( Hyun Ahn ),( Minjae Park ),( Sangguen Kim ),( Kwanghoon Pio Kim ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.3

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.

Modeling, Discovering, and Visualizing Workflow Performer-Role Affiliation Networking Knowledge

( Haksung Kim ),( Hyun Ahn ),( Kwanghoon Pio Kim ) 한국인터넷정보학회 2014 KSII Transactions on Internet and Information Syst Vol.8 No.2

This paper formalizes a special type of social networking knowledge, which is called “workflow performer-role affiliation networking knowledge.” A workflow model specifies execution sequences of the associated activities and their affiliated relationships with roles, performers, invoked-applications, and relevant data. In Particular, these affiliated relationships exhibit a stream of organizational work-sharing knowledge and utilize business process intelligence to explore resources allotting and planning knowledge concealed in the corresponding workflow model. In this paper, we particularly focus on the performer-role affiliation relationships and their implications as organizational and business process intelligence in workflow-driven organizations. We elaborate a series of theoretical formalisms and practical implementation for modeling, discovering, and visualizing workflow performer-role affiliation networking knowledge, and practical details as workflow performer-role affiliation knowledge representation, discovery, and visualization techniques. These theoretical concepts and practical algorithms are based upon information control net methodology for formally describing workflow models, and the affiliated knowledge eventually represents the various degrees of involvements and participations between a group of performers and a group of roles in a corresponding workflow model. Finally, we summarily describe the implications of the proposed affiliation networking knowledge as business process intelligence, and how worthwhile it is in discovering and visualizing the knowledge in workflow-driven organizations and enterprises that produce massively parallel interactions and large-scaled operational data collections through deploying and enacting massively parallel and large-scale workflow models.

Process-Aware Internet of Things: A Conceptual Extension of the Internet of Things Framework and Architecture

( Meesun Kim ),( Hyun Ahn ),( Kwanghoon Pio Kim ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.8

This paper tries to extend the conventional conceptual framework of the Internet of Things (IoT) so as to reify an advanced pervasive IoT-community collaboration concept, which is called the process-aware Internet of Things. The extended conceptual framework is embodied as a referential architecture that can be a standardized reference model supporting the conceptual integration of the Internet of Things and the process awareness. The extended referential architecture covers the full range of the architectural details from abstracting the process-aware behavioral semantics to reifying the IoT-process enactments. These extended framework and architecture ought to be the theoretical basis for implementing a process-aware IoT-community computing system supporting process-aware collaborations of Things in pervasive computing environments. In particular, we do point up that the proposed framework of the process-aware Internet of Things is revised from the Internet of Things framework announced in ITU-T SG13³ Y.2060 [26] by integrating the novel concept of process awareness. We strongly believe that the extended conceptual framework and its referential architecture are able to deliver the novel and meaningful insight as a standardized platform for describing and achieving the goals of IoT-communities and societies.

A SCORM-based e-Learning Process Control Model and Its Modeling System

( Hyunah Kim ),( Eunjung Lee ),( Junchul Chun ),( Kwanghoon Pio Kim ) 한국인터넷정보학회 2011 KSII Transactions on Internet and Information Syst Vol.5 No.11

In this paper, we propose an e-Learning process control model that aims to graphically describe and automatically generate the manifest of sequencing prerequisites in packaging SCORM`s content aggregation models. In specifying the e-Learning activity sequencing, SCORM<sup>1</sup> provides the concept of sequencing prerequisites to be manifested on each e-Learning activity of the corresponding tree-structured content organization model. However, the course developer is required to completely understand the SCORM`s complicated sequencing prerequisites and other extensions. So, it is necessary to achieve an efficient way of packaging for the e-Learning content organization models. The e-Learning process control model proposed in this paper ought to be an impeccable solution for this problem. Consequently, this paper aims to realize a new concept of process-driven e-Learning content aggregating approach supporting the e-Learning process control model and to implement its e-Learning process modeling system graphically describing and automatically generating the SCORM`s sequencing prerequisites. Eventually, the proposed model becomes a theoretical basis for implementing a SCORM-based e-Learning process management system satisfying the SCORM`s sequencing prerequisite specifications. We strongly believe that the e-Learning process control model and its modeling system achieve convenient packaging in SCORM`s content organization models and in implementing an e-Learning management system as well.

Formal approach for discovering work transference networks from workflow logs

Ahn, Hyun,Kim, Kwanghoon Pio Elsevier science 2020 Information sciences Vol.515 No.-

<P><B>Abstract</B></P> <P>This paper proposes a formal principle for discovering work transference networks of workflow-supported organizational employees from workflow enactment histories contained in event logs. This originates from the strong belief that those work transference networks, hidden in workflow enactment activities and histories, can both connote the degree of work sharing and work relevancy between workflow performers and denote their degree of work intensity. In this paper, we devise a series of formal definitions and algorithms for discovering a work transference network from a workflow procedure, and from its enactment histories in event logs. The final goal of the paper is to theoretically build the principle of fidelity into workflow human resource planning and its performance, via a novel concept of work transference networks that can be discovered from a workflow model and, moreover, rediscovered from its enactment history. In deploying the proposed principle, we base the formal representation on information control net theory, which can graphically and mathematically represent workflow procedures. We apply directed graph theory to formally and graphically define the work transference network model proposed in this paper. For the sake of verifying and validating the proposed concepts and algorithms, we implement a work transference network rediscovery system, and apply it to a workflow enactment event log dataset, in an experimental study. Finally, we describe the implications of discovering and rediscovering work transference networks, as a human resource management and evaluation technique, in workflow-supported enterprises and organizations.</P> <P><B>Highlights</B></P> <P> <UL> <LI> A formal definition of a novel concept of the work transference networks. </LI> <LI> A discovery algorithm for discovering a work transference network. </LI> <LI> A rediscovery algorithm for mining a work transference network from workflow enactment event logs. </LI> <LI> A conceptual and formal discovery framework. </LI> </UL> </P>

워크플로우 소셜 네트워크 근접중심성 분석 알고리즘

박성주 ( Sungjoo Park ),김광훈 ( Kwanghoon Pio Kim ) 한국인터넷정보학회 2013 인터넷정보학회논문지 Vol.14 No.5

본 논문에서는 워크플로우 소셜 네트워크(WSSN, Workflow-supported Social Network) 근접중심성 분석 알고리즘을 제안한다. 워크플로우모델과 모델의 실행을 기반으로 형성되는 업무수행자들간의 협업 관계를 워크플로우 소셜 네트워크라고 정의하고, 이를 기존의 소셜 네트워크 근접중심성 분석기법을 적용하여 워크플로우 소셜 네트워크의 근접중심성을 분석하는 알고리즘을 설계한다. 특히, 제안한 알고리즘의 적용 사례를 통해 특정 워크플로우모델로부터 해당 워크플로우 소셜 네트워크 근접중심성을 분석함으로써 본 논문에서 제안한 알고리즘의 정확성 및 적합성을 검증한다. This paper proposes a closeness centrality analysis algorithm for workflow-supported social networks that represent the collaborative relationships among the performers who are involved in a specific workflow model. The proposed algorithm uses the social network analysis techniques, particularly closeness centrality equations, to analyze the closeness centrality of the workflow-supported social network. Additionally, through an example we try to verify the accuracy and appropriateness of the proposed algorithm.

An AutoML-driven Antenna Performance Prediction Model in the Autonomous Driving Radar Manufacturing Process

So-Hyang Bak,Kwanghoon Pio Kim 한국인터넷정보학회 2023 KSII Transactions on Internet and Information Syst Vol.17 No.12

This paper proposes an antenna performance prediction model in the autonomous driving radar manufacturing process. Our research work is based upon a challenge dataset, Driving Radar Manufacturing Process Dataset, and a typical AutoML machine learning workflow engine, Pycaret open-source Python library. Note that the dataset contains the total 70 data-items, out of which 54 used as input features and 16 used as output features, and the dataset is properly built into resolving the multi-output regression problem. During the data regression analysis and preprocessing phase, we identified several input features having similar correlations and so detached some of those input features, which may become a serious cause of the multicollinearity problem that affect the overall model performance. In the training phase, we train each of output-feature regression models by using the AutoML approach. Next, we selected the top 5 models showing the higher performances in the AutoML result reports and applied the ensemble method so as for the selected models’ performances to be improved. In performing the experimental performance evaluation of the regression prediction model, we particularly used two metrics, MAE and RMSE, and the results of which were 0.6928 and 1.2065, respectively. Additionally, we carried out a series of experiments to verify the proposed model’s performance by comparing with other existing models’ performances. In conclusion, we enhance accuracy for safer autonomous vehicles, reduces manufacturing costs through AutoML-Pycaret and machine learning ensembled model, and prevents the production of faulty radar systems, conserving resources. Ultimately, the proposed model holds significant promise not only for antenna performance but also for improving manufacturing quality and advancing radar systems in autonomous vehicles.

A Visual Approach for Data-Intensive Workflow Validation

( Minjae Park ),( Hyun Ahn ),( Kwanghoon Pio Kim ) 한국인터넷정보학회 2016 인터넷정보학회논문지 Vol.17 No.5

This paper presents a workflow validation method for data-intensive graphical workflow models using real-time workflow tracing mode on data-intensiveworkflow designer. In order to model and validate workflows, we try to divide as modes have editable mode and tracingmode on data-intensiveworkflow designer. We could design data-intensive workflow using drag and drop in editable-mode, otherwise we could not design but view and trace workflow model in tracing mode. We would like to focus on tracing-mode for workflow validation, and describe how to use workflow tracing on data-intensive workflow model designer. Especially, it is support data centered operation about control logics and exchange variables on workflow runtime for workflow tracing.

트리맵을 이용한 비즈니스 프로세스 수행자간 업무공유 관계 시각화

안현 ( Hyun Ahn ),김광훈 ( Kwanghoon Pio Kim ) 한국인터넷정보학회 2016 인터넷정보학회논문지 Vol.17 No.4

최근에 비즈니스 인텔리전스 분야에서 비주얼 애널리틱스의 중요성이 강조되고 있다. 비즈니스 인텔리전스 관점에서 비주얼 애널리틱스는 다양한 관점의 비즈니스 관련 정보를 인터랙티브한 형태로 시각화함으로써 의사결정에 유용한 인사이트들을 획득하는 것을 목표로 한다. 본 논문에서는 트리맵을 이용하여 비즈니스 프로세스 수행자들간의 업무공유 관계들을 시각화하는 방법을 제안한다. 업무공유 관계는 비즈니스 프로세스의 특정 단위 업무에 공통적으로 참여하는 두 수행자간에 형성되는 연결 관계로서, 프로세스 기반 조직의 구조 및 행동 패턴을 이해하는 데에 중요한 요소이다. 이를 위해, 비즈니스 프로세스의 기본적인 계층적 정보와 수행자간 업무공유 관계를 트리맵의 형태로 나타내는 시각화 도구를 설계 및 구현하였다. 최종적으로 XPDL (XML Process Definition Language) 프로세스 모델을 이용한 실행 예제를 통해 시각화 도구의 유용성을 검증하였다. Recently, the importance of visual analytics has been recognized in the field of business intelligence. From the view of business intelligence, visual analytics aims for acquiring valuable insights for decision making by interactively visualizing a variety of business information. In this paper, we propose a treemap-based method for visualizing work-sharing relationships among business process performers. A work-sharing relationship is established between two performers who jointly participate in a specific activity of a business process and is an important factor for understanding organizational structures and behaviors in a process-centric organization. To this end, we design and implement a treemap-based visualization tool for representing work-sharing relationships as well as basic hierarchical information in business processes. Finally, we evaluate usefulness of the proposed visualization tool through an operational example using XPDL (XML Process Definition Language) process models.