Four layer feedforward regular fuzzy neural networks are constructed. Universal approximations to some continuous fuzzy functions defined on F 0 (R) n by the four layer fuzzy neural networks are shown. At f...Four layer feedforward regular fuzzy neural networks are constructed. Universal approximations to some continuous fuzzy functions defined on F 0 (R) n by the four layer fuzzy neural networks are shown. At first,multivariate Bernstein polynomials associated with fuzzy valued functions are empolyed to approximate continuous fuzzy valued functions defined on each compact set of R n . Secondly,by introducing cut preserving fuzzy mapping,the equivalent conditions for continuous fuzzy functions that can be arbitrarily closely approximated by regular fuzzy neural networks are shown. Finally a few of sufficient and necessary conditions for characterizing approximation capabilities of regular fuzzy neural networks are obtained. And some concrete fuzzy functions demonstrate our conclusions.展开更多
In computer aided geometric design （CAGD）, B′ezier-like bases receive more andmore considerations as new modeling tools in recent years. But those existing B′ezier-like basesare all defined over the rectangular do...In computer aided geometric design （CAGD）, B′ezier-like bases receive more andmore considerations as new modeling tools in recent years. But those existing B′ezier-like basesare all defined over the rectangular domain. In this paper, we extend the algebraic trigono-metric B′ezier-like basis of order 4 to the triangular domain. The new basis functions definedover the triangular domain are proved to fulfill non-negativity, partition of unity, symmetry,boundary representation, linear independence and so on. We also prove some properties of thecorresponding B′ezier-like surfaces. Finally, some applications of the proposed basis are shown.展开更多
In computer aided geometric design(CAGD),the Bernstein-Bézier system for polynomial space including the triangular domain is an important tool for modeling free form shapes.The Bernstein-like bases for other spac...In computer aided geometric design(CAGD),the Bernstein-Bézier system for polynomial space including the triangular domain is an important tool for modeling free form shapes.The Bernstein-like bases for other spaces(trigonometric polynomial,hyperbolic polynomial,or blended space) has also been studied.However,none of them was extended to the triangular domain.In this paper,we extend the linear trigonometric polynomial basis to the triangular domain and obtain a new Bernstein-like basis,which is linearly independent and satisfies positivity,partition of unity,symmetry,and boundary represen-tation.We prove some properties of the corresponding surfaces,including differentiation,subdivision,convex hull,and so forth.Some applications are shown.展开更多
This paper is devoted to find the numerical solutions of one dimensional general nonlinear system of third-order boundary value problems (BVPs) for the pair of functions using Galerkin weighted residual method. We der...This paper is devoted to find the numerical solutions of one dimensional general nonlinear system of third-order boundary value problems (BVPs) for the pair of functions using Galerkin weighted residual method. We derive mathematical formulations in matrix form, in detail, by exploiting Bernstein polynomials as basis functions. A reasonable accuracy is found when the proposed method is used on few examples. At the end of the study, a comparison is made between the approximate and exact solutions, and also with the solutions of the existing methods. Our results converge monotonically to the exact solutions. In addition, we show that the derived formulations may be applicable by reducing higher order complicated BVP into a lower order system of BVPs, and the performance of the numerical solutions is satisfactory. .展开更多
In this paper, Bézier basis with shape parameter is constructed by an integral approach. Based on this basis, we define the Bézier curves with shape parameter. The Bézier basis curves with shape paramet...In this paper, Bézier basis with shape parameter is constructed by an integral approach. Based on this basis, we define the Bézier curves with shape parameter. The Bézier basis curves with shape parameter have most properties of Bernstein basis and the Bézier curves. Moreover the shape parameter can adjust the curves’ shape with the same control polygon. As the increase of the shape parameter, the Bézier curves with shape parameter approximate to the control polygon. In the last, the Bézier surface with shape parameter is also constructed and it has most properties of Bézier surface.展开更多
In order to improve performance and security of image encryption algorithm effectively based on chaotic sequences, an extended chaotic sequence generating method is presented based on logistic chaotic system using Ber...In order to improve performance and security of image encryption algorithm effectively based on chaotic sequences, an extended chaotic sequence generating method is presented based on logistic chaotic system using Bernstein form Bézier curve generating algorithm. In order to test the pseudorandom performance of the extended chaotic sequence, we also analyze random performance, autocorrelation performance, and balance performance of the extended chaotic sequence. Simulation results show that the extended chaotic sequence generated using our method is pseudorandom and its correlation performance and balance performance are good. As an application, we apply the extended chaotic sequence in image encryption algorithm, the simulation results show that the performance of the encrypted image using our method is better than that using logistic chaotic sequence.展开更多
In this paper, an improved algorithm is proposed for unconstrained global optimization to tackle non-convex nonlinear multivariate polynomial programming problems. The proposed algorithm is based on the Bernstein poly...In this paper, an improved algorithm is proposed for unconstrained global optimization to tackle non-convex nonlinear multivariate polynomial programming problems. The proposed algorithm is based on the Bernstein polynomial approach. Novel features of the proposed algorithm are that it uses a new rule for the selection of the subdivision point, modified rules for the selection of the subdivision direction, and a new acceleration device to avoid some unnecessary subdivisions. The performance of the proposed algorithm is numerically tested on a collection of 16 test problems. The results of the tests show the proposed algorithm to be superior to the existing Bernstein algorithm in terms of the chosen performance metrics.展开更多
By using the blossom approach, we construct four new cubic rational Bernsteinlike basis functions with two shape parameters, which form a normalized B-basis and include the cubic Bernstein basis and the cubic Said-Bal...By using the blossom approach, we construct four new cubic rational Bernsteinlike basis functions with two shape parameters, which form a normalized B-basis and include the cubic Bernstein basis and the cubic Said-Ball basis as special cases. Based on the new basis, we propose a class of C2 continuous cubic rational B-spline-like basis functions with two local shape parameters, which includes the cubic non-uniform B-spline basis as a special case.Their totally positive property is proved. In addition, we extend the cubic rational Bernsteinlike basis to a triangular domain which has three shape parameters and includes the cubic triangular Bernstein-B′ezier basis and the cubic triangular Said-Ball basis as special cases. The G1 continuous conditions are deduced for the joining of two patches. The shape parameters in the bases serve as tension parameters and play a foreseeable adjusting role on generating curves and patches.展开更多
Suppose that we want to approximate fC[0,1]by polynomials in P_n,using only its values on X_n={i/n,0≤i≤n}.This can be done by the Lagrange interpolant L_n f or the classical Bernstein polynomial B_n f.But,when n ten...Suppose that we want to approximate fC[0,1]by polynomials in P_n,using only its values on X_n={i/n,0≤i≤n}.This can be done by the Lagrange interpolant L_n f or the classical Bernstein polynomial B_n f.But,when n tends to infinity,L_n f does not converge to f in general and the convergence of B_n f to fis very slow.We define a family of operators B^(k)_n, n≥k,which are intermediate ones between B(0)_n=B^(1)_n=B_n and B^(n)_n=L_n,and we study some of their properties.In particular,we prove a Voronovskaja-type theorem which asserts that B^(k)_n f-f=0(n^(-[(k+2)/2))for f sufficiently regular. Moreover,B(k)_n f uses only values of B_n f and its derivaties and can be computed by De Casteljau or subdivision algorithms.展开更多
基金This work was supported by National Natural Science Foundation(699740 4 1 699740 0 6)
文摘Four layer feedforward regular fuzzy neural networks are constructed. Universal approximations to some continuous fuzzy functions defined on F 0 (R) n by the four layer fuzzy neural networks are shown. At first,multivariate Bernstein polynomials associated with fuzzy valued functions are empolyed to approximate continuous fuzzy valued functions defined on each compact set of R n . Secondly,by introducing cut preserving fuzzy mapping,the equivalent conditions for continuous fuzzy functions that can be arbitrarily closely approximated by regular fuzzy neural networks are shown. Finally a few of sufficient and necessary conditions for characterizing approximation capabilities of regular fuzzy neural networks are obtained. And some concrete fuzzy functions demonstrate our conclusions.
基金Supported by the National Natural Science Foundation of China( 60933008,60970079)
文摘In computer aided geometric design （CAGD）, B′ezier-like bases receive more andmore considerations as new modeling tools in recent years. But those existing B′ezier-like basesare all defined over the rectangular domain. In this paper, we extend the algebraic trigono-metric B′ezier-like basis of order 4 to the triangular domain. The new basis functions definedover the triangular domain are proved to fulfill non-negativity, partition of unity, symmetry,boundary representation, linear independence and so on. We also prove some properties of thecorresponding B′ezier-like surfaces. Finally, some applications of the proposed basis are shown.
基金supported by the National Natural Science Foundation of China (Nos.60773179,60933008,and 60970079)the National Basic Research Program (973) of China (No.2004CB318000)the China Hungary Joint Project (No.CHN21/2006)
文摘In computer aided geometric design(CAGD),the Bernstein-Bézier system for polynomial space including the triangular domain is an important tool for modeling free form shapes.The Bernstein-like bases for other spaces(trigonometric polynomial,hyperbolic polynomial,or blended space) has also been studied.However,none of them was extended to the triangular domain.In this paper,we extend the linear trigonometric polynomial basis to the triangular domain and obtain a new Bernstein-like basis,which is linearly independent and satisfies positivity,partition of unity,symmetry,and boundary represen-tation.We prove some properties of the corresponding surfaces,including differentiation,subdivision,convex hull,and so forth.Some applications are shown.
文摘This paper is devoted to find the numerical solutions of one dimensional general nonlinear system of third-order boundary value problems (BVPs) for the pair of functions using Galerkin weighted residual method. We derive mathematical formulations in matrix form, in detail, by exploiting Bernstein polynomials as basis functions. A reasonable accuracy is found when the proposed method is used on few examples. At the end of the study, a comparison is made between the approximate and exact solutions, and also with the solutions of the existing methods. Our results converge monotonically to the exact solutions. In addition, we show that the derived formulations may be applicable by reducing higher order complicated BVP into a lower order system of BVPs, and the performance of the numerical solutions is satisfactory. .
基金Project supported by the National Natural Science Foundation of China (No. 10371110) and the National Basic Research Program (973)of China (No. G2002CB12101)
文摘In this paper, Bézier basis with shape parameter is constructed by an integral approach. Based on this basis, we define the Bézier curves with shape parameter. The Bézier basis curves with shape parameter have most properties of Bernstein basis and the Bézier curves. Moreover the shape parameter can adjust the curves’ shape with the same control polygon. As the increase of the shape parameter, the Bézier curves with shape parameter approximate to the control polygon. In the last, the Bézier surface with shape parameter is also constructed and it has most properties of Bézier surface.
基金the National Natural Science Foundation of China (No. 60572133)the Scientific Research Fund of Education Department of Shaanxi Province (No.06JK193)
文摘In order to improve performance and security of image encryption algorithm effectively based on chaotic sequences, an extended chaotic sequence generating method is presented based on logistic chaotic system using Bernstein form Bézier curve generating algorithm. In order to test the pseudorandom performance of the extended chaotic sequence, we also analyze random performance, autocorrelation performance, and balance performance of the extended chaotic sequence. Simulation results show that the extended chaotic sequence generated using our method is pseudorandom and its correlation performance and balance performance are good. As an application, we apply the extended chaotic sequence in image encryption algorithm, the simulation results show that the performance of the encrypted image using our method is better than that using logistic chaotic sequence.
文摘In this paper, an improved algorithm is proposed for unconstrained global optimization to tackle non-convex nonlinear multivariate polynomial programming problems. The proposed algorithm is based on the Bernstein polynomial approach. Novel features of the proposed algorithm are that it uses a new rule for the selection of the subdivision point, modified rules for the selection of the subdivision direction, and a new acceleration device to avoid some unnecessary subdivisions. The performance of the proposed algorithm is numerically tested on a collection of 16 test problems. The results of the tests show the proposed algorithm to be superior to the existing Bernstein algorithm in terms of the chosen performance metrics.
基金Supported by the National Natural Science Foundation of China(60970097 and 11271376)Postdoctoral Science Foundation of China(2015M571931)Graduate Students Scientific Research Innovation Project of Hunan Province(CX2012B111)
文摘By using the blossom approach, we construct four new cubic rational Bernsteinlike basis functions with two shape parameters, which form a normalized B-basis and include the cubic Bernstein basis and the cubic Said-Ball basis as special cases. Based on the new basis, we propose a class of C2 continuous cubic rational B-spline-like basis functions with two local shape parameters, which includes the cubic non-uniform B-spline basis as a special case.Their totally positive property is proved. In addition, we extend the cubic rational Bernsteinlike basis to a triangular domain which has three shape parameters and includes the cubic triangular Bernstein-B′ezier basis and the cubic triangular Said-Ball basis as special cases. The G1 continuous conditions are deduced for the joining of two patches. The shape parameters in the bases serve as tension parameters and play a foreseeable adjusting role on generating curves and patches.
文摘Suppose that we want to approximate fC[0,1]by polynomials in P_n,using only its values on X_n={i/n,0≤i≤n}.This can be done by the Lagrange interpolant L_n f or the classical Bernstein polynomial B_n f.But,when n tends to infinity,L_n f does not converge to f in general and the convergence of B_n f to fis very slow.We define a family of operators B^(k)_n, n≥k,which are intermediate ones between B(0)_n=B^(1)_n=B_n and B^(n)_n=L_n,and we study some of their properties.In particular,we prove a Voronovskaja-type theorem which asserts that B^(k)_n f-f=0(n^(-[(k+2)/2))for f sufficiently regular. Moreover,B(k)_n f uses only values of B_n f and its derivaties and can be computed by De Casteljau or subdivision algorithms.
