全文获取类型
收费全文 | 14163篇 |
免费 | 435篇 |
国内免费 | 732篇 |
专业分类
化学 | 4274篇 |
晶体学 | 88篇 |
力学 | 92篇 |
综合类 | 61篇 |
数学 | 9718篇 |
物理学 | 1097篇 |
出版年
2023年 | 60篇 |
2022年 | 117篇 |
2021年 | 105篇 |
2020年 | 137篇 |
2019年 | 327篇 |
2018年 | 359篇 |
2017年 | 261篇 |
2016年 | 209篇 |
2015年 | 222篇 |
2014年 | 395篇 |
2013年 | 1029篇 |
2012年 | 497篇 |
2011年 | 786篇 |
2010年 | 710篇 |
2009年 | 1016篇 |
2008年 | 989篇 |
2007年 | 1010篇 |
2006年 | 794篇 |
2005年 | 571篇 |
2004年 | 504篇 |
2003年 | 417篇 |
2002年 | 334篇 |
2001年 | 289篇 |
2000年 | 284篇 |
1999年 | 330篇 |
1998年 | 321篇 |
1997年 | 247篇 |
1996年 | 306篇 |
1995年 | 303篇 |
1994年 | 293篇 |
1993年 | 221篇 |
1992年 | 209篇 |
1991年 | 143篇 |
1990年 | 159篇 |
1989年 | 159篇 |
1988年 | 110篇 |
1987年 | 106篇 |
1986年 | 121篇 |
1985年 | 150篇 |
1984年 | 114篇 |
1983年 | 59篇 |
1982年 | 107篇 |
1981年 | 72篇 |
1980年 | 82篇 |
1979年 | 60篇 |
1978年 | 66篇 |
1977年 | 43篇 |
1976年 | 37篇 |
1975年 | 28篇 |
1973年 | 23篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
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. 相似文献
102.
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. 相似文献
103.
N. A. Gasviani M. Sh. Khutsishvili L. M. Abazadze 《Russian Journal of Electrochemistry》2006,42(9):931-937
Electrochemical reduction of sodium metavanadate in an equimolar KCl-NaCl melt and the effect of acid-base properties of environment on this process are studied by a voltammetry method on a stationary platinum electrode. It is established that the limiting current of the NaVO3 electroreduction process has a kinetic nature. The process proceeds via an autoinhibition scheme and its rate is limited by an acid-base reaction conjugated with an irreversible charge transfer reaction. A substantial role of cationic composition of the melt is revealed experimentally. Following acidification of the KCl-NaCl-NaVO3 melt by Mg2+ (from MgCl2), the process passes from an irreversible kinetic regime into a reversible diffusion (quasi-diffusion) process. Values of stability constants for vanadates produced with the aid of acid-base titration of vanadium pentoxide by oxygen ions in experimental conditions are presented. These values are taken into account when calculating kinetic parameters of the NaVO3 electroreduction. 相似文献
104.
海藻酸钠/大豆蛋白共混凝胶微球的结构 总被引:4,自引:1,他引:3
利用钙离子交联海藻酸钠/大豆分离蛋白共混溶液,制得海藻酸钠/大豆分离蛋共混凝胶微球.结果表明,海藻酸钠和大豆分离蛋白质量配比的不同以及各组分间相互作用的变化,微球呈现不同的微观结构.将微球干燥后置于水中溶胀,微球的尺寸无法回复到干燥前的尺寸,这是由于真空干燥处理使水分子挥发,促进微球内组分间形成了强的氢键作用所致.此外,用碱处理该共混微球,发现由于大豆分离蛋白溶解以及部分钙离子被置换析出,微球塌陷且内部形成了大孔. 相似文献
105.
文章合成了N,N'-二正丁基苝四羧酸二酰亚胺,并纯化、调晶,进行了IR、元素分析、X射线等测定.分析该化合物在DMF中的紫外光谱(最大吸收波长524.80 nm)、荧光光谱(最大发射波长539.0 nm)、Stokes位移(数值15 nm)等光谱性质.在400~700 nm范围内,α晶型薄膜紫外-可见吸收出现很强的吸收峰,且由β型变为α型,最大吸收波长有明显的红移(545 nm变为580 nm).X射线粉末衍射也反映出α晶型的2θ在26.0°处衍射峰CPS为2 508,β型在25.2°为1 891.α,β晶型作为电荷产生材料制得的功能分离型有机光导体,在光源滤波波长λ=532 nm曝光下,测得含α,β感光体达到饱和电位的时间分别为46,93.98 s,光衰电位(5.3千伏电压负充电电晕,1~2 s后的表面电位)分别为727和525 V,半衰曝光量分别为4.32,4.34μJ·cm-2,残余电位分别为30和45 V等光导性能数值. 相似文献
106.
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 相似文献
107.
In 1979, Papadimitriou and Yannakakis gave a polynomial time algorithm for the scheduling of jobs requiring unit completion times when the precedence constraints form an interval order. The authors solve here the corresponding problem, for preemptive scheduling (a job can be interrupted to work on more important tasks, and completed at a later time, subject to the usual scheduling constraints.) The m-machine preemptive scheduling problem is shown to have a polynomial algorithm, for both unit time and variable execution times as well, when the precedence constraints are given by an interval order. 相似文献
108.
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 相似文献
109.
Summary The optimality question for blockp-cyclic SOR iterations discussed in Young and Varga is answered under natural conditions on the spectrum of the block Jacobi matrix. In particular, it is shown that repartitioning a blockp-cyclic matrix into a blockq-cyclic form,q
, results in asymptotically faster SOR convergence for the same amount of work per iteration. As a consequence block 2-cyclic SOR is optimal under these conditions.Research supported in part by the US Air Force under Grant no. AFOSR-88-0285 and the National Science Foundation under grant no. DMS-85-21154 Present address: Boeing Computer Services, P.O. Box 24346, MS 7L-21, Seattle, WA 98124-0346, USA 相似文献
110.
Piotr Niemiec 《Topology and its Applications》2006,153(18):3373-3382
Equicontinuous semigroups of transformations of a compact Hausdorff space and their sets of all invariant (Borel, regular and probabilistic) measures are studied. Conditions equivalent to the existence of at least one invariant measure are given. The (algebraic and topological) structure of the set of invariant measures is researched. 相似文献