全文获取类型
收费全文 | 23780篇 |
免费 | 1742篇 |
国内免费 | 1408篇 |
专业分类
化学 | 10493篇 |
晶体学 | 118篇 |
力学 | 103篇 |
综合类 | 66篇 |
数学 | 14081篇 |
物理学 | 2069篇 |
出版年
2023年 | 300篇 |
2022年 | 194篇 |
2021年 | 251篇 |
2020年 | 488篇 |
2019年 | 733篇 |
2018年 | 734篇 |
2017年 | 441篇 |
2016年 | 592篇 |
2015年 | 713篇 |
2014年 | 1125篇 |
2013年 | 1915篇 |
2012年 | 1132篇 |
2011年 | 1556篇 |
2010年 | 1306篇 |
2009年 | 1543篇 |
2008年 | 1680篇 |
2007年 | 1612篇 |
2006年 | 1308篇 |
2005年 | 952篇 |
2004年 | 821篇 |
2003年 | 779篇 |
2002年 | 648篇 |
2001年 | 520篇 |
2000年 | 519篇 |
1999年 | 557篇 |
1998年 | 511篇 |
1997年 | 381篇 |
1996年 | 439篇 |
1995年 | 467篇 |
1994年 | 417篇 |
1993年 | 330篇 |
1992年 | 277篇 |
1991年 | 128篇 |
1990年 | 114篇 |
1989年 | 107篇 |
1988年 | 96篇 |
1987年 | 83篇 |
1986年 | 70篇 |
1985年 | 146篇 |
1984年 | 122篇 |
1983年 | 76篇 |
1982年 | 134篇 |
1981年 | 116篇 |
1980年 | 75篇 |
1979年 | 85篇 |
1978年 | 78篇 |
1977年 | 66篇 |
1976年 | 66篇 |
1975年 | 36篇 |
1973年 | 29篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
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. 相似文献
102.
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. 相似文献
103.
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. 相似文献
104.
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. 相似文献
105.
本文用COSY,CHCOR等二维核磁共振技术对TRANILAST,2[]3-(3.4-二甲基苯基)1-氧代-2-丙烯基]氨基]苯甲到进行了~1H、~(13)C NMR谱数据分析及归属,并结合~(13)C弛豫时间T_1 及变温实验对合成产品进行了结构鉴定. 相似文献
106.
Consider the problem of three point vortices (also called Helmholtz’ vortices) on a plane, with arbitrarily given vorticities.
The interaction between vortices is proportional to 1/r, where r is the distance between two vortices. The problem has 2 equilateral and at most 3 collinear normalized relative equilibria.
This 3 is the optimal upper bound. Our main result is that the above standard statements remain unchanged if we consider an
interaction proportional to r
b, for any b < 0. For 0 < b < 1, the optimal upper bound becomes 5. For positive vorticities and any b < 1, there are exactly 3 collinear normalized relative equilibria. The case b = −2 of this last statement is the well-known theorem due to Euler: in the Newtonian 3-body problem, for any choice of the
3 masses, there are 3 Euler configurations (also known as the 3 Euler points). These small upper bounds strengthen the belief
of Kushnirenko and Khovanskii [18]: real varieties defined by simple systems should have a simple topology. We indicate some
hard conjectures about the configurations of relative equilibrium and suggest they could be attacked within the quasi-polynomial
framework. 相似文献
107.
We consider Sinai’s random walk in random environment. We prove that infinitely often (i.o.) the size of the concentration neighborhood of this random walk is bounded almost surely. We also get that i.o. the maximal distance between two favorite sites is bounded almost surely. 相似文献
108.
Oliver Lorscheid 《Archiv der Mathematik》2007,88(4):344-348
This paper shows that for a local field K, a subfield k ⊂ K and a variety X over k, X is complete if and only if for every finite field extension Kʹ | K, the set X(Kʹ) is compact in its strong topology.
The author likes to thank Florian Pop, Jakob Stix, Stefan Wewers, Gunther Cornelissen and his own parents for their support.
Received: 13 April 2006 相似文献
109.
The large deviation theorems, exponential inequalities and a non-uniform estimate of the Berry–Esséen theorem in a discounted version are proved.Dedicated to Professor Vytautas Statulevičius on the occasion of his 75th birthday. 相似文献
110.
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. 相似文献