• 제목/요약/키워드: graph $(k_0,\

검색결과 291건 처리시간 0.024초

수두손실률에 의한 방조제 침투류 감시기법 개발 (Development of the Seepage flow Monitoring Method by the Hydraulic Head Loss Rate on Sea Dike)

  • 임성훈;윤창진;김성필;허준;강병윤
    • 한국지반공학회:학술대회논문집
    • /
    • 한국지반공학회 2010년도 추계 학술발표회
    • /
    • pp.60-68
    • /
    • 2010
  • In this study, the seepage flow monitoring method by hydaulic head loss rate graph was developed for the purpose of monitoring the seepage flow from the see side or from the lake on sea dike in which seepage force was varied periodically. The hydraulic head loss rate was defined in this method. The value of the rate is in the range from 0 to 1. the value of 0 means perfectly free flow of seepage. the value of 1 means perfect waterproofing. The value of coefficient of determination in the hydraulic head loss rate graph closer to 1 means that the seepage flow way is stable. The value of coefficient of determination in the hydraulic head loss rate graph closer to 0 means that the hole may exist or the piping may be in the progress. The pore water pressure data measured in Saemangeum sea dike was analyzed with the developed method The result showed that the variation of seepage flow state was detected sensitively by this method and the interception effect of sea dike could be estimated quantitatively.

  • PDF

ON INTEGRAL GRAPHS WHICH BELONG TO THE CLASS $\overline{aK_{a}\;{\bigcup}\;{\beta}K_{b}}$

  • Lepovic, Mirko
    • Journal of applied mathematics & informatics
    • /
    • 제14권1_2호
    • /
    • pp.39-49
    • /
    • 2004
  • Let G be a simple graph and let $\={G}$ denotes its complement. We say that G is integral if its spectrum consists entirely of integers. If $\overline{aK_{a}\;{\bigcup}\;{\beta}K_{b}}$ is integral we show that it belongs to the class of integral graphs $[\frac{kt}{\tau}\;{x_0}\;+\;\frac{mt}{\tau}\;z}\;K_{(t+{\ell}n)+{\ell}m}\;\bigcup\;[\frac{kt}{\tau}\;{y_0}\;+\;\frac{(t\;+\;{\ell}n)k\;+\;{\ell}m}{\tau}\;z]n\;K_{em)$, where (i) t, k, $\ell$, m, $n\;\in\;\mathbb{N}$ such that (m, n) = 1, (n,t) = 1 and ($\ell,\;t$) = 1 ; (ii) $\tau\;=\;((t\;+\;{\ell}n)k\;+\;{\ell}m,\;mt)$ such that $\tau\;$\mid$kt$; (iii) ($x_0,\;y_0$) is a particular solution of the linear Diophantine equation $((t\;+\;{\ell}n)k\;+\;{\ell}m)x\;-\;(mt)y\;=\;\tau\;and\;(iv)\;z\;{\geq}\;{z_0}$ where $z_{0}$ is the least integer such that $(\frac{kt}{\tau}\;{x_0}\;+\;\frac{mt}{\tau}\;{z_0})\;\geq\;1\;and\;(\frac{kt}{\tau}\;{y_0}\;+\;\frac{(t+{\ell}n)k+{\ell}m}{\tau}\;{z_0})\;\geq\;1$.

ON THE 2-ABSORBING SUBMODULES AND ZERO-DIVISOR GRAPH OF EQUIVALENCE CLASSES OF ZERO DIVISORS

  • Shiroyeh Payrovi;Yasaman Sadatrasul
    • 대한수학회논문집
    • /
    • 제38권1호
    • /
    • pp.39-46
    • /
    • 2023
  • Let R be a commutative ring, M be a Noetherian R-module, and N a 2-absorbing submodule of M such that r(N :R M) = 𝖕 is a prime ideal of R. The main result of the paper states that if N = Q1 ∩ ⋯ ∩ Qn with r(Qi :R M) = 𝖕i, for i = 1, . . . , n, is a minimal primary decomposition of N, then the following statements are true. (i) 𝖕 = 𝖕k for some 1 ≤ k ≤ n. (ii) For each j = 1, . . . , n there exists mj ∈ M such that 𝖕j = (N :R mj). (iii) For each i, j = 1, . . . , n either 𝖕i ⊆ 𝖕j or 𝖕j ⊆ 𝖕i. Let ΓE(M) denote the zero-divisor graph of equivalence classes of zero divisors of M. It is shown that {Q1∩ ⋯ ∩Qn-1, Q1∩ ⋯ ∩Qn-2, . . . , Q1} is an independent subset of V (ΓE(M)), whenever the zero submodule of M is a 2-absorbing submodule and Q1 ∩ ⋯ ∩ Qn = 0 is its minimal primary decomposition. Furthermore, it is proved that ΓE(M)[(0 :R M)], the induced subgraph of ΓE(M) by (0 :R M), is complete.

STRONG CLASSIFICATION OF EXTENSIONS OF CLASSIFIABLE C*-ALGEBRAS

  • Eilers, Soren;Restorff, Gunnar;Ruiz, Efren
    • 대한수학회보
    • /
    • 제59권3호
    • /
    • pp.567-608
    • /
    • 2022
  • We show that certain extensions of classifiable C*-algebras are strongly classified by the associated six-term exact sequence in K-theory together with the positive cone of K0-groups of the ideal and quotient. We use our results to completely classify all unital graph C*-algebras with exactly one non-trivial ideal.

피보나치트리에서 피보나치 에지 번호매김방법 (The Fibonacci Edge Labelings on Fibonacci Trees)

  • 김용석
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제36권6호
    • /
    • pp.437-450
    • /
    • 2009
  • 본 논문에서는 임의의 피보나치 트리에 에지번호매김을 하여 피보나치 수들의 집합 {$F_k|k\;{\geq}\;2$}, {$F_{2k}|k\;{\geq}\;1$} 그리고 {$F_{3k+2}|k\;{\geq}\;0$}인 세가지 경우의 에지번호 집합을 얻는 7가지의 에지번호매김방법들을 제안한다. 이러한 에지번호들의 집합은 상호연결망의 일종인 원형군의 설계시 점프열로 사용할 수 있으므로 망척도 중 하나인 분지수를 결정한다.

REGULARITY OF SOAP FILM-LIKE SURFACES SPANNING GRAPHS IN A RIEMANNIAN MANIFOLD

  • Gulliver, Robert;Park, Sung-Ho;Pyo, Jun-Cheol;Seo, Keom-Kyo
    • 대한수학회지
    • /
    • 제47권5호
    • /
    • pp.967-983
    • /
    • 2010
  • Let M be an n-dimensional complete simply connected Riemannian manifold with sectional curvature bounded above by a nonpositive constant $-{\kappa}^2$. Using the cone total curvature TC($\Gamma$) of a graph $\Gamma$ which was introduced by Gulliver and Yamada [8], we prove that the density at any point of a soap film-like surface $\Sigma$ spanning a graph $\Gamma\;\subset\;M$ is less than or equal to $\frac{1}{2\pi}\{TC(\Gamma)-{\kappa}^2Area(p{\times}\Gamma)\}$. From this density estimate we obtain the regularity theorems for soap film-like surfaces spanning graphs with small total curvature. In particular, when n = 3, this density estimate implies that if $TC(\Gamma)$ < $3.649{\pi}\;+\;{\kappa}^2\inf\limits_{p{\in}F}Area(p{\times}{\Gamma})$, then the only possible singularities of a piecewise smooth (M, 0, $\delta$)-minimizing set $\Sigma$ are the Y-singularity cone. In a manifold with sectional curvature bounded above by $b^2$ and diameter bounded by $\pi$/b, we obtain similar results for any soap film-like surfaces spanning a graph with the corresponding bound on cone total curvature.

THE CONNECTED DOUBLE GEODETIC NUMBER OF A GRAPH

  • SANTHAKUMARAN, A.P.;JEBARAJ, T.
    • Journal of applied mathematics & informatics
    • /
    • 제39권1_2호
    • /
    • pp.155-163
    • /
    • 2021
  • For a connected graph G of order n, a set S of vertices is called a double geodetic set of G if for each pair of vertices x, y in G there exist vertices u, v ∈ S such that x, y ∈ I[u, v]. The double geodetic number dg(G) is the minimum cardinality of a double geodetic set. Any double godetic set of cardinality dg(G) is called a dg-set of G. A connected double geodetic set of G is a double geodetic set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected double geodetic set of G is the connected double geodetic number of G and is denoted by dgc(G). A connected double geodetic set of cardinality dgc(G) is called a dgc-set of G. Connected graphs of order n with connected double geodetic number 2 or n are characterized. For integers n, a and b with 2 ≤ a < b ≤ n, there exists a connected graph G of order n such that dg(G) = a and dgc(G) = b. It is shown that for positive integers r, d and k ≥ 5 with r < d ≤ 2r and k - d - 3 ≥ 0, there exists a connected graph G of radius r, diameter d and connected double geodetic number k.

RANDOMLY ORTHOGONAL FACTORIZATIONS OF (0,mf - (m - 1)r)-GRAPHS

  • Zhou, Sizhong;Zong, Minggang
    • 대한수학회지
    • /
    • 제45권6호
    • /
    • pp.1613-1622
    • /
    • 2008
  • Let G be a graph with vertex set V(G) and edge set E(G), and let g, f be two nonnegative integer-valued functions defined on V(G) such that $g(x)\;{\leq}\;f(x)$ for every vertex x of V(G). We use $d_G(x)$ to denote the degree of a vertex x of G. A (g, f)-factor of G is a spanning subgraph F of G such that $g(x)\;{\leq}\;d_F(x)\;{\leq}\;f(x)$ for every vertex x of V(F). In particular, G is called a (g, f)-graph if G itself is a (g, f)-factor. A (g, f)-factorization of G is a partition of E(G) into edge-disjoint (g, f)-factors. Let F = {$F_1$, $F_2$, ..., $F_m$} be a factorization of G and H be a subgraph of G with mr edges. If $F_i$, $1\;{\leq}\;i\;{\leq}\;m$, has exactly r edges in common with H, we say that F is r-orthogonal to H. If for any partition {$A_1$, $A_2$, ..., $A_m$} of E(H) with $|A_i|=r$ there is a (g, f)-factorization F = {$F_1$, $F_2$, ..., $F_m$} of G such that $A_i\;{\subseteq}E(F_i)$, $1\;{\leq}\;i\;{\leq}\;m$, then we say that G has (g, f)-factorizations randomly r-orthogonal to H. In this paper it is proved that every (0, mf - (m - 1)r)-graph has (0, f)-factorizations randomly r-orthogonal to any given subgraph with mr edges if $f(x)\;{\geq}\;3r\;-\;1$ for any $x\;{\in}\;V(G)$.

유전체 디스크가 삽입된 원통형 공동 공진기에서 Contour Graph 방법을 이용한 공진주파수 계산 (A Computation of the Resonant Frequencies using Contour Graph Method in the Dielectric-disc Loaded Cylindrical Cavity Resonators)

  • 최홍주;이원희;허정;최광제;이상영
    • 한국전자파학회논문지
    • /
    • 제11권8호
    • /
    • pp.1420-1427
    • /
    • 2000
  • 유전체 디스크가 삽입된 원통형 공동 공진기의 전자계 해와 공진주파수를 구하는 방법을 기술하였다. 유전체 디스크가 삽입된 원통형 공동 공진기의 공진주파수는 특성방정식의 해석에 의해 계산된다. 특성방벙식의 해를 Mathematica의 ContourPlot graph를 이용하여 구하였다. 공진기의 높이를 증가시키면서 계산한 공진주파수와 실험 값의 공진주파수를 비교하였다. 계산결과가 실험값과 거의 일치하는 것을 볼 수 있었다. 공진기 윗면과 동심 유전체 디스크 사이가 근접할 경우 0.2%의 공진주파수 오차를 나타내었고, 공진기 윗면과 동심 유전체 디스크 사이가 멀어짐에 따라 최대 1.6%의 공진주파수 오차를 나타내었다.

  • PDF

Risk Graph에 의해 할당된 SIL에 따른 철도 승강장 도어 시스템의 정량적 Risk 저감 모델 (Quantitative Risk Reduction Model according to SIL allocated by Risk Graph for Railway Platform Door System)

  • 송기태;이성일
    • 한국안전학회지
    • /
    • 제31권5호
    • /
    • pp.141-148
    • /
    • 2016
  • There exists required safety integrity level (SIL) to assure safety in accordance with international standards for every electrical / electronics / control equipment or systems with safety related functions. The SIL is allocated from lowest level (level 0) to highest level (level 4). In order to guarantee certain safety level that is internationally acceptable, application of methodology for SIL allocation and demonstration based on related international standards is required. Especially, in case of the SIL allocation method without determining of quantitative tolerable risk, the additional review is needed to check whether it is suitable or not is required. In this study, the quantitative risk reduction model based on the safety integrity allocation results of railway platform screen door system using Risk Graph method has been examined in order to review the suitability of quantitative risk reduction according to allocated safety integrity level.