全文获取类型
收费全文 | 2179篇 |
免费 | 203篇 |
国内免费 | 148篇 |
专业分类
化学 | 149篇 |
晶体学 | 3篇 |
力学 | 199篇 |
综合类 | 14篇 |
数学 | 1289篇 |
物理学 | 876篇 |
出版年
2024年 | 2篇 |
2023年 | 22篇 |
2022年 | 23篇 |
2021年 | 34篇 |
2020年 | 64篇 |
2019年 | 60篇 |
2018年 | 53篇 |
2017年 | 58篇 |
2016年 | 47篇 |
2015年 | 55篇 |
2014年 | 100篇 |
2013年 | 162篇 |
2012年 | 98篇 |
2011年 | 135篇 |
2010年 | 103篇 |
2009年 | 156篇 |
2008年 | 175篇 |
2007年 | 166篇 |
2006年 | 127篇 |
2005年 | 102篇 |
2004年 | 123篇 |
2003年 | 113篇 |
2002年 | 92篇 |
2001年 | 63篇 |
2000年 | 48篇 |
1999年 | 50篇 |
1998年 | 37篇 |
1997年 | 45篇 |
1996年 | 37篇 |
1995年 | 24篇 |
1994年 | 29篇 |
1993年 | 22篇 |
1992年 | 25篇 |
1991年 | 9篇 |
1990年 | 5篇 |
1989年 | 9篇 |
1988年 | 6篇 |
1987年 | 4篇 |
1986年 | 8篇 |
1985年 | 9篇 |
1984年 | 8篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 4篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1974年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有2530条查询结果,搜索用时 36 毫秒
1.
2.
3.
4.
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.
6.
《Discrete Mathematics》2022,345(12):113069
The toughness of a noncomplete graph G is the maximum real number t such that the ratio of to the number of components of is at least t for every cutset S of G. Determining the toughness for a given graph is NP-hard. Chvátal's toughness conjecture, stating that there exists a constant such that every graph with toughness at least is hamiltonian, is still open for general graphs. A graph is called -free if it does not contain any induced subgraph isomorphic to , the disjoint union of and two isolated vertices. In this paper, we confirm Chvátal's toughness conjecture for -free graphs by showing that every 7-tough -free graph on at least three vertices is hamiltonian. 相似文献
7.
《Discrete Mathematics》2022,345(12):113083
Let G be a graph, the order of G, the connectivity of G and k a positive integer such that . Then G is said to be k-extendable if it has a matching of size k and every matching of size k extends to a perfect matching of G. A Hamiltonian path of a graph G is a spanning path of G. A bipartite graph G with vertex sets and is defined to be Hamiltonian-laceable if such that and for every pair of vertices and , there exists a Hamiltonian path in G with endpoints p and q, or and for every pair of vertices , there exists a Hamiltonian path in G with endpoints p and q. Let G be a bipartite graph with bipartition . Define to be a maximum integer such that and (1) for each non-empty subset S of X, if , then , and if , then ; and (2) for each non-empty subset S of Y, if , then , and if , then ; and (3) if there is no non-negative integer satisfying (1) and (2).Let G be a bipartite graph with bipartition such that and . In this paper, we show that if , then G is Hamiltonian-laceable; or if , then for every pair of vertices and , there is an -path P in G with . We show some of its corollaries in k-extendable, bipartite graphs and a conjecture in k-extendable graphs. 相似文献
8.
Yb3+掺杂晶体材料是重要的激光材料,在超短脉冲激光、大功率激光等领域有重要应用前景,但长期以来很难通过实验拟合确定Yb3+晶体场参数,尤其是低对称体系,从头计算是解决此问题的重要途经.本文介绍了适合计算稀土离子掺杂晶体的从头计算DV-Xα方法和有效哈密顿量模型,用该方法计算了Yb3+掺杂M型和M'型钽铌酸盐的晶场参数和旋轨耦合参数,得到的能级结构和实验能很好地符合,并发现了Yb3+掺杂钽铌酸盐的晶场强度参数随稀土原子序数呈现规律变化.表明结合DV-Xα计算和有效哈密顿量方法是计算Yb3+掺杂低对称钽铌酸盐晶体场的有效途径,结果显示Yb3+掺杂钽铌酸盐晶体有望成为新型全固态激光工作物质. 相似文献
9.
10.
Jing Yu Jingwei Han Chuanzhong Li 《Mathematical Methods in the Applied Sciences》2020,43(6):3076-3085
For the orthosymplectic Lie superalgebra , we choose a set of basis matrices. A linear combination of those basis matrices presents a spatial spectral matrix. The compatible condition of the spatial part and the corresponding temporal parts of the spectral problem leads to a generalized super AKNS (GSAKNS) hierarchy. By making use of the supertrace identity, the obtained GSAKNS hierarchy can be written as the super bi-Hamiltonian structures. 相似文献