The mathematical problem of an infinite elastic plane consisting of three different media with an arbitrary number of cracks is considered. It is reduced to singular integral equations along the interfaces and the cra...The mathematical problem of an infinite elastic plane consisting of three different media with an arbitrary number of cracks is considered. It is reduced to singular integral equations along the interfaces and the cracks by a constructive method. Those along the interfaces are further reduced to Fredholm ones.展开更多
A theoretical study was conducted on finding optimal paths in transportation networks where link travel times were stochastic and time-dependent(STD). The methodology of relative robust optimization was applied as mea...A theoretical study was conducted on finding optimal paths in transportation networks where link travel times were stochastic and time-dependent(STD). The methodology of relative robust optimization was applied as measures for comparing time-varying, random path travel times for a priori optimization. In accordance with the situation in real world, a stochastic consistent condition was provided for the STD networks and under this condition, a mathematical proof was given that the STD robust optimal path problem can be simplified into a minimum problem in specific time-dependent networks. A label setting algorithm was designed and tested to find travelers' robust optimal path in a sampled STD network with computation complexity of O(n2+n·m). The validity of the robust approach and the designed algorithm were confirmed in the computational tests. Compared with conventional probability approach, the proposed approach is simple and efficient, and also has a good application prospect in navigation system.展开更多
Mature algorithms for the Constraint Satisfaction Problem (CSP) of binary constraint with discrete variables have already been obtained for the application. For the instance of multi value constraint with continuous v...Mature algorithms for the Constraint Satisfaction Problem (CSP) of binary constraint with discrete variables have already been obtained for the application. For the instance of multi value constraint with continuous variables, the approach will be quite different and the difficulty of settling will aggrandize a lot. This paper presents the algorithm for realizing global consistency of continuous variable. And this algorithm can be applied to multi value constraint.展开更多
基金Project supported by the Science Fund of the Chinese Academy of Sciences
文摘The mathematical problem of an infinite elastic plane consisting of three different media with an arbitrary number of cracks is considered. It is reduced to singular integral equations along the interfaces and the cracks by a constructive method. Those along the interfaces are further reduced to Fredholm ones.
基金Project(71001079)supported by the National Natural Science Foundation of China
文摘A theoretical study was conducted on finding optimal paths in transportation networks where link travel times were stochastic and time-dependent(STD). The methodology of relative robust optimization was applied as measures for comparing time-varying, random path travel times for a priori optimization. In accordance with the situation in real world, a stochastic consistent condition was provided for the STD networks and under this condition, a mathematical proof was given that the STD robust optimal path problem can be simplified into a minimum problem in specific time-dependent networks. A label setting algorithm was designed and tested to find travelers' robust optimal path in a sampled STD network with computation complexity of O(n2+n·m). The validity of the robust approach and the designed algorithm were confirmed in the computational tests. Compared with conventional probability approach, the proposed approach is simple and efficient, and also has a good application prospect in navigation system.
文摘Mature algorithms for the Constraint Satisfaction Problem (CSP) of binary constraint with discrete variables have already been obtained for the application. For the instance of multi value constraint with continuous variables, the approach will be quite different and the difficulty of settling will aggrandize a lot. This paper presents the algorithm for realizing global consistency of continuous variable. And this algorithm can be applied to multi value constraint.
