首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2069篇
  免费   209篇
  国内免费   219篇
化学   100篇
晶体学   1篇
力学   87篇
综合类   76篇
数学   1919篇
物理学   314篇
  2024年   5篇
  2023年   20篇
  2022年   27篇
  2021年   35篇
  2020年   49篇
  2019年   59篇
  2018年   75篇
  2017年   48篇
  2016年   67篇
  2015年   48篇
  2014年   75篇
  2013年   152篇
  2012年   54篇
  2011年   98篇
  2010年   94篇
  2009年   114篇
  2008年   135篇
  2007年   145篇
  2006年   138篇
  2005年   133篇
  2004年   114篇
  2003年   119篇
  2002年   110篇
  2001年   76篇
  2000年   81篇
  1999年   87篇
  1998年   75篇
  1997年   60篇
  1996年   34篇
  1995年   23篇
  1994年   23篇
  1993年   17篇
  1992年   17篇
  1991年   5篇
  1990年   9篇
  1989年   14篇
  1988年   7篇
  1987年   4篇
  1986年   7篇
  1985年   11篇
  1984年   5篇
  1983年   2篇
  1982年   3篇
  1981年   4篇
  1979年   7篇
  1978年   2篇
  1977年   3篇
  1976年   2篇
  1974年   2篇
  1959年   1篇
排序方式: 共有2497条查询结果,搜索用时 15 毫秒
1.
2.
A stable and efficient Pd(OAc)2/PPh3/PEG‐2000 catalytic system for homocoupling of arylboronic acids has been developed. In the presence of Pd(OAc)2 and PPh3, the homocoupling reaction of arylboronic acids was carried out smoothly in PEG‐2000 at 70 °C under air without base to afford a variety of symmetric biaryls in good to excellent yields. The isolation of the products was readily performed by extraction with diethyl ether, and the Pd(OAc)2/PPh3/PEG‐2000 system could be easily recycled and reused six times without significant loss of catalytic activity. Copyright © 2014 John Wiley & Sons, Ltd.  相似文献   
3.
Parallel preconditioners are presented for the solution of general linear systems of equations. The computation of these preconditioners is achieved by orthogonal projections related to the Frobenius inner product. So, minM∈??AM?IF and matrix M0∈?? corresponding to this minimum (?? being any vectorial subspace of ??n(?)) are explicitly computed using accumulative formulae in order to reduce computational cost when subspace ?? is extended to another one containing it. Every step, the computation is carried out taking advantage of the previous one, what considerably reduces the amount of work. These general results are illustrated with the subspace of matrices M such that AM is symmetric. The main application is developed for the subspace of matrices with a given sparsity pattern which may be constructed iteratively by augmenting the set of non‐zero entries in each column. Finally, the effectiveness of the sparse preconditioners is illustrated with some numerical experiments. Copyright © 2002 John Wiley & Sons, Ltd.  相似文献   
4.
We study minimal submanifolds in the locally symmetric and conformally flat Riemannian manifold and generalize Yau's result obtained in J. Amer. Math. 97 (1975), 76–100.  相似文献   
5.
Matroid bundles, introduced by MacPherson, are combinatorial analogues of real vector bundles. This paper sets up the foundations of matroid bundles. It defines a natural transformation from isomorphism classes of real vector bundles to isomorphism classes of matroid bundles. It then gives a transformation from matroid bundles to spherical quasifibrations, by showing that the geometric realization of a matroid bundle is a spherical quasifibration. The poset of oriented matroids of a fixed rank classifies matroid bundles, and the above transformations give a splitting from topology to combinatorics back to topology. A consequence is that the mod 2 cohomology of the poset of rank k oriented matroids (this poset classifies matroid bundles) contains the free polynomial ring on the first k Stiefel-Whitney classes.  相似文献   
6.
An algorithm is constructed for calculating invariant subspaces of symmetric hyperbolic systems arising in electromagnetic, acoustic, and elasticity problems. Discrete approximations are calculated for subspaces that correspond to minimal eigenvalues and smooth eigenfunctions. Difficulties related to the presence of an infinite-dimensional kernel in the differential operator are successfully handled. The efficiency of the algorithm is demonstrated using acoustics equations.  相似文献   
7.
A new method is presented for the determination of Ricci Collineations (RC) and Matter Collineations (MC) of a given spacetime, in the cases where the Ricci tensor and the energy momentum tensor are non-degenerate and have a similar form with the metric. This method reduces the problem of finding the RCs and the MCs to that of determining the KVs whereas at the same time uses already known results on the motions of the metric. We employ this method to determine all hypersurface homogeneous locally rotationally symmetric spacetimes, which admit proper RCs and MCs. We also give the corresponding collineation vectors. These results conclude a long due open problem, which has been considered many times partially in the literature.  相似文献   
8.
障碍拟阵图     
Let G be a simple graph and T={S :S is extreme in G}. If M(V(G), T) is a matroid, then G is called an extreme matroid graph. In this paper, we study the properties of extreme matroid graph.  相似文献   
9.
By extracting combinatorial structures in well-solved nonlinear combinatorial optimization problems, Murota (1996,1998) introduced the concepts of M-convexity and L-convexity to functions defined over the integer lattice. Recently, Murota–Shioura (2000, 2001) extended these concepts to polyhedral convex functions and quadratic functions in continuous variables. In this paper, we consider a further extension to more general convex functions defined over the real space, and provide a proof for the conjugacy relationship between general M-convex and L-convex functions.Mathematics Subject Classification (1991): 90C10, 90C25, 90C27, 90C35This work is supported by Grant-in-Aid of the Ministry of Education, Culture, Sports, Science and Technology of Japan  相似文献   
10.
We construct the polynomial quantization on the space G/H where G=SL(n,R),H=GL(n–1,R). It is a variant of quantization in the spirit of Berezin. In our case covariant and contravariant symbols are polynomials on G/H. We introduce a multiplication of covariant symbols, establish the correspondence principle, study transformations of symbols (the Berezin transform) and of operators. We write a full asymptotic decomposition of the Berezin transform.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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