• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.3
• /
• pp.318-325
• /
• 2010

In this study, the wrapper database description language and model is suggested to collect product reviews from Korean shopping malls with multi-layer structures and are built in a variety of web languages. Above all, the wrapper based web crawlers have the website structure information to bring the exact desired data. The previously suggested wrapper based web crawler can collect HTML documents and the hierarchical structure of the target documents were only 2-3 layers. However, the Korean shopping malls in the study consist of not only HTML documents but also of various web language (JavaScript, Flash, and AJAX), and have a 5-layer hierarchical structure. A web crawler should have information about the review pages in order to visit the pages without visiting any non-review pages. The proposed wrapper contains the location information of review pages. We also propose a language grammar used in describing the location information.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.2
• /
• pp.234-243
• /
• 2000

We design a modified network architecture with condsidering current Internet network model and traffic characteristics, and propose EDCBT(Enhanced Dispersed Core-based Tree) multicast routing protocol, which enhances scalabity, reliability, end-to-end delay and resource utilization EDBCT adopts bidirectional dispersed shared trees and manages both of intradomain and interdomain multicast trees for a multicast group. Each regional multicast tree is estabilshed from its core router and they are interconnected by the operation between border routers on edges of each regional network. As a result, interdomain multicast tree can be easily established. We introduce a new concept named RBTS(Region-based Tree Switching), which dramatically enhances QoS and network utilization. Finally, protocol performance and the effect of core router location are evaluated with MIL3 OPNet network simulator, in terms of end-to-end delay, packet loss and throughput.

• Journal of the Korea Society of Computer and Information
• /
• v.29 no.6
• /
• pp.113-120
• /
• 2024

With the advancement of information and communication technology, we can easily generate various forms of data in our daily lives. To efficiently manage such a large amount of data, systematic classification into categories is essential. For effective search and navigation, data is organized into a tree-like hierarchical structure known as a category tree, which is commonly seen in news websites and Wikipedia. As a result, various techniques have been proposed to classify large volumes of documents into the terminal nodes of category trees. However, document classification methods using category trees face a problem: as the height of the tree increases, the number of terminal nodes multiplies exponentially, which increases the probability of misclassification and ultimately leads to a reduction in classification accuracy. Therefore, in this paper, we propose a new node expansion-based classification algorithm that satisfies the classification accuracy required by the application, while enabling detailed categorization. The proposed method uses a greedy approach to prioritize the expansion of nodes with high classification accuracy, thereby maximizing the overall classification accuracy of the category tree. Experimental results on real data show that the proposed technique provides improved performance over naive methods.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06b
• /
• pp.489-491
• /
• 2012

본 논문은 교육용 서비스로 이용 가능한 카드 인식 시스템을 제안한다. 사용자는 자유자재로 카드 등록 및 삭제가 가능하며 카드의 회전 및 크기 변화에도 강건한 인식을 보인다. 본 논문에서는 카드 템플릿의 형태 정보와 Histogram of Oriented Gradients를 특징점으로 이용한다. 또한 최종 분류기에서 계층적인 구조를 적용하여 보다 정확한 카드 검출 및 인식을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.523-525
• /
• 1998

웨이브렛 변환을 사용한 영상은 인간의 시각체계(HVS)에 적적한 양자화 및 부호화를 위한 계층적 구조를 제공한다. 인간의 시각이 민감하게 감지하는 부분을 더 정확하게 부호화 하고, 그렇지 못한 부분에서는 적절한 정보의 손실을 허용하는 원리를 이상적으로 적용할 수 있다. 이런 웨이브렛 변환영상의 통계적 특성을 이용한 제로트리 부호화 기법은 중요한 영상계수를 선별하여 영상전체에서 의미있는 계수를 순서대로 부호화 함으로써 매입 파일(Embeded File)을 생성한다. 본 연구에서는 제로트리 부호화 과정중 불확실 구간(Uncertainty Interval)에서 발생하는 오차(Error)를 줄이기 위하여 LBG(Line Bute Gray) 알고리즘을 도입하여 최적의 오차 코드북을 생성한 후 복원시 사용함으로써 결과의 향상을 보였다. 오차교정(Error Correction)은 EZW(Embeded Zerotee Wavelet) 부호화 과정에서 손실되기 쉬운 고주파수 밴드에 적용하여 복원시 영상의 자세한(detail) 성분을 살리는데 효과적이다. JPEG과 같은 DCT 기반 영상압축 결과에 비하여 화질에서 더 좋은 성능을 보일뿐아니라, DCT 특유의 블록화 현상도 제거되었다.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.19 no.8
• /
• pp.138-143
• /
• 2005

A hierarchical tree structure of clusters has advantages for the network design due to its scalability and simple routing protocol. In this paper, the cluster tree routing protocol is studied for the wireless sensor network. From the numerical analysis results, the data aggregation in the intermediate nodes reduces the number of communication message and saves the energy of sensor nodes, but it may result in increased data traffic latency. And also the selection of cluster head can increase the relaying hops very high.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.647-654
• /
• 2003

The replication of data is used to increase its availability and to improve the performance of a system. The distributed database system has to maintain both the database consistency and the replica consistency. This paper proposes an algorithm which resolves the conflict of the operations by using the mechanism based on the structure that the replicas of each data item are hierarchically organized. Each update is propagated along the tree based on the fact that the root of each data item is the primary replica in partially replicated databases. The use of a hierarchy of data may eliminate useless propagation since the propagation can be done only to sites having the replicas. In consequence, the propagation delay of updates may be reduced. By using the timestamp and a compensating transaction, our algorithm resolves the non-serializability problem caused by the conflict of operations that can happen on the way of the update propagation due to the lazy propagation. This resolution also guarantees the data consistency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3B
• /
• pp.517-525
• /
• 2010

The IPTV Service provides various interactive services beyond the level of being able to substitute cable TV. The IPTV system is to be decentralized gradually in which one server conducts all tasks. Primarily, deliberation of media needs to be changed into a system in which relayer and peer from the central server is utilized. Secondarily, the way of controling IPTV network need to be decentralized. Unlike the current client-server system, P2P(Peer To Peer), the main technology of decentralized IPTV is able to provide a service by cooperation of each node. Dealing with live streaming IPTV system which is based on the P2P protocol, this paper design the pure P2P IPTV structure and does verify the performance of P2P IPTV structure by realizing real system.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.2
• /
• pp.100-105
• /
• 2009

In this paper, we Propose a browsing system to reduce the contents retrieval time in the personalized broadcasting system. For this purpose, we add a subgenre table between Classification DS and Summarization DS of MPEG-7 MDS. The subgenre includes a subgenre list to shorten the searching time of contents which we want to find. In addition we divide metadata into event and object using Summarization DS of the MPEG-7 MDS. In this way, the hierarchical browsing of broadcasting contents is made possible. This structure may reduce the complexity of search by storing event and object separately. Our simulation results show that the search time of the proposed system is shorter than that of the previous works.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.171-178
• /
• 2007

In mobile ad hoc networks, an application scenario requires mostly group mobility behavior in the mix of group moving nodes and individually moving nodes. The nodes of those applications tend to belong to the movement group with similar movement behavior. Group mobility is one of the good methods to improve scalability, and reduces the protocol overhead. In this paper, we propose the multicast architecture which regards nodes that have equal group mobility in the heterogeneous group mobility network as the single entity with the multiple interfaces and composes multicast tree, The logical cooperative entity-based multicast architecture accommodates the scalability, the multicast tree simplification, and the protocol overhead reduction which arc obtained from the hierarchical multicast architecture, while it maintains the nat multicast architecture for the data transmission. It also prevents the concentration of the energy consumption dispersing data forwarding load into the several ingress/egress nodes. Results obtained through simulations show that logical cooperative entity based multicast protocol with multiple interfaces offers the protocol scalability and the efficient data transmission.