全文获取类型
收费全文 | 2469篇 |
免费 | 266篇 |
国内免费 | 249篇 |
专业分类
化学 | 130篇 |
力学 | 111篇 |
综合类 | 86篇 |
数学 | 2114篇 |
物理学 | 543篇 |
出版年
2024年 | 4篇 |
2023年 | 43篇 |
2022年 | 70篇 |
2021年 | 59篇 |
2020年 | 103篇 |
2019年 | 74篇 |
2018年 | 77篇 |
2017年 | 95篇 |
2016年 | 102篇 |
2015年 | 55篇 |
2014年 | 110篇 |
2013年 | 184篇 |
2012年 | 96篇 |
2011年 | 115篇 |
2010年 | 110篇 |
2009年 | 157篇 |
2008年 | 178篇 |
2007年 | 174篇 |
2006年 | 160篇 |
2005年 | 142篇 |
2004年 | 105篇 |
2003年 | 116篇 |
2002年 | 95篇 |
2001年 | 89篇 |
2000年 | 80篇 |
1999年 | 91篇 |
1998年 | 53篇 |
1997年 | 55篇 |
1996年 | 36篇 |
1995年 | 28篇 |
1994年 | 22篇 |
1993年 | 14篇 |
1992年 | 11篇 |
1991年 | 10篇 |
1990年 | 9篇 |
1989年 | 9篇 |
1988年 | 8篇 |
1986年 | 5篇 |
1985年 | 5篇 |
1984年 | 5篇 |
1983年 | 6篇 |
1982年 | 4篇 |
1981年 | 4篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 5篇 |
1973年 | 1篇 |
1971年 | 2篇 |
1969年 | 1篇 |
排序方式: 共有2984条查询结果,搜索用时 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.
13.
Luke Pebody 《Journal of Combinatorial Theory, Series A》2006,113(3):551-555
Answering a question of Körner and Simonyi, this paper gives a strongly consecutive repeat-free code of maximal size in [b]n. 相似文献
14.
Hai Huyen Dam Hans-Jürgen Zepernick Sven Nordholm Jörgen Nordberg 《Annals of Operations Research》2005,133(1-4):249-264
The performance of a code division multiple access system depends on the correlation properties of the employed spreading
code. Low cross-correlation values between spreading sequences are desired to suppress multiple access interference and to
improve bit error performance. An auto-correlation function with a distinct peak enables proper synchronization and suppresses
intersymbol interference. However, these requirements contradict each other and a trade-off needs to be established. In this
paper, a global two dimensional optimization method is proposed to minimize the out-of-phase average mean-square aperiodic
auto-correlation with average mean-square aperiodic cross-correlation being allowed to lie within a fixed region. This approach
is applied to design sets of complex spreading sequences. A design example is presented to illustrate the relation between
various correlation characteristics. The correlations of the obtained sets are compared with correlations of other known sequences. 相似文献
15.
王梦 《浙江大学学报(理学版)》2003,30(4):361-364
用旋转法结合Fourier估计以及Littlewood-Paley理论给出了乘积空间上带粗糙核的极大奇异积分算子的Lp有界性.证明了对于Ω∈Lq(Sn-1×Sm1),其中q>1,∫ sn-1Ω(x',y')dx'=0, y'∈Sm-1,∫ sm-1Ω(x',y')dy'=0, x'∈Sn-1,且b,h∈L∞(R1+),则积域上极大奇异积分算子T*(f)=supε1>0,ε2>0∫∫|u|>ε1|v|>ε2b(|u|)h (|v|)Ω(u',v')/|v|n|v|mf(x-u,y-v)dudv为Lp(Rn×Rm)有界,其中1<p<∞.从而改进了以往的结果. 相似文献
16.
Monique Laurent 《Mathematical Programming》2007,109(2-3):239-261
We give a hierarchy of semidefinite upper bounds for the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. At any fixed stage in the hierarchy, the bound can be computed (to an arbitrary precision) in time polynomial in n; this is based on a result of de Klerk et al. (Math Program, 2006) about the regular ∗-representation for matrix ∗-algebras.
The Delsarte bound for A(n,d) is the first bound in the hierarchy, and the new bound of Schrijver (IEEE Trans. Inform. Theory 51:2859–2866, 2005) is located
between the first and second bounds in the hierarchy. While computing the second bound involves a semidefinite program with
O(n
7) variables and thus seems out of reach for interesting values of n, Schrijver’s bound can be computed via a semidefinite program of size O(n
3), a result which uses the explicit block-diagonalization of the Terwilliger algebra. We propose two strengthenings of Schrijver’s
bound with the same computational complexity.
Supported by the Netherlands Organisation for Scientific Research grant NWO 639.032.203. 相似文献
17.
Yen-Shung TSAI 《中国科学A辑(英文版)》2007,50(7):1026-1034
By means of further investigation of solid codes,the problem“Is every fd-domain uni- formly dense”proposed by Yuqi Guo,C.M.Reis and G.Thierrin in 1988 is solved in this paper. 相似文献
18.
本文给出Om×GLn作用于Cm,n上的复多项式环上的最高权向量环的Krull维数公式,从而改正了Aslaksen,Tan及Zhu的一个错误. 相似文献
19.
胡长松 《应用泛函分析学报》2007,9(2):153-157
设E是Banach空间,T∶E→2E*是极大单调算子,T-10≠ф.令x0∈E,yn=(J λnT)-1xn en,xn 1=J-1(αnJxn (1-αn)Jyn),n0,λn>0,αn∈[0,1],文章研究了{xn}收敛性. 相似文献
20.
Masaaki Harada 《Designs, Codes and Cryptography》2006,38(1):5-16
In this paper, we show that the code generated by the rows of a block-point incidence matrix of a self-orthogonal 3-(56,12,65)
design is a doubly-even self-dual code of length 56. As a consequence, it is shown that an extremal doubly-even self-dual
code of length 56 is generated by the codewords of minimum weight. We also demonstrate that there are more than one thousand
inequivalent extremal doubly-even self-dual [56,28,12] codes. This result shows that there are more than one thousand non-isomorphic
self-orthogonal 3-(56,12,65) designs.
AMS Classification: 94B05, 05B05 相似文献