In this paper,we study the extremal problem on Cartan-egg domain of the first type by using some inequalities.The extremal mapping and extremal value between the first type of Cartan-egg domain and the unit ball when ...In this paper,we study the extremal problem on Cartan-egg domain of the first type by using some inequalities.The extremal mapping and extremal value between the first type of Cartan-egg domain and the unit ball when k≤1 and k=2,m=2 are constructed.展开更多
In this paper we consider two problems. The first is connected with the optimal recovery of functions satisfyiog boundary conditions. The second is the characterization of the unique func- tion whose r-th derivative h...In this paper we consider two problems. The first is connected with the optimal recovery of functions satisfyiog boundary conditions. The second is the characterization of the unique func- tion whose r-th derivative has minimum L_∞-norm, taking given values of alternating signs and satis fying boundary conditions.展开更多
The permutation flowshop scheduling problem （PFSP） is one of the most well-known and well-studied production scheduling problems with strong industrial background. This paper presents a new hybrid optimization algor...The permutation flowshop scheduling problem （PFSP） is one of the most well-known and well-studied production scheduling problems with strong industrial background. This paper presents a new hybrid optimization algorithm which combines the strong global search ability of artificial immune system （AIS） with a strong local search ability of extremal optimization （EO） algorithm. The proposed algorithm is applied to a set of benchmark problems with a makespan criterion. Performance of the algorithm is evaluated. Comparison results indicate that this new method is an effective and competitive approach to the PFSP.展开更多
Let be an undirected graph. The maximum cycle packing problem in G then is to find a collection of edge-disjoint cycles C<sub>i</sup>in G such that s is maximum. In general, the maximum cycle packing probl...Let be an undirected graph. The maximum cycle packing problem in G then is to find a collection of edge-disjoint cycles C<sub>i</sup>in G such that s is maximum. In general, the maximum cycle packing problem is NP-hard. In this paper, it is shown for even graphs that if such a collection satisfies the condition that it minimizes the quantityon the set of all edge-disjoint cycle collections, then it is a maximum cycle packing. The paper shows that the determination of such a packing can be solved by a dynamic programming approach. For its solution, an-shortest path procedure on an appropriate acyclic networkis presented. It uses a particular monotonous node potential.展开更多
Double parallel forward neural network （DPFNN） model is a mixture structure of single-layer perception and single-hidden-layer forward neural network （SLFN）. In this paper, by making use of the idea of online sequ...Double parallel forward neural network （DPFNN） model is a mixture structure of single-layer perception and single-hidden-layer forward neural network （SLFN）. In this paper, by making use of the idea of online sequential extreme learning machine （OS-ELM） on DPFNN, we derive the online sequential double parallel extreme learning machine algorithm （OS-DPELM）. Compared to other similar algorithms, our algorithms can achieve approximate learning performance with fewer numbers of hidden units, as well as the parameters to be determined. The experimental results show that the proposed algorithm has good generalization performance for real world classification problems, and thus can be a necessary and beneficial complement to OS-ELM.展开更多
粒子群优化(PSO)算法是一种新兴的群体智能优化技术,由于其原理简单、参数少、效果好等优点已经广泛应用于求解各类复杂优化问题.而影响该算法收敛速度和精度的2个主要因素是粒子个体极值与全局极值的更新方式.通过分析粒子的飞行轨迹...粒子群优化(PSO)算法是一种新兴的群体智能优化技术,由于其原理简单、参数少、效果好等优点已经广泛应用于求解各类复杂优化问题.而影响该算法收敛速度和精度的2个主要因素是粒子个体极值与全局极值的更新方式.通过分析粒子的飞行轨迹和引入广义中心粒子和狭义中心粒子,提出双中心粒子群优化(double center particle swarm optimization,DCPSO)算法,在不增加算法复杂度条件下对粒子的个体极值和全局极值更新方式进行更新,从而改善了算法的收敛速度和精度.采用Rosenbrock和Rastrigrin等6个经典测试函数,按照固定迭达次数和固定时间长度运行2种方式进行测试,验证了新算法的可行性和有效性.展开更多
基金Supported by the SF of Jiangsu Province Education(07KJB110115)
文摘In this paper,we study the extremal problem on Cartan-egg domain of the first type by using some inequalities.The extremal mapping and extremal value between the first type of Cartan-egg domain and the unit ball when k≤1 and k=2,m=2 are constructed.
基金Partially supported by Ministry of Science under Project MM--414.
文摘In this paper we consider two problems. The first is connected with the optimal recovery of functions satisfyiog boundary conditions. The second is the characterization of the unique func- tion whose r-th derivative has minimum L_∞-norm, taking given values of alternating signs and satis fying boundary conditions.
基金Project supported by the National Natural Science Foundation of China （Grant No.60574063）
文摘The permutation flowshop scheduling problem （PFSP） is one of the most well-known and well-studied production scheduling problems with strong industrial background. This paper presents a new hybrid optimization algorithm which combines the strong global search ability of artificial immune system （AIS） with a strong local search ability of extremal optimization （EO） algorithm. The proposed algorithm is applied to a set of benchmark problems with a makespan criterion. Performance of the algorithm is evaluated. Comparison results indicate that this new method is an effective and competitive approach to the PFSP.
文摘Let be an undirected graph. The maximum cycle packing problem in G then is to find a collection of edge-disjoint cycles C<sub>i</sup>in G such that s is maximum. In general, the maximum cycle packing problem is NP-hard. In this paper, it is shown for even graphs that if such a collection satisfies the condition that it minimizes the quantityon the set of all edge-disjoint cycle collections, then it is a maximum cycle packing. The paper shows that the determination of such a packing can be solved by a dynamic programming approach. For its solution, an-shortest path procedure on an appropriate acyclic networkis presented. It uses a particular monotonous node potential.
基金Supported by the National Natural Science Foundation of China(Grant Nos.1140107661473328+1 种基金1117136761473059)
文摘Double parallel forward neural network （DPFNN） model is a mixture structure of single-layer perception and single-hidden-layer forward neural network （SLFN）. In this paper, by making use of the idea of online sequential extreme learning machine （OS-ELM） on DPFNN, we derive the online sequential double parallel extreme learning machine algorithm （OS-DPELM）. Compared to other similar algorithms, our algorithms can achieve approximate learning performance with fewer numbers of hidden units, as well as the parameters to be determined. The experimental results show that the proposed algorithm has good generalization performance for real world classification problems, and thus can be a necessary and beneficial complement to OS-ELM.
文摘粒子群优化(PSO)算法是一种新兴的群体智能优化技术,由于其原理简单、参数少、效果好等优点已经广泛应用于求解各类复杂优化问题.而影响该算法收敛速度和精度的2个主要因素是粒子个体极值与全局极值的更新方式.通过分析粒子的飞行轨迹和引入广义中心粒子和狭义中心粒子,提出双中心粒子群优化(double center particle swarm optimization,DCPSO)算法,在不增加算法复杂度条件下对粒子的个体极值和全局极值更新方式进行更新,从而改善了算法的收敛速度和精度.采用Rosenbrock和Rastrigrin等6个经典测试函数,按照固定迭达次数和固定时间长度运行2种方式进行测试,验证了新算法的可行性和有效性.
基金This paper was partly supported by National Outstanding Young Investigator Grant (70225005) of National Natural Science Foundation of China and Teaching & Research Award Program for Outstanding Young Teachers (2001) in Higher Education Institutions of Ministry of Education, China.
