• Title/Summary/Keyword: Software Graph

Search Result 310, Processing Time 0.025 seconds

Deep Neural Network-Based Scene Graph Generation for 3D Simulated Indoor Environments (3차원 가상 실내 환경을 위한 심층 신경망 기반의 장면 그래프 생성)

  • Shin, Donghyeop;Kim, Incheol
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.8 no.5
    • /
    • pp.205-212
    • /
    • 2019
  • Scene graph is a kind of knowledge graph that represents both objects and their relationships found in a image. This paper proposes a 3D scene graph generation model for three-dimensional indoor environments. An 3D scene graph includes not only object types, their positions and attributes, but also three-dimensional spatial relationships between them, An 3D scene graph can be viewed as a prior knowledge base describing the given environment within that the agent will be deployed later. Therefore, 3D scene graphs can be used in many useful applications, such as visual question answering (VQA) and service robots. This proposed 3D scene graph generation model consists of four sub-networks: object detection network (ObjNet), attribute prediction network (AttNet), transfer network (TransNet), relationship prediction network (RelNet). Conducting several experiments with 3D simulated indoor environments provided by AI2-THOR, we confirmed that the proposed model shows high performance.

Maximum Stack Memory Usage Estimation Through Target Binary File Analysis in Microcontroller Environment (마이크로컨트롤러 환경에서 타깃 바이너리 파일 분석을 통한 최대 스택 메모리 사용량 예측 기법)

  • Choi, Kiho;Kim, Seongseop;Park, Daejin;Cho, Jeonghun
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.12 no.3
    • /
    • pp.159-167
    • /
    • 2017
  • Software safety is a key issue in embedded system of automotive and aviation industries. Various software testing approaches have been proposed to achieve software safety like ISO26262 Part 6 in automotive environment. In spite of one of the classic and basic approaches, stack memory is hard to estimating exactly because of uncertainty of target code generated by compiler and complex nested interrupt. In this paper, we propose an approach of analyzing the maximum stack usage statically from target binary code rather than the source code that also allows nested interrupts for determining the exact stack memory size. In our approach, determining maximum stack usage is divided into three steps: data extraction from ELF file, construction of call graph, and consideration of nested interrupt configurations for determining required stack size from the ISR (Interrupt Service Routine). Experimental results of the estimation of the maximum stack usage shows proposed approach is helpful for optimizing stack memory size and checking the stability of the program in the embedded system that especially supports nested interrupts.

Development of software demultiplexer for DTV Signal Reception (DTV 수신을 위한 소프트웨어 Demultiplexer 개발)

  • Jin, Hyun-Joon;Park, Nho-Kyung;Kim, Moo-Han
    • Journal of IKEEE
    • /
    • v.7 no.2 s.13
    • /
    • pp.188-196
    • /
    • 2003
  • In this paper, a demultiplexer for MPEG-2 Transport Stream which can be applied to terrestrial digital broadcast is developed. The demultiplexer separates video, audio, and data from MPEG-2 multimedia stream and transports them to each decoders respectively. While most existing demultiplexers of MPEG-2 transport stream have been developed as hardware systems, but the fast increment of computer's performance enables a software demultiplexer to be worked in realtime. The developed demultiplexer is implemented as a software module called a filter using DirectShow of Microsoft which is based on COM(Component Object Model)and works on the Windows system. The operation of the demultiplexer is verified by using the GraphEdit tool and rendering a test file formatted as MPEG-2 transport stream.

  • PDF

A Study on Graph Conversion of Source Code and Its Use in Graph Databases (소스코드의 그래프 변환 및 그래프 데이터베이스에서의 활용에 대한 연구)

  • Seok-Joon Jang;Su-Hyun Kim;Im-Yeong Lee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2023.11a
    • /
    • pp.314-316
    • /
    • 2023
  • 최근 수많은 오픈소스로 공개되면서, 대부분의 소프트웨어가 오픈소스를 활용하여 구현되고 있다. 하지만, 오픈소스에 적용되어 있는 라이선스 간의 충돌 문제가 발생하면서, 라이선스 위반 문제가 지속적으로 발생하고 있다. 이러한 문제를 사전에 방지하기 위해 소스코드 분석이 필수적이지만, 다양한 기능이 실행되는 소스코드 특성 상 소스코드만 봤을 경우 직관적으로 분석이 어렵다는 문제점이 있다. 최근 소스코드의 효과적인 분석을 도와주는 다양한 도구들이 개발되었고, 그 중 한 가지 방법은 소스코드를 그래프로 변환하여 시각적인 편의성을 제공하는 방법이다. 그래프로 변환된 소스코드는 해당 시점에는 분석이 가능하지만, 분석이 필요할 때마다 변환을 해야 하는 문제점이 존재한다. 따라서 소스코드를 변환한 그래프 데이터를 저장하는 방법이 요구되었는데, 그래프 데이터베이스의 경우 특정 파일 형식만 지원하기 때문에 그래프 데이터 저장에 어려움이 존재한다. 본 제안방식에서는 소스코드를 변환한 그래프 데이터를 그래프 데이터베이스에 효과적으로 저장하고, 분석이 요구될 때마다 데이터베이스 상에서 즉각적으로 분석이 가능한 방법을 제안한다.

Construction of Global State Transition Graph for Verifying Telecommunications Software Specifications written in Message Chart (MSC로 기술된 통신소프트웨어 명세의 검증을 위한 전체 상태 전이 그래프 생성)

  • Kim, Byeong-Man;Kim, Hyeon-Su;Sin, Yun-Sik
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.12
    • /
    • pp.1428-1444
    • /
    • 1999
  • MSC는 ITU에 의해 표준화된, 병행 시스템의 명세를 기술하기 위한 그래픽 형태와 텍스트 형태를 제공하는 언어로서 실시간 시스템 특히 통신 교환 시스템의 특성을 기술하기 위해 자주 사용된다. 통신 시스템이 제대로 동작함을 보이기 위해서는 정형적인 방법을 사용하여 시스템 행위를 검증할 필요가 있다. 통신 소프트웨어를 검증하는 방법 중 하나의 방법으로 유한 상태를 기반으로 하는 방법이 있다. 유한 상태를 기반으로 하는 방법에서는 먼저 시스템 명세에 해당하는 전체 상태 전이 그래프를 생성한 후 이를 바탕으로 model-checking 등의 방법을 사용하여 시스템의 특성을 검증한다. 본 논문에서는 MSC로 기술된 통신 소프트웨어 명세로부터 전체 상태 전이 그래프를 생성하는 방법에 초점을 맞추었다. 시스템 명세에 해당하는 상태 전이 그래프를 생성하기 위해 보다 직관적으로 MSC의 의미론을 표현할 수 있고, 또한 쉽게 전체 상태 전이 그래프를 생성할 수 있는 행위 종속 그래프를 제안하였다. MSC 명세는 일단 행위 종속 그래프로 변환이 되고 이 행위 종속 그래프를 이용하여 전체 상태 전이 그래프가 생성된다.Abstract Message Sequence Chart (MSC) standardized by International Telecommunication Union is a graphical and textual language for describing the specification of concurrent systems. It is frequently used both formally and informally for specifying the behavior of real-time systems, in particular telecommunication switching systems. To ensure that a communication system operates properly, the verification process showing the correctness of system's behavior formally is necessary. One of the verification methods is a finite-state method. In the finite-state method, the global state transition graph (GSTG) is constructed and then safety and liveness properties of systems are verified through a well-known method such as model checking. In this paper, we forcus on the construction of GSTG from the specifications of telecommunication software written in MSC. We suggest Action Dependency Graph (ADG) which can present the semantics of MSC intuitively and also provide a GSTG construction method from ADG. MSC specifications are translated to ADGs and, in turns, the GSTGs are constructed by using these ADGs.

Change Impact Analysis for Object-Oriented softwares in the distributed environment (분산 객체지향 소프트웨어를 위한 수정 영향 분석)

  • Kim, Kyung-Hee;Park, Jai-Nyun;Yoon, Yong-Ik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.5
    • /
    • pp.1280-1290
    • /
    • 1999
  • Applying the change impact analysis to the distributed environment is not straightforward since it is based on the centralized system environment. In this paper, we investigate the change impact analysis of object-oriented shoftwares in the distributed environment. We first, categories the types of changes common in object-oriented software into three sets: data, method, and class level changes. We, then, analyze the impact of each set of changes and represent it in the form of a DPDG. A DPDG is a graph showing relationship of object oriented softwares - with data elements. classes, design documents, servers - in the distributed environment. DPDG searches element of software to retest when the software is changed. Thus, DPDG saves effort of software to retest. In this paper, We propose the table of firewall for retest elements that be discovered by DPDG and implement the table of firewall. The table of firewall is used VIST that we design a software testing tool. The VIST utilizes the minimized firewall, then saves efforts and costs of retesting for distributed object-oriented software.

  • PDF

Control Flow Graph Extraction for Performance Analysis of Real-Time Embedded Software (실시간 내장형 S/W의 성능분석을 위한 Control Flow Graph 추출)

  • 황요섭;안성용;이정아;심재홍
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04a
    • /
    • pp.217-219
    • /
    • 2003
  • 최근 반도체 설계 및 생산 공정의 급속한 발달로 내장형 시스템이 대중화되는 추세이고 비용이나 제품 출시 기간에 있어서 내장형 소프트웨어는 중요한 하나의 요소로 대두되고 있다. 내장형 시스템은 일반 PC와는 다르게 메모리 크기. 전력 소비, 신뢰성, 사이즈. 비용 등과 같은 제약사항들을 내포하기 때문에 제한된 자원의 효율적인 이용과 소프트웨어의 최적화를 위해 소프트웨어의 성능을 분석하기 위한 필요성이 대두된다. 본 논문에서는 소프트웨어 성능분석 도구인 'Cinderella'를 확장하기 위하여 현재 가장 널리 사용되고 있는 이진 실행 파일인 ELF파일에서 성능을 측정하기 위한 기본 요소로서 Control flow graph를 추출하기 위한 알고리즘을 제안한다. 본 논문에서 제안한 알고리즘은 향후 ARM기반의 머신에서 ELF파일의 내장형 소프트웨어의 시간분석에 필요한 요소이다.

  • PDF

Optimization by Simulated Catalytic Reaction: Application to Graph Bisection

  • Kim, Yong-Hyuk;Kang, Seok-Joong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.2162-2176
    • /
    • 2018
  • Chemical reactions have an intricate relationship with the search for better-quality neighborhood solutions to optimization problems. A catalytic reaction for chemical reactions provides a clue and a framework to solve complicated optimization problems. The application of a catalytic reaction reveals new information hidden in the optimization problem and provides a non-intuitive perspective. This paper proposes a new simulated catalytic reaction method for search in optimization problems. In the experiments using this method, significantly improved results are obtained in almost all graphs tested by applying to a graph bisection problem, which is a representative problem of combinatorial optimization problems.

Semantic-based Mashup Platform for Contents Convergence

  • Yongju Lee;Hongzhou Duan;Yuxiang Sun
    • International journal of advanced smart convergence
    • /
    • v.12 no.2
    • /
    • pp.34-46
    • /
    • 2023
  • A growing number of large scale knowledge graphs raises several issues how knowledge graph data can be organized, discovered, and integrated efficiently. We present a novel semantic-based mashup platform for contents convergence which consists of acquisition, RDF storage, ontology learning, and mashup subsystems. This platform servers a basis for developing other more sophisticated applications required in the area of knowledge big data. Moreover, this paper proposes an entity matching method using graph convolutional network techniques as a preliminary work for automatic classification and discovery on knowledge big data. Using real DBP15K and SRPRS datasets, the performance of our method is compared with some existing entity matching methods. The experimental results show that the proposed method outperforms existing methods due to its ability to increase accuracy and reduce training time.

Traffic Flow Prediction with Spatio-Temporal Information Fusion using Graph Neural Networks

  • Huijuan Ding;Giseop Noh
    • International journal of advanced smart convergence
    • /
    • v.12 no.4
    • /
    • pp.88-97
    • /
    • 2023
  • Traffic flow prediction is of great significance in urban planning and traffic management. As the complexity of urban traffic increases, existing prediction methods still face challenges, especially for the fusion of spatiotemporal information and the capture of long-term dependencies. This study aims to use the fusion model of graph neural network to solve the spatio-temporal information fusion problem in traffic flow prediction. We propose a new deep learning model Spatio-Temporal Information Fusion using Graph Neural Networks (STFGNN). We use GCN module, TCN module and LSTM module alternately to carry out spatiotemporal information fusion. GCN and multi-core TCN capture the temporal and spatial dependencies of traffic flow respectively, and LSTM connects multiple fusion modules to carry out spatiotemporal information fusion. In the experimental evaluation of real traffic flow data, STFGNN showed better performance than other models.