首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10938篇
  免费   477篇
  国内免费   87篇
化学   7108篇
晶体学   93篇
力学   267篇
综合类   1篇
数学   1740篇
物理学   1637篇
无线电   656篇
  2023年   88篇
  2022年   101篇
  2021年   213篇
  2020年   222篇
  2019年   267篇
  2018年   178篇
  2017年   174篇
  2016年   411篇
  2015年   306篇
  2014年   344篇
  2013年   639篇
  2012年   656篇
  2011年   685篇
  2010年   479篇
  2009年   429篇
  2008年   629篇
  2007年   651篇
  2006年   523篇
  2005年   575篇
  2004年   464篇
  2003年   371篇
  2002年   358篇
  2001年   176篇
  2000年   164篇
  1999年   103篇
  1998年   110篇
  1997年   118篇
  1996年   120篇
  1995年   103篇
  1994年   91篇
  1993年   112篇
  1992年   79篇
  1991年   87篇
  1990年   77篇
  1989年   66篇
  1988年   52篇
  1987年   59篇
  1986年   72篇
  1985年   104篇
  1984年   102篇
  1983年   82篇
  1982年   69篇
  1981年   74篇
  1980年   68篇
  1979年   67篇
  1978年   68篇
  1977年   42篇
  1976年   40篇
  1975年   53篇
  1974年   55篇
排序方式: 共有10000条查询结果,搜索用时 703 毫秒
81.
82.
Let be a bounded, connected linearly convex set in with boundary. We show that the maximal ideal (both in ) and ) consisting of all functions vanishing at is generated by the coordinate functions . Received: 2 July 2001; in final form: 26 September 2001 / Published online: 28 February 2002  相似文献   
83.
84.
A multivalued version of Sharkovskiĭ’s theorem is formulated for M-maps on linear continua and, more generally, for triangular M-maps on a Cartesian product of linear continua. This improves the main result of [AP1] in the sense that our multivalued analogue holds with at most two exceptions. A further specification requires some additional restrictions. For instance, 3- orbits of m-maps imply the existence of k-orbits for all k ? \mathbbNk \in {\mathbb{N}} , except possibly for k ?k \in {4, 6}. It is also shown that, on every connected linearly ordered topological space, an M-map with orbits of all periods can always be constructed. This demonstrates that Baldwin’s classification of linear continua in terms of admissible periods [Ba] is useless for multivalued maps.  相似文献   
85.
We present a construction which shows that some special continua do not have the nonwandering-eventually-periodic property. The construction applies e.g. to the topologist's sin curve and to the harmonic fan.  相似文献   
86.
We investigate traces of functions, belonging to a class of functions with dominating mixed smoothness in ℝ3, with respect to planes in oblique position. In comparison with the classical theory for isotropic spaces a few new phenomenona occur. We shall present two different approaches. One is based on the use of the Fourier transform and restricted to p = 2. The other one is applicable in the general case of Besov-Lizorkin-Triebel spaces and based on atomic decompositions.  相似文献   
87.
The stoichiometric reactions of trimethylaluminum with 2,6‐(MeOCH2)2C6H3OH (LH) revealed compounds L3Al ( 1 ) and L2AlMe ( 2 ). On the other hand reaction of 1 equiv. of LH with trimethylaluminum did not lead to the formation of complex LAlMe2 ( 3 ), rather 2 together with Me3Al were observed as a result of a disproportionation of 3 . Compounds 1 and 2 were characterized by elemental analysis, 1H and 13C NMR spectroscopy and in the case of 1 by X‐ray diffraction. Derivative 2 underwent transmetalation with Ph3SnOH, giving LSnPh3 ( 4 ) as the result of a migration of ligand L from the aluminum to the tin atom. The identity of 4 was established by elemental analysis, 1H, 13C and 119Sn NMR spectroscopy and 1H, 119Sn HMBC experiments. The system 2 and B(C6F5)3 in a 1:1 molar ratio was shown to be active in the polymerization of propylene oxide and ε‐caprolactone. Copyright © 2007 John Wiley & Sons, Ltd.  相似文献   
88.
A mixed hypergraph is a triple (V,C,D) where V is its vertex set and C and D are families of subsets of V, called C-edges and D-edges, respectively. For a proper coloring, we require that each C-edge contains two vertices with the same color and each D-edge contains two vertices with different colors. The feasible set of a mixed hypergraph is the set of all k's for which there exists a proper coloring using exactly k colors. A hypergraph is a hypertree if there exists a tree such that the edges of the hypergraph induce connected subgraphs of the tree.We prove that feasible sets of mixed hypertrees are gap-free, i.e., intervals of integers, and we show that this is not true for precolored mixed hypertrees. The problem to decide whether a mixed hypertree can be colored by k colors is NP-complete in general; we investigate complexity of various restrictions of this problem and we characterize their complexity in most of the cases.  相似文献   
89.
Applying a Lindemann like criterion obtained previously by Kierfeld et al. [J. Kierfeld, T. Nattermann, T. Hwa, Phys. Rev. B 55 (1997) 626], we estimate the magnetic field and temperature for a high-Tc superconductor, at which a topologically ordered vortex glass phase becomes unstable with respect to a disorder-induced formation of dislocations. The employed criterion is shown to be equivalent to a conventional phenomenological Lindemann criterion including the values for the numerical factors, i.e., for the Lindemann number. The positional correlation length of the topologically ordered vortex glass is calculated.  相似文献   
90.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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