全文获取类型
收费全文 | 4837篇 |
免费 | 459篇 |
国内免费 | 567篇 |
专业分类
化学 | 301篇 |
晶体学 | 16篇 |
力学 | 216篇 |
综合类 | 101篇 |
数学 | 3647篇 |
物理学 | 1582篇 |
出版年
2024年 | 5篇 |
2023年 | 73篇 |
2022年 | 97篇 |
2021年 | 99篇 |
2020年 | 142篇 |
2019年 | 128篇 |
2018年 | 161篇 |
2017年 | 142篇 |
2016年 | 157篇 |
2015年 | 86篇 |
2014年 | 192篇 |
2013年 | 415篇 |
2012年 | 187篇 |
2011年 | 295篇 |
2010年 | 276篇 |
2009年 | 287篇 |
2008年 | 296篇 |
2007年 | 324篇 |
2006年 | 329篇 |
2005年 | 260篇 |
2004年 | 224篇 |
2003年 | 223篇 |
2002年 | 238篇 |
2001年 | 176篇 |
2000年 | 178篇 |
1999年 | 160篇 |
1998年 | 121篇 |
1997年 | 102篇 |
1996年 | 83篇 |
1995年 | 75篇 |
1994年 | 70篇 |
1993年 | 40篇 |
1992年 | 28篇 |
1991年 | 21篇 |
1990年 | 20篇 |
1989年 | 13篇 |
1988年 | 13篇 |
1987年 | 18篇 |
1986年 | 22篇 |
1985年 | 20篇 |
1984年 | 11篇 |
1983年 | 10篇 |
1982年 | 13篇 |
1981年 | 9篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1978年 | 5篇 |
1976年 | 4篇 |
1975年 | 2篇 |
1957年 | 3篇 |
排序方式: 共有5863条查询结果,搜索用时 93 毫秒
71.
Ioan Tomescu 《Journal of Graph Theory》2003,43(3):210-222
In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if ci(G) ≤ ci(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where ci(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003 相似文献
72.
Summary By employing a novel idea and simple techniques, we substantially generalize the Turán type inequality for rational functions
with real zeros and prescribed poles established by Min [5] to include Lpspaces for 1≤p≤∞<span style='font-size:10.0pt'>while loosing the restriction ρ > 2 at the same time. 相似文献
73.
W. Götze 《Journal of statistical physics》1996,83(5-6):1183-1197
74.
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS (PART I:EQUAL TIMES AND COSTS) 总被引:1,自引:0,他引:1
Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O(n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented. 相似文献
75.
We estimate the concentration functions of n-fold convolutions of one-dimensional probability measures. The Kolmogorov–Rogozin inequality implies that for nondegenerate distributions these functions decrease at least as O(n
–1/2). On the other hand, Esseen(3) has shown that this rate is o(n
–1/2) iff the distribution has an infinite second moment. This statement was sharpened by Morozova.(9) Theorem 1 of this paper provides an improvement of Morozova's result. Moreover, we present more general estimates which imply the rates o(n
–1/2). 相似文献
76.
卢琳璋 《高等学校计算数学学报(英文版)》1994,(1)
The unit circle problem is the problem of finding the number of eigenvalues of a non-Hermitian matrix inside and outside the unit circle . To reduce the cost of computing eigenvalues for the problem, a direct method, which is analogous to that given in [5], is proposed in this paper. 相似文献
77.
Numerous versions of the Lanczos τ-methods have been extensively used to produce polynomial approximations for functions verifying
a linear differential equation with polynomial coefficients. In the case of an initial-value problem, an adapted τ-method
based on Chebyshev series and the use of symbolic computation lead to a rational approximation of the solution on a region
of the complex plane. Numerical examples show that the simplicity of the method does not prevent a high accuracy of results.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
78.
用ESR方法研究了红薯淀粉在γ射线预辐照下,产生的淀粉自由基特性及其室温下的自由基衰减动力学反应。结果表明在室温条件下,淀粉自由基的相对浓度随辐射剂量的增大而增加。自由基相对浓度的室温衰减用二级反应动力学处理,求得了衰减速率常数和淀粉自由基反应的半衰期。 相似文献
79.
Nicholas J. Curro Charles P. Slichter 《Journal of magnetic resonance (San Diego, Calif. : 1997)》1998,130(2):186-194
Measurement ofT2G, the Gaussian component of the spin-echo envelope of planar Cu nuclei in high-temperature superconductors, gives important information about the real part of the Cu electron spin susceptibility. In the traditional picture of the planar Cu echo decay, the internuclear coupling is assumed to remain static with respect to spin–lattice relaxation and mutual exchange fluctuations. In some circumstances, however, this assumption breaks down. We calculate the internuclear corrections arising from spin–lattice relaxation to the conventional theory ofT2Gand show thatT2Gcan be easily corrected for these effects. We argue that mutual exchanges due to the perpendicular indirect couplings are suppressed in these materials. For YBa2Cu4O8, we find a correction on the order of 10% inT2Gand using the corrected values we find that the isotope ratio63T2G/65T2Gagrees with theory. 相似文献
80.
研究了谐和激励下含有界随机参数Duffing系统(简称随机Duffing系统)中的随机混沌及其延迟反馈控制问题.借助Gegenbauer多项式逼近理论,将随机Duffing系统转化为与其等效的确定性非线性系统.这样,随机Duffing系统在谐和激励下的混沌响应及其控制问题就可借等效的确定性非线性系统来研究.分析阐明了随机混沌的主要特点,并采用Wolf算法计算等效确定性非线性系统的最大Lyapunov指数,以判别随机Duffing系统的动力学行为.数值计算表明,恰当选取不同的反馈强度和延迟时间,可分别达到抑制或诱发系统混沌的目的,说明延迟反馈技术对随机混沌控制也是十分有效的.
关键词:
随机Duffing系统
延迟反馈控制
随机混沌
Gegenbauer多项式 相似文献