全文获取类型
收费全文 | 324篇 |
免费 | 12篇 |
国内免费 | 1篇 |
专业分类
337篇 |
出版年
2025年 | 1篇 |
2024年 | 2篇 |
2023年 | 7篇 |
2022年 | 3篇 |
2021年 | 5篇 |
2020年 | 12篇 |
2019年 | 2篇 |
2018年 | 3篇 |
2017年 | 13篇 |
2016年 | 20篇 |
2015年 | 15篇 |
2014年 | 11篇 |
2013年 | 12篇 |
2012年 | 20篇 |
2011年 | 19篇 |
2010年 | 10篇 |
2009年 | 25篇 |
2008年 | 13篇 |
2007年 | 10篇 |
2006年 | 22篇 |
2005年 | 22篇 |
2004年 | 8篇 |
2003年 | 9篇 |
2002年 | 10篇 |
2001年 | 10篇 |
2000年 | 9篇 |
1999年 | 3篇 |
1998年 | 10篇 |
1997年 | 8篇 |
1996年 | 5篇 |
1995年 | 1篇 |
1994年 | 4篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 2篇 |
排序方式: 共有337条查询结果,搜索用时 0 毫秒
81.
82.
工况在旋转机械运行过程中通常是变化的。变化的工况和故障一样,也会引起机械振动特征发生改变,从而引起诊断误差。为此,提出一种用于变工况下轴承健康监测的新方法。该方法使用相关向量机拟合振动特征的统计量随工况参数的变化,得到特征统计量与工况参数之间的连续函数关系;基于不同工况下的特征统计,构建自适应阈值模型。将该方法用于不同转速下的轴承健康监测,结果表明,当转速超过某一个较小的值时,该方法有效。 相似文献
83.
84.
《防务技术》2020,16(4):846-855
Aiming at the problem that the traditional Unscented Kalman Filtering (UKF) algorithm can’t solve the problem that the measurement covariance matrix is unknown and the measured value contains outliers, this paper proposes a robust adaptive UKF algorithm based on Support Vector Regression (SVR). The algorithm combines the advantages of support vector regression with small samples, nonlinear learning ability and online estimation capability of adaptive algorithm based on innovation. Firstly, the SVR model is trained by using the innovation in the sliding window, and the new innovation is monitored. If the deviation between the estimated innovation and the measured innovation exceeds a given threshold, then measured innovation will be replaced by the predicted innovation, and then the processed innovation is used to calculate the measurement noise covariance matrix using the adaptive estimation algorithm. Simulation experiments and measured data experiments show that SVRUKF is significantly better than the traditional UKF, robust UKF and adaptive UKF algorithms for the case where the covariance matrix is unknown and the measured values have outliers. 相似文献
85.
In this paper, we consider just‐in‐time job shop environments (job shop problems with an objective of minimizing the sum of tardiness and inventory costs), subject to uncertainty due to machine failures. We present techniques for proactive uncertainty management that exploit prior knowledge of uncertainty to build competitive release dates, whose execution improves performance. These techniques determine the release dates of different jobs based on measures of shop load, statistical data of machine failures, and repairs with a tradeoff between inventory and tardiness costs. Empirical results show that our methodology is very promising in comparison with simulated annealing and the best of 39 combinations of dispatch rules & release policies, under different frequencies of breakdowns. We observe that the performance of the proactive technique compared to the other two approaches improves in schedule quality (maximizing delivery performance while minimizing costs) with increase in frequency of breakdowns. The proactive technique presented here is also computationally less expensive than the other two approaches. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
86.
提出了一种新的基于Gabor小波特征重组的支持向量机人脸识别方法。该方法首先计算5个尺度和8个方向的Gabor小波变换结果,再把不同人脸中的同一尺度和方向的变换结果进行特征重组,得到40个新特征矩阵,分别利用PCA方法降维去噪,最后构造40个支持向量机分类器并采用选票决策机制决定识别结果。实验结果表明,该方法不仅拓宽了主元分析法中累积方差贡献率可选范围,并在一定程度上解决了核参数选择难的问题,同时取得了理想识别效果。 相似文献
87.
88.
在总结了几种比较常见的故障预测方法的基础上,介绍了基于统计学习理论的支持向量回归算法。提出将智能遗传算法用来对支持向量回归模型的参数进行优化选取,并详细介绍了模型参数的选取过程,避免了参数的盲目设置。将建立起来的模型应用于雷达智能BIT故障预测领域,并以一组智能BIT状态监测的数据对预测模型进行训练和验证,实验结果表明支持向量回归模型能有效地对雷达故障进行预测。 相似文献
89.
由于矢量图匹配中涉及比例变化的匹配算法较少,提出了一种抗小比例变化的影像图与矢量图匹配方法。该方法先对遥感影像进行特征提取,然后与GIS矢量数据进行由局部到整体的动态规划匹配。具体过程为先进行点匹配,寻求坐标变换,再进行线匹配,求得线间Hausdorff距离最小为最优匹配。仿真实例表明该方法能够准确地匹配,并抗比例变化,可行性高。 相似文献
90.
Both topics of batch scheduling and of scheduling deteriorating jobs have been very popular among researchers in the last two decades. In this article, we study a model combining these two topics. We consider a classical batch scheduling model with unit‐jobs and batch‐independent setup times, and a model of step‐deterioration of processing times. The objective function is minimum flowtime. The optimal solution of the relaxed version (allowing non‐integer batch sizes) is shown to have a unique structure consisting of two consecutive decreasing arithmetic sequences of batch sizes. We also introduce a simple and efficient rounding procedure that guarantees integer batch sizes. The entire solution procedure requires an effort of O(n) (where nis the number of jobs.) © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献