全文获取类型
收费全文 | 11518篇 |
免费 | 255篇 |
国内免费 | 273篇 |
专业分类
化学 | 1421篇 |
晶体学 | 31篇 |
力学 | 77篇 |
综合类 | 17篇 |
数学 | 9713篇 |
物理学 | 787篇 |
出版年
2023年 | 18篇 |
2022年 | 38篇 |
2021年 | 26篇 |
2020年 | 42篇 |
2019年 | 247篇 |
2018年 | 281篇 |
2017年 | 150篇 |
2016年 | 99篇 |
2015年 | 120篇 |
2014年 | 290篇 |
2013年 | 713篇 |
2012年 | 350篇 |
2011年 | 671篇 |
2010年 | 605篇 |
2009年 | 901篇 |
2008年 | 870篇 |
2007年 | 872篇 |
2006年 | 661篇 |
2005年 | 428篇 |
2004年 | 382篇 |
2003年 | 299篇 |
2002年 | 235篇 |
2001年 | 217篇 |
2000年 | 231篇 |
1999年 | 255篇 |
1998年 | 255篇 |
1997年 | 177篇 |
1996年 | 244篇 |
1995年 | 251篇 |
1994年 | 251篇 |
1993年 | 193篇 |
1992年 | 171篇 |
1991年 | 125篇 |
1990年 | 142篇 |
1989年 | 142篇 |
1988年 | 91篇 |
1987年 | 95篇 |
1986年 | 105篇 |
1985年 | 139篇 |
1984年 | 110篇 |
1983年 | 57篇 |
1982年 | 94篇 |
1981年 | 67篇 |
1980年 | 78篇 |
1979年 | 58篇 |
1978年 | 60篇 |
1977年 | 39篇 |
1976年 | 33篇 |
1975年 | 24篇 |
1973年 | 17篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
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. 相似文献
92.
文章合成了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等光导性能数值. 相似文献
93.
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 相似文献
94.
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. 相似文献
95.
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 相似文献
96.
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 相似文献
97.
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. 相似文献
98.
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. 相似文献
99.
Diem Ho 《Numerische Mathematik》1989,56(7):721-734
Summary The acceleration by Tchebychev iteration for solving nonsymmetric eigenvalue problems is dicussed. A simple algorithm is derived to obtain the optimal ellipse which passes through two eigenvalues in a complex plane relative to a reference complex eigenvalue. New criteria are established to identify the optimal ellipse of the eigenspectrum. The algorithm is fast, reliable and does not require a search for all possible ellipses which enclose the spectrum. The procedure is applicable to nonsymmetric linear systems as well. 相似文献
100.
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. 相似文献