• 제목/요약/키워드: architecture graph

검색결과 151건 처리시간 0.024초

The Status Quo of Graph Databases in Construction Research

  • Jeon, Kahyun;Lee, Ghang
    • 국제학술발표논문집
    • /
    • The 9th International Conference on Construction Engineering and Project Management
    • /
    • pp.800-807
    • /
    • 2022
  • This study aims to review the use of graph databases in construction research. Based on the diagnosis of the current research status, a future research direction is proposed. The use of graph databases in construction research has been increasing because of the efficiency in expressing complex relations between entities in construction big data. However, no study has been conducted to review systematically the status quo of graph databases. This study analyzes 42 papers in total that deployed a graph model and graph database in construction research, both quantitatively and qualitatively. A keyword analysis, topic modeling, and qualitative content analysis were conducted. The review identified the research topics, types of data sources that compose a graph, and the graph database application methods and algorithms. Although the current research is still in a nascent stage, the graph database research has great potential to develop into an advanced stage, fused with artificial intelligence (AI) in the future, based on the active usage trends this study revealed.

  • PDF

Efficiency of Graph for the Remodularization of Multi-Level Software Architectures

  • Lala Madiha HAKIK
    • International Journal of Computer Science & Network Security
    • /
    • 제24권5호
    • /
    • pp.33-39
    • /
    • 2024
  • In a previous study we proceeded to the remodularization architecture based on classes and packages using the Formal Concept Analysis (FCA)[13] [14] [30]. we then got two possible remodularized architectures and we explored the issue of redistributing classes of a package to other packages, we used an approach based on Oriented Graph to determine the packages that receive the redistributed classes and we evaluated the quality of a remodularized software architecture by metrics [31] [28] [29]. In this paper, we will address the issue of the efficiency of the Oriented Graph in the remodularization of software architectures compared to the Formal Concept Analysis FCA method. The formal method of FCA concept is not popularized among scientists as opposed to the use of the labeled directed graph. It is for this reason that our directed graph approach is more effective in its simplicity and popularity.

Cross-architecture Binary Function Similarity Detection based on Composite Feature Model

  • Xiaonan Li;Guimin Zhang;Qingbao Li;Ping Zhang;Zhifeng Chen;Jinjin Liu;Shudan Yue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권8호
    • /
    • pp.2101-2123
    • /
    • 2023
  • Recent studies have shown that the neural network-based binary code similarity detection technology performs well in vulnerability mining, plagiarism detection, and malicious code analysis. However, existing cross-architecture methods still suffer from insufficient feature characterization and low discrimination accuracy. To address these issues, this paper proposes a cross-architecture binary function similarity detection method based on composite feature model (SDCFM). Firstly, the binary function is converted into vector representation according to the proposed composite feature model, which is composed of instruction statistical features, control flow graph structural features, and application program interface calling behavioral features. Then, the composite features are embedded by the proposed hierarchical embedding network based on a graph neural network. In which, the block-level features and the function-level features are processed separately and finally fused into the embedding. In addition, to make the trained model more accurate and stable, our method utilizes the embeddings of predecessor nodes to modify the node embedding in the iterative updating process of the graph neural network. To assess the effectiveness of composite feature model, we contrast SDCFM with the state of art method on benchmark datasets. The experimental results show that SDCFM has good performance both on the area under the curve in the binary function similarity detection task and the vulnerable candidate function ranking in vulnerability search task.

뮤지엄건축 공간배치의 정량적 분석방법에 관한 연구 -공간구문론(Space Syntax)과 가시장분석(Visibility Graph Analysis)을 중심으로 - (A Study on Quantitative Analysis Method of Museum Architecture Arrangement - Focused on Space Syntax and Visibility Graph Analysis -)

  • 박종구;이성훈
    • 한국실내디자인학회논문집
    • /
    • 제18권4호
    • /
    • pp.97-104
    • /
    • 2009
  • This thesis analyzed arrangement and mixture method of function elements, which are getting more important in museum planning. It used quantitative method, Space Syntax and Visibility Graph Analysis tool to analyze five case museums. Through this analysis, advantages and disadvantages of two methods were derived and case museums' arrangement and mixture attributes were grasped. Results of the analysis were derived differently by two kinds of plan form which were room to room type and open type. Open typed museum recorded similar graphs of Integration, Visual Integration and Visual Connectivity. Since whole space structures were relatively simple and structure of exhibition halls were opened, the results of Space Syntax and Visibility Graph Analysis had similar graphs. Room to room typed museum showed differences in Integration, Visual Integration and Visual Connectivity. In the result, the most accessible space was lobby and Mediation Space became the center of visibility. Also, the exhibition hall, where the opening of room to room typed exhibition hall was penetrated visually, became a center of visibility. Lobby space, which was close to entrance, had the highest Visibility Connectivity. As Space Syntax could analyze the museum as whole space structure, Space Syntax showed strength in room to room typed museum analysis compared to open typed museum analysis which has relatively simple structure. Visibility Graph Analysis could expect the flow of exhibit distance including visibility analysis unlike the flow of exhibit distance with space arrangement. The exhibition hall, which secures the sight to penetration of an opening, couldn't be analyzed in existing Space Syntax. However, it became the biggest advantages in Visibility Graph Analysis of room to room typed museum. Visibility Graph Analysis derived detailed results in exhibit arrangement so it will be the useful method not only for architecture but also for planning of exhibit arrangement in open typed museum. Through this study, various possibilities on Quantitative Analysis Method of Museum Architecture could be verified. However, the analysis still has limitation of second dimension. Therefore, diverse and liberal following study will be expected to accomplish.

슈퍼스칼라 프로세서 시뮬레이터의 생성을 위한 Attributed AND-OR 그래프 (Attributed AND-OR Graph for Synthesis of Superscalar Processor Simulator)

  • Jun Kyoung Kim;Tag Gon Kim
    • 한국시뮬레이션학회:학술대회논문집
    • /
    • 한국시뮬레이션학회 2003년도 춘계학술대회논문집
    • /
    • pp.73-78
    • /
    • 2003
  • This paper proposes the simulator synthesis scheme which is based on the exploration of the total design space in attributed AND-OR graph. Attributed AND-OR graph is a systematic design space representation formalism which enables to represent all the design space by decomposition rule and specialization rule. In addition, attributes attached to the design entity provides flexible modeling. Based on this design space representation scheme, a pruning algorithm which can transform the total design space into sub-design space that satisfies the user requirements is given. We have shown the effectiveness of our framework by (ⅰ) constructing the design space of superscalar processor in attributed AND-OR graph (ⅱ) pruning it to obtain the ARM9 processor architecture. (ⅲ) modeling the components of the architecture and (ⅳ) simulating the ARM9 model.

  • PDF

Double Vertex 그래프에 의한 궤도회로 토플로지의 생성 (Track Circuit Topology Design by Double Vertex Graph Algorithm)

  • 황종규;이종우;정의진;김태진
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2000년도 추계학술대회 논문집 학회본부 B
    • /
    • pp.389-391
    • /
    • 2000
  • A representation technique of a given track topology is required by many software applications in railway technology such as signalling system simulator. To achieve these, the concept of double vertex graph architecture is proposed. These are composed of pairs of vertices and node between the single vertices. Double vertex graph architecture can be understood as a extension of classical graphs. In developed railway signalling simulation software, it is shown that track topology can be represented by proposed algorithm in a efficient way. Especially it makes sure that these are suitable technique for representing and implementing of switch, routes which can be introduced some mistake in classical graph algorithm.

  • PDF

아키텍처 기반 소프트웨어 개발에서 소프트웨어 아키텍처 변형을 지원하기 위한 방법 (An Approach to Support Software Architecture Transformation in Architecture-Based Software Development)

  • 최희석;염근혁
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제32권1호
    • /
    • pp.10-21
    • /
    • 2005
  • 소프트웨어 아키텍처는 복잡 다양한 소프트웨어 시스템을 개발하는 데 있어서 개발될 소프트웨어의 품질 달성에 중요한 영향을 미치는 핵심 설계로서 인식되고 있다. 따라서 아키텍처 기반의 소프트웨어 개발에서 고품질 소프트웨어 개발을 위하여 소프트웨어 아키텍처에 대한 변형이 필수적으로 요구된다. 그러나 아키텍처 변형 시 적용 가능한 설계 대안들의 다양성과 그것들이 아키텍처에 미치는 결과에 대한 예측의 어려움으로 인하여, 소프트웨어 아키텍처 변형을 적용하는 것이 쉽지 않다. 그러므로 다양한 설계 대안들이 아키텍처에 미치는 결과를 이해하고 분석하는 것을 통하여 소프트웨어 아키텍처 변형을 지원하기 위한 방법이 필요하다. 본 논문에서는 소프트웨어 아키텍처 변형을 체계적으로 지원하기 위한 방법을 제안한다. 제안하는 방법에서는 소프트웨어 아키텍처에 포함된 아키텍처 설계 결정들과 그것들에 대한 제약조건들을 바탕으로 결정 제약조건 그래프를 정의한다. 결정 제약조건 그래프를 이용하여 소프트웨어 아키텍처의 주요 설계 결정들간의 의존 관계를 명시적으로 나타냄으로써, 소프트웨어 아키텍처 변형 과정에서 특정 설계 결정에 대한 설계 변형이 아키텍처에 미치는 영향을 체계적으로 분석 가능하게 한다. 본 논문에서 제시하는 소프트웨어 아키텍처 변형 방법은 아키텍처 변형에 대한 전반적인 이해를 용이하게 함과 동시에, 궁극적으로는 고품질 소프트웨어 개발을 위한 새로운 버전의 아키텍처 재생성을 돕는다

그래프 합성곱-신경망 구조 탐색 : 그래프 합성곱 신경망을 이용한 신경망 구조 탐색 (Graph Convolutional - Network Architecture Search : Network architecture search Using Graph Convolution Neural Networks)

  • 최수연;박종열
    • 문화기술의 융합
    • /
    • 제9권1호
    • /
    • pp.649-654
    • /
    • 2023
  • 본 논문은 그래프 합성곱 신경망을 이용한 신경망 구조 탐색 모델 설계를 제안한다. 딥 러닝은 블랙박스로 학습이 진행되는 특성으로 인해 설계한 모델이 최적화된 성능을 가지는 구조인지 검증하지 못하는 문제점이 존재한다. 신경망 구조 탐색 모델은 모델을 생성하는 순환 신경망과 생성된 네트워크인 합성곱 신경망으로 구성되어있다. 통상의 신경망 구조 탐색 모델은 순환신경망 계열을 사용하지만 우리는 본 논문에서 순환신경망 대신 그래프 합성곱 신경망을 사용하여 합성곱 신경망 모델을 생성하는 GC-NAS를 제안한다. 제안하는 GC-NAS는 Layer Extraction Block을 이용하여 Depth를 탐색하며 Hyper Parameter Prediction Block을 이용하여 Depth 정보를 기반으로 한 spatial, temporal 정보(hyper parameter)를 병렬적으로 탐색합니다. 따라서 Depth 정보를 반영하기 때문에 탐색 영역이 더 넓으며 Depth 정보와 병렬적 탐색을 진행함으로 모델의 탐색 영역의 목적성이 분명하기 때문에 GC-NAS대비 이론적 구조에 있어서 우위에 있다고 판단된다. GC-NAS는 그래프 합성곱 신경망 블록 및 그래프 생성 알고리즘을 통하여 기존 신경망 구조 탐색 모델에서 순환 신경망이 가지는 고차원 시간 축의 문제와 공간적 탐색의 범위 문제를 해결할 것으로 기대한다. 또한 우리는 본 논문이 제안하는 GC-NAS를 통하여 신경망 구조 탐색에 그래프 합성곱 신경망을 적용하는 연구가 활발히 이루어질 수 있는 계기가 될 수 있기를 기대한다.

동적 링크 구조상에서의 얼굴 인식 기술에 관한 연구 (A study on Face Recognition Technology in the Dynamic Link Architecture)

  • 이승철;김현승;김지운;박상희
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1999년도 하계학술대회 논문집 G
    • /
    • pp.3236-3238
    • /
    • 1999
  • This paper proposes a new face recognition technique in the dynamic link architecture which shows robustness against size variation and distortion. The face recognition technique in the dynamic link architecture so far was not appropriate for the recognition of various size of faces because of the fixed size of the graph and the fixed value of a of the Gabor filter not considering the size of the face. The proposed face recognition algorithm can represent the input facial image by a suitable size of labeled graph, and it can also adjust the dilation width and the height of the vibrating amplitude of the Gabor filter, thus face recognition in the dynamic link architecture is even applicable regardless of the size of the face.

  • PDF

그래프 데이터베이스 기반 자동 PDDL Planning 시스템 (Automated PDDL Planning System using Graph Database)

  • 문지윤
    • 한국전자통신학회논문지
    • /
    • 제18권4호
    • /
    • pp.709-714
    • /
    • 2023
  • 유연한 planning system은 로봇이 다양한 임무를 수행하기 위해서 중요한 요소이다. 본 논문에서는 변화하는 환경에 대응할 수 있는 automated planning system architecture를 소개한다. 심볼릭 기반의 task planning을 위해 PDDL을 활용하였으며 실시간 환경 정보 업데이트를 위해 그래프 데이터베이스를 이용한다. 제안한 구조는 시나리오 기반 실험을 통해 검증하였다.