• East Asian mathematical journal
• /
• v.25 no.4
• /
• pp.449-467
• /
• 2009

In this paper we shall introduce the notion of an i-v fuzzy interior ideal, an i-v fuzzy quasi-ideal and an i-v fuzzy bi-ideal in a semi-group. We study some properties of i-v fuzzy subsets and using their properties we characterize regular semigroups.

• Journal of the Korean Vacuum Society
• /
• v.2 no.2
• /
• pp.236-245
• /
• 1993

Single crystals, SbSI : V, SbSeI : V, BiSI : V, BiSeI : V, SbSI : Cr, SbSeI : Cr, BiSI : Cr, BiSeI : Cr, SbSI : Ni, SbSeI : Ni, BiSI : Ni, and BiSeI : Ni were grown by the vertical Bridgman method. It is found that the grown single crystals have an orthorhombic structure and the indirect optical transitions. The temperature dependence of energy gap shows the two reflection point related with the phase transitions and is well fitted with Varshni equation in the continuous region. The optical absorption peaks due to the doped impurities (V, Cr and Ni) are respectively attributed to the electron transitions between the split energy levels of $V^{+2}$, $Cr^{+2}$ and $Ni^{+2}$ ions sited at $T_d$ symmetry of the host lattice.

• Journal of the Korean Mathematical Society
• /
• v.48 no.1
• /
• pp.105-115
• /
• 2011

Let f be a function which assigns a positive integer f(v) to each vertex v $\in$ V (G), let r, s and t be non-negative integers. An f-coloring of G is an edge-coloring of G such that each vertex v $\in$ V (G) has at most f(v) incident edges colored with the same color. The minimum number of colors needed to f-color G is called the f-chromatic index of G and denoted by ${\chi}'_f$(G). An [r, s, t; f]-coloring of a graph G is a mapping c from V(G) $\bigcup$ E(G) to the color set C = {0, 1, $\ldots$; k - 1} such that |c($v_i$) - c($v_j$ )| $\geq$ r for every two adjacent vertices $v_i$ and $v_j$, |c($e_i$ - c($e_j$)| $\geq$ s and ${\alpha}(v_i)$ $\leq$ f($v_i$) for all $v_i$ $\in$ V (G), ${\alpha}$ $\in$ C where ${\alpha}(v_i)$ denotes the number of ${\alpha}$-edges incident with the vertex $v_i$ and $e_i$, $e_j$ are edges which are incident with $v_i$ but colored with different colors, |c($e_i$)-c($v_j$)| $\geq$ t for all pairs of incident vertices and edges. The minimum k such that G has an [r, s, t; f]-coloring with k colors is defined as the [r, s, t; f]-chromatic number and denoted by ${\chi}_{r,s,t;f}$ (G). In this paper, we present some general bounds for [r, s, t; f]-coloring firstly. After that, we obtain some important properties under the restriction min{r, s, t} = 0 or min{r, s, t} = 1. Finally, we present some problems for further research.

• Journal of Life Science
• /
• v.22 no.2
• /
• pp.245-250
• /
• 2012

The 16S rDNA - RFLP types for six Vibrio species (V. fluvialis, V. proteolyticus, V. vulnificus, V. mimicus) including two core group members, V. alginolyticus and V. parahaemolyticu s, and Grimontia (Vibrio) hollisae were determined using PCR-RFLP analysis. Six tetrameric restriction enzymes (Alu I, Cfo I, Dde I, Hae III, Msp I, and Rsa I) were selected for RFLP analysis. V. alginolyticus, V. parahaemolyticus, and V. proteolyticus showed the same RFLP pattern following digestion with four of the six used restriction enzymes: CfoI, DdeI, MspI, and RsaI. Various restriction enzyme combinations generated digests recognizable as distinct RFLP types for each of the assayed Vibrio species. In particular, AluI single digestion produced species specific band patterns that enabled the differentiation between these Vibrio species. Dendrogram based on restriction patterns showed that two Vibrio core group members, V. alginolyticus and V. parahaemolyticus were closely related having a similarity over 90%. Although the observed RFLP pattern for Grimontia hollisae shared several common bands with other Vibrio spp., G. hollisae results were still clearly distinct from Vibrio spp. RFLP types for all restriction enzymes tested. If restriction enzymes are aptly selected, PCR-RFLP analysis is still a rapid and effective tool for differentiating Vibrio species.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.1
• /
• pp.227-235
• /
• 2015

In this paper, I propose a linear time algorithm devised to produce exact solution to NP-complete maximum clique problem. The proposed algorithm firstly, from a given graph G=(V,E), sets vertex $v_i$ of the maximum degree ${\Delta}(G)$ as clique's major vertex. It then selects vertex $v_j$ of ${\Delta}(G)$ among vertices $N_G(v_i)$ that are adjacent to $v_i$, only to determine $N_G(v_i){\cap}N_G(v_j)$ as candidate cliques w and $v_k$. Next it obtains $w=w{\cap}N_G(v_k)$ by sorting $d_G(v_k)$ in the descending order. Lastly, the algorithm executes the same procedure on $G{\backslash}w$ graph to compare newly attained cliques to previously attained cliques so as to choose the lower. With this simple method, multiple independent cliques would also be attainable. When applied to various regular and irregular graphs, the algorithm proposed in this paper has obtained exact solutions to all the given graphs linear time O(n).

• Bulletin of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.239-249
• /
• 1995

Let $V = (v_1, v_2, \cdots)$ be a sequence of positive integers arranged in nondecreasing order. We define V to be complete if every positive integer n is the sum of some subsequence of V, that is, $$ (1.1) n = \sum_{i=1}^{\infty} a_i v_i where a_i = 0 or 1.

• Proceedings of the Korean Magnestics Society Conference
• /
• 2008.12a
• /
• pp.173.2-173.2
• /
• 2008

• 한국ITS학회:학술대회논문집
• /
• 2008.11a
• /
• pp.611-616
• /
• 2008

• Information and Communications Magazine
• /
• v.34 no.6
• /
• pp.3-10
• /
• 2017

최근 운전자의 편의성과 안전성 향상을 위한 커넥티드 카 및 자율주행 차량에 대한 관심과 연구가 집중되고 있다. 이러한 커넥티드 카와 자율주행 차량의 경우 대용량의 멀티미디어 전송 및 센서 데이터 공유 등 다양한 서비스를 위해 높은 전송용량과 신뢰성을 보장할 수 있는 vehicle-to-vehicle (V2V) 통신과 vehicle-to- infrastructure (V2I) 통신에 대한 기본적인 연구와 구현이 필수적이다. 이러한 요구사항을 만족시키기 위해서 최근 mmWave 기반의 V2V, V2I에 대한 연구가 큰 주목을 받고 있다. 본고에서는 mmWave 대역 V2V 및 V2I 기술의 필요성과 채널에 관련된 기존 연구를 살펴보고, 이를 기반으로 현재까지 연구된 mmWave 대역 V2V, V2I 관련 연구에 대해 살펴보고자 한다. 또한 기존 연구의 한계점을 확인하고, 향후 연구방향과 주제에 대해 논의하고자 한다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.2
• /
• pp.9-14
• /
• 2007

A signed 3-partite graph is a 3-partite graph in which each edge is assigned a positive or a negative sign. Let G(U, V, W) be a signed 3-partite graph with $U\;=\;\{u_1,\;u_2,\;{\cdots},\;u_p\},\;V\;=\;\{v_1,\;v_2,\;{\cdots},\;v_q\}\;and\;W\;=\;\{w_1,\;w_2,\;{\cdots},\;w_r\}$. Then, signed degree of $u_i(v_j\;and\;w_k)$ is $sdeg(u_i)\;=\;d_i\;=\;d^+_i\;-\;d^-_i,\;1\;{\leq}\;i\;{\leq}\;p\;(sdeg(v_j)\;=\;e_j\;=\;e^+_j\;-\;e^-_j,\;1\;{\leq}\;j\;{\leq}q$ and $sdeg(w_k)\;=\;f_k\;=\;f^+_k\;-\;f^-_k,\;1\;{\leq}\;k\;{\leq}\;r)$ where $d^+_i(e^+_j\;and\;f^+_k)$ is the number of positive edges incident with $u_i(v_j\;and\;w_k)$ and $d^-_i(e^-_j\;and\;f^-_k)$ is the number of negative edges incident with $u_i(v_j\;and\;w_k)$. The sequences ${\alpha}\;=\;[d_1,\;d_2,\;{\cdots},\;d_p],\;{\beta}\;=\;[e_1,\;e_2,\;{\cdots},\;e_q]$ and ${\gamma}\;=\;[f_1,\;f_2,\;{\cdots},\;f_r]$ are called the signed degree sequences of G(U, V, W). In this paper, we characterize the signed degree sequences of signed 3-partite graphs.