On computation of the greatest common divisor of several polynomials over a finite field

We propose a probabilistic algorithm to reduce computing the greatest common divisor of m polynomials over a finite field (which requires computing m−1 pairwise greatest common divisors) to computing the greatest common divisor of two polynomials over the same field.     

两相同部件温贮备可修的人机系统解的性质分析

本文首先用强连续算子半群理论证明了两相同部件温贮备可修的人机系统动态非负解的存在唯一性 ,然后证明了 0是系统主算子的本征值 ,并得到 0本征值对应的本征向量是正的 ,从而系统存在稳态正解 .     

Sets of sampling and interpolation in Bergman spaces

Properties of the unions of sampling and interpolation sets for Bergman spaces are discussed in conjunction with the examples given by Seip (1993). Their relationship to the classical interpolation sequences is explored. In addition, the role played by canonical divisors in the study of these sets is examined and an example of a sampling set is constructed in the disk.

     

Persistence of Floquet invariant tori for a class of non-conservative dynamical systems

In this paper we consider a class of non-conservative dynamical system with small perturbation. By the KAM method we prove existence of Floquet invariant tori under the weakest non-resonant conditions.

     

An Implicit Iteration Process with Errors for a Finite Family of r-strictly Asymptotically Pseudocontractive Mappings

In this paper,we will establish several strong convergence theorems for the approximation ofcommon fixed points of r-strictly asymptotically pseudocontractive mappings in uniformly convex Banachspaces using the modiied implicit iteration sequence with errors,and prove the necessary and sufficient conditionsfor the convergence of the sequence.Our results generalize,extend and improve the recent work,in thistopic.     

斐索梯度折射率光纤透镜传感实验

采用LD泵浦的单纵模Nd：YVO4倍频激光器、梯度折射率光纤透镜等器件构成斐索梯度折射率光纤透镜传感实验仪．本文介绍了实验装置和实验原理，并给出了实验结果。     

Capacity Constrained Transit Assignment with Common Lines

This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking common lines into account. The approach handles congested transit networks, where some passengers will not be able to board because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example. This revised version was published online in July 2006 with corrections to the Cover Date.     

凸度量空间中单值和集值映象的公共不动点定理

§ 1.　Introduction　　Anecessaryandsufficientconditionandasufficientconditiontoensurethataset valuedmappingandasingle valuedmappinginacompletemetricspaceandacompleteconvexmetricspacehavingacommonfixedpointarerespectivelygivenin [1 ] .Meanwhilethemainresultsin[2 ]— [5]areimprovedandextendedin [1 ] .Inthispaper ,theexistenceatcommonfixedpointsoftwoset valuedmappingandasing valuedmappingwerestudied ,andthecorrespond ingresultsin [1 ]— [5]wereextendedandimproved .Let(X ,d)beanon emptymetricspa…     

Nonlinear Time Series Analysis Since 1990:Some Personal Reflections

Abstract I reflect upon the development of nonlinear time series analysis since 1990 by focusing on five majorareas of development. These areas include the interface between nonlinear time series analysis and chaos,thenonparametric/semiparametric approach,nonlinear state space modelling,financial time series and nonlinearmodelling of panels of time series.     

Degree distribution of the greatest common divisor of polynomials over 𝔽q

We study the degree distribution of the greatest common divisor of two or more random polynomials over a finite field ??_q. We provide estimates for several parameters like number of distinct common irreducible factors, number of irreducible factors counting repetitions, and total degree of the gcd of two or more polynomials. We show that the limiting distribution of a random variable counting the total degree of the gcd is geometric and that the distributions of random variables counting the number of common factors (with and without repetitions) are very close to Poisson distributions when q is large. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006