• Title/Summary/Keyword: digital graph

Search Result 207, Processing Time 0.019 seconds

Study on Utilization of Digital Tacho Graph in Construction Machinery Information Systemm (건설기계 정보화시스템 구축을 위한 운행기록장치 활용방안)

  • Yoon, Janet;Lee, Seung-Cheol
    • Journal of Auto-vehicle Safety Association
    • /
    • v.8 no.2
    • /
    • pp.17-23
    • /
    • 2016
  • Construction of our machine "Digital Tacho Graph" toghether with development and intergrated management system information is attached under Traffic Safety Law in article submission. This machine "Digital Tach Graph" has been mandated on a priority basis. The entire machine is constructed with specialised components to collect data that can retrive basic information. To obtain the components to perfect the information to optimize the device and system.

Evaluation of Knowledge Graph for Interoperating Digital Records (디지털 기록의 상호운용을 위한 지식그래프의 평가)

  • Haram Park;Haklae Kim
    • Journal of Korean Society of Archives and Records Management
    • /
    • v.23 no.4
    • /
    • pp.159-178
    • /
    • 2023
  • A digital archive is an online platform for preserving and utilizing digital records worthy of continued preservation. However, there are no shared standards for functionality, metadata, or data technical principles across digital archives in Korea. These issues create challenges in linking distributed digital records. This study proposes a common vocabulary for digital archives to enhance the interoperability of digital records and evaluates the interoperability of the digital archive built with the common vocabulary. We collect and analyze data from the digital archive on the Korean financial crisis of 1997 to construct a knowledge graph and compare its interoperability with the knowledge graph built with RiC-O. The archive and the knowledge graph underwent evaluation using the FAIR data principles evaluation framework. The constructed knowledge graph links various objects in the archive and provides contextual information to aid in understanding the archive. The results demonstrate that a knowledge graph built with a common vocabulary significantly improves the linkage, search, and interoperability of digital records compared to a traditional archive.

A Study on the Constructing the Function using Extension Edge Valued Graph (모서리값 확장 그래프를 사용한 함수구성에 관한연구)

  • Park, Chun-Myoung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.4
    • /
    • pp.863-868
    • /
    • 2013
  • In recently years, many digital logic systems based on graph theory are analyzed and synthesized. This paper presented a method of constructing the function using edge valued extension graph which is based on graph theory. The graph is applied to a new data structure. from binary graph which is recently used in constructing the digital logic systems based on the graph theory. We discuss the mathematical background of literal and reed-muller expansion, and we discuss the edge valued extension graph which is the key of this paper. Also, we propose the algorithms which is the function derivation based on the proposed edge valued extension graph. That is the function minimization method of the n-variables m-valued functions and showed that the algorithm had the regularity with module by which the same blocks were made concerning about the schematic property of the proposed algorithm.

ON THE SIMPLICIAL COMPLEX STEMMED FROM A DIGITAL GRAPH

  • HAN, SANG-EON
    • Honam Mathematical Journal
    • /
    • v.27 no.1
    • /
    • pp.115-129
    • /
    • 2005
  • In this paper, we give a digital graph-theoretical approach of the study of digital images with relation to a simplicial complex. Thus, a digital graph $G_k$ with some k-adjacency in ${\mathbb{Z}}^n$ can be recognized by the simplicial complex spanned by $G_k$. Moreover, we demonstrate that a graphically $(k_0,\;k_1)$-continuous map $f:G_{k_0}{\subset}{\mathbb{Z}}^{n_0}{\rightarrow}G_{k_1}{\subset}{\mathbb{Z}}^{n_1}$ can be converted into the simplicial map $S(f):S(G_{k_0}){\rightarrow}S(G_{k_1})$ with relation to combinatorial topology. Finally, if $G_{k_0}$ is not $(k_0,\;3^{n_0}-1)$-homotopy equivalent to $SC^{n_0,4}_{3^{n_0}-1}$, a graphically $(k_0,\;k_1)$-continuous map (respectively a graphically $(k_0,\;k_1)$-isomorphisim) $f:G_{k_0}{\subset}{\mathbb{Z}}^{n_0}{\rightarrow}G_{k_1}{\subset}{\mathbb{Z}^{n_1}$ induces the group homomorphism (respectively the group isomorphisim) $S(f)_*:{\pi}_1(S(G_{k_0}),\;v_0){\rightarrow}{\pi}_1(S(G_{k_1}),\;f(v_0))$ in algebraic topology.

  • PDF

A Knowledge Graph of the Korean Financial Crisis of 1997: A Relationship-Oriented Approach to Digital Archives (1997 외환위기 지식그래프: 디지털 아카이브의 관계 중심적 접근)

  • Lee, Yu-kyeong;Kim, Haklae
    • Journal of Korean Society of Archives and Records Management
    • /
    • v.20 no.4
    • /
    • pp.1-17
    • /
    • 2020
  • Along with the development of information technology, the digitalization of archives has also been accelerating. However, digital archives have limitations in effectively searching, interlinking, and understanding records. In response to these issues, this study proposes a knowledge graph that represents comprehensive relationships among heterogeneous entities in digital archives. In this case, the knowledge graph organizes resources in the archives on the Korean financial crisis of 1997 by transforming them into named entities that can be discovered by machines. In particular, the study investigates and creates an overview of the characteristics of the archives on the Korean financial crisis as a digital archive. All resources on the archives are described as entities that have relationships with other entities using semantic vocabularies, such as Records in Contexts-Ontology (RiC-O). Moreover, the knowledge graph of the Korean Financial Crisis of 1997 is represented by resource description framework (RDF) vocabularies, a machine-readable format. Compared to conventional digital archives, the knowledge graph enables users to retrieve a specific entity with its semantic information and discover its relationships with other entities. As a result, the knowledge graph can be used for semantic search and various intelligent services.

A Study on Digital Image Processing Algorithm for Area Measurement of an Object Image by the Hierarchical Angle-Distance Graphs (계층적 각-거리 그래프를 이용한 물체 면적 측정을 위한 디지털 영상처리 알고리즘에 관한 연구)

  • Kim Woong-Ki;Ra Sung-Woong;Lee Jung-Won
    • The KIPS Transactions:PartB
    • /
    • v.13B no.2 s.105
    • /
    • pp.83-88
    • /
    • 2006
  • Digital image processing algorithm was proposed to measure the area inside of an object image using angle-distance graph used to analyze the pattern of an object in the digital image processing techniques. The first angle-distance graph is generated from a point inside of an object area. The second angle-distance graphs are generated for the areas missed in the first graph by extracting the positions with large gradient in the first angle-distance graph. The order of the graph increases according to the complexity of an object pattern. Size of the area inside of an object boundary is measured by integrating square of distance multiplied by angle for each area from the hierarchical angie-distance graphs.

Attributed AND-OR Graph : A Semantics for Formal Model Management for Digital Systems Design (Attributed AND-OR Graph : 디지털 시스템 설계에 있어 모델 관리를 위한 정형론)

  • Kim, Jun-Kyoung;Kim, Tag-Gon
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2005.05a
    • /
    • pp.34-39
    • /
    • 2005
  • The progress of silicon technology enables to implement a highly complex digital system on a given chip area. However, even the modern design environment is not so efficient to catch up with the progress of process technology. Design reuse is a promising approach to designing such a complex system in an efficient way. However, the rigidness and inflexibility of a model has been an obstacle to design reuse. This paper proposes a high-level model management methodology by introducing attributed AND-OR graph(AOG), a (formal semantics for representing the possible structure of a model. Using the formalism enables a designer to extract, extend and reuse the pre-modeled and pre-verified design. A complete process of constructing a cache operational model, extending the model and extracting executable models is exemplified to show effectiveness of the proposed framework.

  • PDF

Graph-based Mixed Heuristics for Effective Planning (효율적인 계획생성을 위한 그래프 기반의 혼합 휴리스틱)

  • Park, Byungjoon;Kim, Wantae;Kim, Hyunsik
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.17 no.3
    • /
    • pp.27-37
    • /
    • 2021
  • Highly informative heuristics in AI planning can help to a more efficient search a solutions. However, in general, to obtain informative heuristics from planning problem specifications requires a lot of computational effort. To address this problem, we propose a Partial Planning Graph(PPG) and Mixed Heuristics for solving planning problems more efficiently. The PPG is an improved graph to be applied to can find a partial heuristic value for each goal condition from the relaxed planning graph which is a means to get heuristics to solve planning problems. Mixed Heuristics using PPG requires size of each graph is relatively small and less computational effort as a partial plan generated for each goal condition compared to the existing planning graph. Mixed Heuristics using PPG can find partial interactions for each goal conditions in an effective way, then consider them in order to estimate the goal state heuristics. Therefore Mixed Heuristics can not only find interactions for each goal conditions more less computational effort, but also have high accuracy of heuristics than the existing max and additive heuristics. In this paper, we present the PPG and the algorithm for computing Mixed Heuristics, and then explain analysis to accuracy and the efficiency of the Mixed Heuristics.

A Dependability Modeling of Software Under Memory Faults for Digital System in Nuclear Power Plants

  • Park, Jong-Gyun;Seong, Poong-Hyun
    • Nuclear Engineering and Technology
    • /
    • v.29 no.6
    • /
    • pp.433-443
    • /
    • 1997
  • In this work, an analytic approach to the dependability of software in the operational phase is suggested with special attention to the hardware fault effects on the software behavior : The hardware faults considered are memory faults and the dependability measure in question is the reliability. The model is based on the simple reliability theory and the graph theory which represents the software with graph composed of nodes and arcs. Through proper transformation, the graph can be reduced to a simple two-node graph and the software reliability is derived from this graph. Using this model, we predict the reliability of an application software in the digital system (ILS) in the nuclear power plant and show the sensitivity of the software reliability to the major physical parameters which affect the software failure in the normal operation phase. We also found that the effects of the hardware faults on the software failure should be considered for predicting the software dependability accurately in operation phase, especially for the software which is executed frequently. This modeling method is particularly attractive for the medium size programs such as the microprocessor-based nuclear safety logic program.

  • PDF

AN EQUIVALENT PROPERTY OF A NORMAL ADJACENCY OF A DIGITAL PRODUCT

  • Han, Sang-Eon
    • Honam Mathematical Journal
    • /
    • v.36 no.1
    • /
    • pp.199-215
    • /
    • 2014
  • Owing to the development of the notion of normal adjacency of a digital product [9], product properties of digital topological properties were studied efficiently. To equivalently represent a normal adjacency of a digital product, the present paper proposes an S-compatible adjacency of a digital product. This approach can be helpful to understand a normal adjacency of a digital product. Finally, using an S-compatible adjacency of a digital product, we can study product properties of digital topological properties, which improves the presentations of the normal adjacency of a digital product in [9] and [5, 6].