• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.3
• /
• pp.177-186
• /
• 1990

This paper present an analysis of filter network using bondgraph technique for the determination of cofficients of filter function not by means of Computations operation. The proposed bondgraph technique is confirmed to be suitable for obtaining the frequency response characteristics of filter network.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.325-327
• /
• 2004

'생물정보학'이란 생물학적 데이터를 처리, 가공하여 정보를 얻어내는 연구 분야로 이 중 대사체학은 대사 경로 네트워크를 가시화하여 생명 활동을 이해하고자 하는 분야로, 대사 경로 내의 흐름을 한 눈에 알 수 있도록 가시화하여 보여 주는 도구가 반드시 필요하다 따라서 본 논문에서는 새로운 '대사 경로 드로잉 알고리즘'을 제안하였다. 대사 경로 그래프의 구조로는 이분 그래프를 이용하여 가독성을 높였으며. 이 그래프가 척도 없는(scale-free) 네트워크 구조라는 것과 구조적으로 환형, 계층적 선형 컴포넌트를 가진다는 것을 고려하여 사이즈가 큰 그래프도 적절하게 드로잉 하도록 하였다.

• Journal of the Korean Society for Railway
• /
• v.19 no.3
• /
• pp.331-340
• /
• 2016

Wheel load, design velocity, traffic amount (MGT), stiffness and thickness of sub-layers of asphalt concrete track are selected as performance design parameters in this study. A pseudo-static wheel load computed considering the dynamic amplification factor (DAF) based on the design velocity of the KTX was applied to the top of asphalt concrete track for full three dimensional structural analysis using the ABAQUS program. Tensile strains at the bottom of the asphalt concrete layer and vertical strains at the top of the subgrade were computed from the structural FEA with different combinations of performance parameter values for one asphalt concrete track section. Utilizing the computed structural analysis results such as the tensile strains and the vertical strains, it was possible to develop design graphs to investigate proper track sections for different combination of the performance parameters including wheel load, design velocity, traffic amount(MGT), stiffness and thickness of asphalt concrete layers for any given design life. By analyzing the proposed design graphs for asphalt concrete track, it was possible to propose simple design tables that can be used by engineers for the effective and fast design of track.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.4
• /
• pp.309-318
• /
• 1991

In this paper, the integrator used to reduce the error between the reference signal and response, and DC motor are constructed by bond graph. Then the model following servo controller which have the high adaptation with respect to inertia, disturbance and/or load variation in the speed control system of DC motor is designed by the bond graph, and then the usefullness of this modeling method is confirmed in operating analysis and design on controller.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1805-1816
• /
• 1999

This paper presents the Module Class Dependency Graph for expressing the dependency relations between classes effectively. The object-oriented language is developed independently at design time, and consists of relationship between classes. Therefore we need to consider these characteristics of independence, and to express effectively the relation of classes which is existed in class hierarchy. In the System Dependence Graph and Class Dependence Graph, the relationship of classes is not expressed. To express the class relationship, we propose the Module Class Dependence Graph, and we verify the effectiveness of this method applying to object constructor, inheritance relationship and dynamic binding. Also, we presents the expressing method of parameter to identify the member data of classes. Using this Module Class Dependency Graph, we can analyze the relationship of module class correctly at design time. This method can be applied to reverse engineering, testing, visualization and other various fields to analyze system.

• Annual Conference on Human and Language Technology
• /
• 2012.10a
• /
• pp.209-211
• /
• 2012

본 논문의 대화시스템 구축도구는 태스크 기반 대화 시스템을 구축하는데 필요한 대화 시나리오 지식과 이를 처리하는 태스크 그래프, 슬롯 체계, 대화 라이브러리 등을 생성하고 관리할 수 있는 웹기반 대화 시스템 구축 도구이다. 이 도구는 태스크 그래프를 시각적으로 대화 모델 설계자에게 표시하고, 대화 모델 설계자는 시각적으로 표시된 태스크 그래프를 보며 태스크의 흐름을 한눈에 파악하고 대화 시스템의 시나리오 흐름을 생성하고 편집할 수 있도록 한 것이 특징이다. 또한 대화 모델 설계자와 시나리오 태깅 작업자들 모두는 자신이 구축한 지식이나 대화 태스크를 시스템에 직접 반영하고 실시간으로 대화 시스템에 적용해 봄으로써 대화 시스템의 이해를 높이고 고품질의 대화 시스템을 구축할 수 있다.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1646-1655
• /
• 1999

This thesis presents a new VHDL intermediate format CDDG(Control Dominated Data Graph) and a minimal constrained scheduling algorithm for an optimal control dominated ASIC design. CDDG is a control flow graph which represents conditional branches and loops efficiently. Also it represents data dependency and such constraints as hardware resource and timing. In the proposed scheduling algorithm, the constraints using the inclusion and overlap relation among subgraphs. The effectiveness of the proposed algorithm has been proven by the experiment with the benchmark examples.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2024.05a
• /
• pp.678-679
• /
• 2024

그래프 신경망(Graph Neural Network, GNN)은 실세계 그래프 데이터에 대한 다양한 다운스트림 작업들에서 우수한 성능을 보여 왔다. 그러나, 최근 연구는 GNN 의 예측 결과가 데이터 내 특정 집단에 대한 차별을 내포할 수 있음을 지적했다. 이러한 문제를 해결하기 위해, 공정성을 고려할 수 있는 GNN 방법들이 설계되어 오고 있으나, 아직 실세계 그래프 데이터가 공정성 관점에서 어떠한 특성을 가지고 있는지에 대한 분석은 충분히 이루어지지 않았다. 따라서, 본 논문에서는 다양한 공정성 평가 지표를 활용하여 실세계 그래프 데이터의 공정성을 비교 분석한다. 실험 결과, 실세계 그래프 데이터들은 도메인 혹은 평가 지표에 따라 다른 특성을 가진다는 것을 확인하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.926-937
• /
• 1996

A graph traversal technique is a certain pattern of visiting nodes of a graph. Many special traversal techniques have been applied to solve graph related problems. For example, the depth first search technique has been used for finding strongly onnected components of a directed graph or biconnected components of a general graph. The distributed protocol to implement his depth first search technique on the distributed network can be divided into a fixed topology problem where there is no topological change and a dynamic topology problem which has some topological changes. Therefore, in this paper, we present a more efficient distributed depth first search protocol with fixed topology and a resilient distributed depth first search protocol where there are topological changes for the distributed network. Also, we analysed the message and time complexity of the presented protocols and showed the improved results than the complexities of the other distributed depth first search protocols.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.1
• /
• pp.27-34
• /
• 2005

In this paper, we propose the Q-edge labeling method related to the graph embedding problem in binomial trees. This result is able to design a new reliable interconnection networks with maximum connectivity using Q-edge labels as jump sequence of circulant graph. The circulant graph is a generalization of Harary graph which is a solution of the optimal problem to design a maximum connectivity graph consists of n vertices End e edgies. And this topology has optimal broadcasting because of having binomial trees as spanning tree.