全文获取类型
收费全文 | 1448篇 |
免费 | 194篇 |
国内免费 | 59篇 |
专业分类
化学 | 105篇 |
力学 | 6篇 |
综合类 | 8篇 |
数学 | 177篇 |
物理学 | 759篇 |
无线电 | 646篇 |
出版年
2024年 | 1篇 |
2023年 | 10篇 |
2022年 | 24篇 |
2021年 | 31篇 |
2020年 | 46篇 |
2019年 | 24篇 |
2018年 | 30篇 |
2017年 | 32篇 |
2016年 | 43篇 |
2015年 | 36篇 |
2014年 | 55篇 |
2013年 | 63篇 |
2012年 | 81篇 |
2011年 | 122篇 |
2010年 | 73篇 |
2009年 | 107篇 |
2008年 | 111篇 |
2007年 | 120篇 |
2006年 | 128篇 |
2005年 | 86篇 |
2004年 | 64篇 |
2003年 | 53篇 |
2002年 | 72篇 |
2001年 | 52篇 |
2000年 | 51篇 |
1999年 | 39篇 |
1998年 | 40篇 |
1997年 | 23篇 |
1996年 | 17篇 |
1995年 | 9篇 |
1994年 | 10篇 |
1993年 | 5篇 |
1992年 | 7篇 |
1991年 | 5篇 |
1990年 | 1篇 |
1989年 | 3篇 |
1988年 | 4篇 |
1987年 | 3篇 |
1986年 | 6篇 |
1985年 | 3篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1974年 | 1篇 |
排序方式: 共有1701条查询结果,搜索用时 750 毫秒
1.
2.
HE Guang-Qiang ZENG Gui-Hua 《理论物理通讯》2006,46(1):61-64
A quantum encryption protocol based on Gaussian-modulated continuous variable EPR correlations is proposed. The security is guaranteed by continuous variable EPR entanglement correlations produced by nondegenerate optical parametric amplifier (NOPA). For general beam splitter eavesdropping strategy, the mutual information I(α, ε) between Alice and Eve is caJculated by employing Shannon information theory. Finally the security analysis is presented. 相似文献
3.
Periodica Mathematica Hungarica - In our paper we study the usage of partially defined Boolean functions (PDBFs) for generating cryptographically strong Boolean functions. A PDBF can be considered... 相似文献
4.
本文证明了周期单元中带有某些硬相互作用的相对论Boltzmann方程初值问题在初值满足质量、能量和熵有限的条件下具有一个整体温和解. 相似文献
5.
Montgomery Multiplication in GF(2k) 总被引:8,自引:0,他引:8
We show that the multiplication operation c=a · b · r-1 in the field GF(2k can be implemented significantly faster in software than the standard multiplication, where r is a special fixed element of the field. This operation is the finite field analogue of the Montgomery multiplication for modular multiplication of integers. We give the bit-level and word-level algorithms for computing the product, perform a thorough performance analysis, and compare the algorithm to the standard multiplication algorithm in GF(2k. The Montgomery multiplication can be used to obtain fast software implementations of the discrete exponentiation operation, and is particularly suitable for cryptographic applications where k is large. 相似文献
6.
Ross Anderson Cunsheng Ding Tor Helleseth Torleiv Klove 《Designs, Codes and Cryptography》1998,15(2):111-124
Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes. 相似文献
7.
In this paper we consider the (t, n)-threshold visual secret sharing scheme (VSSS) in which black pixels in a secret black-white images is reproduced perfectly
as black pixels when we stack arbitrary t shares. This paper provides a new characterization of the (t, n)-threshold visual secret sharing scheme with such a property (hereafter, we call such a VSSS the (t, n)-PBVSSS for short). We use an algebraic method to characterize basis matrices of the (t, n)-PBVSSS in a certain class of matrices. We show that the set of all homogeneous polynomials each element of which yields
basis matrices of the (t, n)-PBVSSS becomes a set of lattice points in an (n−t+1)-dimensional linear space. In addition, we prove that the optimal basis matrices in the sense of maximizing the relative
difference among all the basis matrices in the class coincides with the basis matrices given by Blundo, Bonis and De Santis
[3] for all n≥ t ≥ 2. 相似文献
8.
9.
Chen Hao 《中国科学A辑(英文版)》2006,49(5):715-720
In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(p
m) (any positive integer m) with the period 3n (n and p
m − 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-Imamura
algorithm, we can determine the linear complexity of any sequence over GF(p
m) with the period 3n (n and p
m
− 1 are coprime) more efficiently. 相似文献
10.
S. Zschocke G. Plunien G. Soff 《The European Physical Journal D - Atomic, Molecular, Optical and Plasma Physics》2002,19(2):147-156
The renormalization method of Bogoljubov-Parasiuk-Hepp-Zimmermann (BPHZ) is used in order to derive the renormalized energy
shift due to the gauge invariant K?llén-Sabry diagram of the two-photon vacuum polarization (VPVP) as well as the self energy
vacuum polarization S(VP)E beyond the Uehling approximation. It is outlined, that no outer renormalization is required for
the two-photon vacuum polarization and that only the inner renormalization has to be accomplished. It is shown that the so-called
nongauge invariant spurious term is absent for a wide class of vacuum polarization (VP) diagrams if one applies the widely
used spherical expansion of bound and free-electron propagator. This simplifies significantly calculations in bound state
quantum electrodynamics. As one result of our paper the use of the BPHZ-approach in bound state QED is established.
Received 28 September 2001 相似文献