全文获取类型
收费全文 | 105279篇 |
免费 | 4407篇 |
国内免费 | 3054篇 |
专业分类
化学 | 43286篇 |
晶体学 | 1035篇 |
力学 | 8451篇 |
综合类 | 273篇 |
数学 | 34916篇 |
物理学 | 24779篇 |
出版年
2024年 | 71篇 |
2023年 | 568篇 |
2022年 | 540篇 |
2021年 | 847篇 |
2020年 | 1098篇 |
2019年 | 1056篇 |
2018年 | 11058篇 |
2017年 | 10821篇 |
2016年 | 7148篇 |
2015年 | 1990篇 |
2014年 | 1755篇 |
2013年 | 2273篇 |
2012年 | 6226篇 |
2011年 | 12923篇 |
2010年 | 7177篇 |
2009年 | 7546篇 |
2008年 | 8225篇 |
2007年 | 10256篇 |
2006年 | 1683篇 |
2005年 | 2493篇 |
2004年 | 2427篇 |
2003年 | 2718篇 |
2002年 | 1727篇 |
2001年 | 800篇 |
2000年 | 841篇 |
1999年 | 800篇 |
1998年 | 766篇 |
1997年 | 715篇 |
1996年 | 853篇 |
1995年 | 618篇 |
1994年 | 531篇 |
1993年 | 476篇 |
1992年 | 414篇 |
1991年 | 377篇 |
1990年 | 296篇 |
1989年 | 259篇 |
1988年 | 215篇 |
1987年 | 192篇 |
1986年 | 182篇 |
1985年 | 164篇 |
1984年 | 129篇 |
1983年 | 96篇 |
1982年 | 82篇 |
1981年 | 74篇 |
1980年 | 63篇 |
1979年 | 60篇 |
1978年 | 53篇 |
1975年 | 44篇 |
1914年 | 45篇 |
1909年 | 41篇 |
排序方式: 共有10000条查询结果,搜索用时 375 毫秒
151.
YaoKui ChenZhixiang 《分析论及其应用》2003,19(2):115-120
This paper gives the weighted Lp convergence rate estimations of the Gruenwald interpolatory polynomials based on the zeros of Chebyshev polymomials of the first kind,and proves that the order of the estimations is optimal for p≥1. 相似文献
152.
Howard Robinson 《Acta Analytica》2005,20(3):7-10
Nicholas Nathan tries to resist the current version of the causal argument for sense-data in two ways. First he suggests that,
on what he considers to be the correct re-construction of the argument, it equivocates on the sense of proximate cause. Second
he defends a form of disjunctivism, by claiming that there might be an extra mechanism involved in producing veridical hallucination,
that is not present in perception. I argue that Nathan’s reconstruction of the argument is not the appropriate one, and that,
properly interpreted, the argument does not equivocate on proximate cause. Furthermore, I claim that his postulation of a
modified mechanism for hallucinations is implausibly ad hoc. 相似文献
153.
Chris Pollett 《Archive for Mathematical Logic》2003,42(5):469-488
The paper establishes lower bounds on the provability of 𝒟=NP and the MRDP theorem in weak fragments of arithmetic. The
theory I
5
E
1
is shown to be unable to prove 𝒟=NP. This non-provability result is used to show that I
5
E
1
cannot prove the MRDP theorem. On the other hand it is shown that I
1
E
1
proves 𝒟 contains all predicates of the form (∀i≤|b|)P(i,x)^Q(i,x) where ^ is =, <, or ≤, and I
0
E
1
proves 𝒟 contains all predicates of the form (∀i≤b)P(i,x)=Q(i,x). Here P and Q are polynomials. A conjecture is made that 𝒟 contains NLOGTIME. However, it is shown that this conjecture would not be sufficient
to imply 𝒟=N P. Weak reductions to equality are then considered as a way of showing 𝒟=NP. It is shown that the bit-wise less than predicate,
≤2, and equality are both co-NLOGTIME complete under FDLOGTIME reductions. This is used to show that if the FDLOGTIME functions
are definable in 𝒟 then 𝒟=N P.
Received: 13 July 2001 / Revised version: 9 April 2002 /
Published online: 19 December 2002
Key words or phrases: Bounded Arithmetic – Bounded Diophantine Complexity 相似文献
154.
155.
Grégory Duby 《Archive for Mathematical Logic》2003,42(5):435-447
This paper generalizes results of F. K?rner from [4] where she established the existence of maximal automorphisms (i.e. automorphisms
moving all non-algebraic elements). An ω-maximal automorphism is an automorphism whose powers are maximal automorphisms. We
prove that any structure has an elementary extension with an ω-maximal automorphism. We also show the existence of ω-maximal
automorphisms in all countable arithmetically saturated structures. Further we describe the pairs of tuples (ˉa,ˉb) for which there is an ω-maximal automorphism mapping ˉa to ˉb.
Received: 12 December 2001 /
Published online: 10 October 2002
Supported by the ``Fonds pour la Formation à la Recherche dans l'Industrie et dans l'Agriculture'
Mathematics Subject Classification (2000): Primary: 03C50; Secondary: 03C57
Key words or phrases: Automorphism – Recursively saturated structure 相似文献
156.
157.
This paper analyzes the compromise social choice correspondence derived from the τ-value of digraph games. Monotonicity of
this correspondence is shown. A connection between several properties of social choice correspondences based on game theoretical
solutions and game theoretical properties of the underlying solutions is given. Applications to several game theoretic solutions
are provided. 相似文献
158.
近年来,决定椭圆型方程系数反问题在地磁、地球物理、冶金和生物等实际问题上有着广泛的应用.本文讨论了二维的决定椭圆型方程系数反问题的数值求解方法.由误差平方和最小原则,这个反问题可化为一个变分问题,并进一步离散化为一个最优化问题,其目标函数依赖于要决定的方程系数.本文着重考察非线性共轭梯度法在此最优化问题数值计算中的表现,并与拟牛顿法作为对比.为了提高算法的效率我们适当选择加快收敛速度的预处理矩阵.同时还考察了线搜索方法的不同对优化算法的影响.数值实验的结果表明,非线性共轭梯度法在这类大规模优化问题中相对于拟牛顿法更有效. 相似文献
159.
A closed but approximate formula of Green’s function for an arbitrary aggregate of cubic crystallites is given to derive the e?ective elastic sti?ness tensor of the polycrystal. This formula, which includes three elastic constants of single cubic c… 相似文献
160.
A technique is described for the measurement of all components of mean velocity and Reynolds stresses, in a complex turbulent flow where achieving coincidence data acquisition is difficult. The method is based on data recorded using four orientations of the laser probe. It is shown that the measurement errors are not the same for all the components of the Reynolds tensor, but they are sufficiently small to give a good accuracy. An application to a turbomachinery flow is given to illustrate the method. 相似文献