全文获取类型
收费全文 | 7769篇 |
免费 | 1471篇 |
国内免费 | 1088篇 |
专业分类
电工技术 | 467篇 |
综合类 | 1062篇 |
化学工业 | 81篇 |
金属工艺 | 83篇 |
机械仪表 | 537篇 |
建筑科学 | 169篇 |
矿业工程 | 82篇 |
能源动力 | 39篇 |
轻工业 | 52篇 |
水利工程 | 77篇 |
石油天然气 | 63篇 |
武器工业 | 90篇 |
无线电 | 1234篇 |
一般工业技术 | 336篇 |
冶金工业 | 434篇 |
原子能技术 | 29篇 |
自动化技术 | 5493篇 |
出版年
2024年 | 66篇 |
2023年 | 233篇 |
2022年 | 359篇 |
2021年 | 332篇 |
2020年 | 265篇 |
2019年 | 207篇 |
2018年 | 150篇 |
2017年 | 206篇 |
2016年 | 224篇 |
2015年 | 235篇 |
2014年 | 343篇 |
2013年 | 318篇 |
2012年 | 449篇 |
2011年 | 536篇 |
2010年 | 454篇 |
2009年 | 443篇 |
2008年 | 542篇 |
2007年 | 641篇 |
2006年 | 576篇 |
2005年 | 542篇 |
2004年 | 488篇 |
2003年 | 478篇 |
2002年 | 480篇 |
2001年 | 401篇 |
2000年 | 355篇 |
1999年 | 241篇 |
1998年 | 176篇 |
1997年 | 142篇 |
1996年 | 96篇 |
1995年 | 67篇 |
1994年 | 77篇 |
1993年 | 46篇 |
1992年 | 29篇 |
1991年 | 26篇 |
1990年 | 18篇 |
1989年 | 14篇 |
1988年 | 13篇 |
1987年 | 7篇 |
1986年 | 7篇 |
1985年 | 10篇 |
1984年 | 12篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1979年 | 2篇 |
1964年 | 2篇 |
1963年 | 2篇 |
1957年 | 2篇 |
1956年 | 2篇 |
1955年 | 1篇 |
1954年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 10 毫秒
41.
Guoqiang Gao Ruixuan Li Kunmei Wen Xiwu Gu 《Journal of Network and Computer Applications》2012,35(1):85-96
Unstructured peer-to-peer (P2P) networks have become a very popular architecture for content distribution in large-scale and dynamic environments. The search efficiency problem in unstructured P2P networks has not been adequately addressed so far, especially concerning search for rare objects. In this paper, we propose a proactive replication strategy to improve search efficiency for rare objects. It uses an object-probing technique for peers to decide whether or not to establish replications for their objects when they join the network. This strategy can effectively increase the popularity of rare objects in order to enhance search efficiency. We also present a rare object search algorithm to reduce the overhead caused by the replication strategy. When a peer forwards a search request, the forward probability is calculated according to its neighbors' degrees and the number of neighbors' objects. Therefore, the search request is forwarded to the peers more likely containing target objects. Simulations show that our proactive replication strategy greatly improves search efficiency for rare objects with moderate communication overhead. The rare object search algorithm not only improves search efficiency for rare objects, but also achieves load balance in search. 相似文献
42.
何天淳 《昆明理工大学学报(自然科学版)》1992,(2)
若视加气砼为细观的“两相”材料,则可建立起其细观几何结构的随机直观数理模型,本文应用随机几何的方法探索了加气砼最佳合理内部细观几何结构模型的建立,及其计算机随机模拟,由细观角度讨论了改善加气砼性能的可能性。 相似文献
43.
红外弱小目标的匹配方法研究与仿真 总被引:1,自引:0,他引:1
研究红外图像中的目标匹配问题。针对传统的红外图像中目标匹配效果不理想,匹配不准确。当红外图像中是弱小目标时,背景灰度值与目标灰度值非常相近,灰度直方图均衡化无法实现目标与背景的完整分离,导致漏匹配率较高的问题。为提高目标的匹配精度,提出一种形态学预处理的红外目标匹配方法,通过形态学算法提取出图像中的形状信息,利用形状信息将红外图像中的目标与背景完整分离,避免了只依靠灰度图像信息造成的不能完整分离目标与背景带来的漏匹配问题。进行仿真的结果证明,采用的形态学与处理的匹配方法能够完整将目标与背景分离,成功完成目标匹配,取得了满意的结果。 相似文献
44.
提出一种基于改进YOLOv3算法的一类运动目标检测算法. 为进一步提高YOLOv3的检测精度,采用基于DIoU优化的边界框回归损失函数进行计算; 优化非极大值抑制,有效减少了目标框重叠的现象,提高检测精度; 针对运动目标检测,提出一种基于目标框多中心点位移的检测算法. 经UA-DETRAC数据集上的实验表明,改进后的算法在提高检测精度的同时保证了较快的速度,准确率和召回率相比原始YOLOv3分别提高了 8.07%和3.87%,对运动目标的检测速度可达20 fps/s,可满足实时检测的要求. 相似文献
45.
46.
47.
Ioannis Marras Georgios Tzimiropoulos Stefanos Zafeiriou Maja Pantic 《Image and vision computing》2014
We introduce a robust framework for learning and fusing of orientation appearance models based on both texture and depth information for rigid object tracking. Our framework fuses data obtained from a standard visual camera and dense depth maps obtained by low-cost consumer depth cameras such as the Kinect. To combine these two completely different modalities, we propose to use features that do not depend on the data representation: angles. More specifically, our framework combines image gradient orientations as extracted from intensity images with the directions of surface normals computed from dense depth fields. We propose to capture the correlations between the obtained orientation appearance models using a fusion approach motivated by the original Active Appearance Models (AAMs). To incorporate these features in a learning framework, we use a robust kernel based on the Euler representation of angles which does not require off-line training, and can be efficiently implemented online. The robustness of learning from orientation appearance models is presented both theoretically and experimentally in this work. This kernel enables us to cope with gross measurement errors, missing data as well as other typical problems such as illumination changes and occlusions. By combining the proposed models with a particle filter, the proposed framework was used for performing 2D plus 3D rigid object tracking, achieving robust performance in very difficult tracking scenarios including extreme pose variations. 相似文献
48.
49.
针对传动带上严重堆叠、形状尺寸不规则的棒材,提出基于模糊梯度卷积核的在线棒材断面中心识别方法.以标准圆边缘为中心环,结合棒材断面边缘点偏离中心环的程度定义一个模糊梯度卷积核;通过模糊梯度卷积核与实时棒材断面梯度图像的卷积操作,实现棒材断面中心的增强;依次执行候选点选取、局部峰值抑制、距离检测步骤确定中心位置.实验结果表明,该方法能有效抑制棒材中心增强过程中易产生的峰值扩散现象,减少误识别和漏识别;平均计算时间为8.3 ms,满足系统实时性要求. 相似文献
50.
Symmetry is a common characteristic in natural and man‐made objects. Its ubiquitous nature can be exploited to facilitate the analysis and processing of computational representations of real objects. In particular, in computer graphics, the detection of symmetries in 3D geometry has enabled a number of applications in modeling and reconstruction. However, the problem of symmetry detection in incomplete geometry remains a challenging task. In this paper, we propose a vote‐based approach to detect symmetry in 3D shapes, with special interest in models with large missing parts. Our algorithm generates a set of candidate symmetries by matching local maxima of a surface function based on the heat diffusion in local domains, which guarantee robustness to missing data. In order to deal with local perturbations, we propose a multi‐scale surface function that is useful to select a set of distinctive points over which the approximate symmetries are defined. In addition, we introduce a vote‐based scheme that is aware of the partiality, and therefore reduces the number of false positive votes for the candidate symmetries. We show the effectiveness of our method in a varied set of 3D shapes and different levels of partiality. Furthermore, we show the applicability of our algorithm in the repair and completion of challenging reassembled objects in the context of cultural heritage. 相似文献