全文获取类型
收费全文 | 9267篇 |
免费 | 1317篇 |
国内免费 | 771篇 |
专业分类
电工技术 | 696篇 |
综合类 | 1163篇 |
化学工业 | 564篇 |
金属工艺 | 193篇 |
机械仪表 | 1525篇 |
建筑科学 | 542篇 |
矿业工程 | 201篇 |
能源动力 | 279篇 |
轻工业 | 280篇 |
水利工程 | 143篇 |
石油天然气 | 247篇 |
武器工业 | 144篇 |
无线电 | 1687篇 |
一般工业技术 | 1683篇 |
冶金工业 | 159篇 |
原子能技术 | 112篇 |
自动化技术 | 1737篇 |
出版年
2024年 | 61篇 |
2023年 | 142篇 |
2022年 | 275篇 |
2021年 | 319篇 |
2020年 | 404篇 |
2019年 | 285篇 |
2018年 | 298篇 |
2017年 | 364篇 |
2016年 | 442篇 |
2015年 | 477篇 |
2014年 | 665篇 |
2013年 | 673篇 |
2012年 | 810篇 |
2011年 | 799篇 |
2010年 | 576篇 |
2009年 | 531篇 |
2008年 | 498篇 |
2007年 | 581篇 |
2006年 | 527篇 |
2005年 | 401篇 |
2004年 | 327篇 |
2003年 | 260篇 |
2002年 | 221篇 |
2001年 | 187篇 |
2000年 | 162篇 |
1999年 | 158篇 |
1998年 | 110篇 |
1997年 | 118篇 |
1996年 | 119篇 |
1995年 | 91篇 |
1994年 | 88篇 |
1993年 | 73篇 |
1992年 | 49篇 |
1991年 | 58篇 |
1990年 | 40篇 |
1989年 | 42篇 |
1988年 | 25篇 |
1987年 | 23篇 |
1986年 | 12篇 |
1985年 | 12篇 |
1984年 | 6篇 |
1983年 | 7篇 |
1982年 | 11篇 |
1981年 | 12篇 |
1980年 | 6篇 |
1979年 | 4篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1959年 | 1篇 |
1956年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
通过对梯度格型快速自适应算法的研究,结合最大熵谱外推目前存在的缺点,将梯度格型算法应用于最大熵谱外推中,并将其与伯格算法进行了比较。 相似文献
62.
63.
Hanquan Wang 《Computer Physics Communications》2010,181(2):325-340
We propose an efficient time-splitting Chebyshev-Tau spectral method for the Ginzburg-Landau-Schrödinger equation with zero/nonzero far-field boundary conditions. The key technique that we apply is splitting the Ginzburg-Landau-Schrödinger equation in time into two parts, a nonlinear equation and a linear equation. The nonlinear equation is solved exactly; while the linear equation in one dimension is solved with Chebyshev-Tau spectral discretization in space and Crank-Nicolson method in time. The associated discretized system can be solved very efficiently since they can be decoupled into two systems, one for the odd coefficients, the other for the even coefficients. The associated matrices have a quasi-tridiagonal structure which allows a direction solution to be obtained. The computation cost of the method in one dimension is O(Nlog(N)) compared with that of the non-optimized one, which is O(N2). By applying the alternating direction implicit (ADI) technique, we extend this efficient method to solve the Ginzburg-Landau-Schrödinger equation both in two dimensions and in three dimensions, respectively. Numerical accuracy tests of the method in one dimension, two dimensions and three dimensions are presented. Application of the method to study the semi-classical limits of Ginzburg-Landau-Schrödinger equation in one dimension and the two-dimensional quantized vortex dynamics in the Ginzburg-Landau-Schrödinger equation are also presented. 相似文献
64.
随着文本资源的激增,特别是网页文本的迅速增加,针对文本的挖掘分析日益受到重视。谱聚类是文本聚类分析较常用的一种新型方法。该文将非负约束引入到传统的谱聚类算法中,提出了一种基于非负约束的谱聚类方法。文中实验验证了所提出方法在中文文本聚类分析应用中的有效性。 相似文献
65.
在流形学习的谱方法中, 流形展开被表述为优化问题. 这些优化问题的解是退化的, 即所有的样本将被嵌入到同一个点. 为了避免退化解, 谱方法对嵌入坐标人为地强加了一个单位协方差矩阵约束. 然而, 该约束往往导致流形展开的失真非常明显. 本文提出一种新的流形学习方法, 彻底抛弃了人为的单位协方差矩阵约束. 主要思路是先对流形边界进行嵌入, 然后再求流形内部的嵌入; 流形边界的嵌入位置被确定后, 流形内部样本的嵌入位置将被边界拉开, 使得它们不会都收缩到一个点上, 从而避免了退化解的出现. 将流形边界的嵌入位置作为边界条件, 求解一个线性方程组来得到内部样本的嵌入; 该线性方程组反映了尽量保持邻近样本间距离不变的要求. 流形边界的嵌入由简化流形的嵌入求出; 为此, 本文还设计了一种流形边界检测算法以及一种流形简化算法. 与目前代表性的几种流形学习方法进行了比较实验, 结果表明了本文方法的有效性, 其展开失真比谱方法明显要小. 相似文献
66.
车载环境下基于样本熵的语音端点检测方法 总被引:1,自引:0,他引:1
在语音处理中一个关键性问题是如何准确找到语音的起止位置,目前提出许多的语音端点检测算法不能得到理想的检测结果.由于样本熵是近似熵的改进算法,提出车载环境下基于样本熵的语音端点检测方法.并采用模糊C均值聚类算法和贝叶斯信息判决算法进行样本熵特征门限估计,以及使用双门限法进行语音端点检测.在TIMIT连续语音库上的实验表明,车载噪声环境下,样本熵法和近似熵法的检测正确率均远高于谱熵法和能量谱熵法,而样本熵法相对于近似熵法具有更好的检测效果,特别是当信噪比小于等于OdB时,样本熵法的检测性能优于近似熵法近10%.因此,样本熵法在车栽智能语音领域具有很好的应用前景,能够为车载导航提供准确的语音端点检测技术. 相似文献
67.
分析了MERSI与MODIS间光谱响应差异对测量表观反射比的影响。正演模拟结果显示,在极区冰雪情况下,MERSI与MODIS测量得到的表观反射比之间的相对差异是关于MODIS所测表观发射比的二次函数。MERSI的前4个通道与对应的MODIS通道之间的相对差异在0~0.8%,0~2%,0.5%~2.5%,-1.8%~-0.8%之间。将正演模拟得到的对光谱响应差异的修正关系应用到具体的SNO测量后,MERSI前3个通道的表观反射比与修正后MODIS的表观反射比之间的相对差异减小到了3%以内。MERSI的1、2通道在红外波段也有响应,这部分响应在极区冰雪条件下对表观反射率的影响在0.5%左右,基本可以忽略。 相似文献
68.
Javier Plaza Author Vitae Antonio Plaza Author VitaeAuthor Vitae Pablo Martinez Author Vitae 《Pattern recognition》2009,42(11):3032-3809
In this work, neural network-based models involved in hyperspectral image spectra separation are considered. Focus is on how to select the most highly informative samples for effectively training the neural architecture. This issue is addressed here by several new algorithms for intelligent selection of training samples: (1) a border-training algorithm (BTA) which selects training samples located in the vicinity of the hyperplanes that can optimally separate the classes; (2) a mixed-signature algorithm (MSA) which selects the most spectrally mixed pixels in the hyperspectral data as training samples; and (3) a morphological-erosion algorithm (MEA) which incorporates spatial information (via mathematical morphology concepts) to select spectrally mixed training samples located in spatially homogeneous regions. These algorithms, along with other standard techniques based on orthogonal projections and a simple Maximin-distance algorithm, are used to train a multi-layer perceptron (MLP), selected in this work as a representative neural architecture for spectral mixture analysis. Experimental results are provided using both a database of nonlinear mixed spectra with absolute ground truth and a set of real hyperspectral images, collected at different altitudes by the digital airborne imaging spectrometer (DAIS 7915) and reflective optics system imaging spectrometer (ROSIS) operating simultaneously at multiple spatial resolutions. 相似文献
69.
This paper presents an algebraic approach to polynomial spectral factorization, an important mathematical tool in signal processing and control. The approach exploits an intriguing relationship between the theory of Gröbner bases and polynomial spectral factorization which can be observed through the sum of roots, and allows us to perform polynomial spectral factorization in the presence of real parameters. It is discussed that parametric polynomial spectral factorization enables us to express quantities such as the optimal cost in terms of parameters and the sum of roots. Furthermore an optimization method over parameters is suggested that makes use of the results from parametric polynomial spectral factorization and also employs two quantifier elimination techniques. This proposed approach is demonstrated in a numerical example of a particular control problem. 相似文献
70.
Numerous attempts have been undertaken to apply the spectral subtraction method to cancel noise perturbations but these efforts have yet to produce an algorithm that is able to adapt well to the environmental changes in the perturbations. In addition, the variants of the spectral subtraction method so far proposed in the literature would require a non-voice activity detector (NVAD), for a single microphone system, to store the perturbation. This is used as an estimate for the reference signal. Inaccuracy in the perturbation estimates causes the cleaned speech to be corrupted by musical artifacts, which is unacceptable. Post processing of signals corrupted by the musical artifacts is very costly. This paper provides an alternative approach that employs associative memory for speech enhancement. Extensive comparison is made using the soft computing approaches for noise cancellation based on associative memories. A set of stereo microphones captures the corrupted speech in a vehicle and is used to point to the closest associative memory location. The Wiener filter approach is used to cancel the noise. The paper discusses novel examples of the associative memories using the cerebellum model for noise modeling. Experimental results show the potential of these novel soft computing architectures in generating and adapting the required Weiner filters to cancel perturbation even at signal to noise ratio (SNR) of less than −13 dB. 相似文献