首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   112340篇
  免费   5880篇
  国内免费   3973篇
化学   48593篇
晶体学   1125篇
力学   8731篇
综合类   241篇
数学   35817篇
物理学   27686篇
  2024年   71篇
  2023年   738篇
  2022年   948篇
  2021年   1253篇
  2020年   1426篇
  2019年   1296篇
  2018年   11266篇
  2017年   11020篇
  2016年   7474篇
  2015年   2364篇
  2014年   2214篇
  2013年   2794篇
  2012年   6884篇
  2011年   13423篇
  2010年   7660篇
  2009年   7948篇
  2008年   8666篇
  2007年   10567篇
  2006年   2033篇
  2005年   2805篇
  2004年   2783篇
  2003年   2918篇
  2002年   1881篇
  2001年   974篇
  2000年   974篇
  1999年   978篇
  1998年   880篇
  1997年   777篇
  1996年   898篇
  1995年   714篇
  1994年   623篇
  1993年   562篇
  1992年   501篇
  1991年   426篇
  1990年   373篇
  1989年   294篇
  1988年   274篇
  1987年   255篇
  1986年   198篇
  1985年   202篇
  1984年   177篇
  1983年   152篇
  1982年   121篇
  1981年   97篇
  1980年   95篇
  1979年   76篇
  1978年   60篇
  1976年   43篇
  1975年   47篇
  1914年   45篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
161.
A low cost, coolerless 980nm diode pumped, gain flattened L band EDFA with fast transient control, high pump efficiency and gain clamping effect was realized by using FBGs as C band seed generators.  相似文献   
162.
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.  相似文献   
163.
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.  相似文献   
164.
A previously developed laser spallation technique has been modified to measure the tensile strength of thin film interfaces in-situ at temperatures up to 1100°C. Tensile strengths of Nb/A-plane sapphire, FeCrAl/A-plane sapphire and FeCrAlY/A-plane sapphire were measured up to 950°C. The measured strengths at high temperatures were substantially lower compared with their corresponding strengths at ambient temperature. For example, at 850°C, the interface tensile strength for the Nb/sapphire (151 ± 17 MPa), FeCrAl/sapphire (62 ± 8 MPa) and FeCrAlY/sapphire (82 ± 11 MPa) interface systems were lower by factors of approximately, 3, 5, and 8, respectively, over their corresponding ambient values. These results underscore the importance of using such in-situ measured values under operating conditions as the failure criterion in any life prediction or reliability models of such coated systems where local interface temperature excursions are expected. The results on alloy film interfaces also demonstrate that the presence of Y increases the strength of FeCrAl/Al2O3 interfaces.  相似文献   
165.
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.  相似文献   
166.
 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 (∀ib)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  相似文献   
167.
70K温区混合工质分凝分离循环节流制冷机实验研究   总被引:1,自引:0,他引:1  
混合工质节流制冷机正在许多方面获得越来越广泛的应用。文中设计了一种新型的混合工质分凝分离循环 ,建立了实验系统 ,并在 70 K温区进行了实验。实验结果表明 ,节流制冷机可以达到 6 5 .3K的低温 ,并在 72 K温度提供 1W的制冷量 ,输入功率为 5 0 0 W。  相似文献   
168.
169.
 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 (ˉab) 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  相似文献   
170.
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.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号