全文获取类型
收费全文 | 1454篇 |
免费 | 52篇 |
国内免费 | 61篇 |
专业分类
化学 | 196篇 |
晶体学 | 6篇 |
力学 | 17篇 |
综合类 | 18篇 |
数学 | 1102篇 |
物理学 | 228篇 |
出版年
2024年 | 1篇 |
2023年 | 58篇 |
2022年 | 52篇 |
2021年 | 66篇 |
2020年 | 77篇 |
2019年 | 38篇 |
2018年 | 39篇 |
2017年 | 41篇 |
2016年 | 43篇 |
2015年 | 25篇 |
2014年 | 51篇 |
2013年 | 97篇 |
2012年 | 23篇 |
2011年 | 59篇 |
2010年 | 51篇 |
2009年 | 91篇 |
2008年 | 102篇 |
2007年 | 78篇 |
2006年 | 78篇 |
2005年 | 48篇 |
2004年 | 51篇 |
2003年 | 54篇 |
2002年 | 66篇 |
2001年 | 48篇 |
2000年 | 36篇 |
1999年 | 65篇 |
1998年 | 31篇 |
1997年 | 30篇 |
1996年 | 17篇 |
1995年 | 12篇 |
1994年 | 5篇 |
1993年 | 4篇 |
1992年 | 6篇 |
1991年 | 4篇 |
1990年 | 1篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 5篇 |
1979年 | 1篇 |
1977年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有1567条查询结果,搜索用时 15 毫秒
11.
ZhenFengZHANG 《数学学报(英文版)》2005,21(1):155-168
In this paper, we extend a classical result of Hua to arithmetic progressions with large moduli. The result implies the Linnik Theorem on the least prime in an arithmetic progression. 相似文献
12.
采用热重分析 (TGA)、傅立叶红外光分析 (FTIR)和磁头起飞降落 (CSS)等试验方法 ,研究了硬盘磁头 碟界面润滑层PFPE的失效机理以及添加剂X 1P在磁头 碟界面润滑剂中的作用 .研究结果表明 ,高温条件下磁头材料Al2 O3 会诱导磁头 碟界面润滑剂PFPE发生歧化降解 ,造成磁头 碟界面润滑层失效 ;添加剂X 1P因其特殊的分子结构和化学性能 ,可作为一种有效稳定剂添加到磁头 碟润滑剂PFPE中 ,减弱磁头材料Al2 O3 作为催化反应中心的催化反应活性 ,减缓磁头 碟界面润滑剂PFPE的高温歧化降解 ,改善磁头 碟界面的CSS性能 相似文献
13.
We give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants. 相似文献
14.
Zhao Fang BAI Jin Chuan HOU 《数学学报(英文版)》2005,21(5):1167-1182
Let X be a (real or complex) Banach space with dimension greater than 2 and let B0(X) be the subspace of B(X) spanned by all nilpotent operators on X. We get a complete classification of surjective additive maps Ф on B0(X) which preserve nilpotent operators in both directions. In particular, if X is infinite-dimensional, we prove that Ф has the form either Ф(T) = cATA^-1 or Ф(T) = cAT'A^-1, where A is an invertible bounded linear or conjugate linear operator, c is a scalar, T' denotes the adjoint of T. As an application of these results, we show that every additive surjective map on B(X) preserving spectral radius has a similar form to the above with |c| = 1. 相似文献
15.
Tsonka Stefanova Baicheva 《Designs, Codes and Cryptography》1998,13(3):223-227
The covering radius of all ternary cyclic codes of length up to 25 is given. Some of the results were obtained by computer
and for others mathematical reasonings were applied. The minimal distances of all codes were recalculated. 相似文献
16.
1 Introduction Moderndigitalcommunicationsystemsoftenrequireerror freetransmission .Errorcontrolcodingtechnologyhasbeenusedwidelyincommunicationsystem .Andithasbeenimprovingtheperformanceofcommunicationsystem greatly ,especiallyinwirelesscommunicationss… 相似文献
17.
Fusion-evaporation cross-sections for the α-induced reactions upon197Au,193Ir,191Ir,185Re,181Ta,121Sb and69Ga nuclei at bombarding energies near the Coulomb barrier have been measured by off-line observation of the γ-rays emitted
in the radioactive decay of the residual nuclei using stacked foil technique. The total fusion cross-section for the systems
have been compared with simple statistical model calculations using the code ALICE/91 as well as with the coupled channel
calculations that include the β2 and ν4 slatic deformations and dynamic couplings of the vibrational/rotational states of the target and the projet tile using the
code CCDEF. 相似文献
18.
Recently extremal double circulant self-dual codes have been classified for lengths n ≤ 62. In this paper, a complete classification
of extremal double circulant self-dual codes of lengths 64 to 72 is presented. Almost all of the extremal double circulant
singly-even codes given have weight enumerators for which extremal codes were not previously known to exist. 相似文献
19.
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. 相似文献
20.
In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal
constant composition codes meeting the upper bound given by [13]. 相似文献