According to the confluence theory of hydrology, the paper discuss the method of calculating the water-logging of the surface in the region. Combined using the spatial analysis in GIS with calculating the "Isochrones" in the confluence of regional water-logging, to describe the distribution of the confluence in space and the strength of the confluence in time. At the end of the procession, it gives the space and time maps of spatial and temporal distribution of the water-logging's confluence. The research evidence that the confluence's strength in time is closed to the elevation of the research region, and the confluence's distribution in space is closed to the distribution of the river.
{"title":"GIS-Based Spatial and Temporal Analysis of Regional Water-Logging Confluence","authors":"Xianfu Zhao, J. Qian, Fengchang Xue, Tao-tao Chen","doi":"10.1109/CSO.2011.141","DOIUrl":"https://doi.org/10.1109/CSO.2011.141","url":null,"abstract":"According to the confluence theory of hydrology, the paper discuss the method of calculating the water-logging of the surface in the region. Combined using the spatial analysis in GIS with calculating the \"Isochrones\" in the confluence of regional water-logging, to describe the distribution of the confluence in space and the strength of the confluence in time. At the end of the procession, it gives the space and time maps of spatial and temporal distribution of the water-logging's confluence. The research evidence that the confluence's strength in time is closed to the elevation of the research region, and the confluence's distribution in space is closed to the distribution of the river.","PeriodicalId":210815,"journal":{"name":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131792751","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}
To benefit of both regular topology and partially customized structure, we adopt application specified link removal strategy to minimize NoC (Network on Chip) area consumption with partial regularity twist and guaranteed performance. Our link removal for single application mainly includes iterative link removal selection algorithm based on low link utilization for topology optimization and turn model based deadlock free routing algorithm for irregular 2D Mesh with reduced links. In addition, we also consider multiapplication from realistic requirement and try to define various execution modes. The seamless combination of multiapplications and link removal method is achieved via corresponding interoperation of removed link set. Taking typical media applications VOPD and MWD for example, the simulation results verify proposed multi-application specified NoC link removal strategy valid for area cost optimization and acceptable performance degradation.
{"title":"Multi-application Specified Link Removal Strategy for Network on Chip","authors":"Jiajia Jiao, Yuzhuo Fu, Yaoyi Wu","doi":"10.1109/CSO.2011.175","DOIUrl":"https://doi.org/10.1109/CSO.2011.175","url":null,"abstract":"To benefit of both regular topology and partially customized structure, we adopt application specified link removal strategy to minimize NoC (Network on Chip) area consumption with partial regularity twist and guaranteed performance. Our link removal for single application mainly includes iterative link removal selection algorithm based on low link utilization for topology optimization and turn model based deadlock free routing algorithm for irregular 2D Mesh with reduced links. In addition, we also consider multiapplication from realistic requirement and try to define various execution modes. The seamless combination of multiapplications and link removal method is achieved via corresponding interoperation of removed link set. Taking typical media applications VOPD and MWD for example, the simulation results verify proposed multi-application specified NoC link removal strategy valid for area cost optimization and acceptable performance degradation.","PeriodicalId":210815,"journal":{"name":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134150998","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}
As a kind of hybrid financial instrument, the pricing of convertible bond (CB) has constituted a great challenge. This paper developed a novel method integrating support vector machine (SVM) with copula function. Different from existing single-factor or bifactor pricing models based on corporate value and the underlying stock price respectively, this model can effectively deal with many constrains on the CB pricing, such as nonlinearity, departure from normality, multivariate joint distribution, variable dependence structure, and so on. In particularly, the new model exhibited great flexibility in that copula function can portray dependence structure between the underlying stock price and interest rate, and that SVM can further tackle nonlinear relationship among variables. Empirical analysis showed that the proposed model enhanced generation ability of out-of-sample, with mark increase in CB pricing accuracy compared with the single SVM, and that the CB value sensitivity to the underlying stock and the dependence structure is also measured handily and effectively through the model.
{"title":"Pricing Convertible Bond Based on Integration of Support Vector Machine and Copula Function","authors":"Chuanhe Shen, Xiangrong Wang","doi":"10.1109/CSO.2011.207","DOIUrl":"https://doi.org/10.1109/CSO.2011.207","url":null,"abstract":"As a kind of hybrid financial instrument, the pricing of convertible bond (CB) has constituted a great challenge. This paper developed a novel method integrating support vector machine (SVM) with copula function. Different from existing single-factor or bifactor pricing models based on corporate value and the underlying stock price respectively, this model can effectively deal with many constrains on the CB pricing, such as nonlinearity, departure from normality, multivariate joint distribution, variable dependence structure, and so on. In particularly, the new model exhibited great flexibility in that copula function can portray dependence structure between the underlying stock price and interest rate, and that SVM can further tackle nonlinear relationship among variables. Empirical analysis showed that the proposed model enhanced generation ability of out-of-sample, with mark increase in CB pricing accuracy compared with the single SVM, and that the CB value sensitivity to the underlying stock and the dependence structure is also measured handily and effectively through the model.","PeriodicalId":210815,"journal":{"name":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134593590","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, basing on the existence of the global solution for a class of partial differential system with and without impulses, impulsive synchronization of the system is investigated. Sufficient conditions for the solution of impulsive error system is equi-attractive in the large are obtained. A numerical simulation is given to illustrated the result. As an application, an information hiding scheme basing on impulsive synchronization of partial differential system is developed. A simple spatiotemporal signal is masked and recovered, simulation results show the method is effective.
{"title":"Impulsive Synchronization for Partial Differential System with Application to Information Hiding","authors":"Wanli Yang, Suwen Zheng","doi":"10.1109/CSO.2011.151","DOIUrl":"https://doi.org/10.1109/CSO.2011.151","url":null,"abstract":"In this paper, basing on the existence of the global solution for a class of partial differential system with and without impulses, impulsive synchronization of the system is investigated. Sufficient conditions for the solution of impulsive error system is equi-attractive in the large are obtained. A numerical simulation is given to illustrated the result. As an application, an information hiding scheme basing on impulsive synchronization of partial differential system is developed. A simple spatiotemporal signal is masked and recovered, simulation results show the method is effective.","PeriodicalId":210815,"journal":{"name":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115649354","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 Copenhagen Climate Conference, all the members of this conference didn't reach consensus on the next ducting emission commitment deadline, however, reduction commitment deadline has important effects on the investment of low carbon industry. Our research is based on, Jiang Zhong-yi's optimal control theory model, we Introduce two variables, market basic interest rates and investor's time preferences rate, we use these two variables as the Intermediary variable, and get the following conclusion: investors have different investment choice when they face different reducing emission commitment deadline. Our research will be helpful for the government to make policy.
{"title":"How the Deadline of Reducing Emission Commitment Influence the Low Carbon Industry Finance","authors":"Zhongmin Li, Jiangbo Yu, Shubin Wang","doi":"10.1109/CSO.2011.146","DOIUrl":"https://doi.org/10.1109/CSO.2011.146","url":null,"abstract":"In Copenhagen Climate Conference, all the members of this conference didn't reach consensus on the next ducting emission commitment deadline, however, reduction commitment deadline has important effects on the investment of low carbon industry. Our research is based on, Jiang Zhong-yi's optimal control theory model, we Introduce two variables, market basic interest rates and investor's time preferences rate, we use these two variables as the Intermediary variable, and get the following conclusion: investors have different investment choice when they face different reducing emission commitment deadline. Our research will be helpful for the government to make policy.","PeriodicalId":210815,"journal":{"name":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114351958","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 investigate second-order generalized Laguerre approximation. Various orthogonal projections are established. As an example of their important applications, we propose the spectral scheme for some fourth order differential equations on unbounded domain. their convergence are proved. Numerical results demonstrate the high accuracy of this new spectral method.
{"title":"Second Order Generalized Laguerre Function Approximation and Its Applications to Fourth-Order Differential Equations","authors":"Xiao-yong Zhang, Jiang Hua Sui","doi":"10.1109/CSO.2011.234","DOIUrl":"https://doi.org/10.1109/CSO.2011.234","url":null,"abstract":"In this paper, we investigate second-order generalized Laguerre approximation. Various orthogonal projections are established. As an example of their important applications, we propose the spectral scheme for some fourth order differential equations on unbounded domain. their convergence are proved. Numerical results demonstrate the high accuracy of this new spectral method.","PeriodicalId":210815,"journal":{"name":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114776046","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 algorithm that is able to quickly obtain an optimal solution to TSP from a huge search space. This algorithm is based upon the use of Genetic Algorithm techniques. The algorithm employs a roulette wheel based selection mechanism, the use of a survival-of-the-fittest strategy, a heuristic crossover operator, and an inversion operator. To illustrate it more clearly, a program based on this algorithm has been implemented, which presents the changing process of the route iteration in a more intuitive way. Finally, we apply it into a TSP problem with fifty cities. By comparing with other published techniques, we can easily know that the proposed algorithm can efficiently complete the search process and derive a better solution.
{"title":"A New Design of Genetic Algorithm for Solving TSP","authors":"Yingying Yu, Yan Chen, Taoying Li","doi":"10.1109/CSO.2011.46","DOIUrl":"https://doi.org/10.1109/CSO.2011.46","url":null,"abstract":"In this paper, we develop an algorithm that is able to quickly obtain an optimal solution to TSP from a huge search space. This algorithm is based upon the use of Genetic Algorithm techniques. The algorithm employs a roulette wheel based selection mechanism, the use of a survival-of-the-fittest strategy, a heuristic crossover operator, and an inversion operator. To illustrate it more clearly, a program based on this algorithm has been implemented, which presents the changing process of the route iteration in a more intuitive way. Finally, we apply it into a TSP problem with fifty cities. By comparing with other published techniques, we can easily know that the proposed algorithm can efficiently complete the search process and derive a better solution.","PeriodicalId":210815,"journal":{"name":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114217041","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 testing strategy was proposed to deal with the parallelism of unit testing based on the priority of function. The influence of parameters, global and local variables on the proper realization of the control flow of function was analyzed in this paper. The quantitive mathematical model of the weight influencing factor was built, and a directed acycline graph with weight was generated by combining the function's control flow chart. Further more, the tested function's critical path was given by the algorithm based on AOE-net. After a test case was done, the hypo-critical path was chosen until the test criterion was guaranteed. The experiment results showed that with a scheduled test time among modules, the software test efficiency was improved achieving the objective of software quality assurance(SQA).
{"title":"Research on the Application Technology of Unit Testing Based on Priority","authors":"Feng Gao, G. Yuan, Chun Zheng, Chang Liu","doi":"10.1109/CSO.2011.222","DOIUrl":"https://doi.org/10.1109/CSO.2011.222","url":null,"abstract":"A testing strategy was proposed to deal with the parallelism of unit testing based on the priority of function. The influence of parameters, global and local variables on the proper realization of the control flow of function was analyzed in this paper. The quantitive mathematical model of the weight influencing factor was built, and a directed acycline graph with weight was generated by combining the function's control flow chart. Further more, the tested function's critical path was given by the algorithm based on AOE-net. After a test case was done, the hypo-critical path was chosen until the test criterion was guaranteed. The experiment results showed that with a scheduled test time among modules, the software test efficiency was improved achieving the objective of software quality assurance(SQA).","PeriodicalId":210815,"journal":{"name":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114467504","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}
We consider the problem of how to determine the required level of the current provision in order to be able to meet a series of future deterministic payment obligations, in case the provision is invested according to a given random return process. Approximate solutions are derived, taking into account imposed minimum levels of the future random values of the reserve. The paper ends with numerical examples illustrating the presented approximations.
{"title":"The Hurdle-Race Problem","authors":"Jifu Nong","doi":"10.1109/CSO.2011.269","DOIUrl":"https://doi.org/10.1109/CSO.2011.269","url":null,"abstract":"We consider the problem of how to determine the required level of the current provision in order to be able to meet a series of future deterministic payment obligations, in case the provision is invested according to a given random return process. Approximate solutions are derived, taking into account imposed minimum levels of the future random values of the reserve. The paper ends with numerical examples illustrating the presented approximations.","PeriodicalId":210815,"journal":{"name":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117328709","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}
Lingling Zhang, Xiaojie Zhang, Quan Chen, Zhengxiang Zhu, Yong Shi
In order to tackle the problems of current recommendation system, such as lack of domain knowledge and limited applications in e-commerce field, a domain-driven recommendation method based on binary data is proposed in this paper. By introducing the importance of domain knowledge and its application in recommendation, we discuss how to combine domain knowledge with collaborative filtering and apply it on binary purchasing data. Empirical result on supermarket dataset shows that domain-driven recommendation method outperforms other recommendation methods on three common evaluating indicators.
{"title":"Domain-Knowledge Driven Recommendation Method and Its Application","authors":"Lingling Zhang, Xiaojie Zhang, Quan Chen, Zhengxiang Zhu, Yong Shi","doi":"10.1109/CSO.2011.305","DOIUrl":"https://doi.org/10.1109/CSO.2011.305","url":null,"abstract":"In order to tackle the problems of current recommendation system, such as lack of domain knowledge and limited applications in e-commerce field, a domain-driven recommendation method based on binary data is proposed in this paper. By introducing the importance of domain knowledge and its application in recommendation, we discuss how to combine domain knowledge with collaborative filtering and apply it on binary purchasing data. Empirical result on supermarket dataset shows that domain-driven recommendation method outperforms other recommendation methods on three common evaluating indicators.","PeriodicalId":210815,"journal":{"name":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115139418","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
扫码关注我们
求助内容：
应助结果提醒方式：