首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5586篇
  免费   355篇
  国内免费   105篇
化学   820篇
晶体学   33篇
力学   147篇
综合类   84篇
数学   1118篇
物理学   1372篇
无线电   2472篇
  2024年   2篇
  2023年   14篇
  2022年   35篇
  2021年   105篇
  2020年   117篇
  2019年   32篇
  2018年   41篇
  2017年   112篇
  2016年   139篇
  2015年   157篇
  2014年   264篇
  2013年   316篇
  2012年   257篇
  2011年   390篇
  2010年   354篇
  2009年   367篇
  2008年   410篇
  2007年   398篇
  2006年   354篇
  2005年   273篇
  2004年   257篇
  2003年   264篇
  2002年   219篇
  2001年   185篇
  2000年   161篇
  1999年   107篇
  1998年   124篇
  1997年   102篇
  1996年   110篇
  1995年   74篇
  1994年   72篇
  1993年   44篇
  1992年   26篇
  1991年   28篇
  1990年   18篇
  1989年   15篇
  1988年   12篇
  1987年   12篇
  1986年   18篇
  1985年   18篇
  1984年   16篇
  1983年   6篇
  1982年   3篇
  1981年   4篇
  1980年   2篇
  1976年   4篇
  1970年   1篇
  1969年   1篇
  1967年   2篇
  1966年   1篇
排序方式: 共有6046条查询结果,搜索用时 15 毫秒
771.
Let X and Y be Banach spaces and f:XY an odd mapping. We solve the following generalized additive functional equation
  相似文献   
772.
Let A be an n×n complex matrix and r be the maximum size of its principal submatrices with no off-diagonal zero entries. Suppose A has zero main diagonal and x is a unit n-vector. Then, letting ‖A‖ be the Frobenius norm of A, we show that
|〈Ax,x|2?(1−1/2r−1/2n)‖A2.  相似文献   
773.
In this paper a new class of higher order (F,ρ,σ)-type I functions for a multiobjective programming problem is introduced, which subsumes several known studied classes. Higher order Mond-Weir and Schaible type dual programs are formulated for a nondifferentiable multiobjective fractional programming problem where the objective functions and the constraints contain support functions of compact convex sets in Rn. Weak and strong duality results are studied in both the cases assuming the involved functions to be higher order (F,ρ,σ)-type I. A number of previously studied problems appear as special cases.  相似文献   
774.
Let X be a Banach space and Z a nonempty subset of X. Let J:ZR be a lower semicontinuous function bounded from below and p?1. This paper is concerned with the perturbed optimization problem of finding z0Z such that ‖xz0p+J(z0)=infzZ{‖xzp+J(z)}, which is denoted by minJ(x,Z). The notions of the J-strictly convex with respect to Z and of the Kadec with respect to Z are introduced and used in the present paper. It is proved that if X is a Kadec Banach space with respect to Z and Z is a closed relatively boundedly weakly compact subset, then the set of all xX for which every minimizing sequence of the problem minJ(x,Z) has a converging subsequence is a dense Gδ-subset of X?Z0, where Z0 is the set of all points zZ such that z is a solution of the problem minJ(z,Z). If additionally p>1 and X is J-strictly convex with respect to Z, then the set of all xX for which the problem minJ(x,Z) is well-posed is a dense Gδ-subset of X?Z0.  相似文献   
775.
Let D be a directed graph; the (l,ω)-Independence Number of graph D, denoted by αl,ω(D), is an important performance parameter for interconnection networks. De Bruijn networks and Kautz networks, denoted by B(d,n) and K(d,n) respectively, are versatile and efficient topological structures of interconnection networks. For l=1,2,…,n, this paper shows that αl,d−1(B(d,n))=dn,αl,d−1(K(d,n))=αl,d(K(d,n))=dn+dn−1 if d≥3 and nd−2. In particular, the paper shows the exact value of the Independence Number for B(d,1) and B(d,2) for any d. For the generalized situation, the paper obtains a lower bound αl,d−1(B(d,n))≥d2 if n≥3 and d≥5.  相似文献   
776.
777.
In this paper, a new monotonicity, MM-monotonicity, is introduced, and the resolvent operator of an MM-monotone operator is proved to be single valued and Lipschitz continuous. With the help of the resolvent operator, an equivalence between the variational inequality VI(C,F+G)(C,F+G) and the fixed point problem of a nonexpansive mapping is established. A proximal point algorithm is constructed to solve the fixed point problem, which is proved to have a global convergence under the condition that FF in the VI problem is strongly monotone and Lipschitz continuous. Furthermore, a convergent path Newton method, which is based on the assumption that the projection mapping C(⋅)C() is semismooth, is given for calculating εε-solutions to the sequence of fixed point problems, enabling the proximal point algorithm to be implementable.  相似文献   
778.
In this paper we generalize classical LqLq, q≥pqp, estimates of the gradient to the Orlicz space for weak solutions of quasilinear elliptic equations of p-Laplacian type.  相似文献   
779.
780.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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