全文获取类型
收费全文 | 14729篇 |
免费 | 1585篇 |
国内免费 | 899篇 |
专业分类
电工技术 | 1041篇 |
综合类 | 854篇 |
化学工业 | 2275篇 |
金属工艺 | 1102篇 |
机械仪表 | 859篇 |
建筑科学 | 1217篇 |
矿业工程 | 538篇 |
能源动力 | 387篇 |
轻工业 | 847篇 |
水利工程 | 288篇 |
石油天然气 | 1080篇 |
武器工业 | 129篇 |
无线电 | 1905篇 |
一般工业技术 | 1651篇 |
冶金工业 | 657篇 |
原子能技术 | 185篇 |
自动化技术 | 2198篇 |
出版年
2024年 | 121篇 |
2023年 | 310篇 |
2022年 | 660篇 |
2021年 | 840篇 |
2020年 | 605篇 |
2019年 | 523篇 |
2018年 | 493篇 |
2017年 | 565篇 |
2016年 | 508篇 |
2015年 | 735篇 |
2014年 | 821篇 |
2013年 | 955篇 |
2012年 | 1019篇 |
2011年 | 1087篇 |
2010年 | 935篇 |
2009年 | 874篇 |
2008年 | 757篇 |
2007年 | 763篇 |
2006年 | 792篇 |
2005年 | 653篇 |
2004年 | 430篇 |
2003年 | 357篇 |
2002年 | 317篇 |
2001年 | 260篇 |
2000年 | 276篇 |
1999年 | 327篇 |
1998年 | 263篇 |
1997年 | 189篇 |
1996年 | 185篇 |
1995年 | 144篇 |
1994年 | 119篇 |
1993年 | 80篇 |
1992年 | 61篇 |
1991年 | 48篇 |
1990年 | 33篇 |
1989年 | 33篇 |
1988年 | 17篇 |
1987年 | 13篇 |
1986年 | 13篇 |
1985年 | 11篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1981年 | 1篇 |
1980年 | 6篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1965年 | 1篇 |
1959年 | 1篇 |
1951年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
42.
NASA系列算法(Chang,NASA96和Foster算法)是被动微波遥感反演雪深、雪水当量的简单、实用的经验算法,并经过了很多学者大范围的算法验证和改进。为了进一步评价NASA系列算法在东北地区的时空适用性,于长春净月潭区域选定了一个以农田和森林为主的10km×10km被动微波遥感混合像元,在时间上连续观测整个干雪期(2014年12月至次年2月)的积雪参数和气象数据,结合FY3B卫星搭载的微波成像仪(MWRI)亮温数据,对NASA系列算法精度进行了评价分析。结果表明:对于雪深的反演,Chang算法和NASA 96算法前期反演效果较好,后期随着时间的推进高估雪深的趋势愈加明显。由于考虑了森林覆盖率的影响,NASA 96算法的反演精度更高。两种算法最大高估值分别是24.46和14.62cm,这是因为期间雪性质不断变化,尤其是雪粒径不断增大的缘故。Foster算法也严重高估了雪水当量,可能是由于积雪类型的分类系统未必适合于东北地区的积雪特征。本文的积雪连续观测数据为认识东北地区的积雪特性奠定了基础,对算法的时间序列验证与分析为雪参数反演算法的进一步改进提供了可靠依据。 相似文献
43.
With the advent of the powerful editing software and sophisticated digital cameras, it is now possible to manipulate images. Copy-move is one of the most common methods for image manipulation. Several methods have been proposed to detect and locate the tampered regions, while many methods failed when the copied region undergone some geometric transformations before being pasted, because of the de-synchronization in the searching procedure. This paper presents an efficient technique for detecting the copy-move forgery under geometric transforms. Firstly, the forged image is divided into overlapping circular blocks, and Polar Complex Exponential Transform (PCET) is employed to each block to extract the invariant features, thus, the PCET kernels represent each block. Secondly, the Approximate Nearest Neighbor (ANN) Searching Problem is used for identifying the potential similar blocks by means of locality sensitive hashing (LSH). In order to make the algorithm more robust, morphological operations are applied to remove the wrong similar blocks. Experimental results show that our proposed technique is robust to geometric transformations with low computational complexity. 相似文献
44.
In quantum key distribution (QKD), the information theoretically secure authentication is necessary to guarantee the integrity and authenticity of the exchanged information over the classical channel. In order to reduce the key consumption, the authentication scheme with key recycling (KR), in which a secret but fixed hash function is used for multiple messages while each tag is encrypted with a one-time pad (OTP), is preferred in QKD. Based on the assumption that the OTP key is perfect, the security of the authentication scheme has be proved. However, the OTP key of authentication in a practical QKD system is not perfect. How the imperfect OTP affects the security of authentication scheme with KR is analyzed thoroughly in this paper. In a practical QKD, the information of the OTP key resulting from QKD is partially leaked to the adversary. Although the information leakage is usually so little to be neglected, it will lead to the increasing degraded security of the authentication scheme as the system runs continuously. Both our theoretical analysis and simulation results demonstrate that the security level of authentication scheme with KR, mainly indicated by its substitution probability, degrades exponentially in the number of rounds and gradually diminishes to zero. 相似文献
45.
In this work, we have put forth two different protocols to address a concrete secure multi-party computational (MPC) problem related to a triangle, of which the coordinates of the three vertices are confidentially kept by the three participants, respectively. The three parties wish to collaboratively compute the area of this triangle while preserving their own coordinate privacy. As one of the merits, our protocols employ weaker assumptions of the existence of pseudorandom generators. In particular, unlike massive secure MPC protocols that rely a lot on oblivious transfer, ours utilize a new computing idea called “pseudorandom-then-rounding” method to avoid this burdensome obstacle. The two protocols are based on different theorems, while they both make use of the same underlying idea. At last, we provide a detailed proof for the first protocol by a series of security reductions of our newly defined games, which seems somewhat stronger than the previous simulation-based proofs and a proof sketch for the second one. Analysis and discussion about the reasons are provided as well to round off our work. 相似文献
46.
Qian?LiEmail author Wenjia?Niu Gang?Li Endong?Tong Yue?Hu Ping?Liu Li?Guo 《Journal of Network and Systems Management》2015,23(3):474-501
With the motivation of seamlessly extending wireless sensor networks to the external environment, service-oriented architecture comes up as a promising solution. However, as sensor nodes are failure prone, this consequently renders the whole wireless sensor network to seriously faulty. When a particular node is faulty, the service on it should be migrated into those substitute sensor nodes that are in a normal status. Currently, two kinds of approaches exist to identify the substitute sensor nodes: the most common approach is to prepare redundancy nodes, though the involved tasks such as maintaining redundancy nodes, i.e., relocating the new node, lead to an extra burden on the wireless sensor networks. More recently, other approaches without using redundancy nodes are emerging, and they merely select the substitute nodes in a sensor node’s perspective i.e., migrating the service of faulty node to it’s nearest sensor node, though usually neglecting the requirements of the application level. Even a few work consider the need of the application level, they perform at packets granularity and don’t fit well at service granularity. In this paper, we aim to remove these limitations in the wireless sensor network with the service-oriented architecture. Instead of deploying redundancy nodes, the proposed mechanism replaces the faulty sensor node with consideration of the similarity on the application level, as well as on the sensor level. On the application level, we apply the Bloom Filter for its high efficiency and low space costs. While on the sensor level, we design an objective solution via the coefficient of a variation as an evaluation for choosing the substitute on the sensor level. 相似文献
47.
硫熏强度是亚法糖厂澄清工段的关键工艺参数之一;硫熏强度过低会影响澄清效果,过高会造成成品糖二氧化硫残留过高;目前由于缺乏合适的硫熏强度在线测量装置,该参数主要采用人工取样和离线化验的检测方式,化验滞后时间较长,难以根据该指标及时指导实际生产的问题;为此文章采用极限学习机(ELLM)方法建立了硫熏强度软测量模型,并与基于支持向量机(SVM)、径向基函数(RBF)神经网络和反向传播(BP)神经网络的硫熏强度软测量模型进行对比分析;结果显示,基于ELM的硫熏强度软测量模型具有训练收敛速度快、模型精度高和泛化性能好等优点,可以满足实际糖厂澄清工段的要求. 相似文献
48.
在数据采集系统中,按需采集是平衡数据数量、提高数据质量的有效手段。本文所提出的自适应数据采集算法是基于有限采样点的一元线性回归拟合,通过实时地对采集到的数据进行分析,不断修正采样周期,使得采样周期能够快速、准确地适应被测对象的动态变化。MATLAB软件仿真表明,本方法对于被测量加速变化具有较强的动态捕捉能力,能够在降低平均采样频率的前提下减小采样失真度,且与同类方法相比失真度低,稳定性高,是测控系统中实时数据采集的一种较好的代替方案。 相似文献
49.
严霄凤 《网络安全技术与应用》2013,(2):51-54,47
蓝牙是一种短距离射频(RF)通信开放标准。蓝牙技术主要用于建立无线个人局域网(WPAN),并已被集成到多种类型的企业和消费者电子设备。本文介绍了蓝牙的技术特点、安全功能、存在的脆弱性和面临的威胁,并给出了蓝牙安全风险缓解对策建议。 相似文献
50.