Radial Basis Function Neural Network(RBFNN)ensembles have long suffered from non-efficient training,where incorrect parameter settings can be computationally disastrous.This paper examines different evolutionary algor...Radial Basis Function Neural Network(RBFNN)ensembles have long suffered from non-efficient training,where incorrect parameter settings can be computationally disastrous.This paper examines different evolutionary algorithms for training the Symbolic Radial Basis Function Neural Network(SRBFNN)through the behavior’s integration of satisfiability programming.Inspired by evolutionary algorithms,which can iteratively find the nearoptimal solution,different Evolutionary Algorithms(EAs)were designed to optimize the producer output weight of the SRBFNN that corresponds to the embedded logic programming 2Satisfiability representation(SRBFNN-2SAT).The SRBFNN’s objective function that corresponds to Satisfiability logic programming can be minimized by different algorithms,including Genetic Algorithm(GA),Evolution Strategy Algorithm(ES),Differential Evolution Algorithm(DE),and Evolutionary Programming Algorithm(EP).Each of these methods is presented in the steps in the flowchart form which can be used for its straightforward implementation in any programming language.With the use of SRBFNN-2SAT,a training method based on these algorithms has been presented,then training has been compared among algorithms,which were applied in Microsoft Visual C++software using multiple metrics of performance,including Mean Absolute Relative Error(MARE),Root Mean Square Error(RMSE),Mean Absolute Percentage Error(MAPE),Mean Bias Error(MBE),Systematic Error(SD),Schwarz Bayesian Criterion(SBC),and Central Process Unit time(CPU time).Based on the results,the EP algorithm achieved a higher training rate and simple structure compared with the rest of the algorithms.It has been confirmed that the EP algorithm is quite effective in training and obtaining the best output weight,accompanied by the slightest iteration error,which minimizes the objective function of SRBFNN-2SAT.展开更多
Suppose that f（x）=（f<sub>1</sub>（x）,....f<sub>r</sub>（x））<sup>T</sup>, x∈R<sup>d</sup> is a vector-valued function satisfying the refinement equation f（x）=∑&...Suppose that f（x）=（f<sub>1</sub>（x）,....f<sub>r</sub>（x））<sup>T</sup>, x∈R<sup>d</sup> is a vector-valued function satisfying the refinement equation f（x）=∑<sub> </sub>c<sub>k</sub> f（2x-k） with finite set of Z<sup>d</sup> and some r×r matricex c<sub>k</sub>. The requirements for f to have accuracy p are given in terms of the symbol function m（ξ）.展开更多
The concepts of complementary cofactor pairs, normal double-graphs and feasible torn vertex seta are introduced. By using them a decomposition theorem for first-order cofactor C(Y) is derived. Combining it with the mo...The concepts of complementary cofactor pairs, normal double-graphs and feasible torn vertex seta are introduced. By using them a decomposition theorem for first-order cofactor C(Y) is derived. Combining it with the modified double-graph method, a new decomposition analysis-modified double-graph decomposition analysis is presented for finding symbolic network functions. Its advantages are that the resultant symbolic expressions are compact and contain no cancellation terms, and its sign evaluation is very simple.展开更多
In this paper, symbolic code matrix ,constant matrix and count matrix are defined .The first twomatrices are used to describe the elemental expression of augmented matrix and the nede admittance equa-tion is thus obta...In this paper, symbolic code matrix ,constant matrix and count matrix are defined .The first twomatrices are used to describe the elemental expression of augmented matrix and the nede admittance equa-tion is thus obtained. The third matrix is used to obtain the incoming degree matrix, and according to thematrix all the 1- factors of the Coates graph are given. By using the data code, the determinant is expandedand the same items in the expansion are merged. Thus the symbolic network function in which no term can-cellation occurs is generated.展开更多
<Abstract>In a recent article [Cornmun.Theor.Phys.(Beijing,China) 47 (2007) 270],Cao et al.gave some nontrivial solutions of a Riccati equation by using symbolic and algebra computation.They took these solutions...<Abstract>In a recent article [Cornmun.Theor.Phys.(Beijing,China) 47 (2007) 270],Cao et al.gave some nontrivial solutions of a Riccati equation by using symbolic and algebra computation.They took these solutions,which are in the form of q-deformed hyperbolic and triangular functions as new solutions.In this comment,we will show that these solutions are just the special cases of some known solutions of the Riccati equation and thus they are not new solutions.展开更多
This work shows that each kind of Chebyshev polynomials may be calculated from a symbolic formula similar to the Lucas formula for Bernoulli polynomials. It exposes also a new approach for obtaining generating functio...This work shows that each kind of Chebyshev polynomials may be calculated from a symbolic formula similar to the Lucas formula for Bernoulli polynomials. It exposes also a new approach for obtaining generating functions of them by operator calculus built from the derivative and the positional operators.展开更多
This thesis intends to use the symbolic structure of cigar to analyze the extract Blackmail from Arthur Hailey's short novel Hotel.The function of cigar in Blackmail can be concluded as a) constructive clue of the...This thesis intends to use the symbolic structure of cigar to analyze the extract Blackmail from Arthur Hailey's short novel Hotel.The function of cigar in Blackmail can be concluded as a) constructive clue of the plot progression,b) genteel carrier in making up characters.Rotating around the constructive clue,cigar,the writer of this thesis breaks down the whole story into seven parts,i.e.mystical entrance,prelude,crossfire,preparatory victory,absolute superiority,negotiation (absence of cigar) and discard.As to cigar's function of making up character,this thesis examines it from four main social and historical aspects,i.e.the origin of cigar in history,the social token of cigar,the complicated approaches of using cigar,and the historical stereotypes related to cigar smoking.展开更多
In this paper,a function projective synchronization scheme is developed to investigate the function projec-tive synchronization between the discrete-time driven chaotic system and the discrete-time response chaotic sy...In this paper,a function projective synchronization scheme is developed to investigate the function projec-tive synchronization between the discrete-time driven chaotic system and the discrete-time response chaotic system.Withthe aid of symbolic-numeric computation,we use the scheme to study the function projective synchronization between2D Lorenz discrete-time system and Hénon discrete-time system,as well as that between 3D discrete-time hyperchaoticsystem and Hénon-like map via three scalar controllers,respectively.Moreover numerical simulations are used to verifythe effectiveness of the proposed scheme.展开更多
This paper is sequel to the authors paper [18]. By using the generalized Burchnall-Chaundy operator method, the authors are aiming at deriving certain decomposition formulas for some interesting special cases of Kampe...This paper is sequel to the authors paper [18]. By using the generalized Burchnall-Chaundy operator method, the authors are aiming at deriving certain decomposition formulas for some interesting special cases of Kampe de Feriets series of double hypergeometric series F;.展开更多
Adaptive digital filtering has traditionally been developed based on the minimum mean square error （MMSE） criterion and has found ever-increasing applications in communications. This paper presents an alternative ad...Adaptive digital filtering has traditionally been developed based on the minimum mean square error （MMSE） criterion and has found ever-increasing applications in communications. This paper presents an alternative adaptive filtering design based on the minimum symbol error rate （MSER） criterion for communication applications. It is shown that the MSER filtering is smarter, as it exploits the non-Gaussian distribution of filter output effectively. Consequently, it provides significant performance gain in terms of smaller symbol error over the MMSE approach. Adopting Parzen window or kernel density estimation for a probability density function, a block-data gradient adaptive MSER algorithm is derived. A stochastic gradient adaptive MSER algorithm, referred to as the least symbol error rate, is further developed for sample-by-sample adaptive implementation of the MSER filtering. Two applications, involving single-user channel equalization and beamforming assisted receiver, are included to demonstrate the effectiveness and generality of the proposed adaptive MSER filtering approach.展开更多
基金This work is supported by Ministry of Higher Education(MOHE)through Fundamental Research Grant Scheme(FRGS)(FRGS/1/2020/STG06/UTHM/03/7).
文摘Radial Basis Function Neural Network(RBFNN)ensembles have long suffered from non-efficient training,where incorrect parameter settings can be computationally disastrous.This paper examines different evolutionary algorithms for training the Symbolic Radial Basis Function Neural Network(SRBFNN)through the behavior’s integration of satisfiability programming.Inspired by evolutionary algorithms,which can iteratively find the nearoptimal solution,different Evolutionary Algorithms(EAs)were designed to optimize the producer output weight of the SRBFNN that corresponds to the embedded logic programming 2Satisfiability representation(SRBFNN-2SAT).The SRBFNN’s objective function that corresponds to Satisfiability logic programming can be minimized by different algorithms,including Genetic Algorithm(GA),Evolution Strategy Algorithm(ES),Differential Evolution Algorithm(DE),and Evolutionary Programming Algorithm(EP).Each of these methods is presented in the steps in the flowchart form which can be used for its straightforward implementation in any programming language.With the use of SRBFNN-2SAT,a training method based on these algorithms has been presented,then training has been compared among algorithms,which were applied in Microsoft Visual C++software using multiple metrics of performance,including Mean Absolute Relative Error(MARE),Root Mean Square Error(RMSE),Mean Absolute Percentage Error(MAPE),Mean Bias Error(MBE),Systematic Error(SD),Schwarz Bayesian Criterion(SBC),and Central Process Unit time(CPU time).Based on the results,the EP algorithm achieved a higher training rate and simple structure compared with the rest of the algorithms.It has been confirmed that the EP algorithm is quite effective in training and obtaining the best output weight,accompanied by the slightest iteration error,which minimizes the objective function of SRBFNN-2SAT.
文摘Suppose that f（x）=（f<sub>1</sub>（x）,....f<sub>r</sub>（x））<sup>T</sup>, x∈R<sup>d</sup> is a vector-valued function satisfying the refinement equation f（x）=∑<sub> </sub>c<sub>k</sub> f（2x-k） with finite set of Z<sup>d</sup> and some r×r matricex c<sub>k</sub>. The requirements for f to have accuracy p are given in terms of the symbol function m（ξ）.
基金The project partially supported by National Natural Science Foundation of China under Grant No. 10471143 and the State 973 Project under Grant No. 2004CB318001 The authors are very grateful to Prof. Hong-Bo Li, Yong Chen, Zhen-Ya Yan, and Zhuo-Sheng Lii for their kind help and valuable suggestions. They also thank Prof. En-Gui Fan and Prof. Chun-Ping Liu for their constructive suggestions about the solutions of Riccati equation.
文摘The concepts of complementary cofactor pairs, normal double-graphs and feasible torn vertex seta are introduced. By using them a decomposition theorem for first-order cofactor C(Y) is derived. Combining it with the modified double-graph method, a new decomposition analysis-modified double-graph decomposition analysis is presented for finding symbolic network functions. Its advantages are that the resultant symbolic expressions are compact and contain no cancellation terms, and its sign evaluation is very simple.
基金The Project Supported by National Natural Science Foundation of China
文摘In this paper, symbolic code matrix ,constant matrix and count matrix are defined .The first twomatrices are used to describe the elemental expression of augmented matrix and the nede admittance equa-tion is thus obtained. The third matrix is used to obtain the incoming degree matrix, and according to thematrix all the 1- factors of the Coates graph are given. By using the data code, the determinant is expandedand the same items in the expansion are merged. Thus the symbolic network function in which no term can-cellation occurs is generated.
基金supported by National Natural Science Foundation of China under Grant No.10671172the Natural Science Foundation of Jiangsu Province under Grant No.BK2006064
文摘<Abstract>In a recent article [Cornmun.Theor.Phys.(Beijing,China) 47 (2007) 270],Cao et al.gave some nontrivial solutions of a Riccati equation by using symbolic and algebra computation.They took these solutions,which are in the form of q-deformed hyperbolic and triangular functions as new solutions.In this comment,we will show that these solutions are just the special cases of some known solutions of the Riccati equation and thus they are not new solutions.
文摘This work shows that each kind of Chebyshev polynomials may be calculated from a symbolic formula similar to the Lucas formula for Bernoulli polynomials. It exposes also a new approach for obtaining generating functions of them by operator calculus built from the derivative and the positional operators.
文摘This thesis intends to use the symbolic structure of cigar to analyze the extract Blackmail from Arthur Hailey's short novel Hotel.The function of cigar in Blackmail can be concluded as a) constructive clue of the plot progression,b) genteel carrier in making up characters.Rotating around the constructive clue,cigar,the writer of this thesis breaks down the whole story into seven parts,i.e.mystical entrance,prelude,crossfire,preparatory victory,absolute superiority,negotiation (absence of cigar) and discard.As to cigar's function of making up character,this thesis examines it from four main social and historical aspects,i.e.the origin of cigar in history,the social token of cigar,the complicated approaches of using cigar,and the historical stereotypes related to cigar smoking.
基金National Natural Science Foundation of China under Grant No.10735030Shanghai Leading Academic Discipline Project under Grant No.B412+3 种基金Natural Science Foundation of Zhejiang Province of China under Grant No.Y604056the Doctoral Foundation of Ningbo City under Grant No.2005A61030the Program for Changjiang Scholars and Innovative Research Team in Universities under Grant No.IRT0734K.C.Wong Magna Fund in Ningbo University
文摘In this paper,a function projective synchronization scheme is developed to investigate the function projec-tive synchronization between the discrete-time driven chaotic system and the discrete-time response chaotic system.Withthe aid of symbolic-numeric computation,we use the scheme to study the function projective synchronization between2D Lorenz discrete-time system and Hénon discrete-time system,as well as that between 3D discrete-time hyperchaoticsystem and Hénon-like map via three scalar controllers,respectively.Moreover numerical simulations are used to verifythe effectiveness of the proposed scheme.
文摘This paper is sequel to the authors paper [18]. By using the generalized Burchnall-Chaundy operator method, the authors are aiming at deriving certain decomposition formulas for some interesting special cases of Kampe de Feriets series of double hypergeometric series F;.
文摘Adaptive digital filtering has traditionally been developed based on the minimum mean square error （MMSE） criterion and has found ever-increasing applications in communications. This paper presents an alternative adaptive filtering design based on the minimum symbol error rate （MSER） criterion for communication applications. It is shown that the MSER filtering is smarter, as it exploits the non-Gaussian distribution of filter output effectively. Consequently, it provides significant performance gain in terms of smaller symbol error over the MMSE approach. Adopting Parzen window or kernel density estimation for a probability density function, a block-data gradient adaptive MSER algorithm is derived. A stochastic gradient adaptive MSER algorithm, referred to as the least symbol error rate, is further developed for sample-by-sample adaptive implementation of the MSER filtering. Two applications, involving single-user channel equalization and beamforming assisted receiver, are included to demonstrate the effectiveness and generality of the proposed adaptive MSER filtering approach.
