全文获取类型
收费全文 | 1021篇 |
免费 | 552篇 |
国内免费 | 333篇 |
专业分类
电工技术 | 58篇 |
综合类 | 40篇 |
化学工业 | 12篇 |
金属工艺 | 10篇 |
机械仪表 | 63篇 |
建筑科学 | 21篇 |
矿业工程 | 2篇 |
能源动力 | 20篇 |
轻工业 | 1篇 |
水利工程 | 19篇 |
石油天然气 | 5篇 |
武器工业 | 5篇 |
无线电 | 107篇 |
一般工业技术 | 25篇 |
原子能技术 | 5篇 |
自动化技术 | 1513篇 |
出版年
2024年 | 1篇 |
2023年 | 11篇 |
2022年 | 29篇 |
2021年 | 44篇 |
2020年 | 46篇 |
2019年 | 57篇 |
2018年 | 63篇 |
2017年 | 77篇 |
2016年 | 79篇 |
2015年 | 109篇 |
2014年 | 131篇 |
2013年 | 158篇 |
2012年 | 192篇 |
2011年 | 230篇 |
2010年 | 167篇 |
2009年 | 151篇 |
2008年 | 130篇 |
2007年 | 116篇 |
2006年 | 54篇 |
2005年 | 29篇 |
2004年 | 10篇 |
2003年 | 11篇 |
2002年 | 5篇 |
2001年 | 2篇 |
2000年 | 3篇 |
1981年 | 1篇 |
排序方式: 共有1906条查询结果,搜索用时 906 毫秒
1.
为了提高花粉浓度预报的准确率,解决现有花粉浓度预报准确率不高的问题,提出了一种基于粒子群优化(PSO)算法和支持向量机(SVM)的花粉浓度预报模型。首先,综合考虑气温、气温日较差、相对湿度、降水量、风力、日照时数等多种气象要素,选择与花粉浓度相关性较强的气象要素构成特征向量;其次,利用特征向量与花粉浓度数据建立SVM预测模型,并使用PSO算法找出最优参数;然后利用最优参数优化花粉浓度预测模型;最后,使用优化后的模型对花粉未来24 h浓度进行预测,并与未优化的SVM、多元线性回归法(MLR)、反向神经网络(BPNN)作对比。此外使用优化后的模型对某市南郊观象台和密云两个站点进行逐日花粉浓度预测。实验结果表明,相比其他预报方法,所提方法能有效提高花粉浓度未来24 h预测精度,并具有较高的泛化能力。 相似文献
2.
针对模拟电路健康管理的特点,提出了一种基于PSO优化多核RVM的模拟电路故障预测方法。利用参数分析得到电路的输出频域响应作为特征,计算其与电路无故障标准响应的欧氏距离来表征电路元件健康值,将多个核函数线性组合,并用PSO优化多核RVM参数后的模型实现对各个时间点元件的健康值变化轨迹进行预测。仿真结果表明,该方法在小样本情况下,预测效果优于单一核函数的RVM模型,适用于健康管理中实时预测,具有较好的实用性。 相似文献
3.
针对工业控制系统传统单一检测算法模型对不同攻击类型检测率和检测速度不佳的问题,提出一种优化支持向量机和K-means++算法结合的入侵检测模型。首先利用主成分分析法(PCA)对原始数据集进行预处理,消除其相关性;其次在粒子群优化(PSO)算法的基础上加入自适应变异过程避免在训练的过程中陷入局部最优解;然后利用自适应变异粒子群优化(AMPSO)算法优化支持向量机的核函数和惩罚参数;最后利用密度中心法改进K-means算法与优化后的支持向量机组合成入侵检测模型,从而实现工业控制系统的异常检测。实验结果表明,所提方法在检测速度和对各类攻击的检测率上得到明显提升。 相似文献
4.
Electrocardiogram is the most commonly used tool for the diagnosis of cardiologic diseases. In order to help cardiologists to diagnose the arrhythmias automatically, new methods for automated, computer aided ECG analysis are being developed. In this paper, a Modified Artificial Bee Colony (MABC) algorithm for ECG heart beat classification is introduced. It is applied to ECG data set which is obtained from MITBIH database and the result of MABC is compared with seventeen other classifier's accuracy.In classification problem, some features have higher distinctiveness than others. In this study, in order to find higher distinctive features, a detailed analysis has been done on time domain features. By using the right features in MABC algorithm, high classification success rate (99.30%) is obtained. Other methods generally have high classification accuracy on examined data set, but they have relatively low or even poor sensitivities for some beat types. Different data sets, unbalanced sample numbers in different classes have effect on classification result. When a balanced data set is used, MABC provided the best result as 97.96% among all classifiers.Not only part of the records from examined MITBIH database, but also all data from selected records are used to be able to use developed algorithm on a real time system in the future by using additional software modules and making adaptation on a specific hardware. 相似文献
5.
6.
The kernelized fuzzy c-means algorithm uses kernel methods to improve the clustering performance of the well known fuzzy c-means algorithm by mapping a given dataset into a higher dimensional space non-linearly. Thus, the newly obtained dataset is more likely to be linearly seprable. However, to further improve the clustering performance, an optimization method is required to overcome the drawbacks of the traditional algorithms such as, sensitivity to initialization, trapping into local minima and lack of prior knowledge for optimum paramaters of the kernel functions. In this paper, to overcome these drawbacks, a new clustering method based on kernelized fuzzy c-means algorithm and a recently proposed ant based optimization algorithm, hybrid ant colony optimization for continuous domains, is proposed. The proposed method is applied to a dataset which is obtained from MIT–BIH arrhythmia database. The dataset consists of six types of ECG beats including, Normal Beat (N), Premature Ventricular Contraction (PVC), Fusion of Ventricular and Normal Beat (F), Artrial Premature Beat (A), Right Bundle Branch Block Beat (R) and Fusion of Paced and Normal Beat (f). Four time domain features are extracted for each beat type and training and test sets are formed. After several experiments it is observed that the proposed method outperforms the traditional fuzzy c-means and kernelized fuzzy c-means algorithms. 相似文献
7.
8.
基于群智能混合算法的物流配送路径研究 总被引:1,自引:0,他引:1
针对物流车辆路径优化问题,考虑到基本蚁群算法有收敛速度慢、易陷入局部最优的缺点,采用了一种双种群蚁群算法,在蚁群的基础上引入差分进化(DE)和粒子群算法(PSO)。通过在PSOAS种群和DEAS种群之间建立一种信息交流机制,使信息能够在两个种群中传递,以免某一方因错误的信息判断而陷入局部最优点。通过matlab仿真实验测试,表明该群智能混合算法可以较好地解决TSP的问题。 相似文献
9.
The paper presents a new approach for recommending suitable learning paths for different learners groups. Selection of the learning path is considered as recommendations to choosing and combining the sequences of learning objects (LOs) according to learners’ preferences. Learning path can be selected by applying artificial intelligence techniques, e.g. a swarm intelligence model. If we modify and/or change some LOs in the learning path, we should rearrange the alignment of new and old LOs and reallocate pheromones to achieve effective learning recommendations. To solve this problem, a new method based on the ant colony optimisation algorithm and adaptation of the solution to the changing optimum is proposed. A simulation process with a dynamic change of learning paths when new LOs are inserted was chosen to verify the method proposed. The paper contributes with the following new developments: (1) an approach of dynamic learning paths selection based on swarm intelligence, and (2) a modified ant colony optimisation algorithm for learning paths selection. The elaborated approach effectively assist learners by helping them to reach most suitable LOs according to their preferences, and tutors – by helping them to monitor, refine, and improve e-learning modules and courses according to the learners’ behaviour. 相似文献
10.
《Robotics and Autonomous Systems》2014,62(9):1294-1304
Target enclosure by autonomous robots is useful for many practical applications, for example, surveillance of disaster sites. Scalability is important for autonomous robots because a larger group is more robust against breakdown, accidents, and failure. However, since the traditional models have discussed only the cases in which minimum number of robots enclose a single target, there has been no study on the utilization of the redundant number of robots. In this paper, to achieve a highly scalable target enclosure model about the number of target to enclose, we introduce swarm based task assignment capability to Takayama’s enclosure model. The original model discussed only single target environment but it is well suited for applying to the environments with multiple targets. We show the robots can enclose the targets without predefined position assignment by analytic discussion based on switched systems and a series of computer simulations. As a consequence of this property, the proposed robots can change their target according to the criterion about robot density while they enclose multiple targets. 相似文献