首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   9613篇
  国内免费   132篇
  完全免费   94篇
  数学   9839篇
  2019年   5篇
  2018年   34篇
  2017年   26篇
  2016年   47篇
  2015年   86篇
  2014年   140篇
  2013年   128篇
  2012年   142篇
  2011年   201篇
  2010年   149篇
  2009年   192篇
  2008年   197篇
  2007年   145篇
  2006年   233篇
  2005年   286篇
  2004年   283篇
  2003年   389篇
  2002年   531篇
  2001年   390篇
  2000年   394篇
  1999年   375篇
  1998年   363篇
  1997年   316篇
  1996年   240篇
  1995年   162篇
  1994年   149篇
  1993年   150篇
  1992年   256篇
  1991年   229篇
  1990年   151篇
  1989年   261篇
  1988年   167篇
  1987年   146篇
  1986年   155篇
  1985年   137篇
  1984年   140篇
  1983年   61篇
  1982年   191篇
  1981年   131篇
  1980年   164篇
  1979年   178篇
  1978年   205篇
  1977年   95篇
  1976年   148篇
  1975年   51篇
  1974年   48篇
  1973年   231篇
  1972年   127篇
  1971年   104篇
  1970年   86篇
  1969年   43篇
  1968年   26篇
  1967年   80篇
  1966年   33篇
  1965年   35篇
  1964年   44篇
  1963年   42篇
  1962年   79篇
  1961年   34篇
  1960年   34篇
  1959年   29篇
  1958年   6篇
  1957年   6篇
  1956年   13篇
  1955年   11篇
  1954年   8篇
  1953年   8篇
  1952年   13篇
  1951年   6篇
  1950年   4篇
  1949年   1篇
  1941年   2篇
  1939年   4篇
  1938年   1篇
  1937年   1篇
  1936年   9篇
  1935年   6篇
  1934年   6篇
  1933年   2篇
  1932年   3篇
  1931年   4篇
  1930年   2篇
  1929年   4篇
  1928年   2篇
  1927年   1篇
  1926年   2篇
  1924年   1篇
  1922年   3篇
  1917年   2篇
  1916年   1篇
  1914年   1篇
  1913年   4篇
  1911年   1篇
  1910年   2篇
  1909年   1篇
  1908年   4篇
排序方式: 共有9839条查询结果,搜索用时 109 毫秒
1.
A new polynomial-time algorithm for linear programming   总被引:116,自引:0,他引:116  
We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requiresO(n 3.5 L) arithmetic operations onO(L) bit numbers, wheren is the number of variables andL is the number of bits in the input. The running-time of this algorithm is better than the ellipsoid algorithm by a factor ofO(n 2.5). We prove that given a polytopeP and a strictly interior point a εP, there is a projective transformation of the space that mapsP, a toP′, a′ having the following property. The ratio of the radius of the smallest sphere with center a′, containingP′ to the radius of the largest sphere with center a′ contained inP′ isO(n). The algorithm consists of repeated application of such projective transformations each followed by optimization over an inscribed sphere to create a sequence of points which converges to the optimal solution in polynomial time. This is a substantially revised version of the paper presented at the Symposium on Theory of Computing, Washington D. C., April 1984.  相似文献
2.
Nonlinear programming without a penalty function   总被引:52,自引:0,他引:52  
In this paper the solution of nonlinear programming problems by a Sequential Quadratic Programming (SQP) trust-region algorithm is considered. The aim of the present work is to promote global convergence without the need to use a penalty function. Instead, a new concept of a “filter” is introduced which allows a step to be accepted if it reduces either the objective function or the constraint violation function. Numerical tests on a wide range of test problems are very encouraging and the new algorithm compares favourably with LANCELOT and an implementation of Sl1QP. Received: October 17, 1997 / Accepted: August 17, 2000?Published online September 3, 2001  相似文献
3.
Bayesian image restoration,with two applications in spatial statistics   总被引:29,自引:0,他引:29  
There has been much recent interest in Bayesian image analysis, including such topics as removal of blur and noise, detection of object boundaries, classification of textures, and reconstruction of two- or three-dimensional scenes from noisy lower-dimensional views. Perhaps the most straightforward task is that of image restoration, though it is often suggested that this is an area of relatively minor practical importance. The present paper argues the contrary, since many problems in the analysis of spatial data can be interpreted as problems of image restoration. Furthermore, the amounts of data involved allow routine use of computer intensive methods, such as the Gibbs sampler, that are not yet practicable for conventional images. Two examples are given, one in archeology, the other in epidemiology. These are preceded by a partial review of pixel-based Bayesian image analysis.An earlier version of this article was presented at the symposium on the Analysis of Statistical Information held in the Institute of Statistical Mathematics, Tokyo during December 5–8, 1989.This research was carried out partly at the University of Durham, U.K., with the support of an award by the Complex Stochastic Systems Initiative of the Science and Engineering Research Council.  相似文献
4.
Summary. The interpolation theorem for convex quadrilateral isoparametric finite elements is proved in the case when the condition is not satisfied, where is the diameter of the element and is the radius of an inscribed circle in . The interpolation error is in the -norm and in the -norm provided that the interpolated function belongs to . In the case when the long sides of the quadrilateral are parallel the constants appearing in the estimates are evaluated. Received September 1993 / Revised version received March 6, 1995  相似文献
5.
The coordination problem of a supply chain comprising one supplier and one retailer under market demand disruption is studied in this article. A novel exponential demand function is adopted, and the penalty cost is introduced explicitly to capture the deviation production cost caused by the market demand disruption. The optimal strategies are obtained for different disruption scale under the centralized mode. For the decentralized mode, it is proved that the supply chain can be fully coordinated by adjusting the price discount policy appropriately when disruption occurs. Furthermore, the authors point out that similar results can be established for more general demand functions that represent different market circumstances if certain assumptions are satisfied.  相似文献
6.
Complex geometry and operator theory   总被引:19,自引:0,他引:19  
7.
This paper presents a sequential quadratic programming algorithm for computing a stationary point of a mathematical program with linear complementarity constraints. The algorithm is based on a reformulation of the complementarity condition as a system of semismooth equations by means of Fischer-Burmeister functional, combined with a classical penalty function method for solving constrained optimization problems. Global convergence of the algorithm is established under appropriate assumptions. Some preliminary computational results are reported.  相似文献
8.
This paper presents a sequential quadratic programming algorithm for computing a stationary point of a mathematical program with linear complementarity constraints. The algorithm is based on a reformulation of the complementarity condition as a system of semismooth equations by means of Fischer-Burmeister functional, combined with a classical penalty function method for solving constrained optimization problems. Global convergence of the algorithm is established under appropriate assumptions. Some preliminary computational results are reported.  相似文献
9.
LetX be a Banach space,K a nonempty, bounded, closed and convex subset ofX, and supposeT:K→K satisfies: for eachx∈K, lim sup i→∞{sup y∈K t ix−Tiy∼−‖x−y‖}≦0. IfT N is continuous for some positive integerN, and if either (a)X is uniformly convex, or (b)K is compact, thenT has a fixed point inK. The former generalizes a theorem of Goebel and Kirk for asymptotically nonexpansive mappings. These are mappingsT:K→K satisfying, fori sufficiently large, ‖Tix−Tiy‖≦k ix−y∼,x,y∈K, wherek i→1 asi→∞. The precise assumption in (a) is somewhat weaker than uniform convexity, requiring only that Goebel’s characteristic of convexity, ɛ0 (X), be less than one. Research supported by National Science Foundation Grant GP 18045.  相似文献
10.
Convolutions, Transforms, and Convex Bodies   总被引:17,自引:0,他引:17  
The paper studies convex bodies and star bodies in Rn by usingRadon transforms on Grassmann manifolds, p-cosine transformson the unit sphere, and convolutions on the rotation group ofRn. It presents dual mixed volume characterizations of i-intersectionbodies and Lp-balls which are related to certain volume inequalitiesfor cross sections of convex bodies. It considers approximationsof special convex bodies by analytic bodies and various finitesums of ellipsoids which preserve special geometric properties.Convolution techniques are used to derive formulas for mixedvolumes, mixed surface measures, and p-cosine transforms. Theyare also used to prove characterizations of geometric functionals,such as surface area and dual quermassintegrals. 1991 MathematicsSubject Classification: 52A20, 52A40.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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