• 전자공학회논문지A
• /
• 제31A권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.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2022년도 춘계학술대회
• /
• pp.22-24
• /
• 2022

최근 그래프데이터베이스가 널리 사용되기 시작했다. 그래프데이터베이스는 그래프구조를 활용하는 데이터베이스이다. 관계형 데이터베이스의 테이블 대신, 그래프데이터베이스는 정점과 간선 형태로 정보를 저장한다. 데이터 저장구조의 사전 정의 없이 데이터를 저장할 수 있으며 사람이 생각하는 방식과 유사하게 데이터를 저장하고 조회할 수 있다. 그래프 데이터베이스를 활용하면 복잡한 연결구조를 가진 대용량 데이터를 효율적으로 처리할 수 있다. 통신망은 다양한 형태의 통신설비가 복잡하게 상호연결된 그래프구조로 볼 수 있다. 기존의 통신망 관리 시스템(Network Operation Support System)은 통신설비와 설비간 연결관계를 관계형데이터베이스로 관리하고 있어 서비스 종단 간 연결관계를 조회하거나, 고장원인 지점을 추적 ·조회하는등 그래프 탐색쿼리를 수행함에 있어서 어려움이 있었다. 본 연구에서는 통신망 구성 정보를 그래프데이터베이스를 이용해 구축하는 방안에 대해 고찰하고자 한다. 그래프데이터베이스의 도입으로 그래프탐색이 필요한 조회인 경우 효율적인 질의처리가 가능할 것으로 기대한다.

• 충청수학회지
• /
• 제32권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
• /
• 제29권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)
• /
• 제10권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
• /
• 제41권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.

• 한국가스학회지
• /
• 제16권6호
• /
• pp.41-47
• /
• 2012

화학공정을 효율적으로 설계 및 관리하기 위한 도면으로 공정흐름도와 공정배관 계장도가 있다. 본 도면들은 공정의 운전조건 및 설비에 대한 정보를 제공하지만 공정이 정상적으로 운전할 신뢰도는 제공하지 못한다. 따라서 본 연구에서는 유향그래프 분석기법을 이용하여 화학공정의 예방점검 정비주기 및 시점을 결정하기 위한 정보를 제공할 수 있는 신뢰도흐름도를 개발하였다. 유향그래프 분석기법은 화학공정이 정상적으로 작동할 가능성을 평가할 수 있는 기법으로써 노드와 아크를 사용하여 화학공정을 유향그래프로 모델화하고, 이 유향그래프를 순차적으로 해석하여 화학공정의 신뢰도를 평가하는 기법이다. 본 연구에서는 운전시간에 따른 화학공정의 신뢰도를 분석하고, 그 결과를 공정배관 계장도에 삽입하여 신뢰도흐름도를 개발하였다. 본 신뢰도흐름도는 화학공정의 기본 도면인 공정흐름도, 공정배관 계장도와 마찬가지로 화학공정의 설계, 예방점검 등 설비관리에 효율적으로 이용될 수 있을 것이다.

• 한국CDE학회논문집
• /
• 제3권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.

• 한국멀티미디어학회논문지
• /
• 제22권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.

• Journal of applied mathematics & informatics
• /
• 제32권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.