全文获取类型
收费全文 | 26296篇 |
免费 | 979篇 |
国内免费 | 1319篇 |
专业分类
化学 | 9816篇 |
晶体学 | 207篇 |
力学 | 417篇 |
综合类 | 68篇 |
数学 | 13953篇 |
物理学 | 4133篇 |
出版年
2024年 | 36篇 |
2023年 | 375篇 |
2022年 | 307篇 |
2021年 | 318篇 |
2020年 | 458篇 |
2019年 | 654篇 |
2018年 | 578篇 |
2017年 | 444篇 |
2016年 | 494篇 |
2015年 | 593篇 |
2014年 | 878篇 |
2013年 | 1524篇 |
2012年 | 1014篇 |
2011年 | 1810篇 |
2010年 | 1425篇 |
2009年 | 1837篇 |
2008年 | 2051篇 |
2007年 | 1860篇 |
2006年 | 1452篇 |
2005年 | 1076篇 |
2004年 | 992篇 |
2003年 | 870篇 |
2002年 | 1134篇 |
2001年 | 595篇 |
2000年 | 559篇 |
1999年 | 602篇 |
1998年 | 472篇 |
1997年 | 385篇 |
1996年 | 494篇 |
1995年 | 483篇 |
1994年 | 402篇 |
1993年 | 329篇 |
1992年 | 276篇 |
1991年 | 209篇 |
1990年 | 168篇 |
1989年 | 181篇 |
1988年 | 120篇 |
1987年 | 136篇 |
1986年 | 112篇 |
1985年 | 146篇 |
1984年 | 113篇 |
1983年 | 69篇 |
1982年 | 110篇 |
1981年 | 106篇 |
1980年 | 58篇 |
1979年 | 55篇 |
1978年 | 49篇 |
1977年 | 56篇 |
1976年 | 44篇 |
1971年 | 22篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
David L. Applegate 《Operations Research Letters》2007,35(6):693-699
The use of floating-point calculations limits the accuracy of solutions obtained by standard LP software. We present a simplex-based algorithm that returns exact rational solutions, taking advantage of the speed of floating-point calculations and attempting to minimize the operations performed in rational arithmetic. Extensive computational results are presented. 相似文献
102.
Stephen J. Gardiner 《Advances in Mathematics》2007,214(1):417-436
This paper answers a question of Fuglede about minimal positive harmonic functions associated with irregular boundary points. As a consequence, an old and central problem of fine potential theory, concerning the Riesz decomposition, is resolved. Namely, it is shown that, on certain fine domains, there exist positive finely superharmonic functions which do not admit any positive finely harmonic minorant and yet are not fine potentials. 相似文献
103.
104.
105.
Mike Develin 《Discrete Applied Mathematics》2007,155(17):2257-2268
We consider a deterministic discrete-time model of fire spread introduced by Hartnell [Firefighter! an application of domination, Presentation, in: 20th Conference on Numerical Mathematics and Computing, University of Manitoba in Winnipeg, Canada, September 1995] and the problem of minimizing the number of burnt vertices when a fixed number of vertices can be defended by firefighters per time step. While only two firefighters per time step are needed in the two-dimensional lattice to contain any outbreak, we prove a conjecture of Wang and Moeller [Fire control on graphs, J. Combin. Math. Combin. Comput. 41 (2002) 19-34] that 2d-1 firefighters per time step are needed to contain a fire outbreak starting at a single vertex in the d-dimensional square lattice for d?3; we also prove that in the d-dimensional lattice, d?3, for each positive integer f there is some outbreak of fire such that f firefighters per time step are insufficient to contain the outbreak. We prove another conjecture of Wang and Moeller that the proportion of elements in the three-dimensional grid Pn×Pn×Pn which can be saved with one firefighter per time step when an outbreak starts at one vertex goes to 0 as n gets large. Finally, we use integer programming to prove results about the minimum number of time steps needed and minimum number of burnt vertices when containing a fire outbreak in the two-dimensional square lattice with two firefighters per time step. 相似文献
106.
Let H be a separable infinite dimensional Hilbert space endowed with a symplectic structure and let L0⊂H be a Lagrangian subspace. Using the results of [A. Abbondandolo, P. Majer, Infinite dimensional Grassmannians, math.AT/0307192], we show that the Fredholm Lagrangian-Grassmannian FL0(Λ) has the homotopy type of Gc(L0), the Grassmannian of all Lagrangian subspaces of H that are compact perturbations of L0. It is well known that the latter has the homotopy type of the quotient U(∞)/O(∞). As a corollary, we recover a result by B. Booss-Bavnbek and K. Furutani (see [B. Booss-Bavnbek, K. Furutani, Symplectic functional analysis and spectral invariants, Contemp. Math. 242 (1999) 53-83; K. Furutani, Fredholm-Lagrangian-Grassmannian and the Maslov index, J. Geom. Phys. 51 (2004) 269-331]) that the L0-Maslov index is an isomorphism between the fundamental group of FL0(Λ) and the integers. 相似文献
107.
This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R0-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically. 相似文献
108.
This paper is concerned with information revelation in single-item auctions. We compute how much data needs to be transmitted in three strategically equivalent auctions—the Vickrey auction, the English auction and the recently proposed bisection auction—and show that in the truth-telling equilibrium the bisection auction is the best performer. 相似文献
109.
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. 相似文献
110.
C. Praagman 《Aequationes Mathematicae》1987,33(1):251-259
In this paper it is proved that having a logarithm is equivalent to having roots of arbitrary order in the group of automorphisms of a formal power series ring, and in algebraic subgroups too 相似文献