• Nuclear Engineering and Technology
• /
• v.54 no.8
• /
• pp.2859-2870
• /
• 2022

Because nuclear power plants (NPPs) are safety-critical infrastructure, it is essential to increase their safety and minimize risk. To reduce human error and support decision-making by operators, several artificial-intelligence-based diagnosis methods have been proposed. However, because of the nature of data-driven methods, conventional artificial intelligence requires large amount of measurement values to train and achieve enough diagnosis resolution. We propose a graph neural network (GNN) based accident diagnosis algorithm to achieve high diagnosis resolution with limited measurements. The proposed algorithm is trained with both the knowledge about physical correlation between components and measurement values. To validate the proposed methodology has a sufficiently high diagnostic resolution with limited measurement values, the diagnosis of multiple accidents was performed with limited measurement values and also, the performance was compared with convolution neural network (CNN). In case of the experiment that requires low diagnostic resolution, both CNN and GNN showed good results. However, for the tests that requires high diagnostic resolution, GNN greatly outperformed the CNN.

• Proceedings of the KIEE Conference
• /
• 2002.07a
• /
• pp.422-424
• /
• 2002

Many methods about real power flow tracing have been suggested. Electric power industrials and organizations of the world use the method which is best suitable to themselves in practical aspects. In this paper we calculate the real power transfer between individual generators and loads referencing the method introduced by oversea's paper. It is considered to be significant to the wholesale competition market and transmission open access. Based on ac load flow solution and graph theory, the simulation on IEEE 30-bus system are carried out and the results are compared with that of oversea's paper. Also the simulation on the power system of Korea is carried out and the results are analyzed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3761-3779
• /
• 2022

The performance of existing recognition algorithms for binary phase shift keying (BPSK) and quadrature phase shift keying (QPSK) signals degrade under conditions of low signal-to-noise ratios (SNR). Hence, a novel recognition algorithm based on features in the graph domain is proposed in this study. First, the power spectrum of the squared candidate signal is truncated by a rectangular window. Thereafter, the graph representation of the truncated spectrum is obtained via normalization, quantization, and edge construction. Based on the analysis of the connectivity difference of the graphs under different hypotheses, the sum of degree (SD) of the graphs is utilized as a discriminate feature to classify BPSK and QPSK signals. Moreover, we prove that the SD is a Schur-concave function with respect to the probability vector of the vertices (PVV). Extensive simulations confirm the effectiveness of the proposed algorithm, and its superiority to the listed model-driven-based (MDB) algorithms in terms of recognition performance under low SNRs and computational complexity. As it is confirmed that the proposed method reduces the computational complexity of existing graph-based algorithms, it can be applied in modulation recognition of radar or communication signals in real-time processing, and does not require any prior knowledge about the training sets, channel coefficients, or noise power.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.4
• /
• pp.17-29
• /
• 1999

This paper presents a high level synthesis method targeting low power consumption for data-dominated CMOS circuits (e.g., DSP). The high level synthesis is divided into three basic tasks: scheduling, resource and register allocation. For lower power scheduling, we increase the possibility of reusing an input operand of functional units. For a scheduled data flow graph, a compatibility graph for register and resource allocation is formed, and then a special weighted network is then constructed from the compatibility graph and the minimum cost flow algorithm is performed on the network to obtain the minimum power consumption data path assignment. The formulated problem is then solved optimally in polynomial time. This method reduces both the switching activity and the capacitance in synthesized data path. Experimental results show 15% power reduction in benchmark circuits.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1659-1668
• /
• 1996

Graph grammars generate graph languages while string grammars generate string languages which are the subset of graph languages. One of the most successful graph grammars models is the NLC grammars, which gen-erate graphs by replacing a node by a node by a graph through node labels. For grammars generating hypergraphs which are the superset of graphs, there are CFHG grammars, which replace a hyperedge by a hypergraph through their preidentified gluing points, an extension of CFHG grammars called HH grammars, which replace a handle by a hypergraph through the rewriting mechanism that can also duplicate or delete the hyperedges surrounding the replaced handle, and finally HRNCE grammars, which replace a handle by a hypergraph through an eNCE way of rewriting, In this paper, we compare the language-generating power of HRNCE grammars with that a graph grammars mentioned above by comparing graph langrages generated by them, respecti vely.

• KIISE Transactions on Computing Practices
• /
• v.23 no.3
• /
• pp.156-164
• /
• 2017

Measuring the similarity of two graphs is a basic tool to solve graph problems in various applications. Most graph algorithms have a high time complexity according to the number of vertices and edges. Because Graphics Processing Units (GPUs) have a high computational power and can be obtained at a low cost, these have been widely used in graph applications to improve execution time. This paper proposes an efficient parallel algorithm to measure graph similarity using the CUDA on a GPU environment. The experimental results show that the proposed approach brings a considerable improvement in performance and efficiency when compared to CPU-based results. Our results also show that the performance is improved significantly as the size of the graph increases.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2278-2280
• /
• 1998

This paper discusses a technique that can detect cascading disturbances for automated monitoring and diagnosis systems in power plants. A multi-layered directed AND/OR graph called a disturbance interrelation analysis graph (DIAG) is utilized to represent the relationships among cascading disturbances and trace them. Disturbances that cannot be observed directly from sensors can be traced using techniques similar to interpolations and extrapolations on the DIAG.

• Kyungpook Mathematical Journal
• /
• v.62 no.3
• /
• pp.437-453
• /
• 2022

Unlike for polynomial rings, the notion of multiplication for the near-ring of polynomials is the substitution operation. This leads to somewhat surprising results. Let S be an abelian left near-ring with identity. The relation ~ on S defined by letting a ~ b if and only if ann_S(a) = ann_S(b), is an equivalence relation. The compressed zero-divisor graph 𝚪_E(S) of S is the undirected graph whose vertices are the equivalence classes induced by ~ on S other than [0]_S and [1]_S, in which two distinct vertices [a]_S and [b]_S are adjacent if and only if ab = 0 or ba = 0. In this paper, we are interested in studying the compressed zero-divisor graphs of the zero-symmetric near-ring of polynomials R₀[x] and the near-ring of the power series R₀[[x]] over a commutative ring R. Also, we give a complete characterization of the diameter of these two graphs. It is natural to try to find the relationship between diam(𝚪_E(R₀[x])) and diam(𝚪_E(R₀[[x]])). As a corollary, it is shown that for a reduced ring R, diam(𝚪_E(R)) ≤ diam(𝚪_E(R₀[x])) ≤ diam(𝚪_E(R₀[[x]])).

• Journal of applied mathematics & informatics
• /
• v.42 no.3
• /
• pp.663-680
• /
• 2024

The zero divisor graph is the most basic way of representing an algebraic structure as a graph. For any commutative ring R, each element is a vertex on the zero divisor graph and two vertices are defined as adjacent if and only if the product of those vertices equals zero. In this research, we determine some topological indices such as the Wiener index, the edge-Wiener index, the hyper-Wiener index, the Harary index, the first Zagreb index, the second Zagreb index, and the Gutman index of zero divisor graph of integers modulo prime power and its direct product.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.9 no.6
• /
• pp.96-102
• /
• 2000

Spinning mechanism is generally used in coasting process on grass plates. Rebounding PR(Photo Resist) which leads to occur inferiority of coating process is caused by vibrational energy of whole coating system. In this study, the sensitivity analysis is performed to analyze and reduce vibrational terms in the spin coating system. The sensitivity analysis is bared on the numerical expression of this system. By the bond graph method. power flow of each system is represented by some basic bond graph elements. Any energy domain system is modeled using the unified elements. The modelled spin coater system is verified with power spectrum data measured by FFT analyzer. As the results of verifying model parameters and sensitivity analysis, principal factors causing vibration phenomenon are mentioned. A study on vibration method in the spin coating system is discussed.