A novel layered method was proposed to solve the problem of Web services composition.In this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal m...A novel layered method was proposed to solve the problem of Web services composition.In this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal matching problem was modeled based on the hypergraph theory,and solved by computing the minimal transversals of the hypergraph.Meanwhile,two optimization algorithms were designed to discard some useless states at the intermediary steps of the composition algorithm.The effectiveness of the composition method was tested by a set of experiments,in addition,an example regarding the travel services composition was also given.The experimental results show that this method not only can automatically generate composition tree whose leaf nodes correspond to services composition solutions,but also has better performance on execution time and solution quality by adopting two proposed optimization algorithms.展开更多
In this paper, the initial boundary value problem of semilinear degenerate reaction-diffusion systems is studied. The regularization method and upper and lower solutions technique are employed to show the existence an...In this paper, the initial boundary value problem of semilinear degenerate reaction-diffusion systems is studied. The regularization method and upper and lower solutions technique are employed to show the existence and continuation of a positive classical solution. The location of quenching points is found. The critical length is estimated by the eigenvalue method.展开更多
The material distribution routing problem in the manufacturing system is a complex combinatorial optimization problem and its main task is to deliver materials to the working stations with low cost and high efficiency...The material distribution routing problem in the manufacturing system is a complex combinatorial optimization problem and its main task is to deliver materials to the working stations with low cost and high efficiency. A multi-objective model was presented for the material distribution routing problem in mixed manufacturing systems, and it was solved by a hybrid multi-objective evolutionary algorithm (HMOEA). The characteristics of the HMOEA are as follows: 1) A route pool is employed to preserve the best routes for the population initiation; 2) A specialized best?worst route crossover (BWRC) mode is designed to perform the crossover operators for selecting the best route from Chromosomes 1 to exchange with the worst one in Chromosomes 2, so that the better genes are inherited to the offspring; 3) A route swap mode is used to perform the mutation for improving the convergence speed and preserving the better gene; 4) Local heuristics search methods are applied in this algorithm. Computational study of a practical case shows that the proposed algorithm can decrease the total travel distance by 51.66%, enhance the average vehicle load rate by 37.85%, cut down 15 routes and reduce a deliver vehicle. The convergence speed of HMOEA is faster than that of famous NSGA-II.展开更多
In this paper, a coupled elliptic-parabolic system modeling a class of engineering problems with thermal effect is studied. Existence of a weak solution is first established through a result of Meyers＇ theorem and Sc...In this paper, a coupled elliptic-parabolic system modeling a class of engineering problems with thermal effect is studied. Existence of a weak solution is first established through a result of Meyers＇ theorem and Schauder fixed point theorem, where the coupled functions σ（s）,k（s） are assumed to be bounded in the C（IR×（0, T））. If σ（s）,k（s） are Lipschitz continuous we prove that solution is unique under some restriction on integrability of solution. The regularity of the solution in dimension n ≤ 2 is then analyzed under the assumptions on σ（s） ∈w^1,∞（Ω×（0, T）） and the boundedness of σ＇（s） and σ″（s）.展开更多
In this paper,the improved canonical quantization method of the self dual field is given in order to overcome linear combination problem about the second class constraint and the first class constraint number maximiza...In this paper,the improved canonical quantization method of the self dual field is given in order to overcome linear combination problem about the second class constraint and the first class constraint number maximization problem in the Dirac method.In the improved canonical quantization method,there are no artificial linear combination and the first class constraint number maximization problems,at the same time,the stability of the system is considered.Therefore,the improved canonical quantization method is more natural and easier accepted by people than the usual Dirac method.We use the improved canonical quantization method to realize the canonical quantization of the self dual field,which has relation with string theory successfully and the results are equal to the results by using the Dirac method.展开更多
This paper is focused on the H_(∞) control problem for linear systems with interval timevarying delays.By employing a reciprocally convex combination approach and a delay decomposition approach,some new delay-depende...This paper is focused on the H_(∞) control problem for linear systems with interval timevarying delays.By employing a reciprocally convex combination approach and a delay decomposition approach,some new delay-dependent bounded real lemmas(BRLs) are derived such that the closedloop system is asymptotically stable with a prescribed H_(∞) level.The BRLs are then used to solve the H_(∞) controller design by incorporating with the cone complementary approach.Three numerical examples are finally given to show the validity of the proposed method.展开更多
基金Project(2010CB328101) supported by the National Basic Research Program of ChinaProject(2009AA01Z401) supported by the National High Technology Research and Development Program of China+4 种基金Projects(60803032,90818023) supported by the National Natural Science Foundation of ChinaProjects(09510701300,09JC1414200,09DZ1120403) supported by the Shanghai Science and Technology Commission,China"Shu Guang" Project(10SG23) supported by Shanghai Municipal Education Commission and Shanghai Education Development Foundation,ChinaProject(09QA1405800) supported by Shanghai Science and Technology Commission Rising-Star Program,ChinaProject(NCET-10-0598) supported by Program for New Century Excellent Talents in Chinese University
文摘A novel layered method was proposed to solve the problem of Web services composition.In this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal matching problem was modeled based on the hypergraph theory,and solved by computing the minimal transversals of the hypergraph.Meanwhile,two optimization algorithms were designed to discard some useless states at the intermediary steps of the composition algorithm.The effectiveness of the composition method was tested by a set of experiments,in addition,an example regarding the travel services composition was also given.The experimental results show that this method not only can automatically generate composition tree whose leaf nodes correspond to services composition solutions,but also has better performance on execution time and solution quality by adopting two proposed optimization algorithms.
文摘In this paper, the initial boundary value problem of semilinear degenerate reaction-diffusion systems is studied. The regularization method and upper and lower solutions technique are employed to show the existence and continuation of a positive classical solution. The location of quenching points is found. The critical length is estimated by the eigenvalue method.
基金Project(50775089)supported by the National Natural Science Foundation of ChinaProject(2007AA04Z190,2009AA043301)supported by the National High Technology Research and Development Program of ChinaProject(2005CB724100)supported by the National Basic Research Program of China
文摘The material distribution routing problem in the manufacturing system is a complex combinatorial optimization problem and its main task is to deliver materials to the working stations with low cost and high efficiency. A multi-objective model was presented for the material distribution routing problem in mixed manufacturing systems, and it was solved by a hybrid multi-objective evolutionary algorithm (HMOEA). The characteristics of the HMOEA are as follows: 1) A route pool is employed to preserve the best routes for the population initiation; 2) A specialized best?worst route crossover (BWRC) mode is designed to perform the crossover operators for selecting the best route from Chromosomes 1 to exchange with the worst one in Chromosomes 2, so that the better genes are inherited to the offspring; 3) A route swap mode is used to perform the mutation for improving the convergence speed and preserving the better gene; 4) Local heuristics search methods are applied in this algorithm. Computational study of a practical case shows that the proposed algorithm can decrease the total travel distance by 51.66%, enhance the average vehicle load rate by 37.85%, cut down 15 routes and reduce a deliver vehicle. The convergence speed of HMOEA is faster than that of famous NSGA-II.
基金Foundation item： Supported by the National Natural Science Foundation of China（40537034）
文摘In this paper, a coupled elliptic-parabolic system modeling a class of engineering problems with thermal effect is studied. Existence of a weak solution is first established through a result of Meyers＇ theorem and Schauder fixed point theorem, where the coupled functions σ（s）,k（s） are assumed to be bounded in the C（IR×（0, T））. If σ（s）,k（s） are Lipschitz continuous we prove that solution is unique under some restriction on integrability of solution. The regularity of the solution in dimension n ≤ 2 is then analyzed under the assumptions on σ（s） ∈w^1,∞（Ω×（0, T）） and the boundedness of σ＇（s） and σ″（s）.
基金Supported by National Natural Science Foundation of China under Grant Nos. 11275017 and 11173028
文摘In this paper,the improved canonical quantization method of the self dual field is given in order to overcome linear combination problem about the second class constraint and the first class constraint number maximization problem in the Dirac method.In the improved canonical quantization method,there are no artificial linear combination and the first class constraint number maximization problems,at the same time,the stability of the system is considered.Therefore,the improved canonical quantization method is more natural and easier accepted by people than the usual Dirac method.We use the improved canonical quantization method to realize the canonical quantization of the self dual field,which has relation with string theory successfully and the results are equal to the results by using the Dirac method.
基金supported by the National Nature Science Foundation of China under Grant No.61203136the Natural Science Foundation of Hunan Province of China Grant Nos.2015JJ5021 and 2015JJ3064the Construct Program of the Key Discipline in Hunan Province
文摘This paper is focused on the H_(∞) control problem for linear systems with interval timevarying delays.By employing a reciprocally convex combination approach and a delay decomposition approach,some new delay-dependent bounded real lemmas(BRLs) are derived such that the closedloop system is asymptotically stable with a prescribed H_(∞) level.The BRLs are then used to solve the H_(∞) controller design by incorporating with the cone complementary approach.Three numerical examples are finally given to show the validity of the proposed method.
