全文获取类型
收费全文 | 16734篇 |
免费 | 399篇 |
国内免费 | 231篇 |
专业分类
化学 | 1254篇 |
晶体学 | 75篇 |
力学 | 175篇 |
综合类 | 36篇 |
数学 | 14453篇 |
物理学 | 1371篇 |
出版年
2023年 | 42篇 |
2022年 | 96篇 |
2021年 | 88篇 |
2020年 | 85篇 |
2019年 | 365篇 |
2018年 | 412篇 |
2017年 | 218篇 |
2016年 | 188篇 |
2015年 | 187篇 |
2014年 | 434篇 |
2013年 | 1143篇 |
2012年 | 454篇 |
2011年 | 1024篇 |
2010年 | 849篇 |
2009年 | 1040篇 |
2008年 | 1215篇 |
2007年 | 1246篇 |
2006年 | 885篇 |
2005年 | 660篇 |
2004年 | 540篇 |
2003年 | 437篇 |
2002年 | 369篇 |
2001年 | 283篇 |
2000年 | 292篇 |
1999年 | 408篇 |
1998年 | 357篇 |
1997年 | 275篇 |
1996年 | 381篇 |
1995年 | 356篇 |
1994年 | 356篇 |
1993年 | 294篇 |
1992年 | 289篇 |
1991年 | 214篇 |
1990年 | 176篇 |
1989年 | 174篇 |
1988年 | 112篇 |
1987年 | 134篇 |
1986年 | 109篇 |
1985年 | 180篇 |
1984年 | 169篇 |
1983年 | 91篇 |
1982年 | 153篇 |
1981年 | 150篇 |
1980年 | 92篇 |
1979年 | 68篇 |
1978年 | 96篇 |
1977年 | 69篇 |
1976年 | 49篇 |
1975年 | 19篇 |
1973年 | 15篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
81.
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. 相似文献
82.
83.
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. 相似文献
84.
Suppression of Chaos and Phase Locking in Two Coupled Nonidentical Neurons under Periodic Input
下载免费PDF全文
![点击此处可从《中国物理快报》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Dynamical behaviour of two coupled neurons with at least one of them being chaotic is presented. Bifurcation diagrams and Lyapunov exponents are calculated to diagnose the dynamical behaviour of the coupled neurons with the increasing coupling strength. It is found that when the coupling strength increases, a chaotic neuron can be controlled by the coupling between neurons. At the same time, phase locking is studied by the maxima of the differences of instantaneous phases and average frequencies between two coupled neurons, and the inherent connection of phase locking and the suppression of chaos is formulated. It is observed that the onset of phase locking is closely related to the suppression of chaos. Finally, a way for suppression of chaos in two coupled nonidentical neurons under periodic input is suggested. 相似文献
85.
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. 相似文献
86.
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. 相似文献
87.
In the classical channel assignment problem, transmitters that are sufficiently close together are assigned transmission frequencies that differ by prescribed amounts, with the goal of minimizing the span of frequencies required. This problem can be modeled through the use of an L(2,1)-labeling, which is a function f from the vertex set of a graph G to the non-negative integers such that |f(x)-f(y)|? 2 if xand y are adjacent vertices and |f(x)-f(y)|?1 if xand y are at distance two. The goal is to determine the λ-number of G, which is defined as the minimum span over all L(2,1)-labelings of G, or equivalently, the smallest number k such that G has an L(2,1)-labeling using integers from {0,1,…,k}. Recent work has focused on determining the λ-number of generalized Petersen graphs (GPGs) of order n. This paper provides exact values for the λ-numbers of GPGs of orders 5, 7, and 8, closing all remaining open cases for orders at most 8. It is also shown that there are no GPGs of order 4, 5, 8, or 11 with λ-number exactly equal to the known lower bound of 5, however, a construction is provided to obtain examples of GPGs with λ-number 5 for all other orders. This paper also provides an upper bound for the number of distinct isomorphism classes for GPGs of any given order. Finally, the exact values for the λ-number of n-stars, a subclass of the GPGs inspired by the classical Petersen graph, are also determined. These generalized stars have a useful representation on Möebius strips, which is fundamental in verifying our results. 相似文献
88.
89.
On the third largest Laplacian eigenvalue of a graph 总被引:1,自引:0,他引:1
Ji-Ming Guo 《Linear and Multilinear Algebra》2007,55(1):93-102
In this article, a sharp lower bound for the third largest Laplacian eigenvalue of a graph is given in terms of the third largest degree of the graph. 相似文献
90.
Biao Zhang 《Journal of multivariate analysis》2006,97(1):211-230
In logistic case-control studies, Prentice and Pyke (Biometrika 66 (1979) 403-411) showed that valid point estimators of the odds-ratio parameters and their standard errors may be obtained by fitting the prospective logistic regression model to case-control data. Wang and Carroll (Biometrika 80 (1993) 237-241; J. Statist. Plann. Inference 43 (1995) 331-340) generalized Prentice and Pyke's (Biometrika 66 (1979) 403-411) results to robust logistic case-control studies. In this paper, we extend the results of Prentice and Pyke (Biometrika 66 (1979) 403-411) and Wang and Carroll (Biometrika 80 (1993) 237-241; J. Statist. Plann. Inference 43 (1995) 331-340) to a class of statistics and a class of unbiased estimating equations. We present some results on simulation and on the analysis of two real datasets. 相似文献