首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2000篇
  免费   170篇
  国内免费   237篇
化学   208篇
晶体学   3篇
力学   55篇
综合类   34篇
数学   1601篇
物理学   506篇
  2024年   2篇
  2023年   25篇
  2022年   38篇
  2021年   37篇
  2020年   55篇
  2019年   51篇
  2018年   56篇
  2017年   56篇
  2016年   69篇
  2015年   63篇
  2014年   109篇
  2013年   154篇
  2012年   93篇
  2011年   125篇
  2010年   93篇
  2009年   132篇
  2008年   131篇
  2007年   137篇
  2006年   130篇
  2005年   107篇
  2004年   103篇
  2003年   93篇
  2002年   88篇
  2001年   64篇
  2000年   78篇
  1999年   61篇
  1998年   45篇
  1997年   39篇
  1996年   35篇
  1995年   25篇
  1994年   20篇
  1993年   10篇
  1992年   9篇
  1991年   9篇
  1990年   4篇
  1989年   8篇
  1987年   4篇
  1986年   4篇
  1985年   8篇
  1984年   6篇
  1983年   2篇
  1982年   6篇
  1981年   5篇
  1980年   4篇
  1979年   2篇
  1976年   3篇
  1974年   3篇
  1972年   1篇
  1969年   1篇
  1936年   1篇
排序方式: 共有2407条查询结果,搜索用时 31 毫秒
101.
得到了自然数幂方和由二项系数表示的系数a_i~(k)的公式,和由排列数表示的系数b_i~(k)的公式,证明了系数存在唯一性及系数间的若干重要性质,给出了计算系数的C-语言程序.  相似文献   
102.
103.
Global Optimization Algorithm for the Nonlinear Sum of Ratios Problem   总被引:7,自引:0,他引:7  
This article presents a branch-and-bound algorithm for globally solving the nonlinear sum of ratios problem (P). The algorithm economizes the required computations by conducting the branch-and-bound search in p, rather than in n, where p is the number of ratios in the objective function of problem (P) and n is the number of decision variables in problem (P). To implement the algorithm, the main computations involve solving a sequence of convex programming problems for which standard algorithms are available.  相似文献   
104.
The category of local torsion-free abelian groups of finite rank is known to have the cancellation and -th root properties but not the Krull-Schmidt property. It is shown that 10 is the least rank of a local torsion-free abelian group with two non-equivalent direct sum decompositions into indecomposable summands. This answers a question posed by M.C.R. Butler in the 1960's.

  相似文献   

105.
Bassalygo  L. A.  Zinov'ev  V. A. 《Mathematical Notes》2002,72(1-2):152-157
We study trigonometric sums in finite fields . The Weil estimate of such sums is well known: , where f is a polynomial with coefficients from F(Q). We construct two classes of polynomials f, , for which attains the largest possible value and, in particular, .  相似文献   
106.
Suppose thatD={z:|z|<1}, L 2 (D) is the space of functions square-integrable over area inD,A k (D) is the set of allk-analytic functions inD, (A 1 (D)=A(D) is the set of all analytic functions inD),A k L 2 (D)=L 2 (D)∩A k (D),A 1 L 2 (D)=AL 2 (D),
. It is proved that the subspacesA k L 2 0 (D),k=1, 2,..., are orthogonal to one another and the spaceA m L 2 (D) is the direct sum of such subspaces fork=1, 2,...,m. The kernel of the orthogonal projection operator from the spaceA m L 2 (D) onto its subspacesA k L 2 0 (D) is obtained. These results are applied to the study of the properties of polyrational functions of best approximation in the metricL 2 (D). Translated fromMatematicheskie Zametki, Vol. 66, No. 5, pp. 741–759, November, 1999.  相似文献   
107.
Thek-dimensional Piatetski-Shapiro prime number problem fork⩾3 is studied. Let π(x 1 c 1,⋯,c k ) denote the number of primesp withp⩽x, , where 1<c 1<⋯<c k are fixed constants. It is proved that π(x;c 1,⋯,c k ) has an asymptotic formula ifc 1 −1 +⋯+c k −1 >kk/(4k 2+2). Project supported by the National Natural Science Foundation of China (Grant No. 19801021) and the Natural Science Foundation of Shandong Province (Grant No.Q98A02110).  相似文献   
108.
We show that the covering radius R of an [n,k,d] code over Fq is bounded above by R n-n q(k, d/q). We strengthen this bound when R d and find conditions under which equality holds.As applications of this and other bounds, we show that all binary linear codes of lengths up to 15, or codimension up to 9, are normal. We also establish the normality of most codes of length 16 and many of codimension 10. These results have applications in the construction of codes that attain t[n,k,/it>], the smallest covering radius of any binary linear [n,k].We also prove some new results on the amalgamated direct sum (ADS) construction of Graham and Sloane. We find new conditions assuring normality of the ADS; covering radius 1 less than previously guaranteed for ADS of codes with even norms; good covering codes as ADS without the hypothesis of normality, from concepts p- stable and s- stable; codes with best known covering radii as ADS of two, often cyclic, codes (thus retaining structure so as to be suitable for practical applications).  相似文献   
109.
We prove the pointwise convergence of the Fourier series for radial functions in several variables, which in the case is the Dirichlet-Jordan theorem itself. In our proof the method for the case of the indicator function of the ball is very useful.

  相似文献   

110.
We give a reduction procedure to determine (locally) the surfaces with constant Gauss curvature in a three-dimensional manifold which are invariant under the action of a one-parameter subgroup of the isometry group of the ambient space. We apply this procedure to describe the invariant surfaces with constant Gauss curvature in H2×R and in H3.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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