全文获取类型
收费全文 | 23786篇 |
免费 | 1720篇 |
国内免费 | 1372篇 |
专业分类
化学 | 10907篇 |
晶体学 | 119篇 |
力学 | 130篇 |
综合类 | 74篇 |
数学 | 13481篇 |
物理学 | 2167篇 |
出版年
2023年 | 307篇 |
2022年 | 225篇 |
2021年 | 256篇 |
2020年 | 496篇 |
2019年 | 668篇 |
2018年 | 690篇 |
2017年 | 451篇 |
2016年 | 593篇 |
2015年 | 712篇 |
2014年 | 1075篇 |
2013年 | 1828篇 |
2012年 | 1079篇 |
2011年 | 1466篇 |
2010年 | 1247篇 |
2009年 | 1626篇 |
2008年 | 1694篇 |
2007年 | 1668篇 |
2006年 | 1326篇 |
2005年 | 933篇 |
2004年 | 877篇 |
2003年 | 753篇 |
2002年 | 637篇 |
2001年 | 487篇 |
2000年 | 485篇 |
1999年 | 497篇 |
1998年 | 472篇 |
1997年 | 325篇 |
1996年 | 433篇 |
1995年 | 455篇 |
1994年 | 430篇 |
1993年 | 297篇 |
1992年 | 298篇 |
1991年 | 191篇 |
1990年 | 199篇 |
1989年 | 199篇 |
1988年 | 141篇 |
1987年 | 127篇 |
1986年 | 127篇 |
1985年 | 188篇 |
1984年 | 140篇 |
1983年 | 74篇 |
1982年 | 130篇 |
1981年 | 92篇 |
1980年 | 94篇 |
1979年 | 74篇 |
1978年 | 83篇 |
1977年 | 56篇 |
1976年 | 56篇 |
1975年 | 37篇 |
1973年 | 27篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
81.
We give a new and comparably short proof of Gittins’ index theorem for dynamic allocation problems of the multi-armed bandit type in continuous time under minimal assumptions. This proof gives a complete characterization of optimal allocation strategies as those policies which follow the current leader among the Gittins indices while ensuring that a Gittins index is at an all-time low whenever the associated project is not worked on exclusively. The main tool is a representation property of Gittins index processes which allows us to show that these processes can be chosen to be pathwise lower semi-continuous from the right and quasi-lower semi-continuous from the left. Both regularity properties turn out to be crucial for our characterization and the construction of optimal allocation policies. 相似文献
82.
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. 相似文献
83.
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 相似文献
84.
85.
The object of the present investigation is to introduce a new trigonometric method of summation which is both regular and
Fourier effective and determine its status with reference to other methods of summation (see §2-§4) and also give an application
of this method to determine the degree of approximation in a new Banach space of functions conceived as a generalized Holder
metric (see §5). 相似文献
86.
Eremenko L. T. Oreshko G. V. Nesterenko D. A. Lagodzinskaya G. V. Eremenko I. L. 《Russian Chemical Bulletin》2002,51(1):157-159
The reactions of ethylene glycol mononitrate and glycerol 1,3-dinitrate with methylphosphonic dichloride afforded new nitroxyalkyl methylphosphonates. 相似文献
87.
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. 相似文献
88.
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. 相似文献
89.
本文用COSY,CHCOR等二维核磁共振技术对TRANILAST,2[]3-(3.4-二甲基苯基)1-氧代-2-丙烯基]氨基]苯甲到进行了~1H、~(13)C NMR谱数据分析及归属,并结合~(13)C弛豫时间T_1 及变温实验对合成产品进行了结构鉴定. 相似文献
90.
The paper is concerned with a two-delay singular differential system with a twin parameter. Applying fixed-point index theory, we show the relationship between the asymptotic behaviors of nonlinearities (at zero and infinity) and the open regions (eigenvalue regions) of parameters, which are correlated with delays, such that the system has zero, one and two positive solution(s). 相似文献