全文获取类型
收费全文 | 3615篇 |
免费 | 193篇 |
国内免费 | 390篇 |
专业分类
化学 | 196篇 |
力学 | 35篇 |
综合类 | 31篇 |
数学 | 2312篇 |
物理学 | 138篇 |
综合类 | 1486篇 |
出版年
2024年 | 4篇 |
2023年 | 31篇 |
2022年 | 34篇 |
2021年 | 34篇 |
2020年 | 51篇 |
2019年 | 67篇 |
2018年 | 70篇 |
2017年 | 72篇 |
2016年 | 78篇 |
2015年 | 69篇 |
2014年 | 158篇 |
2013年 | 207篇 |
2012年 | 150篇 |
2011年 | 162篇 |
2010年 | 179篇 |
2009年 | 219篇 |
2008年 | 283篇 |
2007年 | 259篇 |
2006年 | 252篇 |
2005年 | 216篇 |
2004年 | 165篇 |
2003年 | 167篇 |
2002年 | 138篇 |
2001年 | 143篇 |
2000年 | 128篇 |
1999年 | 121篇 |
1998年 | 107篇 |
1997年 | 92篇 |
1996年 | 96篇 |
1995年 | 54篇 |
1994年 | 50篇 |
1993年 | 48篇 |
1992年 | 38篇 |
1991年 | 25篇 |
1990年 | 22篇 |
1989年 | 34篇 |
1988年 | 21篇 |
1987年 | 15篇 |
1986年 | 7篇 |
1985年 | 27篇 |
1984年 | 17篇 |
1983年 | 4篇 |
1982年 | 13篇 |
1981年 | 15篇 |
1980年 | 19篇 |
1979年 | 15篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 4篇 |
1936年 | 1篇 |
排序方式: 共有4198条查询结果,搜索用时 0 毫秒
1.
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 相似文献
2.
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. 相似文献
3.
In this note we show how coverings induced by voltage assignments can be used to produce packings of disjoint copies of the Hoffman‐Singleton graph into K50. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 408–412, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10049 相似文献
4.
针对辐射源威胁评估实时性、复杂性和信息不确定性的问题,将直觉模糊集与贝叶斯网络相结合,提出一种基于IFS-BN的辐射源威胁评估方法。IFS-BN算法通过直觉模糊集刻画贝叶斯网络的节点信息,充分描述节点信息的确定性,不确定性以及犹豫度。同时,将直觉模糊集求得的各辐射源先验概率代入贝叶斯网络模型之中,得出后验概率进行威胁等级排序,并在此基础上建立了相应的评估指标体系。仿真分析表明,算法具有较好的可行性与有效性。与经典贝叶斯网络评估方法相比,IFS-BN算法的结果更加客观合理。 相似文献
5.
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. 相似文献
6.
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. 相似文献
7.
External difference families (EDFs) are a type of new combinatorial designs originated from cryptography. In this paper, some
earlier ideas of recursive and cyclotomic constructions of combinatorial designs are extended, and a number of classes of
EDFs and disjoint difference families are presented. A link between a subclass of EDFs and a special type of (almost) difference
sets is set up. 相似文献
8.
Silvia Vogel 《Annals of Operations Research》2006,142(1):269-282
The paper considers upper semicontinuous behavior in distribution of sequences of random closed sets. Semiconvergence in distribution
will be described via convergence in distribution of random variables with values in a suitable topological space. Convergence
statements for suitable functions of random sets are proved and the results are employed to derive stability statements for
random optimization problems where the objective function and the constraint set are approximated simultaneously.
The author is grateful to two anonymous referees for helpful suggestions. 相似文献
9.
强伪凸函数是凸函数的重要推广函数之一。文中在给出强伪凸函数定义的基础上讨论了它的一些性质,另外还给出了它与强凸函数之间的关系。 相似文献
10.
Jonathan M. Borwein 《Optimization Letters》2007,1(1):21-32
This paper is a companion to a lecture given at the Prague Spring School in Analysis in April 2006. It highlights four distinct variational methods of proving that a finite dimensional Chebyshev set is convex and hopes to inspire renewed work on the open question of whether every Chebyshev set in Hilbert space is convex. 相似文献