• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.1
• /
• pp.84-92
• /
• 1994

In this paper, we present a novel scheduling algorithm using the weighted interval graph. An interval graph is constructed, where an interval is a time frame of each operation. And for each operation type, we look for the maximum clique of the interval graph: the number of nodes of the maximum clique represents the number of operation that are executed concurrently. In order to minimize resource cost. we select the operation type to reduce the number of nodes of a maximum clique. For the selected operation type, an operation selected by selection rule is moved to decrease the number of nodes of a maximum clique. A selected operation among unscheduled operations is moved repeatly and assigned to a control step consequently. The proposed algorithm is applied to the pipeline and the nonpipeline data path synthesis. The experiment for examples shows the efficiency of the proposed scheduling algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.22-24
• /
• 2022

Recently, Graph Database (GDB) is being used in wide range of industrial fields. GDB is a database system which adopts graph structure for storing the information. GDB handles the information in the form of a graph which consists of vertices and edges. In contrast to the relational database system which requires pre-defined table schema, GDB doesn't need a pre-defined structure for storing data, allowing a very flexible way of thinking about and using the data. With GDB, we can handle a large volume of heavily interconnected data. A network service provider provides its services based on the heavily interconnected communication network facilities. In many cases, their information is hosted in relational database, where it is not easy to process a query that requires recursive graph traversal operation. In this study, we suggest a way to store an example set of interconnected network facilities in GDB, then show how to graph-query them efficiently.

• Journal of the Chungcheong Mathematical Society
• /
• v.32 no.2
• /
• pp.245-250
• /
• 2019

In this paper, the notion of ${\gamma}$-operation on a supratopological space is introduced. We found that the ${\gamma}$-operation induces a supratopology (topology) containing a given supratopology. We also introduce the notions of (${\gamma}$, S)-continuous function and almost ${\Gamma}$-supracompact defined by ${\gamma}$-operation on a supratopological space and investigate some properties for such notions.

• Nuclear Engineering and Technology
• /
• v.29 no.6
• /
• pp.433-443
• /
• 1997

In this work, an analytic approach to the dependability of software in the operational phase is suggested with special attention to the hardware fault effects on the software behavior : The hardware faults considered are memory faults and the dependability measure in question is the reliability. The model is based on the simple reliability theory and the graph theory which represents the software with graph composed of nodes and arcs. Through proper transformation, the graph can be reduced to a simple two-node graph and the software reliability is derived from this graph. Using this model, we predict the reliability of an application software in the digital system (ILS) in the nuclear power plant and show the sensitivity of the software reliability to the major physical parameters which affect the software failure in the normal operation phase. We also found that the effects of the hardware faults on the software failure should be considered for predicting the software dependability accurately in operation phase, especially for the software which is executed frequently. This modeling method is particularly attractive for the medium size programs such as the microprocessor-based nuclear safety logic program.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.5171-5189
• /
• 2016

With the popularity of cloud computing, many data owners outsource their graph data to the cloud for cost savings. The cloud server is not fully trusted and always wants to learn the owners' contents. To protect the information hiding, the graph data have to be encrypted before outsourcing to the cloud. The adjacent vertex search is a very common operation, many other operations can be built based on the adjacent vertex search. A boolean adjacent vertex search is an important basic operation, a query user can get the boolean search results. Due to the graph data being encrypted on the cloud server, a boolean adjacent vertex search is a quite difficult task. In this paper, we propose a solution to perform the boolean adjacent vertex search over encrypted graph data in cloud computing (BASG), which maintains the query tokens and search results privacy. We use the Gram-Schmidt algorithm and achieve the boolean expression search in our paper. We formally analyze the security of our scheme, and the query user can handily get the boolean search results by this scheme. The experiment results with a real graph data set demonstrate the efficiency of our scheme.

• Journal of applied mathematics & informatics
• /
• v.41 no.3
• /
• pp.615-631
• /
• 2023

A power cordial labeling of a graph G = (V (G), E(G)) is a bijection f : V (G) → {1, 2, ..., |V (G)|} such that an edge e = uv is assigned the label 1 if f(u) = (f(v))ⁿ or f(v) = (f(u))ⁿ, For some n ∈ ℕ ∪ {0} and the label 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. In this paper, we investigate power cordial labeling for helm graph, flower graph, gear graph, fan graph and jewel graph as well as larger graphs obtained from star and bistar using graph operations.

• Journal of the Korean Institute of Gas
• /
• v.16 no.6
• /
• pp.41-47
• /
• 2012

There are PFD(Process Flow Diagram) and P&ID(Piping and Instrument Diagram) for designing and managing chemical process efficiently. They provide the operation condition and equipment specifications of chemical process, but they do not provide the reliability of chemical process. Therefore, in this study, Reliability Flow Diagram(RFD) which provide the cycle and time of preventive maintenance has been developed using Directed Graph Analysis methodology. Directed Graph Analysis methodology is capable of assessing the reliability of chemical process. It models chemical process into Directed Graph with nodes and arcs and assesses the reliability of normal operation of chemical process by assessing Directed Graph sequential. In this paper, the chemical process reliability transition according to operation time was assessed. And then, Reliability Flow Diagram has been developed by inserting the result into P&ID. Like PFD and P&ID, Reliability Flow Diagram provide valuable and useful information for the design and management of chemical process.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.3
• /
• pp.145-153
• /
• 1998

An approach has been developed to generate parametric models with Boolean operations. The approach combines Boolean operations and graph manipulation on the constraints imposed on primitives. A Boolean operation is first performed on two primitives and new geometric elements such as vertices and edges are computed. Then to generate the constraint graph of the polygon the each constraints graph of two primitives are merged by adding the new geometric elements with its corresponding constraints. In the merging process, some of the geometric elements belonging to the primitives may be eliminated based on its contribution to the polygon. A computer implementation in a 2D space is described to illustrate the approach with examples.

• Journal of applied mathematics & informatics
• /
• v.32 no.5_6
• /
• pp.675-685
• /
• 2014

Suppose G is a simple graph. The irregularity of G, irr(G), is the summation of imb(e) over all edges $uv=e{\in}G$, where imb(e) = |deg(u)-deg(v)|. In this paper, we investigate the behavior of this graph parameter under some old and new graph operations.

• Journal of Korea Multimedia Society
• /
• v.22 no.2
• /
• pp.225-230
• /
• 2019

There are several methods which efficiencies of database are uprise. One of the well-known methods is that segments of database satisfying a query was rapidly accessed and processed. So if it is possible to search completely parallel multiple database segment types which satisfy a query, the response time of the query will be reduced. The matter of obtaining CPS(Completely Parallel Searchable) distribution without redundancy can be viewed as graph theoretic problem, and the operation of ring sum on the graph is used for CPS. In this paper, the parallel algorithm is proposed.