首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1378274篇
  免费   29673篇
  国内免费   7730篇
化学   690151篇
晶体学   15361篇
力学   76229篇
综合类   113篇
数学   246895篇
物理学   386928篇
  2021年   13419篇
  2020年   15944篇
  2019年   16066篇
  2018年   15886篇
  2017年   14537篇
  2016年   29278篇
  2015年   21073篇
  2014年   30417篇
  2013年   74343篇
  2012年   41093篇
  2011年   41349篇
  2010年   39848篇
  2009年   41774篇
  2008年   39744篇
  2007年   36540篇
  2006年   38723篇
  2005年   33661篇
  2004年   33374篇
  2003年   30758篇
  2002年   31043篇
  2001年   29740篇
  2000年   25519篇
  1999年   22889篇
  1998年   21176篇
  1997年   21101篇
  1996年   19915篇
  1995年   18567篇
  1994年   18110篇
  1993年   17620篇
  1992年   17637篇
  1991年   17902篇
  1990年   17112篇
  1989年   17172篇
  1988年   16848篇
  1987年   16776篇
  1986年   15638篇
  1985年   22162篇
  1984年   23487篇
  1983年   19606篇
  1982年   21261篇
  1981年   20481篇
  1980年   19795篇
  1979年   20142篇
  1978年   21459篇
  1977年   21105篇
  1976年   20831篇
  1975年   19541篇
  1974年   19183篇
  1973年   19717篇
  1972年   14208篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
992.
We consider the method of normal forms, the Bogolyubov averaging method, and the method of asymptotic decomposition proposed by Yu. A. Mitropol’skii and the author of this paper. Under certain assumptions about group-theoretic properties of a system of zero approximation, the results obtained by the method of asymptotic decomposition coincide with the results obtained by the method of normal forms or the Bogolyubov averaging method. We develop a new algorithm of asymptotic decomposition by a part of the variables and its partial case — the algorithm of averaging on a compact Lie group. For the first time, it became possible to consider asymptotic expansions of solutions of differential equations on noncommutative compact groups.  相似文献   
993.
This paper deals mainly with generalizations of results in finitary combinatorics to infinite ordinals. It is well-known that for finite ordinals ∑bT<αβ is the number of 2-element subsets of an α-element set. It is shown here that for any well-ordered set of arbitrary infinite order type α, ∑bT<αβ is the ordinal of the set M of 2-element subsets, where M is ordered in some natural way. The result is then extended to evaluating the ordinal of the set of all n-element subsets for each natural number n ≥ 2. Moreover, series ∑β<αf(β) are investigated and evaluated, where α is a limit ordinal and the function f belongs to a certain class of functions containing polynomials with natural number coefficients. The tools developed for this result can be extended to cover all infinite α, but the case of finite α appears to be quite problematic.  相似文献   
994.
We give various representations of asymptotics for the probability for a Wiener process to reside within a curvilinear strip during extended time intervals.  相似文献   
995.
We present a new data structure for a set of n convex simply-shaped fat objects in the plane, and use it to obtain efficient and rather simple solutions to several problems including (i) vertical ray shooting—preprocess a set of n non-intersecting convex simply-shaped flat objects in 3-space, whose xy-projections are fat, for efficient vertical ray shooting queries, (ii) point enclosure—preprocess a set C of n convex simply-shaped fat objects in the plane, so that the k objects containing a query point p can be reported efficiently, (iii) bounded-size range searching— preprocess a set C of n convex fat polygons, so that the k objects intersecting a “not-too-large” query polygon can be reported efficiently, and (iv) bounded-size segment shooting—preprocess a set C as in (iii), so that the first object (if exists) hit by a “not-too-long” oriented query segment can be found efficiently. For the first three problems we construct data structures of size O(λs(n)log3n), where s is the maximum number of intersections between the boundaries of the (xy-projections) of any pair of objects, and λs(n) is the maximum length of (n, s) Davenport-Schinzel sequences. The data structure for the fourth problem is of size O(λs(n)log2n). The query time in the first problem is O(log4n), the query time in the second and third problems is O(log3n + klog2n), and the query time in the fourth problem is O(log3n).

We also present a simple algorithm for computing a depth order for a set as in (i), that is based on the solution to the vertical ray shooting problem. (A depth order for , if exists, is a linear order of , such that, if K1, K2 and K1 lies vertically above K2, then K1 precedes K2.) Unlike the algorithm of Agarwal et al. (1995) that might output a false order when a depth order does not exist, the new algorithm is able to determine whether such an order exists, and it is often more efficient in practical situations than the former algorithm.  相似文献   

996.
997.
998.
Alloys of the systems Fe–Al (mixable over the whole concentration range) and Fe–Mg (insoluble with each other) were produced by implantation of Fe ions into Al and Mg, respectively. The implantation energy was 200 keV and the ion doses ranged from 1 × 1014 to 9 × 1017cm-2The obtained implantation profiles were determined by Auger electron spectroscopy depth profiling. Maximum iron concentrations reached were up to 60 at.% for implantation into Al and 94 at.% for implantation into Mg. Phase analysis of the implanted layers was performed by conversion electron Mössbauer spectroscopy and X‐ray diffraction. For implantation into Mg, two different kinds of Mössbauer spectra were obtained: at low doses paramagnetic doublets indicating at least two different iron sites and at high doses a dominant ferromagnetic six‐line‐pattern with a small paramagnetic fraction. The X‐ray diffraction pattern concluded that in the latter case a dilated αiron lattice is formed. For implantation into Al, the Mössbauer spectra were doublet structures very similar to those obtained at amorphous Fe–Al alloys produced by rapid quenching methods. They also indicated at least two different main iron environments. For the highest implanted sample a ferromagnetic six‐line‐pattern with magnetic field values close to those of Fe3Al appeared.  相似文献   
999.
1000.
We report on the first observation and studies of a weak delocalizing logarithmic temperature dependence of the conductivity, which causes the conductivity of the 2D metal to increase as T decreases down to 16 mK. The prefactor of the logarithmic dependence is found to decrease gradually with density, to vanish at a critical density n c , 2∼2×1012 cm−2, and then to have the opposite sign at n>n c ,2. The second critical density sets the upper limit on the existence region of the 2D metal, whereas the conductivity at the critical point, G c ,2∼120e 2/h, sets an upper (low-temperature) limit on its conductivity. Pis’ma Zh. éksp. Teor. Fiz. 68, No. 6, 497–501 (25 September 1998) Published in English in the original Russian journal. Edited by Steve Torstveit.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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