全文获取类型
收费全文 | 377篇 |
免费 | 8篇 |
国内免费 | 14篇 |
专业分类
化学 | 16篇 |
力学 | 19篇 |
综合类 | 4篇 |
数学 | 271篇 |
物理学 | 89篇 |
出版年
2024年 | 1篇 |
2023年 | 7篇 |
2022年 | 11篇 |
2021年 | 3篇 |
2020年 | 9篇 |
2019年 | 8篇 |
2018年 | 14篇 |
2017年 | 7篇 |
2016年 | 11篇 |
2015年 | 10篇 |
2014年 | 20篇 |
2013年 | 27篇 |
2012年 | 10篇 |
2011年 | 24篇 |
2010年 | 22篇 |
2009年 | 32篇 |
2008年 | 37篇 |
2007年 | 25篇 |
2006年 | 21篇 |
2005年 | 10篇 |
2004年 | 8篇 |
2003年 | 8篇 |
2002年 | 8篇 |
2001年 | 3篇 |
2000年 | 10篇 |
1999年 | 8篇 |
1998年 | 10篇 |
1997年 | 6篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1990年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有399条查询结果,搜索用时 281 毫秒
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.
有限维路代数的K_1群 总被引:1,自引:0,他引:1
本文通过计算有限维路代数k△的单位群和单位群的阿贝尔化,完全刻划了 任意域上有限维路代数的K1群. 相似文献
5.
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. 相似文献
6.
记Ore2=min{d(y) d(x)|x,y∈V(G),d(x,y)=2},本得到:若n阶图G的Ore2≥n 1,则G是[5;n]泛连通图。此是比Faudree等人的定理进一步的结果。 相似文献
7.
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. 相似文献
8.
Zhanglin Liu Dong Tian Fei Shen Lulu Long Yanzong Zhang Gang Yang Yongmei Zeng Jing Zhang Jinsong He Ying Zhu Shihuai Deng 《中国化学快报》1990,30(12):2221-2224
Four distinct biochars were employed to remove three typical pollutants, meanwhile, path analysis, a multi-statistical regression method, was performed to elucidate the dominant factors of biochar adsorption. This work can provide a new insight to prepare a targeted biochar as adsorbents. 相似文献
9.
Hongwei Liu Xiangdong Liu KeXue Yuan KeSong Hu Yutau Chen 《International Journal of Infrared and Millimeter Waves》1993,14(8):1693-1699
A five-channel grating spectrometer for use in millimeter wave band (25100GHz) is described with its design theory of optical path, and measured results of insertion loss and resolving power. 相似文献
10.
J. Zhu 《Mathematical Methods of Operations Research》1992,36(4):359-377
We present a primal-dual path following interior algorithm for a class of linearly constrained convex programming problems with non-negative decision variables. We introduce the definition of a Scaled Lipschitz Condition and show that if the objective function satisfies the Scaled Lipschitz Condition then, at each iteration, our algorithm reduces the duality gap by at least a factor of (1–/n), where is positive and depends on the curvature of the objective function, by means of solving a system of linear equations which requires no more than O(n3) arithmetic operations. The class of functions having the Scaled Lipschitz Condition includes linear, convex quadratic and entropy functions. 相似文献