全文获取类型
收费全文 | 854篇 |
免费 | 13篇 |
国内免费 | 46篇 |
专业分类
化学 | 186篇 |
力学 | 23篇 |
综合类 | 4篇 |
数学 | 566篇 |
物理学 | 134篇 |
出版年
2024年 | 2篇 |
2023年 | 13篇 |
2022年 | 25篇 |
2021年 | 10篇 |
2020年 | 17篇 |
2019年 | 21篇 |
2018年 | 20篇 |
2017年 | 11篇 |
2016年 | 17篇 |
2015年 | 16篇 |
2014年 | 25篇 |
2013年 | 62篇 |
2012年 | 24篇 |
2011年 | 61篇 |
2010年 | 47篇 |
2009年 | 88篇 |
2008年 | 79篇 |
2007年 | 67篇 |
2006年 | 42篇 |
2005年 | 33篇 |
2004年 | 24篇 |
2003年 | 22篇 |
2002年 | 16篇 |
2001年 | 14篇 |
2000年 | 19篇 |
1999年 | 15篇 |
1998年 | 15篇 |
1997年 | 17篇 |
1996年 | 11篇 |
1995年 | 5篇 |
1994年 | 8篇 |
1993年 | 12篇 |
1992年 | 5篇 |
1991年 | 1篇 |
1990年 | 5篇 |
1989年 | 1篇 |
1988年 | 4篇 |
1987年 | 4篇 |
1986年 | 3篇 |
1985年 | 3篇 |
1984年 | 3篇 |
1983年 | 4篇 |
1982年 | 4篇 |
1981年 | 6篇 |
1979年 | 1篇 |
1978年 | 3篇 |
1977年 | 1篇 |
1976年 | 3篇 |
1973年 | 2篇 |
1969年 | 2篇 |
排序方式: 共有913条查询结果,搜索用时 31 毫秒
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.
Zuo LIU Zhen De WU 《数学学报(英文版)》2005,21(5):997-1000
Let κ be non-negative integer. The unoriented bordism classes, which can be represented as [RP(ξ^κ)] where ξ^κ is a k-plane bundle, form an ideal of the unoriented bordism ring MO.. A group of generators of this ideal expressed by a base of MO. and a necessary and sufficient condition for a bordism class to belong to this ideal are given. 相似文献
4.
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. 相似文献
5.
Jacob Fox 《Journal of Combinatorial Theory, Series A》2006,113(1):84-100
We prove that Rado's Boundedness Conjecture from Richard Rado's 1933 famous dissertation Studien zur Kombinatorik is true if it is true for homogeneous equations. We then prove the first nontrivial case of Rado's Boundedness Conjecture: if a1,a2, and a3 are integers, and if for every 24-coloring of the positive integers (or even the nonzero rational numbers) there is a monochromatic solution to the equation a1x1+a2x2+a3x3=0, then for every finite coloring of the positive integers there is a monochromatic solution to a1x1+a2x2+a3x3=0. 相似文献
6.
Christian Reiher 《The Ramanujan Journal》2007,13(1-3):333-337
In 1961, Erdős, Ginzburg and Ziv proved a remarkable theorem stating that each set of 2n−1 integers contains a subset of size n, the sum of whose elements is divisible by n. We will prove a similar result for pairs of integers, i.e. planar lattice-points, usually referred to as Kemnitz’ conjecture.
Dedicated to Richard Askey on the occasion of his 70th birthday.
2000 Mathematics Subject Classification Primary—11B50. 相似文献
7.
8.
In the core of the seminal Graph Minor Theory of Robertson and Seymour lies a powerful theorem capturing the ``rough' structure
of graphs excluding a fixed minor. This result was used to prove Wagner's Conjecture that finite graphs are well-quasi-ordered
under the graph minor relation. Recently, a number of beautiful results that use this structural result have appeared. Some
of these along with some other recent advances on graph minors are surveyed.
Research partly supported by Japan Society for the Promotion of Science, Grant-in-Aid for Scientific Research, Grant number
16740044, by Sumitomo Foundation, by C & C Foundation and by Inoue Research Award for Young Scientists
Supported in part by the Research Grant P1–0297 and by the CRC program
On leave from: IMFM & FMF, Department of Mathematics, University of Ljubljana, Ljubljana, Slovenia 相似文献
9.
有限维路代数的K_1群 总被引:1,自引:0,他引:1
本文通过计算有限维路代数k△的单位群和单位群的阿贝尔化,完全刻划了 任意域上有限维路代数的K1群. 相似文献
10.
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. 相似文献