全文获取类型
收费全文 | 2912篇 |
免费 | 119篇 |
国内免费 | 249篇 |
专业分类
化学 | 360篇 |
晶体学 | 2篇 |
力学 | 38篇 |
综合类 | 30篇 |
数学 | 2577篇 |
物理学 | 273篇 |
出版年
2024年 | 3篇 |
2023年 | 23篇 |
2022年 | 44篇 |
2021年 | 31篇 |
2020年 | 54篇 |
2019年 | 64篇 |
2018年 | 67篇 |
2017年 | 56篇 |
2016年 | 70篇 |
2015年 | 52篇 |
2014年 | 122篇 |
2013年 | 215篇 |
2012年 | 110篇 |
2011年 | 139篇 |
2010年 | 126篇 |
2009年 | 212篇 |
2008年 | 236篇 |
2007年 | 184篇 |
2006年 | 160篇 |
2005年 | 149篇 |
2004年 | 104篇 |
2003年 | 113篇 |
2002年 | 101篇 |
2001年 | 99篇 |
2000年 | 95篇 |
1999年 | 95篇 |
1998年 | 84篇 |
1997年 | 70篇 |
1996年 | 61篇 |
1995年 | 37篇 |
1994年 | 30篇 |
1993年 | 31篇 |
1992年 | 32篇 |
1991年 | 17篇 |
1990年 | 16篇 |
1989年 | 18篇 |
1988年 | 16篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 25篇 |
1984年 | 17篇 |
1983年 | 4篇 |
1982年 | 14篇 |
1981年 | 17篇 |
1980年 | 20篇 |
1979年 | 15篇 |
1978年 | 9篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1936年 | 1篇 |
排序方式: 共有3280条查询结果,搜索用时 31 毫秒
1.
2.
3.
A graph is called supereulerian if it has a spanning closed trail. Let G be a 2-edge-connected graph of order n such that each minimal edge cut SE(G) with |S|3 satisfies the property that each component of G−S has order at least (n−2)/5. We prove that either G is supereulerian or G belongs to one of two classes of exceptional graphs. Our results slightly improve earlier results of Catlin and Li. Furthermore, our main result implies the following strengthening of a theorem of Lai within the class of graphs with minimum degree δ4: If G is a 2-edge-connected graph of order n with δ(G)4 such that for every edge xyE(G) , we have max{d(x),d(y)}(n−2)/5−1, then either G is supereulerian or G belongs to one of two classes of exceptional graphs. We show that the condition δ(G)4 cannot be relaxed. 相似文献
4.
In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers
to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge
bounds equal one, stable multi-sets are equivalent to stable sets.
For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient
conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the
stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable
multi-sets and conditions for them to be facet defining are determined.
The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets
emerge as an important substructure in the design of optical networks.
Received: February 14, 2001/Revised version: September 7, 2001 相似文献
5.
When an organization solves a portfolio problem with public projects evaluated by multiple criteria, in which the economic dimension is not essential or not well characterized, the classical methods are not useful. We propose a non-linear preference model developed from normative Value Theory and using fuzzy sets to model some sources of imprecision. This model can be considered as a generalization of the classical approaches. However, the optimization problem is very complex in order to be solved with non-linear programming techniques. Therefore, the model is exploited by an evolutionary algorithm, able to achieve a strong improvement of the quality of solution. 相似文献
6.
Mihran Papikian 《Transactions of the American Mathematical Society》2007,359(7):3483-3503
Under a certain assumption, similar to Manin's conjecture, we prove an upper bound on the degree of modular parametrizations of elliptic curves by Drinfeld modular curves, which is the function field analogue of the conjectured bound over the rational numbers.
7.
The exponential functional of simple, symmetric random walks with negative
drift is an infinite polynomial Y = 1 + ξ1 + ξ1ξ2 + ξ1ξ2ξ3 + ⋯ of independent
and identically distributed non-negative random variables. It has moments that are
rational functions of the variables μ
k
= E(ξ
k
) < 1 with universal coefficients. It
turns out that such a coefficient is equal to the number of permutations with descent
set defined by the multiindex of the coefficient. A recursion enumerates all numbers
of permutations with given descent sets in the form of a Pascal-type triangle.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献
8.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献
9.
本文得到了广义区间空间中几个参数型非空交定理,并用此结果证明了一些新型极大极小定理,截口定理,重合定理,以及变分不等式解的存在性定理。本文中的结果包含(1,3,5-12,14-16)中相应结果。 相似文献
10.
We construct a correspondence between the set of partitions of a finite set M and the set of pairs of walks to the same vertex on a graph giving the Bratteli diagram of the partition algebra on M. This is the precise analogue of the correspondence between the set of permutations of a finite set and the set of pairs of Young tableaux of the same shape, called the Robinson–Schensted correspondence. 相似文献