• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.86-94
• /
• 2004

In this paper, we show that $ G(2^m, 4), m{\geq}3$with at most m-2 faulty elements has a fault-free cycle of length 1 for every ${\leq}1{\leq}2^m-f_v$ is the number of faulty vertices. To achieve our purpose, we define a graph G to be k-fault hypohamiltonian-connected if for any set F of faulty elements, G- F has a fault-free path joining every pair of fault-free vertices whose length is shorter than a hamiltonian path by one, and then show that$ G(2^m, 4), m{\geq}3$ is m-3-fault hypohamiltonian-connected.

• Journal of the Korean Mathematical Society
• /
• v.56 no.5
• /
• pp.1371-1385
• /
• 2019

Given a topological space X and a non-negative integer k, ${\varepsilon}^{\sharp}_k(X)$ is the set of all self-homotopy equivalences of X that do not change maps from X to an t-sphere $S^t$ homotopically by the composition for all $t{\geq}k$. This set is a subgroup of the self-homotopy equivalence group ${\varepsilon}(X)$. We find certain homotopic tools for computations of ${\varepsilon}^{\sharp}_k(X)$. Using these results, we determine ${\varepsilon}^{\sharp}_k(M(G,n))$ for $k{\geq}n$, where M(G, n) is a Moore space type of (G, n) for a finitely generated abelian group G.

• Transactions of Materials Processing
• /
• v.15 no.5 s.86
• /
• pp.373-381
• /
• 2006

The key technologies necessary to develop and utilize a double-action link-type hydraulic die set for the enclosed die forging are presented in this paper. Various die sets for the enclosed die forging are investigated and the technologies necessary to develop and to utilize a double-action link-type hydraulic die set are introduced in detail with emphasis on the mechanism of the die set and its kinematical behaviors, the force transmission mechanism, the criterion on the enclosed die forging and its application, the forming load prediction and the stress distribution of the link. A double-action link-type hydraulic die set is developed and it is applied to the enclosed die forging of a bevel gear.

• 전기의세계
• /
• v.13 no.2
• /
• pp.1-4
• /
• 1964

Phase transformation is used to change some phase from phase in A.C. system. We have been used Scott or Fork connection in phase transformation the otherwise phase transformation was constructed from M-G set. From this M-G set, we could make phase shift facilities by mannual. Now, I can derive more easy phase transformation from taking another method. I believe this new phase transformation method in the first thing in the world. And so, I am going to explain about phase transformer construction process. The first, we could devide into equal part of core around the iron core as to be same size. The second, you will make primary and secondary winding on the core. The third, when you will supplied three phase A.C. at the terminal of primary winding you can get e.m.f. inducing of some phase at secondary. And so, we could make phase change from some phase A.C. We can apply this principle in many fields, i.e., freequency changer, phase leader of no use condenser, voltage regulator in keeping balance, and D.C. generator. And more, I will introduce in details concerning main pinciple and theory through following chapter.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.999-1007
• /
• 1999

이 논문은 재귀원형군 G(2^m , 2^k )를 그래프 이론적 관점에서 고찰하고 정점이 서로소인 사이클과 그래프 invariant에 관한 위상 특성을 제시한다. 재귀원형군은 1 에서 제안된 다중 컴퓨터의 연결망 구조이다. 재귀원형군 {{{{G(2^m , 2^k )가 길이 사이클을 가질 필요 충분 조건을 구하고, 이 조건하에서 G(2^m , 2^k )는 가능한 최대 개수의 정점이 서로소이고 길이가l`인 사이클을 가짐을 보인다. 그리고 정점 및 에지 채색, 최대 클릭, 독립 집합 및 정점 커버에 대한 그래프 invariant를 분석한다.Abstract In this paper, we investigate recursive circulant G(2^m , 2^k ) from the graph theory point of view and present topological properties of G(2^m , 2^k ) concerned with vertex-disjoint cycles and graph invariants. Recursive circulant is an interconnection structure for multicomputer networks proposed in 1 . A necessary and sufficient condition for recursive circulant {{{{G(2^m , 2^k ) to have a cycle of lengthl` is derived. Under the condition, we show that G(2^m , 2^k ) has the maximum possible number of vertex-disjoint cycles of length l`. We analyze graph invariants on vertex and edge coloring, maximum clique, independent set and vertex cover.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.6
• /
• pp.631-637
• /
• 2018

In 5G mobile communication, it is necessary to provide different mobility to user equipments(UE) that do not require mobility management or need limited mobility management. In this paper, we propose a two-layer mobility management system that classifies multiple MTC devices with similar mobility levels into c-MTC and m-MTC groups. In order to improve the energy efficiency and service life by reducing the number of control signals generated when TAU is performed, the group header typically performs a Tracking Area Update(TAU) request and adjusts the periodic TAU update period according to the mobility level. The TAU update period of the m-MTC is set to 54 minutes proposed by the 3GPP standard and the c-MTC is set to 12 minutes. Compared to when the UEs perform TAU individually, it is found that the number of control signals decreases by 33% when the MME is not changed and by 49% when the MME is not changed in the m-MTC or c-MTC group.

• Journal of Korea Technical Association of The Pulp and Paper Industry
• /
• v.45 no.5
• /
• pp.1-13
• /
• 2013

This study found fit optimum C, M, Y, K solid density and $CIEL^*a^*b^*$ value to paper & ink as well as check about printing machine state for color management in H-UV waterless off-set printing first. These values applied to GRACoL G7 calibration method. This method is one of color standard management method of printing. GRACoL G7 calibration method is possible stable tone reappearance by controlling gray balance by NPDC(Natural Printing Density Curve). Also, this study used values to make device profile as result that is gotten by application of GRACoL G7 calibration method. This profile was applied to CMS(Color Management System) of H-UV waterless off-set printing, and the result was possible by color management that correspond in printing quality standard of ISO 12647-2 and GRACol 2006 specifications.

• Kyungpook Mathematical Journal
• /
• v.60 no.3
• /
• pp.467-475
• /
• 2020

Let G be a chemical graph with vertex set {v₁, v₁, …, v_n} and degree sequence d(G) = (deg_G(v₁), deg_G(v₂), …, deg_G(v_n)). The inverse degree, R(G) of G is defined as $R(G)={\sum{_{i=1}^{n}}}\;{\frac{1}{deg_G(v_i)}}$. The cyclomatic number of G is defined as γ = m - n + k, where m, n and k are the number of edges, vertices and components of G, respectively. In this paper, some upper bounds on the diameter of a chemical graph in terms of its inverse degree are given. We also obtain an ordering of connected chemical graphs with respect to the inverse degree.

• Transactions on Electrical and Electronic Materials
• /
• v.15 no.2
• /
• pp.81-86
• /
• 2014

The process parameter in optimized KOH alkali activation of soft carbon series coke material in high purity was set with DOE experiments design. The activated carbon was produced by performing the activation process based on the set process parameters. The specific surface area was measured and pore size was analyzed by $N_2$ absorption method for the produced activated carbon. The surface functional group was analyzed by Boehm method and metal impurities were analyzed by XRF method. The specific surface area was increased over 2,000 $m^2/g$ as the mixing ratio of activation agent increased. The micro pores in $5{\sim}15{\AA}$ and surface functional group under 0.4 meq/g were obtained. The contents of the metal impurity in activated carbon which is the factor for reducing the electrochemical characteristics was reduced less than 100 ppm through the cleansing process optimization. The electrochemical characteristics of activated carbon in 38.5 F/g and 26.6 F/cc were checked through the impedance measuring with cyclic voltammetry scan rate in 50~300 mV/s and frequency in 10 mHz ~100 kHz. The activated carbon was made in the optimized activation process conditions of activation time in 40 minutes, mixing ratio of activation agent in 4.5 : 1.0 and heat treatment temperature over $650^{\circ}C$.

• Kyungpook Mathematical Journal
• /
• v.55 no.2
• /
• pp.279-287
• /
• 2015

A subset S of V (G), where G is a graph without isolated vertices, is a double dominating set of G if for each $x{{\in}}V(G)$, ${\mid}N_G[x]{\cap}S{\mid}{\geq}2$. This paper, shows that any positive integers a, b and n with $2{\leq}a<b$, $b{\geq}2a$ and $n{\geq}b+2a-2$, can be realized as domination number, double domination number and order, respectively. It also characterize the double dominating sets in the Cartesian and tensor products of two graphs and determine sharp bounds for the double domination numbers of these graphs. In particular, it show that if G and H are any connected non-trivial graphs of orders n and m respectively, then ${\gamma}_{{\times}2}(G{\square}H){\leq}min\{m{\gamma}_2(G),n{\gamma}_2(H)\}$, where ${\gamma}_2$, is the 2-domination parameter.