全文获取类型
收费全文 | 1318篇 |
免费 | 181篇 |
国内免费 | 57篇 |
专业分类
化学 | 126篇 |
力学 | 71篇 |
综合类 | 41篇 |
数学 | 790篇 |
物理学 | 528篇 |
出版年
2024年 | 2篇 |
2023年 | 28篇 |
2022年 | 42篇 |
2021年 | 47篇 |
2020年 | 65篇 |
2019年 | 46篇 |
2018年 | 46篇 |
2017年 | 49篇 |
2016年 | 55篇 |
2015年 | 30篇 |
2014年 | 78篇 |
2013年 | 100篇 |
2012年 | 49篇 |
2011年 | 66篇 |
2010年 | 49篇 |
2009年 | 87篇 |
2008年 | 101篇 |
2007年 | 88篇 |
2006年 | 86篇 |
2005年 | 65篇 |
2004年 | 69篇 |
2003年 | 36篇 |
2002年 | 41篇 |
2001年 | 49篇 |
2000年 | 27篇 |
1999年 | 38篇 |
1998年 | 28篇 |
1997年 | 20篇 |
1996年 | 12篇 |
1995年 | 11篇 |
1994年 | 11篇 |
1993年 | 6篇 |
1992年 | 2篇 |
1991年 | 4篇 |
1990年 | 6篇 |
1989年 | 3篇 |
1988年 | 5篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1983年 | 1篇 |
1971年 | 2篇 |
1969年 | 1篇 |
排序方式: 共有1556条查询结果,搜索用时 15 毫秒
81.
82.
Optical orthogonal codes (1D constant‐weight OOCs or 1D CWOOCs) were first introduced by Salehi as signature sequences to facilitate multiple access in optical fibre networks. In fiber optic communications, a principal drawback of 1D CWOOCs is that large bandwidth expansion is required if a big number of codewords is needed. To overcome this problem, a two‐dimensional (2D) (constant‐weight) coding was introduced. Many optimal 2D CWOOCs were obtained recently. A 2D CWOOC can only support a single QoS (quality of service) class. A 2D variable‐weight OOC (2D VWOOC) was introduced to meet multiple QoS requirements. A 2D VWOOC is a set of 0, 1 matrices with variable weight, good auto, and cross‐correlations. Little is known on the construction of optimal 2D VWOOCs. In this paper, new upper bound on the size of a 2D VWOOC is obtained, and several new infinite classes of optimal 2D VWOOCs are obtained. 相似文献
83.
This note gives a counterexample of Theorem 20 in the paper of Blackford (2013) [2]. The counterexample shows that [2, Theorem 20] is incorrect. Furthermore, we provide corrections to the above result. 相似文献
84.
85.
为支持高速多址网络中二维图像的传输,Kitayama首次提出码分多址并行图像传输系统的概念.作为码分多址并行图像传输系统的首选光地址码,光正交签名码(OOSPC)是一族具有良好相关性的Hamming重量为k的m×n(0,1)-矩阵.用Θ(m,n,k,λ)表示所有参数为(m,n,k,λ)的OOSPC中码字容量可能的最大值,则称码字容量为Θ(m,n,k,λ)的(m,n,k,λ)-OOSPC是最优的.本文将针对满足下列条件之一的正整数m和n:(1)mn≡8,16(mod 24),gcd(m,n,2)=2,且mn≡16(mod 32)和gcd(m,n,4)=2不同时成立,其中m和n的所有奇素因子均模6余1;(2)mn≡0(mod 24)且gcd(m,n,6)=2,证明Θ(m,n,4,1)=|mn-1/12|,即构造码字容量为|mn-1/12|的最优(m,n,4,1)-OOSPC. 相似文献
86.
利用特征投影分解(POD)方法建立二维双曲型方程的一种基于POD方法的含有很少自由度但具有足够高精度的降阶有限差分外推迭代格式,给出其基于POD方法的降阶有限差分解的误差估计及基于POD方法的降阶有限差分外推迭代格式的算法实现.用一个数值例子去说明数值计算结果与理论结果相吻合.进一步说明这种基于POD方法的降阶有限差分外推迭代格式对于求解二维双曲方程是可行和有效的. 相似文献
87.
为实现信号在空间的分集, 关于格的空时分组码的设计近年来备受关注.通过研究与对角的格空时码相关的$\mathbb{Z}[\zeta_{m}]$上的一类二次不可约多项式的判别式$|\Delta|$,确定了$\mathbb{Z}[\zeta_{m}]$上的格空时编码的正规分集乘积的大小.进而, 利用Pell方程的解的性质, 构造性地证明了$m=5, 8, 10, 12$时,$|\Delta|$的值可以任意小. 最后,提出几个关于$\mathbb{Z}[\zeta_{m}]$上的二次不可约和三次不可约多项式的判别式大小的猜想. 相似文献
88.
This paper is devoted to constructing an authentication code with arbitration using subspaces of vector spaces over finite fields.Moreover,if we choose the encoding rules of the transmitter and the decoding rules of the receiver according to a uniform probability distribution,then some parameters and the probabilities of successful attacks are computed. 相似文献
89.
Mikhail Elyashberg Kirill Blinov Yegor Smurnyy Tatiana Churanova Antony Williams 《Magnetic resonance in chemistry : MRC》2010,48(3):219-229
The accuracy of 13C chemical shift prediction by both DFT GIAO quantum‐mechanical (QM) and empirical methods was compared using 205 structures for which experimental and QM‐calculated chemical shifts were published in the literature. For these structures, 13C chemical shifts were calculated using HOSE code and neural network (NN) algorithms developed within our laboratory. In total, 2531 chemical shifts were analyzed and statistically processed. It has been shown that, in general, QM methods are capable of providing similar but inferior accuracy to the empirical approaches, but quite frequently they give larger mean average error values. For the structural set examined in this work, the following mean absolute errors (MAEs) were found: MAE(HOSE) = 1.58 ppm, MAE(NN) = 1.91 ppm and MAE(QM) = 3.29 ppm. A strategy of combined application of both the empirical and DFT GIAO approaches is suggested. The strategy could provide a synergistic effect if the advantages intrinsic to each method are exploited. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
90.
The problem of finding dominators in a directed graph has many important applications, notably in global optimization of computer code. Although linear and near-linear-time algorithms exist, they use sophisticated data structures. We develop an algorithm for finding dominators that uses only a “static tree” disjoint set data structure in addition to simple lists and maps. The algorithm runs in near-linear or linear time, depending on the implementation of the disjoint set data structure. We give several versions of the algorithm, including one that computes loop nesting information (needed in many kinds of global code optimization) and that can be made self-certifying, so that the correctness of the computed dominators is very easy to verify. 相似文献