全文获取类型
收费全文 | 22795篇 |
免费 | 1033篇 |
国内免费 | 1278篇 |
专业分类
化学 | 9479篇 |
晶体学 | 200篇 |
力学 | 398篇 |
综合类 | 63篇 |
数学 | 11253篇 |
物理学 | 3713篇 |
出版年
2024年 | 35篇 |
2023年 | 365篇 |
2022年 | 266篇 |
2021年 | 288篇 |
2020年 | 441篇 |
2019年 | 554篇 |
2018年 | 484篇 |
2017年 | 392篇 |
2016年 | 468篇 |
2015年 | 552篇 |
2014年 | 782篇 |
2013年 | 1369篇 |
2012年 | 910篇 |
2011年 | 1622篇 |
2010年 | 1250篇 |
2009年 | 1616篇 |
2008年 | 1787篇 |
2007年 | 1575篇 |
2006年 | 1224篇 |
2005年 | 935篇 |
2004年 | 858篇 |
2003年 | 782篇 |
2002年 | 1065篇 |
2001年 | 539篇 |
2000年 | 500篇 |
1999年 | 539篇 |
1998年 | 408篇 |
1997年 | 332篇 |
1996年 | 399篇 |
1995年 | 372篇 |
1994年 | 328篇 |
1993年 | 256篇 |
1992年 | 229篇 |
1991年 | 180篇 |
1990年 | 151篇 |
1989年 | 166篇 |
1988年 | 110篇 |
1987年 | 114篇 |
1986年 | 99篇 |
1985年 | 130篇 |
1984年 | 106篇 |
1983年 | 63篇 |
1982年 | 98篇 |
1981年 | 96篇 |
1980年 | 49篇 |
1979年 | 36篇 |
1978年 | 32篇 |
1977年 | 43篇 |
1976年 | 32篇 |
1971年 | 22篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
建立了电子隧穿电导模型,推导了一维无序体系新的直流电导公式.通过计算20000格点无序体系的直流电导率,分析了直流电导率和温度及外场电压的关系,讨论了无序度对直流电导的影响.计算结果表明,无序体系的直流电导率随无序度的增加而减小;外加电场较小时,电导率相对较大,且出现一系列峰值,电压较大时,电导率反而较小;无序体系在低温区出现了负微分电阻特性,电导率随温度的升高而增大,在高温区电导率随温度的升高而减小.计算结果和实验符合很好
关键词:
无序体系
电子隧穿
直流电导率 相似文献
92.
Hans L. Bodlaender 《Discrete Applied Mathematics》2007,155(11):1348-1372
The Maximum Cardinality Search (MCS) algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbours becomes visited. A maximum cardinality search ordering (MCS-ordering) of a graph is an ordering of the vertices that can be generated by the MCS algorithm. The visited degree of a vertex v in an MCS-ordering is the number of neighbours of v that are before v in the ordering. The visited degree of an MCS-ordering ψ of G is the maximum visited degree over all vertices v in ψ. The maximum visited degree over all MCS-orderings of graph G is called its maximum visited degree. Lucena [A new lower bound for tree-width using maximum cardinality search, SIAM J. Discrete Math. 16 (2003) 345-353] showed that the treewidth of a graph G is at least its maximum visited degree.We show that the maximum visited degree is of size O(logn) for planar graphs, and give examples of planar graphs G with maximum visited degree k with O(k!) vertices, for all k∈N. Given a graph G, it is NP-complete to determine if its maximum visited degree is at least k, for any fixed k?7. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete.In this paper, we also propose some heuristics for the problem, and report on an experimental analysis of them. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the value of the maximum visited degree of a graph, which appear to give results close to optimal on many graphs from real life applications. 相似文献
93.
Robert Hochberg 《Combinatorica》2006,26(1):47-64
We prove that the class of homogeneous quasi-arithmetic progressions has unbounded discrepancy. That is, we show that given any 2-coloring of the natural numbers and any positive integer D, one can find a real number α≥1 and a set of natural numbers of the form {0, [α], [2α], [3α], . . . , [kα]} so that one color appears at least D times more than the other color. This was already proved by Beck in 1983, but the proof given here is somewhat simpler and
gives a better bound on the discrepancy. 相似文献
94.
A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum,
the magic sum. Examples are magic squares (the sets are the rows, columns, and diagonals) and semimagic squares (the same, but without
the diagonals). A magilatin labelling is like a magic labelling but the values need be distinct only within each set. We show that the number of n × n magic or magilatin labellings is a quasipolynomial function of the magic sum, and also of an upper bound on the entries in
the square. Our results differ from previous ones because we require that the entries in the square all be different from
each other, and because we derive our results not by ad hoc reasoning but from a general theory of counting lattice points in rational inside-out polytopes. We also generalize from
set systems to rational linear forms.
Dedicated to the memory of Claudia Zaslavsky, 1917–2006
Received August 10, 2005 相似文献
95.
条件愈苦,意志愈坚 --记王淦昌早年的科研活动 总被引:1,自引:0,他引:1
文章介绍了中国物理学家王淦昌早期的科研工作,特别是在抗日战争时期的科研成绩.王淦昌早期的科研贡献并不是在先进的实验仪器上,在条件优裕的实验室内完成的,而是在实验设备缺乏,科学文献不足等极端困难的环境中完成的.从王淦昌身上,可以看到那个时代中国优秀科学家脚踏实地、执志若金的奋斗精神. 相似文献
96.
S.A. Grigorian 《Topology and its Applications》2006,153(18):3598-3614
Finite-sheeted covering mappings onto compact connected groups are studied. We show that for a covering mapping from a connected Hausdorff topological space onto a compact (in general, non-abelian) group there exists a topological group structure on the covering space such that the mapping becomes a homomorphism of groups. To prove this fact we construct an inverse system of covering mappings onto Lie groups which approximates the given covering mapping. As an application, it is shown that a covering mapping onto a compact connected abelian group G must be a homeomorphism provided that the character group of G admits division by degree of the mapping. We also get a criterion for triviality of coverings in terms of means and prove that each finite covering of G is equivalent to a polynomial covering. 相似文献
97.
本文用COSY,CHCOR等二维核磁共振技术对TRANILAST,2[]3-(3.4-二甲基苯基)1-氧代-2-丙烯基]氨基]苯甲到进行了~1H、~(13)C NMR谱数据分析及归属,并结合~(13)C弛豫时间T_1 及变温实验对合成产品进行了结构鉴定. 相似文献
98.
Xiao-Hong Xu Xiao-Li Li Fang Wang Feng-Xian Jiang Hai-Shun Wu 《Applied Surface Science》2006,252(8):2910-2914
FexPt100−x(30 nm) and [FexPt100−x(3 nm)/ZrO2]10 (x = 37, 48, 57, 63, 69) films with different ZrO2 content were prepared by RF magnetron sputtering technique, then were annealed at 550 °C for 30 min. This work investigates the effect of ZrO2 doping on the microstructural evolution, magnetic properties, grain size, as well as the ordering kinetics of FePt alloy films. The as-deposited films behaved a disordered state, and the ordered L10 structure was obtained by post-annealing. The magnetic properties of the films are changed from soft magnetism to hard magnetism after annealing. The variation of the largest coercivities of [FexPt100−x/ZrO2]10 films with the Fe atomic percentage, x and differing amounts of ZrO2 content reveals that as we increase the ZrO2 content we must correspondingly increase the amount of Fe. This phenomenon suggests that the Zr or O atoms of ZrO2 preferentially react with the Fe atoms of FePt alloy to form compounds. In addition, introducing the nonmagnetic ZrO2 can reduce the intergrain exchange interactions of the FePt/ZrO2 films, and the interactions are decreased as the ZrO2 content increases, the dipole interactions are observed in FePt/ZrO2 films as the ZrO2 content is more than 15%. 相似文献
99.
Piotr Ko?cielniak 《Topology and its Applications》2007,154(9):1951-1955
Let M be a compact manifold with dimM?2. We prove that some iteration of the generic homeomorphism on M is semiconjugated to the shift map and has infinite topological entropy (Theorem 1.1). 相似文献
100.
Abdo Y. Alfakih 《Discrete Applied Mathematics》2007,155(10):1244-1253
Let V={1,2,…,n}. A mapping p:V→Rr, where p1,…,pn are not contained in a proper hyper-plane is called an r-configuration. Let G=(V,E) be a simple connected graph on n vertices. Then an r-configuration p together with graph G, where adjacent vertices of G are constrained to stay the same distance apart, is called a bar-and-joint framework (or a framework) in Rr, and is denoted by G(p). In this paper we introduce the notion of dimensional rigidity of frameworks, and we study the problem of determining whether or not a given G(p) is dimensionally rigid. A given framework G(p) in Rr is said to be dimensionally rigid iff there does not exist a framework G(q) in Rs for s?r+1, such that ∥qi-qj∥2=∥pi-pj∥2 for all (i,j)∈E. We present necessary and sufficient conditions for G(p) to be dimensionally rigid, and we formulate the problem of checking the validity of these conditions as a semidefinite programming (SDP) problem. The case where the points p1,…,pn of the given r-configuration are in general position, is also investigated. 相似文献