首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   84648篇
  免费   1805篇
  国内免费   1306篇
化学   29125篇
晶体学   955篇
力学   7159篇
综合类   112篇
数学   32565篇
物理学   17843篇
  2023年   175篇
  2022年   244篇
  2021年   318篇
  2020年   450篇
  2019年   387篇
  2018年   10700篇
  2017年   10523篇
  2016年   6481篇
  2015年   1324篇
  2014年   826篇
  2013年   983篇
  2012年   4478篇
  2011年   11166篇
  2010年   6110篇
  2009年   6431篇
  2008年   6996篇
  2007年   9110篇
  2006年   511篇
  2005年   1583篇
  2004年   1734篇
  2003年   2136篇
  2002年   1188篇
  2001年   388篇
  2000年   369篇
  1999年   222篇
  1998年   246篇
  1997年   182篇
  1996年   232篇
  1995年   132篇
  1994年   99篇
  1993年   117篇
  1992年   80篇
  1991年   81篇
  1990年   75篇
  1989年   75篇
  1988年   75篇
  1987年   69篇
  1986年   70篇
  1985年   61篇
  1984年   56篇
  1983年   55篇
  1982年   53篇
  1981年   54篇
  1980年   58篇
  1979年   59篇
  1978年   44篇
  1914年   45篇
  1912年   40篇
  1909年   41篇
  1908年   40篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
101.
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.  相似文献   
102.
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.  相似文献   
103.
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.  相似文献   
104.
采用高温热解法,以乙二胺为前驱液,在沉积有铁催化剂的p型硅(111)基底上制备出了定向生长的CNx纳米管.利用扫描电子显微镜、高分辨率透射电子显微镜和拉曼光谱对CNx纳米管进行了形貌观察和表征.CNx纳米管的高度在20?μm左右,直径在50—100nm之间,具有明显的“竹节状”结构,结晶有序度较差.对CNx纳米管薄膜进行低场致发射性能测试:外加电场为1.4V/μm,观察到20?μA /cm2发射电流,外电场升至2.54V/μm时发射电流达到1.280mA/cm2,在较高外电场下,没有发现电流“饱和”.这比 关键词: CNx纳米管 高温热解 “竹节状”结构 场致发射  相似文献   
105.
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.
 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  相似文献   
107.
We study the spectral characteristics theoretically and experimentally in the Fraunhofer diffraction pattern formed by the diffraction of a spatially coherent, polychromatic light through a slit. It is found that the spectrum in some diffraction directions close to the singular direction is redshifted, compared to the spectrum of the incident polychromatic light, and blueshifted in other directions, and splits into two lines at the singular direction. We show that the experimental results are consistent with the theoretical expectations.  相似文献   
108.
109.
 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  相似文献   
110.
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号