全文获取类型
收费全文 | 17871篇 |
免费 | 384篇 |
国内免费 | 236篇 |
专业分类
化学 | 1528篇 |
晶体学 | 69篇 |
力学 | 163篇 |
综合类 | 32篇 |
数学 | 15443篇 |
物理学 | 1256篇 |
出版年
2023年 | 34篇 |
2022年 | 100篇 |
2021年 | 65篇 |
2020年 | 84篇 |
2019年 | 403篇 |
2018年 | 448篇 |
2017年 | 236篇 |
2016年 | 190篇 |
2015年 | 215篇 |
2014年 | 471篇 |
2013年 | 1005篇 |
2012年 | 626篇 |
2011年 | 1165篇 |
2010年 | 900篇 |
2009年 | 1190篇 |
2008年 | 1288篇 |
2007年 | 1331篇 |
2006年 | 1010篇 |
2005年 | 754篇 |
2004年 | 566篇 |
2003年 | 521篇 |
2002年 | 397篇 |
2001年 | 370篇 |
2000年 | 400篇 |
1999年 | 444篇 |
1998年 | 377篇 |
1997年 | 311篇 |
1996年 | 391篇 |
1995年 | 373篇 |
1994年 | 386篇 |
1993年 | 317篇 |
1992年 | 265篇 |
1991年 | 168篇 |
1990年 | 193篇 |
1989年 | 171篇 |
1988年 | 118篇 |
1987年 | 120篇 |
1986年 | 91篇 |
1985年 | 160篇 |
1984年 | 123篇 |
1983年 | 76篇 |
1982年 | 128篇 |
1981年 | 107篇 |
1980年 | 83篇 |
1979年 | 60篇 |
1978年 | 75篇 |
1977年 | 65篇 |
1976年 | 57篇 |
1975年 | 22篇 |
1974年 | 14篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
We study the multiplicity of critical points for functionals which are only differentiable along some directions. We extend to this class of functionals the three critical point theorem of Pucci and Serrin and we apply it to a one-parameter family of functionals Jλ, λ∈I⊂R. Under suitable assumptions, we locate an open subinterval of values λ in I for which Jλ possesses at least three critical points. Applications to quasilinear boundary value problems are also given. 相似文献
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.
Historians have always seen jabr (restoration) and muqābala (confrontation) as technical terms for specific operations in Arabic algebra. This assumption clashes with the fact that the words were used in a variety of contexts. By examining the different uses of jabr, muqābala, ikmāl (completion), and radd (returning) in the worked-out problems of several medieval mathematics texts, we show that they are really nontechnical words used to name the immediate goals of particular steps. We also find that the phrase al-jabr wa'l-muqābala was first used within the solutions of problems to mean al-jabr and/or al-muqābala, and from there it became the name of the art of algebra. 相似文献
94.
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. 相似文献
95.
Application of Electron-Shelving Detection via 423 nm Transition in Calcium-Beam Optical Frequency Standard
下载免费PDF全文
![点击此处可从《中国物理快报》网站下载免费的PDF全文](/ch/ext_images/free.gif)
A new scheme of small compact optical frequency standard based on thermal calcium beam with application of 423 nm shelving detection and sharp-angle velocity selection detection is proposed. Combining these presented techniques, we conclude that a small compact optical frequency standard based on thermal calcium beam will outperform the commercial caesium-beam microwave dock, like the 5071 Cs clock (from Hp to Agilent, now Symmetricom company), both in accuracy and stability. 相似文献
96.
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. 相似文献
97.
Changbing Hu 《Journal of Differential Equations》2007,236(1):133-163
In this article we study the 3D Navier-Stokes equations with Navier friction boundary condition in thin domains. We prove the global existence of strong solutions to the 3D Navier-Stokes equations when the initial data and external forces are in large sets as the thickness of the domain is small. We generalize the techniques developed to study the 3D Navier-Stokes equations in thin domains, see [G. Raugel, G. Sell, Navier-Stokes equations on thin 3D domains I: Global attractors and global regularity of solutions, J. Amer. Math. Soc. 6 (1993) 503-568; G. Raugel, G. Sell, Navier-Stokes equations on thin 3D domains II: Global regularity of spatially periodic conditions, in: Nonlinear Partial Differential Equations and Their Application, College de France Seminar, vol. XI, Longman, Harlow, 1994, pp. 205-247; R. Temam, M. Ziane, Navier-Stokes equations in three-dimensional thin domains with various boundary conditions, Adv. Differential Equations 1 (1996) 499-546; R. Temam, M. Ziane, Navier-Stokes equations in thin spherical shells, in: Optimization Methods in Partial Differential Equations, in: Contemp. Math., vol. 209, Amer. Math. Soc., Providence, RI, 1996, pp. 281-314], to the Navier friction boundary condition by introducing a new average operator Mε in the thin direction according to the spectral decomposition of the Stokes operator Aε. Our analysis hinges on the refined investigation of the eigenvalue problem corresponding to the Stokes operator Aε with Navier friction boundary condition. 相似文献
98.
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 相似文献
99.
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. 相似文献
100.
Eliza P. de Jager 《Topology and its Applications》2007,154(10):2117-2126
We show that the infimum of any family of proximally symmetric quasi-uniformities is proximally symmetric, while the supremum of two proximally symmetric quasi-uniformities need not be proximally symmetric. On the other hand, the supremum of any family of transitive quasi-uniformities is transitive, while there are transitive quasi-uniformities whose infimum with their conjugate quasi-uniformity is not transitive. Moreover we present two examples that show that neither the supremum topology nor the infimum topology of two transitive topologies need be transitive. Finally, we prove that several operations one can perform on and between quasi-uniformities preserve the property of having a complement. 相似文献