全文获取类型
收费全文 | 2434篇 |
免费 | 357篇 |
国内免费 | 315篇 |
专业分类
化学 | 305篇 |
晶体学 | 11篇 |
力学 | 139篇 |
综合类 | 86篇 |
数学 | 2050篇 |
物理学 | 515篇 |
出版年
2024年 | 4篇 |
2023年 | 16篇 |
2022年 | 39篇 |
2021年 | 57篇 |
2020年 | 94篇 |
2019年 | 67篇 |
2018年 | 66篇 |
2017年 | 99篇 |
2016年 | 99篇 |
2015年 | 83篇 |
2014年 | 90篇 |
2013年 | 188篇 |
2012年 | 132篇 |
2011年 | 140篇 |
2010年 | 142篇 |
2009年 | 165篇 |
2008年 | 150篇 |
2007年 | 170篇 |
2006年 | 128篇 |
2005年 | 146篇 |
2004年 | 127篇 |
2003年 | 102篇 |
2002年 | 103篇 |
2001年 | 90篇 |
2000年 | 86篇 |
1999年 | 67篇 |
1998年 | 69篇 |
1997年 | 55篇 |
1996年 | 52篇 |
1995年 | 36篇 |
1994年 | 37篇 |
1993年 | 21篇 |
1992年 | 28篇 |
1991年 | 16篇 |
1990年 | 18篇 |
1989年 | 12篇 |
1988年 | 12篇 |
1987年 | 11篇 |
1986年 | 7篇 |
1985年 | 13篇 |
1984年 | 17篇 |
1983年 | 4篇 |
1982年 | 8篇 |
1981年 | 9篇 |
1980年 | 5篇 |
1979年 | 11篇 |
1978年 | 3篇 |
1977年 | 6篇 |
1976年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有3106条查询结果,搜索用时 15 毫秒
21.
对Hajek-Renyi不等式进行了推广,利用推广的不等式给出了随机变量序列绝对平均意义下的强大数定律的一个条件. 相似文献
22.
引进了随机环境中多物种分枝随机游动的一般模型.在分枝过程非灭绝的情况下,讨论了系统的状态分类,得到了系统暂留及强常返的充要条件是存在k个定义在整数集上的函数分别满足某种性质.最后给出了系统强暂留的充分条件. 相似文献
23.
利用关于乘积分布密度的相对熵和相对熵率的概念,建立了相依连续型随机变量序列关于参考微分熵的一类强偏差定理,证明中给出了将Laplace变换应用于微分熵强偏差定理的研究的一种途径. 相似文献
24.
Ledzewicz U. Nowakowski A. Schättler H. 《Journal of Optimization Theory and Applications》2004,122(2):345-370
It is shown that, if a parametrized fämily of extremals F can be stratified in a way compatible with the flow map generated by F, then those trajectories of the family which realize the minimal values of the cost in F are indeed optimal in comparison with all trajectories which lie in the region R covered by the trajectories of F. It is not assumed that F is a field covering the state space injectively. As illustration, an optimal synthesis is constructed for a system where the flow of extremals exhibits a simple cusp singularity. 相似文献
25.
关于任意随机变量序列泛函的强极限定理 总被引:1,自引:1,他引:0
本文在k是固定的正整数,{fn}是R^k 1上的Borel可测函数列时,得到了任意随机变量序列{Xrn≥0}的泛函{fn(Xn-k,…,Xn)}的强极限定理,它是Chung的关于独立随机变量序列的强大数律的推广,作为推论,得到了k重非齐次马尔科夫链的一类强极限定理. 相似文献
26.
可交换随机变量序列的随机极限定理 总被引:1,自引:0,他引:1
本文讨论了可交换随机变量序列{Xn:n≥1}的极限定理,得到了可交换随机变量序列的随机强大数律及加权和定理,并推广了文[4]中的结果. 相似文献
27.
Myron W. Evans 《Foundations of Physics Letters》2003,16(6):513-547
A generally covariant wave equation is derived geometrically for grand unified field theory. The equation states most generally that the covariant d'Alembertian acting on the vielbein vanishes for the four fields which are thought to exist in nature: gravitation, electromagnetism, weak field and strong field. The various known field equations are derived from the wave equation when the vielbein is the eigenfunction. When the wave equation is applied to gravitation the wave equation is the eigenequation of wave mechanics corresponding to Einstein's field equation in classical mechanics, the vielbein eigenfunction playing the role of the quantized gravitational field. The three Newton laws, Newton's law of universal gravitation, and the Poisson equation are recovered in the classical and nonrelativistic, weak-field limits of the quantized gravitational field. The single particle wave-equation and Klein-Gordon equations are recovered in the relativistic, weak-field limit of the wave equation when scalar components are considered of the vielbein eigenfunction of the quantized gravitational field. The Schrödinger equation is recovered in the non-relativistec, weak-field limit of the Klein-Gordon equation). The Dirac equation is recovered in this weak-field limit of the quantized gravitational field (the nonrelativistic limit of the relativistic, quantezed gravitational field when the vielbein plays the role of the spinor. The wave and field equations of O(3) electrodynamics are recovered when the vielbein becomes the relativistic dreibein (triad) eigenfunction whose three orthonormal space indices become identified with the three complex circular indices (1), (2), (3), and whose four spacetime indices are the indices of non-Euclidean spacetime (the base manifold). This dreibein is the potential dreibein of the O(3) electromagnetic field (an electromagnetic potential four-vector for each index (1), (2), (3)). The wave equation of the parity violating weak field is recovered when the orthonormal space indices of the relativistic dreibein eigenfunction are identified with the indices of the three massive weak field bosons. The wave equation of the strong field is recovered when the orthonormal space indices of the relativistic vielbein eigenfunction become the eight indices defined by the group generators of the SU (3) group. 相似文献
28.
Hsien-Chung Wu 《Fuzzy Optimization and Decision Making》2003,2(1):61-73
The concept of fuzzy scalar (inner) product that will be used in the fuzzy objective and inequality constraints of the fuzzy primal and dual linear programming problems with fuzzy coefficients is proposed in this paper. We also introduce a solution concept that is essentially similar to the notion of Pareto optimal solution in the multiobjective programming problems by imposing a partial ordering on the set of all fuzzy numbers. We then prove the weak and strong duality theorems for fuzzy linear programming problems with fuzzy coefficients. 相似文献
29.
本文综合近邻权函数法及最小二乘法,用两阶段最小二乘估计的方法得到了半参数EV模型中参数的估计量及其强相合性,渐近正态性。同时也得到了非参数函数的估计量及其强相合性,一致强相合性。 相似文献
30.
The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s1,…,sk,t1,…,tk, the graph contains k vertex disjoint paths joining sr to tr for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007 相似文献