Multi-documents summarization is an important research area of NLP. Most methods or techniques of multidocument summarization either consider the documents collection as single-topic or treat every sentence as single-topic only, but lack of a systematic analysis of the subtopic semantics hiding inside the documents. This paper presents a Subtopic-based Multi-documents Summarization (SubTMS) method. It adopts probabilistic topic model to discover the subtopic information inside every sentence and uses a suitable hierarchical subtopic structure to describe both the whole documents collection and all sentences in it. With the sentences represented as subtopic vectors, it assesses the semantic distances of sentences from the documents collection’s main subtopics and chooses sentences which have short distance as the final summary of the documents collection. In the experiments on DUC 2007 dataset, we have found that: when training a topic’s documents collection with some other topics’ documents collections as background knowledge, our approach can achieve fairly better ROUGE scores compared to other peer systems.
{"title":"Subtopic-based Multi-documents Summarization","authors":"Shu Gong, Y. Qu, Shengfeng Tian","doi":"10.1109/CSO.2010.239","DOIUrl":"https://doi.org/10.1109/CSO.2010.239","url":null,"abstract":"Multi-documents summarization is an important research area of NLP. Most methods or techniques of multidocument summarization either consider the documents collection as single-topic or treat every sentence as single-topic only, but lack of a systematic analysis of the subtopic semantics hiding inside the documents. This paper presents a Subtopic-based Multi-documents Summarization (SubTMS) method. It adopts probabilistic topic model to discover the subtopic information inside every sentence and uses a suitable hierarchical subtopic structure to describe both the whole documents collection and all sentences in it. With the sentences represented as subtopic vectors, it assesses the semantic distances of sentences from the documents collection’s main subtopics and chooses sentences which have short distance as the final summary of the documents collection. In the experiments on DUC 2007 dataset, we have found that: when training a topic’s documents collection with some other topics’ documents collections as background knowledge, our approach can achieve fairly better ROUGE scores compared to other peer systems.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132217874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The non destructive testing system of the reinforcement corrosion is employed to observe the temperature on the concrete surface. This system is useful in case that the position of the corrosion region is investigated. However, the shape of the reinforcement corrosion can not be numerically measured, even if this system is applied. Therefore, we develop the numerical shape estimation system of the reinforcement corrosion in the concrete using the temperature on the concrete surface observed by the non destructive testing system. In addition, if the corrosion partially occurs on the reinforcement bar in the concrete, it is necessary to examine the shape of the reinforcement corrosion by using the 3D model. Therefore, the numerical shape estimation system of the reinforcement corrosion is developed for the 3D model, and the results of the numerical experiment are shown in this paper.
{"title":"Evaluation of 3D Reinforcement Corrosion Shape in Concrete Based on Observed Temperature on Concrete Surface","authors":"T. Kurahashi, H. Oshita","doi":"10.1109/CSO.2010.43","DOIUrl":"https://doi.org/10.1109/CSO.2010.43","url":null,"abstract":"The non destructive testing system of the reinforcement corrosion is employed to observe the temperature on the concrete surface. This system is useful in case that the position of the corrosion region is investigated. However, the shape of the reinforcement corrosion can not be numerically measured, even if this system is applied. Therefore, we develop the numerical shape estimation system of the reinforcement corrosion in the concrete using the temperature on the concrete surface observed by the non destructive testing system. In addition, if the corrosion partially occurs on the reinforcement bar in the concrete, it is necessary to examine the shape of the reinforcement corrosion by using the 3D model. Therefore, the numerical shape estimation system of the reinforcement corrosion is developed for the 3D model, and the results of the numerical experiment are shown in this paper.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131620160","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A class of fractional semi-infinite programming is concerned; a new class of generalized convex function called Fε-G Convex function and related nonconvex functions are defined, which generalize some of the present convex functions. In the framework of the new concept, some interesting sufficient conditions of ε-optimality solutions are derived for the programming. These results obtained not only extend some of the present researches, but also can be apply to the questions occur in resource allocation, stock cutting problem in paper industry, agricultural planning and portfolio selection etc. Theoretically, they are helpful to studying fractional semiinfinite programming.
{"title":"Epsilon-Optimality Conditions for a Class of F epsilon-G Convex Fractional Semi-infinite Programming","authors":"Yong Yang","doi":"10.1109/CSO.2010.215","DOIUrl":"https://doi.org/10.1109/CSO.2010.215","url":null,"abstract":"A class of fractional semi-infinite programming is concerned; a new class of generalized convex function called Fε-G Convex function and related nonconvex functions are defined, which generalize some of the present convex functions. In the framework of the new concept, some interesting sufficient conditions of ε-optimality solutions are derived for the programming. These results obtained not only extend some of the present researches, but also can be apply to the questions occur in resource allocation, stock cutting problem in paper industry, agricultural planning and portfolio selection etc. Theoretically, they are helpful to studying fractional semiinfinite programming.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132973123","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we develop an option valuation model in the context of a discrete-time multivariate Markov chain model using the Esscher transform. The multivariate Markov chain provides a flexible way to incorporate the dependency of the underlying asset price processes and price multi-state options written on several dependent underlying assets. In our model, the price of an individual asset can take finitely many values. The market described by our model is incomplete in general, hence there are more than one equivalent martingale pricing measures. We adopt conditional Esscher transform to determine an equivalent martingale measure for option valuation. We also document consequences for option prices of the dependency of the underlying asset prices described by the multivariate Markov chain model.
{"title":"Option Valuation under a Multivariate Markov Chain Model","authors":"Na Song, W. Ching, T. Siu, E. Fung, M. Ng","doi":"10.1109/CSO.2010.73","DOIUrl":"https://doi.org/10.1109/CSO.2010.73","url":null,"abstract":"In this paper, we develop an option valuation model in the context of a discrete-time multivariate Markov chain model using the Esscher transform. The multivariate Markov chain provides a flexible way to incorporate the dependency of the underlying asset price processes and price multi-state options written on several dependent underlying assets. In our model, the price of an individual asset can take finitely many values. The market described by our model is incomplete in general, hence there are more than one equivalent martingale pricing measures. We adopt conditional Esscher transform to determine an equivalent martingale measure for option valuation. We also document consequences for option prices of the dependency of the underlying asset prices described by the multivariate Markov chain model.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116506484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Tao Xu, H. Kai, Fei Cheng, Guikai Guo, Tatsuo Yoshino
A new method for structural static reanalysis of topological modifications with Added Degrees of Freedom is presented. The proposed procedure is easy to implement and suit for the case of modifications with the number of DOFs is increased. According to the analysis result of original system, the suitable preconditioner is selected and the response of modified structure is gained by Lanczos algorithm. Both the present method and the Lanczos algorithm without preconditioning are applied to numerical example, respectively. The Convergence of the two methods are compared. The computational cost is significantly reduced by the proposed method. The numerical results show the exactitude and effectiveness of the reanalysis algorithm.
{"title":"A New Static Reanalysis Method of Topological Modifications with Added Degrees of Freedom","authors":"Tao Xu, H. Kai, Fei Cheng, Guikai Guo, Tatsuo Yoshino","doi":"10.1109/CSO.2010.101","DOIUrl":"https://doi.org/10.1109/CSO.2010.101","url":null,"abstract":"A new method for structural static reanalysis of topological modifications with Added Degrees of Freedom is presented. The proposed procedure is easy to implement and suit for the case of modifications with the number of DOFs is increased. According to the analysis result of original system, the suitable preconditioner is selected and the response of modified structure is gained by Lanczos algorithm. Both the present method and the Lanczos algorithm without preconditioning are applied to numerical example, respectively. The Convergence of the two methods are compared. The computational cost is significantly reduced by the proposed method. The numerical results show the exactitude and effectiveness of the reanalysis algorithm.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115257558","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Conjugate gradient methods are widely used for large scale unconstrained optimization. A new class of conjugate gradient trust region method is proposed, in which trust egion technique is used for guaranteeing the global convergence of the algorithm, and more utilizable information on conjugate gradient vectors is used for accelerating convergence of the algorithm. The global convergence, super linear convergence and quadratic convergence properties of the algorithm are proved under favorable conditions, respectively. Numerical experiments show that the new algorithm is robust and effective.
{"title":"A New Conjugate Gradient Trust Region Method and its Convergence","authors":"Yueting Yang, Wenyu Li, Jing Gao","doi":"10.1109/CSO.2010.86","DOIUrl":"https://doi.org/10.1109/CSO.2010.86","url":null,"abstract":"Conjugate gradient methods are widely used for large scale unconstrained optimization. A new class of conjugate gradient trust region method is proposed, in which trust egion technique is used for guaranteeing the global convergence of the algorithm, and more utilizable information on conjugate gradient vectors is used for accelerating convergence of the algorithm. The global convergence, super linear convergence and quadratic convergence properties of the algorithm are proved under favorable conditions, respectively. Numerical experiments show that the new algorithm is robust and effective.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123438107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we propose an algorithm for unconstrained optimization that employs both adaptive trust region techniques with line searchs. Unlike traditional adaptive trust region methods, our algorithm does not resolve the sub problem if the trial step isn’t accepted, but instead performs the Wolfe line search at each iteration. Under mild conditions, the global convergence is proved and the super linear convergence of the new algorithm is shown without the condition that the Hessian of the objective function at the solution be positive definite. Preliminary numerical results indicate that the performance of the new method is very efficient.
{"title":"A Self-Adaptive Trust Region Algorithm with Line Search Technique","authors":"Wenjuan Wu, Lanping Chen, B. Jiao","doi":"10.1109/CSO.2010.25","DOIUrl":"https://doi.org/10.1109/CSO.2010.25","url":null,"abstract":"In this paper, we propose an algorithm for unconstrained optimization that employs both adaptive trust region techniques with line searchs. Unlike traditional adaptive trust region methods, our algorithm does not resolve the sub problem if the trial step isn’t accepted, but instead performs the Wolfe line search at each iteration. Under mild conditions, the global convergence is proved and the super linear convergence of the new algorithm is shown without the condition that the Hessian of the objective function at the solution be positive definite. Preliminary numerical results indicate that the performance of the new method is very efficient.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123208426","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In this paper, we propose two synchronization algorithms and their implementations, each having O(n^2) and O(2^n) synchronization steps for n cells, respectively.
{"title":"A Note on Synchronization Steps in Firing Squad Synchronization Problem","authors":"Akira Nomura, Jean-Baptiste Yunès, H. Umeo","doi":"10.1109/CSO.2010.124","DOIUrl":"https://doi.org/10.1109/CSO.2010.124","url":null,"abstract":"The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In this paper, we propose two synchronization algorithms and their implementations, each having O(n^2) and O(2^n) synchronization steps for n cells, respectively.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125395781","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Aiming in the data interoperation such as access and sharing of heterogeneous spatial data in distributed system, grid technology was brought into spatial information service, and a complete architecture of spatial data interoperability in Grid environment was proposed. We analyzed and designed spatial data management, access and interoperability in the architecture, and offered possible ways for spatial data user to share, analyze and process the distributed data resources. In the end, a prototype system is built based on Globus Toolkit and OGSA-DAI, proving the architecture and methods brought up above are practical.
{"title":"Research on Spatial Data Interoperability in Spatial DATA Grid Environment","authors":"Qidong Yin, Qi Li, Xi Wu","doi":"10.1109/CSO.2010.243","DOIUrl":"https://doi.org/10.1109/CSO.2010.243","url":null,"abstract":"Aiming in the data interoperation such as access and sharing of heterogeneous spatial data in distributed system, grid technology was brought into spatial information service, and a complete architecture of spatial data interoperability in Grid environment was proposed. We analyzed and designed spatial data management, access and interoperability in the architecture, and offered possible ways for spatial data user to share, analyze and process the distributed data resources. In the end, a prototype system is built based on Globus Toolkit and OGSA-DAI, proving the architecture and methods brought up above are practical.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121896276","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sequential systems of linear equations methods(SSLE) are proposed mainly to solve the inconsistency and computation problems existed in the classical SQP method. In this paper, a new algorithm for inequality constrained optimization problems is presented. The attractive feature of the new algorithm is that only one system of linear equations is required to obtain the revised feasible descent direction. In order to void the Maratos effect, combined the generalized projection technique, a height-order correction direction is computed by an explicit formula, and it plays a important role in avoiding the strict complementarity. Furthermore, its global and superlinear convergence rate are obtained under some suitable conditions.
{"title":"A Modified Feasible SSLE Algorithm for Nonlinearly Constrained Optimization","authors":"Zhijun Luo, Guohua Chen, Zhibin Zhu","doi":"10.1109/CSO.2010.182","DOIUrl":"https://doi.org/10.1109/CSO.2010.182","url":null,"abstract":"Sequential systems of linear equations methods(SSLE) are proposed mainly to solve the inconsistency and computation problems existed in the classical SQP method. In this paper, a new algorithm for inequality constrained optimization problems is presented. The attractive feature of the new algorithm is that only one system of linear equations is required to obtain the revised feasible descent direction. In order to void the Maratos effect, combined the generalized projection technique, a height-order correction direction is computed by an explicit formula, and it plays a important role in avoiding the strict complementarity. Furthermore, its global and superlinear convergence rate are obtained under some suitable conditions.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128389623","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：