首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3765篇
  国内免费   260篇
  完全免费   391篇
  数学   4416篇
  2021年   12篇
  2020年   31篇
  2019年   123篇
  2018年   110篇
  2017年   129篇
  2016年   91篇
  2015年   91篇
  2014年   137篇
  2013年   384篇
  2012年   150篇
  2011年   201篇
  2010年   180篇
  2009年   302篇
  2008年   312篇
  2007年   303篇
  2006年   264篇
  2005年   192篇
  2004年   175篇
  2003年   172篇
  2002年   174篇
  2001年   117篇
  2000年   145篇
  1999年   122篇
  1998年   140篇
  1997年   93篇
  1996年   64篇
  1995年   51篇
  1994年   44篇
  1993年   28篇
  1992年   12篇
  1991年   9篇
  1990年   7篇
  1989年   11篇
  1988年   2篇
  1987年   4篇
  1986年   4篇
  1985年   8篇
  1984年   5篇
  1982年   2篇
  1980年   6篇
  1979年   3篇
  1978年   2篇
  1977年   1篇
  1976年   1篇
  1973年   1篇
  1970年   1篇
排序方式: 共有4416条查询结果,搜索用时 39 毫秒
1.
剩余格与正则剩余格的特征定理   总被引:53,自引:1,他引:52       下载免费PDF全文
裴道武 《数学学报》2002,45(2):271-278
本文进一步研究了具有广泛应用的一类模糊逻辑代数系统——剩余格,并引入了正则剩余格的概念,对剩余格与正则剩余格的定义进行了讨论,给出了剩余格与正则剩余格的特征定理,其中包含剩余格与正则剩余格的等式特征,从而这两个格类都构成簇.本文还讨论了剩余格与正则剩余格公理系统的独立性,以及它们与相近代数结构的关系.  相似文献
2.
分次环的分次Jacobson根   总被引:25,自引:2,他引:23  
王尧 《数学学报》1998,41(2):0347-0354
本文通过引入弱拟正则元的概念,对一般Monoid分次环A(未必有1)给出以内部元素刻划的分次Jacobson根JG(A).证明当A有1时,JG(A)与通常定义的Jg(A)相等.对JG(A)性质的讨论,推广了最近的许多结果.作为应用,我们给出了Artin分次环的全部基本结构定理.  相似文献
3.
蕴涵格及其Fuzzy拓扑表现定理   总被引:25,自引:0,他引:25       下载免费PDF全文
王国俊 《数学学报》1999,42(1):133-140
以L-Lindenbaum代数为背景,引入了蕴涵格与正则蕴涵格的概念,讨论了其基本性质,引入了Fuzzy蕴涵空间的概念,为点集拓扑学中零维空间概念的推广.建立了正则蕴涵格的Fuzzy蕴涵空间表现定理,以此为基础可以给出著名的Stone表现定理的另一种证明.  相似文献
4.
关于序列覆盖紧映射   总被引:23,自引:0,他引:23       下载免费PDF全文
林寿  燕鹏飞 《数学学报》2001,44(1):175-182
本文利用了cs网、序列邻域网、序列开网和弱基的概念,讨论了空间中点正则覆盖,一致覆盖和点有限覆盖的点星网之间的关系.建立了度量空间在几类序列覆盖(紧)映射下象空间的特征,特别地证明了度量空间的序列覆盖(或1序列覆盖)紧映象等价于具有点正则cs网的空问,回答了Tanaka等提出的一个问题.  相似文献
5.
A contribution to large deviations for heavy-tailed random sums   总被引:22,自引:0,他引:22  
In this paper we consider the large deviations for random sums , whereX n,n⩾1 are independent, identically distributed and non-negative random variables with a common heavy-tailed distribution function F, andN(t), t⩾0 is a process of non-negative integer-valued random variables, independent ofX n,n⩾1. Under the assumption that the tail of F is of Pareto’s type (regularly or extended regularly varying), we investigate what reasonable condition can be given onN(t), t⩾0 under which precise large deviation for S( t) holds. In particular, the condition we obtain is satisfied for renewal counting processes.  相似文献
6.
Error bounds in mathematical programming   总被引:22,自引:0,他引:22  
Originated from the practical implementation and numerical considerations of iterative methods for solving mathematical programs, the study of error bounds has grown and proliferated in many interesting areas within mathematical programming. This paper gives a comprehensive, state-of-the-art survey of the extensive theory and rich applications of error bounds for inequality and optimization systems and solution sets of equilibrium problems. This work is based on research supported by the U.S. National Science Foundation under grant CCR-9624018.  相似文献
7.
Regularization Networks and Support Vector Machines   总被引:20,自引:0,他引:20  
Regularization Networks and Support Vector Machines are techniques for solving certain problems of learning from examples – in particular, the regression problem of approximating a multivariate function from sparse data. Radial Basis Functions, for example, are a special case of both regularization and Support Vector Machines. We review both formulations in the context of Vapnik's theory of statistical learning which provides a general foundation for the learning problem, combining functional analysis and statistics. The emphasis is on regression: classification is treated as a special case. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献
8.
The package REGULARIZATION TOOLS consists of 54 Matlab routines for analysis and solution of discrete ill-posed problems, i.e., systems of linear equations whose coefficient matrix has the properties that its condition number is very large, and its singular values decay gradually to zero. Such problems typically arise in connection with discretization of Fredholm integral equations of the first kind, and similar ill-posed problems. Some form of regularization is always required in order to compute a stabilized solution to discrete ill-posed problems. The purpose of REGULARIZATION TOOLS is to provide the user with easy-to-use routines, based on numerical robust and efficient algorithms, for doing experiments with regularization of discrete ill-posed problems. By means of this package, the user can experiment with different regularization strategies, compare them, and draw conclusions from these experiments that would otherwise require a major programming effert. For discrete ill-posed problems, which are indeed difficult to treat numerically, such an approach is certainly superior to a single black-box routine. This paper describes the underlying theory gives an overview of the package; a complete manual is also available.This work was supported by grants from Augustinus Fonden, Knud Højgaards Fond, and Civ. Ing. Frants Allings Legat.  相似文献
9.
A new condition for the uniform convergence of certain trigonometric series   总被引:13,自引:0,他引:13  
Summary The present paper proposes a new condition to replace both the (O-regularly varying) quasimonotone condition and a certain type of bounded variation condition, and shows the same conclusion for the uniform convergence of certain trigonometric series still holds.  相似文献
10.
A Regularization Newton Method for Solving Nonlinear Complementarity Problems   总被引:13,自引:0,他引:13  
In this paper we construct a regularization Newton method for solving the nonlinear complementarity problem (NCP(F )) and analyze its convergence properties under the assumption that F is a P 0 -function. We prove that every accumulation point of the sequence of iterates is a solution of NCP(F ) and that the sequence of iterates is bounded if the solution set of NCP(F ) is nonempty and bounded. Moreover, if F is a monotone and Lipschitz continuous function, we prove that the sequence of iterates is bounded if and only if the solution set of NCP(F ) is nonempty by setting , where is a parameter. If NCP(F) has a locally unique solution and satisfies a nonsingularity condition, then the convergence rate is superlinear (quadratic) without strict complementarity conditions. At each step, we only solve a linear system of equations. Numerical results are provided and further applications to other problems are discussed. Accepted 25 March 1998  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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