• Journal of Advanced Marine Engineering and Technology
• /
• 제25권2호
• /
• pp.345-345
• /
• 2001

This paper was studied on the characteristics of galvanic corrosion and its protection on heat exchanger tube plate in the sea water. In this paper, behavior of pitting corrosion of Ni-al bronze connected with Ti tube was measured af flow velocity of 0 m/s and 2.4 m/s. To protect galvanic corrosion, the protection characteristics of Ni-Al bronze connected with Ti tube by Zn-base alloys galvanic anode and hexagonal nylon insert was investigated. Main results obtained asre al follows: 1) The galvanic corrosion of Ni-Al bronze connected with Ti-tube is more active than single Ni-al bronze. 2) As the circuit resistance increase under the cathodic protection employing Zn-base alloys galvanic anode, Ni-al bronze connected with Ti tube is cathodically unpolarized. 3) The corrosion of Ni-Al bronze connected with Ti tube by nylon insert controls approximately 73% than not nylon insert.

• 전력전자학회논문지
• /
• 제19권1호
• /
• pp.41-50
• /
• 2014

The rising penetration of renewable energy resulted in the development of grid-connected large-scale power plants. Therefore, grid stabilization, which depends on the system-type or grid of each country, plays an important role and has been strengthened by different grid codes. With this background, VDE-AR-N 4105 for photovoltaic (PV) systems connected to the low-voltage grid and the German Association of Energy and Water Industries (BDEW) introduced the medium-voltage grid code for connecting power plants to the grid and they are the most stringent certifications. In this paper, an optimal control strategy scheme for three-phase grid-connected PV system is enhanced with VDE-AR-N 4105 and BDEW grid code, where both active/reactive powers are controlled. Simulation and experimental results of 100kW PV inverter are shown to verify the effectiveness of the proposed implemental control strategy.

• Kyungpook Mathematical Journal
• /
• 제56권2호
• /
• pp.349-355
• /
• 2016

For any integer $n{\geq}2$, each palindrome of n induces a circulant graph of order n. It is known that for each integer $n{\geq}2$, there is a one-to-one correspondence between the set of (resp. aperiodic) palindromes of n and the set of (resp. connected) circulant graphs of order n (cf. [2]). This bijection gives a one-to-one correspondence of the palindromes ${\sigma}$ with $gcd({\sigma})=1$ to the connected circulant graphs. It was also shown that the number of palindromes ${\sigma}$ of n with $gcd({\sigma})=1$ is the same number of aperiodic palindromes of n. Let $a_n$ (resp. $b_n$) be the number of aperiodic palindromes ${\sigma}$ of n with $gcd({\sigma})=1$ (resp. $gcd({\sigma}){\neq}1$). Let $c_n$ (resp. $d_n$) be the number of periodic palindromes ${\sigma}$ of n with $gcd({\sigma})=1$ (resp. $gcd({\sigma}){\neq}1$). In this paper, we calculate the numbers $a_n$, $b_n$, $c_n$, $d_n$ in two ways. In Theorem 2.3, we $n_d$ recurrence relations for $a_n$, $b_n$, $c_n$, $d_n$ in terms of $a_d$ for $d{\mid}n$ and $d{\neq}n$. Afterwards, we nd formulae for $a_n$, $b_n$, $c_n$, $d_n$ explicitly in Theorem 2.5.

• 한국자기학회지
• /
• 제22권5호
• /
• pp.157-161
• /
• 2012

각기 암염구조를 가지는 sp 반쪽금속인 NaN과 CaN가 계면상태를 이룰 때의 반쪽금속성 및 자성을 연구하기 위해 단순계면계와 혼합계면계 두 계를 고려하여, FLAPW(full-potential linearized augmented plane wave) 방법을 이용하여 그 전자구조를 계산하였다. 계산된 원자별 자기모멘트를 보면, 단순계면계에서는 Na 쪽 계면 N 원자의 자기모멘트는 안쪽 N 원자에 비해 다소 감소하였고, Ca 쪽 계면 N원자의 경우는 다소 증가하였다. 혼합계면계에서는 계면 N 원자들의 자기모멘트는 대략 덩치 CaN과 NaN에서 N 원자의 자기모멘트 값의 평균치를 가졌으나, 아래 위층 모두에서 Na와 연결된 계면 N 원자의 자기모멘트가 가장 컸고, 아래 위층 모두에서 Ca 원자와 연결된 계면 N 원자의 자기모멘트가 가장 작았다. 이와 같은 상황은 각각의 N 원자가 이웃한 Ca나 Na 원자와 결합하면서 결합에 참여하지 않은 p 전자수가 자기모멘트의 크기를 결정한다는 사실과 부합한다. 또한 계산된 원자별 상태밀도를 통해 이들의 계면상태를 논의하였다.

• 대한수학회지
• /
• 제33권1호
• /
• pp.169-181
• /
• 1996

Let $x : M^n \longrightarrow E^m$ be an isometric immersion of an n-dimensional connected Riemannian manifold into the m-dimensional Euclidean space. Then the metric tensor on $M^n$ is naturally induced from that of $E^m$.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제3권2호
• /
• pp.173-179
• /
• 1996

M be an ($n\geq3$)-dimensional compact connected and oriented Riemannian manifold isometrically immersed on an (n ＋ 2)-dimensional sphere $S^{n＋2}$(c). If all sectional curvatures of M are not less than a positive constant c, show that M is a real homology sphere.

• 대한수학회지
• /
• 제32권2호
• /
• pp.161-170
• /
• 1995

A complex $n(\geq 2)$-dimensional Kaehlerian manifold of constant holomorphic sectional curvature c is called a complex space form, which is denoted by $M_n(c)$. A complete and simply connected complex space form is a complex projective space $P_nC$, a complex Euclidean space $C^n$ or a complex hyperbolic space $H_nC$, according as c > 0, c = 0 or c < 0. Takagi [12] and Berndt [2] classified all homogeneous real hypersufaces of $P_nC$ and $H_nC$.

• 정보통신설비학회논문지
• /
• 제10권1호
• /
• pp.7-13
• /
• 2011

Matrix multiplication is a fundamental operation of linear algebra and arises in many areas of science and engineering. This paper introduces an efficient parallel matrix multiplication scheme on N ${\times}$ N mesh-connected SIMD array processor, called multiple hierarchical SIMD architecture (HMSA). The architectural characteristic of HMSA is the hierarchically structured control units which consist of a global control unit, N local control units configured diagonally, and $N^2$ processing elements (PEs) arranged in an N ${\times}$ N array. PEs are communicating through local buses connecting four adjacent neighbor PEs in mesh-torus networks and global buses running across the rows and columns called horizontal buses and vertical buses, respectively. This architecture enables HMSA to have the features of diagonally indexed concurrent broadcast and the accessibility to either rows (row control mode) or columns (column control mode) of 2D array PEs alternately. An algorithmic mapping method is used for performance evaluation by mapping matrix multiplication on the proposed architecture. The asymptotic time complexities of them are evaluated and the result shows that paralle matrix multiplication on HMSA can provide significant performance improvement.

• Korean Journal of Mathematics
• /
• 제20권2호
• /
• pp.247-254
• /
• 2012

The Klee-Quaife problem is finding the minimum order ${\mu}(d,c,v)$ of the $(d,c,v)$ graph, which is a $c$-vertex connected $v$-regular graph with diameter $d$. Many authors contributed finding ${\mu}(d,c,v)$ and they also enumerated and classied the graphs in several cases. This problem is naturally extended to the case of digraphs. So we are interested in the extended Klee-Quaife problem. In this paper, we deal with an equivalent problem, finding the maximum diameter of digraphs with given order, focused on 2-regular case. We show that the maximum diameter of strongly connected 2-regular digraphs with order $n$ is $n-3$, and classify the digraphs which have diameter $n-3$. All 15 nonisomorphic extremal digraphs are listed.

• Journal of Communications and Networks
• /
• 제1권2호
• /
• pp.89-98
• /
• 1999

In a synchronization (sync) $network^1$containing N nodes, it is shown (Theorem 1c) that an arbitrarily connected sync network & is the union of a countable set of isolated connecting sync networks${&_i,i= 1,2,.., L}, I.E., & = \bigcup_{I=1}^L&_i$ It is shown(Theorem 2e) that aconnecting sync network is the union of a set of disjoint irreducible subnetworks having one or more nodes. It is further shown(Theorem 3a) that there exists at least one closed irreducible subnetwork in $&_i$. It is further demonstrated that a con-necting sync network is the union of both a master group and a slave group of nodes. The master group is the union of closed irreducible subnetworks in $&_i$. The slave group is the union of non-colsed irre-ducible subnetworks in $&_i$. The relationships between master-slave(MS), mutual synchronous (MUS) and hierarchical MS/MUS ent-works are clearly manifested [1]. Additionally, Theorem 5 shows that each node in the slave group is accessible by at least on node in the master group. This allows one to conclude that the synchro-nization information avilable in the master group can be reliably transported to each node in the slave group. Counting and combinatorial arguments are used to develop a recursive algorithm which counts the number $A_N$ of arbitrarily connected sync network architectures in an N-nodal sync network and the number $C_N$ of isolated connecting sync network in &. EXamples for N=2,3,4,5 and 6 are provided. Finally, network examples are presented which illustrate the results offered by the theorems. The notation used and symbol definitions are listed in Appendix A.