全文获取类型
收费全文 | 1817篇 |
免费 | 303篇 |
国内免费 | 181篇 |
专业分类
化学 | 445篇 |
晶体学 | 5篇 |
力学 | 119篇 |
综合类 | 45篇 |
数学 | 1030篇 |
物理学 | 657篇 |
出版年
2024年 | 3篇 |
2023年 | 29篇 |
2022年 | 35篇 |
2021年 | 37篇 |
2020年 | 56篇 |
2019年 | 54篇 |
2018年 | 52篇 |
2017年 | 70篇 |
2016年 | 73篇 |
2015年 | 59篇 |
2014年 | 100篇 |
2013年 | 169篇 |
2012年 | 96篇 |
2011年 | 103篇 |
2010年 | 90篇 |
2009年 | 111篇 |
2008年 | 90篇 |
2007年 | 112篇 |
2006年 | 115篇 |
2005年 | 114篇 |
2004年 | 76篇 |
2003年 | 88篇 |
2002年 | 85篇 |
2001年 | 71篇 |
2000年 | 67篇 |
1999年 | 65篇 |
1998年 | 57篇 |
1997年 | 48篇 |
1996年 | 34篇 |
1995年 | 26篇 |
1994年 | 13篇 |
1993年 | 15篇 |
1992年 | 14篇 |
1991年 | 6篇 |
1990年 | 9篇 |
1989年 | 11篇 |
1988年 | 5篇 |
1987年 | 6篇 |
1986年 | 4篇 |
1985年 | 7篇 |
1984年 | 7篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1981年 | 4篇 |
1980年 | 4篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1975年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有2301条查询结果,搜索用时 15 毫秒
11.
In this paper, the impact of optical beat noise on the performance of optical fast frequency-hopping code-division multiple-access (FFH OCDMA) networks is analyzed. BCH/FFH-OCDMA to reduce the impact of optical beat noise is proposed. It is shown that, BCH/FFH-OCDMA has much better performance under the same bit rate, same chip time and same number of available wavelengths. Another advantage for BCH/FFH-OCDMA is that the code length of one-coincidence sequence will be shorter, which can greatly reduce the difficulty of fabrication for fiber gratings. 相似文献
12.
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. 相似文献
13.
对具有消息恢复的数字签名方案提出了两种攻击方法.此外,对原方案进行了改进,通过对改进方案的安全性分析得出结论:改进方案比原方案更安全,并且消息恢复过程只需要计算一次大数模幂乘和两次单向函数. 相似文献
14.
A cube factorization of the complete graph on n vertices, Kn, is a 3‐factorization of Kn in which the components of each factor are cubes. We show that there exists a cube factorization of Kn if and only if n ≡ 16 (mod 24), thus providing a new family of uniform 3‐factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. © 2004 Wiley Periodicals, Inc. 相似文献
15.
The dependence of emission direction of fast electrons on the laser intensity has been investigated. The experimental results show that, at nonrelativistic laser intensities, the emission of fast electrons is mainly in the polarization plane. With the increase of the laser intensity, fast electrons emit towards the laser propagation direction from laser polarization direction. At relativistic laser intensities, fast electrons move away from the laser polarization plane, closely to the reflection direction of the incident laser beam. 相似文献
16.
17.
G. R. Everest A. J. van der Poorten 《Proceedings of the American Mathematical Society》1997,125(5):1293-1298
We study factorisation in the ring of exponential polynomials and provide a proof of Ritt's factorisation theorem in modern notation and so generalised as to deal with polynomial coefficients as well as with several variables. We do this in the more general context of a group ring of a divisible torsion-free ordered abelian group over a unique factorisation domain.
18.
Lina Hemmingsson 《Numerical Algorithms》1994,7(2):375-389
In this report we consider block-tridiagonal systems with Toeplitz blocks. Each block is of sizen×n consisting ofn
c×n
c matrices as entries, and there arem×m blocks in the system. The solution of those systems consists of 2n
c
m modified sine transforms and an intermediate solution ofn block-tridiagonal systems. Symmetries in the data vectors are exploited such that one modified sine transform can be computed in terms of one Fourier transform of half the length of the original one, hence requiringO(2.5nlog2
n) operations. Similarly, we only have to solve (n+1)/2 of the intermediate systems due to symmetry.This work was supported by the Swedish National Board for Industrial and Technical Development, NUTEK, under contract No. 89-02539 P. 相似文献
19.
We describe high order numerical algorithms for the solution of second order elliptic equations in rectangular domains. These
algorithms are based on the Fourier method in combination with a subtraction procedure. The singularities at the corner points,
arising due to non-smoothness of the boundaries, are treated explicitly using properly constructed singular corner functions.
The present algorithm is a generalization of the Fast Poisson Solver developed in our previous paper.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献
20.
Popularized by Zassenhaus in the seventies, several algorithms for factoring polynomials use a so-called lifting and recombination scheme. Concerning bivariate polynomials, we present a new algorithm for the recombination stage that requires a lifting up to precision twice the total degree of the polynomial to be factored. Its cost is dominated by the computation of reduced echelon solution bases of linear systems. We show that our bound on precision is asymptotically optimal.