Using virtue of an inequality and some analysis techniques, we give a sufficiency and necessity condition on convergencon the modification Ishikawa iterative process with errors for uniformly asymptotically pseudocontractive mappings in Banach space, The results improve, extend, and include some recent results due to Zhang shi-sen Liu Q H etc.
{"title":"A Sufficiency and Necessity Condition on Convergence of Ishikawa Iterative Process for Asymptotically Pseudocontractive Mapping","authors":"Hongshan Du, Guanglan Wang","doi":"10.1109/CSO.2010.10","DOIUrl":"https://doi.org/10.1109/CSO.2010.10","url":null,"abstract":"Using virtue of an inequality and some analysis techniques, we give a sufficiency and necessity condition on convergencon the modification Ishikawa iterative process with errors for uniformly asymptotically pseudocontractive mappings in Banach space, The results improve, extend, and include some recent results due to Zhang shi-sen Liu Q H etc.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"34 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":"123858217","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, a no monotone conjugate gradient method for nonlinear optimization is proposed. Under weaker assumption on search direction dk and the mild assumptions on objective function f, the global convergence of the method is established.
{"title":"A Nonmonotone Conjugate Gradient Method for Nonlinear Optimization","authors":"Ying Song, Liying Liu","doi":"10.1109/CSO.2010.218","DOIUrl":"https://doi.org/10.1109/CSO.2010.218","url":null,"abstract":"In this paper, a no monotone conjugate gradient method for nonlinear optimization is proposed. Under weaker assumption on search direction dk and the mild assumptions on objective function f, the global convergence of the method is established.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"28 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":"121372584","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 analyzed ``St. Louis Risk Research Data'', which has a general missing pattern and conclude that the parental psychological disorders have significant effects on various aspects of the development of their children, specifically, the effects on the first child might be bigger than the second child.
在本文中，我们分析了St。Louis Risk Research Data)，该研究发现了一个普遍缺失的模式，并得出结论，父母的心理障碍对孩子发展的各个方面都有显著影响，特别是对第一个孩子的影响可能比第二个孩子更大。
{"title":"Missing Data Analysis of St. Louis Risk Research Data","authors":"Xue Zhao","doi":"10.1109/CSO.2010.89","DOIUrl":"https://doi.org/10.1109/CSO.2010.89","url":null,"abstract":"In this paper, we analyzed ``St. Louis Risk Research Data'', which has a general missing pattern and conclude that the parental psychological disorders have significant effects on various aspects of the development of their children, specifically, the effects on the first child might be bigger than the second child.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"13 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":"121451978","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 proposes a stochastic-combination search direction method for monotone variational inequality (VI) problems. Existing methods are developed with regard to one or some of the specified characteristics of the VI problem, but few of them are designed to solve all types of the VI problems. To investigate a more flexible method, which may perform fast convergence for all monotone VI problems, a new stochastic search direction is proposed in this paper. Such a search direction is a stochastic combination of two profitable search directions via two random weighting parameters. At each iteration, a best search direction together with its step size is selected in order to obtain a maximal progress of such iteration. The descent proposition of the stochastic direction is proved, which is useful to guarantee the convergence. Numerical examples are provided to show the efficiency of the proposed new solution algorithm. It is shown that the stochastic search direction is better than either or both of the other two search directions among a majority of the iterations. Therefore, it has the potential to achieve a faster convergence rate.
{"title":"Stochastic-Combination Search Direction Method for Monotone Variational Inequality Problems","authors":"H. Shao, Guodong Wang","doi":"10.1109/CSO.2010.14","DOIUrl":"https://doi.org/10.1109/CSO.2010.14","url":null,"abstract":"This paper proposes a stochastic-combination search direction method for monotone variational inequality (VI) problems. Existing methods are developed with regard to one or some of the specified characteristics of the VI problem, but few of them are designed to solve all types of the VI problems. To investigate a more flexible method, which may perform fast convergence for all monotone VI problems, a new stochastic search direction is proposed in this paper. Such a search direction is a stochastic combination of two profitable search directions via two random weighting parameters. At each iteration, a best search direction together with its step size is selected in order to obtain a maximal progress of such iteration. The descent proposition of the stochastic direction is proved, which is useful to guarantee the convergence. Numerical examples are provided to show the efficiency of the proposed new solution algorithm. It is shown that the stochastic search direction is better than either or both of the other two search directions among a majority of the iterations. Therefore, it has the potential to achieve a faster convergence rate.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"1 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":"131342197","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 basic problem in computer vision is to recover the projective structure of a set of 3D points from its 2D images. It is known that 3D projective invariants of six points can be computed from three uncalibrated view images. In the previous method, three homogeneous polynomial equations in four variables relating the geometry of the six 3D points and their 2D projections were derived first. Then an eighth degree polynomial equation in single variable was derived by means of the classical resultant technique. Numerical method was applied to obtain an equation of a third degree. So the form of the equation is implicit and hard to apply in real applications. This paper adopts a novel method to eliminate variables. A third degree polynomial equation in single variable is derived symbolically. The equation is presented in explicit form. It can be used in real applications directly.
{"title":"The Projective Invariants of Six 3D Points from Three 2D Uncalibrated Images","authors":"Yuanbin Wang, Bin Zhang, F. Hou","doi":"10.1109/CSO.2010.49","DOIUrl":"https://doi.org/10.1109/CSO.2010.49","url":null,"abstract":"A basic problem in computer vision is to recover the projective structure of a set of 3D points from its 2D images. It is known that 3D projective invariants of six points can be computed from three uncalibrated view images. In the previous method, three homogeneous polynomial equations in four variables relating the geometry of the six 3D points and their 2D projections were derived first. Then an eighth degree polynomial equation in single variable was derived by means of the classical resultant technique. Numerical method was applied to obtain an equation of a third degree. So the form of the equation is implicit and hard to apply in real applications. This paper adopts a novel method to eliminate variables. A third degree polynomial equation in single variable is derived symbolically. The equation is presented in explicit form. It can be used in real applications directly.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"35 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":"133727783","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 order to obtain a new steering control structure for vehicles equipped with four-wheel steering system, a linear model of the lateral dynamics is used in this paper. By introducing vehicle sideslip control and yaw rate control decoupling, a more accurate sideslip and yaw rate controller is used for lateral dynamics model of four-wheel steering vehicle, the sideslip and yaw rate controller is based on a linear multivariable combined with lateral dynamics model and the front and rear steering angles. For illustration, a simulation example is utilized to show the robustness of the new designed controller. Empirical results show that the controller based on partial decoupling design has good robustness. The four-wheel steering system with good handling robustness stability can effectively restrain exoteric lateral interference and thus active rolling handling control and tracking performance are solved.
{"title":"Control Strategy for Four-Wheel Steering Vehicle Handling Stability Based on Partial Decoupling Design","authors":"Bin Yang, M. Wan, Q. Sun","doi":"10.1109/CSO.2010.67","DOIUrl":"https://doi.org/10.1109/CSO.2010.67","url":null,"abstract":"In order to obtain a new steering control structure for vehicles equipped with four-wheel steering system, a linear model of the lateral dynamics is used in this paper. By introducing vehicle sideslip control and yaw rate control decoupling, a more accurate sideslip and yaw rate controller is used for lateral dynamics model of four-wheel steering vehicle, the sideslip and yaw rate controller is based on a linear multivariable combined with lateral dynamics model and the front and rear steering angles. For illustration, a simulation example is utilized to show the robustness of the new designed controller. Empirical results show that the controller based on partial decoupling design has good robustness. The four-wheel steering system with good handling robustness stability can effectively restrain exoteric lateral interference and thus active rolling handling control and tracking performance are solved.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"52 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":"133951938","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 road traffic flow evolutionary patterns of metropolitan areas evolve slowly through a complex multi-dimensional travel decision-making behavior (including travel mode, departure time and route choice joint decision-making). How to forecast the long run evolutionary trend of traffic flow on the entire network? Does the traffic evolution track converge to equilibrium? If it can, what’s the condition should be satisfied? And what’s the relationship between trip costs and traffic flow evolutionary patterns? In order to answer these related questions, this paper aims at the general travel behavioral decision-making process, a novel dynamical systems formulation of the traffic assignment problem using evolutionary game theory is proposed. The assumptions on drivers’ behavior in multi-dimensional travel choice are supposed to be fairly general and reasonable. And the stable properties of this dynamical system on its equilibrium points are investigated using Lyapunov method in a general network. It shows that the evolutionary dynamical system exist only one solution on the condition that the traveler population satisfies some hypotheses which individual’s trip payoff satisfy some constraint conditions. These means that there maybe exist inherent motive power which drive the traffic flow evolve to some stable patterns from long run view point. It can improve our understandings to urban traffic flow evolution process and provide significant reference for relevant management section.
{"title":"Evolutionary Analysis on the Dynamical Systems of Travel Behavioral Decision-Making","authors":"Xing-Guang Chen, Jing Zhou, Zhuojun Li, S. Huang","doi":"10.1109/CSO.2010.44","DOIUrl":"https://doi.org/10.1109/CSO.2010.44","url":null,"abstract":"The road traffic flow evolutionary patterns of metropolitan areas evolve slowly through a complex multi-dimensional travel decision-making behavior (including travel mode, departure time and route choice joint decision-making). How to forecast the long run evolutionary trend of traffic flow on the entire network? Does the traffic evolution track converge to equilibrium? If it can, what’s the condition should be satisfied? And what’s the relationship between trip costs and traffic flow evolutionary patterns? In order to answer these related questions, this paper aims at the general travel behavioral decision-making process, a novel dynamical systems formulation of the traffic assignment problem using evolutionary game theory is proposed. The assumptions on drivers’ behavior in multi-dimensional travel choice are supposed to be fairly general and reasonable. And the stable properties of this dynamical system on its equilibrium points are investigated using Lyapunov method in a general network. It shows that the evolutionary dynamical system exist only one solution on the condition that the traveler population satisfies some hypotheses which individual’s trip payoff satisfy some constraint conditions. These means that there maybe exist inherent motive power which drive the traffic flow evolve to some stable patterns from long run view point. It can improve our understandings to urban traffic flow evolution process and provide significant reference for relevant management section.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"14 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":"132271750","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}
Artificial Tribe Algorithm (ATA) is a novel intelligent optimization algorithm based on the simulation of bionic intelligent optimization algorithm. This work discusses the main factors which influence the performance of ATA, and compares the performance of ATA with that of genetic algorithm (GA), particle swarm optimization (PSO), and artificial fish-swarm algorithm (AFSA) for optimization multivariable functions. The simulation results showed that ATA outperforms the mentioned algorithms in global optimization problems.
{"title":"On the Analysis of Performance of the Artificial Tribe Algorithm","authors":"Tanggong Chen, Xiaowei Wei, Wenhui Jia, Zhi Liu","doi":"10.1109/CSO.2010.112","DOIUrl":"https://doi.org/10.1109/CSO.2010.112","url":null,"abstract":"Artificial Tribe Algorithm (ATA) is a novel intelligent optimization algorithm based on the simulation of bionic intelligent optimization algorithm. This work discusses the main factors which influence the performance of ATA, and compares the performance of ATA with that of genetic algorithm (GA), particle swarm optimization (PSO), and artificial fish-swarm algorithm (AFSA) for optimization multivariable functions. The simulation results showed that ATA outperforms the mentioned algorithms in global optimization problems.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"66 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":"114166349","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}
Matching pursuit algorithm extracting the time-frequency characteristics of signal has been applied in many fields. High computer complexity is a bottle-neck, especially in the high dimensions of the search space. In this paper, genetic algorithm and particle swarm optimization is used to solve this problem. Two decomposition methods named particle swarm optimization matching pursuit (PSO-MP) and genetic algorithm matching pursuit (GA-MP) are proposed for time-frequency analysis of frequency hopping signals. Experiment results proved the validity and feasibility of the approaches. Compared to GA-MP algorithm, PSO-MP algorithm could choose more precise atom parameters and has higher convergent speed as to the average process time.
{"title":"Adaptive Time-Frequency Parameterization of Frequency-Hopping Signals Based on Evolutionary Algorithm","authors":"Jiantao Guo","doi":"10.1109/CSO.2010.203","DOIUrl":"https://doi.org/10.1109/CSO.2010.203","url":null,"abstract":"Matching pursuit algorithm extracting the time-frequency characteristics of signal has been applied in many fields. High computer complexity is a bottle-neck, especially in the high dimensions of the search space. In this paper, genetic algorithm and particle swarm optimization is used to solve this problem. Two decomposition methods named particle swarm optimization matching pursuit (PSO-MP) and genetic algorithm matching pursuit (GA-MP) are proposed for time-frequency analysis of frequency hopping signals. Experiment results proved the validity and feasibility of the approaches. Compared to GA-MP algorithm, PSO-MP algorithm could choose more precise atom parameters and has higher convergent speed as to the average process time.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"58 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":"114495444","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：