全文获取类型
收费全文 | 17244篇 |
免费 | 449篇 |
国内免费 | 459篇 |
专业分类
化学 | 2735篇 |
晶体学 | 95篇 |
力学 | 114篇 |
综合类 | 43篇 |
数学 | 13781篇 |
物理学 | 1384篇 |
出版年
2023年 | 55篇 |
2022年 | 137篇 |
2021年 | 104篇 |
2020年 | 84篇 |
2019年 | 380篇 |
2018年 | 394篇 |
2017年 | 233篇 |
2016年 | 171篇 |
2015年 | 233篇 |
2014年 | 468篇 |
2013年 | 1016篇 |
2012年 | 590篇 |
2011年 | 1033篇 |
2010年 | 891篇 |
2009年 | 1269篇 |
2008年 | 1274篇 |
2007年 | 1241篇 |
2006年 | 970篇 |
2005年 | 625篇 |
2004年 | 555篇 |
2003年 | 461篇 |
2002年 | 363篇 |
2001年 | 339篇 |
2000年 | 337篇 |
1999年 | 419篇 |
1998年 | 363篇 |
1997年 | 276篇 |
1996年 | 316篇 |
1995年 | 351篇 |
1994年 | 345篇 |
1993年 | 290篇 |
1992年 | 247篇 |
1991年 | 176篇 |
1990年 | 241篇 |
1989年 | 257篇 |
1988年 | 159篇 |
1987年 | 167篇 |
1986年 | 187篇 |
1985年 | 217篇 |
1984年 | 171篇 |
1983年 | 83篇 |
1982年 | 113篇 |
1981年 | 90篇 |
1980年 | 106篇 |
1979年 | 76篇 |
1978年 | 78篇 |
1977年 | 58篇 |
1976年 | 51篇 |
1975年 | 27篇 |
1973年 | 25篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
151.
In this paper one specifies the ergodic behavior of the 2D-stochastic Navier–Stokes equation by giving a Large Deviation Principle for the occupation measure for large time. It describes the exact rate of exponential convergence. The considered random force is non-degenerate and compatible with the strong Feller property. 相似文献
152.
Karl Sigman 《Operations Research Letters》2007,35(5):581-583
In Mandelbaum and Yechiali [The conditional residual service time in the M/G/1 queue, http://www.math.tau.ac.il/∼uriy/publications (No. 30a), 1979] and in Fakinos [The expected remaining service time in a single-server queue, Oper. Res. 30 (1982) 1014-1018] a simple formula is derived for the (stationary) expected remaining service time in a M/G/1 queue, conditional on the number of customers in the system. We give a short new proof of the formula using Rate Conservation Law, and generalize to handle higher moments. 相似文献
153.
We continue the studies on the so–called genuine Bernstein–Durrmeyer operators U
n
by establishing a recurrence formula for the moments and by investigating the semigroup T(t) approximated by U
n
. Moreover, for sufficiently smooth functions the degree of this convergence is estimated. We also determine the eigenstructure
of U
n
, compute the moments of T(t) and establish asymptotic formulas.
Received: January 26, 2007. 相似文献
154.
155.
Masahiro Kubo 《Journal of Evolution Equations》2007,7(4):701-717
We study an abstract second order nonlinear evolution equation in a real Hilbert space. We consider time-dependent convex
functions and their subdifferentials operating on the first derivative of the unknown function. Introducing appropriate assumptions
on the convex functions and other data, we prove the existence and uniqueness of a strong solution, and give some applications
of the abstract theorem to hyperbolic variational inequalities with time-dependent constraints.
相似文献
156.
D.P. Baturov 《Topology and its Applications》2007,154(2):374-383
Let M be a separable metric space consisting of more than one point. We construct perfectly normal dense subspaces Z⊂Mc2 and (under additional set-theoretic assumption) Y⊂Mc which are not collectionwise Hausdorff. 相似文献
157.
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex eliminates exactly one of its neighbors. The parallel knock-out number of a graph is the minimum number of rounds after which all vertices have been eliminated (if possible). The parallel knock-out number is related to well-known concepts like perfect matchings, hamiltonian cycles, and 2-factors.We derive a number of combinatorial and algorithmic results on parallel knock-out numbers: for families of sparse graphs (like planar graphs or graphs of bounded tree-width), the parallel knock-out number grows at most logarithmically with the number n of vertices; this bound is basically tight for trees. Furthermore, there is a family of bipartite graphs for which the parallel knock-out number grows proportionally to the square root of n. We characterize trees with parallel knock-out number at most 2, and we show that the parallel knock-out number for trees can be computed in polynomial time via a dynamic programming approach (whereas in general graphs this problem is known to be NP-hard). Finally, we prove that the parallel knock-out number of a claw-free graph is either infinite or less than or equal to 2. 相似文献
158.
Hubert de Fraysseix 《Discrete Applied Mathematics》2007,155(9):1079-1095
Using a general resolution of barycentric systems we give a generalization of Tutte's theorem on convex drawing of planar graphs. We deduce a characterization of the edge coverings into pairwise non-crossing paths which are stretchable: such a system is stretchable if and only if each subsystem of at least two paths has at least three free vertices (vertices of the outer face of the induced subgraph which are internal to none of the paths of the subsystem). We also deduce that a contact system of pseudo-segments is stretchable if and only if it is extendible. 相似文献
159.
Jan J. Dijkstra 《Topology and its Applications》2006,153(15):2948-2951
In 1988 A. Gutek proved that there exist one-point connectifications of hereditarily disconnected spaces that do not have the fixed point property. We improve on this result by constructing a one-point connectification of a totally disconnected space without the fixed point property. 相似文献
160.
S. -S. Chow 《Numerische Mathematik》1989,54(4):373-393
Summary In this paper we shall consider the application of the finite element method to a class of second order elliptic boundary value problems of divergence form and with gradient nonlinearity in the principal coefficient, and the derivation of error estimates for the finite element approximations. Such problems arise in many practical situations — for example, in shock-free airfoil design, seepage through coarse grained porous media, and in some glaciological problems. By making use of certain properties of the nonlinear coefficients, we shall demonstrate that the variational formulations associated with these boundary value problems are well-posed. We shall also prove that the abstract operators accompanying such problems satisfy certain continuity and monotonicity inequalities. With the aid of these inequalities and some standard results from approximation theory, we show how one may derive error estimates for the finite element approximations in the energy norm. 相似文献