全文获取类型
收费全文 | 4878篇 |
免费 | 335篇 |
国内免费 | 522篇 |
专业分类
化学 | 474篇 |
晶体学 | 5篇 |
力学 | 87篇 |
综合类 | 112篇 |
数学 | 4573篇 |
物理学 | 484篇 |
出版年
2023年 | 61篇 |
2022年 | 43篇 |
2021年 | 56篇 |
2020年 | 91篇 |
2019年 | 134篇 |
2018年 | 126篇 |
2017年 | 141篇 |
2016年 | 173篇 |
2015年 | 72篇 |
2014年 | 196篇 |
2013年 | 477篇 |
2012年 | 183篇 |
2011年 | 251篇 |
2010年 | 214篇 |
2009年 | 310篇 |
2008年 | 336篇 |
2007年 | 352篇 |
2006年 | 286篇 |
2005年 | 247篇 |
2004年 | 236篇 |
2003年 | 233篇 |
2002年 | 246篇 |
2001年 | 184篇 |
2000年 | 179篇 |
1999年 | 143篇 |
1998年 | 148篇 |
1997年 | 118篇 |
1996年 | 94篇 |
1995年 | 53篇 |
1994年 | 43篇 |
1993年 | 44篇 |
1992年 | 40篇 |
1991年 | 17篇 |
1990年 | 15篇 |
1989年 | 16篇 |
1988年 | 16篇 |
1987年 | 18篇 |
1986年 | 13篇 |
1985年 | 18篇 |
1984年 | 19篇 |
1983年 | 5篇 |
1982年 | 13篇 |
1981年 | 10篇 |
1980年 | 10篇 |
1979年 | 13篇 |
1978年 | 10篇 |
1977年 | 10篇 |
1976年 | 5篇 |
1973年 | 3篇 |
1972年 | 3篇 |
排序方式: 共有5735条查询结果,搜索用时 93 毫秒
31.
本文给出了四次函数实零点的完全判据和正定条件,这一结果在研究多项式系统的奇点分析和分支问题时给出了可以实用的判据. 相似文献
32.
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation. 相似文献
33.
This paper investigates the existence of positive solutions of a singular boundary value problem with negative exponent similar
to standard Emden-Fowler equation. A necessary and sufficient condition for the existence of C[0, 1] positive solutions as
well as C1[0, 1] positive solutions is given by means of the method of lower and upper solutions with the Schauder fixed point theorem. 相似文献
34.
Xian Xu 《Journal of Mathematical Analysis and Applications》2004,291(2):673-689
In this paper, some multiplicity results for positive solutions of some singular semi-positone three-point boundary value problem be obtained by using the fixed point index method. 相似文献
35.
M. I. Gil' 《Proceedings of the American Mathematical Society》2003,131(12):3737-3746
A linear operator in a separable Hilbert space is called a quasinormal one if it is a sum of a normal operator and a compact one. In the paper, bounds for the spectrum of quasinormal operators are established. In addition, the lower estimate for the spectral radius is derived. Under some restrictions, that estimate improves the well-known results. Applications to integral operators and matrices are discussed. Our results are new even in the finite-dimensional case.
36.
Let Um be an m×m Haar unitary matrix and U[m,n] be its n×n truncation. In this paper the large deviation is proven for the empirical eigenvalue density of U[m,n] as m/n→λ and n→∞. The rate function and the limit distribution are given explicitly. U[m,n] is the random matrix model of quq, where u is a Haar unitary in a finite von Neumann algebra, q is a certain projection and they are free. The limit distribution coincides with the Brown measure of the operator quq. 相似文献
37.
§ 1 IntroductionLetRn×mdenotetherealn×mmatrixspace ,Rn×mr itssubsetwhoseelementshaverankr ,ORn×nthesetofalln×northogonalmatrices,SRn×n(SRn×n≥ ,SRn×n>)thesetofalln×nrealsymmetric (symmetricpositivesemidefinite ,positivedefinite)matrices.ThenotationA>0 (≥ 0 ,<0 ,≤ 0 )m… 相似文献
38.
Weaving is a matrix construction developed in 1990 for the purpose of obtaining new weighing matrices. Hadamard matrices obtained by weaving have the same orders as those obtained using the Kronecker product, but weaving affords greater control over the internal structure of matrices constructed, leading to many new Hadamard equivalence classes among these known orders. It is known that different classes of Hadamard matrices may have different maximum excess. We explain why those classes with smaller excess may be of interest, apply the method of weaving to explore this question, and obtain constructions for new Hadamard matrices with maximum excess in their respective classes. With this method, we are also able to construct Hadamard matrices of near‐maximal excess with ease, in orders too large for other by‐hand constructions to be of much value. We obtain new lower bounds for the maximum excess among Hadamard matrices in some orders by constructing candidates for the largest excess. For example, we construct a Hadamard matrix with excess 1408 in order 128, larger than all previously known values. We obtain classes of Hadamard matrices of order 96 with maximum excess 912 and 920, which demonstrates that the maximum excess for classes of that order may assume at least three different values. Since the excess of a woven Hadamard matrix is determined by the row sums of the matrices used to weave it, we also investigate the properties of row sums of Hadamard matrices and give lists of them in small orders. © 2004 Wiley Periodicals, Inc. J Combin Designs 12: 233–255, 2004. 相似文献
39.
Athanossios Tzouvaras 《Mathematical Logic Quarterly》2003,49(3):284-292
The powerset operator, ??, is compared with other operators of similar type and logical complexity. Namely we examine positive operators whose defining formula has a canonical form containing at most a string of universal quantifiers. We call them ?‐operators. The question we address in this paper is: How is the class of ?‐operators generated ? It is shown that every positive ?‐operator Γ such that Γ(??) ≠ ??, is finitely generated from ??, the identity operator Id, constant operators and certain trivial ones by composition, ∪ and ∩. This extends results of [3] concerning bounded positive operators. 相似文献
40.
This paper considers a new approach to a priori sparsification of the sparsity pattern of the factorized approximate inverses (FSAI) preconditioner using the so‐called vector aggregation technique. The suggested approach consists in construction of the FSAI preconditioner to the aggregated matrix with a prescribed sparsity pattern. Then small entries of the computed ‘aggregated’ FSAI preconditioning matrix are dropped, and the resulting pointwise sparsity pattern is used to construct the low‐density block sparsity pattern of the FSAI preconditioning matrix to the original matrix. This approach allows to minimize (sometimes significantly) the construction costs of low‐density high‐quality FSAI preconditioners. Numerical results with sample matrices from structural mechanics and thin shell problems are presented. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献