全文获取类型
收费全文 | 574篇 |
免费 | 149篇 |
国内免费 | 199篇 |
专业分类
电工技术 | 14篇 |
综合类 | 59篇 |
化学工业 | 2篇 |
机械仪表 | 2篇 |
建筑科学 | 3篇 |
矿业工程 | 1篇 |
能源动力 | 1篇 |
轻工业 | 4篇 |
水利工程 | 1篇 |
石油天然气 | 1篇 |
武器工业 | 1篇 |
无线电 | 165篇 |
一般工业技术 | 13篇 |
冶金工业 | 1篇 |
自动化技术 | 654篇 |
出版年
2024年 | 1篇 |
2023年 | 23篇 |
2022年 | 31篇 |
2021年 | 28篇 |
2020年 | 35篇 |
2019年 | 27篇 |
2018年 | 22篇 |
2017年 | 20篇 |
2016年 | 27篇 |
2015年 | 17篇 |
2014年 | 45篇 |
2013年 | 66篇 |
2012年 | 61篇 |
2011年 | 58篇 |
2010年 | 61篇 |
2009年 | 59篇 |
2008年 | 76篇 |
2007年 | 72篇 |
2006年 | 52篇 |
2005年 | 36篇 |
2004年 | 20篇 |
2003年 | 20篇 |
2002年 | 13篇 |
2001年 | 9篇 |
2000年 | 10篇 |
1999年 | 5篇 |
1998年 | 6篇 |
1997年 | 6篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 3篇 |
1990年 | 3篇 |
1987年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1982年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有922条查询结果,搜索用时 155 毫秒
1.
A sketch-based data plane hardware model for software-defined measurement was introduced,and it was implemented in the programmable network device NetMagic.A generic sketch model for collecting flow-level data using high-speed memories on the FPGA was proposed,the control plane collected and cached the data for further process.Count-min sketch and 2-universal hash functions in the SRAM of FPGA for real-time traffic counting of high-speed traffic were implemented; Bloom filter was used to rebuild the original 5-tuple data which solved the irreversibility of sketch.The CERNET backbone trace to evaluate the prototype system was used,the result shows that it has the ability to use the limited hardware resource to measure a large amount of network traffic data with a proper measurement accuracy at the same time. 相似文献
2.
Chi Zhang Jun-Rong Liu Da-Wu Gu Wei-Jia Wang Xiang-Jun Lu Zheng Guo Hai-Ning Lu 《计算机科学技术学报》2019,34(5):1079-1095
Time-division multiple access (TDMA) and code-division multiple access (CDMA) are two technologies used in digital cellular networks. The authentication protocols of TDMA networks have been proven to be vulnerable to side-channel analysis (SCA), giving rise to a series of powerful SCA-based attacks against unprotected subscriber identity module (SIM) cards. CDMA networks have two authentication protocols, cellular authentication and voice encryption (CAVE) based authentication protocol and authentication and key agreement (AKA) based authentication protocol, which are used in different phases of the networks. However, there has been no SCA attack for these two protocols so far. In this paper, in order to figure out if the authentication protocols of CDMA networks are sufficiently secure against SCA, we investigate the two existing protocols and their cryptographic algorithms. We find the side-channel weaknesses of the two protocols when they are implemented on embedded systems. Based on these weaknesses, we propose specific attack strategies to recover their authentication keys for the two protocols, respectively. We verify our strategies on an 8-bit microcontroller and a real-world SIM card, showing that the authentication keys can be fully recovered within a few minutes with a limited number of power measurements. The successful experiments demonstrate the correctness and the effectiveness of our proposed strategies and prove that the unprotected implementations of the authentication protocols of CDMA networks cannot resist SCA. 相似文献
3.
目的 对于生物密钥而言,生物特征数据的安全与生物密钥的管理存储都很关键。为了构造能够应用在通信数据传输场景的生物密钥,同时保证生物特征本身的模糊性与密码学的精确性处于一种相对平衡状态,提出一种基于时间戳与指纹密钥的数据加解密传输方案。方法 利用发送方指纹特征点之间的相对信息,与保密随机矩阵生成发送方指纹密钥;借助通信双方的预先设定数与时间戳,生成接收方恢复指纹密钥时所需的辅助信息;利用发送方指纹密钥加密数据,实现密文数据的传输。结果 本文方法在仿真通信双方数据加解密的实现中,测试再生指纹密钥的识别率(GAR)与误识率(FAR)。通过实验数据分析,表明了本文提出的指纹密钥生成方法的可用性,以及指纹密钥作为数字身份所具备的可认证性,其中真实发送方的再生指纹密钥识别率可高达99.8%,并且本方案还可用于即时通信、对称加密等多种场景当中。结论 本文方法利用时间戳确定了通信事件的唯一性与不可否认性,同时实现了指纹密钥恢复时的"一次一密"。此外,方案通过保密随机矩阵实现了发送方指纹密钥的可撤销,极大程度保障了指纹数据的安全性。 相似文献
4.
5.
Non‐cryptographic hash functions (NCHFs) have an immense number of applications, ranging from compilers and databases to videogames and computer networks. Some of the most important NCHF have been used by major corporations in commercial products. This practical success demonstrates the ability of hashing systems to provide extremely efficient searches over unsorted sets. However, very little research has been devoted to the experimental evaluation of these functions. Therefore, we evaluated the most widely used NCHF using four criteria as follows: collision resistance, distribution of outputs, avalanche effect, and speed. We identified their strengths and weaknesses and found significant flaws in some cases. We also discuss our conclusions regarding general hashing considerations such as selection of the compression map. Our results should assist practitioners and engineers in making more informed choices regarding which function to use for a particular problem. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
6.
7.
针对在交易数据库中挖掘出指定顾客相关属性的频繁项集这一问题,提出了基于维约束进行求解的构想.采用模式增长的挖掘方法,但与传统的模式树不同的是将原先每一节点频繁计数值设为在所有可能的谓词约束下该项的计数形成的向量,并利用HASH表进行向量值及项所在层的位置映射,因此,在不同的约束组合下的频繁项集挖掘将不再需要扫描数据库.仿真实验表明该挖掘算法的完备性,通过与先筛选再挖掘的算法进行比较,证明该挖掘算法具有更高的效率. 相似文献
8.
提出一种流水线结构的硬件实现策略,同时采用CSA加法器进行关键路径压缩,极大地提高了工作频率和算法的计算速率.在191 M Hz时钟频率下,实现了73.54 Gb/s的高吞吐率. 相似文献
9.
Boris Škori? Chibuzo ObiEvgeny Verbitskiy Berry Schoenmakers 《Information and Computation》2011,209(8):1184-1196
Extraction of uniform randomness from (noisy) non-uniform sources is an important primitive in many security applications, e.g. (pseudo-)random number generators, privacy-preserving biometrics, and key storage based on Physical Unclonable Functions. Generic extraction methods exist, using universal hash functions. There is a trade-off between the length of the extracted bit string and the uniformity of the string. In the literature there are proven lower bounds on this length as a function of the desired uniformity. The best known bound involves a quantity known as smooth min-entropy. Unfortunately, there exist at least three definitions of smooth entropy. In this paper we compare three of these definitions, and we derive improved lower bounds on the extractable randomness.We also investigate the use of almost universal hash functions, which are slightly worse at extracting randomness than universal hash functions, but are preferable in practice because they require far less resources in devices. We show that using them has negligible effect on the extractable randomness. 相似文献
10.
高吞吐率、低能耗的SHA-1加密算法的硬件实现 总被引:2,自引:1,他引:1
安全散列算法被广泛应用于数据完整性验证、数字签名等领域,目前最常用的是SHA-1算法.为了满足实际应用对SHA-1计算速度和能耗的要求,提出了一种新的硬件实现方法,通过改变迭代结构,一次执行两轮操作,将80轮操作简化为40轮,进而大幅度提高SHA-1的吞吐率,并降低能耗.采用UMC0.25μm工艺实现该电路,相比于传统的实现方法,最大吞吐率提高了31%,能耗降低了20%. 相似文献