• Title/Summary/Keyword: graph convergence

Search Result 190, Processing Time 0.026 seconds

A Resource-Constrained Scheduling Algorithm for High Level Synthesis (상위레벨 회로합성을 위한 자원제한 스케줄링 알고리즘)

  • Hwang In-Jae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.6 no.1
    • /
    • pp.39-44
    • /
    • 2005
  • Scheduling for digital system synthesis is assigning each operation in a control/data flow graph(CDFG) to a specific control step without violating precedence relation. It is one of the most important tasks due to its direct influence on the performance of the hardware synthesized. In this paper, we propose a resource-constrained scheduling algorithm. Our algorithm first analyzes the given CDFG to determine the number of functional units of each type, then assigns each operation to a control step while satisfying the constraints. It also tries to improve the solution iteratively by adjusting the number of functional units using the results collected from the previous scheduling. Experiments were performed to test the performance of the proposed algorithm, and results are presented

  • PDF

Improving the Performance of Genetic Algorithms using Gene Reordering (유전자 재배열을 이용한 유전자 알고리즘의 성능향상)

  • Hwang, In-Jae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.7 no.4
    • /
    • pp.201-206
    • /
    • 2006
  • Genetic Algorithms have been known to provide near optimal solutions for various optimization problems in engineering. In this paper, we study the effect of gene order in genetic algorithms on the defining length of the schema with high fitness values. Its effect on the performance of genetic algorithms was also analyzed through two well known problems. A few gene reordering methods were proposed for graph partitioning and knapsack problems. Experimental results showed that genetic algorithms with gene reordering could find solutions of better qualities compared to the ones without gene reordering. It is very important to find proper reordering method for a given problem to improve the performance of genetic algorithms.

  • PDF

A System for Improving Data Leakage Detection based on Association Relationship between Data Leakage Patterns

  • Seo, Min-Ji;Kim, Myung-Ho
    • Journal of Information Processing Systems
    • /
    • v.15 no.3
    • /
    • pp.520-537
    • /
    • 2019
  • This paper proposes a system that can detect the data leakage pattern using a convolutional neural network based on defining the behaviors of leaking data. In this case, the leakage detection scenario of data leakage is composed of the patterns of occurrence of security logs by administration and related patterns between the security logs that are analyzed by association relationship analysis. This proposed system then detects whether the data is leaked through the convolutional neural network using an insider malicious behavior graph. Since each graph is drawn according to the leakage detection scenario of a data leakage, the system can identify the criminal insider along with the source of malicious behavior according to the results of the convolutional neural network. The results of the performance experiment using a virtual scenario show that even if a new malicious pattern that has not been previously defined is inputted into the data leakage detection system, it is possible to determine whether the data has been leaked. In addition, as compared with other data leakage detection systems, it can be seen that the proposed system is able to detect data leakage more flexibly.

Enhancing Work Trade Image Classification Performance Using a Work Dependency Graph (공정의 선후행관계를 이용한 공종 이미지 분류 성능 향상)

  • Jeong, Sangwon;Jeong, Kichang
    • Korean Journal of Construction Engineering and Management
    • /
    • v.22 no.1
    • /
    • pp.106-115
    • /
    • 2021
  • Classifying work trades using images can serve an important role in a multitude of advanced applications in construction management and automated progress monitoring. However, images obtained from work sites may not always be clean. Defective images can damage an image classifier's accuracy which gives rise to a needs for a method to enhance a work trade image classifier's performance. We propose a method that uses work dependency information to aid image classifiers. We show that using work dependency can enhance the classifier's performance, especially when a base classifier is not so great in doing its job.

FedGCD: Federated Learning Algorithm with GNN based Community Detection for Heterogeneous Data

  • Wooseok Shin;Jitae Shin
    • Journal of Internet Computing and Services
    • /
    • v.24 no.6
    • /
    • pp.1-11
    • /
    • 2023
  • Federated learning (FL) is a ground breaking machine learning paradigm that allow smultiple participants to collaboratively train models in a cloud environment, all while maintaining the privacy of their raw data. This approach is in valuable in applications involving sensitive or geographically distributed data. However, one of the challenges in FL is dealing with heterogeneous and non-independent and identically distributed (non-IID) data across participants, which can result in suboptimal model performance compared to traditionalmachine learning methods. To tackle this, we introduce FedGCD, a novel FL algorithm that employs Graph Neural Network (GNN)-based community detection to enhance model convergence in federated settings. In our experiments, FedGCD consistently outperformed existing FL algorithms in various scenarios: for instance, in a non-IID environment, it achieved an accuracy of 0.9113, a precision of 0.8798,and an F1-Score of 0.8972. In a semi-IID setting, it demonstrated the highest accuracy at 0.9315 and an impressive F1-Score of 0.9312. We also introduce a new metric, nonIIDness, to quantitatively measure the degree of data heterogeneity. Our results indicate that FedGCD not only addresses the challenges of data heterogeneity and non-IIDness but also sets new benchmarks for FL algorithms. The community detection approach adopted in FedGCD has broader implications, suggesting that it could be adapted for other distributed machine learning scenarios, thereby improving model performance and convergence across a range of applications.

A Study on the Real-time Data Interface Technology based on SCM for Shipbuilding and Marine Equipment Production (조선해양기자재 제작을 위한 SCM 기반 실시간 데이터 인터페이스 기술에 관한 연구)

  • Myeong-Ki Han;Young-Hun Kim;Jun-Su Park;Won-Ho Lee
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.27 no.1
    • /
    • pp.143-149
    • /
    • 2024
  • The production and procurement of shipbuilding and offshore equipment is an important competitive factor in the shipbuilding and offshore industry. Recently, ICT-based digital technology has been rapidly applied to the manufacturing industry following the Fourth Industrial Revolution. Under the digital transformation, real-time data interface technology based on SCM (Supply Chain Management) is emerging as an important tool to improve the efficiency of the equipment manufacturing process. In this study, the characteristics and advantages and disadvantages of interface technologies of web-based data interface technologies were compared and analyzed. The performance was compared between theoretical evaluation based on technical features and practical application cases. As a result, it was confirmed that GraphQL is useful for selective data processing, but there is a problem with optimization, and REST API has a problem with receiving data due to a fixed data structure. Therefore, this study aims to suggest ways to utilize and optimize these data interface technologies.

A Study on Real-time State Estimation for Smart Microgrids (스마트 마이크로그리드 실시간 상태 추정에 관한 연구)

  • Bae, Jun-Hyung;Lee, Sang-Woo;Park, Tae-Joon;Lee, Dong-Ha;Kang, Jin-Kyu
    • 한국태양에너지학회:학술대회논문집
    • /
    • 2012.03a
    • /
    • pp.419-424
    • /
    • 2012
  • This paper discusses the state-of-the-art techniques in real-time state estimation for the Smart Microgrids. The most popular method used in traditional power system state estimation is a Weighted Least Square(WLS) algorithm which is based on Maximum Likelihood(ML) estimation under the assumption of static system state being a set of deterministic variables. In this paper, we present a survey of dynamic state estimation techniques for Smart Microgrids based on Belief Propagation (BP) when the system state is a set of stochastic variables. The measurements are often too sparse to fulfill the system observability in the distribution network of microgrids. The BP algorithm calculates posterior distributions of the state variables for real-time sparse measurements. Smart Microgrids are modeled as a factor graph suitable for characterizing the linear correlations among the state variables. The state estimator performs the BP algorithm on the factor graph based the stochastic model. The factor graph model can integrate new models for solar and wind correlation. It provides the Smart Microgrids with a way of integrating the distributed renewable energy generation. Our study on Smart Microgrid state estimation can be extended to the estimation of unbalanced three phase distribution systems as well as the optimal placement of smart meters.

  • PDF

Graph Database based Malware Behavior Detection Techniques (그래프 데이터베이스 기반 악성코드 행위 탐지 기법)

  • Choi, Do-Hyeon;Park, Jung-Oh
    • Journal of Convergence for Information Technology
    • /
    • v.11 no.4
    • /
    • pp.55-63
    • /
    • 2021
  • Recently, the incidence rate of malicious codes is over tens of thousands of cases, and it is known that it is almost impossible to detect/respond all of them. This study proposes a method for detecting multiple behavior patterns based on a graph database as a new method for dealing with malicious codes. Traditional dynamic analysis techniques and has applied a method to design and analyze graphs of representative associations malware pattern(process, PE, registry, etc.), another new graph model. As a result of the pattern verification, it was confirmed that the behavior of the basic malicious pattern was detected and the variant attack behavior(at least 5 steps), which was difficult to analyze in the past. In addition, as a result of the performance analysis, it was confirmed that the performance was improved by about 9.84 times or more compared to the relational database for complex patterns of 5 or more steps.

A Semantic Distance Measurement Model using Weights on the LOD Graph in an LOD-based Recommender System (LOD-기반 추천 시스템에서 LOD 그래프에 가중치를 사용한 의미 거리 측정 모델)

  • Huh, Wonwhoi
    • Journal of the Korea Convergence Society
    • /
    • v.12 no.7
    • /
    • pp.53-60
    • /
    • 2021
  • LOD-based recommender systems usually leverage the data available within LOD datasets, such as DBpedia, in order to recommend items(movies, books, music) to the end users. These systems use a semantic similarity algorithm that calculates the degree of matching between pairs of Linked Data resources. In this paper, we proposed a new approach to measuring semantic distance in an LOD-based recommender system by assigning weights converted from user ratings to links in the LOD graph. The semantic distance measurement model proposed in this paper is based on a processing step in which a graph is personalized to a user through weight calculation and a method of applying these weights to LDSD. The Experimental results showed that the proposed method showed higher accuracy compared to other similar methods, and it contributed to the improvement of similarity by expanding the range of semantic distance measurement of the recommender system. As future work, we aim to analyze the impact on the model using different methods of LOD-based similarity measurement.

Speed Prediction and Analysis of Nearby Road Causality Using Explainable Deep Graph Neural Network (설명 가능 그래프 심층 인공신경망 기반 속도 예측 및 인근 도로 영향력 분석 기법)

  • Kim, Yoo Jin;Yoon, Young
    • Journal of the Korea Convergence Society
    • /
    • v.13 no.1
    • /
    • pp.51-62
    • /
    • 2022
  • AI-based speed prediction studies have been conducted quite actively. However, while the importance of explainable AI is emerging, the study of interpreting and reasoning the AI-based speed predictions has not been carried out much. Therefore, in this paper, 'Explainable Deep Graph Neural Network (GNN)' is devised to analyze the speed prediction and assess the nearby road influence for reasoning the critical contributions to a given road situation. The model's output was explained by comparing the differences in output before and after masking the input values of the GNN model. Using TOPIS traffic speed data, we applied our GNN models for the major congested roads in Seoul. We verified our approach through a traffic flow simulation by adjusting the most influential nearby roads' speed and observing the congestion's relief on the road of interest accordingly. This is meaningful in that our approach can be applied to the transportation network and traffic flow can be improved by controlling specific nearby roads based on the inference results.