首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1545篇
  免费   17篇
  国内免费   3篇
化学   27篇
晶体学   1篇
力学   3篇
数学   1429篇
物理学   105篇
  2023年   1篇
  2022年   5篇
  2021年   5篇
  2020年   4篇
  2019年   29篇
  2018年   20篇
  2017年   16篇
  2016年   5篇
  2015年   17篇
  2014年   34篇
  2013年   66篇
  2012年   66篇
  2011年   93篇
  2010年   73篇
  2009年   85篇
  2008年   112篇
  2007年   107篇
  2006年   111篇
  2005年   66篇
  2004年   56篇
  2003年   56篇
  2002年   26篇
  2001年   23篇
  2000年   25篇
  1999年   21篇
  1998年   32篇
  1997年   29篇
  1996年   58篇
  1995年   48篇
  1994年   58篇
  1993年   28篇
  1992年   32篇
  1991年   7篇
  1990年   22篇
  1989年   15篇
  1988年   6篇
  1987年   15篇
  1986年   5篇
  1985年   11篇
  1984年   5篇
  1983年   5篇
  1982年   13篇
  1981年   7篇
  1980年   10篇
  1979年   3篇
  1978年   7篇
  1977年   13篇
  1976年   13篇
  1975年   1篇
排序方式: 共有1565条查询结果,搜索用时 15 毫秒
991.
Let a set of points in the Euclidean plane be given. We are going to investigate the levels of the function measuring the sum of distances from the elements of the pointset which are called foci. Levels with only one focus are circles. In case of two different points as foci they are ellipses in the usual sense. If the set of the foci consists of more than two points then we have the so-called polyellipses. In this paper we investigate them from the viewpoint of differential geometry. We give a lower and upper bound for the curvature involving explicit constants. They depend on the number of the foci, the rate of the level and the global minimum of the function measuring the sum of the distances. The minimizer will be characterized by a theorem due to E. Weiszfeld together with a new proof. Explicit examples will also be given. As an application we present a new proof for a theorem due to P. Erd?s and I. Vincze. The result states that the approximation of a regular triangle by circumscribed polyellipses has an absolute error in the sense that there is no way to exceed it even if the number of the foci are arbitrary large.  相似文献   
992.
We consider a version of the open-open game, indicating its connections with universally Kuratowski-Ulam spaces. From [P. Daniels, K. Kunen, H. Zhou, On the open-open game, Fund. Math. 145 (3) (1994) 205-220] and [D. Fremlin, T. Natkaniec, I. Rec?aw, Universally Kuratowski-Ulam spaces, Fund. Math. 165 (3) (2000) 239-247] topological arguments are extracted to show that: Every I-favorable space is universally Kuratowski-Ulam, Theorem 8; If a compact space Y is I-favorable, then the hyperspaceexp(Y)with the Vietoris topology is I-favorable, and hence universally Kuratowski-Ulam, Theorems 6 and 9. Notions of uK-U and uK-U spaces are compared.  相似文献   
993.
Received: 2 May 1996/Revised version: 9 October 1996  相似文献   
994.
Summary Quasiperiodic tilings of kite-and-dart type, widely used as models for quasicrystals with decagonal symmetry, are constructed by means of somewhat artificial matching rules for the tiles. The proof of aperiodicity uses a self-similarity property, or inflation procedure, which requires drawing auxiliary lines. We introduce a modification of the kite-and-dart tilings which comes very naturally with both properties: the tiles are strictly self-similar, and their fractal boundaries provide perfect matching rules.  相似文献   
995.
Among all embedded closed manifolds with positive exterior curvature ≤k the ratio between the (d-1)-Hausdorff measure of the shadow boundary projection and the volume of M d is maximized by the sphere of radius 1/k. Received: 22 August 1997 / Revised version: 2 December 1997  相似文献   
996.
997.
We show that two limit results from random matrix theory, due to Marčenko–Pastur and Bai–Yin, are also valid for matrices with independent rows (as opposed to independent entries in the classical theory), when rows are uniformly distributed on the unit ball of np, under proper normalization. Research was supported in part by the European Network PHD, FP6 Marie Curie Actions, MCRN-511953 and was done in part while the author was visiting the University of Athens.  相似文献   
998.
Let T be a protoset of d-dimensional polyominoes. Which boxes (rectangular parallelepipeds) can be tiled by T? A nice result of Klarner and Göbel asserts that the answer to this question can always be given in a particularly simple form, namely, by giving a finite list of “prime” boxes. All other boxes that can be tiled can be deduced from these prime boxes. We give a new, simpler proof of this fundamental result. We also show that there is no upper bound to the number of prime boxes, even when restricting attention to singleton protosets. In the last section, we determine the set of prime rectangles for several small polyominoes.  相似文献   
999.
On Hyers-Ulam stability for a class of functional equations   总被引:1,自引:0,他引:1  
Summary In this paper we prove some stability theorems for functional equations of the formg[F(x, y)]=H[g(x), g(y), x, y]. As special cases we obtain well known results for Cauchy and Jensen equations and for functional equations in a single variable. Work supported by M.U.R.S.T. Research funds (60%).  相似文献   
1000.
We study farthest points and cut loci on doubly covered convex polygons, and determine them explicitly on doubly covered n-dimensional simplices.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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