• Annual Conference on Human and Language Technology
• /
• 2023.10a
• /
• pp.415-418
• /
• 2023

테이블 데이터는 일반적으로 헤더와 데이터로 구성되며, 헤더는 데이터의 구조와 내용을 이해하는데 중요한 역할을 한다. 하지만 웹 스크래핑 등을 통해 얻은 데이터와 같이 다양한 상황에서 헤더 정보가 누락될 수 있다. 수동으로 헤더를 생성하는 것은 시간이 많이 걸리고 비효율적이기 때문에, 본 논문에서는 자동으로 헤더를 생성하는 태스크를 정의하고 이를 해결하기 위한 모델을 제안한다. 이 모델은 BART를 기반으로 각 열을 구성하는 텍스트와 열 간의 관계를 분석하여 헤더 텍스트를 생성한다. 이 과정을 통해 테이블 데이터의 구성요소 간의 관계에 대해 이해하고, 테이블 데이터의 헤더를 생성하여 다양한 애플리케이션에서의 활용할 수 있다. 실험을 통해 그 성능을 평가한 결과, 테이블 구조 정보를 종합적으로 활용하는 것이 더 높은 성능을 보임을 확인하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.5
• /
• pp.837-842
• /
• 2008

Any errors that are generated in the channels and networks distort the video quality and are propagated in both the spatial and temporal domains. In particular, header errors ran result in serious visual degradation of the output video encoding/decoding schemes that can make an error resilient compressed bit-stream in error prone environments, such as mobile networks. In this paper, we proposes an header error resilience method that consider the activity of macroblock in video bitstream syntex. The extract of header error repaetedly embeds the header parameters into the least significant bits(LSB) of the quantized DCT coefficients prior to VLC. Experimental results show that the proposed error resilience method restores good image quality despite the detected error on header parameters.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.649-652
• /
• 2010

무선 센서 네트워크에서 클러스터링 기법은 데이터 병합을 통해 통신 대역폭 사용을 용이하게 하며, 센서 노드들간의 송수신 전력 소비를 줄일 수 있고, 노드 증가에 따른 네트워크 확장성이 용이하므로 현재 많은 연구가 되고 있다. 클러스터링 기법은 클러스터 헤더를 선출하는 것으로부터 시작된다. 기존의 클러스터 헤더 선출 기법들은 에너지 잔여량, 센서 노드의 위치, 센서 노드들의 평균 에너지 등을 클러스터 헤더 선출값으로 하여 클러스터 헤더를 선정한다. 그러나 이 기법들은 악의 적인 노드가 다른 노드의 클러스터 헤더 선출값을 변경하고, 자신의 클러스터 헤더 선출값을 증가시켜 클러스터 헤더가 될 수 있는 보안 취약점을 가지고 있다. 이와 같은 보안 취약점을 개선하기 위해 클러스터 헤더 선출값에 대한 무결성과 클러스터 헤더 선출값을 전송하는 노드의 인증이 필요하다. 본 논문에서는 one-way key chain 기법을 사용하는 안전한 클러스터 헤더 선출 기법을 제안하고, 제안한 기법에 대한 안전성을 분석한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1076-1085
• /
• 2004

Recently, the demands for real-time service and multimedia data are rapidly increasing. There are significant redundancies between header fields both within the same packet header and in consecutive packets belonging to the same packet stream. And there are many overheads in using the current UDP/IP protocol. Header compression is considered to enhance the transmission efficiency for the payload of small size. By sending the static field information only once initially and by utilizing dependencies and predictability for other fields, the header size can be significantly reduced for most packets. This work describes an implementation for header compression of the headers of IP/UDP protocols to reduce the overhead on Ethernet network. Typical UDP/IP Header packets can be compressed down to 7 bytes and the header compression system is designed and implemented in Linux environment. Using the Header compression system designed between a server and clients provides have the advantage of effective data throughput in network. Since the minimum packet size in Ethernet is 64 bytes, the amount of reduction by header compression in practical chatting environment was 6.6 bytes.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.10
• /
• pp.55-61
• /
• 2013

The important issue in header compression would be how to compress the dynamic field increasing constantly between consecutive packets in the head of IP wireless networks. Existent header compression scheme that can eliminated repeated field in header are RFC2507, RFC3095 and E-ROHC scheme. In this paper, I propose a new method of compressing TS fields, which are the Dynamic fields of the RTP packet, into BCB (Basic Compression Bits) basic bits or NCB (Negotiation Compression Bits, BCB + additional bits) bits. In order to verify the proposed header compression method, I have simulation about proposed video packets of IP wireless networks. using Visual SLAM.

• Journal of Internet Computing and Services
• /
• v.12 no.6
• /
• pp.19-33
• /
• 2011

The need for application traffic classification becomes important for the effective use of network resources. The header-based identification method uses the header signature {IP address, port number, transport layer protocol TCP/UDP)}extracted from Internet application server to overcome some limitations overhead, payload encryption, etc.) of previous methods. A lots signature is extracted because this method uses header information of server. So, we need a maintenance method to keep essential signatures. In this paper, we represent the signature maintenance method using properties of identified traffic and history of the signature. Also, we prove the feasibility and applicability of our proposed method by an acceptable experimental result.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.831-834
• /
• 2011

LEACH(One of the leading algorithms in the field of WSN) for the life of the system, even by the number of all nodes to ensure that the cluster header. However, each round does not guarantee a certain number of cluster header. So sometimes cluster header is elected of small number or not elected. If cluster header number is to small, takes a heavy load on cluster header. And empty cluster is occur depending on the location of the cluster header. The algorithm proposed in this paper, the area of interest is divided into sectors. And randomly, cluster header be elected one the in each sector. When clustering the sensor nodes will belong to the nearest cluster header. So clustering is independent of the sector. This algorithm is guarantee a certain number of cluster header in each round. And has prevent occurrence of empty cluster.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.704-711
• /
• 2003

Recently, the demands for real-time service and multimedia data are rapidly increasing. There are significant redundancies between header fields both within the same packet header and in consecutive packets belonging to the same packet stream. But there are many overheads in using the current UDP/IP protocol. Header compression is considered to enhance the transmission efficiency for small size of payload. By sending the static field information only once initially and by utilizing dependencies and predictability for other fields, the header size can be significantly reduced for most packets. This work describes an implementation for header compression of the headers of U/UDP protocols to reduce overhead on Ethernet network. Typical UDP/IP Header packets can be compressed down to 7 bytes and the header compression system is designed and implemented on the Linux environment. Using the designed Header compression system between a server and a client have the advantage of effective data throughput in network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1696-1702
• /
• 2005

Real Time Transport Protocol (RTP) is the Internet standard protocol for transport of real time data audio/video IP Telephony, Multimedia Seivece. In case of 8kbps voice codec, the size of packet per data is 20bytes and become more large to minimal 40bytes with adding each layer's header in RTP/UDP/IP. To solve this problem, various header compression skill were suggested on point-to-point networks. But it compress even IP header and cannot be suitable to apply to end-to-end network Thus, We will renew header compression protocol to apply wired router-based network.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.27-30
• /
• 2012

In the Cluster-Based Routing Protocol (CBRP) a cluster header in each cluster should be elected. The cluster headers consume energy much more than other nodes because they manage and operate all of mobile nodes in their cluster. The traditional CBRP elects a cluster header without considering the remaining electric energy of each node. So, there exists problems that the cluster header has short average lifetime, and another cluster header should be elected again frequently. In this paper, we propose the improved protocol which prolongs the lifetime of the cluster header, decreases of header re-elected problem, decreases of header re-elected problem and enhances the stability of the path. In order to achieve this, when a cluster header is elected in a cluster, the remaining electric energies of all the nodes are compared with one another, and the node with the highest energy is elected as the cluster header. Also, the node with the second highest energy is elected as the second header. If the elected cluster header is unable to perform the role of the cluster header because the remaining energy level goes low, it sends a beacon message to neighbor member nodes and the second header will serve as the cluster header.