• 제목/요약/키워드: Power of a graph

검색결과 220건 처리시간 0.028초

스위칭 동작 최소화를 통한 저전력 데이터 경로 최적화 (A Low Power-Driven Data Path Optimization based on Minimizing Switching Activity)

  • 임세진;조준동
    • 전자공학회논문지C
    • /
    • 제36C권4호
    • /
    • pp.17-29
    • /
    • 1999
  • 본 논문은 데이터 의존적인 CMOS 회로(예: DSP) 의 전력량을 감축하기 위한 상위 수준 합성 기법에 대한 연구이다. 상위수준 합성은 스케줄링, 자원 및 레지스터 할당의 세가지로 나우어서 수행한다. 스케줄링시의 저전력 설계의 목적은 자원할당 시 입력을 재 사용할 수 있는 가능성을 증가시키는 것이다. 스케줄링 후에 자원 및 레지스터 할당 문제는 가중차기 부가된 앙립 그래프로 표현하여 최소비용흐름 알고리즘을 수행함으로써 스위칭 동작횟수가 적은 해를 얻는다. 제안된 알고리즘은 저전력 레지스터 및 자원 할당 문제에 대하여 O({{{{ { n}^{3 } }}}}) (n은 그래프의 노드수) 시간에 최적해를 제공한다. 벤치마크 회로에 대한 실험 결과는 15%의 전력 감축 효과를 나타낸다.

  • PDF

HRNCE 문법의 언어 생성력 (Language-generating-Power of HRNCE Grammars)

  • 정태의;박동선
    • 한국정보처리학회논문지
    • /
    • 제3권7호
    • /
    • pp.1659-1668
    • /
    • 1996
  • 스트링 문법은 그래프 언어와 부분집합인 스트링 언어를 생성하는 반면 그래프 문법은 그래프 언어를 생성한다. 그래프 문법 모델중 가장 성공적인 것중의 하나인 NLC문법은 노드 레이블을 이용하여 하나의 노드를 하나의 그래프로 치환 하므로서 그래프를 생성한다. 그래프를 포함하는 하아피그래프를 생성하는 하이퍼그래프 문법 모델로는 미리 정해놓은 접착점들의 순서를 이용하여 하나의 하이퍼에지를 하나의 하이퍼그래프로 치환하는 CFHG 문법, CFHG 문법의 확장형으로서 복제 및 삭제의 방벙 을 통해 하이페이지와 그것이 포함하고 있는 노드들, 즉 하나의 핸들을 하나의 하아 퍼그래프로 차환하는 HH 문법, 그리고 eNCE방식을 이용하여 하나의 핸들을 하나의 하아퍼그래프로 치환하는 HRNCE 문법 등이 소개되었다. 본 논문에서는 HRNCE 문법이 생성하는 그래프 언어와 위에서 언급된 기타의 그래프 문법들이 생성하는 그래프 언어 들을 비교하므로서 HRNCE 문법과 타 그래프 문법들의 언어 생성력을 비교 검토하고자 한다.

  • PDF

Graph neural network based multiple accident diagnosis in nuclear power plants: Data optimization to represent the system configuration

  • Chae, Young Ho;Lee, Chanyoung;Han, Sang Min;Seong, Poong Hyun
    • Nuclear Engineering and Technology
    • /
    • 제54권8호
    • /
    • pp.2859-2870
    • /
    • 2022
  • Because nuclear power plants (NPPs) are safety-critical infrastructure, it is essential to increase their safety and minimize risk. To reduce human error and support decision-making by operators, several artificial-intelligence-based diagnosis methods have been proposed. However, because of the nature of data-driven methods, conventional artificial intelligence requires large amount of measurement values to train and achieve enough diagnosis resolution. We propose a graph neural network (GNN) based accident diagnosis algorithm to achieve high diagnosis resolution with limited measurements. The proposed algorithm is trained with both the knowledge about physical correlation between components and measurement values. To validate the proposed methodology has a sufficiently high diagnostic resolution with limited measurement values, the diagnosis of multiple accidents was performed with limited measurement values and also, the performance was compared with convolution neural network (CNN). In case of the experiment that requires low diagnostic resolution, both CNN and GNN showed good results. However, for the tests that requires high diagnostic resolution, GNN greatly outperformed the CNN.

발전소의 파급되는 고장 Sequence내에서의 비관측 고장진단에 관한 연구 (A Study on Diagnosing Cascading Disturbances in a Power Plant)

  • 이승철;이순교
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1998년도 하계학술대회 논문집 G
    • /
    • pp.2278-2280
    • /
    • 1998
  • This paper discusses a technique that can detect cascading disturbances for automated monitoring and diagnosis systems in power plants. A multi-layered directed AND/OR graph called a disturbance interrelation analysis graph (DIAG) is utilized to represent the relationships among cascading disturbances and trace them. Disturbances that cannot be observed directly from sensors can be traced using techniques similar to interpolations and extrapolations on the DIAG.

  • PDF

GPU에서 CUDA를 이용한 그래프 유사도 측정을 위한 병렬 알고리즘 (A Parallel Algorithm for Measuring Graph Similarity Using CUDA on GPU)

  • 손민영;김영학;최성자
    • 정보과학회 컴퓨팅의 실제 논문지
    • /
    • 제23권3호
    • /
    • pp.156-164
    • /
    • 2017
  • 두 그래프의 유사도를 측정하는 문제는 다양한 응용분야에서 그래프 문제를 해결하기 위한 기본적인 도구 중 하나이다. 대부분 그래프 알고리즘들은 정점과 간선의 개수를 기반으로 한 시간 복잡도를 가진다. 최근 GPU는 낮은 가격 대비 높은 계산 능력을 제공하기 때문에 그래프 응용에서 수행 시간을 개선하기 위해 널리 활용되고 있다. 본 논문에서는 GPU 환경에서 CUDA를 사용하여 그래프의 유사도를 측정하기 위한 효율적인 병렬 알고리즘을 제안한다. 제안된 알고리즘의 평가를 위해 CPU 기반 알고리즘과 비교하였으며 실험적 결과를 통하여 제안된 방법이 성능과 효율성에서 상당한 개선이 있음을 보인다. 또한 그래프의 크기가 클수록 제안된 알고리즘의 성능이 더 개선됨을 보인다.

An Alternative Perspective of Near-rings of Polynomials and Power series

  • Shokuhifar, Fatemeh;Hashemi, Ebrahim;Alhevaz, Abdollah
    • Kyungpook Mathematical Journal
    • /
    • 제62권3호
    • /
    • pp.437-453
    • /
    • 2022
  • Unlike for polynomial rings, the notion of multiplication for the near-ring of polynomials is the substitution operation. This leads to somewhat surprising results. Let S be an abelian left near-ring with identity. The relation ~ on S defined by letting a ~ b if and only if annS(a) = annS(b), is an equivalence relation. The compressed zero-divisor graph 𝚪E(S) of S is the undirected graph whose vertices are the equivalence classes induced by ~ on S other than [0]S and [1]S, in which two distinct vertices [a]S and [b]S are adjacent if and only if ab = 0 or ba = 0. In this paper, we are interested in studying the compressed zero-divisor graphs of the zero-symmetric near-ring of polynomials R0[x] and the near-ring of the power series R0[[x]] over a commutative ring R. Also, we give a complete characterization of the diameter of these two graphs. It is natural to try to find the relationship between diam(𝚪E(R0[x])) and diam(𝚪E(R0[[x]])). As a corollary, it is shown that for a reduced ring R, diam(𝚪E(R)) ≤ diam(𝚪E(R0[x])) ≤ diam(𝚪E(R0[[x]])).

ON THE TOPOLOGICAL INDICES OF ZERO DIVISOR GRAPHS OF SOME COMMUTATIVE RINGS

  • FARIZ MAULANA;MUHAMMAD ZULFIKAR ADITYA;ERMA SUWASTIKA;INTAN MUCHTADI-ALAMSYAH;NUR IDAYU ALIMON;NOR HANIZA SARMIN
    • Journal of applied mathematics & informatics
    • /
    • 제42권3호
    • /
    • pp.663-680
    • /
    • 2024
  • The zero divisor graph is the most basic way of representing an algebraic structure as a graph. For any commutative ring R, each element is a vertex on the zero divisor graph and two vertices are defined as adjacent if and only if the product of those vertices equals zero. In this research, we determine some topological indices such as the Wiener index, the edge-Wiener index, the hyper-Wiener index, the Harary index, the first Zagreb index, the second Zagreb index, and the Gutman index of zero divisor graph of integers modulo prime power and its direct product.

스핀 코너 성능향상을 위한 모델링 및 민감도 해석 (Modelling and Sensitivity Analysis for the Performance Improvement of a Spin Coater)

  • 권태종;채호철;한창수;정진태;안강호
    • 한국생산제조학회지
    • /
    • 제9권6호
    • /
    • pp.96-102
    • /
    • 2000
  • Spinning mechanism is generally used in coasting process on grass plates. Rebounding PR(Photo Resist) which leads to occur inferiority of coating process is caused by vibrational energy of whole coating system. In this study, the sensitivity analysis is performed to analyze and reduce vibrational terms in the spin coating system. The sensitivity analysis is bared on the numerical expression of this system. By the bond graph method. power flow of each system is represented by some basic bond graph elements. Any energy domain system is modeled using the unified elements. The modelled spin coater system is verified with power spectrum data measured by FFT analyzer. As the results of verifying model parameters and sensitivity analysis, principal factors causing vibration phenomenon are mentioned. A study on vibration method in the spin coating system is discussed.

  • PDF

Power Tracing Method for Transmission Usage Allocation Considering Reactive Power

  • Han Choong-Kyo;Park Jong-Keun;Jung Hae-Sung
    • KIEE International Transactions on Power Engineering
    • /
    • 제5A권1호
    • /
    • pp.79-84
    • /
    • 2005
  • In many countries, the electric power industry is undergoing significant changes known as deregulation and restructuring. These alterations introduce competition in generation and retail and require open access to the transmission network. The competition of the electric power industry causes many issues to surface. Among them, unbundling of the transmission service is probably the most complicated as it is a single and integrated sector and the transmission revenue requirement must be allocated to market participants in a fair way. In these situations, it is valuable to research the methodologies to allocate transmission usage. The power tracing method offers useful information such as which generators supply a particular load or how much each generator (load) uses a particular transmission line. With this information, we can allocate required transmission revenue to market participants. Recently, several algorithms were proposed for tracing power flow but there is no dominant power tracing method. This paper proposes a power tracing method based on graph theory and complex-current distribution. For practicability, the proposed method for transmission usage allocation is applied to IEEE 30 buses and compared with the method proposed by Felix F.Wu.

PMU를 이용한 변전소 상태 해석에 관한 연구 (A Study on State Analysis of Substation Using PMU)

  • 김태희;이경민;박철원;전동훈;권대윤;최용성
    • 한국전기전자재료학회논문지
    • /
    • 제37권3호
    • /
    • pp.304-308
    • /
    • 2024
  • In this paper, in order to analyze the PMU data of the accident section, we collected the raw data of a total of 35 PMU installed at the Yeonggwang substation and tried to find a way to analyze the data, and analyzed the data using Excel format and formula. As a result, the three-phase voltage and current data of the PMU were calculated using formulas in Excel and interpreted as effective and reactive power, and it was possible to check the effective and reactive power of the accident section through the graph to see why it was different from before the accident. As a result, it was confirmed that each power was greatly reduced in the graph of the effective and reactive power of the accident section, and it was confirmed that the loss occurred as the power of the accident section was greatly reduced.