首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   195篇
  免费   10篇
化学   11篇
力学   22篇
数学   125篇
物理学   47篇
  2022年   1篇
  2020年   1篇
  2019年   3篇
  2018年   3篇
  2017年   6篇
  2016年   9篇
  2015年   4篇
  2014年   2篇
  2013年   5篇
  2012年   10篇
  2011年   4篇
  2010年   4篇
  2009年   6篇
  2008年   12篇
  2007年   8篇
  2006年   8篇
  2005年   8篇
  2004年   8篇
  2003年   9篇
  2002年   5篇
  2001年   4篇
  2000年   8篇
  1999年   3篇
  1998年   4篇
  1997年   1篇
  1995年   2篇
  1994年   2篇
  1993年   3篇
  1992年   1篇
  1990年   3篇
  1989年   1篇
  1988年   2篇
  1987年   4篇
  1986年   1篇
  1984年   3篇
  1983年   4篇
  1982年   4篇
  1978年   2篇
  1976年   7篇
  1975年   9篇
  1974年   3篇
  1973年   2篇
  1972年   1篇
  1971年   2篇
  1970年   1篇
  1969年   7篇
  1968年   1篇
  1967年   3篇
  1965年   1篇
排序方式: 共有205条查询结果,搜索用时 15 毫秒
51.
The effect of flow intensification in small-sized vortex cells on the flow pattern in the near wake downstream of a cylinder and the cylinder drag in laminar and turbulent flows is analyzed on the basis of a numerical simulation of the two-dimensional steady-state flow past a circular cylinder with rotating cylindrical bodies built into the cylinder contour. St. Petersburg, Saratov. Translated from Izvestiya Rossiiskoi Akademii Nauk, Mekhanika Zhidkosti i Gaza, No. 4, pp. 88–96, July–August, 2000. The study was carried out with the support of the Russian Foundation for Basic Research (projects Nos. 99-01-01115 and 99-01-00772).  相似文献   
52.
The amplitudes of the spatial harmonics of the field are calculated for given displacements of the electrodes in a quadrupole mass filter relative to their optimum positions. The cases of radial and angular displacements of the electrodes, asymmetries in voltage supplied to the electrodes, and nonidentical rod diameters are considered. These data are required for calculating the actual shape of the mass peaks and will be useful in designing mass filters. Zh. Tekh. Fiz. 69, 96–101 (October 1999)  相似文献   
53.
For a pair of integers 1≤γ<r, the γ-chromatic number of an r-uniform hypergraph H=(V, E) is the minimal k, for which there exists a partition of V into subsets T1,…,Tk such that |eTi|≤γ for every eE. In this paper we determine the asymptotic behavior of the γ-chromatic number of the random r-uniform hypergraph Hr(n, p) for all possible values of γ and for all values of p down to p=Θ(nr+1). © 1998 John Wiley & Sons, Inc. Random Struct. Alg., 12: 381–403, 1998  相似文献   
54.
55.
The notion of “Gaussian Lebesgue–Rokhlin space” is introduced. The definition is canonical, i.e., is given without use of topological and others irrelevant mathematical structures. The object under discussion completes the category of finite-dimensional Gaussian vector spaces. Some nontrivial examples are considered and historical comments are given. Bibliography: 30 titles.  相似文献   
56.
57.
In this paper we present three Ramsey‐type results, which we derive from a simple and yet powerful lemma, proved using probabilistic arguments. Let 3 ≤ r < s be fixed integers and let G be a graph on n vertices not containing a complete graph Ks on s vertices. More than 40 years ago Erd?s and Rogers posed the problem of estimating the maximum size of a subset of G without a copy of the complete graph Kr. Our first result provides a new lower bound for this problem, which improves previous results of various researchers. It also allows us to solve some special cases of a closely related question posed by Erd?s. For two graphs G and H, the Ramsey number R(G, H) is the minimum integer N such that any red‐blue coloring of the edges of the complete graph KN, contains either a red copy of G or a blue copy of H. The book with n pages is the graph Bn consisting of n triangles sharing one edge. Here we study the book‐complete graph Ramsey numbers and show that R(Bn, Kn) ≤ O(n3/log3/2n), improving the bound of Li and Rousseau. Finally, motivated by a question of Erd?s, Hajnal, Simonovits, Sós, and Szemerédi, we obtain for all 0 < δ < 2/3 an estimate on the number of edges in a K4‐free graph of order n which has no independent set of size n1‐δ. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2005  相似文献   
58.
59.
  Let PG2(2) be the Fano plane, i. e., the unique hypergraph with 7 triples on 7 vertices in which every pair of vertices is contained in a unique triple. In this paper we prove that for sufficiently large n, the maximum number of edges in a 3-uniform hypergraph on n vertices not containing a Fano plane is
Moreover, the only extremal configuration can be obtained by partitioning an n-element set into two almost equal parts, and taking all the triples that intersect both of them. This extends an earlier result of de Caen and Füredi, and proves an old conjecture of V. Sós. In addition, we also prove a stability result for the Fano plane, which says that a 3-uniform hypergraph with density close to 3/4 and no Fano plane is approximately 2-colorable. * Research supported in part by NSF grant DMS-0106589.  相似文献   
60.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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