全文获取类型
收费全文 | 3941篇 |
免费 | 475篇 |
国内免费 | 330篇 |
专业分类
化学 | 521篇 |
晶体学 | 3篇 |
力学 | 278篇 |
综合类 | 157篇 |
数学 | 2339篇 |
物理学 | 1448篇 |
出版年
2024年 | 6篇 |
2023年 | 36篇 |
2022年 | 52篇 |
2021年 | 111篇 |
2020年 | 75篇 |
2019年 | 101篇 |
2018年 | 91篇 |
2017年 | 138篇 |
2016年 | 187篇 |
2015年 | 130篇 |
2014年 | 247篇 |
2013年 | 261篇 |
2012年 | 242篇 |
2011年 | 238篇 |
2010年 | 179篇 |
2009年 | 266篇 |
2008年 | 293篇 |
2007年 | 263篇 |
2006年 | 272篇 |
2005年 | 208篇 |
2004年 | 172篇 |
2003年 | 153篇 |
2002年 | 156篇 |
2001年 | 136篇 |
2000年 | 138篇 |
1999年 | 86篇 |
1998年 | 91篇 |
1997年 | 79篇 |
1996年 | 62篇 |
1995年 | 33篇 |
1994年 | 45篇 |
1993年 | 21篇 |
1992年 | 23篇 |
1991年 | 20篇 |
1990年 | 11篇 |
1989年 | 21篇 |
1988年 | 10篇 |
1987年 | 8篇 |
1986年 | 11篇 |
1985年 | 17篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 7篇 |
1981年 | 7篇 |
1980年 | 8篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 5篇 |
1976年 | 7篇 |
1975年 | 3篇 |
排序方式: 共有4746条查询结果,搜索用时 15 毫秒
41.
Bin Han 《Advances in Computational Mathematics》2006,24(1-4):375-403
In this paper, we present a necessary and sufficient condition for the existence of solutions in a Sobolev space Wpk(ℝs) (1≤p≤∞) to a vector refinement equation with a general dilation matrix. The criterion is constructive and can be implemented.
Rate of convergence of vector cascade algorithms in a Sobolev space Wpk(ℝs) will be investigated. When the dilation matrix is isotropic, a characterization will be given for the Lp (1≤p≤∞) critical smoothness exponent of a refinable function vector without the assumption of stability on the refinable function
vector. As a consequence, we show that if a compactly supported function vector φ∈Lp(ℝs) (φ∈C(ℝs) when p=∞) satisfies a refinement equation with a finitely supported matrix mask, then all the components of φ must belong to a Lipschitz
space Lip(ν,Lp(ℝs)) for some ν>0. This paper generalizes the results in R.Q. Jia, K.S. Lau and D.X. Zhou (J. Fourier Anal. Appl. 7 (2001) 143–167)
in the univariate setting to the multivariate setting.
Dedicated to Professor Charles A. Micchelli on the occasion of his 60th birthday
Mathematics subject classifications (2000) 42C20, 41A25, 39B12.
Research was supported in part by the Natural Sciences and Engineering Research Council of Canada (NSERC Canada) under Grant
G121210654. 相似文献
42.
43.
矩孔金属光栅矢量模式理论的数值计算 总被引:1,自引:0,他引:1
根据矩孔金属光栅的矢量模式理论,计算了不同入射方向,波长及偏振态情况下衍射场的分布,研究了不同光栅结构对衍射效率,偏振态变化的影响;同时,根据实际需要,加工制作了一批不同深度的矩孔光栅样品,进行了实验测量,并将计算值与实验值进行了比较,两者基本相符。 相似文献
44.
鲍培文 《南昌大学学报(理科版)》2007,31(1):21-24
利用数值化方法和 Browder 不动点定理,得到一类新的广义向量均衡问题解的存在定理,并用于向量变分不等式、向量相补问题和抽象向量优化问题,得到其解的存在定理. 相似文献
45.
局部对称共形平坦黎曼流形中具有平行平均曲率向量的子流形 总被引:8,自引:0,他引:8
本文把[1]的结论推广到了环绕空间是局部对称共形平坦的情形,即获得了:设M~是局部对称共形平坦黎曼流形N~+p(p>1)中具有平行平均曲率向量的紧致子流形,如果则M~位于N~+p的全测地子流形N~+1中。其中S,H分别是M~的第二基本形式长度的平方和M~的平均曲率,T_C、t_c分别是N~+p的Ricci曲率的上、下确界,K是N~+p的数量曲率。 相似文献
46.
利用集值映射切导数与半可微概念,给出了无约束与具约束的集值向量优化问题局部真有效解与局部强有效解的最优性条件。 相似文献
47.
In this paper we construct the linear support vector machine (SVM) based on the nonlinear rescaling (NR) methodology (see
[Polyak in Math Program 54:177–222, 1992; Polyak in Math Program Ser A 92:197–235, 2002; Polyak and Teboulle in Math Program
76:265–284, 1997] and references therein). The formulation of the linear SVM based on the NR method leads to an algorithm
which reduces the number of support vectors without compromising the classification performance compared to the linear soft-margin
SVM formulation. The NR algorithm computes both the primal and the dual approximation at each step. The dual variables associated
with the given data-set provide important information about each data point and play the key role in selecting the set of
support vectors. Experimental results on ten benchmark classification problems show that the NR formulation is feasible. The
quality of discrimination, in most instances, is comparable to the linear soft-margin SVM while the number of support vectors
in several instances were substantially reduced. 相似文献
48.
Enrique Bendito ngeles Carmona Andr s M. Encinas 《Applied Numerical Mathematics》2004,50(3-4):343-370
Our aim is to set the foundations of a discrete vectorial calculus on uniform n-dimensional grids, that can be easily reformulated on general irregular grids. As a key tool we first introduce the notion of tangent space to any grid node. Then we define the concepts of vector field, field of matrices and inner products on the space of grid functions and on the space of vector fields, mimicking the continuous setting. This allows us to obtain the discrete analogous of the basic first order differential operators, gradient and divergence, whose composition define the fundamental second order difference operator. As an application, we show that all difference schemes, with constant coefficients, for first and second order differential operators with constant coefficients can be seen as difference operators of the form
for suitable choices of q,
and
. In addition, we characterize special properties of the difference scheme, such as consistency, symmetry and positivity in terms of q,
and
. 相似文献
49.
基于Karhunen-Loève变换和小波谱特征矢量量化的三维谱像数据压缩 总被引:1,自引:1,他引:0
提出了基于Karhunen Lo埁ve变换的小波谱特征矢量量化三维谱像数据压缩方法耍幔颍瑁酰睿澹?Lo埁ve变换 /小波变换 /小波谱特征矢量量化方法应用了Karhunen Lo埁ve变换的消除谱相关性优良性能 ,应用二维小波变换消除空间相关性 ,在小波变换域内应用二维集分割嵌入块编码和一维谱特征矢量量化对三维谱像数据压缩 ,获得较高的压缩性能。实验结果表明 :Karhunen Lo埁ve变换 /小波变换 /小波谱特征矢量量化编码比Karhunen Lo埁ve变换 /小波变换 /改进对块零树编码和Karhunen Lo埁ve变换 /小波变换 /快速矢量量化编码方法在同样压缩比条件下 ,峰值信噪比提高 2dB和 1dB以上 ,而速度提高了 1.5和 8倍 ,整体压缩性能有较大的提高 相似文献
50.
Support vector machine (SVM), developed by Vapnik et al., is a new and promising technique for classification and regression and has been proved to be competitive with the best available learning machines in many applications. However, the classification speed of SVM is substantially slower than that of other techniques with similar generalization ability. A new type SVM named projected SVM (PSVM), which is a combination of feature vector selection (FVS) method and linear SVM (LSVM), is proposed in present paper. In PSVM, the FVS method is first used to select a relevant subset (feature vectors, FVs) from the training data, and then both the training data and the test data are projected into the subspace constructed by FVs, and finally linear SVM(LSVM) is applied to classify the projected data. The time required by PSVM to calculate the class of new samples is proportional to the count of FVs. In most cases, the count of FVs is smaller than that of support vectors (SVs), and therefore PSVM is faster than SVM in running. Compared with other speeding-up techniques of SVM, PSVM is proved to possess not only speeding-up ability but also de-noising ability for high-noised data, and is found to be of potential use in mechanical fault pattern recognition. 相似文献