• Title/Summary/Keyword: n-connected

Search Result 758, Processing Time 0.023 seconds

GEOMETRY OF FIELD EQUATIONS ON $MEX_n$

  • Yoo, Ki-Jo
    • Communications of the Korean Mathematical Society
    • /
    • v.16 no.4
    • /
    • pp.637-648
    • /
    • 2001
  • An n-dimensional ME-manifold ME $X_{n}$ is a general-ized Riemannian manifold connected by the ME-connection which is both Einstein and of the form (2.13). The purpose of this paper is to study the properties of the ME-curvature tensors, the con-tracted ME-curvature tensors and the field equations in ME $X_{n}$)n)

  • PDF

New Double-Connected Multi-Step Inverter for High Power Motor Drive Applications (대용량 모터드라이브 적용을 위한 새로운 이중접속방식의 멀티스텝 인버터)

  • Yang, Seung-Uk;Choe, Gyu-Ha;Mok, Hyung-Soo
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.11 no.3
    • /
    • pp.209-215
    • /
    • 2006
  • Now, in this paper, going to present you with an Idea related to a new inverter of multi-step voltage source, that Is, the double-connected 12-step inverter with an auxiliary circuit. It possibly can be 24-step inverter with 3-phase voltage source which will enable us make full application even to medium and high power-level Motor drive, UPS, STATCOM, SVC, etc. in which the PWM method could not be employed. 24-step operation can be obtained from the link between the existing 12-step inverter and the additional auxiliary circuit in which the transformer of auxiliary circuit generates ripple voltage delivered to the inverter. Through a lot of experiments and simulations, (from which the validity of this scheme is confirmed,) we came to the conclusion that the increase of the primary winding number on transformer by 2N(N=1,2,3....) leads to the 12M-step(M=2,3,4...) inverter. The validity of the proposed scheme is confirmed by the simulated and experimental results.

THE CONNECTED SUBGRAPH OF THE TORSION GRAPH OF A MODULE

  • Ghalandarzadeh, Shaban;Rad, Parastoo Malakooti;Shirinkam, Sara
    • Journal of the Korean Mathematical Society
    • /
    • v.49 no.5
    • /
    • pp.1031-1051
    • /
    • 2012
  • In this paper, we will investigate the concept of the torsion-graph of an R-module M, in which the set $T(M)^*$ makes up the vertices of the corresponding torsion graph, ${\Gamma}(M)$, with any two distinct vertices forming an edge if $[x:M][y:M]M=0$. We prove that, if ${\Gamma}(M)$ contains a cycle, then $gr({\Gamma}(M)){\leq}4$ and ${\Gamma}(M)$ has a connected induced subgraph ${\overline{\Gamma}}(M)$ with vertex set $\{m{\in}T(M)^*{\mid}Ann(m)M{\neq}0\}$ and diam$({\overline{\Gamma}}(M)){\leq}3$. Moreover, if M is a multiplication R-module, then ${\overline{\Gamma}}(M)$ is a maximal connected subgraph of ${\Gamma}(M)$. Also ${\overline{\Gamma}}(M)$ and ${\overline{\Gamma}}(S^{-1}M)$ are isomorphic graphs, where $S=R{\backslash}Z(M)$. Furthermore, we show that, if ${\overline{\Gamma}}(M)$ is uniquely complemented, then $S^{-1}M$ is a von Neumann regular module or ${\overline{\Gamma}}(M)$ is a star graph.

FDVRRP: Router implementation for fast detection and high availability in network failure cases

  • Lee, Changsik;Kim, Suncheul;Ryu, Hoyong
    • ETRI Journal
    • /
    • v.41 no.4
    • /
    • pp.473-482
    • /
    • 2019
  • High availability and reliability have been considered promising requirements for the support of seamless network services such as real-time video streaming, gaming, and virtual and augmented reality. Increased availability can be achieved within a local area network with the use of the virtual router redundancy protocol that utilizes backup routers to provide a backup path in the case of a master router failure. However, the network may still lose a large number of packets during a failover owing to a late failure detections and lazy responses. To achieve an efficient failover, we propose the implementation of fast detection with virtual router redundancy protocol (FDVRRP) in which the backup router quickly detects a link failure and immediately serves as the master router. We implemented the FDVRRP using open neutralized network operating system (OpenN2OS), which is an open-source-based network operating system. Based on the failover performance test of OpenN2OS, we verified that the FDVRRP exhibits a very fast failure detection and a failover with low-overhead packets.

ANOTHER CHARACTERIZATION OF ROUND SPHERES

  • Lee, Seung-Won;Koh, Sung-Eun
    • Bulletin of the Korean Mathematical Society
    • /
    • v.36 no.4
    • /
    • pp.701-706
    • /
    • 1999
  • A characterization of geodesic spheres in the simply connected space forms in terms of the ratio of the Gauss-Kronecker curvature and the (usual) mean curvature is given: An immersion of n dimensional compact oriented manifold without boundary into the n + 1 dimensional Euclidean space, hyperbolic space or open half sphere is a totally umbilicimmersion if the mean curvature $H_1$ does not vanish and the ratio $H_n$/$H_1$ of the Gauss-Kronecker curvature $H_n$ and $H_1$ is constant.

  • PDF

Homotopical triviality of entire rational maps to even dimensional spheres

  • Suh, Dong-Youp
    • Communications of the Korean Mathematical Society
    • /
    • v.11 no.3
    • /
    • pp.807-814
    • /
    • 1996
  • Let $G = Z_2$. Let X be any compact connected orientable nonsingular real algebraic variety of dim X = k = odd with the trivial G action, and let Y be the unit sphere $S^{2n-k}$ with the antipodal action of G. Then we prove that any G invariant entire rational map $f : x \times Y \to S^{2n}$ is G homotopically trivial. We apply this result to prove that any entire rational map $g : X \times RP^{2n-k} \to S^{2n}$ is homotopically trivial.

  • PDF

AN EFFICIENT ALGORITHM TO SOLVE CONNECTIVITY PROBLEM ON TRAPEZOID GRAPHS

  • Ghosh, Prabir K.;Pal, Madhumangal
    • Journal of applied mathematics & informatics
    • /
    • v.24 no.1_2
    • /
    • pp.141-154
    • /
    • 2007
  • The connectivity problem is a fundamental problem in graph theory. The best known algorithm to solve the connectivity problem on general graphs with n vertices and m edges takes $O(K(G)mn^{1.5})$ time, where K(G) is the vertex connectivity of G. In this paper, an efficient algorithm is designed to solve vertex connectivity problem, which takes $O(n^2)$ time and O(n) space for a trapezoid graph.

An Improved Turn-Off Gate Control Scheme for Series Connected IGBTs (IGBT 직렬 연결을 위한 턴-오프 게이트 구동기법)

  • 김완중;최창호;현동석
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.4 no.1
    • /
    • pp.99-104
    • /
    • 1999
  • The large scale industry needs high voltage converters. Therefore series connection of power semiconductor devices is necessary. It is important to prevent the overvoltage from being induced across a device above ratings by the proper voltage balancing in the field of IGBT series connection. In addition, the overvoltage induced by a stray inductance has to be limited in the high power circuit. This paper proposes a new gate control scheme which can balance the voltage properly and limit the overshoot by controlling the slope of collector voltage under the turn-off transient in the series connected IGBTs. The proposed gate control scheme which senses the collector voltage and controls the gate signal actively limits the overvoltage. The new series connected IGBT gate driver is made and its validity is verified by the experimental results in the series connected IGBT circuit.

THE SZEGO KERNEL AND A SPECIAL SELF-CORRESPONDENCE

  • Jeong, Moon-Ja
    • The Pure and Applied Mathematics
    • /
    • v.5 no.2
    • /
    • pp.101-108
    • /
    • 1998
  • For a smoothly bounded n-connected domain $\Omega$ in C, we get a formula representing the relation between the Szego" kernel associated with $\Omega$ and holomorphic mappings obtained from harmonic measure functions. By using it, we show that the coefficient of the above holomorphic map is zero in doubly connected domains.

  • PDF