全文获取类型
收费全文 | 1503篇 |
免费 | 194篇 |
国内免费 | 60篇 |
专业分类
化学 | 115篇 |
力学 | 76篇 |
综合类 | 47篇 |
数学 | 953篇 |
物理学 | 566篇 |
出版年
2024年 | 6篇 |
2023年 | 39篇 |
2022年 | 74篇 |
2021年 | 85篇 |
2020年 | 86篇 |
2019年 | 54篇 |
2018年 | 47篇 |
2017年 | 55篇 |
2016年 | 63篇 |
2015年 | 32篇 |
2014年 | 77篇 |
2013年 | 156篇 |
2012年 | 48篇 |
2011年 | 72篇 |
2010年 | 46篇 |
2009年 | 91篇 |
2008年 | 104篇 |
2007年 | 92篇 |
2006年 | 87篇 |
2005年 | 67篇 |
2004年 | 71篇 |
2003年 | 35篇 |
2002年 | 40篇 |
2001年 | 46篇 |
2000年 | 28篇 |
1999年 | 39篇 |
1998年 | 26篇 |
1997年 | 17篇 |
1996年 | 14篇 |
1995年 | 10篇 |
1994年 | 11篇 |
1993年 | 8篇 |
1992年 | 2篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1988年 | 5篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1971年 | 2篇 |
1969年 | 1篇 |
1959年 | 2篇 |
排序方式: 共有1757条查询结果,搜索用时 296 毫秒
1.
2.
介绍了光码分多址系统中常用地址码(一维扩时码、二维码和三维码)的特点,并对它们各自的互相关均值和方差进行了理论分析。基于非相干光码分多址系统中光学相关接收机的基本原理,结合不同的用户地址码,对系统误码率性能进行了分析,得到了接收机最佳判决阈值与地址码基本特性参数和系统同时用户数间的关系。最后,给出了数值仿真结果。结果表明,对于采用特定地址码的光码分多址系统,只有选择合适的接收机判决阈值,系统的误码率性能才能达到最佳。研究结果对光码分多址系统中接收机判决阈值的选取具有一定的参考作用。 相似文献
3.
YIN JIANXING 《高校应用数学学报(英文版)》1994,(4)
PACKINGPAIRSBYQUINTUPLES:THECASEOFZEROCONGRUENCEMOD4YINJIANXINGAbstract:LetD(v)denotethemaximumnumberofquintuplesofav-setofpo... 相似文献
4.
研制出了用于计算氚投料量在FEB聚变堆各个子系统中的分布及其随时间变化的数值模拟程序包SWITRIM。通过近5年的使用,表明其运行良好、计算结果可靠。用SWITRIM数值模拟研究了聚变堆起动过程中的“氚坑深度和氚坑时间”新现象。简单介绍了SWITRIM程序包的组成和用户使用说明以及最新的运用等。 相似文献
5.
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. 相似文献
6.
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. 相似文献
7.
Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by Pm and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let Cn denote the cycle with n vertices. Then Pm(C4×T)=∏(2+α2), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C4×T) is always a square or double a square.2. Let T be a tree. Then Pm(P4×T)=∏(1+3α2+α4), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P3×T)=∏(2+α2), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C4×T)=[Pm(P3×T)]2. 相似文献
8.
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. 相似文献
9.
本文中对一个斜群环为Dubrovin赋值环给出了一系列等价刻画,并且刻画了一个Dubrovin赋值斜群环的所有素理想. 相似文献
10.
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. 相似文献