首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1036篇
  免费   50篇
  国内免费   98篇
化学   87篇
力学   8篇
综合类   24篇
数学   945篇
物理学   120篇
  2024年   1篇
  2023年   8篇
  2022年   20篇
  2021年   14篇
  2020年   29篇
  2019年   23篇
  2018年   21篇
  2017年   23篇
  2016年   32篇
  2015年   9篇
  2014年   43篇
  2013年   95篇
  2012年   26篇
  2011年   48篇
  2010年   33篇
  2009年   65篇
  2008年   73篇
  2007年   83篇
  2006年   67篇
  2005年   54篇
  2004年   51篇
  2003年   45篇
  2002年   52篇
  2001年   39篇
  2000年   36篇
  1999年   36篇
  1998年   34篇
  1997年   19篇
  1996年   13篇
  1995年   10篇
  1994年   9篇
  1993年   9篇
  1992年   8篇
  1991年   5篇
  1990年   5篇
  1989年   3篇
  1988年   3篇
  1987年   2篇
  1985年   3篇
  1984年   8篇
  1983年   5篇
  1982年   2篇
  1981年   2篇
  1980年   2篇
  1979年   6篇
  1978年   4篇
  1977年   3篇
  1970年   2篇
  1959年   1篇
排序方式: 共有1184条查询结果,搜索用时 0 毫秒
81.
The Somos 5 sequences are a family of sequences defined by a fifth order bilinear recurrence relation with constant coefficients. For particular choices of coefficients and initial data, integer sequences arise. By making the connection with a second order nonlinear mapping with a first integral, we prove that the two subsequences of odd/even index terms each satisfy a Somos 4 (fourth order) recurrence. This leads directly to the explicit solution of the initial value problem for the Somos 5 sequences in terms of the Weierstrass sigma function for an associated elliptic curve.

  相似文献   

82.
A tight Heffter array is an matrix with nonzero entries from such that (i) the sum of the elements in each row and each column is 0, and (ii) no element from appears twice. We prove that exist if and only if both m and n are at least 3. If H has the property that all entries are integers of magnitude at most , every row and column sum is 0 over the integers, and H also satisfies ), we call H an integer Heffter array. We show integer Heffter arrays exist if and only if . Finally, an integer Heffter array is shiftable if each row and column contains the same number of positive and negative integers. We show that shiftable integer arrays exists exactly when both are even.  相似文献   
83.
We prove a property of the Bouligand tangent cone to the epigraph (or to the graph) of a locally Lipschitz function. It is also shown how this result can be used in determining Dini sequences. Finally, some relationships between such a cone and Dini derivatives are provided.  相似文献   
84.
In this paper, problems related to the approximation of a holomorphic function f on a compact subset E of the complex plane C by rational functions from the class of all rational functions of order (n,m) are considered. Let ρ n,m = ρ n,m (f;E) be the distance of f in the uniform metric on E from the class . We obtain results characterizing the rate of convergence to zero of the sequence of the best rational approximation { ρ n,m(n) } n=0 , m(n)/n θ (0,1] as n . In particular, we give an upper estimate for the liminf n →∞ ρ n,m(n) 1/(n+m(n)) in terms of the solution to a certain minimum energy problem with respect to the logarithmic potential. The proofs of the results obtained are based on the methods of the theory of Hankel operators. June 16, 1997. Date revised: December 1, 1997. Date accepted: December 1, 1997. Communicated by Ronald A. DeVore.  相似文献   
85.
混合序列的强大数律   总被引:7,自引:3,他引:7  
吴群英 《数学研究》1999,32(1):92-97
讨论了混合序列部分和的强收敛性,所得结果推广和改进了文献[1]、[2],并推广了Marcinkiewicz强大数律.  相似文献   
86.
Mikael Raab 《Extremes》1999,1(3):295-321
Consider a finite sequence of Gaussian random variables. Count the number of exceedances of some level a, i.e. the number of values exceeding the level. Let this level and the length of the sequence increase simultaneously so that the expected number of exceedances remains fixed. It is well-known that if the long-range dependence is not too strong, the number of exceeding points converges in distribution to a Poisson distribution. However, for sequences with some individual large correlations, the Poisson convergence is slow due to clumping. Using Steins method we show that, at least for m-dependent sequences, the rate of convergence is improved by using compound Poisson as approximating distribution. An explicit bound for the convergence rate is derived for the compound Poisson approximation, and also for a subclass of the compound Poisson distribution, where only clumps of size two are considered. Results from numerical calculations and simulations are also presented.  相似文献   
87.
Let X n1 * , ... X nn * be a sequence of n independent random variables which have a geometric distribution with the parameter p n = 1/n, and M n * = \max\{X n1 * , ... X nn * }. Let Z 1, Z2, Z3, ... be a sequence of independent random variables with the uniform distribution over the set N n = {1, 2, ... n}. For each j N n let us denote X nj = min{k : Zk = j}, M n = max{Xn1, ... Xnn}, and let S n be the 2nd largest among X n1, Xn2, ... Xnn. Using the methodology of verifying D(un) and D'(un) mixing conditions we prove herein that the maximum M n has the same type I limiting distribution as the maximum M n * and estimate the rate of convergence. The limiting bivariate distribution of (Sn, Mn) is also obtained. Let n, n Nn, , and T n = min{M(An), M(Bn)}. We determine herein the limiting distribution of random variable T n in the case n , n/n > 0, as n .  相似文献   
88.
江庭  李富林 《大学数学》2017,33(3):29-32
近年来,伽罗瓦环上的序列理论成为人们研究的热点问题.有限域上的No序列是一类伪随机序列,它在序列密码中占具十分重要的角色.本文利用伽罗瓦环上的置换,构造了伽罗瓦环Z_(p~e)上的一类新的No序列,并且研究了其线性复杂度.研究的结果表明此类No序列具有相当大的线性复杂度.  相似文献   
89.
The aim of this paper is to examine the weak limiting behavior of upper and lower extremes from stationary sequences satisfying dependence conditions similar to D and D′ introduced by Leadbetter (Z. Wahrsch. Verw. Gebiete28 (1974), 289–303). By establishing the convergence in distribution of an associated sequence of point processes, the joint limiting distribution of any collection of upper and lower extremes can be determined. Sufficient and, in some cases, necessary conditions for the asymptotic independence of the upper and lower extremes are also given.  相似文献   
90.
A new class of integrable maps, obtained as lattice versions of polynomial dynamical systems is introduced. These systems are obtained by means of a discretization procedure that preserves several analytic and algebraic properties of a given differential equation, in particular symmetries and integrability (see Tempesta, 2010 [40]). Our approach is based on the properties of a suitable Galois differential algebra, that we shall call a Rota algebra. A formulation of the procedure in terms of category theory is proposed. In order to render the lattice dynamics confined, a Borel regularization is also adopted. As a byproduct of the theory, a connection between number sequences and integrability is discussed.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号