首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   34900篇
  国内免费   1651篇
  完全免费   216篇
  数学   36767篇
  2018年   587篇
  2017年   165篇
  2016年   9篇
  2015年   1024篇
  2014年   1765篇
  2013年   1695篇
  2012年   1432篇
  2011年   1816篇
  2010年   1905篇
  2009年   2153篇
  2008年   2309篇
  2007年   1840篇
  2006年   1616篇
  2005年   1477篇
  2004年   1378篇
  2003年   1488篇
  2002年   1650篇
  2001年   1316篇
  2000年   1187篇
  1999年   1172篇
  1998年   1104篇
  1997年   886篇
  1996年   717篇
  1995年   526篇
  1994年   516篇
  1993年   387篇
  1992年   385篇
  1991年   349篇
  1990年   318篇
  1989年   284篇
  1988年   313篇
  1987年   257篇
  1986年   258篇
  1985年   210篇
  1984年   186篇
  1983年   55篇
  1982年   210篇
  1981年   164篇
  1980年   194篇
  1979年   193篇
  1978年   218篇
  1977年   120篇
  1976年   131篇
  1975年   37篇
  1974年   43篇
  1973年   121篇
  1972年   113篇
  1971年   127篇
  1970年   67篇
  1969年   39篇
  1968年   32篇
  1967年   40篇
  1966年   19篇
  1965年   21篇
  1964年   29篇
  1963年   12篇
  1962年   42篇
  1961年   21篇
  1960年   3篇
  1959年   8篇
  1958年   8篇
  1957年   3篇
  1956年   4篇
  1955年   4篇
  1954年   3篇
  1953年   1篇
  1952年   1篇
  1950年   1篇
  1947年   1篇
  1930年   1篇
  1877年   1篇
排序方式: 共有36767条查询结果,搜索用时 156 毫秒
1.
A geometric model for active contours in image processing   总被引:50,自引:0,他引:50  
Summary We propose a new model for active contours based on a geometric partial differential equation. Our model is intrinsec, stable (satisfies the maximum principle) and permits a rigorous mathematical analysis. It enables us to extract smooth shapes (we cannot retrieve angles) and it can be adapted to find several contours simultaneously. Moreover, as a consequence of the stability, we can design robust algorithms which can be engineed with no parameters in applications. Numerical experiments are presented.  相似文献
2.
Crouzeix-Raviart type finite elements on anisotropic meshes   总被引:47,自引:0,他引:47  
Summary. The paper deals with a non-conforming finite element method on a class of anisotropic meshes. The Crouzeix-Raviart element is used on triangles and tetrahedra. For rectangles and prismatic (pentahedral) elements a novel set of trial functions is proposed. Anisotropic local interpolation error estimates are derived for all these types of element and for functions from classical and weighted Sobolev spaces. The consistency error is estimated for a general differential equation under weak regularity assumptions. As a particular application, an example is investigated where anisotropic finite element meshes are appropriate, namely the Poisson problem in domains with edges. A numerical test is described. Received May 19, 1999 / Revised version received February 2, 2000 / Published online February 5, 2001  相似文献
3.
A Strong Maximum Principle for some quasilinear elliptic equations   总被引:37,自引:0,他引:37  
In its simplest form the Strong Maximum Principle says that a nonnegative superharmonic continuous function in a domain n ,n 1, is in fact positive everywhere. Here we prove that the same conclusion is true for the weak solutions of – u + (u) = f with a nondecreasing function ,(0)=0, andf0 a.e. in if and only if the integral((s)s) –1/2 ds diverges ats=0+. We extend the result to more general equations, in particular to – p u + (u) =f where p (u) = div(|Du| p-2 Du), 1 <p < . Our main result characterizes the nonexistence of a dead core in some reaction-diffusion systems.This work was partly done while the author was visiting the University of Minnesota as a Fulbright Scholar.  相似文献
4.
Image recovery via total variation minimization and related problems   总被引:31,自引:0,他引:31  
Summary. We study here a classical image denoising technique introduced by L. Rudin and S. Osher a few years ago, namely the constrained minimization of the total variation (TV) of the image. First, we give results of existence and uniqueness and prove the link between the constrained minimization problem and the minimization of an associated Lagrangian functional. Then we describe a relaxation method for computing the solution, and give a proof of convergence. After this, we explain why the TV-based model is well suited to the recovery of some images and not of others. We eventually propose an alternative approach whose purpose is to handle the minimization of the minimum of several convex functionals. We propose for instance a variant of the original TV minimization problem that handles correctly some situations where TV fails. Received December 21, 1995 / Revised version February 26, 1996  相似文献
5.
无界区域上基于自然边界归化的一种区域分解算法   总被引:30,自引:10,他引:20       下载免费PDF全文
余德浩 《计算数学》1994,16(4):448-459
无界区域上基于自然边界归化的一种区域分解算法余德浩(中国科学院计算中心)ADOMAINDECOMPOSITIONMETHODBASEDONTHENATURALBOUNDARYREDUCTIONOVERUNBOUNDEDDOMAIN¥YuDe-hao(...  相似文献
6.
7.
对称正交对称矩阵逆特征值问题   总被引:27,自引:0,他引:27       下载免费PDF全文
Let P∈ Rn×n such that PT = P, P-1 = PT.A∈Rn×n is termed symmetric orthogonal symmetric matrix ifAT = A, (PA)T = PA.We denote the set of all n × n symmetric orthogonal symmetric matrices byThis paper discuss the following two problems:Problem I. Given X ∈ Rn×m, A = diag(λ1,λ 2, ... ,λ m). Find A SRnxnP such thatAX =XAProblem II. Given A ∈ Rnδn. Find A SE such thatwhere SE is the solution set of Problem I, ||·|| is the Frobenius norm. In this paper, the sufficient and necessary conditions under which SE is nonempty are obtained. The general form of SE has been given. The expression of the solution A* of Problem II is presented. We have proved that some results of Reference [3] are the special cases of this paper.  相似文献
8.
Separative cancellation for projective modules over exchange rings   总被引:27,自引:0,他引:27  
A separative ring is one whose finitely generated projective modules satisfy the propertyAAABBBAB. This condition is shown to provide a key to a number of outstanding cancellation problems for finitely generated projective modules over exchange rings. It is shown that the class of separative exchange rings is very broad, and, notably, closed under extensions of ideals by factor rings. That is, if an exchange ringR has an idealI withI andR/I both separative, thenR is separative. The research of the first and fourth authors was partially supported by a grant from the DGICYT (Spain) and by the Comissionat per Universitats i Recerca de la Generalitat de Catalunya. That of the second author was partially supported by a grant from the NSF (USA). The final version of this paper was prepared while he was visiting the Centre de Recerca Matemàtica, Institut d'Estudis Catalans in Barcelona, and he thanks the CRM for its hospitality.  相似文献
9.
Detection of Cheaters in Vector Space Secret Sharing Schemes   总被引:22,自引:0,他引:22  
A perfect secret sharing scheme is a method of distributing shares of a secret among a set P of participants in such a way that only qualified subsets of P can reconstruct the secret from their shares and non-qualified subsets have absolutely no information on the value of the secret. In a secret sharing scheme, some participants could lie about the value of their shares in order to obtain some illicit benefit. Therefore, the security against cheating is an important issue in the implementation of secret sharing schemes. Two new secret sharing schemes in which cheaters are detected with high probability are presented in this paper. The first one has information rate equal to 1/2 and can be implemented not only in threshold structures, but in a more general family of access structures. We prove that the information rate of this scheme is almost optimal among all schemes with the same security requirements. The second scheme we propose is a threshold scheme in which cheaters are detected with high probability even if they know the secret. The information rate is in this case 1/3 In both schemes, the probability of cheating successfully is a fixed value that is determined by the size of the secret.  相似文献
10.
The cascadic multigrid method for elliptic problems   总被引:22,自引:0,他引:22  
Summary. The paper deals with certain adaptive multilevel methods at the confluence of nested multigrid methods and iterative methods based on the cascade principle of [10]. From the multigrid point of view, no correction cycles are needed; from the cascade principle view, a basic iteration method without any preconditioner is used at successive refinement levels. For a prescribed error tolerance on the final level, more iterations must be spent on coarser grids in order to allow for less iterations on finer grids. A first candidate of such a cascadic multigrid method was the recently suggested cascadic conjugate gradient method of [9], in short CCG method, whichused the CG method as basic iteration method on each level. In [18] it has been proven, that the CCG method is accurate with optimal complexity for elliptic problems in 2D and quasi-uniform triangulations. The present paper simplifies that theory and extends it to more general basic iteration methods like the traditional multigrid smoothers. Moreover, an adaptive control strategy for the number of iterations on successive refinement levels for possibly highly non-uniform grids is worked out on the basis of a posteriori estimates. Numerical tests confirm the efficiency and robustness of the cascadic multigrid method. Received November 12, 1994 / Revised version received October 12, 1995  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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