• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.9
• /
• pp.413-422
• /
• 2002

In a power plant, disturbance detection and diagnosis are massive and complex problems. Once a disturbance occurs, it can be either persistent, self cleared, cleared by the automatic controllers or propagated into another disturbance until it subsides in a new equilibrium or a stable state. In addition to the Physical complexity of the power plant structure itself, these dynamic behaviors of the disturbances further complicate the fault monitoring and diagnosis tasks. A data structure called a disturbance interrelation analysis graph(DIAG) is proposed in this paper, trying to capture, organize and better utilize the vast and interrelated knowledge required for power plant disturbance detection and diagnosis. The DIAG is a multi-layer directed AND/OR graph composed of 4 layers. Each layer includes vertices that represent components, disturbances, conditions and sensors respectively With the implementation of the DIAG, disturbances and their relationships can be conveniently represented and traced with modularized operations. All the cascaded disturbances following an initial triggering disturbance can be diagnosed in the context of that initial disturbance instead of diagnosing each of them as an individual disturbance. DIAG is applied to a typical cooling water system of a thermal power plant and its effectiveness is also demonstrated.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2002.05a
• /
• pp.91-96
• /
• 2002

This study is to investigate the insulation performance of lightweight concrete using recycled lightweight aggregate, to develop lightweight concrete products which have an excellence on the insulation performance are satisfied with properties of building materials. As a result of this study, recycled EPS aggregate is considered to have an independent pores which is closed by dense partitions. So, it is showed that the insulation performance of lightweight concrete using recycled EPS aggregate are excellent. Especially, in the case of lightweight concrete under conditions of replacement ratio over 100%, it is considered that insulation performance is very excellent as thermal conductivity is showed about 0.2kcal/mh$^{\circ}C$. According to considering the relation between ultrasonic pulse velocity, unit weight and thermal conductivity through the graph, the result of relation between ultrasonic pulse velocity, unit weight and thermal conductivity on the graph expressed their high interaction shown as direct proportion on the graph. So that it is possible to extract the insulation performance of lightweight concrete using recycled EPS aggregate by ultrasonic pulse velocity and unit weight.

• Journal of Korea Multimedia Society
• /
• v.19 no.12
• /
• pp.1927-1935
• /
• 2016

This paper propose a framework for human body parts in RGB-D image. We conduct tasks of obtaining person area, finding candidate areas and local detection in order to detect hand, foot and head which have features of long accumulative geodesic distance. A person area is obtained with background subtraction and noise removal by using depth image which is robust to illumination change. Finding candidate areas performs construction of graph model which allows us to measure accumulative geodesic distance for the candidates. Instead of raw depth map, our approach constructs graph model with segmented regions by quadtree structure to improve searching time for the candidates. Local detection uses HOG based SVM for each parts, and head is detected for the first time. To minimize false detections for hand and foot parts, the candidates are classified with upper or lower body using the head position and properties of geodesic distance. Then, detect hand and foot with the local detectors. We evaluate our algorithm with datasets collected Kinect v2 sensor, and our approach shows good performance for head, hand and foot detection.

• Journal of the Korean Mathematical Society
• /
• v.45 no.3
• /
• pp.711-725
• /
• 2008

We give an explicit construction of Grobner-Shirshov pairs and monomial bases for finite-dimensional irreducible representations of the simple Lie algebra $sp_4$. We also identify the monomial basis consisting of the reduced monomials with a set of semistandard tableaux of a given shape, on which we give a colored oriented graph structure.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.83-93
• /
• 2006

A graph is k-cyclable if given k vertices there is a cycle that contains the k vertices. Sallee showed that every finite 3-connected planar graph is 5-cyclable. In this paper, by characterizing the circuit graphs and investigating the structure of LV-graphs, we extend his result to 3-connected infinite locally finite VAP-free plane graphs.

• ETRI Journal
• /
• v.5 no.3
• /
• pp.16-25
• /
• 1983

Increasing importance is being attached to the idea of measuring software characteristics. This paper deals with following things. First, a relation of program and flow graph is discussed. It describes a theoretic complexity measure and illustrates how it can be used to manage and control program complexity. Second, cyclomatic complexity measure is discussed. The complexity is independent of physical size and depends only on the decision structure of a program. Third, consider a knot which defines crossing point and provide the ordering of the nodes to make the transition from a two dimensional graph to a one dimensional program. A program modules that can improve FORTRAN IV program text is tested by knot counting and its control complexity is improved.

• Journal of the Korean Mathematical Society
• /
• v.56 no.6
• /
• pp.1515-1528
• /
• 2019

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A{\subseteq}F^d_q$ and edges assigned the algebraic distance between pairs of vertices. We prove nontrivial results on locating specified subgraphs of maximum vertex degree at most t in dimensions $d{\geq}2t$.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1464-1473
• /
• 2000

In this paper, we analyze the cycle property of the (n,k)-star graph that has an attention as an alternative interconnection network topology in recent years. Based on the graph-theoretic properties in (n,k)-star graphs, we show the pancyclic property of the graph and also present the corresponding algorithm. Based on the recursive structure of the graph, we present such top-down approach that the resulting cycle can be constructed by applying series of "dimension expansion" operations to a kind of cycles consisting of sub-graphs. This processing naturally leads to such property that the resulting cycles tend to be integrated compactly within some minimal subset of sub-graphs, and also means its applicability of another classes of the disjoint-style cycle problems. This result means not only the graph-theoretic contribution of analyzing the pancyclic property in the underlying graph model but also the parallel processing applications such a as message routing or resource allocation and scheduling in the multi-computer system with the corresponding interconnection network.

• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.3
• /
• pp.159-168
• /
• 2012

Relation in the new IT environment, such as the SNS, Cloud, Web3.0, has become an important factor. And these relations generate a transaction. However, existing relational database and graph database does not processe graph structure representing the relationships and transactions. This paper, we propose the technique that can be processed concurrently graph structures and transactions in a scalable complex network system. The proposed technique simultaneously save and navigate graph structures and transactions using the Topic Maps data model. Topic Maps is one of ontology language to implement the semantic web(Web 3.0). It has been used as the navigator of the information through the association of the information resources. In this paper, the architecture of the proposed technique was implemented and design using Cassandra - one of column type NoSQL. It is to ensure that can handle up to Big Data-level data using distributed processing. Finally, the experiments showed about the process of storage and query about typical RDBMS Oracle and the proposed technique to the same data source and the same questions. It can show that is expressed by the relationship without the 'join' enough alternative to the role of the RDBMS.

• The Journal of Bigdata
• /
• v.5 no.1
• /
• pp.77-88
• /
• 2020

Recently, many researches habe been done to organize and analyze various complex relationships in real world, represented in the form of graphs. In particular, the computer field literature data system, such as DBLP, is a representative graph data in which can be composed of papers, their authors, and citation among papers. Becasue graph data is very complex in storage structure and expression, it is very difficult task to search, analysis, and visualize a large size of bibliographic big data. In this paper, we develop a graphic user interface tool, called EEUM, which visualizes bibliographic big data in the form of graphs. EEUM provides the features to browse bibliographic big data according to the connected graph structure by visually displaying graph data, and implements search, management and analysis of the bibliographc big data. It also shows that EEUM can be conveniently used to search, explore, and analyze by applying EEUM to the bibliographic graph big data provided by DBLP. Through EEUM, you can easily find influential authors or papers in every research fields, and conveniently use it as a search and analysis tool for complex bibliographc big data, such as giving you a glimpse of all the relationships between several authors and papers.