首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   92604篇
  免费   3142篇
  国内免费   2041篇
化学   34929篇
晶体学   918篇
力学   7506篇
综合类   67篇
数学   33526篇
物理学   20841篇
  2024年   45篇
  2023年   387篇
  2022年   526篇
  2021年   628篇
  2020年   690篇
  2019年   651篇
  2018年   10838篇
  2017年   10624篇
  2016年   6809篇
  2015年   1579篇
  2014年   1205篇
  2013年   1489篇
  2012年   5214篇
  2011年   11878篇
  2010年   6570篇
  2009年   6966篇
  2008年   7519篇
  2007年   9570篇
  2006年   994篇
  2005年   1954篇
  2004年   1996篇
  2003年   2355篇
  2002年   1339篇
  2001年   517篇
  2000年   577篇
  1999年   478篇
  1998年   451篇
  1997年   391篇
  1996年   459篇
  1995年   323篇
  1994年   252篇
  1993年   229篇
  1992年   209篇
  1991年   155篇
  1990年   150篇
  1989年   140篇
  1988年   102篇
  1987年   97篇
  1986年   102篇
  1985年   95篇
  1984年   60篇
  1983年   56篇
  1982年   55篇
  1981年   44篇
  1980年   53篇
  1979年   46篇
  1914年   45篇
  1912年   40篇
  1909年   41篇
  1908年   40篇
排序方式: 共有10000条查询结果,搜索用时 125 毫秒
121.
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.  相似文献   
122.
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.  相似文献   
123.
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.  相似文献   
124.
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.  相似文献   
125.
 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  相似文献   
126.
We report that the measurements of the pyroelectric current of the pre-poled [111]-oriented 0.955 Pb(Zn1/3Nb2/3) O3-0.045 PbTiO3 (PZN-4.5%PT) single crystals can shed some light on the phase transition and spontaneous polarization characters of this material in a similar way to measures of remanent polarization and dielectric properties. The pyroelectric current is measured and the corresponding spontaneous polarization is calculated as a function of temperature with various poling fields added during cooling the sample from 200℃ to room temperature. Critical electric field of 0.061 k V/cm is found to be essential to induce the intermediate ferroelectric orthorhombic phase between the ferroelectric rhombohedral and tetragonal phases. Below the critical field, the polarization increases almost linearly with the increase of poling field. At the critical field, the polarization at 30OC increases abruptly from 14μC/cm^2 for a poling field of O.06kV/cm to 29.5μC/cm^2 for a poling field of 0.061 kV/cm, and afterwards, increases slowly and saturates to 31 μC/cm^2 for poling fields beyond 0.55 kV/cm.  相似文献   
127.
128.
 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  相似文献   
129.
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.  相似文献   
130.
The Mannich-type reaction of imines with (1-methoxy-2-methylpropenyloxy)trimethylsilane and aza-Diels-Alder reaction of imines with Danishefsky's diene can be carried out in scCO2 in the presence of lithium heptadecafluorooctanesulfonate which offer a way to synthesize β-amino carbonyl compounds and nitrogen-containing six-membered ring compounds under environmentally benign conditions.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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