全文获取类型
收费全文 | 16467篇 |
免费 | 480篇 |
国内免费 | 269篇 |
专业分类
化学 | 1890篇 |
晶体学 | 57篇 |
力学 | 202篇 |
综合类 | 113篇 |
数学 | 13962篇 |
物理学 | 992篇 |
出版年
2023年 | 25篇 |
2022年 | 71篇 |
2021年 | 131篇 |
2020年 | 119篇 |
2019年 | 452篇 |
2018年 | 534篇 |
2017年 | 287篇 |
2016年 | 235篇 |
2015年 | 262篇 |
2014年 | 509篇 |
2013年 | 983篇 |
2012年 | 588篇 |
2011年 | 973篇 |
2010年 | 896篇 |
2009年 | 1217篇 |
2008年 | 1279篇 |
2007年 | 1253篇 |
2006年 | 974篇 |
2005年 | 653篇 |
2004年 | 630篇 |
2003年 | 521篇 |
2002年 | 375篇 |
2001年 | 364篇 |
2000年 | 364篇 |
1999年 | 384篇 |
1998年 | 339篇 |
1997年 | 310篇 |
1996年 | 331篇 |
1995年 | 351篇 |
1994年 | 320篇 |
1993年 | 258篇 |
1992年 | 191篇 |
1991年 | 114篇 |
1990年 | 94篇 |
1989年 | 105篇 |
1988年 | 68篇 |
1987年 | 61篇 |
1986年 | 63篇 |
1985年 | 70篇 |
1984年 | 70篇 |
1983年 | 46篇 |
1982年 | 85篇 |
1981年 | 56篇 |
1980年 | 49篇 |
1979年 | 32篇 |
1978年 | 42篇 |
1977年 | 27篇 |
1976年 | 28篇 |
1975年 | 8篇 |
1974年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 484 毫秒
141.
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. 相似文献
142.
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. 相似文献
143.
In this paper we construct a positive doubly power bounded operator
with a nonpositive inverse on an AL-space. 相似文献
144.
Martin Skutella 《Mathematical Programming》2002,91(3):493-514
In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex
to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed
along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed
a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various
areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing.
Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results
of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques
do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation
results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally,
we provide results on the hardness of approximation for several variants of the problem.
Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001 相似文献
145.
We give general conditions on a generator of a C0-semigroup (resp. of a C0-resolvent) on Lp(E,μ), p ≥ 1, where E is an arbitrary (Lusin) topological space and μ a σ-finite measure on its Borel σ-algebra, so that it generates a sufficiently
regular Markov process on E. We present a general method how these conditions can be checked in many situations. Applications to solve stochastic differential
equations on Hilbert space in the sense of a martingale problem are given.
Dedicated to Giuseppe Da Prato on the occasion of his 70th birthday 相似文献
146.
??We study the linear quadratic optimal stochastic control problem which is jointly driven by Brownian motion and L\'{e}vy processes. We prove that the new affine stochastic differential adjoint equation exists an inverse process by applying the profound section theorem. Applying for the Bellman's principle of quasilinearization and a monotone iterative convergence method, we prove the existence and uniqueness of the solution of the backward Riccati differential equation. Finally, we prove that the optimal feedback control exists, and the value function is composed of the initial value of the solution of the related backward Riccati differential equation and the related adjoint equation. 相似文献
147.
Shigeru Yamagami 《Journal of Pure and Applied Algebra》2002,167(1):83-128
A duality for orbifolds is presented as an application of group extensions in tensor categories. 相似文献
148.
Hoon Kim Toshihiko Koseki Tomohiro Ohta Hiroshi Sato Yukihiro Shimogaki 《Applied Surface Science》2006,252(11):3938-3942
The adhesion of Cu on Ru substrates with different crystal orientations was evaluated. The crystal orientation of sputter deposited Ru could be changed from (1 0 0) to (0 0 1) by annealing at 650 °C for 20 min. The adhesion of Cu was evaluated by the degree of Cu agglomeration on Ru. Cu films on annealed Ru films with the (0 0 1) crystal orientation showed 28% lower RMS values and 50% lower Ru surface coverage than Cu as-deposited on Ru having the (1 0 0) crystal orientation after annealing at 550 °C for 30 min, which suggest that Cu wettability on the Ru(0 0 1) was better than that on the Ru(1 0 0) plane. The low lattice misfit of 4% between Cu(1 1 1) and Ru(0 0 1) may be the reason for this good adhesion property. 相似文献
149.
In this paper, we establish some new nonlinear integral inequalities of the Gronwall–Bellman–Ou-Iang-type in two variables. These on the one hand generalizes and on the other hand furnish a handy tool for the study of qualitative as well as quantitative properties of solutions of differential equations. We illustrate this by applying our new results to certain boundary value problem. 相似文献
150.
Weak vector equilibrium problems with bi-variable mappings from product space of two bounded complete locally convex Hausdorff topological vector spaces to another topological vector space are studied. The existence theorems of solutions are proved by the FKKM fixed point theorem. Viscosity principle of vector equilibrium problems is dealt with. The relations between solutions of the vector equilibrium problem and those of its perturbation problem are presented. 相似文献