• Communications of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.435-445
• /
• 2017

Let D be a directed graph with p vertices and q arcs. A vertex out-magic total labeling is a bijection f from $V(D){\cup}A(D){\rightarrow}\{1,2,{\ldots},p+q\}$ with the property that for every $v{\in}V(D)$, $f(v)+\sum_{u{\in}O(v)}f((v,u))=k$, for some constant k. Such a labeling is called a V-super vertex out-magic total labeling (V-SVOMT labeling) if $f(V(D))=\{1,2,3,{\ldots},p\}$. A digraph D is called a V-super vertex out-magic total digraph (V-SVOMT digraph) if D admits a V-SVOMT labeling. In this paper, we provide a method to find the most vital nodes in a network by introducing the above labeling and we study the basic properties of such labelings for digraphs. In particular, we completely solve the problem of finding V-SVOMT labeling of generalized de Bruijn digraphs which are used in the interconnection network topologies.

• Information and Communications Magazine
• /
• v.33 no.4
• /
• pp.41-46
• /
• 2016

본 고에서는 협력 자율 주행을 위한 V2X 통신 기술을 소개한다. 자동차는 IT 기술이 접목되어 편리하고 안전하며 지능화된 자동차로 발전하고 있으며 2020년에는 자율주행자동차가 출현할 것으로 전망하고 있다. V2X 통신 기술은 자동차 안전 지원 서비스를 제공하며 다양한 차량 센서와 융합되어 주행 제어가 이루어지는 협력 자율 주행 서비스도 제공할 수 있다. 본 고에서는 차량 안전 기술과 협력 자율 주행 기술의 개념과 V2X 통신 기술 개발 동향 및 표준화 동향, 그리고 향후 전망에 대하여 살펴 본다.

• Communications of the Korean Mathematical Society
• /
• v.35 no.3
• /
• pp.1037-1043
• /
• 2020

We show that if M and V are Seifert forms such that M is metabolic and has nontrivial Alexander polynomial, then there exists a knot K having Seifert form M ⊕ V that is not concordant to any knot with Seifert form V.

• Communications of the Korean Mathematical Society
• /
• v.19 no.2
• /
• pp.293-305
• /
• 2004

Trotter-Kato type approximations of the convoluted solution operator families for the Volterra integral equations (V $E_n$): v(t)=$A_{n} \int_0^t v(t-s) d\mu_n(s) + f_n(t), t \geq 0$ and the convergence of the solutions to the equations (V $E_n$) are studied.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.2
• /
• pp.128-141
• /
• 2018

In this paper, a methodology to analyze the potential safe benefit of six cooperative driver assistance systems via V2V (vehicle-to-vehicle) communications is proposed. Although it is quite necessary to assess social impact with respect to new safety technologies for cooperative vehicles with V2V communications, there are few studies in Korea to predict the quantitative safety benefit analysis. In this study, traffic accident scenarios are classified based on traffic fatality between passenger cars. The sequential collision type is classified for a multiple pile-up with respect to collision direction such as forward, side, head-on collisions. Then movement of surrounding vehicle is considered for the scenario classification. Next, the cooperative driver assistance systems such as forward collision warning, blind spot detection, and intersection movement assistance are related with the corresponding accident scenarios. Finally, it is summarized how much traffic fatality may be reduced potentially due to the V2V communication based safety services.

• Journal of information and communication convergence engineering
• /
• v.3 no.2
• /
• pp.76-79
• /
• 2005

In this paper, a low-complexity maximum-likelihood (ML) decoder based on QR decomposition, called real-valued LCMLDec decoder or RVLCMLDec for short, is proposed for the Vertical Bell Labs Layered Space-Time (V-BLAST) architecture, a promising candidate for providing high data rates in future fixed wireless communication systems [1]. Computer simulations, in comparison with other detection techniques, show that the proposed decoder is capable of providing the V­BLAST schemes with ML performance at low detection complexity

• Communications of the Korean Mathematical Society
• /
• v.30 no.3
• /
• pp.313-325
• /
• 2015

An H-magic labeling in a H-decomposable graph G is a bijection $f:V(G){\cup}E(G){\rightarrow}\{1,2,{\cdots},p+q\}$ such that for every copy H in the decomposition, $\sum{_{{\upsilon}{\in}V(H)}}\;f(v)+\sum{_{e{\in}E(H)}}\;f(e)$ is constant. f is said to be H-V -super magic if f(V(G))={1,2,...,p}. In this paper, we prove that complete bipartite graphs $K_{n,n}$ are H-V -super magic decomposable where $$H{\sim_=}K_{1,n}$$ with $n{\geq}1$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.4
• /
• pp.1059-1067
• /
• 1996

A 128/129 dual-modulus prescalar IC is designed for application to frequency synthesizers in high frequency communication systems. The FET logic used in this design is SCFL(Source Coupled FET Logic), employing depletion-mode 1.mu.m gate length GaAs MESFETs with the threshold voltage of -1.5V. This circuit consists of 8 flip-flops, 3 OR gates, 2 NOR gates, a modulus control buffer and I/O buffers, which are integrated with about 440 GaAs MESFETs on dimensions of 1.8mm. For $V_{DD}$ and $V_{SS}$ power supply voltages 5V and -3.3V Commonly used in TTL and ECL circuits are determined, respectively. The simulation results taking into account the threshold voltage variation of .+-.0.2V and the power supply variation of .+-.1V demonstrate that the designed prescalar can operate up to 2GHz. This prescalar is fabricated using the ETRI MMIC foundary process and the measured maximum operating frquency is 621MHz.

• Journal of information and communication convergence engineering
• /
• v.4 no.1
• /
• pp.5-9
• /
• 2006

In this paper, a low-complexity ML decoder based on QR decomposition, called LCMLDec decoder, is proposed for the V-BLAST with 2 transmit antennas. Then, it is combined with other suboptimal interference nulling and cancelling decoders originated form QR decomposition such as sorted QR or MMSE-SQRD decoder to generate efficient decoders that significantly improve the performance of the V-BLAST with more than 2 transmit antennas, at the expense of a small increase in complexity. Simulation results are provided to demonstrate the performances and complexities of the proposed decoders.

• Communications of the Korean Mathematical Society
• /
• v.7 no.1
• /
• pp.61-64
• /
• 1992