• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.913-923
• /
• 2012

The Odd-Even graceful labeling of a graph G with $q$ edges means that there is an injection $f:V (G)$ to $\{1,3,5,{\cdots},2q+1\}$ such that, when each edge $uv$ is assigned the label ${\mid}f(u)-f(v){\mid}$, the resulting edge labels are $\{2,4,6,{\cdots},2q\}$. A graph which admits an odd-even graceful labeling is called an odd-even graceful graph. In this paper, we prove that some well known graphs namely $P_n$, $P_n^+$, $K_{1,n}$, $K_{1,2,n}$, $K_{m,n}$, $B_{m,n}$ are Odd-Even graceful.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.202-203
• /
• 2009

In this paper, system divide into the edge extraction, labeling, clustering, and South Korea's traditional color combination and identifying to identify Korea's traditional colors. Edge is extracted using Canny operator. And given the label, and clustering to ensure the quality of the cluster. Finally, we identify color harmony by organizing and comparing primary color with secondary color configuration table Korea traditional color.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.11a
• /
• pp.1247-1249
• /
• 2023

스마트 컨트랙트는 블록체인 상에서 실행되는 프로그램으로 복잡한 비즈니스 논리를 처리할 수 있다. 그러나 블록체인의 무결성과 조건에 따라 실행되는 특성을 이용한 악의적 사용으로 인하여 블록체인 보안에서 시급한 문제가 되고있다. 따라서 스마트 컨트랙트 취약성 탐지문제는 최근 많은 연구가 이루어지고 있다. 그러나 기존 연구의 대부분이 단일 유형의 취약성 여부에 대한 탐지에만 초점이 맞춰져 있어 여러 유형의 취약성에 대한 동시 식별이 어렵다. 이 문제를 해결하고자 본 연구에서는 스마트 컨트랙트 소스코드 제어 흐름 그래프를 기반으로 그래프의 forward edge와 backward edge를 고려한 신경망으로 그래프 구조를 학습한 후 그래프 multi-label classification을 진행하여 다중 취약성을 탐지할 수 있는 모델을 제안한다.

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

Let G = (V (G), E(G)) be a graph and let g : V (G) → S3 be a function. For each edge xy assign the label r where r is the remainder when o(g(x)) is divided by o(g(y)) or o(g(y)) is divided by o(g(x)) according as o(g(x)) ≥ o(g(y)) or o(g(y)) ≥ o(g(x)). The function g is called a group S3 cordial remainder labeling of G if |vg(i)-vg(j)| ≤ 1 and |eg(1)-eg(0)| ≤ 1, where vg(j) denotes the number of vertices labeled with j and eg(i) denotes the number of edges labeled with i (i = 0, 1). A graph G which admits a group S3 cordial remainder labeling is called a group S3 cordial remainder graph. In this paper, we prove that square of the path, duplication of a vertex by a new edge in path and cycle graphs, duplication of an edge by a new vertex in path and cycle graphs and total graph of cycle and path graphs admit a group S3 cordial remainder labeling.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.4
• /
• pp.447-454
• /
• 2003

The forwarding enging, which handles the incoming frames and forwards them to the appropriate outgoing interface, is the crucial factor of the router´s performance. As the MPLS label edge router provides the facility that it is capable of interworking with various kinds of networks, the forwarding engine should have the flexibility processing the corresponding types of frames from such network interfaces. In order to support the flexibility, we implement the forwarding engine for the MPLS LER with ATM interfaces based on the programmable Ethernet packet processor. By exploiting instinct loop-back functionality of Ethernet packet processor, our forwarding engine handles and forwards the frames from/to ATM interfaces. The performance of our forwarding engine is evaluated by experiments on the effect of looping frames back and the number of Ethernet packet processor´s instructions.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.2
• /
• pp.140-146
• /
• 1989

An efficient quantization and encoding of BTC (Block Truncation Coding) parameters {($Y_{\alpha},\;Y_{\beta}),\;P_{{\beta}/{\beta}}$} are investigated, In our algorithm 4${\times}$4 blocks are classified into flat or edge block. While edge block is represented by two approximation level $Y_{\alpha},\;Y_{\beta}$ with label plane $P_{{\beta}/{\beta}}$, flat block is represented by single approximation level Y. The approximation levels Y, $Y_{\alpha}$ and $Y_{\beta}$ are encoded by predictive quatization specially designed, and the label plane $P_{{\beta}/{\beta}}$ is tried to be encoded using stored 32 reference plantes. The performance of the proposed scheme has appeared comparable to much more complex transform coding in terms of SNR, although it requires more study on the representation of small slope in background.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10B
• /
• pp.927-937
• /
• 2003

Network based VPN(Virtual Private Network) using MPLS(Multiprotocol Label Switching) technology is regarded as a good solution for intranets or extranets because of the low cost and the flexibility of the service provision. In this paper, we describea mechanism that allows the VPN users to move from one site to another site of the VPN network based on the BGP-E MPLS technology. This mechanism is designed for and implemented on PE(Provider Edge) routers of the backbone network. PE routers connected to the VPN sites establish a new MPLS path to the mobile node after they detect movement of the mobile VPN node. The new location may belong to the same VPN or to different VPN. We designed VPN management and control functions of the PE routers in order to interface with the Mobile IP protocol. The pilot implementation and performance measurement were carried out on a testbed.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.31-39
• /
• 2002

The VPN(Virtual Private Network) is a private network constructed logically on a public network infrastructure. There have been numerous studies to support the VPN services by using different technologies such as IP in IP, GRE, L2TP, MPLS and so on. Among these technologies, MPLS has shown many merits in aspects of QoS, security, and management, compared with other technologies. As an enhancement of the VPN that is controlled by MPLS PE(Provider Edge) routers, this paper presents the VPN controlled by MPLS CE(Customer Edge) routers. The functional architecture of the CE based VPN and operations of the CE routers are described along with the performance comparison of CE based MPLS VPN. It has been shown that the CE based VPN has more advantages than PE based VPN with respect to independency, scalability, security, and complexity.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.7
• /
• pp.1-11
• /
• 2002

This paper proposes that an efficient routing entry sending method between routing controller FE. based on this method, we organize IP VPN support method based on MPLS network and design MPLS-VPN service control module, MPLS-VPN processing, VPN group configuration and LSP setup processing. We evaluate the performance about the VPN based on proposed MPLS, at the result of evaluation. We figure out that based on proposed IPC method, lost packets number reduces and delay increases more slowly in case of VPN based on MPLS comparing with the VPN based on ATM which has rapid delay increasement. Therefore we confirm that the VPN based on MPLS has high speed of packet processing and high utilization of buffers through the performance evaluation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.235-245
• /
• 2005

In this paper, a simplified QoS model of MPLS-based backbone network. Conventional scheme proposed by IETF(IETF schem) is to embed a DiffServ model in MPLS network. However, this approach results in overall upgrade of MPLS system and so it is difficult to deploy this approach. Our proposed model, however, uses a Vidual Link which is a set of Label Switched Path(LSP) connected from an Ingress Label Edge Router(LER) to an Egress LER. In this model, Per-Hop-Behavior(PHB) is implemented only at each LSP in ingress LER and Core Label Switch Routers(LSRs) just guarantee each LSP's bandwidth, not service. This bandwidth guarantee service is fully provided by legacy MPLS model. Also we propose flow allocation mechanism and the flow distribution among LSPs of the virtual link by the flow according to the network status. To evaluate the simplified approach, the characteristics of the approach are compared logically with these of IETF's one through simulations.