全文获取类型
收费全文 | 7035篇 |
免费 | 535篇 |
国内免费 | 713篇 |
专业分类
化学 | 758篇 |
晶体学 | 12篇 |
力学 | 426篇 |
综合类 | 178篇 |
数学 | 6148篇 |
物理学 | 761篇 |
出版年
2024年 | 7篇 |
2023年 | 84篇 |
2022年 | 89篇 |
2021年 | 157篇 |
2020年 | 158篇 |
2019年 | 159篇 |
2018年 | 185篇 |
2017年 | 194篇 |
2016年 | 198篇 |
2015年 | 156篇 |
2014年 | 258篇 |
2013年 | 487篇 |
2012年 | 299篇 |
2011年 | 364篇 |
2010年 | 348篇 |
2009年 | 443篇 |
2008年 | 468篇 |
2007年 | 432篇 |
2006年 | 440篇 |
2005年 | 395篇 |
2004年 | 319篇 |
2003年 | 365篇 |
2002年 | 310篇 |
2001年 | 282篇 |
2000年 | 266篇 |
1999年 | 240篇 |
1998年 | 236篇 |
1997年 | 205篇 |
1996年 | 127篇 |
1995年 | 92篇 |
1994年 | 78篇 |
1993年 | 68篇 |
1992年 | 52篇 |
1991年 | 36篇 |
1990年 | 24篇 |
1989年 | 24篇 |
1988年 | 19篇 |
1987年 | 14篇 |
1986年 | 17篇 |
1985年 | 32篇 |
1984年 | 28篇 |
1983年 | 16篇 |
1982年 | 33篇 |
1981年 | 22篇 |
1980年 | 20篇 |
1979年 | 9篇 |
1978年 | 8篇 |
1977年 | 6篇 |
1976年 | 7篇 |
1974年 | 4篇 |
排序方式: 共有8283条查询结果,搜索用时 328 毫秒
91.
本文利用一个新的分片线性NCP函数提出一个新的可行的QP-free方法解非线性不等式约束优化问题.不同于其他的QP-free方法,这个方法只考虑在工作集中的约束函数,工作集是积极集的一个估计,因此子问题的维数不是满秩的.这个方法可行的并且不需假定严格互补条件、聚点的孤立性得到算法的全局收敛性,并且积极约束函数的梯度不要求线性独立的,其中由拟牛顿法得到的子矩阵不需要求一致正定性. 相似文献
92.
93.
应用等效原理,通过引入口面上等效磁流将含腔导电目标电磁散射简化为腔内、外两个等效 问题. 腔内问题分段求解并应用级联法获得口面等效导纳矩阵;腔内外的耦合关系应用近似 边界元方法描述并由此获得口面等效磁流;最后,这一具有混合源的腔体内外一体化散射问 题则应用所提出的广义混合场积分方程方法建立电磁模型,并用多层快速多极子方法实现高 效数值求解. 实例计算结果与测试结果具有很好的一致性.
关键词:
含腔目标
电磁散射
混合场积分方程
数值分析 相似文献
94.
Let G(x,y) and GD(x,y) be the Green functions of rotationally invariant symmetric α-stable process in Rd and in an open set D, respectively, where 0<α<2. The inequality GD(x,y)GD(y,z)/GD(x,z)?c(G(x,y)+G(y,z)) is a very useful tool in studying (local) Schrödinger operators. When the above inequality is true with c=c(D)∈(0,∞), then we say that the 3G theorem holds in D. In this paper, we establish a generalized version of 3G theorem when D is a bounded κ-fat open set, which includes a bounded John domain. The 3G we consider is of the form GD(x,y)GD(z,w)/GD(x,w), where y may be different from z. When y=z, we recover the usual 3G. The 3G form GD(x,y)GD(z,w)/GD(x,w) appears in non-local Schrödinger operator theory. Using our generalized 3G theorem, we give a concrete class of functions belonging to the non-local Kato class, introduced by Chen and Song, on κ-fat open sets. As an application, we discuss relativistic α-stable processes (relativistic Hamiltonian when α=1) in κ-fat open sets. We identify the Martin boundary and the minimal Martin boundary with the Euclidean boundary for relativistic α-stable processes in κ-fat open sets. Furthermore, we show that relative Fatou type theorem is true for relativistic stable processes in κ-fat open sets. The main results of this paper hold for a large class of symmetric Markov processes, as are illustrated in the last section of this paper. We also discuss the generalized 3G theorem for a large class of symmetric stable Lévy processes. 相似文献
95.
Kang Hai TAN Xiao Ping YANG 《数学学报(英文版)》2006,22(3):701-710
In this paper we give a geometric interpretation of the notion of the horizontal mean curvature which is introduced by Danielli Garofalo-Nhieu and Pauls who recently introduced sub- Riemannian minimal surfaces in Carnot groups. This will be done by introducing a natural nonholonomic connection which is the restriction (projection) of the natural Riemannian connection on the horizontal bundle. For this nonholonomic connection and (intrinsic) regular hypersurfaces we introduce the notions of the horizontal second fundamental form and the horizontal shape operator. It turns out that the horizontal mean curvature is the trace of the horizontal shape operator. 相似文献
96.
97.
In this article,the Hausdorff dimension and exact Hausdorff measure function of any random sub-self-similar set are obtained under some reasonable conditions.Several examples are given at the end. 相似文献
98.
John Ginsburg 《Order》1989,6(2):137-157
For a partially ordered setP and an elementx ofP, a subsetS ofP is called a cutset forx inP if every element ofS is noncomparable tox and every maximal chain ofP meets {x}∪S. We letc(P) denote the smallest integerk such that every elementx ofP has a cutsetS with ‖S‖?k: Ifc(P)?n we say thatP has then-cutset property. Our results bear on the following question: givenP, what is the smallestn such thatP can be embedded in a partially ordered set having then-cutset property? As usual, 2 n denotes the Boolean lattice of all subsets of ann-element set, andB n denotes the set of atoms and co-atoms of 2 n . We establish the following results: (i) a characterization, by means of forbidden configurations, of whichP can be embedded in a partially ordered set having the 1-cutset property; (ii) ifP contains a copy of 2 n , thenc(P)?2[n/2]?1; (iii) for everyn>3 there is a partially ordered setP containing 2 n such thatc(P)<c(2 n ); (iv) for every positive integern there is a positive integerN such that, ifB m is contained in a partially ordered set having then-cutset property, thenm?N. 相似文献
99.
A family of skew Hadamard difference sets 总被引:1,自引:0,他引:1
Cunsheng Ding 《Journal of Combinatorial Theory, Series A》2006,113(7):1526-1535
In 1933 a family of skew Hadamard difference sets was described by Paley using matrix language and was called the Paley-Hadamard difference sets in the literature. During the last 70 years, no new skew Hadamard difference sets were found. It was conjectured that there are no further examples of skew Hadamard difference sets. This conjecture was proved to be true for the cyclic case in 1954, and further progress in favor of this conjecture was made in the past 50 years. However, the conjecture remains open until today. In this paper, we present a family of new perfect nonlinear (also called planar) functions, and construct a family of skew Hadamard difference sets using these perfect nonlinear functions. We show that some of the skew Hadamard difference sets presented in this paper are inequivalent to the Paley-Hadamard difference sets. These new examples of skew Hadamard difference sets discovered 70 years after the Paley construction disprove the longstanding conjecture on skew Hadamard difference sets. The class of new perfect nonlinear functions has applications in cryptography, coding theory, and combinatorics. 相似文献
100.
In this paper we characterize the local maxima of a continuous global optimization formulation for finding the independence
number of a graph. Classical Karush-Kuhn-Tucker conditions and simple combinatorial arguments are found sufficient to deduce
several interesting properties of the local and global maxima. These properties can be utilized in developing new approaches
to the maximum independent set problem. 相似文献