全文获取类型
收费全文 | 228056篇 |
免费 | 1892篇 |
国内免费 | 753篇 |
专业分类
化学 | 104970篇 |
晶体学 | 2781篇 |
力学 | 13272篇 |
综合类 | 7篇 |
数学 | 46620篇 |
物理学 | 63051篇 |
出版年
2020年 | 1111篇 |
2019年 | 1170篇 |
2018年 | 11717篇 |
2017年 | 11491篇 |
2016年 | 8411篇 |
2015年 | 2361篇 |
2014年 | 2691篇 |
2013年 | 6583篇 |
2012年 | 8578篇 |
2011年 | 16426篇 |
2010年 | 9742篇 |
2009年 | 10178篇 |
2008年 | 12094篇 |
2007年 | 14276篇 |
2006年 | 5584篇 |
2005年 | 6238篇 |
2004年 | 5875篇 |
2003年 | 5770篇 |
2002年 | 4852篇 |
2001年 | 4558篇 |
2000年 | 3585篇 |
1999年 | 2704篇 |
1998年 | 2413篇 |
1997年 | 2317篇 |
1996年 | 2167篇 |
1995年 | 2009篇 |
1994年 | 1958篇 |
1993年 | 1817篇 |
1992年 | 2043篇 |
1991年 | 2179篇 |
1990年 | 1965篇 |
1989年 | 1973篇 |
1988年 | 1914篇 |
1987年 | 1812篇 |
1986年 | 1747篇 |
1985年 | 2238篇 |
1984年 | 2364篇 |
1983年 | 1933篇 |
1982年 | 2118篇 |
1981年 | 2000篇 |
1980年 | 1932篇 |
1979年 | 2072篇 |
1978年 | 2229篇 |
1977年 | 2085篇 |
1976年 | 2128篇 |
1975年 | 2035篇 |
1974年 | 2083篇 |
1973年 | 2084篇 |
1972年 | 1371篇 |
1971年 | 1218篇 |
排序方式: 共有10000条查询结果,搜索用时 156 毫秒
311.
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. 相似文献
312.
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 相似文献
313.
We derive a test problem for evaluating the ability of time-steppingmethods to preserve the statistical properties of systems inmolecular dynamics. We consider a family of deterministic systemsconsisting of a finite number of particles interacting on acompact interval. The particles are given random initial conditionsand interact through instantaneous energy- and momentum-conservingcollisions. As the number of particles, the particle density,and the mean particle speed go to infinity, the trajectory ofa tracer particle is shown to converge to a stationary Gaussianstochastic process. We approximate this system by one describedby a system of ordinary differential equations and provide numericalevidence that it converges to the same stochastic process. Wesimulate the latter system with a variety of numerical integrators,including the symplectic Euler method, a fourth-order Runge-Kuttamethod, and an energyconserving step-and-project method. Weassess the methods' ability to recapture the system's limitingstatistics and observe that symplectic Euler performs significantlybetter than the others for comparable computational expense. 相似文献
314.
315.
316.
317.
318.
Ab initio calculations showed that the tetrachlorodibenzo-para-dioxin radical cations (TCDD RCs) with a planar structure have two steady states with asymmetric dioxin cycles. The activation barriers between these states are up to 2 kcal/mole, so that the RCs may be regarded as being structurally nonrigid within the dioxin cycle. The 2,3,7,8-TCDD RC is more stable than the 1,4,6,9-TCDD RC, the energy difference being 5.2 kcal/mole. The adiabatic ionization potential of 2,3,7,8-TCDD (7.54 eV) is 0.1 eV smaller than the corresponding potential of 1,4,6,9-TCDD. These factors account for the increased hemoproteide affinity and hence increased biological activity of 2,3,7,8-TCDD. 相似文献
319.
Grishin D. F. Semyonycheva L. L. Telegina E. V. Smirnov A. S. Nevodchikov V. I. 《Russian Chemical Bulletin》2003,52(2):505-507
Organometallic compounds Cp2TiCl2, (EtC5H4)2NbCl2, and (PriC5H4)2WCl2 were assessed as additives that control polymer chain growth in the polymerization of methyl methacrylate. In the presence of compounds mentioned in amounts comparable with that of the initiator, a uniform process with no gel-effect occured and respective linear increase in the molecular weight of the polymer up to high degrees of the monomer conversion was observed. 相似文献
320.
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 相似文献