全文获取类型
收费全文 | 11742篇 |
免费 | 2741篇 |
国内免费 | 2497篇 |
专业分类
电工技术 | 1155篇 |
技术理论 | 2篇 |
综合类 | 1366篇 |
化学工业 | 400篇 |
金属工艺 | 161篇 |
机械仪表 | 515篇 |
建筑科学 | 390篇 |
矿业工程 | 197篇 |
能源动力 | 181篇 |
轻工业 | 287篇 |
水利工程 | 168篇 |
石油天然气 | 151篇 |
武器工业 | 85篇 |
无线电 | 1680篇 |
一般工业技术 | 653篇 |
冶金工业 | 151篇 |
原子能技术 | 45篇 |
自动化技术 | 9393篇 |
出版年
2024年 | 105篇 |
2023年 | 315篇 |
2022年 | 512篇 |
2021年 | 576篇 |
2020年 | 640篇 |
2019年 | 593篇 |
2018年 | 598篇 |
2017年 | 644篇 |
2016年 | 731篇 |
2015年 | 765篇 |
2014年 | 936篇 |
2013年 | 918篇 |
2012年 | 1194篇 |
2011年 | 1223篇 |
2010年 | 994篇 |
2009年 | 952篇 |
2008年 | 1028篇 |
2007年 | 1062篇 |
2006年 | 713篇 |
2005年 | 585篇 |
2004年 | 442篇 |
2003年 | 310篇 |
2002年 | 260篇 |
2001年 | 186篇 |
2000年 | 144篇 |
1999年 | 125篇 |
1998年 | 79篇 |
1997年 | 54篇 |
1996年 | 50篇 |
1995年 | 45篇 |
1994年 | 29篇 |
1993年 | 26篇 |
1992年 | 21篇 |
1991年 | 16篇 |
1990年 | 14篇 |
1989年 | 18篇 |
1988年 | 7篇 |
1987年 | 7篇 |
1986年 | 4篇 |
1985年 | 12篇 |
1984年 | 10篇 |
1983年 | 8篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 5篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
181.
聚类算法分析及在GIS中心选址中的仿真研究 总被引:1,自引:1,他引:0
通过对聚类算法初始点选择策略的分析和比较,经典k-means算法在GIS海量数据处理上的效率问题,提出了随机采样的k-means算法来进行坐标聚类;并将随机采样k-means算法应用于GIS中心选址,充分利用GIS数据分析和处理能力,以城市间的欧几里得距离为相似条件,采用最大最小原则选取初始点进行聚类,从而缓解局部最优解产生的概率;选取中心城市作为目标对象,从而提高商业决策的充分性和可靠性;经仿真结果验证了所提出的随机取样k-means算法的有效性和正确率。 相似文献
182.
模糊聚类有效性的研究进展 总被引:2,自引:1,他引:1
聚类有效性评价对聚类分析具有重要意义,是聚类分析的瓶颈之一。本文从基于数据集模糊划分的方法和基于数据集几何结构的方法两方面,归纳综述了常用的模糊聚类有效性评价函数,并讨论了模糊聚类最佳类别数的自动确定问题。 相似文献
183.
A Randomized Algorithm for Online Unit Clustering 总被引:1,自引:0,他引:1
In this paper, we consider the online version of the following problem: partition a set of input points into subsets, each enclosable by a unit ball, so as to minimize the number of subsets used. In the one-dimensional case, we show that surprisingly the naïve upper bound of 2 on the competitive ratio can be beaten: we present a new randomized 15/8-competitive online algorithm. We also provide some lower bounds and an extension to higher dimensions. 相似文献
184.
基于ART2神经网络的车辆感应波形识别的方法 总被引:1,自引:0,他引:1
在智能交通系统中,无论是在交通监控领域还是在不停车收费系统方面,对车辆进行自动分类都十分重要;环形线圈车辆检测器以其良好的适应性、稳定性和高效性在车辆监测方面得到了广泛的应用,同时利用同类型或同种车辆经过环形线圈产生轮廓相似的电磁感应波形这一特点也可以进行车型识别;对波形进行预处理,以波形轮廓的抽样、量化值作为特征向量,将特征向量作为ART2神经网络的输入向量,经ART2神经网络的自动聚类最终实现车辆感应波形的聚类与识别。 相似文献
185.
186.
187.
聚类可以看成是寻找K个最佳聚类中心的过程。文中把一组聚类中心视为一个粒子(P),把各个数据到各自聚类中心的欧式距离之和看成优化函数(f(P)),使用带混沌搜索的粒子群聚类算法(C-PSO)算法寻找最优函数值,从而找到最佳聚类中心。该算法改进了粒子速度的初始化,把混沌搜索嵌入到粒子群的搜索过程中,提高了粒子群的搜索能力。实验结果表明,该算法的聚类效果明显好于K-means和PSO聚类。 相似文献
188.
D. C. Douglas Hung 《Journal of Systems Integration》1995,5(2):107-121
Computer integrated manufacturing uses computer technology to integrate a manufacturing system through a man-machine interface that fills the gap between manual operation and machine processes. It is clear that a computer vision-based man-machine interface makes a fully automated system possible. The basic challenge of a vision-based interface is how to extract information from digitized images and convert it to machine-friendly knowledge. To extract information, then, it often end up to the problem of shape decomposition. This paper proposes an new approach in decomposing compound shapes without prior knowledge of the scene. The proposed algorithm exploits the fact that planar shapes can be completely described by contour segments, and can be decomposed at their maximum concavity into simpler objects. To reduce spurious decomposition, the decomposed segments are merged into groups by analyzing and utilizing the merging hypotheses. The algorithm calculates the linking possibility by weighting the angular differentiation between two segments. The techniques are implemented and are applied to other partial shape matching problems for clustering purposes. 相似文献
189.
Weather is a key factor affecting the control of air traffic. Accurate recognition and classification of similar weather scenes in the terminal area is helpful for rapid decision-making in air traffic flow management. Current researches mostly use traditional machine learning methods to extract features of weather scenes, and clustering algorithms to divide similar scenes. Inspired by the excellent performance of deep learning in image recognition, this paper proposes a terminal area similar weather scene classification method based on improved deep convolution embedded clustering (IDCEC), which uses the combination of the encoding layer and the decoding layer to reduce the dimensionality of the weather image, retaining useful information to the greatest extent, and then uses the combination of the pre-trained encoding layer and the clustering layer to train the clustering model of the similar scenes in the terminal area. Finally, terminal area of Guangzhou Airport is selected as the research object, the method proposed in this article is used to classify historical weather data in similar scenes, and the performance is compared with other state-of-the-art methods. The experimental results show that the proposed IDCEC method can identify similar scenes more accurately based on the spatial distribution characteristics and severity of weather; at the same time, compared with the actual flight volume in the Guangzhou terminal area, IDCEC's recognition results of similar weather scenes are consistent with the recognition of experts in the field. 相似文献
190.
In today's Internet routing infrastructure, designers have addressed scaling concerns in routing constrained multiobjective optimization problems examining latency and mobility concerns as a secondary constrain. In tactical Mobile Ad-hoc Network (MANET), hubs can function based on the work plan in various social affairs and the internally connected hubs are almost having the related moving standards where the topology between one and the other are tightly coupled in steady support by considering the touchstone of hubs such as a self-sorted out, self-mending and self-administration. Clustering in the routing process is one of the key aspects to increase MANET performance by coordinating the pathways using multiple criteria and analytics. We present a Group Adaptive Hybrid Routing Algorithm (GAHRA) for gathering portability, which pursues table-driven directing methodology in stable accumulations and on-request steering strategy for versatile situations. Based on this aspect, the research demonstrates an adjustable framework for commuting between the table-driven approach and the on-request approach, with the objectives of enhancing the output of MANET routing computation in each hub. Simulation analysis and replication results reveal that the proposed method is promising than a single well-known existing routing approach and is well-suited for sensitive MANET applications. 相似文献