全文获取类型
收费全文 | 13770篇 |
免费 | 2108篇 |
国内免费 | 1605篇 |
学科分类
工业技术 | 17483篇 |
出版年
2024年 | 75篇 |
2023年 | 398篇 |
2022年 | 484篇 |
2021年 | 692篇 |
2020年 | 662篇 |
2019年 | 539篇 |
2018年 | 438篇 |
2017年 | 475篇 |
2016年 | 503篇 |
2015年 | 630篇 |
2014年 | 768篇 |
2013年 | 943篇 |
2012年 | 987篇 |
2011年 | 1046篇 |
2010年 | 842篇 |
2009年 | 922篇 |
2008年 | 888篇 |
2007年 | 1059篇 |
2006年 | 939篇 |
2005年 | 780篇 |
2004年 | 647篇 |
2003年 | 499篇 |
2002年 | 386篇 |
2001年 | 389篇 |
2000年 | 281篇 |
1999年 | 261篇 |
1998年 | 182篇 |
1997年 | 123篇 |
1996年 | 132篇 |
1995年 | 97篇 |
1994年 | 95篇 |
1993年 | 64篇 |
1992年 | 48篇 |
1991年 | 36篇 |
1990年 | 38篇 |
1989年 | 25篇 |
1988年 | 33篇 |
1987年 | 19篇 |
1986年 | 12篇 |
1985年 | 7篇 |
1984年 | 7篇 |
1983年 | 6篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 6篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1975年 | 2篇 |
1964年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
91.
自动化学科面临的挑战 总被引:1,自引:0,他引:1
本文分析了控制理论与应用、模式识别与智能系统、导航制导与控制、系统科学与工程、人工智能与自动化交叉等领域的发展现状. 结合科技发展、国内国际研究前沿和新兴领域对自动化科学技术的需求, 提出重点发展智能控制理论和方法、高性能作业机器人、信息物理系统、导航与控制技术、重大装备自动化技术、自主智能系统和人工智能驱动的自动化技术优先领域, 加强数据驱动控制理论、人工智能基础理论研究, 进一步发展人机协同、跨域融合的智能自动化, 为实现国家社会的全面信息化智能化提供理论和技术保障. 相似文献
92.
With the development of the globalization of economy and manufacturing industry, distributed manufacturing mode has become a hot topic in current production research. In the context of distributed manufacturing, one job has different process routes in different workshops because of heterogeneous manufacturing resources and manufacturing environments in each factory. Considering the heterogeneous process planning problems and shop scheduling problems simultaneously can take advantage of the characteristics of distributed factories to finish the processing task well. Thus, a novel network-based mixed-integer linear programming (MILP) model is established for distributed integrated process planning and scheduling problem (DIPPS). The paper designs a new encoding method based on the process network and its OR-nodes, and then proposes a discrete artificial bee colony algorithm (DABC) to solve the DIPPS problem. The proposed DABC can guarantee the feasibility of individuals via specially-designed mapping and switching operations, so that the process precedence constraints contained by the network graph can be satisfied in the entire procedure of the DABC algorithm. Finally, the proposed MILP model is verified and the proposed DABC is tested through some open benchmarks. By comparing with other powerful reported algorithms and obtaining new better solutions, the experiment results prove the effectiveness of the proposed model and DABC algorithm successfully. 相似文献
93.
94.
入侵检测技术是网络安全的主要技术和网络研究的热点,入侵检测方法包括基于数据挖掘、粗糙集、模式识别、支持向量机和人工免疫等主要技术,详细分析了各种检测方法在入侵检测应用中的优缺点。通过回顾研究人员近期的研究成果,提出了该技术的主要发展方向,为进一步研究提供参考。 相似文献
95.
紫外成像检测技术是一种检测高压设备故障的新方法;在此技术上研究设计了一种放电故障紫外检测系统,该系统能对实时采集的紫外图像进行相关的技术处理,同时可对故障点进行准确定位;根据数据建立了设备状态模型并提出一种基于人工神经网络的状态识别方法,应用MATLAB工具进行神经网络的设计和模拟,仿真结果达到预期效果;该系统可以准确地诊断设备的故障和运行状况,有较好运用前景和理论意义。 相似文献
96.
为了从路由技术的角度解决无线传感器网络的能耗问题,综合蚁群优化算法和PEGASIS协议的思想提出了ACO-PEGASIS路由协议;该协议采用蚁群优化算法构建通信链,解决了PEGASIS协议中由于贪婪算法的局部性产生的相邻节点间的长链问题;并在成链过程中综合考虑节点间距离、节点剩余能量等因子,以均衡全网的能量消耗;同时根据距离和能量因素选取链头节点并采用一定措施降低链头重选次数;仿真结果表明,与PEGASIS协议相比,该协议更加有效地均衡了全网的能量消耗,延长了网络的生存周期。 相似文献
97.
气动人工肌肉手臂的神经网络Smith预估控制 总被引:1,自引:0,他引:1
针对含时滞d的1关节气动人工肌肉(PAM)手臂,用三层递归神经网络(RNN),建立PAM手臂包含时滞的模型(即非线性Smith预估器),并超前d步预测PAM手臂的输出角度.将此超前d步的预测值作为反馈量,与设定值相比较得到的误差作为PID控制器输入量,实现Smith预估PID控制.同时每一步都用RNN模型当前时刻的输出值与PAM手臂当前时刻实际输出值之差的平方做为RNN权值的在线调整准则对RNN预测模型的权值进行在线调整,以自适应PAM手臂的不确定性和时变性.使用Matlab通过串口和研华亚当模块对实物PAM手臂进行控制,控制效果表明所提出的Smith预估PID控制算法比常规PID控制算法的性能有显著提高,证明所提出的算法是有效的和切实可行的. 相似文献
98.
Fabrício Enembreck Jean-Paul André Barthès 《Journal of Network and Computer Applications》2012,35(1):164-175
This paper introduces MULBS, a new DCOP (distributed constraint optimization problem) algorithm and also presents a DCOP formulation for scheduling of distributed meetings in collaborative environments. Scheduling in CSCWD can be seen as a DCOP where variables represent time slots and values are resources of a production system (machines, raw-materials, hardware components, etc.) or management system (meetings, project tasks, human resources, money, etc). Therefore, a DCOP algorithm must find a set of variable assignments that maximize an objective function taking constraints into account. However, it is well known that such problems are NP-complete and that more research must be done to obtain feasible and reliable computational approaches. Thus, DCOP emerges as a very promising technique: the search space is decomposed into smaller spaces and agents solve local problems, collaborating in order to achieve a global solution. We show with empirical experiments that MULBS outperforms some of the state-of-the-art algorithms for DCOP, guaranteeing high quality solutions using less computational resources for the distributed meeting scheduling task. 相似文献
99.
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. 相似文献
100.
C. Christopher ColumbusAuthor Vitae K. Chandrasekaran Author VitaeSishaj P. Simon Author Vitae 《Applied Soft Computing》2012,12(1):145-160
This paper proposes a nodal ant colony optimization (NACO) technique to solve profit based unit commitment problem (PBUCP). Generation companies (GENCOs) in a competitive restructured power market, schedule their generators with an objective to maximize their own profit without any regard for system social benefit. Power and reserve prices become important factors in decision process. Ant colony optimization that mimics the behavior of ants foraging activities is suitably implemented to search the UCP search space. Here a search space consisting of optimal combination of binary nodes for unit ON/OFF status is represented for the movement of the ants to maintain good exploration and exploitation search capabilities. The proposed model help GENCOs to make decisions on the quantity of power and reserve that must be put up for sale in the markets and also to schedule generators in order to receive the maximum profit. The effectiveness of the proposed technique for PBUCP is validated on 10 and 36 generating unit systems available in the literature. NACO yields an increase of profit, greater than 1.5%, in comparison with the basic ACO, Muller method and hybrid LR-GA. 相似文献