全文获取类型
收费全文 | 8357篇 |
免费 | 363篇 |
国内免费 | 662篇 |
专业分类
化学 | 783篇 |
晶体学 | 7篇 |
力学 | 384篇 |
综合类 | 54篇 |
数学 | 6919篇 |
物理学 | 1235篇 |
出版年
2023年 | 83篇 |
2022年 | 80篇 |
2021年 | 91篇 |
2020年 | 154篇 |
2019年 | 166篇 |
2018年 | 203篇 |
2017年 | 205篇 |
2016年 | 239篇 |
2015年 | 156篇 |
2014年 | 333篇 |
2013年 | 579篇 |
2012年 | 329篇 |
2011年 | 362篇 |
2010年 | 329篇 |
2009年 | 513篇 |
2008年 | 593篇 |
2007年 | 534篇 |
2006年 | 489篇 |
2005年 | 437篇 |
2004年 | 314篇 |
2003年 | 383篇 |
2002年 | 346篇 |
2001年 | 259篇 |
2000年 | 269篇 |
1999年 | 276篇 |
1998年 | 216篇 |
1997年 | 239篇 |
1996年 | 127篇 |
1995年 | 119篇 |
1994年 | 101篇 |
1993年 | 70篇 |
1992年 | 60篇 |
1991年 | 61篇 |
1990年 | 66篇 |
1989年 | 50篇 |
1988年 | 53篇 |
1987年 | 40篇 |
1986年 | 38篇 |
1985年 | 50篇 |
1984年 | 57篇 |
1983年 | 18篇 |
1982年 | 37篇 |
1981年 | 32篇 |
1980年 | 34篇 |
1979年 | 26篇 |
1978年 | 30篇 |
1977年 | 39篇 |
1976年 | 25篇 |
1974年 | 16篇 |
1973年 | 16篇 |
排序方式: 共有9382条查询结果,搜索用时 0 毫秒
91.
讨论了具有无界变差的连续函数的结构.首先按照局部结构和分形维数对连续函数进行了分类,给出了相应的例子.对这些具有无界变差的函数的性质进行了初步的讨论.对于新定义的奇异连续函数,给出了一个等价判别定理.基于奇异连续函数,又给出了局部分形函数和分形函数的定义.同时,分形函数又由奇异分形函数、非正则分形函数和正则分形函数组成.相应于不连续函数的情形也进行了简单的讨论. 相似文献
92.
93.
It is proved that the Bergman type operatorT, is a bounded projection from the pluriharmonic Bergman spaceL
p
(B)∩h(B) onto Bergman spaceL
p
(B) ∩
H(B) for 0p 1 ands (p1-1)(n+1). As an application it is shown that the Gleason’s problem can be solved in Bergman space LP(B)∩H(B) for 0p 1.
Project supported by the National Natural Science Foundation of China (Grant No. 19871081) and the Doctoral Program Foundation
of the State Education Commission of China. 相似文献
94.
Maximally Nonlinear Functions and Bent Functions 总被引:1,自引:0,他引:1
Qing Xiang 《Designs, Codes and Cryptography》1999,17(1-3):211-218
We give a construction of bent functions in 2n variables, here n is odd, by using maximally nonlinear functions on GF(2
n
). 相似文献
95.
A PICARD TYPE THEOREM AND BLOCH LAW 总被引:9,自引:0,他引:9
Ye Yasheng 《数学年刊B辑(英文版)》1994,15(1):75-80
A PICARD TYPE THEOREM AND BLOCH LAW ¥YEYASHENGAbstract:Apicardtypetheoremisproved,andacounterexampleisgiventoshowthattheBolch... 相似文献
96.
97.
A new class of generalized convex set-valued functions, termed nearly-subconvexlike functions, is introduced. This class is a generalization of cone-subconvexlike maps, nearly-convexlike set-valued functions, and preinvex set-valued functions. Properties for the nearly-subconvexlike functions are derived and a theorem of the alternative is proved. A Lagrangian multiplier theorem is established and two scalarization theorems are obtained for vector optimization. 相似文献
98.
We improve over a sufficient condition given in [8] for uniqueness of a nondegenerate critical point in best rational approximation
of prescribed degree over the conjugate-symmetric Hardy space of the complement of the disk. The improved condition connects to error estimates in AAK approximation, and is necessary
and sufficient when the function to be approximated is of Markov type. For Markov functions whose defining measure satisfies
the Szego condition, we combine what precedes with sharp asymptotics in multipoint Padé approximation from [43], [40] in order
to prove uniqueness of a critical point when the degree of the approximant goes large. This lends perspective to the uniqueness
issue for more general classes of functions defined through Cauchy integrals. 相似文献
99.
In this paper, theoretical results are described on the maximum norm stability and accuracy of finite difference discretizations of parabolic equations on overset nonmatching space-time grids. We consider parabolic equations containing a linear reaction term on a space-time domain which is decomposed into an overlapping collection of cylindrical subregions of the form , for . Each of the space-time domains are assumed to be independently grided (in parallel) according to the local geometry and space-time regularity of the solution, yielding space-time grids with mesh parameters and . In particular, the different space-time grids need not match on the regions of overlap, and the time steps can differ from one grid to the next. We discretize the parabolic equation on each local grid by employing an explicit or implicit -scheme in time and a finite difference scheme in space satisfying a discrete maximum principle. The local discretizations are coupled together, without the use of Lagrange multipliers, by requiring the boundary values on each space-time grid to match a suitable interpolation of the solution on adjacent grids. The resulting global discretization yields a large system of coupled equations which can be solved by a parallel Schwarz iterative procedure requiring some communication between adjacent subregions. Our analysis employs a contraction mapping argument.
Applications of the results are briefly indicated for reaction-diffusion equations with contractive terms and heterogeneous hyperbolic-parabolic approximations of parabolic equations.
100.
Convergence rates of cascade algorithms 总被引:2,自引:0,他引:2
Rong-Qing Jia 《Proceedings of the American Mathematical Society》2003,131(6):1739-1749
We consider solutions of a refinement equation of the form
where is a finitely supported sequence called the refinement mask. Associated with the mask is a linear operator defined on by . This paper is concerned with the convergence of the cascade algorithm associated with , i.e., the convergence of the sequence in the -norm.
where and is a constant. In particular, we confirm a conjecture of A. Ron on convergence of cascade algorithms.
where is a finitely supported sequence called the refinement mask. Associated with the mask is a linear operator defined on by . This paper is concerned with the convergence of the cascade algorithm associated with , i.e., the convergence of the sequence in the -norm.
Our main result gives estimates for the convergence rate of the cascade algorithm. Let be the normalized solution of the above refinement equation with the dilation matrix being isotropic. Suppose lies in the Lipschitz space , where 0$"> and . Under appropriate conditions on , the following estimate will be established:
where and is a constant. In particular, we confirm a conjecture of A. Ron on convergence of cascade algorithms.