首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4235篇
  免费   97篇
  国内免费   44篇
化学   2901篇
晶体学   29篇
力学   82篇
数学   705篇
物理学   659篇
  2023年   18篇
  2021年   37篇
  2020年   24篇
  2019年   48篇
  2018年   25篇
  2017年   35篇
  2016年   76篇
  2015年   62篇
  2014年   66篇
  2013年   208篇
  2012年   183篇
  2011年   208篇
  2010年   106篇
  2009年   90篇
  2008年   247篇
  2007年   270篇
  2006年   275篇
  2005年   280篇
  2004年   225篇
  2003年   150篇
  2002年   142篇
  2001年   59篇
  2000年   69篇
  1999年   62篇
  1998年   53篇
  1997年   63篇
  1996年   78篇
  1995年   59篇
  1994年   58篇
  1993年   44篇
  1992年   54篇
  1991年   41篇
  1990年   35篇
  1989年   31篇
  1988年   44篇
  1987年   43篇
  1986年   53篇
  1985年   72篇
  1984年   75篇
  1983年   63篇
  1982年   49篇
  1981年   49篇
  1980年   60篇
  1979年   36篇
  1978年   61篇
  1977年   46篇
  1976年   40篇
  1975年   30篇
  1974年   31篇
  1973年   33篇
排序方式: 共有4376条查询结果,搜索用时 31 毫秒
21.
22.
2-Cyanoethyl anilines were controllably cleaved by 1 equiv of potassium t-butoxide in dry THF with a reaction that can be used in situ with the Wittig reaction to synthesize conjugated primary and secondary anilines.  相似文献   
23.
Three inverse problems for a Sturm-Liouville boundary value problem −y″+qy=λy, y(0)cosα=y′(0)sinα and y′(1)=f(λ)y(1) are considered for rational f. It is shown that the Weyl m-function uniquely determines α, f, and q, and is in turn uniquely determined by either two spectra from different values of α or by the Prüfer angle. For this it is necessary to produce direct results, of independent interest, on asymptotics and oscillation.  相似文献   
24.
25.
The Multicut problem can be defined as: given a graph G and a collection of pairs of distinct vertices {si,ti} of G, find a minimum set of edges of G whose removal disconnects each si from the corresponding ti. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being a tree. The main result of the paper is a polynomial-time approximation scheme (PTAS) for Multicut in unweighted graphs with bounded degree and bounded tree-width. That is, for any ε>0, we present a polynomial-time (1+ε)-approximation algorithm. In the particular case when the input is a bounded-degree tree, we have a linear-time implementation of the algorithm. We also provide some hardness results: we prove that Multicut is still NP-hard for binary trees and that it is Max SNP-hard if we drop any of the three conditions (unweighted, bounded-degree, bounded tree-width). Finally we show that some of these results extend to the vertex version of Multicut and to a directed version of Multicut.  相似文献   
26.
A nonlinear Lorenz model describing interactions between charged particles and combined ac-dc electromagnetic fields is studied for various combinations of frequencies, field strengths and relative angle (θ) between the ac and dc magnetic fields. Strong directional effects on the magnitude and location of resonant particle motion are observed when θ is varied and the regular resonance windows in the aligned field (θ = 0) and linear version of the model studied previously by Durney etaal., break up to form irregular and less well pronounced regions of large and small particle displacements when nonlinearities are taken into account. The length of time takne to achieve resonant behaviour also becomes larger and more variable when nonlinearities are present. The possible relevance of these effects to interactions between electromagnetic fields and biological media is briefly discussed.  相似文献   
27.
We construct a family of partially ordered sets (posets) that are q-analogs of the set partition lattice. They are different from the q-analogs proposed by Dowling [5]. One of the important features of these posets is that their Whitney numbers of the first and second kind are just the q-Stirling numbers of the first and second kind, respectively. One member of this family [4] can be constructed using an interpretation of Milne [9] for S[n, k] as sequences of lines in a vector space over the Galois field F q. Another member is constructed so as to mirror the partial order in the subspace lattice.  相似文献   
28.
We show that if G is a random 3-regular graph on n vertices, then its dominating number, D(G), almost surely satisfies .2636nD(G) ≤ .3126n. © 1995 John Wiley & Sons, Inc.  相似文献   
29.
30.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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