全文获取类型
收费全文 | 26390篇 |
免费 | 786篇 |
国内免费 | 977篇 |
专业分类
化学 | 5461篇 |
晶体学 | 888篇 |
力学 | 498篇 |
综合类 | 86篇 |
数学 | 17989篇 |
物理学 | 3231篇 |
出版年
2023年 | 89篇 |
2022年 | 192篇 |
2021年 | 187篇 |
2020年 | 195篇 |
2019年 | 584篇 |
2018年 | 636篇 |
2017年 | 433篇 |
2016年 | 393篇 |
2015年 | 388篇 |
2014年 | 790篇 |
2013年 | 1490篇 |
2012年 | 831篇 |
2011年 | 1662篇 |
2010年 | 1695篇 |
2009年 | 1935篇 |
2008年 | 1986篇 |
2007年 | 1991篇 |
2006年 | 1564篇 |
2005年 | 1149篇 |
2004年 | 1085篇 |
2003年 | 870篇 |
2002年 | 736篇 |
2001年 | 577篇 |
2000年 | 524篇 |
1999年 | 544篇 |
1998年 | 490篇 |
1997年 | 400篇 |
1996年 | 512篇 |
1995年 | 471篇 |
1994年 | 479篇 |
1993年 | 401篇 |
1992年 | 341篇 |
1991年 | 234篇 |
1990年 | 244篇 |
1989年 | 248篇 |
1988年 | 161篇 |
1987年 | 163篇 |
1986年 | 182篇 |
1985年 | 235篇 |
1984年 | 171篇 |
1983年 | 95篇 |
1982年 | 154篇 |
1981年 | 124篇 |
1980年 | 111篇 |
1979年 | 81篇 |
1978年 | 91篇 |
1977年 | 82篇 |
1976年 | 56篇 |
1975年 | 30篇 |
1974年 | 30篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
91.
Martin Loebl 《Advances in Mathematics》2007,211(2):546-565
We define a q-chromatic function and q-dichromate on graphs and compare it with existing graph functions. Then we study in more detail the class of general chordal graphs. This is partly motivated by the graph isomorphism problem. Finally we relate the q-chromatic function to the colored Jones function of knots. This leads to a curious expression of the colored Jones function of a knot diagram K as a chromatic operator applied to a power series whose coefficients are linear combinations of long chord diagrams. Chromatic operators are directly related to weight systems by the work of Chmutov, Duzhin, Lando and Noble, Welsh. 相似文献
92.
We consider the Dirichlet problem for a class of anisotropic degenerate elliptic equations. New a priori estimates for solutions and for the gradient of solutions are established. Based on these estimates sufficient conditions guaranteeing the solvability of the problem are formulated. The results are new even in the semilinear case when the principal part is the Laplace operator. 相似文献
93.
94.
Norbert Poschadel 《Mathematische Semesterberichte》2002,49(1):45-54
Zusammenfassung. Eine Abbildung zwischen metrischen R?umen hei?t abstandsvertr?glich, wenn der Abstand der Bilder zweier Punkte nur vom Abstand der Punkte selbst abh?ngt. Wir zeigen, dass eine Abbildung genau dann abstandsvertr?glich ist, wenn der Cauchyschen Funktionalgleichung genügt, also ein Endomorphismus der Gruppe ist. Ein entsprechendes Resultat gilt auch für die abstandsvertr?glichen Abbildungen des Kreises (mit der Multiplikation komplexer Zahlen als Gruppenverknüpfung). Damit kann man sowohl alle messbaren abstandsvertr?glichen Abbildungen von bzw. in sich angeben, als auch einen Nachweis für die Existenz nichtmessbarer abstandsvertr?glicher Abbildungen auf und erbringen.
Eingegangen am 20. Juni 2001 / Angenommen am 13. September 2001 相似文献
95.
96.
97.
98.
The pulsed positron beam at the Helsinki University of Technology is designed for the end energy of 3-30 keV and grounded target. This is achieved with a constant voltage acceleration followed by an adjustable deceleration. In the design of this accelerator-decelerator the possibility for electrical breakdowns and partial discharges must be eliminated.For designing the electrode and insulator structures for accelerator-decelerator configuration electric field simulations were carried out with the finite element analysis program. In this paper we present the design of the accelerator-decelerator and the results of the electric field simulations. The results of high voltage tests will also be presented and compared with the simulations. 相似文献
99.
In this paper, we report that the phase transformation of Ni-B, Ni-P diffusion barriers deposited electrolessly on Cu, for the reason that the Ni-P layer is a more effective diffusion barrier than the Ni-B layer. The Ni3B crystallized was decomposed to Ni and B2O3 above 400 °C and the Ni3P crystallized was decomposed to Ni and P2O5 above 600 °C respectively in Ar atmosphere. Also, the Ni3B was decomposed to Ni and free B above 400 °C and the Ni3P was decomposed to Ni and free P above 600 °C respectively in H2 atmosphere. The decomposed Ni formed a solid solution with Cu. The Cu diffusion occurred above 400 °C for Ni-B layer and above 600 °C for Ni-P layer, respectively. Because the decomposition temperature of Ni-P layer is about 200 °C higher than that of Ni-B layer, the Ni-P layer is a more effective barrier for Cu than the Ni-B layer. 相似文献
100.
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. 相似文献