Bilateral generating functions and operational methods

Bilateral generating functions are those involving products of different types of polynomials. We show that operational methods offer a powerful tool to derive these families of generating functions. We study cases relevant to products of Hermite polynomials with Laguerre, Legendre and other polynomials. We also propose further extensions of the method which we develop here.     

Identity principles for commuting holomorphic self-maps of the unit disc

Let f,g be two commuting holomorphic self-maps of the unit disc. If f and g agree at the common Wolff point up to a certain order of derivatives (no more than 3 if the Wolff point is on the unit circle), then f≡g.     

一种新的奇偶非线性相干态的位相统计性质

根据Pegg-Barnett位相定义, 计算了一种新的奇偶非线性相干态的位相概率分布函数, 利用数值计算方法研究了它们的位相统计性质. 数值计算结果表明：新的奇偶非线性相干态的位相特性与通常奇偶相干态的位相特性截然不同.     

Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields

Gauss periods give an exponentiation algorithm that is fast for many finite fields but slow for many other fields. The current paper presents a different method for construction of elements that yield a fast exponentiation algorithm for finite fields where the Gauss period method is slow or does not work. The basic idea is to use elements of low multiplicative order and search for primitive elements that are binomial or trinomial of these elements. Computational experiments indicate that such primitive elements exist, and it is shown that they can be exponentiated fast.     

网络展开图与符号网络分析

采用封闭网络模型,按照电路元件参数,采用开路、短路和着色运算,将电路图逐层分解,得到网络展开图.给出网络展开图的概念和运算规则,指出网络展开图中从根到末稍每个路径的值就是网络行列式展开式中的一个有效项,从而由网络展开图得到符号网络函数.该方法直接对电路图进行运算,不需要建立任何形式的电路方程和行列式,适用于一般的有源电路,而且能生成各种类型的网络函数.     

Neural Computation of the MoM Matrix Elements for Planar Configurations

In this paper a new artificial neural network (ANN) based model for the calculation of the method of moments (MoM) matrix elements is presented. Training sets that characterize the matrix elements are first constructed. These sets are then utilized to effectively train two radial basis function (RBF) neural networks to accurately estimate all the elements of the MoM matrix for any mesh used. The potential of the proposed approach is demonstrated in the case of a narrow microstrip line. The current distribution on the microstrip line produced by the trained RBF networks agrees very well with the exact distribution. In addition, the proposed ANN model is much faster than the conventional MoM procedure.     

凸域内单叶函数的导数

设函数f（w）为凸区域D内的单叶解析函数,对于2≤n≤8和所有w∈D,本文得到估计式|f（n）（w）/f＇（w）|的精确上界.这个结果推广了一些已知的结论.     

On a class of new and practical performance indexes for approximation of fold bifurcations of nonlinear power flow equations

Efficient measurement of the performance index (the distance of a loading parameter from the voltage collapse point) is one of the key problems in power system operations and planning and such an index indicates the severity of a power system with regard to voltage collapse. There exist many interesting methods and ideas to compute this index. However, some successful methods are not yet mathematically justified while other mathematically sound methods are often proposed directly based on the bifurcation theory and they require the initial stationary state to be too close to the unknown turning point to make the underlying methods practical.This paper first gives a survey of several popular methods for estimating the fold bifurcation point including the continuation methods, bifurcation methods and the test function methods (Seydel's direct solution methods, the tangent vector methods and the reduced Jacobian method) and discuss their relative advantages and problems. Test functions are usually based on scaling of the determinant of the Jacobian matrix and it is generally not clear how to determine the behaviour of such functions. As the underlying nonlinear equations are of a particular type, this allows us to do a new analysis of the determinants of the Jacobian and its submatrices in this paper. Following the analysis, we demonstrate how to construct a class of test functions with a predictable analytical behaviour so that a suitable index can be produced. Finally, examples of two test functions from this class are proposed. For several standard IEEE test systems, promising numerical results have been achieved.     

On bent functions with some symmetric properties

This paper discusses a kind of bent functions that have some symmetric properties about some variables. Section 2 mainly discusses the bent functions symmetric about some two variables and gives the necessary and sufficient condition for these functions. Section 3 gives algebraic expressions of some bent functions.     

最速下降规则不失为一可用规则

本从统计意义上平均迭代次数的观点出发，指出求解线性规划的最速下降规则是可取的，好用的。