全文获取类型
收费全文 | 11807篇 |
免费 | 1105篇 |
国内免费 | 883篇 |
专业分类
化学 | 2260篇 |
晶体学 | 58篇 |
力学 | 952篇 |
综合类 | 384篇 |
数学 | 6353篇 |
物理学 | 3788篇 |
出版年
2023年 | 78篇 |
2022年 | 171篇 |
2021年 | 203篇 |
2020年 | 199篇 |
2019年 | 209篇 |
2018年 | 220篇 |
2017年 | 287篇 |
2016年 | 329篇 |
2015年 | 242篇 |
2014年 | 461篇 |
2013年 | 679篇 |
2012年 | 517篇 |
2011年 | 719篇 |
2010年 | 730篇 |
2009年 | 909篇 |
2008年 | 866篇 |
2007年 | 861篇 |
2006年 | 807篇 |
2005年 | 598篇 |
2004年 | 527篇 |
2003年 | 518篇 |
2002年 | 460篇 |
2001年 | 408篇 |
2000年 | 339篇 |
1999年 | 339篇 |
1998年 | 288篇 |
1997年 | 241篇 |
1996年 | 217篇 |
1995年 | 168篇 |
1994年 | 140篇 |
1993年 | 121篇 |
1992年 | 128篇 |
1991年 | 83篇 |
1990年 | 78篇 |
1989年 | 75篇 |
1988年 | 58篇 |
1987年 | 55篇 |
1986年 | 28篇 |
1985年 | 54篇 |
1984年 | 45篇 |
1983年 | 28篇 |
1982年 | 54篇 |
1981年 | 36篇 |
1980年 | 32篇 |
1979年 | 54篇 |
1978年 | 30篇 |
1977年 | 27篇 |
1976年 | 17篇 |
1974年 | 18篇 |
1973年 | 17篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
141.
线性规划的符号跟踪算法 总被引:2,自引:1,他引:1
分析了只含一个约束条件的线性规划最优基变量的特征,将其运用到搜寻含m个约束条件的线性规划的最优基变量,从而提出了线性规划的符号跟踪算法,为线性规划求解提供了新途径。 相似文献
142.
143.
144.
Transmission fluctuation spectrometry (TFS) is a method for the analysis of particle size distributions based on the statistical fluctuations of a transmission signal. Complete information on the PSD and particle concentration can be retrieved by a special transformation of the transmission signal, whereby the expectancy of the transmission square (ETS) is determined after the signal has been subjected to a procedure of spatial and temporal averaging. By varying the averaging parameters over a wide range, a spectrum of ETSs is obtained and introduced into a linear equation system, which yields the PSD. In the experimental realization presented here, variable temporal averaging is realized in the frequency domain with a series of low pass filters at different cutoff frequencies while spatial averaging inevitably occurs as the particles pass through a focused Gaussian beam of finite cross section. Experimental results on spherical particles (glass beads) and non‐spherical particles (SiC) are presented. The PSDs are resolved in 30 intervals within a particle size range from 1–1000 μm, employing a modified Chahine inversion algorithm. So far, the measurements are limited to moderate particle concentrations. Some influences affecting the measurements, especially for higher particle concentrations, are discussed in detail. 相似文献
145.
146.
Kung-Yu Chen 《Journal of Mathematical Analysis and Applications》2004,298(2):411-417
In his recent investigations involving differential operators for some generalizations of the classical Laguerre polynomials, H. Bavinck [J. Phys. A Math. Gen. 29 (1996) L277-L279] encountered and proved a certain summation identity for the classical Laguerre polynomials. The main object of this sequel to Bavinck's work is to prove a generalization of this summation identity for the Srivastava-Singhal polynomials. The demonstration, which is presented here in the general case, differs markedly from the earlier proof given for the known special case. It is also indicated how the general summation identity can be applied to derive the corresponding result for one class of the Konhauser biorthogonal polynomials. 相似文献
147.
Dynamic systems described by nonlinear differential equations of the second order are studied. It is assumed that certain
preliminary information on the dissipative or elastic characteristics of systems is known. A new approach is demonstrated
to obtaining full information on unknown or partially known characteristics of a system from measurements of not only displacements
but also velocities and accelerations
__________
Published in Prikladnaya Mekhanika, Vol. 41, No. 6, pp. 139–143, June 2005. 相似文献
148.
Periodica Mathematica Hungarica - Let X 1,X 2,... be a sequence of independent and identically distributed random variables, and put % MATHTYPE!MTEF!2!1!+-%... 相似文献
149.
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 相似文献
150.
In this paper we obtain some sufficient conditions for the existence of non-constant periodic solutions of the following planar system with six delaysOur approach is based on the continuation theorem of the coincidence degree. 相似文献