首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5686篇
  免费   208篇
  国内免费   264篇
化学   787篇
晶体学   21篇
力学   60篇
综合类   20篇
数学   3876篇
物理学   568篇
综合类   826篇
  2023年   25篇
  2022年   49篇
  2021年   49篇
  2020年   47篇
  2019年   138篇
  2018年   150篇
  2017年   100篇
  2016年   75篇
  2015年   100篇
  2014年   194篇
  2013年   376篇
  2012年   262篇
  2011年   334篇
  2010年   302篇
  2009年   437篇
  2008年   449篇
  2007年   368篇
  2006年   316篇
  2005年   208篇
  2004年   191篇
  2003年   180篇
  2002年   186篇
  2001年   165篇
  2000年   134篇
  1999年   193篇
  1998年   136篇
  1997年   101篇
  1996年   121篇
  1995年   108篇
  1994年   121篇
  1993年   76篇
  1992年   61篇
  1991年   49篇
  1990年   38篇
  1989年   46篇
  1988年   34篇
  1987年   26篇
  1986年   16篇
  1985年   23篇
  1984年   27篇
  1983年   8篇
  1982年   20篇
  1981年   33篇
  1980年   21篇
  1979年   15篇
  1978年   9篇
  1976年   7篇
  1975年   7篇
  1974年   9篇
  1973年   7篇
排序方式: 共有6158条查询结果,搜索用时 0 毫秒
81.
We prove that the quasilinear parabolic initial-boundary value problem (1.1) below is globally well-posed in a class of high order Sobolev solutions, and that these solutions possess compact, regular attractors ast+.  相似文献   
82.
We consider a period map from Teichmüller space to K}_2 {\text{,}}\mathcal{H}^1 {\text{)}}_\mathbb{R} $$ " align="middle" border="0"> , which is a real vector bundle over the Siegel upper half space. This map lifts the Torelli map. We study the action of the mapping class group on this period map. We show that the period map from Teichmüller space modulo the Johnson kernel is generically injective. We derive relations that the quadratic periods must satisfy. These identities are generalizations of the symmetry of the Riemann period matrix. Using these higher bilinear relations, we show that the period map factors through a translation of the subbundle and is completely determined by the purely holomorphic quadratic periods. We apply this result to strengthen some theorems in the literature. One application is that the quadratic periods, along with the abelian periods, determine a generic marked compact Riemann surface up to an element of the kernel of Johnson's homomorphism. Another application is that we compute the cocycle that exhibits the mapping class group modulo the Johnson kernel as an extension of the group SP g () by the group .  相似文献   
83.
For n6 all sets of n points in the plane with three distinct distances are determined.Dedicated to Professor Dr. Laszlo Fejes Töth on the occasion of his eightieth birthday  相似文献   
84.
We present second-order subdifferentials of Clarke's type of C 1,1 functions, defined in Banach spaces with separable duals. One of them is an extension of the generalized Hessian matrix of such functions in n , considered by J. B. H.-Urruty, J. J. Strodiot and V. H. Nguyen. Various properties of these subdifferentials are proved. Second-order optimality conditions (necessary, sufficient) for constrained minimization problems with C 1,1 data are obtained.This work was partially supported by the National Foundation for Scientific Investigations in Bulgaria under contract No. MM-406/1994.  相似文献   
85.
采用高温固溶加热法,在φ300轧机上模拟现场连铸坯热装炉轧制工艺,分别考察了K16Mn钢不同热装温度和开轧温度对轧材组织性能的影响.结果表明,热装轧制和常规冷装轧制屈服、抗拉强度相当,热装轧制成品塑性、韧性均较好.热装轧制工艺对K16Mn钢组织的影响,随着热装温度的提高,轧前奥氏体晶粒变得粗大,并且轧后组织混晶程度提高.这可通过提高开轧温度,首道次采用大压下量促使铸坯发生完全再结晶来消除.从而细化晶粒.改善成品组织性能.  相似文献   
86.
基于预校正方法,对P*(K)-矩阵线性互补问题给出了一个迭代复杂性为O(k+1)n2/3L)的宽邻域路径跟踪算法,算法改进了Zhang等的可行宽域路径跟踪算法的迭代复杂性;比迭代复杂性为O的小邻域路径跟踪算法为好.  相似文献   
87.
Given two arbitrary real matricesA andB of the same size, the orthogonal Procrustes problem is to find an orthogonal matrixM such that the Frobenius norm MA – B is minimized. This paper treats the common case when the orthogonal matrixM is required to have a positive determinant. The stability of the problem is studied and supremum results for the perturbation bounds are derived.  相似文献   
88.
The stability and convergence of the solutions of perturbed and regularized variational inequality to the solutions of the primary (unstable a priori) variational inequality with proper monotone operator are investigated. All the objects of inequality: the operatorA, the right-hand partf and the set of constrains are to be perturbed. At the same time no assumptions of boundedness and smoothness of the operatorA are used. The connection between the parameters of perturbations, which guarantees strong convergence of approximate solutions, is established. It is proved that the existence of the solution to the unperturbed variational inequality is necessary and sufficient condition for convergence of the regularized perturbed inequality solutions.This research was supported in part by the Ministry of Science Grant 3481-1-91 and by the Ministry of Absorption Center for Absorption in Science.  相似文献   
89.
Given a vector of real numbers=(1,... d ) d , the Jacobi-Perron algorithm and related algorithms, such as Brun's algorithm and Selmer's algorithm, produce a sequence of (d+1)×(d+1) convergent matrices {C(n)():n1} whose rows provide Diophantine approximations to . Such algorithms are specified by two mapsT:[0, 1] d [0, 1] d and A:[0,1] d GL(d+1,), which compute convergent matrices C(n)())...A(T())A(). The quality of the Diophantine approximations these algorithms find can be measured in two ways. The best approximation exponent is the upper bound of those values of for which there is some row of the convergent matrices such that for infinitely many values ofn that row of C(n)() has . The uniform approximation exponent is the upper bound of those values of such that for all sufficiently large values ofn and all rows of C(n)() one has . The paper applies Oseledec's multiplicative ergodic theorem to show that for a large class of such algorithms and take constant values and on a set of Lebesgue measure one. It establishes the formula where are the two largest Lyapunov exponents attached by Oseledec's multiplicative ergodic theorem to the skew-product (T, A,d), whered is aT-invariant measure, absolutely continuous with respect to Lebesgue measure. We conjecture that holds for a large class of such algorithms. These results apply to thed-dimensional Jacobi-Perron algorithm and Selmer's algorithm. We show that; experimental evidence of Baldwin (1992) indicates (nonrigorously) that. We conjecture that holds for alld2.  相似文献   
90.
IfC is a Polish probability space, a Borel set whose sectionsW x ( have measure one and are decreasing , then we show that the set x W x has measure one. We give two proofs of this theorem—one in the language of set theory, the other in the language of probability theory, and we apply the theorem to a question on completely uniformly distributed sequences.Supported by DFG grant Ko 490/7-1.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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