全文获取类型
收费全文 | 7014篇 |
免费 | 547篇 |
国内免费 | 750篇 |
专业分类
化学 | 436篇 |
晶体学 | 5篇 |
力学 | 453篇 |
综合类 | 140篇 |
数学 | 6388篇 |
物理学 | 889篇 |
出版年
2024年 | 8篇 |
2023年 | 79篇 |
2022年 | 99篇 |
2021年 | 120篇 |
2020年 | 144篇 |
2019年 | 157篇 |
2018年 | 177篇 |
2017年 | 182篇 |
2016年 | 185篇 |
2015年 | 148篇 |
2014年 | 278篇 |
2013年 | 511篇 |
2012年 | 260篇 |
2011年 | 375篇 |
2010年 | 327篇 |
2009年 | 456篇 |
2008年 | 498篇 |
2007年 | 436篇 |
2006年 | 450篇 |
2005年 | 355篇 |
2004年 | 324篇 |
2003年 | 382篇 |
2002年 | 335篇 |
2001年 | 293篇 |
2000年 | 260篇 |
1999年 | 244篇 |
1998年 | 236篇 |
1997年 | 216篇 |
1996年 | 133篇 |
1995年 | 95篇 |
1994年 | 81篇 |
1993年 | 67篇 |
1992年 | 48篇 |
1991年 | 44篇 |
1990年 | 29篇 |
1989年 | 19篇 |
1988年 | 24篇 |
1987年 | 20篇 |
1986年 | 19篇 |
1985年 | 31篇 |
1984年 | 28篇 |
1983年 | 16篇 |
1982年 | 26篇 |
1981年 | 22篇 |
1980年 | 24篇 |
1979年 | 11篇 |
1978年 | 12篇 |
1977年 | 8篇 |
1976年 | 7篇 |
1974年 | 6篇 |
排序方式: 共有8311条查询结果,搜索用时 0 毫秒
21.
OU型Markov过程的不变测度及弱对偶性 总被引:1,自引:1,他引:0
本文研究OU型Markov过程的不变测度、参考测度和弱对偶半群的存在性问题,并得出了不变测度的唯一性。 相似文献
22.
Alexander P. Schuster 《Proceedings of the American Mathematical Society》1997,125(6):1717-1725
Properties of the unions of sampling and interpolation sets for Bergman spaces are discussed in conjunction with the examples given by Seip (1993). Their relationship to the classical interpolation sequences is explored. In addition, the role played by canonical divisors in the study of these sets is examined and an example of a sampling set is constructed in the disk.
23.
We construct a correspondence between the set of partitions of a finite set M and the set of pairs of walks to the same vertex on a graph giving the Bratteli diagram of the partition algebra on M. This is the precise analogue of the correspondence between the set of permutations of a finite set and the set of pairs of Young tableaux of the same shape, called the Robinson–Schensted correspondence. 相似文献
24.
Browder-Petryshyn 型的严格伪压缩映射的粘滞迭代逼近方法 总被引:1,自引:0,他引:1
主要研究Browder-Petryshyn型的严格伪压缩映射的粘滞迭代逼近过程,证明了Browder-Petryshyn型的严格伪压缩映射的不动点集F(T)是闭凸集.在q-一致光滑且一致凸的Banach空间中,对于严格伪压缩映射T,利用徐洪坤在2004年引进的粘滞迭代得到的序列弱收敛于T的某个不动点.同时证明了Hilbert空间中Browder-Petryshyn型的严格伪压缩映射的相应迭代序列强收敛到T的某个不动点,其结果推广与改进了徐洪坤2004年的相应结果. 相似文献
25.
Alex Hellsten 《Archive for Mathematical Logic》2006,45(6):705-714
We extract some properties of Mahlo’s operation and show that some other very natural operations share these properties. The weakly compact sets form a similar hierarchy as the stationary sets. The height of this hierarchy is a large cardinal property connected to saturation properties of the weakly compact ideal. 相似文献
26.
Brian Lucena 《Discrete Applied Mathematics》2007,155(8):1055-1065
One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW?k). However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general constructions of minimal forbidden minors which are sparse in the sense that the ratio of the treewidth to the number of vertices n does not approach 1 as n approaches infinity. We accomplish this by a novel combination of using brambles to provide lower bounds and achievable sets to demonstrate upper bounds. Additionally, we determine the exact treewidth of other basic graph constructions which are not minimal forbidden minors. 相似文献
27.
Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically
by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually
employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be
“close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence
many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report
results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process
can be improved to better reflect the actual properties sought.
In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend
themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms
of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling
approach may possibly lead to algorithms with improved efficiency.
AMS subject classification (2000) 65L05, 65M32, 65N21, 65N22, 65D18 相似文献
28.
Devin Kilminster David Allingham Alistair Mees 《Annals of the Institute of Statistical Mathematics》2002,54(1):224-233
Knowing a probability density (ideally, an invariant density) for the trajectories of a dynamical system allows many significant estimates to be made, from the well-known dynamical invariants such as Lyapunov exponents and mutual information to conditional probabilities which are potentially more suitable for prediction than the single number produced by most predictors. Densities on typical attractors have properties, such as singularity with respect to Lebesgue measure, which make standard density estimators less useful than one would hope. In this paper we present a new method of estimating densities which can smooth in a way that tends to preserve fractal structure down to some level, and that also maintains invariance. We demonstrate with applications to real and artificial data. 相似文献
29.
This paper proposes the Rice condition numbers for invariant subspace, singular sub-spaces of a matrix and deflating subspaces of a regular matrix pair. The first-order perturbation estimations for these subspaces are derived by applying perturbation expansions of orthogonal projection operators. 相似文献
30.
Antoni Leon Dawidowicz Najemedin Haribash Anna Poskrobko 《Mathematical Methods in the Applied Sciences》2007,30(7):779-787
The problem of the existence of the invariant measure is important considering its connections with chaotic behaviour. In the papers (Zesz. Nauk. Uniw. Jagiellońskiego, Pr. Mat. 1982; 23 :117–123; Ann. Pol. Math. 1983; XLI :129–137; J. Differential Equations 2004; 196 :448–465) the existence of invariant and ergodic measures according to the dynamical system generated by the Lasota equation was proved, i.e. the equation describing the dynamics and becoming different of the population of cells. In this paper, the existence of such measure for the quasi‐linear Lasota equation is proved. This measure is the carriage of the measure described by Dawidowicz (Zesz. Nauk. Uniw. Jagiellońskiego, Pr. Mat. 1982; 23 :117–123). Copyright © 2006 John Wiley & Sons, Ltd. 相似文献