首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1121篇
  免费   34篇
  国内免费   6篇
化学   768篇
力学   28篇
数学   149篇
物理学   216篇
  2024年   4篇
  2023年   10篇
  2022年   36篇
  2021年   45篇
  2020年   28篇
  2019年   40篇
  2018年   25篇
  2017年   32篇
  2016年   47篇
  2015年   42篇
  2014年   37篇
  2013年   64篇
  2012年   62篇
  2011年   94篇
  2010年   54篇
  2009年   67篇
  2008年   67篇
  2007年   77篇
  2006年   72篇
  2005年   54篇
  2004年   36篇
  2003年   28篇
  2002年   29篇
  2001年   8篇
  2000年   8篇
  1999年   7篇
  1998年   7篇
  1997年   9篇
  1996年   7篇
  1995年   8篇
  1994年   5篇
  1993年   5篇
  1992年   4篇
  1991年   2篇
  1990年   4篇
  1989年   4篇
  1988年   4篇
  1987年   3篇
  1986年   2篇
  1985年   2篇
  1984年   3篇
  1982年   3篇
  1981年   2篇
  1979年   1篇
  1978年   1篇
  1977年   3篇
  1975年   2篇
  1973年   1篇
  1964年   1篇
  1916年   3篇
排序方式: 共有1161条查询结果,搜索用时 15 毫秒
71.
72.
A new apparatus for the extraction of organic compounds from sea water is described. With this apparatus it is possible to extract 54 standard compounds with high recovery percentages from 9 1 of sea water with 3 ml ofn-hexane. The analysis time (about 1 h) is appreciably lower than those of the extraction methods based on RP-18 and Carbopack-B adsorption (about 15 h). Furthermore, it is possible to analyze samples without filtration. An application of this method to the analysis of Tirreno sea water is reported.  相似文献   
73.
74.
A matching covered graph is a non-trivial connected graph in which every edge is in some perfect matching. A non-bipartite matching covered graph G is near-bipartite if there are two edges e1 and e2 such that Ge1e2 is bipartite and matching covered. In 2000, Fischer and Little characterized Pfaffian near-bipartite graphs in terms of forbidden subgraphs [I. Fischer, C.H.C. Little, A characterization of Pfaffian near bipartite graphs, J. Combin. Theory Ser. B 82 (2001) 175-222.]. However, their characterization does not imply a polynomial time algorithm to recognize near-bipartite Pfaffian graphs. In this article, we give such an algorithm.We define a more general class of matching covered graphs, which we call weakly near-bipartite graphs. This class includes the near-bipartite graphs. We give a polynomial algorithm for recognizing weakly near-bipartite Pfaffian graphs. We also show that Fischer and Little’s characterization of near-bipartite Pfaffian graphs extends to this wider class.  相似文献   
75.
We consider the uniqueness of solution (i.e., nonsingularity) of systems of r generalized Sylvester and ?‐Sylvester equations with n×n coefficients. After several reductions, we show that it is sufficient to analyze periodic systems having, at most, one generalized ?‐Sylvester equation. We provide characterizations for the nonsingularity in terms of spectral properties of either matrix pencils or formal matrix products, both constructed from the coefficients of the system. The proposed approach uses the periodic Schur decomposition and leads to a backward stable O(n3r) algorithm for computing the (unique) solution.  相似文献   
76.
Mathematische Zeitschrift - The odd symplectic Grassmannian $$\mathrm {IG}:=\mathrm {IG}(k, 2n+1)$$ parametrizes k dimensional subspaces of $${\mathbb {C}}^{2n+1}$$ which are isotropic with respect...  相似文献   
77.
Motivated by a problem proposed in a coding competition for secondary students, I will show on this paper how coding substantially changed the problem-solving process towards a more experimental approach.  相似文献   
78.
We study the one-dimensional Riemann problem for a hyperbolic system of three conservation laws of Temple class. The system is a simplification of a recently proposed system of five conservations laws by Bouchut and Boyaval that models viscoelastic fluids. An important issue is that the considered 3×3 system is such that every characteristic field is linearly degenerate. We study theRiemann problemfor this system and under suitable generalized Rankine-Hugoniot relation and entropy condition, both existence and uniqueness of particular delta shock type solutions are established.  相似文献   
79.
80.
We study a compact invariant convex set E in a polar representation of a compact Lie group. Polar representations are given by the adjoint action of K on p, where K is a maximal compact subgroup of a real semisimple Lie group G with Lie algebra g = k ⊕ p. If a ? p is a maximal abelian subalgebra, then P = E ∩ a is a convex set in a. We prove that up to conjugacy the face structure of E is completely determined by that of P and that a face of E is exposed if and only if the corresponding face of P is exposed. We apply these results to the convex hull of the image of a restricted1 momentum map.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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