全文获取类型
收费全文 | 1561篇 |
免费 | 104篇 |
国内免费 | 88篇 |
专业分类
化学 | 152篇 |
力学 | 24篇 |
综合类 | 48篇 |
数学 | 1285篇 |
物理学 | 244篇 |
出版年
2024年 | 2篇 |
2023年 | 16篇 |
2022年 | 46篇 |
2021年 | 35篇 |
2020年 | 44篇 |
2019年 | 51篇 |
2018年 | 41篇 |
2017年 | 54篇 |
2016年 | 51篇 |
2015年 | 39篇 |
2014年 | 74篇 |
2013年 | 136篇 |
2012年 | 56篇 |
2011年 | 73篇 |
2010年 | 95篇 |
2009年 | 93篇 |
2008年 | 128篇 |
2007年 | 105篇 |
2006年 | 94篇 |
2005年 | 48篇 |
2004年 | 63篇 |
2003年 | 59篇 |
2002年 | 48篇 |
2001年 | 47篇 |
2000年 | 40篇 |
1999年 | 34篇 |
1998年 | 34篇 |
1997年 | 16篇 |
1996年 | 23篇 |
1995年 | 16篇 |
1994年 | 14篇 |
1993年 | 7篇 |
1992年 | 6篇 |
1991年 | 9篇 |
1990年 | 8篇 |
1989年 | 5篇 |
1987年 | 3篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1984年 | 7篇 |
1983年 | 1篇 |
1982年 | 9篇 |
1981年 | 6篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1971年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有1753条查询结果,搜索用时 109 毫秒
151.
If the dimension of a linear space is not greater than 3, then the characteristic polynomial of the Coxeter transformation associated with any symmetric matrix is invariant under the natural action of the symmetric group. If the dimensionality is greater than 3, then this statement does not hold. The set of all trees such that the spectrum of their associated Coxeter transformation contains negative one is three-dimensional. 相似文献
152.
Eric S. Egge 《Discrete Mathematics》2006,306(6):552-563
Gire, West, and Kremer have found ten classes of restricted permutations counted by the large Schröder numbers, no two of which are trivially Wilf-equivalent. In this paper we enumerate eleven classes of restricted signed permutations counted by the large Schröder numbers, no two of which are trivially Wilf-equivalent. We obtain five of these enumerations by elementary methods, five by displaying isomorphisms with the classical Schröder generating tree, and one by giving an isomorphism with a new Schröder generating tree. When combined with a result of Egge and a computer search, this completes the classification of restricted signed permutations counted by the large Schröder numbers in which the set of restrictions consists of two patterns of length 2 and two of length 3. 相似文献
153.
Yury J. Ionin 《Discrete Mathematics》2006,306(14):1557-1568
The first infinite families of symmetric designs were obtained from finite projective geometries, Hadamard matrices, and difference sets. In this paper we describe two general methods of constructing symmetric designs that give rise to the parameters of all other known infinite families of symmetric designs. The method of global decomposition produces an incidence matrix of a symmetric design as a block matrix with each block being a zero matrix or an incidence matrix of a smaller symmetric design. The method of local decomposition represents incidence matrices of a residual and a derived design of a symmetric design as block matrices with each block being a zero matrix or an incidence matrix of a smaller residual or derived design, respectively. 相似文献
154.
Yury Nikulin 《Journal of Heuristics》2008,14(4):391-402
This paper addresses the robust spanning tree problem with interval data, i.e. the case of classical minimum spanning tree
problem when edge weights are not fixed but take their values from some intervals associated with edges. The problem consists
of finding a spanning tree that minimizes so-called robust deviation, i.e. deviation from an optimal solution under the worst
case realization of interval weights. As it was proven in Kouvelis and Yu (Robust Discrete Optimization and Its Applications,
Kluwer Academic, Norwell, 1997), the problem is NP-hard, therefore it is of great interest to tackle it with some metaheuristic approach, namely simulated
annealing, in order to calculate an approximate solution for large scale instances efficiently. We describe theoretical aspects
and present the results of computational experiments. To the best of our knowledge, this is the first attempt to develop a
metaheuristic approach for solving the robust spanning tree problem. 相似文献
155.
This paper provides a method of finding the optimal expansion process and discusses the marginal analysis for expansion of the competence set when the cost functions are asymmetric. The concept of tree expansion process is introduced, and a method of finding the optimal tree expansion process is given. The paper also shows a way to identify the optimal competence set when both the expected return and cost are considered. 相似文献
156.
We propose a new scenario tree reduction algorithm for multistage stochastic programs, which integrates the reduction of a
scenario tree into the solution process of the stochastic program. This allows to construct a scenario tree that is highly
adapted on the optimization problem. The algorithm starts with a rough approximation of the original tree and locally refines
this approximation as long as necessary. Promising numerical results for scenario tree reductions in the settings of portfolio
management and power management with uncertain load are presented. 相似文献
157.
子图识别问题(SRP)就是在一个图G中确定并寻找是否存在和另一个图H相同构的子图.本文将引入图的层分解概念,并以此为基础建立识别图的同构子图的算法.该算法的复杂性为O(n(△-1)^k-1),其中△是图G的度,即G中点的最大度,n,k分别是图G,H的阶. 相似文献
158.
以有序树为工具,研究了可以描述连环计,诱敌深入等多步矩阵对策上的一类计策模型.在不考虑信息环境的封闭对策系统中,及局中人对每一步矩阵对策的赢得矩阵,两个局中人的策略集合以及局中人的理性等的了解都是局中人的共同知识的假定下,提出了局中人的最优计策链及将计就计等概念,研究了局中人中计和识破计策的固有概率,讨论了局中人在什么情况下最好主动用计,在什么情况下最好从动用计以及求解最优计策等问题. 相似文献
159.
160.
设P(G,λ)是图G关于变量λ的色多项式,P(G,λ)=P(H,λ),称G和H色等价,由连接两个顶点的S条内部不交的路组成的图叫S-桥图。本讨论了5-桥图F(2,a,a,b,c)(c≥b≥a 1,a≥2)的色性,完整刻画了这类图的色等价图。 相似文献