全文获取类型
收费全文 | 3462篇 |
免费 | 501篇 |
国内免费 | 116篇 |
专业分类
化学 | 99篇 |
晶体学 | 4篇 |
力学 | 246篇 |
综合类 | 56篇 |
数学 | 548篇 |
物理学 | 641篇 |
无线电 | 2485篇 |
出版年
2024年 | 10篇 |
2023年 | 43篇 |
2022年 | 80篇 |
2021年 | 111篇 |
2020年 | 121篇 |
2019年 | 91篇 |
2018年 | 95篇 |
2017年 | 126篇 |
2016年 | 137篇 |
2015年 | 150篇 |
2014年 | 222篇 |
2013年 | 200篇 |
2012年 | 239篇 |
2011年 | 262篇 |
2010年 | 181篇 |
2009年 | 235篇 |
2008年 | 243篇 |
2007年 | 233篇 |
2006年 | 212篇 |
2005年 | 194篇 |
2004年 | 154篇 |
2003年 | 159篇 |
2002年 | 119篇 |
2001年 | 76篇 |
2000年 | 79篇 |
1999年 | 58篇 |
1998年 | 65篇 |
1997年 | 54篇 |
1996年 | 31篇 |
1995年 | 17篇 |
1994年 | 14篇 |
1993年 | 21篇 |
1992年 | 12篇 |
1991年 | 14篇 |
1990年 | 4篇 |
1989年 | 8篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 1篇 |
1984年 | 1篇 |
1982年 | 1篇 |
1980年 | 2篇 |
排序方式: 共有4079条查询结果,搜索用时 15 毫秒
91.
92.
一种基于身份的多信任域网格认证模型 总被引:16,自引:0,他引:16
分析了现有的网格认证框架中存在的问题,提出了一种基于身份的多信任域网格认证模型.该模型以基于身份的PKI为基础,避免了基于传统PKI的认证框架的诸多缺点.同时,该模型提供了跨信任域的双向实体认证功能.模拟试验表明,该认证模型比基于传统PKI的认证框架更轻量、更高效.而且由于该模型可以在多信任域的环境下工作,故而比W Mao提出的只能在单一信任域中工作的认证框架更符合网格认证的实际需要. 相似文献
93.
The Public key encryption scheme with keyword search (PEKS), firstly put forward by Boneh et al., can achieve the keyword searching without revealing any information of the initial data. However, the original PEKS scheme was required to construct a secure channel, which was usually expensive. Aimed at resolving this problem, Baek et al. put forward an improved scheme, which tried to construct a Secure channel free PEKS (SCF-PEKS). Subsequently, several SCF-PEKS schemes were proposed, however most of them turned out only secure in the random oracle model, which possibly lead to the construction of insecure schemes. Therefore, Fang et al. put forward an enhanced SCF-PEKS construction, which was provably secure in the standard model, however this construction needed a strong and complicated assumption. Then Yang et al. put forward an SCF-PEKS construction under simple assumption, but their construction had a big reduction in efficiency. In this article, we propose an SCF-PEKS construction, which is provably secure under the same assumption as that of Yang et al.'s scheme, however, with better performance. Then we give its full security proof, along with the performance analysis. Finally, we improve the SCF-PEKS construction to resist Keyword guessing attack (KGA) and give its security demonstration. 相似文献
94.
《Physics letters. A》2020,384(16):126322
Quantum key distribution (QKD) is a promising application to establish unconditional secure communications by quantum mechanics. However, its widespread application still faces a great challenge, that is, the fundamental linear key-rate constraint called Pirandola-Laurenza-Ottaviani-Banchi (PLOB) bound. Recently, twin-field QKD (TF-QKD) was proposed (Lucamarini et al., 2018 [4]), it overcomes the constraint mentioned above. However, the original TF-QKD is based on the phase-encoding strategy, which requires active alignment. In this paper, we improve the original TF-QKD with the photon orbital angular momentum (OAM), and propose a novel reference frame independent protocol to overcome the reference frame dependence. No more alignment procedure is needed, and the intrinsic misalignment errors are eliminated by utilizing the rotation-invariance of OAM photons. Besides, the security performance is also improved. 相似文献
95.
《Physics letters. A》2020,384(2):126061
In this paper, we proposed an unidimensional continuous-variable quantum key distribution (CV-QKD) protocol with discrete modulation, which waives the necessity in one of the quadrature modulations and further simplified the implementation of the CV-QKD protocol. On the basis of the Heisenberg uncertainty relation, we analyze the boundary between the unphysical and physical region. Besides, we utilize a novel proof approach to achieve a lower bound valid of transmission distance. This scheme shows an available method to further simplified the implementation of the QKD. 相似文献
96.
We introduce a quantum key distribution protocol using mean multi-kings’ problem. Using this protocol, a sender can share a bit sequence as a secret key with receivers. We consider a relation between information gain by an eavesdropper and disturbance contained in legitimate users’ information. In BB84 protocol, such relation is known as the so-called information disturbance theorem. We focus on a setting that the sender and two receivers try to share bit sequences and the eavesdropper tries to extract information by interacting legitimate users’ systems and an ancilla system. We derive trade-off inequalities between distinguishability of quantum states corresponding to the bit sequence for the eavesdropper and error probability of the bit sequence shared with the legitimate users. Our inequalities show that eavesdropper’s extracting information regarding the secret keys inevitably induces disturbing the states and increasing the error probability. 相似文献
97.
Andrei Gaidash Anton Kozubov Svetlana Medvedeva George Miroshnichenko 《Entropy (Basel, Switzerland)》2020,22(12)
In this paper, we consider the influence of a divergence of polarization of a quantum signal transmitted through an optical fiber channel on the quantum bit error rate of the subcarrier wave quantum key distribution protocol. Firstly, we investigate the dependence of the optical power of the signal on the modulation indices’ difference after the second phase modulation of the signal. Then we consider the Liouville equation with regard to relaxation in order to develop expressions of the dynamics of the Stokes parameters. As a result, we propose a model that describes quantum bit error rate for the subcarrier wave quantum key distribution depending on the characteristics of the optical fiber. Finally, we propose several methods for minimizing quantum bit error rate. 相似文献
98.
In this paper, we propose an improved physical layer key generation scheme that can maximize the secret key capacity by deploying intelligent reflecting surface (IRS) near the legitimate user aiming at improving its signal-to-noise ratio (SNR). We consider the scenario of multiple input single output (MISO) against multiple relevant eavesdroppers. We elaborately design and optimize the reflection coefficient matrix of IRS elements that can improve the legitimate user’s SNR through IRS passive beamforming and deteriorate the channel quality of eavesdroppers at the same time. We first derive the lower bound expression of the achievable key capacity, then solve the optimization problem based on semi-definite relaxation (SDR) and the convex–concave procedure (CCP) to maximize the secret key capacity. Simulation results show that our proposed scheme can significantly improve the secret key capacity and reduce hardware costs compared with other benchmark schemes. 相似文献
99.
100.