全文获取类型
收费全文 | 14655篇 |
免费 | 2397篇 |
国内免费 | 1752篇 |
专业分类
电工技术 | 1161篇 |
综合类 | 1655篇 |
化学工业 | 266篇 |
金属工艺 | 125篇 |
机械仪表 | 522篇 |
建筑科学 | 239篇 |
矿业工程 | 134篇 |
能源动力 | 90篇 |
轻工业 | 85篇 |
水利工程 | 64篇 |
石油天然气 | 61篇 |
武器工业 | 286篇 |
无线电 | 4096篇 |
一般工业技术 | 348篇 |
冶金工业 | 85篇 |
原子能技术 | 36篇 |
自动化技术 | 9551篇 |
出版年
2024年 | 20篇 |
2023年 | 177篇 |
2022年 | 308篇 |
2021年 | 346篇 |
2020年 | 367篇 |
2019年 | 298篇 |
2018年 | 321篇 |
2017年 | 397篇 |
2016年 | 405篇 |
2015年 | 597篇 |
2014年 | 1028篇 |
2013年 | 961篇 |
2012年 | 1324篇 |
2011年 | 1441篇 |
2010年 | 1232篇 |
2009年 | 1154篇 |
2008年 | 1307篇 |
2007年 | 1524篇 |
2006年 | 1129篇 |
2005年 | 1086篇 |
2004年 | 820篇 |
2003年 | 726篇 |
2002年 | 503篇 |
2001年 | 365篇 |
2000年 | 270篇 |
1999年 | 192篇 |
1998年 | 109篇 |
1997年 | 85篇 |
1996年 | 71篇 |
1995年 | 72篇 |
1994年 | 39篇 |
1993年 | 39篇 |
1992年 | 28篇 |
1991年 | 14篇 |
1990年 | 12篇 |
1989年 | 8篇 |
1988年 | 7篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
在传统密码学应用中,人们总假定终端是安全的,并且敌手只存在于通信信道上。然而,主流的恶意软件和系统漏洞给终端安全带来了严重和直接的威胁和挑战,例如容易遭受存储内容被病毒破坏、随机数发生器被腐化等各种攻击。更糟糕的是,协议会话通常有较长的生存期,因此需要在较长的时间内存储与会话相关的秘密信息。在这种情况下,有必要设计高强度的安全协议,以对抗可以暴露存储内容和中间计算结果(包括随机数)的敌手。棘轮密钥交换是解决这一问题的一个基本工具。文中综述了密码本原——棘轮密钥交换,包括单向、半双向和双向等棘轮密钥交换的定义、模型及构造,并展望了棘轮密钥交换的未来发展趋势。 相似文献
2.
3.
《International Journal of Hydrogen Energy》2022,47(56):23762-23771
Limiting current density at different temperatures, backpressures, and balance gases can be used to separate molecular diffusion resistance, Knudsen diffusion resistance and local transport resistance of membrane electrode assembly (MEA). However, the measurement of limiting current density has no unified protocol. The diverse choices in the literature, either in the control of current or voltage or in the atmosphere like relative humidity and O2 concentrations, make it difficult to compare the results and identify the true bottleneck hindering the mass transport. In this work, the current-voltage curves obtained by current scanning/stepping and voltage scanning/stepping methods under dilute O2 of different concentrations and a wide range of relative humidity were measured and analyzed systematically. It is found that the voltage stepping method is superior to the other three ways of control for the reliable determination of the limiting current density. Aided with simultaneous electrochemical impedance spectroscopy measurement, the limiting current density can be determined with pinpoint accuracy. When the limiting current density is just used to qualitatively evaluate different MEA, the voltage scanning method can be used instead for its high time efficiency. The selection of the atmosphere also plays an important role in suppressing the distortion from excessive water and reducing the spurious contribution from proton conduction resistance. It is found that O2 concentrations at 0.5 vol% and relative humidity at 90% can give the best estimation of O2 transport resistance in membrane electrode assembly. 相似文献
4.
CRAFT is a tweakable block cipher introduced in 2019 that aims to provide strong protection against differential fault analysis. In this paper, we show that CRAFT is vulnerable to side-channel cube attacks. We apply side-channel cube attacks to CRAFT with the Hamming weight leakage assumption. We found that the first half of the secret key can be recovered from the Hamming weight leakage after the first round. Next, using the recovered key bits, we continue our attack to recover the second half of the secret key. We show that the set of equations that are solvable varies depending on the value of the key bits. Our result shows that 99.90% of the key space can be fully recovered within a practical time. 相似文献
5.
Keystroke dynamics is a viable behavioral biometric technique for identity verification based on users’ keyboard interaction traits. Keystroke dynamics can help prevent credentials from being abused in case of theft or leakage. But what happens if the keystroke events are eavesdropped and being replayed? Attackers that intercept keystroke dynamics authentication sessions of benign users can easily replay them from other sources unchanged or with minor changes and gain illegitimate privileges. Hence, even with its major security advantages, keystroke dynamics can still expose authentication mechanisms to replay attacks. Although replay attack is one of the oldest techniques to manipulate authentication systems, keystroke dynamics does not help preventing it. We suggest a new protocol for dynamics exchange based on choosing a subset of real and fake information snippets shared between the client and service providers to lure potential attackers. We evaluated our method on four state-of-the-art keystroke dynamics algorithms and three publicly available datasets and showed that we can dramatically reduce the possibility of replay attacks while preserving highly accurate user verification. 相似文献
6.
Rejab Hajlaoui Eesa Alsolami Tarek Moulahi Herv Guyennet 《International Journal of Communication Systems》2019,32(12)
Recently, the routing problem in vehicular ad hoc networks is one of the most vital research. Despite the variety of the proposed approaches and the development of communications technologies, the routing problem in VANET suffers from the high speed of vehicles and the repetitive failures in communications. In this paper, we adjusted the well‐known K‐medoids clustering algorithm to improve the network stability and to increase the lifetime of all established links. First, the number of clusters and the initial cluster heads will not be selected randomly as usual, but based on mathematical formula considering the environment size and the available transmission ranges. Then the assignment of nodes to clusters in both k‐medoids phases will be carried out according to several metrics including direction, relative speed, and proximity. To the best of our knowledge, our proposed model is the first that introduces the new metric named “node disconnection frequency.” This metric prevents nodes with volatile and suspicious behavior to be elected as a new CH. This screening ensures that the new CH retains its property as long as possible and thus increases the network stability. Empirical results confirm that in addition to the convergence speed that characterizes our adjusted K‐medoids clustering algorithm (AKCA), the proposed model achieves more stability and robustness when compared with most recent approaches designed for the same objective. 相似文献
7.
无证书签名具有基于身份密码体制和传统公钥密码体制的优点,可解决复杂的公钥证书管理和密钥托管问题.Wu和Jing提出了一种强不可伪造的无证书签名方案,其安全性不依赖于理想的随机预言机.针对该方案的安全性,提出了两类伪造攻击.分析结果表明,该方案无法实现强不可伪造性,并在"malicious-but-passive"的密钥生成中心攻击下也是不安全的.为了提升该方案的安全性,设计了一个改进的无证书签名方案.在标准模型中证明了改进的方案对于适应性选择消息攻击是强不可伪造的,还能抵抗恶意的密钥生成中心攻击.此外,改进的方案具有较低的计算开销和较短的私钥长度,可应用于区块链、车联网、无线体域网等领域. 相似文献
8.
持续流是隐蔽的网络攻击过程中显现的一种重要特征,它不产生大量流量且在较长周期内有规律地发生,给传统的检测方法带来极大挑战。针对网络攻击的隐蔽性、单监测点的重负荷和信息有限的问题,提出全网络持续流检测方法。首先,设计一种概要数据结构,并将其部署在每个监测点;其次,当网络流到达监测点时,提取流的概要信息并更新概要数据结构的一位;然后,在测量周期结束时,主监测点将来自其他监测点的概要信息进行综合;最后,提出流持续性的近似估计,通过一些简单计算为每个流构建一个位向量,利用概率统计方法估计流持续性,使用修正后的持续性估计检测持续流。通过真实的网络流量进行实验,结果表明,与长持续时间流检测算法(TLF)相比,所提方法的准确性提高了50%,误报率和漏报率分别降低了22%和20%,说明全网络持续流检测方法能够有效监测高速网络流量。 相似文献
9.
10.
As the development of cloud computing and the convenience of wireless sensor netowrks, smart devices are widely used in daily life, but the security issues of the smart devices have not been well resolved. In this paper, we present a new NTRU-type public-key cryptosystem over the binary field. Specifically, the security of our scheme relies on the computational intractability of an unbalanced sparse polynomial ratio problem (DUSPR). Through theoretical analysis, we prove the correctness of our proposed cryptosystem. Furthermore, we implement our scheme using the NTL library, and conduct a group of experiments to evaluate the capabilities and consuming time of encryption and decryption. Our experiments result demonstrates that the NTRU-type public-key cryptosystem over the binary field is relatively practical and effective. 相似文献