全文获取类型
收费全文 | 2991篇 |
免费 | 147篇 |
国内免费 | 244篇 |
专业分类
化学 | 278篇 |
力学 | 148篇 |
综合类 | 31篇 |
数学 | 2724篇 |
物理学 | 201篇 |
出版年
2024年 | 3篇 |
2023年 | 25篇 |
2022年 | 44篇 |
2021年 | 40篇 |
2020年 | 50篇 |
2019年 | 73篇 |
2018年 | 66篇 |
2017年 | 59篇 |
2016年 | 77篇 |
2015年 | 63篇 |
2014年 | 141篇 |
2013年 | 202篇 |
2012年 | 104篇 |
2011年 | 147篇 |
2010年 | 111篇 |
2009年 | 188篇 |
2008年 | 248篇 |
2007年 | 182篇 |
2006年 | 178篇 |
2005年 | 154篇 |
2004年 | 112篇 |
2003年 | 114篇 |
2002年 | 98篇 |
2001年 | 94篇 |
2000年 | 86篇 |
1999年 | 103篇 |
1998年 | 90篇 |
1997年 | 87篇 |
1996年 | 74篇 |
1995年 | 46篇 |
1994年 | 35篇 |
1993年 | 35篇 |
1992年 | 27篇 |
1991年 | 20篇 |
1990年 | 18篇 |
1989年 | 19篇 |
1988年 | 15篇 |
1987年 | 6篇 |
1986年 | 5篇 |
1985年 | 26篇 |
1984年 | 20篇 |
1983年 | 8篇 |
1982年 | 14篇 |
1981年 | 16篇 |
1980年 | 19篇 |
1979年 | 17篇 |
1978年 | 9篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1936年 | 1篇 |
排序方式: 共有3382条查询结果,搜索用时 20 毫秒
1.
In this paper, by using qualitative analysis, we investigate the number of limit cycles of perturbed cubic Hamiltonian system with perturbation in the form of (2n+2m) or (2n+2m+1)th degree polynomials . We show that the perturbed systems has at most (n+m) limit cycles, and has at most n limit cycles if m=1. If m=1, n=1 and m=1, n=2, the general conditions for the number of existing limit cycles and the stability of the limit cycles will be established, respectively. Such conditions depend on the coefficients of the perturbed terms. In order to illustrate our results, two numerical examples on the location and stability of the limit cycles are given. 相似文献
2.
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 相似文献
3.
本文对系统dxdt=-y(1-ax2n)(1-bx2n) δx-lx4n 1dydt=x2n-1(1-cx2n)(1-bx2n)进行定性分析,得出其极限环的存在性,不存在性及唯一性的一系列充分条件. 相似文献
4.
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. 相似文献
5.
Artūras Dubickas 《Proceedings Mathematical Sciences》2005,115(4):391-397
Suppose that α > 1 is an algebraic number and ξ > 0 is a real number. We prove that the sequence of fractional partsξα
n
, n = 1, 2, 3, …, has infinitely many limit points except when α is a PV-number and ξ ∈ ℚ(α). For ξ = 1 and α being a rational
non-integer number, this result was proved by Vijayaraghavan. 相似文献
6.
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. 相似文献
7.
本文研究了A型暂留稳定过程在无穷远处的收敛速度,给出了一个重对数律.同时我们也得出了这类过程在起始点附近的一些性质.这些性质推广了[1]中的结果 相似文献
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. 相似文献