• Title/Summary/Keyword: Graph Pattern

Search Result 204, Processing Time 0.028 seconds

AMI Network Failure Analysis based on Graph Database (그래프 데이터베이스 기반 AMI 네트워크 장애 분석)

  • Jeong, Woo-Cheol;Jun, Moon-Seog;Choi, Do-Hyeon
    • Journal of Convergence for Information Technology
    • /
    • v.10 no.7
    • /
    • pp.41-48
    • /
    • 2020
  • Recently, the spreading business of AMI (Advanced Metering Infrastructure) remote metering systems in various regions of the country has been activated, and it provides various metering functions such as two-way communication and security plan functions for power demand management. Current AMI system is difficult to analyze based on the existing RDB(Relational Database) due to the increase in the size of new internal IoT devices and networks. This study proposes a new GDB(Graph Database) based failure analysis method that utilizes existing RDB data. It analyzes the correlation of new failure patterns through accumulated data such as internal thresholds and status values. As a result of GDB-based simulation, it was confirmed that RDB can predict to a new obstacle pattern that was difficult to analyze.

Characteristics of Feeding Behavior of the Rice Brown Planthopper, Nilaparvata lugens, Using Electrical Penetration Graph (EPG) Technique on Different Rice Varieties (EPG를 이용한 벼 재배품종별 벼멸구의 섭식행동특성)

  • Kim, N.S.;Seo, M.J.;Youn, Y.N.
    • Korean journal of applied entomology
    • /
    • v.44 no.3 s.140
    • /
    • pp.177-187
    • /
    • 2005
  • For the comparison of feeding behavior of Nilaparvata lugens among different rice varieties, electrical penetration graph (EPG) technique was used. Ten rice varieties were selected from national-widely recommended rice varieties cultivating in Chungnam province. The correlation between feeding duration and honeydew amount excreted was investigated, and the types of EPG pattern were analyzed among rice varieties. The EPG patterns divided into 6 types according to electrical specific feature, respectively. Type 1 pattern was a searching feeding sites, resting or wandering on a rice plant. Type 2 pattern was appeared when the insect untaken from phloem sieve element. Type 3 pattern was observed when the insect piercing into the rice plant. Type 4 pattern was observed when the insect salivating in rice plant. Type 5 pattern was observed when the insect ingesting from the xylem. Type 6 pattern was observed when the stylet moving in cell. Feeding duration time on Gum-nam was significantly shorter than Dong-jin, Dae-ahn, Dong-ahn, Dae-san. Also, on Gun-nam, it was shown that the brown planthopper did not penetrate the cuticle for a long time. The total number of excreted honeydew droplets by the brown planthopper was the greatest in Dong-jin variety and the least in Gum-nam variety. In proportion to phloem feeding time, the number of honeydew droplets had been increased. According to the results of EPG patterns and honeydew droplets analysis, N. lugens seems to prefer Dong-jin, Dong-ahn, Dae-san, and Dae-ahn to Gum-nam, Da-san, and Nam-chun rice plant variety.

A Musical Symbol recognition By Using Graphical Distance Measures (그래프간 유사도 측정에 의한 음악 기호 인식)

  • Jun, Jung-Woo;Jang, Kyung-Shik;Heo, Gyeong-Yong;Kim, Jai-Hie
    • The Journal of the Acoustical Society of Korea
    • /
    • v.15 no.1
    • /
    • pp.54-60
    • /
    • 1996
  • In most pattern recognition and image understanding applications, images are degraded by noise and other distortions. Therefore, it is more relevant to decide how similar two objects are rather than to decide whether the two are exactly the same. In this paper, we propose a method for recognizing degraded symbols using a distance measure between two graphs representing the symbols. a symbol is represented as a graph consisting of nodes and edges based on the run graph concept. The graph is then transformed into a reference model graph with production rule containing the embedding transform. The symbols are recognized by using the distance measure which is estimated by using the number of production rules used and the structural homomorphism between a transformed graph and a model graph. the proposed approach is applies to the recognition of non-note musical symbols and the result are given.

  • PDF

THE PRIMITIVE BASES OF THE SIGNED CYCLIC GRAPHS

  • Kim, Byeong Moon;Song, Byung Chul
    • Korean Journal of Mathematics
    • /
    • v.21 no.1
    • /
    • pp.55-62
    • /
    • 2013
  • The base $l(S)$ of a signed digraph S is the maximum number $k$ such that for any vertices $u$, $v$ of S, there is a pair of walks of length $k$ from $u$ to $v$ with different signs. A graph can be regarded as a digraph if we consider its edges as two-sided arcs. A signed cyclic graph $\tilde{C_n}$ is a signed digraph obtained from the cycle $C_n$ by giving signs to all arcs. In this paper, we compute the base of a signed cyclic graph $\tilde{C_n}$ when $\tilde{C_n}$ is neither symmetric nor antisymmetric. Combining with previous results, the base of all signed cyclic graphs are obtained.

An Analysis of the Apartment House Plans in Seoul by Means of a New Graph-theoretic Method (그래프 기법에 의한 서울시 아파트 평면분석에 관한 연구)

  • Seo, Kyung-Wook
    • Journal of the Korean housing association
    • /
    • v.18 no.2
    • /
    • pp.121-128
    • /
    • 2007
  • The investigation of the apartment housing as a dwelling type has become the most important and popular research subject to understand the housing culture in Korea. In their methods of typological analysis, it is found that most studies represent each unit plan as a simplified architectural drawing. This type of typology, however, has difficulties in processing a large scale of data set because each representation of a plan contain too many informations. To deal with this problem, this study suggests a new graph-theoretical method by which apartment plans can be represented in a more simple and effective way. This new method is also tested against the sample plans from Gangnam-gu area in Seoul to reveal the design logic hidden in plan configuration. Through a series of analyses, it is verified that there exist a design strategy that guides the particular pattern of zoning and allocation of each room in the plan.

Analysis of Commute Time Embedding Based on Spectral Graph (스펙트럴 그래프 기반 Commute Time 임베딩 특성 분석)

  • Hahn, Hee-Il
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.1
    • /
    • pp.34-42
    • /
    • 2014
  • In this paper an embedding algorithm based on commute time is implemented by organizing patches according to the graph-based metric, and its performance is analyzed by comparing with the results of principal component analysis embedding. It is usual that the dimensionality reduction be done within some acceptable approximation error. However this paper shows the proposed manifold embedding method generates the intrinsic geometry corresponding to the signal despite severe approximation error, so that it can be applied to the areas such as pattern classification or machine learning.

Graph Database Design and Implementation for Ransomware Detection (랜섬웨어 탐지를 위한 그래프 데이터베이스 설계 및 구현)

  • Choi, Do-Hyeon
    • Journal of Convergence for Information Technology
    • /
    • v.11 no.6
    • /
    • pp.24-32
    • /
    • 2021
  • Recently, ransomware attacks have been infected through various channels such as e-mail, phishing, and device hacking, and the extent of the damage is increasing rapidly. However, existing known malware (static/dynamic) analysis engines are very difficult to detect/block against novel ransomware that has evolved like Advanced Persistent Threat (APT) attacks. This work proposes a method for modeling ransomware malicious behavior based on graph databases and detecting novel multi-complex malicious behavior for ransomware. Studies confirm that pattern detection of ransomware is possible in novel graph database environments that differ from existing relational databases. Furthermore, we prove that the associative analysis technique of graph theory is significantly efficient for ransomware analysis performance.

An efficient approach of avoiding extensions of duplicated graph patterns in cyclic graph mining (순환 그래프 마이닝에서 중복된 그래프 패턴의 확장을 피하는 효율적인 기법)

  • No, Young-Sang;Yun, Un-Il;Pyun, Gwang-Bum;Ryang, Heung-Mo;Lee, Gang-In;Ryu, Keun-Ho;Lee, Kyung-Min
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.12
    • /
    • pp.33-41
    • /
    • 2011
  • From Complicated graph structures, duplicated operations can be executed and the operations give low efficiency. In this paper, we propose an efficient graph mining algorithm of minimizing the extension of duplicated graph patterns in which the priorities of cyclic edges are considered. In our approach, the cyclic edges with lower priorities are first extended and so duplicated extensions can be reduced. For performance test, we implement our algorithm and compare our algorithm with a state of the art, Gaston algorithm. Finally, We show that ours outperforms Gaston algorithm.

Mobility Support Scheme Based on Machine Learning in Industrial Wireless Sensor Network (산업용 무선 센서 네트워크에서의 기계학습 기반 이동성 지원 방안)

  • Kim, Sangdae;Kim, Cheonyong;Cho, Hyunchong;Jung, Kwansoo;Oh, Seungmin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.11
    • /
    • pp.256-264
    • /
    • 2020
  • Industrial Wireless Sensor Networks (IWSNs) is exploited to achieve various objectives such as improving productivity and reducing cost in the diversity of industrial application, and it has requirements such as low-delay and high reliability packet transmission. To accomplish the requirement, the network manager performs graph construction and resource allocation about network topology, and determines the transmission cycle and path of each node in advance. However, this network management scheme cannot treat mobile devices that cause continuous topology changes because graph reconstruction and resource reallocation should be performed as network topology changes. That is, despite the growing need of mobile devices in many industries, existing scheme cannot adequately respond to path failure caused by movement of mobile device and packet loss in the process of path recovery. To solve this problem, a network management scheme is required to prevent packet loss caused by mobile devices. Thus, we analyse the location and movement cycle of mobile devices over time using machine learning for predicting the mobility pattern. In the proposed scheme, the network manager could prevent the problems caused by mobile devices through performing graph construction and resource allocation for the predicted network topology based on the movement pattern. Performance evaluation results show a prediction rate of about 86% compared with actual movement pattern, and a higher packet delivery ratio and a lower resource share compared to existing scheme.

A Study on the Correlation between the Bell's Palsy and the 7-Zone-diagnostic System - Evaluated by the Patterns of Zone 2 of Factor AA - (구안와사와 7구역진단기의 상관성 연구 - Factor AA 제2구역의 유형을 중심으로 -)

  • Cho, Yi-Hyun;Lee, Jin-Bok;Im, Jeong-Gyun;Park, Ka-Young;Yook, Tae-Han;Song, Beom-Yong
    • Journal of Acupuncture Research
    • /
    • v.27 no.2
    • /
    • pp.1-10
    • /
    • 2010
  • Objectives : The 7-zone-diagnostic system is a diagnostic device to predetermine bodily locations by measuring the energy of body. This study was to investigate the relation between the different patterns of Zone 2 of Factor AA in CP-6000A (VEGA, Germany), 7-zone-diagnostic system and the factors of Bell's Palsy. Methods : This study was carried out with the data from factors of Bell's Palsy(age, sex, period after onset, postauricular pain, season which the disease happen, contributing factor). We made three groups according to the different patterns of Zone 2 of Factor AA in CP-6000A. The Factor AA pattern of Group A is that the red bar graph of zone 2 were lower than the normal range. The Factor AA pattern of Group B was that the red bar graph of zone 2 was the normal range. The Factor AA pattern of Group C was that the red bar graph of zone 2 was higher than the normal range. After collecting the data about factors of Bel's Palsy to correspond with conditions of each group were selected, the data was analyzed statistically. Results : The values of number of patient and period after onset of group A was higher than group B and C. The values of ratio of postauricular pain of group B and C was higher than group A. The season of disease happened of group A is spring and winter, group B is winter and group C is summer and autumn. The contributing factor of disease happened of group A is none, and group B and C is stress and clod. Conclusions : In Bell's Palsy, it is thought that the red bar graph of zone 2 is lower, the group have lower energy(虛) and the energy has a character of cold(寒), and zone 2 is higher, the group has the higher energy(實) and the energy has a character of fire(熱).