全文获取类型
收费全文 | 82066篇 |
免费 | 572篇 |
国内免费 | 462篇 |
专业分类
化学 | 26972篇 |
晶体学 | 813篇 |
力学 | 6856篇 |
综合类 | 10篇 |
数学 | 32432篇 |
物理学 | 16017篇 |
出版年
2022年 | 57篇 |
2021年 | 63篇 |
2020年 | 80篇 |
2019年 | 73篇 |
2018年 | 10485篇 |
2017年 | 10305篇 |
2016年 | 6166篇 |
2015年 | 948篇 |
2014年 | 440篇 |
2013年 | 557篇 |
2012年 | 4050篇 |
2011年 | 10792篇 |
2010年 | 5806篇 |
2009年 | 6170篇 |
2008年 | 6836篇 |
2007年 | 8981篇 |
2006年 | 461篇 |
2005年 | 1543篇 |
2004年 | 1715篇 |
2003年 | 2127篇 |
2002年 | 1155篇 |
2001年 | 339篇 |
2000年 | 401篇 |
1999年 | 208篇 |
1998年 | 233篇 |
1997年 | 186篇 |
1996年 | 237篇 |
1995年 | 173篇 |
1994年 | 129篇 |
1993年 | 147篇 |
1992年 | 98篇 |
1991年 | 94篇 |
1990年 | 79篇 |
1989年 | 84篇 |
1988年 | 88篇 |
1987年 | 89篇 |
1986年 | 78篇 |
1985年 | 74篇 |
1984年 | 73篇 |
1983年 | 50篇 |
1982年 | 70篇 |
1981年 | 67篇 |
1980年 | 68篇 |
1979年 | 83篇 |
1978年 | 66篇 |
1977年 | 50篇 |
1976年 | 42篇 |
1914年 | 45篇 |
1909年 | 41篇 |
1908年 | 40篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
Jiří Herec 《Czechoslovak Journal of Physics》2004,54(12):1473-1481
In this paper the quantum-statistical properties of light beams propagating in a directional nonlinear coupler are investigated.
This device is composed of a pair of linearly coupled nonlinear waveguides operating by means of degenerate parametric downconversion.
The possibility of generation of nonclassical states of light in single and compound modes, using the short-length approximation,
is discussed. Influence of linear and nonlinear mismatches for generation of nonclassical light is taken into account.
This work was supported by Project LN00A015, Research Project No. CEZ: J14/98 and the COST project OC P11.003 of the Czech
Ministry of Education. 相似文献
92.
C Guéret N Jussien O Lhomme C Pavageau C Prins 《The Journal of the Operational Research Society》2003,54(5):458-465
In this paper, we describe an aircraft loading problem submitted by the French military agency (DGA) as part of a more general military airlift planning problem. It can be viewed as a kind of bi-dimensional bin-packing problem, with heterogeneous bins and several additional constraints. We introduce two-phase methods for solving this NP-hard problem. The first phase consists in building good initial solutions, thanks to two fast algorithms: a list-based heuristic and a loading pattern generation method. Both algorithms call a constraint-based subroutine, able to determine quickly if the items already loaded can be reshuffled to accommodate a new object. The second phase improves these preliminary solutions using local search techniques. Results obtained on real data sets are presented. 相似文献
93.
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. 相似文献
94.
Ching Sum Hui Lillian Sze Man Lam Chun Yin Wai Kin Chan Aleksandra B. Djurii 《Journal of polymer science. Part A, Polymer chemistry》2003,41(11):1708-1715
Polyurethanes incorporated with rhenium diimine complexes were synthesized. The polymers exhibited interesting morphologies and solution properties. Results from gel permeation chromatography suggested the formation of polymer aggregates in solutions. The polymers could act as probes for metal ions. The addition of metal ions to polymer solutions led to significant changes in the electronic absorption properties of the polymer solutions. This was attributed to the interactions between the polyether moieties and metal ions. The metal complexes could also act as efficient photosensitizers. After doping with charge‐transport viologens, the photoconductivity of the polymers was greatly enhanced. The experimental quantum efficiency was simulated with Onsager's theory. The thermalization distances and the primary yields were typically 12–14 Å and 10?3, respectively. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 1708–1715, 2003 相似文献
95.
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. 相似文献
96.
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 相似文献
97.
Timothy M. Chan 《Discrete and Computational Geometry》2005,34(1):11-24
We give a surprisingly short proof that in any planar arrangement of n curves where each pair intersects at most a fixed number (s) of
times, the k-level has subquadratic (O(n2-1/2s) complexity. This answers one of the main open problems from the author’s previous paper [DCG 29, 375-393 (2003)],
which provided a weaker upper bound for a
restricted class of curves only (graphs of degree-s polynomials).
When combined with existing tools (cutting curves, sampling, etc.),
the new idea generates a slew of improved k-level results for
most of the curve families studied earlier, including a
near-O(n3/2 bound for parabolas. 相似文献
98.
99.
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 相似文献
100.
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. 相似文献