• Title/Summary/Keyword: flow graph

Search Result 337, Processing Time 0.029 seconds

MODEL BASED DIAGNOSTICS FOR A GEARBOX USING INFORMATION THEORY

  • Choi, J.;Bryant, M.D.
    • Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
    • /
    • 2002.10b
    • /
    • pp.459-460
    • /
    • 2002
  • This article discusses a diagnostics method based on models, and information theory. From an extensive system dynamics bond graph model of a gearbox [1], simulated were various cases germane to this diagnostics approach, including the response of an ideal gearbox, which functions perfectly to designer's specifications, and degraded gearboxes with tooth root cracking. By comparing these cases and constructing a signal flow analogy between the gearbox and a communication channel, Shannon' s information theory [2], including theorems, was applied to the gearbox to assess system health, in terms of ability to function.

  • PDF

Statistical Measurement of Monsyllable Entropy for Korean Language (한국어 음절의 Entropy에 관한 연구)

  • 이주근;최흥문
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.11 no.3
    • /
    • pp.15-21
    • /
    • 1974
  • The information amount of monosyllables(characters) in Korean language is measured, in order of the following 3 steps. 1) The basic consonants and vowels are partitioned into two steps, 2) These set symbols, C and V, are sequentially combined to obtain the equation which represent the flow state of monosyllables. 3) From the equation, the state graphs can be constructed to examine the proferties of a stochastic process of monosyllables in Korean language. Furthermore, the entropy of Korean language by statistics is measured and compared with that of the western languages. The proposed methods are more definite, systematic, and simpler than the usual methods in examining the nature of information sources.

  • PDF

Routing Service Implementation using a Dual Graph (듀얼 그래프를 이용한 라우팅 서비스 구현)

  • 김성수;허태욱;박종현;이종훈
    • Proceedings of the IEEK Conference
    • /
    • 2003.11b
    • /
    • pp.171-174
    • /
    • 2003
  • Shortest path problems are among the most studied network flow optimization problems, with interesting applications in various fields. One such field is the route determination service, where various kinds of shortest path problems need to be solved in location-based service. Our research aim is to propose a route technique in real-time location-based service (LBS) environments according to user's route preferences such as shortest, fastest, easiest and so on. Turn costs modeling and computation are important procedures in route planning. We propose a new rest modeling method for turn costs which are traditionally attached to edges in a graph. Our proposed route determination technique also has an advantage that can provide service interoperability by implementing XML web service for the OpenLS route determination service specification.

  • PDF

The Study on the Quantitative Approaches to the Liquidity of Business Activities (경영활동의 유동상태에 대한 수식적 연구)

  • 이근희
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.8 no.11
    • /
    • pp.1-16
    • /
    • 1985
  • This study is to systematize a flow of production activities with a formula to help understand the trend of production in an enterprise according to the profit graph. Although the existing methods of studies were unattainable to analyze earnings correlative to production due to the lack of total business management, this study is aimed at testing a new method that developed the method of an advanced analysis as well as a combined system of the profit graph. and the production trend.

  • PDF

A Research on Explainability of the Medical AI Model based on Attention and Attention Flow Graph (어텐션과 어텐션 흐름 그래프를 활용한 의료 인공지능 모델의 설명가능성 연구)

  • Lee, You-Jin;Chae, Dong-Kyu
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.11a
    • /
    • pp.520-522
    • /
    • 2022
  • 의료 인공지능은 특정 진단에서 높은 정확도를 보이지만 모델의 신뢰성 문제로 인해 활발하게 쓰이지 못하고 있다. 이에 따라 인공지능 모델의 진단에 대한 원인 설명의 필요성이 대두되었고 설명가능한 의료 인공지능에 관한 연구가 활발히 진행되고 있다. 하지만 MRI 등 의료 영상 인공지능 분야에서 주로 진행되고 있으며, 이미지 형태가 아닌 전자의무기록 데이터 (Electronic Health Record, EHR) 를 기반으로 한 모델의 설명가능성 연구는 EHR 데이터 자체의 복잡성 때문에 활발하게 진행 되지 않고 있다. 본 논문에서는 전자의무기록 데이터인 MIMIC-III (Medical Information Mart for Intensive Care) 를 전처리 및 그래프로 표현하고, GCT (Graph Convolutional Transformer) 모델을 학습시켰다. 학습 후, 어텐션 흐름 그래프를 시각화해서 모델의 예측에 대한 직관적인 설명을 제공한다.

Floop: An efficient video coding flow for unmanned aerial vehicles

  • Yu Su;Qianqian Cheng;Shuijie Wang;Jian Zhou;Yuhe Qiu
    • ETRI Journal
    • /
    • v.45 no.4
    • /
    • pp.615-626
    • /
    • 2023
  • Under limited transmission conditions, many factors affect the efficiency of video transmission. During the flight of an unmanned aerial vehicle (UAV), frequent network switching often occurs, and the channel transmission condition changes rapidly, resulting in low-video transmission efficiency. This paper presents an efficient video coding flow for UAVs working in the 5G nonstandalone network and proposes two bit controllers, including time and spatial bit controllers, in the flow. When the environment fluctuates significantly, the time bit controller adjusts the depth of the recursive codec to reduce the error propagation caused by excessive network inference. The spatial bit controller combines the spatial bit mask with the channel quality multiplier to adjust the bit allocation in space to allocate resources better and improve the efficiency of information carrying. In the spatial bit controller, a flexible mini graph is proposed to compute the channel quality multiplier. In this study, two bit controllers with end-to-end codec were combined, thereby constructing an efficient video coding flow. Many experiments have been performed in various environments. Concerning the multi-scale structural similarity index and peak signal-to-noise ratio, the performance of the coding flow is close to that of H.265 in the low bits per pixel area. With an increase in bits per pixel, the saturation bottleneck of the coding flow is at the same level as that of H.264.

Time Slot Assignment Algorithm with Graph Coloring (그래프 채색에 의한 타임 슬롯 할당 알고리즘)

  • Kwon, Bo-Seob
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.5
    • /
    • pp.52-60
    • /
    • 2008
  • A simple Time Division Multiplex(TDM) switching system which has been widely in satellite networks provides any size of bandwidth for a number of low bandwidth subscribers by allocating proper number of time slots in a frame. In this paper, we propose a new approach based on graph coloring model for efficient time slot assignment algorithm in contrast to network flow model in previous works. When the frame length of an initial matrix of time slot requests is 2's power, this matrix is divided into two matrices of time slot requests using binary divide and conquer method based on the graph coloring model. This process is continued until resulting matrices of time slot requests are of length one. While the most efficient algorithm proposed in the literature has time complexity of $O(N^{4.5})$, the time complexity of the proposed algorithm is $O(NLlog_2L)$, where N is the number of input/output links and L is the number of time slot alloted to each link in the frame.

Modificaion and Performance Test for improving ability of Supersonic/Hypersonic Wind Tunnel(MAF) (초음속/극초음속 풍동(MAF)의 성능 향상을 위한 개조 및 검증)

  • Choi, Won-Hyeok;Seo, Dong-Su;Lee, Jae-Woo;Byun, Yung-Hwan
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2010.11a
    • /
    • pp.717-722
    • /
    • 2010
  • Supersonic/Hypersonic wind tunnel is a facility which is intended to test and to observe the physical phenomena around a model by creating supersonic flow in the test section. In designing an airplane, the wind tunnel test is demanded to analyzing aerodynamic characteristics of the model without making a prototype. In this research, the model aerodynamic facility(MAF) is modified for the purpose of increasing running time and its functionality. New pneumatic valves for remote control was installed for safety requirement, and new air tanks was installed on MAF as well. A pipe system is also modified to use those new valves and tanks, and the ceiling and side glasses of the test section are switched to ones with the larger surface area. After the MAF modification, a test is performed at Mach 2, 3 and 4. In this test, shadow graph technique, one of the flow visualization methods, is used to visualize supersonic flow field. The pressure in the settling chamber and working section at Mach 2, 3 and 4 was measured in each case. As a result, the possible model size and running time are obtained.

  • PDF

Offline Based Ransomware Detection and Analysis Method using Dynamic API Calls Flow Graph (다이나믹 API 호출 흐름 그래프를 이용한 오프라인 기반 랜섬웨어 탐지 및 분석 기술 개발)

  • Kang, Ho-Seok;Kim, Sung-Ryul
    • Journal of Digital Contents Society
    • /
    • v.19 no.2
    • /
    • pp.363-370
    • /
    • 2018
  • Ransomware detection has become a hot topic in computer security for protecting digital contents. Unfortunately, current signature-based and static detection models are often easily evadable by compress, and encryption. For overcoming the lack of these detection approach, we have proposed the dynamic ransomware detection system using data mining techniques such as RF, SVM, SL and NB algorithms. We monitor the actual behaviors of software to generate API calls flow graphs. Thereafter, data normalization and feature selection were applied to select informative features. We improved this analysis process. Finally, the data mining algorithms were used for building the detection model for judging whether the software is benign software or ransomware. We conduct our experiment using more suitable real ransomware samples. and it's results show that our proposed system can be more effective to improve the performance for ransomware detection.

Design of An Abstraction Technique of Road Network for Adapting Dynamic Traffic Information (동적 교통 정보를 적용하기 위한 도로망 추상화기법의 설계)

  • Kim, Ji-Soo;Lee, Ji-wan;Cho, Dae-Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.199-202
    • /
    • 2009
  • The optimal path on real road network has been changed by traffic flow of roads frequently. Therefore a path finding system to find the optimal path on real network should consider traffic flow of roads that is changed on real time. The most of existing path finding methods do not consider traffic flow of roads and do not also perform efficiently if they use traffic information. In this paper, we propose an abstraction method of real road network based on the Terminal Based Navigation System (TBNS) with technique such as TPEG. TBNS can be able to provides quality of path better than before as using traffic information that is transferred by TPEG. The proposed method is to abstract real network as simple graph in order to use traffic information. It is composed boundary nodes based on real nodes, all boundary nodes that have the same of connection are merged together. The result of path finding on an abstract graph diminishes the search space.

  • PDF