• The KIPS Transactions:PartC
• /
• v.14C no.4
• /
• pp.365-370
• /
• 2007

Connected Dominating Set(CDS) has been used as a virtual backbone in wireless ad hoc networks by numerous routing and broadcast protocols. Although computing minimum CDS is known to be NP-hard, many protocols have been proposed to construct a sub-optimal CDS. However, these protocols are either too complicated, needing non- local information, not adaptive to topology changes, or fail to consider the difference of energy consumption for nodes in and outside of the CDS. In this paper, we present two Timer-based Energy-aware Connected Dominating Set Protocols(TECDS). The energy level at each node is taken into consideration when constructing the CDS. Our protocols are able to maintain and adjust the CDS when network topology is changed. The simulation results have shown that our protocols effectively construct energy-aware CDS with very competitive size and prolong the network operation under different level of nodal mobility.

• Journal of the Korean Mathematical Society
• /
• v.45 no.6
• /
• pp.1647-1659
• /
• 2008

Let R be a ring with identity, X the set of all nonzero, nonunits of R and G the group of all units of R. First, we investigate some connected conditions of the zero-divisor graph $\Gamma(R)$ of a noncommutative ring R as follows: (1) if $\Gamma(R)$ has no sources and no sinks, then $\Gamma(R)$ is connected and diameter of $\Gamma(R)$, denoted by diam($\Gamma(R)$) (resp. girth of $\Gamma(R)$, denoted by g($\Gamma(R)$)) is equal to or less than 3; (2) if X is a union of finite number of orbits under the left (resp. right) regular action on X by G, then $\Gamma(R)$ is connected and diam($\Gamma(R)$) (resp. g($\Gamma(R)$)) is equal to or less than 3, in addition, if R is local, then there is a vertex of $\Gamma(R)$ which is adjacent to every other vertices in $\Gamma(R)$; (3) if R is unit-regular, then $\Gamma(R)$ is connected and diam($\Gamma(R)$) (resp. g($\Gamma(R)$)) is equal to or less than 3. Next, we investigate the graph automorphisms group of $\Gamma(Mat_2(\mathbb{Z}_p))$ where $Mat_2(\mathbb{Z}_p)$ is the ring of 2 by 2 matrices over the galois field $\mathbb{Z}_p$ (p is any prime).

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.623-624
• /
• 2008

We present a level set method for numerical shape optimization of electromagnetic systems. The level set method does not only lead to efficient computational schemes, but also is able to handle topological changes such as merging, splitting and even disappearing of connected components. The velocity field on boundaries is obtained by a shape derivative of continuum sensitivity analysis using the material derivative concept and an adjoint variable technique. Two numerical results of dielectric optimization between electrodes showed that the level set method is feasible and effective in solving shape optimization problems of electromagnetic systems.

• Journal of the Chungcheong Mathematical Society
• /
• v.19 no.4
• /
• pp.403-408
• /
• 2006

A pebbling move on a connected graph G is taking two pebbles off of one vertex and placing one of them on an adjacent vertex. The domination cover pebbling number ${\psi}(G)$ is the minimum number of pebbles required so that any initial configuration of pebbles can be transformed by a sequence of pebbling moves so that the set of vertices that contain pebbles forms a domination set of G. We determine the domination cover pebbling number for fans, fuses, and pseudo-star.

• Journal of the Korean Mathematical Society
• /
• v.36 no.2
• /
• pp.431-445
• /
• 1999

A digraph T is called a local tournament if for every vertex x of T, the set of in-neighbors as well as the set of out-neighbors of in-neighbors of x induce tournaments. Let x and y be two vertices of a 3-connected and arc-3-cyclic local tournament T with y x. We investigate the structure of T such that T contains no (x,y)-path of length k for some k with 3 k V(T) -1. Our result generalized those of [2] and [5] for tournaments.

• Korean Journal of Mathematics
• /
• v.28 no.2
• /
• pp.285-294
• /
• 2020

We study the complementary information set codes (for short, CIS codes) over 𝔽₄. They are strongly connected to correlation-immune functions over 𝔽₄. Also the class of CIS codes includes the self-dual codes. We find a construction method of CIS codes over 𝔽₄ and a criterion for checking equivalence of CIS codes over 𝔽₄. We complete the classification of all inequivalent CIS codes of length up to 8 over 𝔽₄.

• Bulletin of the Korean Mathematical Society
• /
• v.33 no.1
• /
• pp.75-86
• /
• 1996

Let G be a finite simple connected graph with vertex set V(G) and edge set E(G). Let A(G) be the adjacency matrix of G. The characteristic polynomial of G is the characteristic polynomial $\Phi(G;\lambda) = det(\lambda I - A(G))$ of A(G). A zero of $\Phi(G;\lambda)$ is called an eigenvalue of G.

• Journal of the Korean Mathematical Society
• /
• v.35 no.1
• /
• pp.165-175
• /
• 1998

We give a generalization of the selection theorem of Ben-El-Mechaiekh and Oudadess to complete LD-metric spaces with the aid of the notion of n-connectedness. Our new selection theorem is used to obtain new results of fixed points and coincidence points for compact lower semicontinuous set-valued maps with closed values consisting of D-sets in a complete LD-metric space.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.6
• /
• pp.1891-1908
• /
• 2018

In this paper, we investigate the existence of an S-shaped connected component in the set of positive solutions of the Dirichlet problem of the one-dimension Minkowski-curvature equation $$\{\(\frac{u^{\prime}}{\sqrt{1-u^{{\prime}2}}}\)^{\prime}+{\lambda}a(x)f(u)=0,\;x{\in}(0,1),\\u(0)=u(1)=0$$, where ${\lambda}$ is a positive parameter, $f{\in}C[0,{\infty})$, $a{\in}C[0,1]$. The proofs of main results are based upon the bifurcation techniques.

• Proceedings of the KIPE Conference
• /
• 2008.06a
• /
• pp.247-249
• /
• 2008

There are many types of grid-connected inverter controllers; Synchronous Reference Frame (SRF)-based controller is the most popular methods. SRF-based controller is capable for reducing both of zero-steady state error and phase delay. However, SRF-based controller has a complex algorithm to apply in real application such as digital processor. Resonant controller is also reduced zero-steady state error, but its transfer function has a high order. In this paper, a simple proportional control is applied for grid connected inverter with LCL filter. LCL filter is a third order system. Applying a simple proportional controller is not increased the order of closed loop transfer function. By this technique, the single phase model is easily obtained. To reduce steady state error, proportional gain is set as high as possible, but it may produce instability. To compromise between a minimum steady state error and stability, the single phase model is evaluate through Root Locus and Bode diagram. PSIM simulation is used to verify the analysis.