首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2814篇
  免费   323篇
  国内免费   279篇
化学   86篇
晶体学   5篇
力学   221篇
综合类   50篇
数学   2281篇
物理学   773篇
  2024年   6篇
  2023年   25篇
  2022年   43篇
  2021年   44篇
  2020年   59篇
  2019年   57篇
  2018年   68篇
  2017年   80篇
  2016年   79篇
  2015年   73篇
  2014年   145篇
  2013年   220篇
  2012年   90篇
  2011年   129篇
  2010年   111篇
  2009年   172篇
  2008年   213篇
  2007年   194篇
  2006年   170篇
  2005年   139篇
  2004年   128篇
  2003年   169篇
  2002年   148篇
  2001年   112篇
  2000年   109篇
  1999年   91篇
  1998年   85篇
  1997年   83篇
  1996年   58篇
  1995年   32篇
  1994年   36篇
  1993年   24篇
  1992年   21篇
  1991年   24篇
  1990年   16篇
  1989年   10篇
  1988年   16篇
  1987年   13篇
  1986年   19篇
  1985年   20篇
  1984年   12篇
  1983年   5篇
  1982年   9篇
  1981年   14篇
  1980年   7篇
  1979年   10篇
  1978年   9篇
  1977年   7篇
  1975年   4篇
  1974年   4篇
排序方式: 共有3416条查询结果,搜索用时 453 毫秒
921.
Let be the 7-dimensional irreducible representations of . We decompose the tensor power into irreducible representations of and obtain all irreducible representations of in the decomposition. This generalizes Weyl's work on the construction of irreducible representations and decomposition of tensor products for classical groups to the exceptional group .

  相似文献   

922.
Finding good cycles in graphs is a problem of great interest in graph theory as well as in locational analysis. We show that the center and median problems are NP-hard in general graphs. This result holds both for the variable cardinality case (i.e., all cycles of the graph are considered) and the fixed cardinality case (i.e., only cycles with a given cardinality p are feasible). Hence it is of interest to investigate special cases where the problem is solvable in polynomial time. In grid graphs, the variable cardinality case is, for instance, trivially solvable if the shape of the cycle can be chosen freely. If the shape is fixed to be a rectangle one can analyze rectangles in grid graphs with, in sequence, fixed dimension, fixed cardinality, and variable cardinality. In all cases a complete characterization of the optimal cycles and closed form expressions of the optimal objective values are given, yielding polynomial time algorithms for all cases of center rectangle problems. Finally, it is shown that center cycles can be chosen as rectangles for bounded cardinalities such that the center cycle problem in grid graphs is in these cases completely solved.  相似文献   
923.
We obtain (two equivalent) presentations — in terms of generators and relations — of the planar algebra associated with the subfactor corresponding to (an outer action on a factor by) a finite-dimensional Kac algebra. One of the relations shows that the antipode of the Kac algebra agrees with the ‘rotation on 2-boxes’.  相似文献   
924.
In the canonical smooth fiber bundles endowed with the metric tensor fields of relevant structure, we consider natural representations of the Galilean groups and construct -invariant generalizations of differentiable connections. In both regular and special cases of the representations of the relevant groups , we found all the affine nonholonomic -, -, and -connections of the first order (see [1]–[3]) possessing the local Lie groups of transformations and also described the respective -invariant planar connections.  相似文献   
925.
Goldys  B.  Gozzi  F.  van Neerven  J.M.A.M. 《Potential Analysis》2003,18(4):289-310
Let be a centred Gaussian measure on a separable real Banach space E, and let H be a Hilbert subspace of E. We provide necessary and sufficient conditions for closability in L p (E,) of the gradient D H in the direction of H. These conditions are further elaborated in case when the gradient D H corresponds to a bilinear form associated with a certain nonsymmetric Ornstein–Uhlenbeck operator. Some natural examples of closability and nonclosability are presented.  相似文献   
926.
一类具约束选址模型的组合算法   总被引:1,自引:0,他引:1  
杨益民 《应用数学》2003,16(3):70-74
针对一般具闭凸集约束的单址选址模型,提出具全局收敛性的组合算法.算法在迭代中先采用信赖域技巧,当出现“内循环”时,则改用不做线搜索的梯度法.该算法既具有信赖域算法的优越性,又避免了出现“内循环”时速成的隐迭代.同时,该算法通常不需进行线搜索,较之其它组合算法更加简捷实用.  相似文献   
927.
The existence of Silnikov’s orbits in one coupled Duffing equation is discussed by using the fiber structure of invariant manifold and high-dimensional Melnikov’s method. Example and numerical simulation results are also given to demonstrate the theoretical analysis.  相似文献   
928.
Fix a free, orientation-preserving action of a finite group on a -dimensional handlebody . Whenever acts freely preserving orientation on a connected -manifold , there is a -equivariant imbedding of into . There are choices of closed and Seifert-fibered for which the image of is a handlebody of a Heegaard splitting of . Provided that the genus of is at least , there are similar choices with closed and hyperbolic.

  相似文献   

929.
It is a well-known paradigm to consider Vassiliev invariants as polynomials on the set of knots. We prove the following characterization: a rational knot invariant is a Vassiliev invariant of degree if and only if it is a polynomial of degree on every geometric sequence of knots. Here a sequence with is called geometric if the knots coincide outside a ball , inside of which they satisfy for all and some pure braid . As an application we show that the torsion in the braid group over the sphere induces torsion at the level of Vassiliev invariants: there exist knots in that can be distinguished by -invariants of finite type but not by rational invariants of finite type. In order to obtain such torsion invariants we construct over a universal Vassiliev invariant of degree for knots in .

  相似文献   

930.
Using new extrapolation estimates for the - and -functionals of couples of limit spaces of the -scale , we introduce a class of extrapolation functors. A characterization of this class via the real interpolation method permits one to obtain new equivalent expressions for the norms in symmetric spaces close to and , which depend only on the -norms of a function.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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