首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   112875篇
  免费   6922篇
  国内免费   4941篇
化学   50399篇
晶体学   1204篇
力学   8696篇
综合类   264篇
数学   35385篇
物理学   28790篇
  2024年   101篇
  2023年   763篇
  2022年   1161篇
  2021年   1381篇
  2020年   1643篇
  2019年   1583篇
  2018年   11475篇
  2017年   11179篇
  2016年   7735篇
  2015年   2589篇
  2014年   2587篇
  2013年   3106篇
  2012年   7025篇
  2011年   13729篇
  2010年   7864篇
  2009年   8147篇
  2008年   8949篇
  2007年   10752篇
  2006年   2239篇
  2005年   2920篇
  2004年   2838篇
  2003年   2997篇
  2002年   2113篇
  2001年   1119篇
  2000年   999篇
  1999年   917篇
  1998年   804篇
  1997年   703篇
  1996年   759篇
  1995年   606篇
  1994年   452篇
  1993年   410篇
  1992年   358篇
  1991年   315篇
  1990年   275篇
  1989年   221篇
  1988年   164篇
  1987年   148篇
  1986年   167篇
  1985年   123篇
  1984年   81篇
  1983年   81篇
  1982年   71篇
  1981年   62篇
  1980年   54篇
  1979年   47篇
  1914年   45篇
  1912年   40篇
  1909年   41篇
  1908年   40篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
181.
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.  相似文献   
182.
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.  相似文献   
183.
The atom transfer radical copolymerization of N‐substituted maleimides such as N‐phenylmaleimide (PhMI), N‐cyclohexylmaleimide (ChMI), and N‐butylmaleimide (NBMI) with styrene initiated with dendritic polyarylether 2‐bromoisobutyrates in an ionic liquid, 1‐butyl‐3‐methylimidazolium hexafluorophosphate ([bmim][PF6]), at room temperature and anisole at 110 °C was investigated. The dendritic‐linear block copolymers obtained in ionic liquid possessed well‐defined molecular weight and low polydispersity (1.05 < Mw/Mn < 1.32) and could be used as a macroinitiator for chain‐extension polymerization, suggesting the living nature of the reaction system. The ionic liquids containing catalyst could be recycled in the atom transfer radical polymerization systems without further treatment. Compared with polymerization conducted in anisole, the polymerization in ionic liquid had a stronger tendency for alternation. The tendency for alternation decreased in the order PhMI > NBMI > ChMI in [bmim][PF6] and PhMI > ChMI > NBMI in anisole. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 2156–2165, 2003  相似文献   
184.
利用场发射显微镜和四极质谱计研究了充入高纯O2的四极质谱和O2对单壁碳纳米管场发射的影响.单壁碳纳米管经过约1000℃的热处理得到清洁态场发射像后,充入O2,分别测量了O2吸附和脱附后场发射的I V特性.实验观测到在单壁碳纳米管上O2的吸附使场发射电流减小,说明逸出功增加.在10-4Pa的O2压强下对单壁碳纳米管进行约1000℃的热处理,可以产生氧化刻蚀作用,观测到场发射像的变化,并测量了氧化刻蚀产生的I V特性变化. 关键词: 单壁碳纳米管 场发射显微镜 场发射 四极质谱  相似文献   
185.
大口径光束波前采样器(孔栅)的研制   总被引:2,自引:0,他引:2  
应用平面波角谱理论,分析了采样器对光波场采样和分光的基本原理以及对空间采样频率的选择规则,描述了实际研制的大口径采样器的结构设计,并通过数值方法和高能激光大气传输实验研究了高能激光经采样器前/后的远场光斑分布关系。结果表明:利用光束波前采样器能高保真地实现对高能激光束的分光。  相似文献   
186.
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.  相似文献   
187.
 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  相似文献   
188.
189.
As artificial enzymes, the binding constants of cyclodextrins (CDs) and their substrates are expected to be high1. For this purpose, many kinds of bridged cyclodextrin dimers2 whose two cyclodextrins are linked by various spacers have been constructed. It was of interest to make the dimers, whose binding constants would exceed 108dm3/mol3. Up to date, the bridged cyclodextrin dimers have been extensively studied as enzyme models and as molecular receptors4-6. Recently, we synthesized a brid…  相似文献   
190.
 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  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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