全文获取类型
收费全文 | 1214篇 |
免费 | 113篇 |
国内免费 | 61篇 |
专业分类
化学 | 23篇 |
力学 | 17篇 |
综合类 | 14篇 |
数学 | 1235篇 |
物理学 | 99篇 |
出版年
2024年 | 3篇 |
2023年 | 23篇 |
2022年 | 38篇 |
2021年 | 14篇 |
2020年 | 58篇 |
2019年 | 45篇 |
2018年 | 50篇 |
2017年 | 42篇 |
2016年 | 32篇 |
2015年 | 31篇 |
2014年 | 64篇 |
2013年 | 94篇 |
2012年 | 61篇 |
2011年 | 99篇 |
2010年 | 80篇 |
2009年 | 127篇 |
2008年 | 105篇 |
2007年 | 61篇 |
2006年 | 84篇 |
2005年 | 46篇 |
2004年 | 35篇 |
2003年 | 28篇 |
2002年 | 29篇 |
2001年 | 15篇 |
2000年 | 22篇 |
1999年 | 24篇 |
1998年 | 19篇 |
1997年 | 15篇 |
1996年 | 3篇 |
1995年 | 7篇 |
1994年 | 6篇 |
1993年 | 6篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有1388条查询结果,搜索用时 15 毫秒
1.
2.
3.
In this paper, the deformation of the Heisenberg algebra, consistent with both the generalized uncertainty principle and doubly special relativity, has been analyzed. It has been observed that, though this algebra can give rise to fractional derivative terms in the corresponding quantum mechanical Hamiltonian, a formal meaning can be given to them by using the theory of harmonic extensions of function. Depending on this argument, the expression of the propagator of the path integral corresponding to the deformed Heisenberg algebra, has been obtained. In particular, the consistent expression of the one dimensional free particle propagator has been evaluated explicitly. With this propagator in hand, it has been shown that, even in free particle case, normal generalized uncertainty principle and doubly special relativity show very much different result. 相似文献
4.
5.
6.
Kurt M. Anstreicher 《Mathematical Programming》1997,76(1):245-263
We consider the construction of small step path following algorithms using volumetric, and mixed volumetric-logarithmic, barriers.
We establish quadratic convergence of a volumetric centering measure using pure Newton steps, enabling us to use relatively
standard proof techniques for several subsequently needed results. Using a mixed volumetric-logarithmic barrier we obtain
an O(n
1/4
m
1/4
L) iteration algorithm for linear programs withn variables andm inequality constraints, providing an alternative derivation for results first obtained by Vaidya and Atkinson. In addition,
we show that the same iteration complexity can be attained while holding the work per iteration to O(n
2
m), as opposed to O(nm
2), operations, by avoiding use of the true Hessian of the volumetric barrier. Our analysis also provides a simplified proof
of self-concordancy of the volumetric and mixed volumetric-logarithmic barriers, originally due to Nesterov and Nemirovskii.
This paper was first presented at the 1994 Faculty Research Seminar “Optimization in Theory and Practice”, at the University
of Iowa Center for Advanced Studies. 相似文献
7.
图G(V,E)的一个k-正常全染色f叫做一个k-点强全染色当且仅当对任意v∈V(G), N[v]中的元素被染不同色,其中N[v]={u|uv∈V(G)}∪{v}.χTvs(G)=min{k|存在图G的k- 点强全染色}叫做图G的点强全色数.对3-连通平面图G(V,E),如果删去面fo边界上的所有点后的图为一个树图,则G(V,E)叫做一个Halin-图.本文确定了最大度不小于6的Halin- 图和一些特殊图的的点强全色数XTvs(G),并提出了如下猜想:设G(V,E)为每一连通分支的阶不小于6的图,则χTvs(G)≤△(G) 2,其中△(G)为图G(V,E)的最大度. 相似文献
8.
We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for
actually finding such a partition by our proof. 相似文献
9.
10.
有限维路代数的K_1群 总被引:1,自引:0,他引:1
本文通过计算有限维路代数k△的单位群和单位群的阿贝尔化,完全刻划了 任意域上有限维路代数的K1群. 相似文献