全文获取类型
收费全文 | 321篇 |
免费 | 95篇 |
国内免费 | 1篇 |
专业分类
化学 | 9篇 |
力学 | 1篇 |
综合类 | 12篇 |
数学 | 47篇 |
物理学 | 348篇 |
出版年
2024年 | 2篇 |
2023年 | 4篇 |
2022年 | 22篇 |
2021年 | 28篇 |
2020年 | 17篇 |
2019年 | 6篇 |
2018年 | 3篇 |
2017年 | 32篇 |
2016年 | 14篇 |
2015年 | 17篇 |
2014年 | 39篇 |
2013年 | 28篇 |
2012年 | 22篇 |
2011年 | 31篇 |
2010年 | 23篇 |
2009年 | 24篇 |
2008年 | 25篇 |
2007年 | 16篇 |
2006年 | 13篇 |
2005年 | 13篇 |
2004年 | 9篇 |
2003年 | 10篇 |
2002年 | 2篇 |
2001年 | 4篇 |
2000年 | 1篇 |
1999年 | 1篇 |
1998年 | 6篇 |
1997年 | 4篇 |
1992年 | 1篇 |
排序方式: 共有417条查询结果,搜索用时 15 毫秒
341.
Fangfang Zhang 《中国物理 B》2023,32(1):10502-010502
With the development of smart grid, operation and control of a power system can be realized through the power communication network, especially the power production and enterprise management business involve a large amount of sensitive information, and the requirements for data security and real-time transmission are gradually improved. In this paper, a new 9-dimensional (9D) complex chaotic system with quaternion is proposed for the encryption of smart grid data. Firstly, we present the mathematical model of the system, and analyze its attractors, bifurcation diagram, complexity, and 0-1 test. Secondly, the pseudo-random sequences are generated by the new chaotic system to encrypt power data. Finally, the proposed encryption algorithm is verified with power data and images in the smart grid, which can ensure the encryption security and real time. The verification results show that the proposed encryption scheme is technically feasible and available for power data and image encryption in smart grid. 相似文献
342.
For a class of discrete-time high-order switched neural networks with time-varying delays, the global exponential synchronization (GES) problem and its application in audio encryption are addressed. In this work, the state feedback controllers are designed to ensure the GES of response and drive systems, and the controller gains are directly computed by the network parameters. Then, a numerical example is presented to explain the correctness of the synchronization theory. Moreover, a technique to audio encryption/decryption is proposed, and it is applied to a practical example to verify the applicability of the technique. The advantages of this paper are as follows: (i) GES criterion containing a group of simple matrix inequalities is established without the construction of a Lyapunov–Krasovskii functional (LKF), which is not always obvious; (ii) the controller gains are directly represented by the parameters in the network, and then it is easy to apply them to the audio encryption. 相似文献
343.
Hybrid projective synchronization of complex Duffing–Holmes oscillators with application to image encryption
下载免费PDF全文
![点击此处可从《Mathematical Methods in the Applied Sciences》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Deng Wei Xingyuan Wang Jialin Hou Ping Liu 《Mathematical Methods in the Applied Sciences》2017,40(12):4259-4271
Many works on hybrid projective synchronization (or simply ‘HPS’ for short) of nonlinear real dynamic systems have been performed, while the HPS of chaotic complex systems and its application have not been extensively studied. In this paper, the HPS of complex Duffing–Holmes oscillators with known and unknown parameters is separately investigated via nonlinear control. The adaptive control methods and explicit expressions are derived for controllers and parameters estimation law, which are respectively used to achieve HPS. These expressions on controllers are tested numerically, which are in excellent agreement with theory analysis. The proposed synchronization scheme is applied to image encryption with exclusive or (or simply ‘XOR’ for short). The related security analysis shows the high security of the encryption scheme. Concerning the complex Duffing–Holmes oscillator, we also discuss its chaotic properties via the maximum Lyapunov exponent. Copyright © 2017 John Wiley & Sons, Ltd. 相似文献
344.
Multimedia wireless communications have rapidly developed over the years. Accordingly, an increasing demand for more secured media transmission is required to protect multimedia contents. Image encryption schemes have been proposed over the years, but the most secure and reliable schemes are those based on chaotic maps, due to the intrinsic features in such kinds of multimedia contents regarding the pixels’ high correlation and data handling capabilities. The novel proposed encryption algorithm introduced in this article is based on a 3D hopping chaotic map instead of fixed chaotic logistic maps. The non-linearity behavior of the proposed algorithm, in terms of both position permutation and value transformation, results in a more secured encryption algorithm due to its non-convergence, non-periodicity, and sensitivity to the applied initial conditions. Several statistical and analytical tests such as entropy, correlation, key sensitivity, key space, peak signal-to-noise ratio, noise attacks, number of pixels changing rate (NPCR), unified average change intensity randomness (UACI), and others tests were applied to measure the strength of the proposed encryption scheme. The obtained results prove that the proposed scheme is very robust against different cryptography attacks compared to similar encryption schemes. 相似文献
345.
Fractal sorting vector-based least significant bit chaotic permutation for image encryption
下载免费PDF全文
![点击此处可从《中国物理 B》网站下载免费的PDF全文](/ch/ext_images/free.gif)
《中国物理 B》2021,30(6):60508-060508
The image's least significant bit(LSB) covers lots of the details that have been commonly used in image encryption analysis. The newly proposed fractal sorting vector(FSV) and FSV-based LSB chaotic permutation(FSV-LSBCP) is a novel chaotic image encryption cryptosystem introduced in this article. The FSV-LSBCP effectively strengthens the security of the cryptographic scheme concerning the properties of the FSV. Key analysis, statistical analysis, resistance differential attack analysis, and resistance to cropping attacks and noise attacks are the focus of the suggested image encryption cryptosystem. The security experiment shows that the cryptosystem is adequate to achieve the desired degree of security. 相似文献
346.
Universal quantum circuit evaluation on encrypted data using probabilistic quantum homomorphic encryption scheme
下载免费PDF全文
![点击此处可从《中国物理 B》网站下载免费的PDF全文](/ch/ext_images/free.gif)
《中国物理 B》2021,30(7):70309-070309
Homomorphic encryption has giant advantages in the protection of privacy information. In this paper, we present a new kind of probabilistic quantum homomorphic encryption scheme for the universal quantum circuit evaluation. Firstly,the pre-shared non-maximally entangled states are utilized as auxiliary resources, which lower the requirements of the quantum channel, to correct the errors in non-Clifford gate evaluation. By using the set synthesized by Clifford gates and T gates, it is feasible to perform the arbitrary quantum computation on the encrypted data. Secondly, our scheme is different from the previous scheme described by the quantum homomorphic encryption algorithm. From the perspective of application, a two-party probabilistic quantum homomorphic encryption scheme is proposed. It is clear what the computation and operation that the client and the server need to perform respectively, as well as the permission to access the data. Finally, the security of probabilistic quantum homomorphic encryption scheme is analyzed in detail. It demonstrates that the scheme has favorable security in three aspects, including privacy data, evaluated data and encryption and decryption keys. 相似文献
347.
为了研究针对联合图像专家小组压缩标准(joint photographic experts group,JPEG)彩色图像特点的加密算法,综合选择加密和在编码过程中加密两种思路,提出了一种空域和频域结合的加密算法. 首先在空域对8×8分块进行扩散置乱,然后利用边缘检测手段找出包含细节信息较多的重要分块,先加密所有分块中的直流(direct current,DC)系数,再选择重要分块中的一部分交流(alternating current,AC)系数进行加密,最后将分块重要性标记信息嵌入AC系数中进行传输. 通过理论分析和大量实验证明,算法格式兼容,密文图像视觉效果好、色彩分布均匀;算法密钥空间大,密钥敏感性强,安全性良好.
关键词:
JPEG彩色图像
边缘检测
选择加密
结合编码加密 相似文献
348.
349.
350.
Motivated by a scheduling problem in multicast environments, we consider the problem of arranging a weighted graph around a circle so as to minimize the total weighted arc length. We describe the first polynomial-time approximation algorithms for this problem, and specifically an O(logn)-approximation algorithm for undirected circular arrangements and an
-approximation algorithm for directed circular arrangements. We will also conduct an experimental evaluation of our algorithms and show that a simple heuristic has the best performance in simulations based on busy Web server logs. 相似文献