首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   14190篇
  免费   384篇
  国内免费   254篇
化学   1160篇
晶体学   76篇
力学   203篇
综合类   32篇
数学   12091篇
物理学   1266篇
  2023年   24篇
  2022年   62篇
  2021年   59篇
  2020年   69篇
  2019年   437篇
  2018年   525篇
  2017年   232篇
  2016年   174篇
  2015年   195篇
  2014年   437篇
  2013年   805篇
  2012年   483篇
  2011年   836篇
  2010年   745篇
  2009年   1027篇
  2008年   1125篇
  2007年   1081篇
  2006年   878篇
  2005年   565篇
  2004年   514篇
  2003年   441篇
  2002年   348篇
  2001年   298篇
  2000年   276篇
  1999年   319篇
  1998年   299篇
  1997年   228篇
  1996年   321篇
  1995年   320篇
  1994年   304篇
  1993年   233篇
  1992年   172篇
  1991年   123篇
  1990年   77篇
  1989年   102篇
  1988年   62篇
  1987年   52篇
  1986年   54篇
  1985年   78篇
  1984年   69篇
  1983年   46篇
  1982年   73篇
  1981年   55篇
  1980年   41篇
  1979年   26篇
  1978年   34篇
  1977年   33篇
  1976年   27篇
  1974年   12篇
  1973年   15篇
排序方式: 共有10000条查询结果,搜索用时 687 毫秒
71.
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λ, λIR. 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.  相似文献   
72.
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 kN. 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.  相似文献   
73.
A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum, the magic sum. Examples are magic squares (the sets are the rows, columns, and diagonals) and semimagic squares (the same, but without the diagonals). A magilatin labelling is like a magic labelling but the values need be distinct only within each set. We show that the number of n × n magic or magilatin labellings is a quasipolynomial function of the magic sum, and also of an upper bound on the entries in the square. Our results differ from previous ones because we require that the entries in the square all be different from each other, and because we derive our results not by ad hoc reasoning but from a general theory of counting lattice points in rational inside-out polytopes. We also generalize from set systems to rational linear forms. Dedicated to the memory of Claudia Zaslavsky, 1917–2006 Received August 10, 2005  相似文献   
74.
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.  相似文献   
75.
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.  相似文献   
76.
In a structural measurement error model the structural quasi-score (SQS) estimator is based on the distribution of the latent regressor variable. If this distribution is misspecified, the SQS estimator is (asymptotically) biased. Two types of misspecification are considered. Both assume that the statistician erroneously adopts a normal distribution as his model for the regressor distribution. In the first type of misspecification, the true model consists of a mixture of normal distributions which cluster around a single normal distribution, in the second type, the true distribution is a normal distribution admixed with a second normal distribution of low weight. In both cases of misspecification, the bias, of course, tends to zero when the size of misspecification tends to zero. However, in the first case the bias goes to zero in a flat way so that small deviations from the true model lead to a negligible bias, whereas in the second case the bias is noticeable even for small deviations from the true model.  相似文献   
77.
Jurie Conradie 《Positivity》2006,10(3):591-606
The possibility of characterizing the Mackey topology of a dual pair of vector spaces as a generalized inductive limit (or mixed) topology is investigated. Positive answers are given for a wide range of dual pairs of Riesz spaces (vector lattices) and non-commutative Banach function spaces (or symmetric operator spaces).  相似文献   
78.
Let G be a finite group. For semi-free G-manifolds which are oriented in the sense of Waner [S. Waner, Equivariant RO(G)-graded bordism theories, Topology and its Applications 17 (1984) 1-26], the homotopy classes of G-equivariant maps into a G-sphere are described in terms of their degrees, and the degrees occurring are characterised in terms of congruences. This is first shown to be a stable problem, and then solved using methods of equivariant stable homotopy theory with respect to a semi-free G-universe.  相似文献   
79.
Starting from certain point sets in the projective plane, we construct a tropical (or subtraction-free birational) representation of Weyl groups over the field of τ-functions. In particular, our construction includes E 8 (1) , E 7 (1) , E 6 (1) and D 5 (1) as affine cases; each of them gives rise to the q-difference Painlevé equation.  相似文献   
80.
We study the inverse scattering problem for the nonlinear Schrödinger equation and for the nonlinear Klein–Gordon equation with the generalized Hartree type nonlinearity. We reconstruct the nonlinearity from knowledge of the scattering operator, which improves the known results.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号