首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2781篇
  免费   42篇
  国内免费   9篇
化学   1909篇
晶体学   41篇
力学   43篇
数学   569篇
物理学   270篇
  2018年   18篇
  2016年   34篇
  2015年   34篇
  2014年   37篇
  2013年   118篇
  2012年   58篇
  2011年   78篇
  2010年   42篇
  2009年   71篇
  2008年   87篇
  2007年   70篇
  2006年   81篇
  2005年   86篇
  2004年   87篇
  2003年   72篇
  2002年   76篇
  2001年   64篇
  2000年   49篇
  1999年   26篇
  1998年   38篇
  1997年   48篇
  1996年   46篇
  1995年   37篇
  1994年   52篇
  1993年   46篇
  1992年   48篇
  1991年   40篇
  1990年   45篇
  1989年   66篇
  1988年   67篇
  1987年   64篇
  1986年   32篇
  1985年   47篇
  1984年   50篇
  1983年   28篇
  1982年   49篇
  1981年   52篇
  1980年   69篇
  1979年   49篇
  1978年   49篇
  1977年   30篇
  1976年   32篇
  1975年   49篇
  1974年   39篇
  1973年   44篇
  1972年   33篇
  1971年   35篇
  1970年   32篇
  1967年   26篇
  1966年   23篇
排序方式: 共有2832条查询结果,搜索用时 0 毫秒
21.
Neutral spin texture (ST) excitations at nu=1/3 are directly observed for the first time by resonant inelastic light scattering. They are determined to involve two simultaneous spin flips. At low magnetic fields, the ST energy is below that of the magnetoroton minimum. With increasing in-plane magnetic field these mode energies cross at a critical ratio of the Zeeman and Coulomb energies of eta(c)=0.020+/-0.001. Surprisingly, the intensity of the ST mode grows with temperature in the range in which the magnetoroton modes collapse. The temperature dependence is interpreted in terms of a competition between coexisting phases supporting different excitations. We consider the role of the ST excitations in activated transport at nu=1/3.  相似文献   
22.
23.
Let t be the flow (parametrized with respect to arc length) of a smooth unit vector field v on a closed Riemannian manifold M n , whose orbits are geodesics. Then the (n-1)-plane field normal to v, v, is invariant under d t and, for each x M, we define a smooth real function x (t) : (1 + i (t)), where the i(t) are the eigenvalues of AA T, A being the matrix (with respect to orthonormal bases) of the non-singular linear map d2t , restricted to v at the point x -t M n.Among other things, we prove the Theorem (Theorem II, below). Assume v is also volume preserving and that x ' (t) 0 for all x M and real t; then, if x t : M M is weakly missng for some t, it is necessary that vx 0 at all x M.  相似文献   
24.
Summary Forf ( C n() and 0 t x letJ n (f, t, x) = (–1)n f(–x)f (n)(t) +f(x)f (n) (–t). We prove that the only real-analytic functions satisfyingJ n (f, t, x) 0 for alln = 0, 1, 2, are the exponential functionsf(x) = c e x,c, . Further we present a nontrivial class of real-analytic functions satisfying the inequalitiesJ 0 (f, x, x) 0 and 0 x (x – t)n – 1Jn(f, t, x)dt 0 (n 1).  相似文献   
25.
When the follower's optimality conditions are both necessary and sufficient, the nonlinear bilevel program can be solved as a global optimization problem. The complementary slackness condition is usually the complicating constraint in such problems. We show how this constraint can be replaced by an equivalent system of convex and separable quadratic constraints. In this paper, we propose different methods for finding the global minimum of a concave function subject to quadratic separable constraints. The first method is of the branch and bound type, and is based on rectangular partitions to obtain upper and lower bounds. Convergence of the proposed algorithm is also proved. For computational purposes, different procedures that accelerate the convergence of the proposed algorithm are analysed. The second method is based on piecewise linear approximations of the constraint functions. When the constraints are convex, the problem is reduced to global concave minimization subject to linear constraints. In the case of non-convex constraints, we use zero-one integer variables to linearize the constraints. The number of integer variables depends only on the concave parts of the constraint functions.Parts of the present paper were prepared while the second author was visiting Georgia Tech and the University of Florida.  相似文献   
26.
27.
Using infinitesimals, we develop Malliavin calculus on spaces which result from the classical Wiener space by replacing with any abstract Wiener space .We start from a Brownian motion b on a Loeb probability space Ω with values in the Banach space is the standard part of a ∗finite-dimensional Brownian motion B. Then we define iterated Itô integrals as standard parts of internal iterated Itô integrals. The integrator of the internal integrals is B and the values of the integrands are multilinear forms on , where is a ∗finite-dimensional linear space over between the Hilbert space and its ∗-extension .In the first part we prove a chaos decomposition theorem for L2-functionals on Ω that are measurable with respect to the σ-algebra generated by b. This result yields a chaos decomposition of L2-functionals with respect to the Wiener measure on the standard space of -valued continuous functions on [0,1]. In the second part we define the Malliavin derivative and the Skorohod integral as standard parts of internal operators defined on ∗finite-dimensional spaces. In an application we use the transformation rule for finite-dimensional Euclidean spaces to study time anticipating and non-anticipating shifts of Brownian motion by Bochner integrals (Girsanov transformations).  相似文献   
28.
Mössbauer spectroscopy has been applied to two rattle stones found in the Netherlands, which have been formed under different pedoenvironment conditions in the past. Ultrafine particles of goethite are dominantly present in both core and mantle of these stones. The latter differs in both composition and mean particle size; this is related to the distinct manner of their formation.  相似文献   
29.
On spanning tree problems with multiple objectives   总被引:4,自引:0,他引:4  
We investigate two versions of multiple objective minimum spanning tree problems defined on a network with vectorial weights. First, we want to minimize the maximum ofQ linear objective functions taken over the set of all spanning trees (max-linear spanning tree problem, ML-ST). Secondly, we look for efficient spanning trees (multi-criteria spanning tree problem, MC-ST).Problem ML-ST is shown to be NP-complete. An exact algorithm which is based on ranking is presented. The procedure can also be used as an approximation scheme. For solving the bicriterion MC-ST, which in the worst case may have an exponential number of efficient trees, a two-phase procedure is presented. Based on the computation of extremal efficient spanning trees we use neighbourhood search to determine a sequence of solutions with the property that the distance between two consecutive solutions is less than a given accuracy.Partially supported by Deutsche Forschungsgemeinschaft and HCº Contract no. ERBCHRXCT 930087.Partially supported by Alexander von Humboldt-Stiftung.  相似文献   
30.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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