• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.3216-3230
• /
• 2015

A hot-issued research topic in the workflow intelligence arena is the emerging topic of "workflow-supported organizational social networks." These specialized social networks have been proposed to primarily represent the process-driven work-sharing and work-collaborating relationships among the workflow-performers fulfilling a series of workflow-related operations in a workflow-supported organization. We can discover those organizational social networks, and visualize its analysis results as organizational knowledge. In this paper, we are particularly interested in how to visualize the degrees of closeness centralities among workflow-performers by proposing a graphical representation schema based on the Graph Markup Language, which is named to ccWSSN-GraphML. Additionally, we expatiate on the functional expansion of the closeness centralization formulas so as for the visualization framework to handle a group of workflow procedures (or a workflow package) with organizational workflow-performers.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.687-690
• /
• 1988

Algorithms that represent given pattern in the form of an ARG (Attributed relational graph) using not only structural relations but also symbolic or numerical attributes, and then recognize that pattern by graph matching process are presented in this paper. Based on definitions of pattern deformational models, algorithms that can find GPECI(Graph preserved error correcting isomorphism). SGECI(subgraph ECI) and DSECI(Double subgraph ECI) are proposed and comparisons among these algorithms are described. To be useful in performig practical tasks, efficient schemes for extraction of ARG representation fron raw image are needed. In this study, given patterns are restricted within objects having distinct skeleton, and then the information which is necessary for recognition and analysis is successfully extracted.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.14 no.5
• /
• pp.15-21
• /
• 1977

The syntactic pattern recognition system of Korean characters is composed of three main functional parts; Preprocessing, Graph-representation, and Segmentation. In preprocessing routine, the input pattern has been thinned using the Hilditch's thinning algorithm. The graph-representation is the detection of a number of nodes over the input pattern and codification of branches between nodes by 8 directional components. Next, segmentation routine which has been implemented by top down nondeterministic parsing under the control of tree grammar identifies parts of the graph-represented Pattern as basic components of Korean characters. The authors have made sure that this system is effective for recognizing Korean characters through the recognition simulations by digital computer.

• Journal of Korea Multimedia Society
• /
• v.1 no.2
• /
• pp.224-238
• /
• 1998

The EMFG (Extended Mark Flow Graph) is not only a powerful tool for designing the discrete-event system conceptually or specifically but also a good representation tool for implementing the system directly. But it is difficult to design or analyze the system because the impossibility of mathematical analysis results from some complicated representation of the EMFG. In this paper, therefore we redefined EMFG representations to provide the possibility of mathematical analysis, and employed an output inhibit are of a transition, which makes possible the adequate representations for the indescribable parts. We also solved trouble parts in the circuit translations of the EMFG and proposed the circuit translation method by using the mathematical formula. Finally, we compared the conventional EMFG with the redefined EMFG, and we designed a 0101 detecter with the redefined EMFG and translated it to the corresponding circuit.

• Industrial Engineering and Management Systems
• /
• v.7 no.2
• /
• pp.84-92
• /
• 2008

Scheduling is one of the most important issues in the planning and operation of production systems. This paper investigates a general job shop scheduling problem with reentrant work flows and sequence dependent setup times. The disjunctive graph representation is used to capture the interactions between machines in job shop. Based on this representation, four two-phase heuristic procedures are proposed to obtain near optimal solutions for this problem. The obtained solutions in the first phase are substantially improved by reversing the direction of some critical disjunctive arcs of the graph in the second phase. A comparative study is conducted to examine the performance of these proposed algorithms.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2000.11a
• /
• pp.267-270
• /
• 2000

This paper describes measurement of relative permittivity of illite found in young-dong area. A measurement of relative permittivity of illite used to cylindrical cavity resonators with moveable cap. A concentric dielectric-rod inserted cylindrical cavity resonator and an exact field representation of travelling wave mode are introduced for measurement of relative permittivity. The exact electromagnetic fields in cylindrical cavity with concentric dielectric rod is analysed. A relative permittivity of dielectric in cavity is calculated by analyzing the characteristic equation. The characteristic equation is solved by using the ContourPlot graph of Mathematica. We know that the field representation of travelling mode is exact. As a result, relative permittivity of dielectric materials were 7.820 at sample-1 and 7.894 at sample-2.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.1
• /
• pp.127-132
• /
• 2008

This study proposes a Natural Language Query Framework (NLQF) for the semantic web. It supports an intelligent inference at a semantic level. Most of previous researches focused on the knowledge representation on the semantic web. However, to revitalize the intelligent e-business on the semantic web, there is a need for semantic level inference to the web information. To satisfy the need, we will review the knowledge/resource representation on the semantic web such as RDF, Ontology and Conceptual Graph (CG), and then discuss about the natural language (NL) inference. The result of this research could support a natural interface for the semantic web. Furthermore, we expect that the NLQF can be used in the semantic web-based business communications.

• Journal of Broadcast Engineering
• /
• v.1 no.1
• /
• pp.74-83
• /
• 1996

In this paper, an effective color image retrieval algorithm is proposed based on the graph representation. Also we propose a color constancy algorithm to remove the effect of illumination change. Illumination condition of an image can be transformed to that of reference image using the proposed color constancy algorithm, so that the effect of dirrerent lighting is significantly alleviated. Then, we represent a color image as a graph with several nodes and edges in the histogram space, and finally two images are matched by compared two graphs representing them. The simulation results show that the proposed 3-step algorithm performs well for various conditions, including different lighting, translation, rotation, and scaling of the object in the image. In addition, the proposed algorithm is very fast compared to the geometry-based matching technique.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.904-907
• /
• 1996

In this paper, we propose an efficient collision-free path planning method of two cooperating robot manipulators grasping a common object rigidly. For given two robots and an object, the procedure is described which constructs the reduced dimensional configuration space by the kinematic analysis of two cooperating robot manipulators. A path planning algorithm without explicit representation of configuration obstacles is also described. The primary steps of the algorithm is as follows. First, we compute a graph which represents the skeleton of the free configuration space. Second, a connection between an initial and a goal configuration to the graph is searched to find a collision-free path.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.781-791
• /
• 1999

DD(Decision Diagrams) is an efficient operational data structure for an optimal expression of boolean functions. In a graph-based synthesis using DD, the goal of optimization decreases representation space for boolean functions. This paper represents boolean functions using OPKFDD(Ordered Pseudo-Kronecker Functional Decision Diagrams) for a graph-based synthesis and is based on the number of nodes as the criterion of DD size. For a property of OPKFDD that is able to select one of different decomposition types for each node, OPKFDD is variable in its size by the decomposition types selection of each node and input variable order. This paper proposes a method for generating OPKFDD efficiently from the current BDD(Binary Decision Diagram) Data structure and an algorithm for minimizing one. In the multiple output functions, the relations of each function affect the number of nodes of OPKFDD. Therefore this paper proposes a method to decide the input variable order considering the above cases. Experimental results of comparing with the current representation methods and the reordering methods for deciding input variable order are shown.