-
[show abstract]
[hide abstract]
ABSTRACT: In recent years, graph-based models and ranking algorithms have drawn considerable attention from the extractive document
summarization community. Most existing approaches take into account sentence-level relations (e.g. sentence similarity) but
neglect the difference among documents and the influence of documents on sentences. In this paper, we present a novel document-sensitive
graph model that emphasizes the influence of global document set information on local sentence evaluation. By exploiting document–document
and document–sentence relations, we distinguish intra-document sentence relations from inter-document sentence relations.
In such a way, we move towards the goal of truly summarizing multiple documents rather than a single combined document. Based
on this model, we develop an iterative sentence ranking algorithm, namely DsR (Document-Sensitive Ranking). Automatic ROUGE
evaluations on the DUC data sets show that DsR outperforms previous graph-based models in both generic and query-oriented
summarization tasks.
KeywordsGraph-based summarization model-Graph-based ranking algorithm-Inter- and intra-document relation-Generic summarization-Query-oriented summarization
Knowledge and Information Systems 04/2012; 22(2):245-259. · 2.22 Impact Factor
-
[show abstract]
[hide abstract]
ABSTRACT: Sentence ranking is the issue of most concern in document summarization. In recent years, graph-based summarization models
and sentence ranking algorithms have drawn considerable attention from the extractive summarization community due to their
capability of recursively calculating sentence significance from the entire text graph that links sentences together rather
than relying on single sentence alone. However, when dealing with multi-document summarization, existing sentence ranking
algorithms often assemble a set of documents into one large file. The document dimension is ignored. In this work, we develop
two alternative models to integrate the document dimension into existing sentence ranking algorithms. They are the one-layer
(i.e. sentence layer) document-sensitive model and the two-layer (i.e. document and sentence layers) mutual reinforcement
model. While the former implicitly incorporates the document’s influence in sentence ranking, the latter explicitly formulates
the mutual reinforcement among sentence and document during ranking. The effectiveness of the proposed models and algorithms
are examined on the DUC query-oriented multi-document summarization data sets.
KeywordsQuery-oriented multi-document summarization–document-sensitive sentence ranking–mutual-reinforcement sentence ranking
04/2011: pages 655-678;
-
[show abstract]
[hide abstract]
ABSTRACT: This paper propose a method for sentence ordering in multi-document summarization task, which combine support vector machine (SVM) and Grey Model(GM). Firstly, the method train the SVM with sentences of source documents and predict sentences sequence of summary as primary dataset. Secondly, using Grey Model to process the primary dataset, and achieve the final sequence of summary sentences. Experiments on 100 summaries showed this method provide a much higher precision than probabilistic model in sentence ordering task.
Services Computing Conference (APSCC), 2010 IEEE Asia-Pacific; 01/2011
-
Mathematical and Computer Modelling. 01/2010; 51:985-994.
-
Third International Symposium on Intelligent Information Technology and Security Informatics, IITSI 2010, Jinggangshan, China, April 2-4, 2010; 01/2010
-
24th IEEE International Conference on Advanced Information Networking and Applications, AINA 2010, Perth, Australia, 20-13 April 2010; 01/2010
-
[show abstract]
[hide abstract]
ABSTRACT: In this paper, we discuss a method to improve the sentence ordering task in Chinese. The way we approach is based on the analysis of Markov model, which can train transition probability in raw corpus. We iteratively calculate the largest transition probability path in Markov model to confirm the correct order. The method avoids judging the first sentence, which could lead to an instable result in our early work. We also provide a way to evaluate the effect of experiments. Experimental results indicate that our method shows good results on accuracy, and significantly improves the readability and coherence of the article. The method could be used in various fields of Chinese text processing work and applications.
Fuzzy Systems and Knowledge Discovery, 2009. FSKD '09. Sixth International Conference on; 09/2009
-
[show abstract]
[hide abstract]
ABSTRACT: In this paper, we propose a method to analyze the logical order between adjacent sentences for sentence ordering in Chinese. Our approach to reorder sentences is based on term weighting, which estimates the transition probabilities in Markov model. We also provide a way to evaluate the effect of experiments. Experimental results indicate that the sequence of themes contained by sentences could be the clue to arrange sentences to coherent and readable order. The method can be used for varied field tasks of text processing in Chinese.
Information Technology and Computer Science, International Conference on. 07/2009; 1:448-451.
-
[show abstract]
[hide abstract]
ABSTRACT: In many cases, the values of qualitative QoS criteria are often imprecisely defined or acquired. Moreover, it is also not easy to accurately quantify the weight of each QoS criterion since human judgments including preference are often vague. In this paper, the decision making problem has been modeled as hybrid multiple criteria decision making (FMCDM). The linguistic QoS criteria is transformed to fuzzy numbers, and then we use COWA operator to turn interval numbers and fuzzy numbers into precise numbers. A optimization method with adjustability is proposed to seek subjective weight, then objective weight based on improved entropy model and subjective weight are integrated into synthetic weight linearly, the candidate services are ranking according to the membership of gray incidence degree. Finally, a numerical example is given to illustrate the developed method.
Electronic Commerce and Security, 2009. ISECS '09. Second International Symposium on; 06/2009
-
[show abstract]
[hide abstract]
ABSTRACT: Web services composition technology is promising technology to efficiently integrate heterogeneous, distributed and legacy software system. Performance becomes the key issue when Web services composition model complex and mission-critical application. The defect of design can result in the performance bottleneck problem in the running time. In this paper, we propose a simulation-based model for the business process defined by WS-BPEL. Our model takes advantage of general stochastic Petri Net to simulate the control flow and the transaction behavior of WS-BPEL through constructing the state transition space of composite Web service. Therefore, our simulation model can accurately obtain the performance prosperities with the smaller cost in contrast to building experimental system.
Electronic Commerce and Security, 2009. ISECS '09. Second International Symposium on; 06/2009
-
[show abstract]
[hide abstract]
ABSTRACT: LDoS (low-rate denial of service) attack is periodic, stealthy, and with high efficiency, which has become a great threat to the network security. Previous researches about LDoS attack mainly focus on its impact on wired networks. However, our analysis shows that such attack could also be launched in ad-hoc network, and as a completely distinct MAC layer protocol is adopted in this environment, the form and effect of the attack could be different and need re-evaluation. This paper presents a study of LDoS attack in ad-hoc network: (1) we investigate the differences of attack form brought by the medium reservation mechanism and CSMA/CA of 802.11b, and find that decreasing the period of LDoS attack into a smaller time scale would achieve a higher attack efficiency; (2) we show that the attack effect differs from that in wired networks, and the attacker's location has an impact on it; (3) we verify our findings by simulation experiments in NS-2; (4) Detection and defense methods are explored to counter against such attack.
Wireless On-Demand Network Systems and Services, 2009. WONS 2009. Sixth International Conference on; 03/2009
-
[show abstract]
[hide abstract]
ABSTRACT: Recently, control and coordination of a set of autonomous mobile robots has been paid a lot of attentions, because the cooperation of simple robots offers several advantages, such as redundancy and flexibility, and allows performing hard tasks that could be impossible for one single robot. There are a lot of interesting applications of multiple robots, such as satellite exploration and surveillance missions. So far, there are many papers working on the coordination of mobile robots. The characteristic of simplicity of mobile robots brings potential wide applications; however this characteristic also lead to crash with higher probability during cooperation, especially in harsh environment. Surprisingly, only few researches consider the fault tolerance of mobile robots, especially for dynamic coordination application - robot flocking. In this paper, we summarize the existed flocking algorithms and discuss their characteristics. Then we briefly described our fault tolerant flocking algorithms in different models. Finally we proposed the potential future research directions for dynamic flocking of a group of mobile robots. In all, this work can provide a good reference for the researchers working on dynamic cooperation of agents in distributed system.
Consumer Communications and Networking Conference, 2009. CCNC 2009. 6th IEEE; 02/2009
-
[show abstract]
[hide abstract]
ABSTRACT: This paper provided MML (mobile agent based mobile service language) for ubiquitous computing. The aim of MML is to provide a kind of friendly and seamless mobile service language. It also states the semantics using formal method. Also MML brings forward the context awareness mechanism formobile service in ubiquitous computing.
Computer Science and Software Engineering, 2008 International Conference on; 01/2009
-
[show abstract]
[hide abstract]
ABSTRACT: Web Services can be composed to build domain-specific application and solution. Some Web Services Composition (WSC) standards are proposed, for instance, WS-BPEL and WS-CDL. WS-BPEL consists of basic activity, structured activity and control-flow. It uses control-flow to construct sequence, branching, parallelism, synchronization, etc. This paper proposes an approach to formally analyze transaction behavior in WS-BPEL through General Stochastic High-level Petri Net (GSHLPN). Unlike other approaches based on Petri Net, our approach can simulate the interrupt behavior resulted from the trigger of failure and user exception operation in WS-BPEL, and accurately compute the time of process, whereas other approaches can not effectively do so.
Computer Science and Software Engineering, 2008 International Conference on; 01/2009
-
Proceedings IEEE CSE'09, 12th IEEE International Conference on Computational Science and Engineering, August 29-31, 2009, Vancouver, BC, Canada; 01/2009
-
ACL 2009, Proceedings of the 47th Annual Meeting of the Association for Computational Linguistics and the 4th International Joint Conference on Natural Language Processing of the AFNLP, 2-7 August 2009, Singapore, Short Papers; 01/2009
-
Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, November 2-6, 2009; 01/2009
-
23rd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2009, Rome, Italy, May 23-29, 2009; 01/2009
-
JASIST. 01/2009; 60:2119-2131.
-
Computer Processing of Oriental Languages. Language Technology for the Knowledge-based Economy, 22nd International Conference, ICCPOL 2009, Hong Kong, March 26-27, 2009. Proceedings; 01/2009
