全文获取类型
收费全文 | 517篇 |
免费 | 12篇 |
国内免费 | 15篇 |
专业分类
化学 | 16篇 |
力学 | 17篇 |
综合类 | 3篇 |
数学 | 248篇 |
物理学 | 89篇 |
综合类 | 171篇 |
出版年
2024年 | 4篇 |
2023年 | 10篇 |
2022年 | 14篇 |
2021年 | 8篇 |
2020年 | 10篇 |
2019年 | 9篇 |
2018年 | 15篇 |
2017年 | 9篇 |
2016年 | 12篇 |
2015年 | 14篇 |
2014年 | 32篇 |
2013年 | 34篇 |
2012年 | 25篇 |
2011年 | 38篇 |
2010年 | 27篇 |
2009年 | 41篇 |
2008年 | 41篇 |
2007年 | 33篇 |
2006年 | 25篇 |
2005年 | 15篇 |
2004年 | 10篇 |
2003年 | 12篇 |
2002年 | 7篇 |
2001年 | 5篇 |
2000年 | 10篇 |
1999年 | 10篇 |
1998年 | 12篇 |
1997年 | 9篇 |
1996年 | 6篇 |
1995年 | 4篇 |
1994年 | 6篇 |
1993年 | 6篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1988年 | 4篇 |
1987年 | 1篇 |
1985年 | 1篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有544条查询结果,搜索用时 15 毫秒
1.
2.
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. 相似文献
3.
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. 相似文献
4.
王国玉 《陕西理工学院学报(自然科学版)》1993,(2)
本文论述了由作者发明的可绘制双纽线、纺锤线及椭圆三种曲线的新型机构的构成特点;形成这三类曲线族机构连杆上浮动点的轨迹方程式及各类曲线形成的参数 l_6(=l_5)的域值;以及与标准椭圆和卡西尼卵形线的比较。 相似文献
5.
有限维路代数的K_1群 总被引:1,自引:0,他引:1
本文通过计算有限维路代数k△的单位群和单位群的阿贝尔化,完全刻划了 任意域上有限维路代数的K1群. 相似文献
6.
Let G=(V,E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of source-sink pairs of vertices of G, an important problem that arises in the computation of network reliability is the enumeration of minimal subsets of edges (arcs) that connect/disconnect all/at least one of the given source-sink pairs of P. For undirected graphs, we show that the enumeration problems for conjunctions of paths and disjunctions of cuts can be solved in incremental polynomial time. Furthermore, under the assumption that P consists of all pairs within a given vertex set, we also give incremental polynomial time algorithm for enumerating all minimal path disjunctions and cut conjunctions. For directed graphs, the enumeration problem for cut disjunction is known to be NP-complete. We extend this result to path conjunctions and path disjunctions, leaving open the complexity of the enumeration of cut conjunctions. Finally, we give a polynomial delay algorithm for enumerating all minimal sets of arcs connecting two given nodes s1 and s2 to, respectively, a given vertex t1, and each vertex of a given subset of vertices T2. 相似文献
7.
记Ore2=min{d(y) d(x)|x,y∈V(G),d(x,y)=2},本得到:若n阶图G的Ore2≥n 1,则G是[5;n]泛连通图。此是比Faudree等人的定理进一步的结果。 相似文献
8.
影响黑杨派南方型无性系生长的综合土壤-立地因子有:有效水分、物理性状、通气条件和土壤养分.综合土壤-立地因子由反映立地质量的土壤-立地子因子构成.通径分析表明:影响土壤有效水分的土壤-立地子因子主要是局域位置、地形条件和地下水位;影响物理性状的是质地与结构;影响通气条件的是经营水平;而影响土壤养分的土壤-立地子因子是速效钾和pH值. 相似文献
9.
用图的三度顶点的收缩方法,刻画了单圈图的路图的Hamilton性的特征,并具体给出了Hamilton圈的构造。 相似文献
10.
Shigeki Aida 《Journal of Functional Analysis》2007,251(1):59-121
We determine the limit of the bottom of spectrum of Schrödinger operators with variable coefficients on Wiener spaces and path spaces over finite-dimensional compact Riemannian manifolds in the semi-classical limit. These are extensions of the results in [S. Aida, Semiclassical limit of the lowest eigenvalue of a Schrödinger operator on a Wiener space, J. Funct. Anal. 203 (2) (2003) 401-424]. The problem on path spaces over Riemannian manifolds is considered as a problem on Wiener spaces by using Ito's map. However the coefficient operator is not a bounded linear operator and the dependence on the path is not continuous in the uniform convergence topology if the Riemannian curvature tensor on the underling manifold is not equal to 0. The difficulties are solved by using unitary transformations of the Schrödinger operators by approximate ground state functions and estimates in the rough path analysis. 相似文献