全文获取类型
收费全文 | 427篇 |
免费 | 162篇 |
国内免费 | 162篇 |
专业分类
电工技术 | 21篇 |
综合类 | 55篇 |
化学工业 | 9篇 |
金属工艺 | 5篇 |
机械仪表 | 17篇 |
矿业工程 | 3篇 |
能源动力 | 3篇 |
轻工业 | 6篇 |
水利工程 | 4篇 |
石油天然气 | 5篇 |
武器工业 | 2篇 |
无线电 | 71篇 |
一般工业技术 | 25篇 |
冶金工业 | 10篇 |
原子能技术 | 1篇 |
自动化技术 | 514篇 |
出版年
2024年 | 3篇 |
2023年 | 58篇 |
2022年 | 96篇 |
2021年 | 85篇 |
2020年 | 64篇 |
2019年 | 25篇 |
2018年 | 26篇 |
2017年 | 16篇 |
2016年 | 26篇 |
2015年 | 22篇 |
2014年 | 11篇 |
2013年 | 30篇 |
2012年 | 24篇 |
2011年 | 28篇 |
2010年 | 17篇 |
2009年 | 31篇 |
2008年 | 24篇 |
2007年 | 29篇 |
2006年 | 28篇 |
2005年 | 18篇 |
2004年 | 20篇 |
2003年 | 6篇 |
2002年 | 8篇 |
2001年 | 8篇 |
2000年 | 10篇 |
1999年 | 6篇 |
1998年 | 6篇 |
1997年 | 1篇 |
1996年 | 7篇 |
1995年 | 1篇 |
1994年 | 4篇 |
1993年 | 2篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1982年 | 1篇 |
1979年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有751条查询结果,搜索用时 15 毫秒
1.
以往建立在模糊C均值(fuzzyC-means, FCM)框架下利用源域虚拟簇中心作为迁移知识的迁移聚类算法容易受到离群点和噪声的干扰,且单个簇中心不足以描述簇结构。针对此问题,提出多代表点自约束的模糊迁移聚类算法,该算法引入样本代表权重机制为簇中每个样本分配代表权重来刻画簇结构,这种机制能更好的刻画簇结构,对离群点和噪声有较好的抑制作用;同时利用源域样本,重构目标域簇结构,并以此作为迁移知识进行目标域样本聚类,相对于利用单中心作为迁移知识来说,整体重构后的目标域簇结构所包含的迁移知识量更为丰富。试验结果表明。在人工数据集和真实数据集上,所提出的聚类算法相比对比算法, NMI和ARI最高提升了0.674 5和0.608 4。说明在迁移环境下,以代表点自约束作为知识迁移规则,所提出的聚类算法具有一定的聚类效果。 相似文献
2.
Farzaneh Khorasani Morteza Mohammadi Zanjireh Mahdi Bahaghighat Qin Xin 《计算机系统科学与工程》2022,40(3):1085-1098
With a sharp increase in the information volume, analyzing and retrieving this vast data volume is much more essential than ever. One of the main techniques that would be beneficial in this regard is called the Clustering method. Clustering aims to classify objects so that all objects within a cluster have similar features while other objects in different clusters are as distinct as possible. One of the most widely used clustering algorithms with the well and approved performance in different applications is the k-means algorithm. The main problem of the k-means algorithm is its performance which can be directly affected by the selection in the primary clusters. Lack of attention to this crucial issue has consequences such as creating empty clusters and decreasing the convergence time. Besides, the selection of appropriate initial seeds can reduce the cluster’s inconsistency. In this paper, we present a new method to determine the initial seeds of the k-mean algorithm to improve the accuracy and decrease the number of iterations of the algorithm. For this purpose, a new method is proposed considering the average distance between objects to determine the initial seeds. Our method attempts to provide a proper tradeoff between the accuracy and speed of the clustering algorithm. The experimental results showed that our proposed approach outperforms the Chithra with 1.7% and 2.1% in terms of clustering accuracy for Wine and Abalone detection data, respectively. Furthermore, achieved results indicate that comparing with the Reverse Nearest Neighbor (RNN) search approach, the proposed method has a higher convergence speed. 相似文献
3.
变分自编码器(VAE)作为深度隐空间生成模型的一种,近年来其表现性能取得了极大的成功,尤其是在图像生成方面。变分自编码器模型作为无监督式特征学习的重要工具之一,可以通过学习隐编码空间与数据生成空间的特征映射,进而在输出端重构生成输入数据。梳理了传统变分自编码器模型及其衍生变体模型的发展与研究现状,并就此做了总结和对比,最后分析了变分自编码器模型存在的问题与挑战,并就可能的发展趋势做了展望。 相似文献
4.
In this paper we present a CNN based approach for a real time 3D-hand pose estimation from the depth sequence. Prior discriminative approaches have achieved remarkable success but are facing two main challenges: Firstly, the methods are fully supervised hence require large numbers of annotated training data to extract the dynamic information from a hand representation. Secondly, unreliable hand detectors based on strong assumptions or a weak detector which often fail in several situations like complex environment and multiple hands. In contrast to these methods, this paper presents an approach that can be considered as semi-supervised by performing predictive coding of image sequences of hand poses in order to capture latent features underlying a given image without supervision. The hand is modelled using a novel latent tree dependency model (LDTM) which transforms internal joint location to an explicit representation. Then the modeled hand topology is integrated with the pose estimator using data dependent method to jointly learn latent variables of the posterior pose appearance and the pose configuration respectively. Finally, an unsupervised error term which is a part of the recurrent architecture ensures smooth estimations of the final pose. Experiments on three challenging public datasets, ICVL, MSRA, and NYU demonstrate the significant performance of the proposed method which is comparable or better than state-of-the-art approaches. 相似文献
5.
6.
7.
在有色冶炼领域,元素成分检测是保证冶炼质量的重要一环。目前国内有色冶炼企业多采用X射线荧光光谱法进行检测,该方法需要样品制备,造成冶炼状态无法实时反馈,严重影响冶炼过程优化。研究了无监督数据挖掘算法辅助激光诱导击穿光谱技术用于铜冶炼光谱结构解析。实验中,首先选择4种铜冶炼物料作为实验样品,然后利用激光诱导击穿光谱技术(LIBS)激发样品获得18750个光谱数据,通过盲源分离技术对所有光谱进行分析,最终提取得到3个特征光谱。进一步研究发现,3个特征光谱与Cu、Fe、Ca元素光谱有一一对应关系。在此基础上,提出了LIBS光谱的定量化评价指标,量化结果表明分解模型对18750个光谱都能达到很高的评分,说明铜冶炼光谱能够良好地被3个特征光谱重构,即铜冶炼光谱存在显著的光谱结构。以上结论在实际应用中具有重要研究价值,可用于光谱快速评价、异常光谱剔除、光谱信号提纯、元素谱线选取、样品定性/半定量分析等,为LIBS技术应用于在线铜冶炼成分分析奠定基础。 相似文献
8.
9.
10.
Alberto Castellini Manuele Bicego Domenico Bloisi Jason Blum Francesco Masillo Sergio Peignier 《控制论与系统》2019,50(8):658-671
AbstractIn this paper, we propose the use of subspace clustering to detect the states of dynamical systems from sequences of observations. In particular, we generate sparse and interpretable models that relate the states of aquatic drones involved in autonomous water monitoring to the properties (e.g., statistical distribution) of data collected by drone sensors. The subspace clustering algorithm used is called SubCMedians. A quantitative experimental analysis is performed to investigate the connections between i) learning parameters and performance, ii) noise in the data and performance. The clustering obtained with this analysis outperforms those generated by previous approaches. 相似文献