• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.63 no.1
• /
• pp.40-45
• /
• 2014

This study examines the system and process of battery stored energy in vehicles and suggest the effective area for the use of V2G(vehicle-to-grid) from Jeju Smart Grid Demonstration Project. V2G means technology of electric power transmission from the battery of electric-drive vehicles to state grid. As for the increasing of effectiveness for demand-side control, V2G is a very good alternative. In the U.S., the utilization of electric vehicles is under 40% on average. In this case, we can use he battery of electric vehicle as role of frequency regulation or generator of demand-side resource. V2G, which is the element of Smart Transportation, consists of electric vehicle battery, BMS(battery management system), OBC(on-board charger), charging infrastructure, NOC(network operating center) and TOC(total operation center). V2G application has been tested for frequency regulation to secure the economical efficiency in the United States. In this case, the battery cycle life is not verified its disadvantage. On the other hand, Demand Response is required by low c-rate of battery in electric vehicle and It can be small impact on the battery cycle life. This paper concludes business area of demand response is more useful than frequency regulation in V2G application of electric vehicles in Korea. This provides the opportunity to create a new business for power grid administrator with VPP(virtual power plant).

• The Journal of the Convergence on Culture Technology
• /
• v.7 no.4
• /
• pp.759-764
• /
• 2021

Because sensitive and private information should be exchanged between electric vehicles and a V2G service provider, reliable communication channel is essential to operate Vehicle-to-Grid (V2G) system which considers battery of electric vehicles as a factor of smart grid. The block chain is a platform for cryptocurrency transaction and fully distributed database system running by only equivalent node in the network without help of any central management or 3^rd party. In this paper, the structure and operation method of the blockchain are investigated, and the application of the blockchain for the V2G system was also explained and analyzed.

• Journal of applied mathematics & informatics
• /
• v.39 no.1_2
• /
• pp.13-29
• /
• 2021

For a graph G = (V, E), a vertex coloring (or, simply, a coloring) of G is a function C : V (G) → {1, 2, …, k} (using the non-negative integers {1, 2, …, k} as colors). We say that a coloring of a graph G is injective if for every vertex v ∈ V (G), all the neighbors of v are assigned with distinct colors. The injective chromatic number χi(G) of a graph G is the least k such that there is an injective k-coloring [6]. In this paper, we study a natural variation of the injective coloring problem: coloring the edges of a graph under the same constraints (alternatively, to investigate the injective chromatic number of line graphs), we define the k- injective edge coloring of a graph G as a mapping C : E(G) → {1, 2, …, k}, such that for every edge e ∈ E(G), all the neighbors edges of e are assigned with distinct colors. The injective chromatic index χ′in(G) of G is the least positive integer k such that G has k- injective edge coloring, exact values of the injective chromatic index of different families of graphs are obtained, some related results and bounds are established. Finally, we define the injective clique number ωin and state a conjecture, that, for any graph G, ωin ≤ χ′in(G) ≤ ωin + 2.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.261-271
• /
• 2007

The symbol C($m_1^{n_1}m_2^{n_2}{\cdots}m_s^{n_s}$) denotes a 2-regular graph consisting of $n_i$ cycles of length $m_i,\;i=1,\;2,\;{\cdots},\;s$. In this paper, we give some construction methods of cyclic($K_v$, G)-designs, and prove that there exists a cyclic($K_v$, G)-design when $G=C((4m_1)^{n_1}(4m_2)^{n_2}{\cdots}(4m_s)^{n_s}\;and\;v{\equiv}1(mod\;2|G|)$.

• Journal of Advanced Navigation Technology
• /
• v.27 no.6
• /
• pp.861-864
• /
• 2023

Recently, V2X (vehicle-to-everyting) communication has established itself as an essential technology for cooperative autonomous driving. V2X communication currently includes DSRC (dedicated short range communication) communication technology, which is a WLAN (wireless local area network) based communication technology, and C-V2X (cellular-V2X) communication technology, which is a Cellular-based communication technology. Since these two communication methods are not compatible with each other, various studies and experiments are being conducted to select one of the two communication methods. In the case of C-V2X communication, there are LTE-V2X (long term evolutionV2X) communication technology, which is an initial version, and 5G-V2X communication technology, which is a next-generation version. 5G-V2X communication technology has been completed only until standardization, so LTE-V2X communication technology is mainly used. In this paper, we introduce trends related to various issues in V2X communication, including communication method decisions.

• Korean Journal of Clinical Laboratory Science
• /
• v.39 no.2
• /
• pp.113-121
• /
• 2007

Hearing loss is a common congenital disorder that is frequently associated with mutations in the Cx26 gene (GJB2). Recently, the mutation analysis of GJB2 has been used in a newborn screening test for the detection of hearing impairment. Population-based studies should be performed before the application of genetic testing for the identification of deaf newborns. In this study, 8 positions of GJB2 mutations-including 35delG, 167delT, 235delC, V27I, V37I, M34T, E114G, and I203T-were analyzed using PCR-direct sequencing in a total of 437 healthy Korean neonates. DNAs from dried blood spots were extracted using a commercial DNA extraction kit. The PCR-amplified products (783 bps) of the GJB2 gene were detected using 2% agarose gel electrophoresis and subjected to direct sequencing. The sequences were compared with those in the GenBank database by using the BLAST program. In this study, 5 GJB2 mutations -including V27I (79G>A), V37I (109G>A), E114G (341A>G), I203T (608T>C), and 235delC- were found. Of the 437 neonate samples, 301 subjects showed GJB2 mutations (68.9%, 301/437). The V27I mutation was found in 271 subjects and was the most frequent (62.0%, 271/437). The E114G, I203T and V37I mutations were shown in 146, 17 and 14 subjects, respectively. The 235delC mutation was found in 1 subject. The E114G mutation was frequently accompanied by the V27I mutation. V27I/E114G (97.2%, 143/147) was the most common double mutation and 3 subjects had the double mutation V27I/I203T. A triple mutation, V27I/E114G/I203T, was found in 1 subject. In conclusion, PCR-direct sequencing is a convenient tool for the rapid detection of GJB2 mutations and this data might provide information for the genetic counseling of the GJB2 gene.

• Journal of Internet Technology
• /
• v.21 no.1
• /
• pp.249-264
• /
• 2020

Cellular (C) setups facilitate the connectivity amongst the devices with better provisioning of services to its users. Vehicular networks are one of the representative setups that aim at expanding their functionalities by using the available cellular systems like Long Term Evolution (LTE)-based Evolved Universal Terrestrial Radio Access Network (E-UTRAN) as well as the upcoming Fifth Generation (5G)-based functional architecture. The vehicular networks include Vehicle to Vehicle (V2V), Vehicle to Infrastructure (V2I), Vehicle to Pedestrian (V2P) and Vehicle to Network (V2N), all of which are referred to as Vehicle to Everything (V2X). 5G has dominated the vehicular network and most of the upcoming research is motivated towards the fully functional utilization of 5G-V2X. Despite that, credential management and edge-initiated security are yet to be resolved under 5G-V2X. To further understand the issue, this paper presents security management as a principle of sustainability and key-management. The performance tradeoff is evaluated with the key-updates required to maintain a secure connection between the vehicles and the 5G-terminals. The proposed approach aims at the utilization of high-speed mmWave-based backhaul for enhancing the security operations between the core and the sub-divided functions at the edge of the network through a dual security management framework. The evaluations are conducted using numerical simulations, which help to understand the impact on the sustainability of connections as well as identification of the fail-safe points for secure and fast operations. Furthermore, the evaluations help to follow the multiple tradeoffs of security and performance based on the metrics like mandatory key updates, the range of operations and the probability of connectivity.

• Journal of the Chungcheong Mathematical Society
• /
• v.21 no.1
• /
• pp.139-146
• /
• 2008

We investigate the uniqueness and multiplicity of solutions for the nonlinear elliptic system with Dirichlet boundary condition $$\{-{\Delta}u+g_1(u,v)=f_1(x){\text{ in }}{\Omega},\\-{\Delta}v+g_2(u,v)=f_2(x){\text{ in }}{\Omega},$$ where ${\Omega}$ is a bounded set in $R^n$ with smooth boundary ${\partial}{\Omega}$. Here $g_1$, $g_2$ are nonlinear functions of u, v and $f_1$, $f_2$ are source terms.

• Kyungpook Mathematical Journal
• /
• v.63 no.1
• /
• pp.123-129
• /
• 2023

For an ordered set W = {w₁, w₂, . . . , w_k} of vertices and a vertex v in a connected graph G, the k-vector r(v|W) = (d(v, w₁), d(v, w₂), . . . , d(v, w_k)) is called the metric representation of v with respect to W, where d(x, y) is the distance between the vertices x and y. A set W is called a resolving set for G if distinct vertices of G have distinct metric representations with respect to W. The minimum cardinality of a resolving set for G is its metric dimension dim(G), and a resolving set of minimum cardinality is a basis of G. The corona product, G ⊙ H of graphs G and H is obtained by taking one copy of G and n(G) copies of H, and by joining each vertex of the ith copy of H to the ith vertex of G. In this paper, we obtain bounds for dim(G ⊙ K₁), characterize all graphs G with dim(G ⊙ K₁) = dim(G), and prove that dim(G ⊙ K₁) = n - 1 if and only if G is the complete graph K_n or the star graph K_1,n-1.

• 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.