全文获取类型
收费全文 | 3670篇 |
免费 | 451篇 |
国内免费 | 387篇 |
专业分类
化学 | 237篇 |
晶体学 | 2篇 |
力学 | 201篇 |
综合类 | 110篇 |
数学 | 3240篇 |
物理学 | 718篇 |
出版年
2024年 | 2篇 |
2023年 | 55篇 |
2022年 | 70篇 |
2021年 | 83篇 |
2020年 | 119篇 |
2019年 | 91篇 |
2018年 | 107篇 |
2017年 | 111篇 |
2016年 | 119篇 |
2015年 | 63篇 |
2014年 | 169篇 |
2013年 | 311篇 |
2012年 | 151篇 |
2011年 | 205篇 |
2010年 | 191篇 |
2009年 | 237篇 |
2008年 | 231篇 |
2007年 | 264篇 |
2006年 | 255篇 |
2005年 | 221篇 |
2004年 | 178篇 |
2003年 | 169篇 |
2002年 | 172篇 |
2001年 | 136篇 |
2000年 | 125篇 |
1999年 | 115篇 |
1998年 | 100篇 |
1997年 | 80篇 |
1996年 | 67篇 |
1995年 | 56篇 |
1994年 | 49篇 |
1993年 | 29篇 |
1992年 | 24篇 |
1991年 | 15篇 |
1990年 | 16篇 |
1989年 | 9篇 |
1988年 | 10篇 |
1987年 | 9篇 |
1986年 | 17篇 |
1985年 | 19篇 |
1984年 | 9篇 |
1983年 | 11篇 |
1982年 | 12篇 |
1981年 | 6篇 |
1980年 | 3篇 |
1978年 | 6篇 |
1977年 | 3篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1957年 | 3篇 |
排序方式: 共有4508条查询结果,搜索用时 46 毫秒
1.
3.
Isochronicity and linearizability of two-dimensional polynomial Hamiltonian systems are revisited and new results are presented. We give a new computational procedure to obtain the necessary and sufficient conditions for the linearization of a polynomial system. Using computer algebra systems we provide necessary and sufficient conditions for linearizability of Hamiltonian systems with homogeneous non-linearities of degrees 5, 6 and 7. We also present some sufficient conditions for systems with nonhomogeneous nonlinearities of degrees two, three and five. 相似文献
5.
本文基于新的Kronecker型替换,给出两个由黑盒表示的稀疏多项式的新确定性插值算法.令f∈R[x1,……,xn]是一个稀疏黑盒多项式,其次数上界为D.当R是C或者是有限域时,相对于已有算法,新算法具有更好的计算复杂度或者关于D的复杂度更低.特别地,对于一般黑盒模型,D是复杂度中的主要因素,而在所有的确定性算法中,本文的第二个算法的复杂度关于D是最低的. 相似文献
6.
8.
QiuHong Wang Abdusalam Abdukerim Wei Chen Xun Chen YunHua Chen XiangYi Cui YingJie Fan DeQing Fang ChangBo Fu LiSheng Geng Karl Giboni Franco Giuliani LinHui Gu XuYuan Guo Ke Han ChangDa He Di Huang Yan Huang YanLin Huang Zhou Huang Peng Ji XiangDong Ji YongLin Ju YiHui Lai Kun Liang HuaXuan Liu JiangLai Liu WenBo Ma YuGang Ma YaJun Mao Yue Meng Parinya Namwongsa KaiXiang Ni JinHua Ning XuYang Ning XiangXiang Ren ChangSong Shang Lin Si AnDi Tan AnQing Wang HongWei Wang Meng Wang SiGuang Wang XiuLi Wang Zhou Wang MengMeng Wu ShiYong Wu JingKai Xia MengJiao Xiao PengWei Xie BinBin Yan JiJun Yang Yong Yang ChunXu Yu Jumin Yuan Dan Zhang HongGuang Zhang Tao Zhang Li Zhao QiBin Zheng JiFang Zhou Ning Zhou XiaoPeng Zhou 《中国科学:物理学 力学 天文学(英文版)》2020,(3):54-63
In dark matter direct detection experiments,neutron is a serious source of background,which can mimic the dark matter-nucleus scattering signals.In this paper,we present an improved evaluation of the neutron background in the PandaX-II dark matter experiment by a novel approach.Instead of fully relying on the Monte Carlo simulation,the overall neutron background is determined from the neutron-induced high energy signals in the data.In addition,the probability of producing a dark-matter-like background per neutron is evaluated with a complete Monte Carlo generator,where the correlated emission of neutron(s)andγ(s)in the(α,n)reactions and spontaneous fissions is taken into consideration.With this method,the neutron backgrounds in the Run 9(26-ton-day)and Run 10(28-ton-day)data sets of PandaX-II are estimated to be(0.66±0.24)and(0.47±0.25)events,respectively. 相似文献
9.
Xiang-Guo Meng Kai-Cai Li Ji-Suo Wang Zhen-Shan Yang Xiao-Yan Zhang Zhen-Tao Zhang Bao-Long Liang 《Frontiers of Physics》2020,15(5):52501
Using an operator ordering method for some commutative superposition operators, we introduce two new multi-variable special polynomials and their generating functions, and present some new operator identities and integral formulas involving the two special polynomials. Instead of calculating complicated partial differential, we use the special polynomials and their generating functions to concisely address the normalization, photocount distributions and Wigner distributions of several quantum states that can be realized physically, the results of which provide real convenience for further investigating the properties and applications of these states. 相似文献
10.
Bhalchandra D. Thatte 《Journal of Graph Theory》2020,93(2):181-202
Previously we showed that many invariants of a graph can be computed from its abstract induced subgraph poset, which is the isomorphism class of the induced subgraph poset, suitably weighted by subgraph counting numbers. In this paper, we study the abstract bond lattice of a graph, which is the isomorphism class of the lattice of distinct unlabelled connected partitions of a graph, suitably weighted by subgraph counting numbers. We show that these two abstract posets can be constructed from each other except in a few trivial cases. The constructions rely on certain generalisations of a lemma of Kocay in graph reconstruction theory to abstract induced subgraph posets. As a corollary, trees are reconstructible from their abstract bond lattice. We show that the chromatic symmetric function and the symmetric Tutte polynomial of a graph can be computed from its abstract induced subgraph poset. Stanley has asked if every tree is determined up to isomorphism by its chromatic symmetric function. We prove a counting lemma, and indicate future directions for a study of Stanley's question. 相似文献