首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   87679篇
  免费   743篇
  国内免费   453篇
化学   31197篇
晶体学   839篇
力学   6853篇
数学   33358篇
物理学   16628篇
  2022年   63篇
  2021年   116篇
  2020年   221篇
  2019年   184篇
  2018年   10501篇
  2017年   10322篇
  2016年   6315篇
  2015年   1052篇
  2014年   544篇
  2013年   799篇
  2012年   4285篇
  2011年   11041篇
  2010年   5960篇
  2009年   6328篇
  2008年   7078篇
  2007年   9226篇
  2006年   749篇
  2005年   1792篇
  2004年   1933篇
  2003年   2271篇
  2002年   1380篇
  2001年   421篇
  2000年   481篇
  1999年   314篇
  1998年   359篇
  1997年   296篇
  1996年   356篇
  1995年   251篇
  1994年   234篇
  1993年   225篇
  1992年   171篇
  1991年   172篇
  1990年   141篇
  1989年   133篇
  1988年   122篇
  1987年   127篇
  1986年   114篇
  1985年   158篇
  1984年   139篇
  1983年   100篇
  1982年   144篇
  1981年   126篇
  1980年   124篇
  1979年   140篇
  1978年   120篇
  1977年   99篇
  1976年   104篇
  1975年   79篇
  1974年   70篇
  1973年   83篇
排序方式: 共有10000条查询结果,搜索用时 198 毫秒
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.
A soluble cyano‐substituted poly[(1,3‐phenylene vinylene)‐alt‐(1,4‐phenylene vinylene)] derivative ( 9 ) was synthesized and characterized. Comparison between 9 and its model compound ( 10 ) showed that the chromophore in 9 remained to be well defined as a result of a π‐conjugation interruption at adjacent m‐phenylene units. The attachment of a cyano substituent only at the β position of the vinylene allowed the maximum electronic impact of the cyano group on the optical properties of the poly(p‐phenylene vinylene) material. At a low temperature (?108 or ?198 °C), the vibronic structures of 9 and 10 were partially resolved. The absorption and emission spectra of a film of 9 were less temperature‐dependent than those of a film of 10 , indicating that the former had a lower tendency to aggregate. A light‐emitting diode (LED) based on 9 emitted yellow light (λmax ≈ 578 nm) with an external quantum efficiency of 0.03%. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 3149–3158, 2003  相似文献   
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.
108.
 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  相似文献   
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.
A technique is described for the measurement of all components of mean velocity and Reynolds stresses, in a complex turbulent flow where achieving coincidence data acquisition is difficult. The method is based on data recorded using four orientations of the laser probe. It is shown that the measurement errors are not the same for all the components of the Reynolds tensor, but they are sufficiently small to give a good accuracy. An application to a turbomachinery flow is given to illustrate the method.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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