全文获取类型
收费全文 | 3483篇 |
免费 | 220篇 |
国内免费 | 363篇 |
专业分类
化学 | 309篇 |
晶体学 | 3篇 |
力学 | 71篇 |
综合类 | 73篇 |
数学 | 3301篇 |
物理学 | 309篇 |
出版年
2024年 | 4篇 |
2023年 | 35篇 |
2022年 | 46篇 |
2021年 | 44篇 |
2020年 | 59篇 |
2019年 | 82篇 |
2018年 | 85篇 |
2017年 | 85篇 |
2016年 | 92篇 |
2015年 | 62篇 |
2014年 | 140篇 |
2013年 | 244篇 |
2012年 | 127篇 |
2011年 | 150篇 |
2010年 | 144篇 |
2009年 | 202篇 |
2008年 | 259篇 |
2007年 | 204篇 |
2006年 | 195篇 |
2005年 | 212篇 |
2004年 | 150篇 |
2003年 | 164篇 |
2002年 | 148篇 |
2001年 | 141篇 |
2000年 | 148篇 |
1999年 | 120篇 |
1998年 | 124篇 |
1997年 | 98篇 |
1996年 | 78篇 |
1995年 | 51篇 |
1994年 | 45篇 |
1993年 | 41篇 |
1992年 | 31篇 |
1991年 | 22篇 |
1990年 | 20篇 |
1989年 | 25篇 |
1988年 | 19篇 |
1987年 | 9篇 |
1986年 | 6篇 |
1985年 | 28篇 |
1984年 | 21篇 |
1983年 | 6篇 |
1982年 | 18篇 |
1981年 | 17篇 |
1980年 | 23篇 |
1979年 | 16篇 |
1978年 | 9篇 |
1977年 | 8篇 |
1976年 | 4篇 |
1936年 | 1篇 |
排序方式: 共有4066条查询结果,搜索用时 623 毫秒
1.
2.
3.
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 相似文献
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.
Michael T. Jury David W. Kribs 《Proceedings of the American Mathematical Society》2005,133(1):213-222
Given a row contraction of operators on a Hilbert space and a family of projections on the space that stabilizes the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries that satisfy natural relations. For a fixed row contraction the set of all dilations forms a partially ordered set with a largest and smallest element. A key technical device in our analysis is a connection with directed graphs. We use a Wold decomposition for partial isometries to describe the models for these dilations, and we discuss how the basic properties of a dilation depend on the row contraction.
6.
7.
Mrio J. Edmundo 《Mathematical Logic Quarterly》2005,51(6):639-641
We show that if G is a definably compact, definably connected definable group defined in an arbitrary o‐minimal structure, then G is divisible. Furthermore, if G is defined in an o‐minimal expansion of a field, k ∈ ? and pk : G → G is the definable map given by pk (x ) = xk for all x ∈ G , then we have |(pk )–1(x )| ≥ kr for all x ∈ G , where r > 0 is the maximal dimension of abelian definable subgroups of G . (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
8.
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. 相似文献
9.
This work consists of two parts. In Part I, we shall give a systematic study of Lorentz conformal structure from structural viewpoints. We study manifolds with split-complex structure. We apply general results on split-complex structure for the study of Lorentz surfaces.In Part II, we study the conformal realization of Lorentz surfaces in the Minkowski 3-space via conformal minimal immersions. We apply loop group theoretic Weierstrass-type representation of timelike constant mean curvature for timelike minimal surfaces. Classical integral representation formula for timelike minimal surfaces will be recovered from loop group theoretic viewpoint. 相似文献
10.
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. 相似文献