全文获取类型
收费全文 | 1768篇 |
免费 | 67篇 |
国内免费 | 119篇 |
专业分类
化学 | 131篇 |
力学 | 41篇 |
综合类 | 21篇 |
数学 | 1615篇 |
物理学 | 146篇 |
出版年
2023年 | 31篇 |
2022年 | 36篇 |
2021年 | 35篇 |
2020年 | 34篇 |
2019年 | 56篇 |
2018年 | 58篇 |
2017年 | 61篇 |
2016年 | 65篇 |
2015年 | 35篇 |
2014年 | 80篇 |
2013年 | 186篇 |
2012年 | 74篇 |
2011年 | 85篇 |
2010年 | 83篇 |
2009年 | 115篇 |
2008年 | 107篇 |
2007年 | 85篇 |
2006年 | 88篇 |
2005年 | 75篇 |
2004年 | 67篇 |
2003年 | 55篇 |
2002年 | 62篇 |
2001年 | 49篇 |
2000年 | 56篇 |
1999年 | 44篇 |
1998年 | 40篇 |
1997年 | 33篇 |
1996年 | 23篇 |
1995年 | 14篇 |
1994年 | 23篇 |
1993年 | 13篇 |
1992年 | 11篇 |
1991年 | 8篇 |
1990年 | 9篇 |
1989年 | 5篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1986年 | 5篇 |
1985年 | 7篇 |
1984年 | 7篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1980年 | 6篇 |
1979年 | 2篇 |
1978年 | 3篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1974年 | 1篇 |
1973年 | 2篇 |
排序方式: 共有1954条查询结果,搜索用时 0 毫秒
91.
本文研究了正定厄米特矩阵Schur补的迹和特征值的性质,通过一个不等式的证明,得到了正定厄米特矩阵和的Schur补与正定厄米特矩阵Schur补的和的迹和特征值之间的不等式. 相似文献
92.
93.
In this paper, a successive supersymmetric rank‐1 decomposition of a real higher‐order supersymmetric tensor is considered. To obtain such a decomposition, we design a greedy method based on iteratively computing the best supersymmetric rank‐1 approximation of the residual tensors. We further show that a supersymmetric canonical decomposition could be obtained when the method is applied to an orthogonally diagonalizable supersymmetric tensor, and in particular, when the order is 2, this method generates the eigenvalue decomposition for symmetric matrices. Details of the algorithm designed and the numerical results are reported in this paper. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
94.
We study finite rank semicommutators and commutators of Toeplitz operators on the Bergman space with quasihomogeneous symbols.
We show that in this context, the situation is different from the case of harmonic Toeplitz operators.
Submitted: July 23, 2007. Accepted: December 4, 2007. 相似文献
95.
THE NECESSARY AND SUFFICIENT CONDITIONS FOR THE SOLVABILITY OF A CLASS OF THE MATRIX INVERSE PROBLEM
Censider the solutions of the matrix inverse problem, which are symmetric positive semide finite on a subspace. Necessary and sufficient conditions for the solvability, as well as the general solution are obtained. The best approximate solution by the above solution set is given. Thus the open problem in [1] is solved. 相似文献
96.
In this paper, we study lower bounds on the size of a maximum independent set and a maximum matching in a hypergraph of rank three. The rank in a hypergraph is the size of a maximum edge in the hypergraph. A hypergraph is simple if no two edges contain exactly the same vertices. Let H be a hypergraph and let and be the size of a maximum independent set and a maximum matching, respectively, in H, where a set of vertices in H is independent (also called strongly independent in the literature) if no two vertices in the set belong to a common edge. Let H be a hypergraph of rank at most three and maximum degree at most three. We show that with equality if and only if H is the Fano plane. In fact, we show that if H is connected and different from the Fano plane, then and we characterize the hypergraphs achieving equality in this bound. Using this result, we show that that if H is a simple connected 3‐uniform hypergraph of order at least 8 and with maximum degree at most three, then and there is a connected 3‐uniform hypergraph H of order 19 achieving this lower bound. Finally, we show that if H is a connected hypergraph of rank at most three that is not a complete hypergraph on vertices, where denotes the maximum degree in H, then and this bound is asymptotically best possible. © 2012 Wiley Periodicals, Inc. J. Graph Theory 相似文献
97.
Moufang sets were introduced by Jacques Tits in order to understand isotropic linear algebraic groups of relative rank one, but the notion is more general. We describe a new class of Moufang sets, arising from so‐called mixed groups of type in characteristic 2, obtained as the fixed point set under a suitable involution. 相似文献
98.
In this paper, we analyze cost sharing problems arising from a general service by explicitly taking into account the generated revenues. To this cost-revenue sharing problem, we associate a cooperative game with transferable utility, called cost-revenue game. By considering cooperation among the agents using the general service, the value of a coalition is defined as the maximum net revenues that the coalition may obtain by means of cooperation. As a result, a coalition may profit from not allowing all its members to get the service that generates the revenues. We focus on the study of the core of cost-revenue games. Under the assumption that cooperation among the members of the grand coalition grants the use of the service under consideration to all its members, it is shown that a cost-revenue game has a nonempty core for any vector of revenues if, and only if, the dual game of the cost game has a large core. Using this result, we investigate minimum cost spanning tree games with revenues. We show that if every connection cost can take only two values (low or high cost), then, the corresponding minimum cost spanning tree game with revenues has a nonempty core. Furthermore, we provide an example of a minimum cost spanning tree game with revenues with an empty core where every connection cost can take only one of three values (low, medium, or high cost). 相似文献
99.
We study the complexity of automatic structures via well-established concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks of structures, and Cantor–Bendixson ranks (of trees). We prove the following results: (1) The ordinal height of any automatic well-founded partial order is bounded by ωω. (2) The ordinal heights of automatic well-founded relations are unbounded below , the first non-computable ordinal. (3) For any computable ordinal α, there is an automatic structure of Scott rank at least α. Moreover, there are automatic structures of Scott rank . (4) For any computable ordinal α, there is an automatic successor tree of Cantor–Bendixson rank α. 相似文献
100.
Johannes H. Hattingh 《Discrete Applied Mathematics》2009,157(13):2846-2858
Let G=(V,E) be a graph. A set S⊆V is a restrained dominating set if every vertex in V−S is adjacent to a vertex in S and to a vertex in V−S. The restrained domination number of G, denoted γr(G), is the smallest cardinality of a restrained dominating set of G. We will show that if G is a connected graph of order n and minimum degree δ and not isomorphic to one of nine exceptional graphs, then . 相似文献