全文获取类型
收费全文 | 88074篇 |
免费 | 691篇 |
国内免费 | 425篇 |
专业分类
化学 | 31347篇 |
晶体学 | 866篇 |
力学 | 6958篇 |
数学 | 33132篇 |
物理学 | 16887篇 |
出版年
2022年 | 106篇 |
2021年 | 158篇 |
2020年 | 153篇 |
2019年 | 187篇 |
2018年 | 10504篇 |
2017年 | 10326篇 |
2016年 | 6285篇 |
2015年 | 1060篇 |
2014年 | 553篇 |
2013年 | 803篇 |
2012年 | 4328篇 |
2011年 | 11082篇 |
2010年 | 5975篇 |
2009年 | 6322篇 |
2008年 | 7096篇 |
2007年 | 9269篇 |
2006年 | 730篇 |
2005年 | 1783篇 |
2004年 | 1973篇 |
2003年 | 2374篇 |
2002年 | 1362篇 |
2001年 | 439篇 |
2000年 | 479篇 |
1999年 | 273篇 |
1998年 | 286篇 |
1997年 | 249篇 |
1996年 | 353篇 |
1995年 | 223篇 |
1994年 | 190篇 |
1993年 | 179篇 |
1992年 | 145篇 |
1991年 | 154篇 |
1990年 | 142篇 |
1989年 | 130篇 |
1988年 | 126篇 |
1987年 | 136篇 |
1986年 | 136篇 |
1985年 | 130篇 |
1984年 | 144篇 |
1983年 | 111篇 |
1982年 | 128篇 |
1981年 | 122篇 |
1980年 | 125篇 |
1979年 | 114篇 |
1978年 | 114篇 |
1977年 | 111篇 |
1976年 | 101篇 |
1975年 | 101篇 |
1974年 | 84篇 |
1973年 | 85篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
Robert Jerrard Alberto Montero Peter Sternberg 《Communications in Mathematical Physics》2004,249(3):549-577
We establish the existence of locally minimizing vortex solutions to the full Ginzburg-Landau energy in three dimensional simply-connected domains with or without the presence of an applied magnetic field. The approach is based upon the theory of weak Jacobians and applies to nonconvex sample geometries for which there exists a configuration of locally shortest line segments with endpoints on the boundary.Research partially supported by NSERC grant number 261955 相似文献
102.
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. 相似文献
103.
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. 相似文献
104.
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. 相似文献
105.
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. 相似文献
106.
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 相似文献
107.
108.
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 相似文献
109.
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. 相似文献
110.
Jocelyn Sabatier Serge Poullain Patrick Latteux Jean Luc Thomas Alain Oustaloup 《Nonlinear dynamics》2004,38(1-2):383-400
Robust speed control of a low damped electromechanical system with backlash is studied, controlled load angular speed being not measured. The proposed control strategy combines a Luenberger observer (load angular speed and load torque disturbance estimations) and a robust CRONE controller. The observer provides estimation of the load angular speed and of the disturbance torque applied on the load. Through the computation of only three independent parameters (as many as a PID controller), the CRONE controller permits to ensure the robust speed control of the load in spite of plant parametric variations and speed observation errors. The proposed control strategy is applied to a four mass experimental test bench. 相似文献