首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1396篇
  免费   186篇
  国内免费   63篇
化学   18篇
力学   4篇
综合类   39篇
数学   50篇
物理学   402篇
综合类   1132篇
  2025年   11篇
  2024年   29篇
  2023年   19篇
  2022年   63篇
  2021年   54篇
  2020年   37篇
  2019年   35篇
  2018年   28篇
  2017年   68篇
  2016年   39篇
  2015年   44篇
  2014年   94篇
  2013年   73篇
  2012年   83篇
  2011年   99篇
  2010年   75篇
  2009年   74篇
  2008年   94篇
  2007年   98篇
  2006年   86篇
  2005年   120篇
  2004年   70篇
  2003年   58篇
  2002年   31篇
  2001年   33篇
  2000年   14篇
  1999年   21篇
  1998年   20篇
  1997年   18篇
  1996年   4篇
  1995年   12篇
  1994年   12篇
  1993年   9篇
  1992年   4篇
  1991年   4篇
  1990年   2篇
  1989年   4篇
  1988年   2篇
  1986年   2篇
  1985年   1篇
  1973年   1篇
排序方式: 共有1645条查询结果,搜索用时 0 毫秒
1.
Application of homomorphism to secure image sharing   总被引:1,自引:0,他引:1  
In this paper, we present a new approach for sharing images between l players by exploiting the additive and multiplicative homomorphic properties of two well-known public key cryptosystems, i.e. RSA and Paillier. Contrary to the traditional schemes, the proposed approach employs secret sharing in a way that limits the influence of the dealer over the protocol and allows each player to participate with the help of his key-image. With the proposed approach, during the encryption step, each player encrypts his own key-image using the dealer's public key. The dealer encrypts the secret-to-be-shared image with the same public key and then, the l encrypted key-images plus the encrypted to-be shared image are multiplied homomorphically to get another encrypted image. After this step, the dealer can safely get a scrambled image which corresponds to the addition or multiplication of the l + 1 original images (l key-images plus the secret image) because of the additive homomorphic property of the Paillier algorithm or multiplicative homomorphic property of the RSA algorithm. When the l players want to extract the secret image, they do not need to use keys and the dealer has no role. Indeed, with our approach, to extract the secret image, the l players need only to subtract their own key-image with no specific order from the scrambled image. Thus, the proposed approach provides an opportunity to use operators like multiplication on encrypted images for the development of a secure privacy preserving protocol in the image domain. We show that it is still possible to extract a visible version of the secret image with only l-1 key-images (when one key-image is missing) or when the l key-images used for the extraction are different from the l original key-images due to a lossy compression for example. Experimental results and security analysis verify and prove that the proposed approach is secure from cryptographic viewpoint.  相似文献   
2.
应用Hotelling T~2检验评价学生学习成绩的探讨   总被引:1,自引:0,他引:1  
本文简述了HotellingT2检验法,并应用该法对某校学生的学习成绩进行了分析评价,发现其效果较为满意。认为对多变量资料进行分析评价需用HotellingT2检验。  相似文献   
3.
In this paper, an optical encryption system is proposed based on tricolor principle, Fresnel diffraction, and phase iterative algorithms. Different from the traditional encryption system, the encrypted image of this system is a color image and the plaintext of it is a gray image, which can achieve the combination of a color image and a gray image and the conversion of one image to another image. Phase masks can be generated by using the phase iterative algorithms in this paper. The six phase masks and the six diffracting distances are all essential keys in the process of decryption, which can greatly enhance the system security. Numerical simulations are shown to prove the possibility and safety of the method.  相似文献   
4.
A novel optical image encryption scheme is proposed based on quick response code and high dimension chaotic system, where only the intensity distribution of encoded information is recorded as ciphertext. Initially, the quick response code is engendered from the plain image and placed in the input plane of the double random phase encoding architecture. Then, the code is encrypted to the ciphertext with noise-like distribution by using two cascaded gyrator transforms. In the process of encryption, the parameters such as rotation angles and random phase masks are generated as interim variables and functions based on Chen system. A new phase retrieval algorithm is designed to reconstruct the initial quick response code in the process of decryption, in which a priori information such as three position detection patterns is used as the support constraint. The original image can be obtained without any energy loss by scanning the decrypted code with mobile devices. The ciphertext image is the real-valued function which is more convenient for storing and transmitting. Meanwhile, the security of the proposed scheme is enhanced greatly due to high sensitivity of initial values of Chen system. Extensive cryptanalysis and simulation have performed to demonstrate the feasibility and effectiveness of the proposed scheme.  相似文献   
5.
An information hiding method based on the optical interference principle is proposed. In this method, a secret image can be obtained by two light beams' interference. One of the beams is modulated by our assigned host image; and the other is modulated by a noise-like complex distribution, which is regard as the encrypted image. The transmission of the encrypted image can be implemented by hiding it in the host image to prevent the communication from being perceived by unauthorized person. In addition, this method can also realize simultaneous encryption and hiding for two images. A series of numerical simulation results are presented to verify the feasibility of our proposed method.  相似文献   
6.
Statistical physics and information theory is applied to the clinical chemistry measurements present in a patient database containing 2.5 million patients' data over a 20-year period. Despite the seemingly naive approach of aggregating all patients over all times (with respect to particular clinical chemistry measurements), both a diurnal signal in the decay of the time-delayed mutual information and the presence of two sub-populations with differing health are detected. This provides a proof in principle that the highly fragmented data in electronic health records has potential for being useful in defining disease and human phenotypes.  相似文献   
7.
An image encryption algorithm based on chaotic system and deoxyribonucleic acid (DNA) sequence operations is proposed in this paper. First, the plain image is encoded into a DNA matrix, and then a new wave-based permutation scheme is performed on it. The chaotic sequences produced by 2D Logistic chaotic map are employed for row circular permutation (RCP) and column circular permutation (CCP). Initial values and parameters of the chaotic system are calculated by the SHA 256 hash of the plain image and the given values. Then, a row-by-row image diffusion method at DNA level is applied. A key matrix generated from the chaotic map is used to fuse the confused DNA matrix; also the initial values and system parameters of the chaotic system are renewed by the hamming distance of the plain image. Finally, after decoding the diffused DNA matrix, we obtain the cipher image. The DNA encoding/decoding rules of the plain image and the key matrix are determined by the plain image. Experimental results and security analyses both confirm that the proposed algorithm has not only an excellent encryption result but also resists various typical attacks.  相似文献   
8.
This paper introduces sampling representations for discrete signals arising from self adjoint difference operators with mixed boundary conditions. The theory of linear operators on finite-dimensional inner product spaces is employed to study the second-order difference operators. We give necessary and sufficient conditions that make the operators self adjoint. The equivalence between the difference operator and a Hermitian Green's matrix is established. Sampling theorems are derived for discrete transforms associated with the difference operator. The results are exhibited via illustrative examples, involving sampling representations for the discrete Hartley transform. Families of discrete fractional Fourier-type transforms are introduced with an application to image encryption.  相似文献   
9.
When an organisation chooses a system to make regular broadcasts to a changing user base, there is an inevitable trade off between the number of keys a user must store and the number of keys used in the broadcast. The Complete Subtree and Subset Difference Revocation Schemes were proposed as efficient solutions to this problem. However, all measurements of the broadcast size have been in terms of upper bounds on the worst-case. Also, the bound on the latter scheme is only relevant for small numbers of revoked users, despite the fact that both schemes allow any number of such users. Since the broadcast size can be critical for limited memory devices, we aid comparative analysis of these important techniques by establishing the worst-case broadcast size for both revocation schemes.   相似文献   
10.
The first practical identity based encryption (IBE) scheme was published by Boneh and Franklin at Crypto 2001, based on the elliptic curve pairing. Since that time, many other IBE schemes have been published. In this paper, we describe a variant of Boneh-Franklin with a tight reduction in the random oracle model. Our new scheme is quite efficient compared to existing schemes; moreover, upgrading from Boneh-Franklin to our new scheme is straightforward.   相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号