首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   12236篇
  免费   453篇
  国内免费   88篇
化学   8046篇
晶体学   102篇
力学   309篇
综合类   1篇
数学   2000篇
物理学   2319篇
  2023年   82篇
  2022年   94篇
  2021年   197篇
  2020年   218篇
  2019年   255篇
  2018年   179篇
  2017年   188篇
  2016年   418篇
  2015年   326篇
  2014年   361篇
  2013年   690篇
  2012年   656篇
  2011年   755篇
  2010年   496篇
  2009年   435篇
  2008年   697篇
  2007年   716篇
  2006年   587篇
  2005年   595篇
  2004年   500篇
  2003年   399篇
  2002年   383篇
  2001年   196篇
  2000年   189篇
  1999年   121篇
  1998年   122篇
  1997年   125篇
  1996年   126篇
  1995年   121篇
  1994年   105篇
  1993年   121篇
  1992年   98篇
  1991年   93篇
  1990年   89篇
  1989年   92篇
  1988年   70篇
  1987年   74篇
  1986年   93篇
  1985年   131篇
  1984年   121篇
  1983年   95篇
  1982年   93篇
  1981年   85篇
  1980年   88篇
  1979年   80篇
  1978年   95篇
  1977年   64篇
  1976年   66篇
  1975年   75篇
  1974年   74篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
82.
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.  相似文献   
83.
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.  相似文献   
84.
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.  相似文献   
85.
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.  相似文献   
86.
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.  相似文献   
87.
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.  相似文献   
88.
89.
Physical simulation was used to study pollution dispersion in a street canyon. The street canyon model was designed to study the effect of measuring flow and concentration fields. A method of C02-laser photoacoustic spectrometry was applied for detection of trace concentration of gas pollution. The advantage of this method is its high sensitivity and broad dynamic range, permitting monitoring of concentrations from trace to saturation values. Application of this method enabled us to propose a simple model based on line permeation pollutant source, developed on the principle of concentration standards, to ensure high precision and homogeneity of the concentration flow. Spatial measurement of the concentration distribution inside the street canyon was performed on the model with reference velocity of 1.5 m/s.  相似文献   
90.
The dependence of the on-shellS-matrix on the change of the Lagrangian induced by a nonlinear substitutionF() is investigated by means of a graphical analysis. A cancellation mechanism is found and used to show that the tree approximation of theS-matrix is independent of such a substitution and that the Jacobian of the substitution has to be introduced in order to cancel a new class of singular one-loop graphs and to recover the primaryS-matrix at the one-loop level.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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