In the process of wave radar off-shore measurement, many factors have important influence in data collection, such as angle, distance and so on. Water depth is one of these important factors. Also water depth participates in the later inversion algorithm to affect several parameters (wave period, signal-to-noise ratio, etc.) precision. Firstly, according to the dispersion relation, it analyses the effect on those parameters qualitatively. Then the experiment results verify these analyzed results. It proves that in the inversion algorithm, if the water depth used is greater than the actual one, the signal-to-noise ratio increases, and the wave period decreases. On the contrary, the signal-to-noise ratio decreases, and the wave period will increase.
{"title":"Effect of the Sea Water Depth on the Wave Parameters in the Parameters Inversion of X-Band Marin Radar","authors":"Jihong Shen, Y. Li, Yuntao Dai, Yan Li","doi":"10.1109/CSO.2011.121","DOIUrl":"https://doi.org/10.1109/CSO.2011.121","url":null,"abstract":"In the process of wave radar off-shore measurement, many factors have important influence in data collection, such as angle, distance and so on. Water depth is one of these important factors. Also water depth participates in the later inversion algorithm to affect several parameters (wave period, signal-to-noise ratio, etc.) precision. Firstly, according to the dispersion relation, it analyses the effect on those parameters qualitatively. Then the experiment results verify these analyzed results. It proves that in the inversion algorithm, if the water depth used is greater than the actual one, the signal-to-noise ratio increases, and the wave period decreases. On the contrary, the signal-to-noise ratio decreases, and the wave period will increase.","PeriodicalId":210815,"journal":{"name":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","volume":"50 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":"122298010","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}
Quanwei Qiu, Ligu Zhu, Tingtao Zhao, Zhen Liang, Xiaoshan Yang
with the rapid development of storage technology, many kinds of storage products and systems have been released, but these products and systems always have some problems such as the performance is not credible, the reliability is not high and so on. In order to better test and evaluate the performance of storage products and systems, we design and implement a distributed Storage Performance Test System called SPTS, which can test the IO performance of file system and disk array. The experience of testing disk array's IOPS and data transfer rate shows that SPTS can provide certain value when customers purchase and use storage products or storage systems.
{"title":"A Distributed Storage Performance Test System: Design, Implementation, and Experience","authors":"Quanwei Qiu, Ligu Zhu, Tingtao Zhao, Zhen Liang, Xiaoshan Yang","doi":"10.1109/CSO.2011.28","DOIUrl":"https://doi.org/10.1109/CSO.2011.28","url":null,"abstract":"with the rapid development of storage technology, many kinds of storage products and systems have been released, but these products and systems always have some problems such as the performance is not credible, the reliability is not high and so on. In order to better test and evaluate the performance of storage products and systems, we design and implement a distributed Storage Performance Test System called SPTS, which can test the IO performance of file system and disk array. The experience of testing disk array's IOPS and data transfer rate shows that SPTS can provide certain value when customers purchase and use storage products or storage systems.","PeriodicalId":210815,"journal":{"name":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","volume":"153 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":"121517104","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}
The research of the identification and evaluation of entrepreneurial opportunity is a hotspot in entrepreneurial management research. On the basis of literature review, this paper establishes a theoretical model for the process mechanism of identification and evaluation of entrepreneurial opportunity. Moreover, the paper verifies the theoretical model by some cases so that it will be useful for the subsequent research in the related area.
{"title":"The Identification and Evaluation Mechanism of Entrepreneurial Opportunity","authors":"H. Lai, Yuyong Liu","doi":"10.1109/CSO.2011.270","DOIUrl":"https://doi.org/10.1109/CSO.2011.270","url":null,"abstract":"The research of the identification and evaluation of entrepreneurial opportunity is a hotspot in entrepreneurial management research. On the basis of literature review, this paper establishes a theoretical model for the process mechanism of identification and evaluation of entrepreneurial opportunity. Moreover, the paper verifies the theoretical model by some cases so that it will be useful for the subsequent research in the related area.","PeriodicalId":210815,"journal":{"name":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","volume":"24 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":"115145135","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 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}
We present a group update algorithm based on truncated trust region strategy for large-scale sparse unconstrained optimization. In large sparse optimization computing the whole Hessian matrix and solving exactly the Newton-like equations at each iteration can be considerably expensive. By the method the elements of the Hessian matrix are updated successively and periodically via groups during iterations and an inaccurate solution to the Newton-like equations is obtained by truncating the inner iteration under certain control rule. Besides, we allow that the current direction exceeds the trust region bound if it is a good descent direction satisfying some descent conditions. Some good convergence properties are kept and we contrast the computational behavior of our method with that of other algorithms. Our numerical tests show that the algorithm is promising and quite effective, and that its performance is comparable to or better than that of other algorithms available.
{"title":"A Group Update Sparse Method Using Truncated Trust Region Strategy","authors":"Junxiang Li, Tao Dai, Feng Cheng, Jia-zhen Huo","doi":"10.1109/CSO.2011.31","DOIUrl":"https://doi.org/10.1109/CSO.2011.31","url":null,"abstract":"We present a group update algorithm based on truncated trust region strategy for large-scale sparse unconstrained optimization. In large sparse optimization computing the whole Hessian matrix and solving exactly the Newton-like equations at each iteration can be considerably expensive. By the method the elements of the Hessian matrix are updated successively and periodically via groups during iterations and an inaccurate solution to the Newton-like equations is obtained by truncating the inner iteration under certain control rule. Besides, we allow that the current direction exceeds the trust region bound if it is a good descent direction satisfying some descent conditions. Some good convergence properties are kept and we contrast the computational behavior of our method with that of other algorithms. Our numerical tests show that the algorithm is promising and quite effective, and that its performance is comparable to or better than that of other algorithms available.","PeriodicalId":210815,"journal":{"name":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","volume":"387 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":"123350065","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}
Traditional road supply models assume full knowledge of the inverse demand function, such that the supply-demand equilibrium point can be easily obtained. However, in practice, it is often difficult to completely characterize the inverse demand function, especially for a congested road. In this paper, we study the traffic volume estimating problem for a congested road with partial information about the inverse demand function, i.e., range or total willing to pay for travel. In particular, we first propose a minimax regret model for minimizing the planner's maximum opportunity cost of not acting optimally, and then obtain some analytical solutions by transforming it into a moment problem equivalently with some simplified assumptions. The model and results in this paper are both instructive and can be extended to investigate more realistic scenarios for practical application.
{"title":"Regret Approach in Estimating Traffic Volume for a Congested Road with Unknown Inverse Demand Function","authors":"Tianliang Liu, Yan Wang","doi":"10.1109/CSO.2011.298","DOIUrl":"https://doi.org/10.1109/CSO.2011.298","url":null,"abstract":"Traditional road supply models assume full knowledge of the inverse demand function, such that the supply-demand equilibrium point can be easily obtained. However, in practice, it is often difficult to completely characterize the inverse demand function, especially for a congested road. In this paper, we study the traffic volume estimating problem for a congested road with partial information about the inverse demand function, i.e., range or total willing to pay for travel. In particular, we first propose a minimax regret model for minimizing the planner's maximum opportunity cost of not acting optimally, and then obtain some analytical solutions by transforming it into a moment problem equivalently with some simplified assumptions. The model and results in this paper are both instructive and can be extended to investigate more realistic scenarios for practical application.","PeriodicalId":210815,"journal":{"name":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","volume":"33 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":"123962346","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}
This paper studies unidirectional pedestrian flow in a channel by using a lattice gas model with parallel update rule. Game theory is introduced to deal with the conflict that several pedestrians intend to move to the same site. A pedestrian is either a co operator (C) or defector (D) when he or she wants to move into the same lattice as other pedestrians. Moreover, he or she could change the strategy (C or D) in the next conflict. The fundamental diagram of pedestrian flow in the channel has been investigated in details, and differences from the model with random sequential update rule have been observed. The co operators fraction is shown to exhibit an interesting non-monotonic dependence on pedestrian density. It is interesting to find that change of co operators fraction alters exponentially before the system comes to steady state. How the parameters p and q in the payoff matrix of game influence mean flow and co operators fraction is also investigated.
{"title":"Unidirectional Pedestrian Flow in a Lattice Gas Model Coupled with Game Theory","authors":"Qing-Yi Hao, R. Jiang, Maobin Hu, Qing-Song Wu","doi":"10.1109/CSO.2011.291","DOIUrl":"https://doi.org/10.1109/CSO.2011.291","url":null,"abstract":"This paper studies unidirectional pedestrian flow in a channel by using a lattice gas model with parallel update rule. Game theory is introduced to deal with the conflict that several pedestrians intend to move to the same site. A pedestrian is either a co operator (C) or defector (D) when he or she wants to move into the same lattice as other pedestrians. Moreover, he or she could change the strategy (C or D) in the next conflict. The fundamental diagram of pedestrian flow in the channel has been investigated in details, and differences from the model with random sequential update rule have been observed. The co operators fraction is shown to exhibit an interesting non-monotonic dependence on pedestrian density. It is interesting to find that change of co operators fraction alters exponentially before the system comes to steady state. How the parameters p and q in the payoff matrix of game influence mean flow and co operators fraction is also investigated.","PeriodicalId":210815,"journal":{"name":"2011 Fourth International Joint Conference on Computational Sciences and Optimization","volume":"34 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":"121342145","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
扫码关注我们
求助内容：
应助结果提醒方式：