全文获取类型
收费全文 | 4726篇 |
免费 | 410篇 |
国内免费 | 378篇 |
专业分类
化学 | 999篇 |
晶体学 | 2篇 |
力学 | 678篇 |
综合类 | 51篇 |
数学 | 2923篇 |
物理学 | 861篇 |
出版年
2024年 | 3篇 |
2023年 | 45篇 |
2022年 | 84篇 |
2021年 | 106篇 |
2020年 | 152篇 |
2019年 | 128篇 |
2018年 | 123篇 |
2017年 | 117篇 |
2016年 | 177篇 |
2015年 | 128篇 |
2014年 | 221篇 |
2013年 | 417篇 |
2012年 | 183篇 |
2011年 | 260篇 |
2010年 | 222篇 |
2009年 | 276篇 |
2008年 | 301篇 |
2007年 | 299篇 |
2006年 | 267篇 |
2005年 | 241篇 |
2004年 | 198篇 |
2003年 | 223篇 |
2002年 | 179篇 |
2001年 | 151篇 |
2000年 | 172篇 |
1999年 | 137篇 |
1998年 | 127篇 |
1997年 | 128篇 |
1996年 | 86篇 |
1995年 | 60篇 |
1994年 | 44篇 |
1993年 | 39篇 |
1992年 | 23篇 |
1991年 | 31篇 |
1990年 | 26篇 |
1989年 | 26篇 |
1988年 | 15篇 |
1987年 | 20篇 |
1986年 | 10篇 |
1985年 | 19篇 |
1984年 | 12篇 |
1983年 | 5篇 |
1982年 | 4篇 |
1981年 | 6篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1975年 | 2篇 |
1974年 | 3篇 |
1936年 | 2篇 |
排序方式: 共有5514条查询结果,搜索用时 78 毫秒
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.
《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. 相似文献
4.
5.
6.
G. Dattoli 《Journal of Mathematical Analysis and Applications》2002,269(2):716-725
Bilateral generating functions are those involving products of different types of polynomials. We show that operational methods offer a powerful tool to derive these families of generating functions. We study cases relevant to products of Hermite polynomials with Laguerre, Legendre and other polynomials. We also propose further extensions of the method which we develop here. 相似文献
7.
在北京同步辐射装置(BSRF)1W1B光束线和XAFS实验站上国内首次建立了硬X射线波段的磁圆二色实验(XMCD)方法. 以单晶金刚石作为相位延迟片, 在透射劳埃(Laue)模式下, 利用衍射双折射效应, 将入射的单色线偏振光转变为相应的左旋和右旋圆偏振光, 测量磁化样品对左旋和右旋圆偏振光吸收的差异, 获得了XMCD信号. 本实验使用透射方法测量了Pt-Fe合金Pt L2,3边的XMCD, 获得了XMCD信号. XMCD实验方法的建立, 为研究磁性材料尤其是磁性薄膜材料的电子结构和磁结构提供了实验基础. 相似文献
8.
9.
Xuding Zhu 《Journal of Graph Theory》2005,48(3):186-209
For 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which i ~j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005 相似文献
10.
讨论了顾客到达时间和服务时间与等待队列队长有关的排队系统模拟,顾客服务次数不止1次即出现循环的复杂排队系统,引入到达因子、服务台因子和循环因子,在串并联多服务台情形下建立了4类计算机模拟模型,给出该复杂循环排队系统在进程调度中的应用并进行了计算机模拟. 相似文献