全文获取类型
收费全文 | 8060篇 |
免费 | 724篇 |
国内免费 | 689篇 |
专业分类
化学 | 914篇 |
晶体学 | 14篇 |
力学 | 584篇 |
综合类 | 222篇 |
数学 | 5831篇 |
物理学 | 1908篇 |
出版年
2024年 | 14篇 |
2023年 | 90篇 |
2022年 | 135篇 |
2021年 | 183篇 |
2020年 | 203篇 |
2019年 | 217篇 |
2018年 | 193篇 |
2017年 | 255篇 |
2016年 | 333篇 |
2015年 | 241篇 |
2014年 | 431篇 |
2013年 | 644篇 |
2012年 | 395篇 |
2011年 | 465篇 |
2010年 | 359篇 |
2009年 | 508篇 |
2008年 | 554篇 |
2007年 | 533篇 |
2006年 | 511篇 |
2005年 | 422篇 |
2004年 | 332篇 |
2003年 | 323篇 |
2002年 | 318篇 |
2001年 | 278篇 |
2000年 | 283篇 |
1999年 | 220篇 |
1998年 | 190篇 |
1997年 | 192篇 |
1996年 | 135篇 |
1995年 | 71篇 |
1994年 | 75篇 |
1993年 | 43篇 |
1992年 | 38篇 |
1991年 | 29篇 |
1990年 | 30篇 |
1989年 | 41篇 |
1988年 | 16篇 |
1987年 | 22篇 |
1986年 | 20篇 |
1985年 | 28篇 |
1984年 | 18篇 |
1983年 | 10篇 |
1982年 | 11篇 |
1981年 | 13篇 |
1980年 | 12篇 |
1978年 | 5篇 |
1977年 | 8篇 |
1976年 | 8篇 |
1975年 | 5篇 |
1936年 | 3篇 |
排序方式: 共有9473条查询结果,搜索用时 62 毫秒
1.
Clemens G. Raab Georg Regensburger Jamal Hossein Poor 《Journal of Pure and Applied Algebra》2021,225(5):106564
A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials. 相似文献
2.
3.
4.
《Indagationes Mathematicae》2022,33(4):801-815
We consider the irreducibility of polynomial where is a negative integer. We observe that the constant term of vanishes if and only if . Therefore we assume that where is a non-negative integer. Let and more general polynomial, let where with are integers such that . Schur was the first to prove the irreducibility of for . It has been proved that is irreducible for . In this paper, by a different method, we prove: Apart from finitely many explicitly given possibilities, either is irreducible or is linear factor times irreducible polynomial. This is a consequence of the estimate whenever has a factor of degree and . This sharpens earlier estimates of Shorey and Tijdeman and Nair and Shorey. 相似文献
5.
6.
Profiling engineered data with robust mining methods continues attracting attention in knowledge engineering systems. The purpose of this article is to propose a simple technique that deals with non-linear multi-factorial multi-characteristic screening suitable for knowledge discovery studies. The method is designed to proactively seek and quantify significant information content in engineered mini-datasets. This is achieved by deploying replicated fractional-factorial sampling schemes. Compiled multi-response data are converted to a single master-response effectuated by a series of distribution-free transformations and multi-compressed data fusions. The resulting amalgamated master response is deciphered by non-linear multi-factorial stealth stochastics intended for saturated schemes. The stealth properties of our method target processing datasets which might be overwhelmed by a lack of knowledge about the nature of reference distributions at play. Stealth features are triggered to overcome restrictions regarding the data normality conformance, the effect sparsity assumption and the inherent collapse of the ‘unexplainable error’ connotation in saturated arrays. The technique is showcased by profiling four ordinary controlling factors that influence webpage content performance by collecting data from a commercial browser monitoring service on a large scale web host. The examined effects are: (1) the number of Cascading Style Sheets files, (2) the number of JavaScript files, (3) the number of Image files, and (4) the Domain Name System Aliasing. The webpage performance level was screened against three popular characteristics: (1) the time to first visual, (2) the total loading time, and (3) the customer satisfaction. Our robust multi-response data mining technique is elucidated for a ten-replicate run study dictated by an L9(34) orthogonal array scheme where any uncontrolled noise embedded contribution has not been necessarily excluded. 相似文献
7.
8.
9.
10.
HIRONOBU Ishihara 《Geometriae Dedicata》1997,67(3):309-336
Several classification results for ample vector bundles of rank 2 on Hirzebruch surfaces, and on Del Pezzo surfaces, are obtained. In particular, we classify rank 2 ample vector bundles with c2 less than seven on Hirzebruch surfaces, and with c2 less than four on Del Pezzo surfaces. 相似文献