全文获取类型
收费全文 | 12123篇 |
免费 | 3171篇 |
国内免费 | 2702篇 |
专业分类
电工技术 | 1138篇 |
技术理论 | 2篇 |
综合类 | 1251篇 |
化学工业 | 214篇 |
金属工艺 | 119篇 |
机械仪表 | 615篇 |
建筑科学 | 186篇 |
矿业工程 | 160篇 |
能源动力 | 169篇 |
轻工业 | 209篇 |
水利工程 | 122篇 |
石油天然气 | 127篇 |
武器工业 | 89篇 |
无线电 | 2100篇 |
一般工业技术 | 503篇 |
冶金工业 | 117篇 |
原子能技术 | 21篇 |
自动化技术 | 10854篇 |
出版年
2024年 | 102篇 |
2023年 | 295篇 |
2022年 | 495篇 |
2021年 | 576篇 |
2020年 | 655篇 |
2019年 | 567篇 |
2018年 | 607篇 |
2017年 | 646篇 |
2016年 | 728篇 |
2015年 | 792篇 |
2014年 | 983篇 |
2013年 | 946篇 |
2012年 | 1253篇 |
2011年 | 1418篇 |
2010年 | 1128篇 |
2009年 | 1077篇 |
2008年 | 1126篇 |
2007年 | 1178篇 |
2006年 | 822篇 |
2005年 | 607篇 |
2004年 | 463篇 |
2003年 | 334篇 |
2002年 | 252篇 |
2001年 | 164篇 |
2000年 | 149篇 |
1999年 | 117篇 |
1998年 | 86篇 |
1997年 | 72篇 |
1996年 | 57篇 |
1995年 | 53篇 |
1994年 | 44篇 |
1993年 | 25篇 |
1992年 | 19篇 |
1991年 | 26篇 |
1990年 | 25篇 |
1989年 | 23篇 |
1988年 | 13篇 |
1987年 | 8篇 |
1986年 | 3篇 |
1985年 | 10篇 |
1984年 | 10篇 |
1983年 | 8篇 |
1982年 | 3篇 |
1981年 | 5篇 |
1980年 | 6篇 |
1979年 | 4篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1974年 | 3篇 |
1959年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 9 毫秒
21.
Ilan Gronau 《Information Processing Letters》2007,104(6):205-210
In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n2)-time implementations of such algorithms which use a ‘locally closest’ joining scheme, and specify conditions under which this relaxed joining scheme is equivalent to the original one (i.e. ‘globally closest’). 相似文献
22.
Zheng Liu Zhiyun Xue Rick S. Blum Robert Laganière 《Pattern Analysis & Applications》2006,8(4):375-389
Images acquired by heterogeneous image sensors may provide complementary information about the scene, for instance, the visual image can provide personal identification information like the facial pattern while the infrared (IR) or millimeter wave image can detect the suspicious regions of concealed weapons. Usually, a technique, namely multiresolution pixel-level image fusion is applied to integrate the information from multi-sensor images. However, when the images are significantly different, the performance of the multiresolution fusion algorithms is not always satisfactory. In this study, a new strategy consisting of two steps is proposed. The first step is to use an unsupervised fuzzy k-means clustering to detect the concealed weapon from the IR image. The detected region is embedded in the visual image in the second step and this process is implemented with a multiresolution mosaic technique. Therefore, the synthesized image retains the quality comparable to the visual image while the region of the concealed weapon is highlighted and enhanced. The experimental results indicate the efficiency of the proposed approach.This material is based on part of the work carried out at the SPCR laboratory of Lehigh University and the work is partially supported by the U. S. Army Research Office under grant number DAAD19-00-1-0431. The content of the information does not necessarily reflect the position or the policy of the federal government, and no official endorsement should be inferred. 相似文献
23.
Sheng-Guo Wang Author Vitae 《Automatica》2003,39(3):525-532
This paper presents a general analysis of robust pole clustering in a good ride quality region (GRQR) of aircraft for matrices with structured uncertainties. This region is an intersection of a ring and a horizontal strip, located in the left half-plane, which is a specific non-Ω-transformable region providing good ride quality of aircraft. The paper applies the Rayleigh principle along the norm theory to analyze robust pole clustering within this region since the generalized Lyapunov theory is not valid for non-Ω-transformable regions. Concerned uncertainties are structured/parametric uncertainties, including interval matrices. The results are useful for robust control analysis and design, especially, of robust good ride quality of aircraft, shuttles, vehicles and space station, as well as some industrial systems. An example of the F-16 dynamics for which GRQR is suitable is included to illustrate the results. 相似文献
24.
近些年,机器人技术得到了迅猛的发展,应用越来越广泛.随着机器人技术的推广和普及,对机器人使用的要求也越来越高,其中对智能机器人的要求尤显迫切.机器视觉是智能机器人研究领域的一个重要研究方向.在机器人视觉系统中,核心问题是目标提取,对目标实时、准确、快速提取的关键技术是图像分割.由于机器人感知的环境的复杂性及目标的多样性,往往导致机器人感知获得的图像数据量较大且图像本身存在不可预知的复杂性,这就对准确的目标分割和提取处理提出了挑战性问题.本文针对高分辨率图像数据集的分割处理,提出一种新的聚类算法,即根据数据点能量和的大小识别类代表点和类成员点,通过数据点间的竞争识别出最有能力成为簇成员的数据点,并将其与mean shift聚类算法有效地结合应用于彩色图像分割问题中,能够快速高效地实现高分辨率图像的目标分割,并得到较好的图像分割效果.实验结果表明,本文算法在分割效果和分割效率上明显优于传统聚类算法. 相似文献
25.
针对移动无线传感器网络设计一种不依赖于节点地理位置的基于移动汇聚节点(Sink)的数据收集算法(Mobile Sink-based Data Gathering,MSDG)。该算法解决了无线传感器网络中多跳路由通信时出现能量空洞的"热点"问题。Sink沿途以最近的固定节点作为根节点动态构建路由树。簇内移动节点感知的数据经簇头进行数据融合计算,然后将融合后的数据沿路由树反向逐跳转发给Sink。仿真结果表明,MSDG在节点的平均能耗和网络生存时间等方面的性能远超过LEACH、ACE-L等数据收集协议。 相似文献
26.
OLAM(On-line Analytical Mining)是当前的热点技术,是融合了联机分析处理(OLAP)和数据挖掘(Data Mining)的一种新的数据挖掘技术。本文主要研究数据仓库中OLAP,On-line Analytical Processing和数据挖掘技术,这两个技术是商业智能中的核心技术和主要内容,在两者的基础上引入OLAM的概念,并阐述其基本原理和核心技术。基于微软的SQL Server平台,为一个商业案例建立数据仓库,利用Analysis Services服务,建立销售分析的多维数据集,利用OLAM的基本模型实现OLAP和聚类挖掘技术的结合,借助两者的各自优势,得到很好的客户聚类分析结果。 相似文献
27.
当前混合属性数据发布中隐私保护方法大多存在隐私保护效果不佳或数据效用较差的问题,采用差分隐私与优化的k-prototype聚类方法相结合,提出改进k-prototype聚类的差分隐私混合属性数据发布方法(DCKPDP)。为解决传统k-prototype聚类算法没有考虑不同数值型属性对聚类结果有较大影响的问题,利用信息熵为每个数值型属性添加属性权重;为解决聚类初始中心点人为规定或者由随机算法随机确定,导致聚类结果精确度不高的问题,结合数据对象的局部密度和高密度对聚类过程中初始中心点进行自适应选择;为解决数据信息泄露风险较高的问题,对聚类中心值进行差分隐私保护。实验结果表明,DCKPDP算法满足差分隐私保护所需的噪声量更小,数据的可用性更好。 相似文献
28.
Aman Singh Jaydip Chandrakant Mehta Divya Anand Pinku Nath Babita Pandey Aditya Khamparia 《Expert Systems》2021,38(1)
In real world, the automatic detection of liver disease is a challenging problem among medical practitioners. The intent of this work is to propose an intelligent hybrid approach for the diagnosis of hepatitis disease. The diagnosis is performed with the combination of k‐means clustering and improved ensemble‐driven learning. To avoid clinical experience and to reduce the evaluation time, ensemble learning is deployed, which constructs a set of hypotheses by using multiple learners to solve a liver disease problem. The performance analysis of the proposed integrated hybrid system is compared in terms of accuracy, true positive rate, precision, f‐measure, kappa statistic, mean absolute error, and root mean squared error. Simulation results showed that the enhanced k‐means clustering and improved ensemble learning with enhanced adaptive boosting, bagged decision tree, and J48 decision tree‐based intelligent hybrid approach achieved better prediction outcomes than other existing individual and integrated methods. 相似文献
29.
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. 相似文献
30.