• Journal of Information Processing Systems
• /
• v.16 no.4
• /
• pp.820-831
• /
• 2020

Extractive document summarization aims to select a few sentences while preserving its main information on a given document, but the current extractive methods do not consider the sentence-information repeat problem especially for news document summarization. In view of the importance and redundancy of news text information, in this paper, we propose a neural extractive summarization approach with joint sentence semantic clipping and selection, which can effectively solve the problem of news text summary sentence repetition. Specifically, a hierarchical selective encoding network is constructed for both sentence-level and document-level document representations, and data containing important information is extracted on news text; a sentence extractor strategy is then adopted for joint scoring and redundant information clipping. This way, our model strikes a balance between important information extraction and redundant information filtering. Experimental results on both CNN/Daily Mail dataset and Court Public Opinion News dataset we built are presented to show the effectiveness of our proposed approach in terms of ROUGE metrics, especially for redundant information filtering.

• ETRI Journal
• /
• v.44 no.2
• /
• pp.346-354
• /
• 2022

The SYN flooding attack is widely used in cyber attacks because it paralyzes the network by causing the system and bandwidth resources to be exhausted. This paper proposed a self-information approach for detecting the SYN flooding attack and provided a detection algorithm with a hierarchical policy on a detection time domain. Compared with other detection methods of entropy measurement, the proposed approach is more efficient in detecting the SYN flooding attack, providing low misjudgment, hierarchical detection policy, and low time complexity. Furthermore, we proposed a detection algorithm with limiting system resources. Thus, the time complexity of our approach is only (log n) with lower time complexity and misjudgment rate than other approaches. Therefore, the approach can detect the denial-of-service/distributed denial-of-service attacks and prevent SYN flooding attacks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11B
• /
• pp.987-996
• /
• 2006

In NEMO scenarios, mobile node's variety of movements and mobile router's point of attachment changes can result in handover. This handover process needs additional time to finish due to the multiple levels of indirection involved in NEMO. And the performance issues of mobile node's handover such as handover delay and packet loss in above cases haven't been studied thoroughly. So, in this paper, we define fast handover failure cases in hierarchical mobile IPv6 network based NEMO. We briefly described NEMO architecture and handover procedures of FMIPv6 and HMIPv6. And then, we classified mobile node or mobile router's movement pattern into several scenarios. Analysis for the fast handover classified NEMO scenarios, in terms of handover latency and packet delivery cost have been performed.

• Journal of Korean Society of Transportation
• /
• v.23 no.8 s.86
• /
• pp.163-170
• /
• 2005

The paper has developed a methodology of calculating accessibility in bus network by using a space syntax technique. The purpose is an effective analysis of accessibility improvement before and after Seoul bus reorganization. Space syntax methodology has an advantage to calculate easily network connectivity and accessibility. However, it also has a weakness not to consider the distance and travel time for calculating accessibility. As a result, we have developed a hybrid of the space syntax methodology and the travel time measures. This method has been applied to evaluate the accessibility before and after the hierarchical bus systems introduced in Kangnam area of Seoul.

• Journal of KIISE:Information Networking
• /
• v.37 no.1
• /
• pp.8-15
• /
• 2010

In this study, we present an extended complex event model by considering both of the complex event and the aspect-oriented programming. We propose an advanced scheme for the event specification suited for the event correlation based network management systems by merging these two models. Specifically, we extend the model to support hierarchical event structures and let the model recognize point-cuts of aspect-oriented programming as events. We provide the event operators designed to specify the events on instances and handle temporal relations of the instances. Lastly, we compare the proposed model with other event models and present the benefits of it.

• Journal of KIISE:Software and Applications
• /
• v.36 no.12
• /
• pp.1028-1033
• /
• 2009

This paper presents a real-time hand gesture recognition approach for controlling a computer. We define hand gestures as continuous hand postures and their movements for easy expression of various gestures and propose a Two-layered Bayesian Network (TBN) to recognize those gestures. The proposed method can compensate an incorrectly recognized hand posture and its location via the preceding and following information. In order to vertify the usefulness of the proposed method, we implemented a Virtual Mouse interface, the gesture-based interface of a physical mouse device. In experiments, the proposed method showed a recognition rate of 94.8% and 88.1% for a simple and cluttered background, respectively. This outperforms the previous HMM-based method, which had results of 92.4% and 83.3%, respectively, under the same conditions.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.895-904
• /
• 2004

Due to the frequent and unpredictable topology changes, multicast still remains as challenge and no one-size-fits-all protocol could serve all kinds of needs in mobile ad hoc network. In this paper, we propose a novel scheme of Hierarchical Eulerian Ring Oriented Multicast Architecture (HEROMA) over mobile ad hoc network. It has features that concentrate on efficiency and robustness simultaneously. It is also an application-driven proposal for hazard detection. Architectures including Eulerian ring, hierarchy and multicast agent are investigated in detail Simulation results different level of improvements on control traffic, end-to-end delay and packet delivery ratio by comparing with tree-based and mesh-based multicast protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.6
• /
• pp.516-525
• /
• 1990

This paper proposes a hierarchical control algorithm for an efficient network management of a loosely-coupled system which consists of functional division and duplicating structure with a LAN to enhance reliability and availability. The algorithm is modeled using the Perti-net and verified with the reachability tree. Here, the proposed algorithm is compared with the purely centralized control algorithm and distributed control algorithm in terms of message traffic for the network management. The result shows that the message traffic related to system performance is as low as centralized control algorithm and the system availability is independent of a specific processor failure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10B
• /
• pp.1690-1700
• /
• 2000

Connection management function of the TINA which is developed by TINA-C provides network connection services such as setup modification and release of connections. The connection management function provides these services to network operators to the fault management function that provides backup-path and to the performance management function that provides load-balancing. The connection management function necessarily requires a routing algorithm to set up a new connection. In this paper we propose a new routing algorithm named QTHR (QoS and Traffic parameter based Hierarchical Routing) for TINA based connection management of ATM/B-ISDN network. And we implemented the QTHR and analyzed the performance of the QTHR.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.428-437
• /
• 2007

Along with the development of network, more and more functions and services are required by users, while traditional network fails to support all of them. Although overlay is a good solution to some demands, using them in an efficient, scalable way is still a problem. This paper puts forward a framework on how to construct an efficient, scalable overlay mesh in real network. Main differences between other overlays and ours are that our overlay mesh processes some nice features including class-of-service(CoS) and traffic engineering(TE). It embeds the end-to-end optimal traffic control law which can distribute traffic in an optimal way. Then, an example is given for better understanding the framework. Particularly, besides good scalability, and failure recovery, it possesses other characteristics such as routing simplicity, self-organization, etc. In such an overlay mesh, an applicable source routing scheme called hierarchical source routing is used to transmit data packet based on UDP protocol. Finally, a guideline derived from a number of simulations is proposed on how to set various parameters in this overlay mesh, which makes the overlay more efficient.